--- jsr166/src/jsr166e/ConcurrentHashMapV8.java 2012/08/13 18:49:36 1.56 +++ jsr166/src/jsr166e/ConcurrentHashMapV8.java 2012/09/29 16:01:22 1.63 @@ -47,19 +47,22 @@ import java.io.Serializable; * 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 * collisions (i.e., keys that have distinct hash codes but fall into @@ -537,9 +540,13 @@ public class ConcurrentHashMapV8 * unlocking lock (via a failed CAS from non-waiting LOCKED * state), unlockers acquire the sync lock and perform a * notifyAll. + * + * The initial sanity check on tab and bounds is not currently + * necessary in the only usages of this method, but enables + * use in other future contexts. */ final void tryAwaitLock(Node[] tab, int i) { - if (tab != null && i >= 0 && i < tab.length) { // bounds check + if (tab != null && i >= 0 && i < tab.length) { // sanity check int r = ThreadLocalRandom.current().nextInt(); // randomize spins int spins = MAX_SPINS, h; while (tabAt(tab, i) == this && ((h = hash) & LOCKED) != 0) { @@ -715,8 +722,8 @@ public class ConcurrentHashMapV8 * 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; @@ -776,8 +783,8 @@ 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, Object v) { Class c = k.getClass(); TreeNode pp = root, p = null; int dir = 0; @@ -1204,7 +1211,7 @@ public class ConcurrentHashMapV8 } /* - * Internal versions of the five insertion methods, each a + * Internal versions of the six insertion methods, each a * little more complicated than the last. All have * the same basic structure as the first (internalPut): * 1. If table uninitialized, create @@ -1222,6 +1229,8 @@ public class ConcurrentHashMapV8 * returns from function call. * * compute uses the same function-call mechanics, but without * the prescans + * * merge acts as putIfAbsent in the absent case, but invokes the + * update function if present * * putAll attempts to pre-allocate enough table space * and more lazily performs count updates and checks. * @@ -1545,9 +1554,8 @@ public class ConcurrentHashMapV8 } /** Implementation for compute */ - @SuppressWarnings("unchecked") - private final Object internalCompute(K k, boolean onlyIfPresent, - BiFun mf) { + @SuppressWarnings("unchecked") private final Object internalCompute + (K k, boolean onlyIfPresent, BiFun mf) { int h = spread(k.hashCode()); Object val = null; int delta = 0; @@ -1670,8 +1678,9 @@ public class ConcurrentHashMapV8 return val; } - private final Object internalMerge(K k, V v, - BiFun mf) { + /** Implementation for merge */ + @SuppressWarnings("unchecked") private final Object internalMerge + (K k, V v, BiFun mf) { int h = spread(k.hashCode()); Object val = null; int delta = 0; @@ -2001,7 +2010,7 @@ public class ConcurrentHashMapV8 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 (bin >= 0) { // Unbuffered; no lock needed (or available) if (!casTabAt(tab, i, f, fwd)) continue; } @@ -2177,8 +2186,10 @@ public class ConcurrentHashMapV8 try { if (tabAt(tab, i) == f) { for (Node p = t.first; p != null; p = p.next) { - p.val = null; - --delta; + if (p.val != null) { // (currently always true) + p.val = null; + --delta; + } } t.first = null; t.root = null; @@ -2200,8 +2211,10 @@ public class ConcurrentHashMapV8 try { if (tabAt(tab, i) == f) { for (Node e = f; e != null; e = e.next) { - e.val = null; - --delta; + if (e.val != null) { // (currently always true) + e.val = null; + --delta; + } } setTabAt(tab, i, null); ++i; @@ -2222,7 +2235,7 @@ public class ConcurrentHashMapV8 /** * 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 @@ -2260,9 +2273,11 @@ public class ConcurrentHashMapV8 * 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. + * cases where it is not needed to not worry about it. Because + * ForkJoinTask is Serializable, but iterators need not be, we + * need to add warning suppressions. */ - static class Traverser extends ForkJoinTask { + @SuppressWarnings("serial") static class Traverser extends ForkJoinTask { final ConcurrentHashMapV8 map; Node next; // the next entry to use Node last; // the last entry used @@ -2272,27 +2287,25 @@ public class ConcurrentHashMapV8 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 /** 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; + Traverser(Traverser it) { + ConcurrentHashMapV8 m; Node[] t; + if ((m = this.map = it.map) == null) + t = null; + else if ((t = it.tab) == null && // force parent tab initialization + (t = it.tab = m.table) != null) + it.baseLimit = it.baseSize = t.length; + this.tab = t; 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; + it.baseLimit = this.index = this.baseIndex = + ((this.baseLimit = it.baseLimit) + it.baseIndex + 1) >>> 1; } /** @@ -2306,11 +2319,18 @@ public class ConcurrentHashMapV8 if (e != null) // advance past used/skipped node e = e.next; while (e == null) { // get to next non-null bin + ConcurrentHashMapV8 m; 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)) + 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 == MOVED) { if ((ek = e.key) instanceof TreeBin) e = ((TreeBin)ek).first; else { @@ -2327,7 +2347,7 @@ public class ConcurrentHashMapV8 } public final void remove() { - if (nextVal == null) + if (nextVal == null && last == null) advance(); Node e = last; if (e == null) @@ -2458,13 +2478,13 @@ public class ConcurrentHashMapV8 * instead of {@link #size} because a ConcurrentHashMap 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. + * there are ongoing concurrent insertions or removals. * * @return the number of mappings */ public long mappingCount() { long n = counter.sum(); - return (n < 0L) ? 0L : n; + return (n < 0L) ? 0L : n; // ignore transient negative values } /** @@ -2478,14 +2498,30 @@ public class ConcurrentHashMapV8 * * @throws NullPointerException if the specified key is null */ - @SuppressWarnings("unchecked") - public V get(Object key) { + @SuppressWarnings("unchecked") public V get(Object key) { if (key == null) throw new NullPointerException(); return (V)internalGet(key); } /** + * Returns the value to which the specified key is mapped, + * or the gieven 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 + */ + @SuppressWarnings("unchecked") public V getValueOrDefault(Object key, V defaultValue) { + if (key == null) + throw new NullPointerException(); + V v = (V) internalGet(key); + return v == null ? defaultValue : v; + } + + /** * Tests if the specified object is a key in this table. * * @param key possible key @@ -2554,8 +2590,7 @@ 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) { + @SuppressWarnings("unchecked") public V put(K key, V value) { if (key == null || value == null) throw new NullPointerException(); return (V)internalPut(key, value); @@ -2568,8 +2603,7 @@ 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) { + @SuppressWarnings("unchecked") public V putIfAbsent(K key, V value) { if (key == null || value == null) throw new NullPointerException(); return (V)internalPutIfAbsent(key, value); @@ -2625,8 +2659,8 @@ 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) { + @SuppressWarnings("unchecked") public V computeIfAbsent + (K key, Fun mappingFunction) { if (key == null || mappingFunction == null) throw new NullPointerException(); return (V)internalComputeIfAbsent(key, mappingFunction); @@ -2666,7 +2700,8 @@ 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) { + @SuppressWarnings("unchecked") public V computeIfPresent + (K key, BiFun remappingFunction) { if (key == null || remappingFunction == null) throw new NullPointerException(); return (V)internalCompute(key, true, remappingFunction); @@ -2712,8 +2747,8 @@ 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) { + @SuppressWarnings("unchecked") public V compute + (K key, BiFun remappingFunction) { if (key == null || remappingFunction == null) throw new NullPointerException(); return (V)internalCompute(key, false, remappingFunction); @@ -2744,8 +2779,8 @@ 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) { + @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); @@ -2760,8 +2795,7 @@ 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) { + @SuppressWarnings("unchecked") public V remove(Object key) { if (key == null) throw new NullPointerException(); return (V)internalReplace(key, null, null); @@ -2798,8 +2832,7 @@ 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) { + @SuppressWarnings("unchecked") public V replace(K key, V value) { if (key == null || value == null) throw new NullPointerException(); return (V)internalReplace(key, value, null); @@ -3005,19 +3038,18 @@ 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(Traverser it) { + super(it); } public KeyIterator split() { if (last != null || (next != null && nextVal == null)) throw new IllegalStateException(); - return new KeyIterator(this, true); + return new KeyIterator(this); } - @SuppressWarnings("unchecked") - public final K next() { + @SuppressWarnings("unchecked") public final K next() { if (nextVal == null && advance() == null) throw new NoSuchElementException(); Object k = nextKey; @@ -3028,20 +3060,19 @@ 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(Traverser it) { + super(it); } public ValueIterator split() { if (last != null || (next != null && nextVal == null)) throw new IllegalStateException(); - return new ValueIterator(this, true); + return new ValueIterator(this); } - @SuppressWarnings("unchecked") - public final V next() { + @SuppressWarnings("unchecked") public final V next() { Object v; if ((v = nextVal) == null && (v = advance()) == null) throw new NoSuchElementException(); @@ -3052,20 +3083,19 @@ public class ConcurrentHashMapV8 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(Traverser it) { + super(it); } public EntryIterator split() { if (last != null || (next != null && nextVal == null)) throw new IllegalStateException(); - return new EntryIterator(this, true); + return new EntryIterator(this); } - @SuppressWarnings("unchecked") - public final Map.Entry next() { + @SuppressWarnings("unchecked") public final Map.Entry next() { Object v; if ((v = nextVal) == null && (v = advance()) == null) throw new NoSuchElementException(); @@ -3160,8 +3190,7 @@ public class ConcurrentHashMapV8 return (i == n) ? r : Arrays.copyOf(r, i); } - @SuppressWarnings("unchecked") - public final T[] toArray(T[] a) { + @SuppressWarnings("unchecked") public final T[] toArray(T[] a) { long sz = map.mappingCount(); if (sz > (long)(MAX_ARRAY_SIZE)) throw new OutOfMemoryError(oomeMsg); @@ -3357,8 +3386,7 @@ 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[]) @@ -3382,8 +3410,7 @@ 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 @@ -3656,10 +3683,10 @@ public class ConcurrentHashMapV8 /** * 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. + * 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 @@ -3718,8 +3745,7 @@ public class ConcurrentHashMapV8 * @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. + * of all (key, value) pairs */ public long reduceToLong(ObjectByObjectToLong transformer, long basis, @@ -3774,10 +3800,10 @@ public class ConcurrentHashMapV8 /** * 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. + * 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 @@ -3903,10 +3929,10 @@ public class ConcurrentHashMapV8 /** * 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. + * 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 @@ -4033,10 +4059,10 @@ public class ConcurrentHashMapV8 /** * 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. + * 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 @@ -4161,7 +4187,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); } /** @@ -4182,16 +4208,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 @@ -4203,7 +4228,7 @@ public class ConcurrentHashMapV8 BiFun searchFunction) { if (searchFunction == null) throw new NullPointerException(); return new SearchMappingsTask - (map, searchFunction, + (map, null, -1, searchFunction, new AtomicReference()); } @@ -4226,7 +4251,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceMappingsTask - (map, transformer, reducer); + (map, null, -1, null, transformer, reducer); } /** @@ -4250,7 +4275,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); } /** @@ -4274,7 +4299,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); } /** @@ -4297,7 +4322,7 @@ 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); } /** @@ -4312,7 +4337,7 @@ 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); } /** @@ -4333,16 +4358,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 @@ -4354,7 +4378,7 @@ public class ConcurrentHashMapV8 Fun searchFunction) { if (searchFunction == null) throw new NullPointerException(); return new SearchKeysTask - (map, searchFunction, + (map, null, -1, searchFunction, new AtomicReference()); } @@ -4372,8 +4396,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 @@ -4393,7 +4418,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceKeysTask - (map, transformer, reducer); + (map, null, -1, null, transformer, reducer); } /** @@ -4417,7 +4442,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); } /** @@ -4441,7 +4466,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); } /** @@ -4465,7 +4490,7 @@ 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); } /** @@ -4479,7 +4504,7 @@ 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); } /** @@ -4499,16 +4524,15 @@ 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 @@ -4521,7 +4545,7 @@ public class ConcurrentHashMapV8 Fun searchFunction) { if (searchFunction == null) throw new NullPointerException(); return new SearchValuesTask - (map, searchFunction, + (map, null, -1, searchFunction, new AtomicReference()); } @@ -4539,7 +4563,7 @@ public class ConcurrentHashMapV8 BiFun reducer) { if (reducer == null) throw new NullPointerException(); return new ReduceValuesTask - (map, reducer); + (map, null, -1, null, reducer); } /** @@ -4561,7 +4585,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceValuesTask - (map, transformer, reducer); + (map, null, -1, null, transformer, reducer); } /** @@ -4585,7 +4609,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); } /** @@ -4609,7 +4633,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); } /** @@ -4633,7 +4657,7 @@ 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); } /** @@ -4647,7 +4671,7 @@ 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); } /** @@ -4667,16 +4691,15 @@ 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 @@ -4689,7 +4712,7 @@ public class ConcurrentHashMapV8 Fun, ? extends U> searchFunction) { if (searchFunction == null) throw new NullPointerException(); return new SearchEntriesTask - (map, searchFunction, + (map, null, -1, searchFunction, new AtomicReference()); } @@ -4707,7 +4730,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); } /** @@ -4729,7 +4752,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceEntriesTask - (map, transformer, reducer); + (map, null, -1, null, transformer, reducer); } /** @@ -4753,7 +4776,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); } /** @@ -4777,7 +4800,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); } /** @@ -4801,7 +4824,7 @@ 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); } } @@ -4818,23 +4841,27 @@ public class ConcurrentHashMapV8 * exceptions are handled in a simpler manner, by just trying to * complete root task exceptionally. */ - static abstract class BulkTask extends Traverser { + @SuppressWarnings("serial") static abstract class BulkTask extends Traverser { final BulkTask parent; // completion target - int batch; // split control + int batch; // split control; -1 for unknown int pending; // completion control - /** Constructor for root tasks */ - BulkTask(ConcurrentHashMapV8 map) { + BulkTask(ConcurrentHashMapV8 map, BulkTask parent, + int batch) { 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; + if (parent != null && map != null) { // split parent + Node[] t; + if ((t = parent.tab) == null && + (t = parent.tab = map.table) != null) + parent.baseLimit = parent.baseSize = t.length; + this.tab = t; + this.baseSize = parent.baseSize; + int hi = this.baseLimit = parent.baseLimit; + parent.baseLimit = this.index = this.baseIndex = + (hi + parent.baseIndex + 1) >>> 1; + } } // FJ methods @@ -4858,31 +4885,31 @@ public class ConcurrentHashMapV8 } /** - * Forces root task to throw exception unless already complete. + * Forces root task to complete. + * @param ex if null, complete normally, else exceptionally + * @return false to simplify use */ - final void tryAbortComputation(Throwable ex) { + final boolean tryCompleteComputation(Throwable ex) { for (BulkTask a = this;;) { BulkTask p = a.parent; if (p == null) { - a.completeExceptionally(ex); - break; + if (ex != null) + a.completeExceptionally(ex); + else + a.quietlyComplete(); + return false; } a = p; } } - public final boolean exec() { - try { - compute(); - } - catch (Throwable ex) { - tryAbortComputation(ex); - } - return false; + /** + * Version of tryCompleteComputation for function screening checks + */ + final boolean abortOnNullFunction() { + return tryCompleteComputation(new Error("Unexpected null function")); } - public abstract void compute(); - // utilities /** CompareAndSet pending count */ @@ -4898,26 +4925,24 @@ public class ConcurrentHashMapV8 * 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; + ConcurrentHashMapV8 m; int b; Node[] t; + 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.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"; - - /** * Returns exportable snapshot entry. */ static AbstractMap.SimpleEntry entryFor(K k, V v) { - return new AbstractMap.SimpleEntry(k, v); + return new AbstractMap.SimpleEntry(k, v); } // Unsafe mechanics @@ -4925,7 +4950,7 @@ public class ConcurrentHashMapV8 private static final long PENDING; static { try { - U = sun.misc.Unsafe.getUnsafe(); + U = getUnsafe(); PENDING = U.objectFieldOffset (BulkTask.class.getDeclaredField("pending")); } catch (Exception e) { @@ -4940,1763 +4965,1550 @@ public class ConcurrentHashMapV8 * others. */ - static final class ForEachKeyTask + @SuppressWarnings("serial") static final class ForEachKeyTask extends BulkTask { final Action action; ForEachKeyTask - (ConcurrentHashMapV8 m, - Action action) { - super(m); - this.action = action; - } - ForEachKeyTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, BulkTask p, int b, Action action) { - super(p, b, split); + super(m, p, b); this.action = action; } - public final void compute() { + @SuppressWarnings("unchecked") public final boolean exec() { 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(); + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit) { + do {} while (!casPending(c = pending, c+1)); + new ForEachKeyTask(map, this, b >>>= 1, action).fork(); + } + while (advance() != null) + action.apply((K)nextKey); + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - while (advance() != null) - action.apply((K)nextKey); - tryComplete(); + return false; } } - static final class ForEachValueTask + @SuppressWarnings("serial") static final class ForEachValueTask extends BulkTask { final Action action; ForEachValueTask - (ConcurrentHashMapV8 m, - Action action) { - super(m); - this.action = action; - } - ForEachValueTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, BulkTask p, int b, Action action) { - super(p, b, split); + super(m, p, b); this.action = action; } - public final void compute() { + @SuppressWarnings("unchecked") public final boolean exec() { 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(); + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit) { + do {} while (!casPending(c = pending, c+1)); + new ForEachValueTask(map, this, b >>>= 1, action).fork(); + } + Object v; + while ((v = advance()) != null) + action.apply((V)v); + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - Object v; - while ((v = advance()) != null) - action.apply((V)v); - tryComplete(); + return false; } } - static final class ForEachEntryTask + @SuppressWarnings("serial") static final class ForEachEntryTask extends BulkTask { final Action> action; ForEachEntryTask - (ConcurrentHashMapV8 m, - Action> action) { - super(m); - this.action = action; - } - ForEachEntryTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, BulkTask p, int b, Action> action) { - super(p, b, split); + super(m, p, b); this.action = action; } - public final void compute() { + @SuppressWarnings("unchecked") public final boolean exec() { 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(); + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit) { + do {} while (!casPending(c = pending, c+1)); + new ForEachEntryTask(map, this, b >>>= 1, action).fork(); + } + Object v; + while ((v = advance()) != null) + action.apply(entryFor((K)nextKey, (V)v)); + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - Object v; - while ((v = advance()) != null) - action.apply(entryFor((K)nextKey, (V)v)); - tryComplete(); + return false; } } - static final class ForEachMappingTask + @SuppressWarnings("serial") static final class ForEachMappingTask extends BulkTask { final BiAction action; ForEachMappingTask - (ConcurrentHashMapV8 m, - BiAction action) { - super(m); - this.action = action; - } - ForEachMappingTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, BulkTask p, int b, BiAction action) { - super(p, b, split); + super(m, p, b); this.action = action; } - - public final void compute() { + @SuppressWarnings("unchecked") public final boolean exec() { 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(); + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit) { + do {} while (!casPending(c = pending, c+1)); + new ForEachMappingTask(map, this, b >>>= 1, + action).fork(); + } + Object v; + while ((v = advance()) != null) + action.apply((K)nextKey, (V)v); + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - Object v; - while ((v = advance()) != null) - action.apply((K)nextKey, (V)v); - tryComplete(); + return false; } } - static final class ForEachTransformedKeyTask + @SuppressWarnings("serial") static final class ForEachTransformedKeyTask extends BulkTask { final Fun transformer; final Action action; ForEachTransformedKeyTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, Fun transformer, Action action) { - super(m); + super(m, p, b); 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() { + @SuppressWarnings("unchecked") public final boolean exec() { 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); + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit) { + do {} while (!casPending(c = pending, c+1)); + new ForEachTransformedKeyTask + (map, this, b >>>= 1, transformer, action).fork(); + } + U u; + while (advance() != null) { + if ((u = transformer.apply((K)nextKey)) != null) + action.apply(u); + } + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - tryComplete(); + return false; } } - static final class ForEachTransformedValueTask + @SuppressWarnings("serial") static final class ForEachTransformedValueTask extends BulkTask { final Fun transformer; final Action action; ForEachTransformedValueTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, Fun transformer, Action action) { - super(m); + super(m, p, b); 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() { + @SuppressWarnings("unchecked") public final boolean exec() { 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); + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit) { + do {} while (!casPending(c = pending, c+1)); + new ForEachTransformedValueTask + (map, this, b >>>= 1, transformer, action).fork(); + } + Object v; U u; + while ((v = advance()) != null) { + if ((u = transformer.apply((V)v)) != null) + action.apply(u); + } + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - tryComplete(); + return false; } } - static final class ForEachTransformedEntryTask + @SuppressWarnings("serial") static final class ForEachTransformedEntryTask extends BulkTask { final Fun, ? extends U> transformer; final Action action; ForEachTransformedEntryTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, Fun, ? extends U> transformer, Action action) { - super(m); + super(m, p, b); 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() { + @SuppressWarnings("unchecked") public final boolean exec() { 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); + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit) { + do {} while (!casPending(c = pending, c+1)); + new ForEachTransformedEntryTask + (map, this, b >>>= 1, transformer, action).fork(); + } + Object v; U u; + while ((v = advance()) != null) { + if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null) + action.apply(u); + } + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - tryComplete(); + return false; } } - static final class ForEachTransformedMappingTask + @SuppressWarnings("serial") static final class ForEachTransformedMappingTask extends BulkTask { final BiFun transformer; final Action action; ForEachTransformedMappingTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, BiFun transformer, Action action) { - super(m); + super(m, p, b); this.transformer = transformer; this.action = action; } - ForEachTransformedMappingTask - (BulkTask p, int b, boolean split, - BiFun transformer, - Action action) { - super(p, b, split); - this.transformer = transformer; - this.action = action; - } - public final void compute() { + @SuppressWarnings("unchecked") public final boolean exec() { 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); + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit) { + do {} while (!casPending(c = pending, c+1)); + new ForEachTransformedMappingTask + (map, this, b >>>= 1, transformer, action).fork(); + } + Object v; U u; + while ((v = advance()) != null) { + if ((u = transformer.apply((K)nextKey, (V)v)) != null) + action.apply(u); + } + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - tryComplete(); + return false; } } - static final class SearchKeysTask + @SuppressWarnings("serial") static final class SearchKeysTask extends BulkTask { 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, BulkTask 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() { + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit && result.get() == null) { + do {} while (!casPending(c = pending, c+1)); + new SearchKeysTask(map, this, b >>>= 1, + searchFunction, result).fork(); } + U u; + while (result.get() == null && advance() != null) { + if ((u = searchFunction.apply((K)nextKey)) != null) { + if (result.compareAndSet(null, u)) + tryCompleteComputation(null); + break; + } + } + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - tryComplete(); + return false; } public final U getRawResult() { return result.get(); } } - static final class SearchValuesTask + @SuppressWarnings("serial") static final class SearchValuesTask extends BulkTask { final Fun searchFunction; final AtomicReference result; SearchValuesTask - (ConcurrentHashMapV8 m, - Fun searchFunction, - AtomicReference result) { - super(m); - this.searchFunction = searchFunction; this.result = result; - } - SearchValuesTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, BulkTask 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() { + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit && result.get() == null) { + do {} while (!casPending(c = pending, c+1)); + new SearchValuesTask(map, this, b >>>= 1, + searchFunction, result).fork(); + } + Object v; U u; + while (result.get() == null && (v = advance()) != null) { + if ((u = searchFunction.apply((V)v)) != null) { + if (result.compareAndSet(null, u)) + tryCompleteComputation(null); + break; + } } + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - tryComplete(); + return false; } public final U getRawResult() { return result.get(); } } - static final class SearchEntriesTask + @SuppressWarnings("serial") static final class SearchEntriesTask extends BulkTask { final Fun, ? extends U> searchFunction; final AtomicReference result; SearchEntriesTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, Fun, ? extends U> searchFunction, AtomicReference result) { - super(m); + super(m, p, b); this.searchFunction = searchFunction; this.result = result; } - SearchEntriesTask - (BulkTask p, int b, boolean split, - Fun, ? extends U> searchFunction, - AtomicReference result) { - super(p, b, split); - this.searchFunction = searchFunction; this.result = result; - } - public final void compute() { + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit && result.get() == null) { + do {} while (!casPending(c = pending, c+1)); + new SearchEntriesTask(map, this, b >>>= 1, + searchFunction, result).fork(); + } + Object v; U u; + while (result.get() == null && (v = advance()) != null) { + if ((u = searchFunction.apply(entryFor((K)nextKey, (V)v))) != null) { + if (result.compareAndSet(null, u)) + tryCompleteComputation(null); + break; + } } + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - tryComplete(); + return false; } public final U getRawResult() { return result.get(); } } - static final class SearchMappingsTask + @SuppressWarnings("serial") static final class SearchMappingsTask extends BulkTask { final BiFun searchFunction; final AtomicReference result; SearchMappingsTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, BiFun searchFunction, AtomicReference result) { - super(m); + super(m, p, b); this.searchFunction = searchFunction; this.result = result; } - SearchMappingsTask - (BulkTask p, int b, boolean split, - BiFun searchFunction, - AtomicReference result) { - super(p, b, split); - this.searchFunction = searchFunction; this.result = result; - } - public final void compute() { + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + int b = batch(), c; + while (b > 1 && baseIndex != baseLimit && result.get() == null) { + do {} while (!casPending(c = pending, c+1)); + new SearchMappingsTask(map, this, b >>>= 1, + searchFunction, result).fork(); + } + Object v; U u; + while (result.get() == null && (v = advance()) != null) { + if ((u = searchFunction.apply((K)nextKey, (V)v)) != null) { + if (result.compareAndSet(null, u)) + tryCompleteComputation(null); + break; + } } + tryComplete(); + } catch (Throwable ex) { + return tryCompleteComputation(ex); } - tryComplete(); + return false; } public final U getRawResult() { return result.get(); } } - static final class ReduceKeysTask + @SuppressWarnings("serial") static final class ReduceKeysTask extends BulkTask { final BiFun reducer; K result; - ReduceKeysTask sibling; - ReduceKeysTask - (ConcurrentHashMapV8 m, - BiFun reducer) { - super(m); - this.reducer = reducer; - } + ReduceKeysTask rights, nextRight; ReduceKeysTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, BulkTask p, int b, + ReduceKeysTask nextRight, BiFun reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.reducer = reducer; } - - public final void compute() { - ReduceKeysTask t = this; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new ReduceKeysTask + (map, this, b >>>= 1, 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; + for (ReduceKeysTask t = this, s;;) { + int c; BulkTask par; K tr, sr; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + if ((sr = s.result) != null) + t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr); + } + if ((par = t.parent) == null || + !(par instanceof ReduceKeysTask)) { + t.quietlyComplete(); + break; + } + t = (ReduceKeysTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final K getRawResult() { return result; } } - static final class ReduceValuesTask + @SuppressWarnings("serial") static final class ReduceValuesTask extends BulkTask { 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, BulkTask 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; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new ReduceValuesTask + (map, this, b >>>= 1, rights, reducer)).fork(); + } + V r = null; + Object v; + while ((v = advance()) != null) { + V u = (V)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; + for (ReduceValuesTask t = this, s;;) { + int c; BulkTask par; V tr, sr; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + if ((sr = s.result) != null) + t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr); + } + if ((par = t.parent) == null || + !(par instanceof ReduceValuesTask)) { + t.quietlyComplete(); + break; + } + t = (ReduceValuesTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final V getRawResult() { return result; } } - static final class ReduceEntriesTask + @SuppressWarnings("serial") static final class ReduceEntriesTask extends BulkTask> { final BiFun, Map.Entry, ? extends Map.Entry> reducer; Map.Entry result; - ReduceEntriesTask sibling; + ReduceEntriesTask rights, nextRight; ReduceEntriesTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, + ReduceEntriesTask nextRight, BiFun, Map.Entry, ? extends Map.Entry> reducer) { - super(m); + super(m, p, b); this.nextRight = nextRight; this.reducer = reducer; } - ReduceEntriesTask - (BulkTask p, int b, boolean split, - BiFun, Map.Entry, ? extends Map.Entry> reducer) { - super(p, b, split); - this.reducer = reducer; - } - - public final void compute() { - ReduceEntriesTask t = this; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new ReduceEntriesTask + (map, this, b >>>= 1, rights, reducer)).fork(); + } + Map.Entry r = null; + Object v; + while ((v = advance()) != null) { + Map.Entry u = entryFor((K)nextKey, (V)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; + for (ReduceEntriesTask t = this, s;;) { + int c; BulkTask par; Map.Entry tr, sr; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + if ((sr = s.result) != null) + t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr); + } + if ((par = t.parent) == null || + !(par instanceof ReduceEntriesTask)) { + t.quietlyComplete(); + break; + } + t = (ReduceEntriesTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Map.Entry getRawResult() { return result; } } - static final class MapReduceKeysTask + @SuppressWarnings("serial") static final class MapReduceKeysTask extends BulkTask { final Fun transformer; final BiFun reducer; U result; - MapReduceKeysTask sibling; - MapReduceKeysTask - (ConcurrentHashMapV8 m, - Fun transformer, - BiFun reducer) { - super(m); - this.transformer = transformer; - this.reducer = reducer; - } + MapReduceKeysTask rights, nextRight; MapReduceKeysTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, BulkTask p, int b, + MapReduceKeysTask 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() { - MapReduceKeysTask t = this; + @SuppressWarnings("unchecked") public final boolean exec() { 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) + return abortOnNullFunction(); + try { + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceKeysTask + (map, this, b >>>= 1, 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; + for (MapReduceKeysTask t = this, s;;) { + int c; BulkTask par; U tr, sr; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + if ((sr = s.result) != null) + t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceKeysTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceKeysTask)par; + } + else if (t.casPending(c, c - 1)) + break; + } + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final U getRawResult() { return result; } } - static final class MapReduceValuesTask + @SuppressWarnings("serial") static final class MapReduceValuesTask extends BulkTask { final Fun transformer; final BiFun reducer; U result; - MapReduceValuesTask sibling; + MapReduceValuesTask rights, nextRight; MapReduceValuesTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, + MapReduceValuesTask nextRight, Fun transformer, BiFun reducer) { - super(m); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.reducer = reducer; } - MapReduceValuesTask - (BulkTask p, int b, boolean split, - Fun transformer, - BiFun reducer) { - super(p, b, split); - this.transformer = transformer; - this.reducer = reducer; - } - public final void compute() { - MapReduceValuesTask t = this; + @SuppressWarnings("unchecked") public final boolean exec() { 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) + return abortOnNullFunction(); + try { + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceValuesTask + (map, this, b >>>= 1, rights, transformer, reducer)).fork(); + } + U r = null, u; + Object v; + while ((v = advance()) != null) { + if ((u = transformer.apply((V)v)) != null) r = (r == null) ? u : reducer.apply(r, u); - (t = p).result = r; } - else if (p.casPending(c, 0)) - break; + result = r; + for (MapReduceValuesTask t = this, s;;) { + int c; BulkTask par; U tr, sr; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + if ((sr = s.result) != null) + t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceValuesTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceValuesTask)par; + } + else if (t.casPending(c, c - 1)) + break; + } + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final U getRawResult() { return result; } } - static final class MapReduceEntriesTask + @SuppressWarnings("serial") static final class MapReduceEntriesTask extends BulkTask { final Fun, ? extends U> transformer; final BiFun reducer; U result; - MapReduceEntriesTask sibling; + MapReduceEntriesTask rights, nextRight; MapReduceEntriesTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, + MapReduceEntriesTask nextRight, Fun, ? extends U> transformer, BiFun reducer) { - super(m); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.reducer = reducer; } - MapReduceEntriesTask - (BulkTask p, int b, boolean split, - Fun, ? extends U> transformer, - BiFun reducer) { - super(p, b, split); - this.transformer = transformer; - this.reducer = reducer; - } - public final void compute() { - MapReduceEntriesTask t = this; + @SuppressWarnings("unchecked") public final boolean exec() { 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) + return abortOnNullFunction(); + try { + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceEntriesTask + (map, this, b >>>= 1, rights, transformer, reducer)).fork(); + } + U r = null, u; + Object v; + while ((v = advance()) != null) { + if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null) r = (r == null) ? u : reducer.apply(r, u); - (t = p).result = r; } - else if (p.casPending(c, 0)) - break; + result = r; + for (MapReduceEntriesTask t = this, s;;) { + int c; BulkTask par; U tr, sr; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + if ((sr = s.result) != null) + t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceEntriesTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceEntriesTask)par; + } + else if (t.casPending(c, c - 1)) + break; + } + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final U getRawResult() { return result; } } - static final class MapReduceMappingsTask + @SuppressWarnings("serial") static final class MapReduceMappingsTask extends BulkTask { 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, BulkTask 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; + @SuppressWarnings("unchecked") public final boolean exec() { 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) + return abortOnNullFunction(); + try { + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceMappingsTask + (map, this, b >>>= 1, rights, transformer, reducer)).fork(); + } + U r = null, u; + Object v; + while ((v = advance()) != null) { + if ((u = transformer.apply((K)nextKey, (V)v)) != null) r = (r == null) ? u : reducer.apply(r, u); - (t = p).result = r; } - else if (p.casPending(c, 0)) - break; + result = r; + for (MapReduceMappingsTask t = this, s;;) { + int c; BulkTask par; U tr, sr; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + if ((sr = s.result) != null) + t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceMappingsTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceMappingsTask)par; + } + else if (t.casPending(c, c - 1)) + break; + } + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final U getRawResult() { return result; } } - static final class MapReduceKeysToDoubleTask + @SuppressWarnings("serial") static final class MapReduceKeysToDoubleTask extends BulkTask { 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, BulkTask 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; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final double id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceKeysToDoubleTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + double r = id; + while (advance() != null) + r = reducer.apply(r, transformer.apply((K)nextKey)); + result = r; + for (MapReduceKeysToDoubleTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceKeysToDoubleTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceKeysToDoubleTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Double getRawResult() { return result; } } - static final class MapReduceValuesToDoubleTask + @SuppressWarnings("serial") static final class MapReduceValuesToDoubleTask extends BulkTask { final ObjectToDouble transformer; final DoubleByDoubleToDouble reducer; final double basis; double result; - MapReduceValuesToDoubleTask sibling; + MapReduceValuesToDoubleTask rights, nextRight; MapReduceValuesToDoubleTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, + MapReduceValuesToDoubleTask nextRight, ObjectToDouble transformer, double basis, DoubleByDoubleToDouble reducer) { - super(m); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - MapReduceValuesToDoubleTask - (BulkTask p, int b, boolean split, - ObjectToDouble transformer, - double basis, - DoubleByDoubleToDouble reducer) { - super(p, b, split); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } - public final void compute() { - MapReduceValuesToDoubleTask t = this; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final double id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceValuesToDoubleTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + double r = id; + Object v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply((V)v)); + result = r; + for (MapReduceValuesToDoubleTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceValuesToDoubleTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceValuesToDoubleTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Double getRawResult() { return result; } } - static final class MapReduceEntriesToDoubleTask + @SuppressWarnings("serial") static final class MapReduceEntriesToDoubleTask extends BulkTask { 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, BulkTask 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; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final double id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceEntriesToDoubleTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + double r = id; + Object v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v))); + result = r; + for (MapReduceEntriesToDoubleTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceEntriesToDoubleTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceEntriesToDoubleTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Double getRawResult() { return result; } } - static final class MapReduceMappingsToDoubleTask + @SuppressWarnings("serial") static final class MapReduceMappingsToDoubleTask extends BulkTask { final ObjectByObjectToDouble transformer; final DoubleByDoubleToDouble reducer; final double basis; double result; - MapReduceMappingsToDoubleTask sibling; - MapReduceMappingsToDoubleTask - (ConcurrentHashMapV8 m, - ObjectByObjectToDouble transformer, - double basis, - DoubleByDoubleToDouble reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceMappingsToDoubleTask rights, nextRight; MapReduceMappingsToDoubleTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, BulkTask p, int b, + MapReduceMappingsToDoubleTask nextRight, ObjectByObjectToDouble 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() { - MapReduceMappingsToDoubleTask t = this; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final double id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceMappingsToDoubleTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + double r = id; + Object v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply((K)nextKey, (V)v)); + result = r; + for (MapReduceMappingsToDoubleTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceMappingsToDoubleTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceMappingsToDoubleTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Double getRawResult() { return result; } } - static final class MapReduceKeysToLongTask + @SuppressWarnings("serial") static final class MapReduceKeysToLongTask extends BulkTask { 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, BulkTask 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; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final long id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceKeysToLongTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + long r = id; + while (advance() != null) + r = reducer.apply(r, transformer.apply((K)nextKey)); + result = r; + for (MapReduceKeysToLongTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceKeysToLongTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceKeysToLongTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Long getRawResult() { return result; } } - static final class MapReduceValuesToLongTask + @SuppressWarnings("serial") static final class MapReduceValuesToLongTask extends BulkTask { final ObjectToLong transformer; final LongByLongToLong reducer; final long basis; long result; - MapReduceValuesToLongTask sibling; + MapReduceValuesToLongTask rights, nextRight; MapReduceValuesToLongTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, + MapReduceValuesToLongTask nextRight, ObjectToLong transformer, long basis, LongByLongToLong reducer) { - super(m); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - MapReduceValuesToLongTask - (BulkTask p, int b, boolean split, - ObjectToLong transformer, - long basis, - LongByLongToLong reducer) { - super(p, b, split); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } - public final void compute() { - MapReduceValuesToLongTask t = this; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final long id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceValuesToLongTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + long r = id; + Object v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply((V)v)); + result = r; + for (MapReduceValuesToLongTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceValuesToLongTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceValuesToLongTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Long getRawResult() { return result; } } - static final class MapReduceEntriesToLongTask + @SuppressWarnings("serial") static final class MapReduceEntriesToLongTask extends BulkTask { 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, BulkTask 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; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final long id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceEntriesToLongTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + long r = id; + Object v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v))); + result = r; + for (MapReduceEntriesToLongTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceEntriesToLongTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceEntriesToLongTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Long getRawResult() { return result; } } - static final class MapReduceMappingsToLongTask + @SuppressWarnings("serial") static final class MapReduceMappingsToLongTask extends BulkTask { 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, BulkTask 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; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final long id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceMappingsToLongTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + long r = id; + Object v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply((K)nextKey, (V)v)); + result = r; + for (MapReduceMappingsToLongTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceMappingsToLongTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceMappingsToLongTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Long getRawResult() { return result; } } - static final class MapReduceKeysToIntTask + @SuppressWarnings("serial") static final class MapReduceKeysToIntTask extends BulkTask { final ObjectToInt transformer; final IntByIntToInt reducer; final int basis; int result; - MapReduceKeysToIntTask sibling; + MapReduceKeysToIntTask rights, nextRight; MapReduceKeysToIntTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, + MapReduceKeysToIntTask nextRight, ObjectToInt transformer, int basis, IntByIntToInt reducer) { - super(m); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - MapReduceKeysToIntTask - (BulkTask p, int b, boolean split, - ObjectToInt transformer, - int basis, - IntByIntToInt reducer) { - super(p, b, split); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } - public final void compute() { - MapReduceKeysToIntTask t = this; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final int id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceKeysToIntTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + int r = id; + while (advance() != null) + r = reducer.apply(r, transformer.apply((K)nextKey)); + result = r; + for (MapReduceKeysToIntTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceKeysToIntTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceKeysToIntTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Integer getRawResult() { return result; } } - static final class MapReduceValuesToIntTask + @SuppressWarnings("serial") static final class MapReduceValuesToIntTask extends BulkTask { 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, BulkTask 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; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final int id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceValuesToIntTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + int r = id; + Object v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply((V)v)); + result = r; + for (MapReduceValuesToIntTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceValuesToIntTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceValuesToIntTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Integer getRawResult() { return result; } } - static final class MapReduceEntriesToIntTask + @SuppressWarnings("serial") static final class MapReduceEntriesToIntTask extends BulkTask { 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, BulkTask 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; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final int id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceEntriesToIntTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + int r = id; + Object v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v))); + result = r; + for (MapReduceEntriesToIntTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceEntriesToIntTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceEntriesToIntTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Integer getRawResult() { return result; } } - static final class MapReduceMappingsToIntTask + @SuppressWarnings("serial") static final class MapReduceMappingsToIntTask extends BulkTask { final ObjectByObjectToInt transformer; final IntByIntToInt reducer; final int basis; int result; - MapReduceMappingsToIntTask sibling; + MapReduceMappingsToIntTask rights, nextRight; MapReduceMappingsToIntTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, BulkTask p, int b, + MapReduceMappingsToIntTask rights, 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; + @SuppressWarnings("unchecked") public final boolean exec() { 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; + return abortOnNullFunction(); + try { + final int id = this.basis; + for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { + do {} while (!casPending(c = pending, c+1)); + (rights = new MapReduceMappingsToIntTask + (map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); + } + int r = id; + Object v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply((K)nextKey, (V)v)); + result = r; + for (MapReduceMappingsToIntTask t = this, s;;) { + int c; BulkTask par; + if ((c = t.pending) == 0) { + for (s = t.rights; s != null; s = t.rights = s.nextRight) { + t.result = reducer.apply(t.result, s.result); + } + if ((par = t.parent) == null || + !(par instanceof MapReduceMappingsToIntTask)) { + t.quietlyComplete(); + break; + } + t = (MapReduceMappingsToIntTask)par; + } + else if (t.casPending(c, c - 1)) + break; } - else if (p.casPending(c, 0)) - break; + } catch (Throwable ex) { + return tryCompleteComputation(ex); } + return false; } public final Integer getRawResult() { return result; } }