7 |
|
package jsr166y; |
8 |
|
|
9 |
|
/** |
10 |
< |
* A resultless {@link ForkJoinTask} with a completion action |
10 |
> |
* A {@link ForkJoinTask} with a completion action |
11 |
|
* performed when triggered and there are no remaining pending |
12 |
|
* actions. Uses of CountedCompleter are similar to those of other |
13 |
|
* completion based components (such as {@link |
22 |
|
* decremented; otherwise, the completion action is performed, and if |
23 |
|
* this completer itself has a completer, the process is continued |
24 |
|
* with its completer. As is the case with related synchronization |
25 |
< |
* components such as {@link Phaser} and {@link |
26 |
< |
* java.util.concurrent.Semaphore} these methods affect only internal |
27 |
< |
* counts; they do not establish any further internal bookkeeping. In |
28 |
< |
* particular, the identities of pending tasks are not maintained. As |
29 |
< |
* illustrated below, you can create subclasses that do record some or |
30 |
< |
* all pended tasks or their results when needed. |
25 |
> |
* components such as {@link java.util.concurrent.Phaser Phaser} and |
26 |
> |
* {@link java.util.concurrent.Semaphore Semaphore}, these methods |
27 |
> |
* affect only internal counts; they do not establish any further |
28 |
> |
* internal bookkeeping. In particular, the identities of pending |
29 |
> |
* tasks are not maintained. As illustrated below, you can create |
30 |
> |
* subclasses that do record some or all pending tasks or their |
31 |
> |
* results when needed. |
32 |
|
* |
33 |
|
* <p>A concrete CountedCompleter class must define method {@link |
34 |
|
* #compute}, that should, in almost all use cases, invoke {@code |
37 |
|
* normal completion, and method {@link #onExceptionalCompletion} to |
38 |
|
* perform an action upon any exception. |
39 |
|
* |
40 |
+ |
* <p>CountedCompleters most often do not bear results, in which case |
41 |
+ |
* they are normally declared as {@code CountedCompleter<Void>}, and |
42 |
+ |
* will always return {@code null} as a result value. In other cases, |
43 |
+ |
* you should override method {@link #getRawResult} to provide a |
44 |
+ |
* result from {@code join(), invoke()}, and related methods. (Method |
45 |
+ |
* {@link #setRawResult} by default plays no role in CountedCompleters |
46 |
+ |
* but may be overridden for example to maintain fields holding result |
47 |
+ |
* data.) |
48 |
+ |
* |
49 |
|
* <p>A CountedCompleter that does not itself have a completer (i.e., |
50 |
|
* one for which {@link #getCompleter} returns {@code null}) can be |
51 |
|
* used as a regular ForkJoinTask with this added functionality. |
65 |
|
* <p><b>Parallel recursive decomposition.</b> CountedCompleters may |
66 |
|
* be arranged in trees similar to those often used with {@link |
67 |
|
* RecursiveAction}s, although the constructions involved in setting |
68 |
< |
* them up typically vary. Even though they entail a bit more |
68 |
> |
* them up typically vary. Here, the completer of each task is its |
69 |
> |
* parent in the computation tree. Even though they entail a bit more |
70 |
|
* bookkeeping, CountedCompleters may be better choices when applying |
71 |
|
* a possibly time-consuming operation (that cannot be further |
72 |
|
* subdivided) to each element of an array or collection; especially |
77 |
|
* continuations, other threads need not block waiting to perform |
78 |
|
* them. |
79 |
|
* |
80 |
< |
* <p> For example, here is an initial version of a class that uses |
80 |
> |
* <p>For example, here is an initial version of a class that uses |
81 |
|
* divide-by-two recursive decomposition to divide work into single |
82 |
|
* pieces (leaf tasks). Even when work is split into individual calls, |
83 |
|
* tree-based techniques are usually preferable to directly forking |
91 |
|
* <pre> {@code |
92 |
|
* class MyOperation<E> { void apply(E e) { ... } } |
93 |
|
* |
94 |
< |
* class ForEach<E> extends CountedCompleter { |
94 |
> |
* class ForEach<E> extends CountedCompleter<Void> { |
95 |
|
* |
96 |
|
* public static <E> void forEach(ForkJoinPool pool, E[] array, MyOperation<E> op) { |
97 |
|
* pool.invoke(new ForEach<E>(null, array, op, 0, array.length)); |
98 |
|
* } |
99 |
|
* |
100 |
|
* final E[] array; final MyOperation<E> op; final int lo, hi; |
101 |
< |
* ForEach(CountedCompleter p, E[] array, MyOperation<E> op, int lo, int hi) { |
101 |
> |
* ForEach(CountedCompleter<?> p, E[] array, MyOperation<E> op, int lo, int hi) { |
102 |
|
* super(p); |
103 |
|
* this.array = array; this.op = op; this.lo = lo; this.hi = hi; |
104 |
|
* } |
142 |
|
* |
143 |
|
* As a further improvement, notice that the left task need not even |
144 |
|
* exist. Instead of creating a new one, we can iterate using the |
145 |
< |
* original task, and add a pending count for each fork: |
145 |
> |
* original task, and add a pending count for each fork. |
146 |
|
* |
147 |
|
* <pre> {@code |
148 |
|
* class ForEach<E> ... |
173 |
|
* and reductions are all of type {@code E}), one way to do this in |
174 |
|
* divide and conquer designs is to have each subtask record its |
175 |
|
* sibling, so that it can be accessed in method {@code onCompletion}. |
176 |
< |
* For clarity, this class uses explicit left and right subtasks, but |
177 |
< |
* variants of other streamlinings seen in the above example may also |
178 |
< |
* apply. |
176 |
> |
* This technique applies to reductions in which the order of |
177 |
> |
* combining left and right results does not matter; ordered |
178 |
> |
* reductions require explicit left/right designations. Variants of |
179 |
> |
* other streamlinings seen in the above examples may also apply. |
180 |
|
* |
181 |
|
* <pre> {@code |
182 |
|
* class MyMapper<E> { E apply(E v) { ... } } |
183 |
|
* class MyReducer<E> { E apply(E x, E y) { ... } } |
184 |
< |
* class MapReducer<E> extends CountedCompleter { |
184 |
> |
* class MapReducer<E> extends CountedCompleter<E> { |
185 |
|
* final E[] array; final MyMapper<E> mapper; |
186 |
|
* final MyReducer<E> reducer; final int lo, hi; |
187 |
< |
* MapReducer sibling; |
187 |
> |
* MapReducer<E> sibling; |
188 |
|
* E result; |
189 |
|
* MapReducer(CountedCompleter p, E[] array, MyMapper<E> mapper, |
190 |
|
* MyReducer<E> reducer, int lo, int hi) { |
219 |
|
* result = reducer.apply(child.result, sib.result); |
220 |
|
* } |
221 |
|
* } |
222 |
+ |
* public E getRawResult() { return result; } |
223 |
|
* |
224 |
|
* public static <E> E mapReduce(ForkJoinPool pool, E[] array, |
225 |
|
* MyMapper<E> mapper, MyReducer<E> reducer) { |
226 |
< |
* MapReducer<E> mr = new MapReducer<E>(null, array, mapper, |
227 |
< |
* reducer, 0, array.length); |
215 |
< |
* pool.invoke(mr); |
216 |
< |
* return mr.result; |
226 |
> |
* return pool.invoke(new MapReducer<E>(null, array, mapper, |
227 |
> |
* reducer, 0, array.length)); |
228 |
|
* } |
229 |
|
* } }</pre> |
230 |
|
* |
234 |
|
* triggers another async task. For example: |
235 |
|
* |
236 |
|
* <pre> {@code |
237 |
< |
* class HeaderBuilder extends CountedCompleter { ... } |
238 |
< |
* class BodyBuilder extends CountedCompleter { ... } |
239 |
< |
* class PacketSender extends CountedCompleter { |
237 |
> |
* class HeaderBuilder extends CountedCompleter<...> { ... } |
238 |
> |
* class BodyBuilder extends CountedCompleter<...> { ... } |
239 |
> |
* class PacketSender extends CountedCompleter<...> { |
240 |
|
* PacketSender(...) { super(null, 1); ... } // trigger on second completion |
241 |
|
* public void compute() { } // never called |
242 |
< |
* public void onCompletion(CountedCompleter caller) { sendPacket(); } |
242 |
> |
* public void onCompletion(CountedCompleter<?> caller) { sendPacket(); } |
243 |
|
* } |
244 |
|
* // sample use: |
245 |
|
* PacketSender p = new PacketSender(); |
250 |
|
* @since 1.8 |
251 |
|
* @author Doug Lea |
252 |
|
*/ |
253 |
< |
public abstract class CountedCompleter extends ForkJoinTask<Void> { |
253 |
> |
public abstract class CountedCompleter<T> extends ForkJoinTask<T> { |
254 |
|
private static final long serialVersionUID = 5232453752276485070L; |
255 |
|
|
256 |
|
/** This task's completer, or null if none */ |
257 |
< |
final CountedCompleter completer; |
257 |
> |
final CountedCompleter<?> completer; |
258 |
|
/** The number of pending tasks until completion */ |
259 |
|
volatile int pending; |
260 |
|
|
265 |
|
* @param completer this tasks completer, or {@code null} if none |
266 |
|
* @param initialPendingCount the initial pending count |
267 |
|
*/ |
268 |
< |
protected CountedCompleter(CountedCompleter completer, |
268 |
> |
protected CountedCompleter(CountedCompleter<?> completer, |
269 |
|
int initialPendingCount) { |
270 |
|
this.completer = completer; |
271 |
|
this.pending = initialPendingCount; |
277 |
|
* |
278 |
|
* @param completer this tasks completer, or {@code null} if none |
279 |
|
*/ |
280 |
< |
protected CountedCompleter(CountedCompleter completer) { |
280 |
> |
protected CountedCompleter(CountedCompleter<?> completer) { |
281 |
|
this.completer = completer; |
282 |
|
} |
283 |
|
|
303 |
|
* @param caller the task invoking this method (which may |
304 |
|
* be this task itself). |
305 |
|
*/ |
306 |
< |
public void onCompletion(CountedCompleter caller) { |
306 |
> |
public void onCompletion(CountedCompleter<?> caller) { |
307 |
|
} |
308 |
|
|
309 |
|
/** |
323 |
|
* @return true if this exception should be propagated to this |
324 |
|
* tasks completer, if one exists. |
325 |
|
*/ |
326 |
< |
public boolean onExceptionalCompletion(Throwable ex, CountedCompleter caller) { |
326 |
> |
public boolean onExceptionalCompletion(Throwable ex, CountedCompleter<?> caller) { |
327 |
|
return true; |
328 |
|
} |
329 |
|
|
333 |
|
* |
334 |
|
* @return the completer |
335 |
|
*/ |
336 |
< |
public final CountedCompleter getCompleter() { |
336 |
> |
public final CountedCompleter<?> getCompleter() { |
337 |
|
return completer; |
338 |
|
} |
339 |
|
|
378 |
|
} |
379 |
|
|
380 |
|
/** |
381 |
+ |
* Returns the root of the current computation; i.e., this |
382 |
+ |
* task if it has no completer, else its completer's root. |
383 |
+ |
* |
384 |
+ |
* @return the root of the current computation |
385 |
+ |
*/ |
386 |
+ |
public final CountedCompleter<?> getRoot() { |
387 |
+ |
CountedCompleter<?> a = this, p; |
388 |
+ |
while ((p = a.completer) != null) |
389 |
+ |
a = p; |
390 |
+ |
return a; |
391 |
+ |
} |
392 |
+ |
|
393 |
+ |
/** |
394 |
|
* If the pending count is nonzero, decrements the count; |
395 |
|
* otherwise invokes {@link #onCompletion} and then similarly |
396 |
|
* tries to complete this task's completer, if one exists, |
397 |
|
* else marks this task as complete. |
398 |
|
*/ |
399 |
|
public final void tryComplete() { |
400 |
< |
CountedCompleter a = this, s = a; |
400 |
> |
CountedCompleter<?> a = this, s = a; |
401 |
|
for (int c;;) { |
402 |
|
if ((c = a.pending) == 0) { |
403 |
|
a.onCompletion(s); |
413 |
|
|
414 |
|
/** |
415 |
|
* Regardless of pending count, invokes {@link #onCompletion}, |
416 |
< |
* marks this task as complete with a {@code null} return value, |
417 |
< |
* and further triggers {@link #tryComplete} on this task's |
418 |
< |
* completer, if one exists. This method may be useful when |
419 |
< |
* forcing completion as soon as any one (versus all) of several |
420 |
< |
* subtask results are obtained. |
416 |
> |
* marks this task as complete and further triggers {@link |
417 |
> |
* #tryComplete} on this task's completer, if one exists. This |
418 |
> |
* method may be useful when forcing completion as soon as any one |
419 |
> |
* (versus all) of several subtask results are obtained. The |
420 |
> |
* given rawResult is used as an argument to {@link #setRawResult} |
421 |
> |
* before marking this task as complete; its value is meaningful |
422 |
> |
* only for classes overriding {@code setRawResult}. |
423 |
|
* |
424 |
< |
* @param mustBeNull the {@code null} completion value |
424 |
> |
* @param rawResult the raw result |
425 |
|
*/ |
426 |
< |
public void complete(Void mustBeNull) { |
427 |
< |
CountedCompleter p; |
426 |
> |
public void complete(T rawResult) { |
427 |
> |
CountedCompleter<?> p; |
428 |
|
onCompletion(this); |
429 |
+ |
setRawResult(rawResult); |
430 |
|
quietlyComplete(); |
431 |
|
if ((p = completer) != null) |
432 |
|
p.tryComplete(); |
436 |
|
* Support for FJT exception propagation |
437 |
|
*/ |
438 |
|
void internalPropagateException(Throwable ex) { |
439 |
< |
CountedCompleter a = this, s = a; |
439 |
> |
CountedCompleter<?> a = this, s = a; |
440 |
|
while (a.onExceptionalCompletion(ex, s) && |
441 |
|
(a = (s = a).completer) != null && a.status >= 0) |
442 |
|
a.recordExceptionalCompletion(ex); |
451 |
|
} |
452 |
|
|
453 |
|
/** |
454 |
< |
* Always returns {@code null}. |
454 |
> |
* Returns the result of the computation. By default |
455 |
> |
* returns {@code null}, which is appropriate for {@code Void} |
456 |
> |
* actions, but in other cases should be overridden. |
457 |
|
* |
458 |
< |
* @return {@code null} always |
458 |
> |
* @return the result of the computation |
459 |
|
*/ |
460 |
< |
public final Void getRawResult() { return null; } |
460 |
> |
public T getRawResult() { return null; } |
461 |
|
|
462 |
|
/** |
463 |
< |
* Requires null completion value. |
463 |
> |
* A method that result-bearing CountedCompleters may optionally |
464 |
> |
* use to help maintain result data. By default, does nothing. |
465 |
|
*/ |
466 |
< |
protected final void setRawResult(Void mustBeNull) { } |
466 |
> |
protected void setRawResult(T t) { } |
467 |
|
|
468 |
|
// Unsafe mechanics |
469 |
|
private static final sun.misc.Unsafe U; |
478 |
|
} |
479 |
|
} |
480 |
|
|
451 |
– |
|
481 |
|
/** |
482 |
|
* Returns a sun.misc.Unsafe. Suitable for use in a 3rd party package. |
483 |
|
* Replace with a simple call to Unsafe.getUnsafe when integrating |
505 |
|
} |
506 |
|
} |
507 |
|
} |
479 |
– |
|
508 |
|
} |