-
Notifications
You must be signed in to change notification settings - Fork 668
/
ForkJoinTask.java
2173 lines (1889 loc) · 89.7 KB
/
ForkJoinTask.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* This file is available under and governed by the GNU General Public
* License version 2 only, as published by the Free Software Foundation.
* However, the following notice accompanied the original version of this
* file:
*
* Written by Doug Lea with assistance from members of JCP JSR-166
* Expert Group and released to the public domain, as explained at
* http://creativecommons.org/publicdomain/zero/1.0/
*/
package java.util.concurrent;
import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.io.Serializable;
import java.lang.invoke.MethodHandles;
import java.lang.invoke.VarHandle;
import java.lang.ref.ReferenceQueue;
import java.lang.ref.WeakReference;
import java.lang.reflect.Constructor;
import java.util.Collection;
import java.util.List;
import java.util.RandomAccess;
import java.util.concurrent.ForkJoinPool.WorkQueue;
import java.util.concurrent.locks.ReentrantLock;
/**
* Abstract base class for tasks that run within a {@link ForkJoinPool}.
* A {@code ForkJoinTask} is a thread-like entity that is much
* lighter weight than a normal thread. Huge numbers of tasks and
* subtasks may be hosted by a small number of actual threads in a
* ForkJoinPool, at the price of some usage limitations.
*
* <p>A "main" {@code ForkJoinTask} begins execution when it is
* explicitly submitted to a {@link ForkJoinPool}, or, if not already
* engaged in a ForkJoin computation, commenced in the {@link
* ForkJoinPool#commonPool()} via {@link #fork}, {@link #invoke}, or
* related methods. Once started, it will usually in turn start other
* subtasks. As indicated by the name of this class, many programs
* using {@code ForkJoinTask} employ only methods {@link #fork} and
* {@link #join}, or derivatives such as {@link
* #invokeAll(ForkJoinTask...) invokeAll}. However, this class also
* provides a number of other methods that can come into play in
* advanced usages, as well as extension mechanics that allow support
* of new forms of fork/join processing.
*
* <p>A {@code ForkJoinTask} is a lightweight form of {@link Future}.
* The efficiency of {@code ForkJoinTask}s stems from a set of
* restrictions (that are only partially statically enforceable)
* reflecting their main use as computational tasks calculating pure
* functions or operating on purely isolated objects. The primary
* coordination mechanisms are {@link #fork}, that arranges
* asynchronous execution, and {@link #join}, that doesn't proceed
* until the task's result has been computed. Computations should
* ideally avoid {@code synchronized} methods or blocks, and should
* minimize other blocking synchronization apart from joining other
* tasks or using synchronizers such as Phasers that are advertised to
* cooperate with fork/join scheduling. Subdividable tasks should also
* not perform blocking I/O, and should ideally access variables that
* are completely independent of those accessed by other running
* tasks. These guidelines are loosely enforced by not permitting
* checked exceptions such as {@code IOExceptions} to be
* thrown. However, computations may still encounter unchecked
* exceptions, that are rethrown to callers attempting to join
* them. These exceptions may additionally include {@link
* RejectedExecutionException} stemming from internal resource
* exhaustion, such as failure to allocate internal task
* queues. Rethrown exceptions behave in the same way as regular
* exceptions, but, when possible, contain stack traces (as displayed
* for example using {@code ex.printStackTrace()}) of both the thread
* that initiated the computation as well as the thread actually
* encountering the exception; minimally only the latter.
*
* <p>It is possible to define and use ForkJoinTasks that may block,
* but doing so requires three further considerations: (1) Completion
* of few if any <em>other</em> tasks should be dependent on a task
* that blocks on external synchronization or I/O. Event-style async
* tasks that are never joined (for example, those subclassing {@link
* CountedCompleter}) often fall into this category. (2) To minimize
* resource impact, tasks should be small; ideally performing only the
* (possibly) blocking action. (3) Unless the {@link
* ForkJoinPool.ManagedBlocker} API is used, or the number of possibly
* blocked tasks is known to be less than the pool's {@link
* ForkJoinPool#getParallelism} level, the pool cannot guarantee that
* enough threads will be available to ensure progress or good
* performance.
*
* <p>The primary method for awaiting completion and extracting
* results of a task is {@link #join}, but there are several variants:
* The {@link Future#get} methods support interruptible and/or timed
* waits for completion and report results using {@code Future}
* conventions. Method {@link #invoke} is semantically
* equivalent to {@code fork(); join()} but always attempts to begin
* execution in the current thread. The "<em>quiet</em>" forms of
* these methods do not extract results or report exceptions. These
* may be useful when a set of tasks are being executed, and you need
* to delay processing of results or exceptions until all complete.
* Method {@code invokeAll} (available in multiple versions)
* performs the most common form of parallel invocation: forking a set
* of tasks and joining them all.
*
* <p>In the most typical usages, a fork-join pair act like a call
* (fork) and return (join) from a parallel recursive function. As is
* the case with other forms of recursive calls, returns (joins)
* should be performed innermost-first. For example, {@code a.fork();
* b.fork(); b.join(); a.join();} is likely to be substantially more
* efficient than joining {@code a} before {@code b}.
*
* <p>The execution status of tasks may be queried at several levels
* of detail: {@link #isDone} is true if a task completed in any way
* (including the case where a task was cancelled without executing);
* {@link #isCompletedNormally} is true if a task completed without
* cancellation or encountering an exception; {@link #isCancelled} is
* true if the task was cancelled (in which case {@link #getException}
* returns a {@link CancellationException}); and
* {@link #isCompletedAbnormally} is true if a task was either
* cancelled or encountered an exception, in which case {@link
* #getException} will return either the encountered exception or
* {@link CancellationException}.
*
* <p>The ForkJoinTask class is not usually directly subclassed.
* Instead, you subclass one of the abstract classes that support a
* particular style of fork/join processing, typically {@link
* RecursiveAction} for most computations that do not return results,
* {@link RecursiveTask} for those that do, and {@link
* CountedCompleter} for those in which completed actions trigger
* other actions. Normally, a concrete ForkJoinTask subclass declares
* fields comprising its parameters, established in a constructor, and
* then defines a {@code compute} method that somehow uses the control
* methods supplied by this base class.
*
* <p>Method {@link #join} and its variants are appropriate for use
* only when completion dependencies are acyclic; that is, the
* parallel computation can be described as a directed acyclic graph
* (DAG). Otherwise, executions may encounter a form of deadlock as
* tasks cyclically wait for each other. However, this framework
* supports other methods and techniques (for example the use of
* {@link Phaser}, {@link #helpQuiesce}, and {@link #complete}) that
* may be of use in constructing custom subclasses for problems that
* are not statically structured as DAGs. To support such usages, a
* ForkJoinTask may be atomically <em>tagged</em> with a {@code short}
* value using {@link #setForkJoinTaskTag} or {@link
* #compareAndSetForkJoinTaskTag} and checked using {@link
* #getForkJoinTaskTag}. The ForkJoinTask implementation does not use
* these {@code protected} methods or tags for any purpose, but they
* may be of use in the construction of specialized subclasses. For
* example, parallel graph traversals can use the supplied methods to
* avoid revisiting nodes/tasks that have already been processed.
* (Method names for tagging are bulky in part to encourage definition
* of methods that reflect their usage patterns.)
*
* <p>Most base support methods are {@code final}, to prevent
* overriding of implementations that are intrinsically tied to the
* underlying lightweight task scheduling framework. Developers
* creating new basic styles of fork/join processing should minimally
* implement {@code protected} methods {@link #exec}, {@link
* #setRawResult}, and {@link #getRawResult}, while also introducing
* an abstract computational method that can be implemented in its
* subclasses, possibly relying on other {@code protected} methods
* provided by this class.
*
* <p>ForkJoinTasks should perform relatively small amounts of
* computation. Large tasks should be split into smaller subtasks,
* usually via recursive decomposition. As a very rough rule of thumb,
* a task should perform more than 100 and less than 10000 basic
* computational steps, and should avoid indefinite looping. If tasks
* are too big, then parallelism cannot improve throughput. If too
* small, then memory and internal task maintenance overhead may
* overwhelm processing.
*
* <p>This class provides {@code adapt} methods for {@link Runnable}
* and {@link Callable}, that may be of use when mixing execution of
* {@code ForkJoinTasks} with other kinds of tasks. When all tasks are
* of this form, consider using a pool constructed in <em>asyncMode</em>.
*
* <p>ForkJoinTasks are {@code Serializable}, which enables them to be
* used in extensions such as remote execution frameworks. It is
* sensible to serialize tasks only before or after, but not during,
* execution. Serialization is not relied on during execution itself.
*
* @since 1.7
* @author Doug Lea
*/
/*
* 并行任务,有多种类型的实现:
*
* ForkJoinTask.AdaptedCallable
* ForkJoinTask.AdaptedRunnable
* ForkJoinTask.AdaptedRunnableAction
* ForkJoinTask.RunnableExecuteAction
*
* CountedCompleter
* RecursiveTask
* RecursiveAction
*
* CompletableFuture.AsyncRun
* CompletableFuture.AsyncSupply
* CompletableFuture.Completion
*
* SubmissionPublisher.ConsumerTask
*/
public abstract class ForkJoinTask<V> implements Future<V>, Serializable {
private static final long serialVersionUID = -7721805057305804111L;
/*
* See the internal documentation of class ForkJoinPool for a
* general implementation overview. ForkJoinTasks are mainly
* responsible for maintaining their "status" field amidst relays
* to methods in ForkJoinWorkerThread and ForkJoinPool.
*
* The methods of this class are more-or-less layered into
* (1) basic status maintenance
* (2) execution and awaiting completion
* (3) user-level methods that additionally report results.
* This is sometimes hard to see because this file orders exported
* methods in a way that flows well in javadocs.
*/
/**
* The status field holds run control status bits packed into a
* single int to ensure atomicity. Status is initially zero, and
* takes on nonnegative values until completed, upon which it
* holds (sign bit) DONE, possibly with ABNORMAL (cancelled or
* exceptional) and THROWN (in which case an exception has been
* stored). Tasks with dependent blocked waiting joiners have the
* SIGNAL bit set. Completion of a task with SIGNAL set awakens
* any waiters via notifyAll. (Waiters also help signal others
* upon completion.)
*
* These control bits occupy only (some of) the upper half (16
* bits) of status field. The lower bits are used for user-defined
* tags.
*/
// 任务状态信息,包含DONE|ABNORMAL|THROWN|SIGNAL
volatile int status; // accessed directly by pool and workers
private static final int DONE = 1 << 31; // [已完成],must be negative
private static final int ABNORMAL = 1 << 18; // [非正常完成],set atomically with DONE
private static final int THROWN = 1 << 17; // [有异常],set atomically with ABNORMAL
private static final int SIGNAL = 1 << 16; // [等待],true if joiner waiting
// 任务状态掩码
private static final int SMASK = 0xffff; // short bits for tags
/**
* Hash table of exceptions thrown by tasks, to enable reporting
* by callers. Because exceptions are rare, we don't directly keep
* them with task objects, but instead use a weak ref table. Note
* that cancellation exceptions don't appear in the table, but are
* instead recorded as status values.
*
* The exception table has a fixed capacity.
*/
// 由异常记录哈希表,每个结点存储的是键值对<任务, 异常>
private static final ExceptionNode[] exceptionTable = new ExceptionNode[32];
/** Reference queue of stale exceptionally completed tasks. */
// 存储GC之后“已失效”的异常记录
private static final ReferenceQueue<ForkJoinTask<?>> exceptionTableRefQueue = new ReferenceQueue<>();
/** Lock protecting access to exceptionTable. */
// 操作异常信息时候需要的锁
private static final ReentrantLock exceptionTableLock = new ReentrantLock();
// VarHandle mechanics
private static final VarHandle STATUS;
static {
try {
MethodHandles.Lookup l = MethodHandles.lookup();
STATUS = l.findVarHandle(ForkJoinTask.class, "status", int.class);
} catch(ReflectiveOperationException e) {
throw new ExceptionInInitializerError(e);
}
}
/*▼ 信息 ████████████████████████████████████████████████████████████████████████████████┓ */
/**
* Returns the pool hosting the current thread, or {@code null}
* if the current thread is executing outside of any ForkJoinPool.
*
* <p>This method returns {@code null} if and only if {@link
* #inForkJoinPool} returns {@code false}.
*
* @return the pool, or {@code null} if none
*/
// 返回【工作线程】所属的工作池
public static ForkJoinPool getPool() {
Thread t = Thread.currentThread();
return (t instanceof ForkJoinWorkerThread) ? ((ForkJoinWorkerThread) t).pool : null;
}
/**
* Returns {@code true} if the current thread is a {@link
* ForkJoinWorkerThread} executing as a ForkJoinPool computation.
*
* @return {@code true} if the current thread is a {@link
* ForkJoinWorkerThread} executing as a ForkJoinPool computation,
* or {@code false} otherwise
*/
// 判断当前线程是否属于【工作线程】
public static boolean inForkJoinPool() {
return Thread.currentThread() instanceof ForkJoinWorkerThread;
}
/*▲ 信息 ████████████████████████████████████████████████████████████████████████████████┛ */
/*▼ 分发/移除 ████████████████████████████████████████████████████████████████████████████████┓ */
/**
* Arranges to asynchronously execute this task in the pool the
* current task is running in, if applicable, or using the {@link
* ForkJoinPool#commonPool()} if not {@link #inForkJoinPool}. While
* it is not necessarily enforced, it is a usage error to fork a
* task more than once unless it has completed and been
* reinitialized. Subsequent modifications to the state of this
* task or any data it operates on are not necessarily
* consistently observable by any thread other than the one
* executing it unless preceded by a call to {@link #join} or
* related methods, or a call to {@link #isDone} returning {@code
* true}.
*
* @return {@code this}, to simplify usage
*/
/*
* 分发/提交任务。
*
* 分发任务去排队,并创建/唤醒【工作线程】
*
* 将当前任务放入当前线程所辖【队列】的top处排队,
* 如果在【工作线程】fork任务,该任务会放入【工作队列】top处
* 如果在【提交线程】fork任务,该任务会统一放入【共享工作池】的【共享队列】top处
*
* 任务进入排队后,创建/唤醒【工作线程】
*/
public final ForkJoinTask<V> fork() {
// 获取当前线程的引用
Thread thread = Thread.currentThread();
if(thread instanceof ForkJoinWorkerThread) {
// 分发任务。task进入【工作队列】top处排队
((ForkJoinWorkerThread) thread).workQueue.push(this);
} else {
// 分发任务。task进入【共享工作池】的【共享队列】top处排队
ForkJoinPool.common.externalPush(this);
}
// 当前任务就位后,返回任务自身
return this;
}
/**
* Tries to unschedule this task for execution. This method will
* typically (but is not guaranteed to) succeed if this task is
* the most recently forked task by the current thread, and has
* not commenced executing in another thread. This method may be
* useful when arranging alternative local processing of tasks
* that could have been, but were not, stolen.
*
* @return {@code true} if unforked
*/
// 移除任务,将任务从【队列】的top处移除
public boolean tryUnfork() {
Thread thread = Thread.currentThread();
if(thread instanceof ForkJoinWorkerThread) {
// 移除任务。【工作线程】尝试将指定的task从【工作队列】top处移除,返回值代表是否成功移除
return ((ForkJoinWorkerThread) thread).workQueue.tryUnpush(this);
}
// 移除任务。【提交线程】尝试将指定的task从【共享工作池】上的【共享队列】top处移除,返回值代表是否成功移除
return ForkJoinPool.common.tryExternalUnpush(this);
}
/*▲ 分发/移除 ████████████████████████████████████████████████████████████████████████████████┛ */
/*▼ 执行 ████████████████████████████████████████████████████████████████████████████████┓ */
/**
* Immediately performs the base action of this task and returns
* true if, upon return from this method, this task is guaranteed
* to have completed normally. This method may return false
* otherwise, to indicate that this task is not necessarily
* complete (or is not known to be complete), for example in
* asynchronous actions that require explicit invocations of
* completion methods. This method may also throw an (unchecked)
* exception to indicate abnormal exit. This method is designed to
* support extensions, and should not in general be called
* otherwise.
*
* @return {@code true} if this task is known to have completed normally
*/
// 执行任务,执行细节由子类实现。返回值指示任务是否正常完成
protected abstract boolean exec();
/**
* Primary execution method for stolen tasks. Unless done, calls
* exec and records status if completed, but doesn't wait for
* completion otherwise.
*
* @return status on exit from this method
*/
// 执行任务,并返回任务执行后的状态。任务具体的执行逻辑由子类实现
final int doExec() {
// 如果任务当前任务已经完成了,直接返回任务状态
if(status<0) {
return status;
}
int s = status;
boolean completed;
try {
// 如果任务还未完成,则需要执行任务,执行细节由子类实现
completed = exec();
} catch(Throwable rex) {
completed = false;
// 如果执行期间出现了异常,需要添加异常标记
s = setExceptionalCompletion(rex);
}
// 如果任务已经执行完了
if(completed) {
// 将当前任务标记为已完成状态
s = setDone();
}
return s;
}
/**
* Implementation for invoke, quietlyInvoke.
*
* @return status upon completion
*/
/*
* 直接执行任务,最后返回任务状态。必要时,需要等待其他任务的完成
*
* 有些任务还没执行完就会返回状态码,
* 这可能会使当前线程进入wait状态,并标记任务为SIGNAL状态,
* 直到任务执行完之后,当前线程被唤醒并返回任务执行后的状态
*/
private int doInvoke() {
// 执行任务,返回任务执行后的状态。任务具体的执行逻辑由子类实现
int s = doExec();
// 如果任务已经完成,直接返回任务的状态
if(s<0) {
return s;
}
/* 至此,任务返回了状态码,但是没有[已完成]标记,此时需要继续处理 */
Thread thread = Thread.currentThread();
// 如果当前操作发生在【工作线程】中
if(thread instanceof ForkJoinWorkerThread) {
ForkJoinWorkerThread wt = (ForkJoinWorkerThread) thread;
// 【工作线程】尝试加速task的完成,如果无法加速,则当前的【工作线程】考虑进入wait状态,直到task完成后被唤醒
return wt.pool.awaitJoin(wt.workQueue, this, 0L);
}
// 如果当前操作发生在【提交线程】中,【提交线程】尝试加速当前任务的完成,如果无法加速,则进入wait状态等待task完成
return externalAwaitDone();
}
/**
* Implementation for join, get, quietlyJoin.
* Directly handles only cases of already-completed, external wait, and unfork+exec.
* Others are relayed to ForkJoinPool.awaitJoin.
*
* @return status upon completion
*/
// 从【工作队列】的top处取出当前任务并执行,最后返回任务状态。必要时,需要等待其他任务的完成
private int doJoin() {
// 获取任务当前的状态
int s = status;
// status<0代表已经执行完成
if(s < 0){
// 如果当前任务已经执行完了,就返回任务的状态
return s;
}
Thread thread = Thread.currentThread();
// 如果当前操作发生在【工作线程】中
if(thread instanceof ForkJoinWorkerThread){
// 获取当前的【工作线程】
ForkJoinWorkerThread wt = (ForkJoinWorkerThread)thread;
// 移除任务。【工作线程】尝试将指定的task从【工作队列】top处移除,返回值代表是否成功移除
if(wt.workQueue.tryUnpush(this)){
// 如果成功移除了任务,说明该任务还未被执行,那么从这里开始执行任务,并返回任务在执行后的状态
s = doExec();
// status<0代表已经执行完成
if(s < 0){
// 如果当前任务已经执行完了,就返回任务的状态
return s;
}
}
/*
* 至此,可能是没有在top处取到当前任务(可能不在栈顶,也可能被别的【工作线程】窃取了),
* 也可能是任务没有被标记为[已完成](是否真的完成未知)
*/
// 【工作线程】尝试加速task的完成,如果无法加速,则当前的【工作线程】考虑进入wait状态,直到task完成后被唤醒
return wt.pool.awaitJoin(wt.workQueue, this, 0L);
}
// 如果当前操作发生在【提交线程】中,【提交线程】尝试加速当前任务的完成,如果无法加速,则进入wait状态等待task完成
return externalAwaitDone();
}
/**
* Commences performing this task, awaits its completion if necessary, and returns its result,
* or throws an (unchecked) {@code RuntimeException} or {@code Error} if the underlying computation did so.
*
* @return the computed result
*/
// 直接执行任务,返回任务的执行结果。必要时,需要等待其他任务的完成
public final V invoke() {
// 直接执行任务,最后返回任务状态。必要时,需要等待其他任务的完成
int s = doInvoke();
// 如果任务带有[非正常完成]的标记,则需要报告异常
if((s & ABNORMAL) != 0) {
// 报告异常信息
reportException(s);
}
// 返回当前任务的执行结果
return getRawResult();
}
/**
* Returns the result of the computation when it
* {@linkplain #isDone is done}.
* This method differs from {@link #get()} in that abnormal
* completion results in {@code RuntimeException} or {@code Error},
* not {@code ExecutionException}, and that interrupts of the
* calling thread do <em>not</em> cause the method to abruptly
* return by throwing {@code InterruptedException}.
*
* @return the computed result
*/
// 从【工作队列】的top处取出当前任务并执行,最后返回任务的执行结果。必要时,需要等待其他任务的完成
public final V join() {
// 从【工作队列】的top处取出当前任务并执行,最后返回任务状态。必要时,需要等待其他任务的完成
int s = doJoin();
// 如果任务带有[非正常完成]的标记,则需要报告异常
if((s & ABNORMAL) != 0) {
// 报告异常信息
reportException(s);
}
// 返回当前任务的执行结果
return getRawResult();
}
/**
* Forks the given tasks, returning when {@code isDone} holds for each task or an (unchecked) exception is encountered,
* in which case the exception is rethrown.
* If more than one task encounters an exception, then this method throws any one of these exceptions.
* If any task encounters an exception, the other may be cancelled.
* However, the execution status of individual tasks is not guaranteed upon exceptional return.
* The status of each task may be obtained using {@link #getException()} and related methods to check if they have been cancelled,
* completed normally or exceptionally, or left unprocessed.
*
* @param task1 the first task
* @param task2 the second task
*
* @throws NullPointerException if any task is null
*/
// 同时执行两个任务。task1选择doInvoke(),而task2选择fork()/doJoin()
public static void invokeAll(ForkJoinTask<?> task1, ForkJoinTask<?> task2) {
// 先把task2交给其他线程去完成
task2.fork();
// 当前线程直接执行task1,最后返回任务状态。必要时,需要等待其他任务的完成
int s1 = task1.doInvoke();
// 如果任务带有[非正常完成]的标记,则需要报告异常
if((s1 & ABNORMAL) != 0) {
// 报告异常信息
task1.reportException(s1);
}
// 当前线程处理完task1后,需要从【工作队列】的top处取出task2并执行,最后返回任务状态。必要时,需要等待其他任务的完成
int s2 = task2.doJoin();
// 如果任务带有[非正常完成]的标记,则需要报告异常
if((s2 & ABNORMAL) != 0) {
// 报告异常信息
task2.reportException(s2);
}
}
/**
* Forks the given tasks, returning when {@code isDone} holds for
* each task or an (unchecked) exception is encountered, in which
* case the exception is rethrown. If more than one task
* encounters an exception, then this method throws any one of
* these exceptions. If any task encounters an exception, others
* may be cancelled. However, the execution status of individual
* tasks is not guaranteed upon exceptional return. The status of
* each task may be obtained using {@link #getException()} and
* related methods to check if they have been cancelled, completed
* normally or exceptionally, or left unprocessed.
*
* @param tasks the tasks
*
* @throws NullPointerException if any task is null
*/
// 批量执行任务。第一个任务使用doInvoke(),其他任务使用fork()/doJoin()
public static void invokeAll(ForkJoinTask<?>... tasks) {
Throwable ex = null;
for(int i = tasks.length - 1; i >= 0; --i) {
ForkJoinTask<?> task = tasks[i];
if(task == null) {
if(ex == null) {
ex = new NullPointerException();
}
} else if(i != 0) {
task.fork();
} else if((task.doInvoke() & ABNORMAL) != 0 && ex == null) {
// 如果任务被非正常关闭,则返回其异常信息
ex = task.getException();
}
}
for(int i = 1; i<=tasks.length - 1; ++i) {
ForkJoinTask<?> task = tasks[i];
if(task != null) {
if(ex != null) {
// 取消任务,即将当前任务标记为[已完成]|[非正常完成]状态
task.cancel(false);
} else if((task.doJoin() & ABNORMAL) != 0) {
// 如果任务被非正常关闭,则返回其异常信息
ex = task.getException();
}
}
}
if(ex != null) {
rethrow(ex);
}
}
/**
* Forks all tasks in the specified collection, returning when
* {@code isDone} holds for each task or an (unchecked) exception
* is encountered, in which case the exception is rethrown. If
* more than one task encounters an exception, then this method
* throws any one of these exceptions. If any task encounters an
* exception, others may be cancelled. However, the execution
* status of individual tasks is not guaranteed upon exceptional
* return. The status of each task may be obtained using {@link
* #getException()} and related methods to check if they have been
* cancelled, completed normally or exceptionally, or left
* unprocessed.
*
* @param tasks the collection of tasks
* @param <T> the type of the values returned from the tasks
*
* @return the tasks argument, to simplify usage
*
* @throws NullPointerException if tasks or any element are null
*/
// 批量执行任务。第一个任务使用doInvoke(),其他任务使用fork()/doJoin()。最后返回任务的集合。
public static <T extends ForkJoinTask<?>> Collection<T> invokeAll(Collection<T> tasks) {
if(!(tasks instanceof RandomAccess) || !(tasks instanceof List<?>)) {
// 将所有task存入数组后再批量执行
invokeAll(tasks.toArray(new ForkJoinTask<?>[0]));
return tasks;
}
@SuppressWarnings("unchecked")
List<? extends ForkJoinTask<?>> ts = (List<? extends ForkJoinTask<?>>) tasks;
Throwable ex = null;
int last = ts.size() - 1;
for(int i = last; i >= 0; --i) {
ForkJoinTask<?> t = ts.get(i);
if(t == null) {
if(ex == null) {
ex = new NullPointerException();
}
} else if(i != 0) {
t.fork();
} else if((t.doInvoke() & ABNORMAL) != 0 && ex == null) {
// 如果任务被非正常关闭,则返回其异常信息
ex = t.getException();
}
}
for(int i = 1; i<=last; ++i) {
ForkJoinTask<?> t = ts.get(i);
if(t != null) {
if(ex != null) {
// 取消任务,即将当前任务标记为[已完成]|[非正常完成]状态
t.cancel(false);
} else {if((t.doJoin() & ABNORMAL) != 0) {
// 如果任务被非正常关闭,则返回其异常信息
ex = t.getException();
}}
}
}
if(ex != null) {
rethrow(ex);
}
return tasks;
}
/**
* Joins this task, without returning its result or throwing its
* exception. This method may be useful when processing
* collections of tasks when some have been cancelled or otherwise
* known to have aborted.
*/
// 从【工作队列】的top处取出当前任务并执行,不返回任务状态。必要时,需要等待其他任务的完成
public final void quietlyJoin() {
doJoin();
}
/**
* Commences performing this task and awaits its completion if
* necessary, without returning its result or throwing its
* exception.
*/
// 直接执行任务,不返回任务状态。必要时,需要等待其他任务的完成
public final void quietlyInvoke() {
doInvoke();
}
/*▲ 执行 ████████████████████████████████████████████████████████████████████████████████┛ */
/*▼ 加速完成任务 ████████████████████████████████████████████████████████████████████████████████┓ */
/**
* Blocks a non-worker-thread until completion or interruption.
*/
// 【提交线程】先尝试加速当前任务的完成。如果加速失败,则转入wait,等待当前任务执行完后再被唤醒
private int externalInterruptibleAwaitDone() throws InterruptedException {
// 【提交线程】尝试加速当前任务的完成
int s = tryExternalHelp();
// 等待当前任务的完成
if(s >= 0 && (s = (int) STATUS.getAndBitwiseOr(this, SIGNAL)) >= 0) {
synchronized(this) {
for(; ; ) {
if((s = status) >= 0) {
wait(0L);
} else {
notifyAll();
break;
}
}
}
} else {
if(Thread.interrupted()) {
throw new InterruptedException();
}
}
return s;
}
/**
* Tries to help with tasks allowed for external callers.
*
* @return current status
*/
// 【提交线程】尝试加速当前任务的完成
private int tryExternalHelp() {
// 如果任务已完成,直接返回状态标记
if(status<0) {
return status;
}
// 如果是CC型任务
if(this instanceof CountedCompleter) {
// 【提交线程】尝试加速task的完成,并在最终返回任务的状态
return ForkJoinPool.common.externalHelpComplete((CountedCompleter<?>) this, 0);
}
// 移除任务。【提交线程】尝试将当前task从【共享工作池】上的【共享队列】top处移除,返回值代表是否成功移除
if(ForkJoinPool.common.tryExternalUnpush(this)) {
// 执行任务,返回任务执行后的状态
return doExec();
}
return 0;
}
/**
* Possibly executes tasks until the pool hosting the current task
* {@linkplain ForkJoinPool#isQuiescent is quiescent}. This
* method may be of use in designs in which many tasks are forked,
* but none are explicitly joined, instead executing them until
* all are processed.
*/
// 促进【工作线程】走向空闲
public static void helpQuiesce() {
Thread t = Thread.currentThread();
if(t instanceof ForkJoinWorkerThread) {
ForkJoinWorkerThread wt = (ForkJoinWorkerThread) t;
// 【工作线程】促进【工作队列】中任务的完成(使【工作线程】走向空闲)
wt.pool.helpQuiescePool(wt.workQueue);
} else {
// 等待【共享工作池】上的所有【工作队列】变为空闲
ForkJoinPool.quiesceCommonPool();
}
}
/*▲ 加速完成任务 ████████████████████████████████████████████████████████████████████████████████┛ */
/*▼ 阻塞 ████████████████████████████████████████████████████████████████████████████████┓ */
/**
* If not done, sets SIGNAL status and performs Object.wait(timeout).
* This task may or may not be done on exit. Ignores interrupts.
*
* @param timeout using Object.wait conventions.
*/
// 如果任务还未完成,将任务状态标记为[等待],并进入wait状态
final void internalWait(long timeout) {
if((int) STATUS.getAndBitwiseOr(this, SIGNAL) >= 0) {
synchronized(this) {
if(status >= 0) {
try {
wait(timeout);
} catch(InterruptedException ie) {
}
} else {
notifyAll();
}
}
}
}
/**
* Blocks a non-worker-thread until completion.
* @return status upon completion
*/
/*
* 【提交线程】尝试加速当前任务的完成
* 如果加速失败,则使【提交线程】进入wait状态,
* 直到该任务完成后才唤醒该线程
*/
private int externalAwaitDone() {
// 【提交线程】尝试加速当前任务的完成
int s = tryExternalHelp();
if (s >= 0) {
// 添加阻塞标记
s = (int)STATUS.getAndBitwiseOr(this, SIGNAL);
if(s>=0){
boolean interrupted = false;
synchronized (this) {
// 陷入死循环
while(true) {
s = status;
if (s >= 0) {
try {
wait(0L);
} catch (InterruptedException ie) {
interrupted = true;
}
} else {
notifyAll();
break;
}
}
} // while(true)
if (interrupted) {
Thread.currentThread().interrupt();
}
}
}
return s;
}
/*▲ 阻塞 ████████████████████████████████████████████████████████████████████████████████┛ */
/*▼ 完成 ████████████████████████████████████████████████████████████████████████████████┓ */
// 当前任务是否[已完成]
public final boolean isDone() {
return status<0;
}
/**
* Returns {@code true} if this task completed without throwing an
* exception and was not cancelled.
*
* @return {@code true} if this task completed without throwing an
* exception and was not cancelled
*/
// 当前任务[已完成],且是正常完成
public final boolean isCompletedNormally() {
return (status & (DONE | ABNORMAL)) == DONE;
}
/**
* Returns {@code true} if this task threw an exception or was cancelled.
*
* @return {@code true} if this task threw an exception or was cancelled
*/
// 当前任务是否[非正常完成]
public final boolean isCompletedAbnormally() {
return (status & ABNORMAL) != 0;
}
/**
* Sets DONE status and wakes up threads waiting to join this task.
*
* @return status on exit
*/
// 将当前任务标记为[已完成]状态,如果当前任务带有SIGNAL标记,则需唤醒所有处于wait的线程
private int setDone() {
// 更新任务状态为已完成
int s= (int) STATUS.getAndBitwiseOr(this, DONE);
// 如果该任务带有阻塞标记,则唤醒全部线程
if((s & SIGNAL) != 0) {
synchronized(this) {
// 被wait的任务无法定点唤醒,只能全部唤醒
notifyAll();
}
}
// 添加[已完成]标记
return s | DONE;
}
/**
* Completes this task normally without setting a value.
* The most recent value established by {@link #setRawResult} (or {@code null} by default)
* will be returned as the result of subsequent invocations of {@code join} and related operations.
*
* @since 1.8
*/
// 静默完成,即将当前任务标记为[已完成]状态(不会改变当前任务挂起的次数)
public final void quietlyComplete() {