/
CancellationTokenSource.cs
1118 lines (1006 loc) · 55.8 KB
/
CancellationTokenSource.cs
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
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.CodeAnalysis;
using System.Runtime.CompilerServices;
using System.Threading.Tasks;
namespace System.Threading
{
/// <summary>Signals to a <see cref="CancellationToken"/> that it should be canceled.</summary>
/// <remarks>
/// <para>
/// <see cref="CancellationTokenSource"/> is used to instantiate a <see cref="CancellationToken"/> (via
/// the source's <see cref="Token">Token</see> property) that can be handed to operations that wish to be
/// notified of cancellation or that can be used to register asynchronous operations for cancellation. That
/// token may have cancellation requested by calling to the source's <see cref="Cancel()"/> method.
/// </para>
/// <para>
/// All members of this class, except <see cref="Dispose()"/>, are thread-safe and may be used
/// concurrently from multiple threads.
/// </para>
/// </remarks>
public class CancellationTokenSource : IDisposable
{
/// <summary>A <see cref="CancellationTokenSource"/> that's already canceled.</summary>
internal static readonly CancellationTokenSource s_canceledSource = new CancellationTokenSource() { _state = NotifyingCompleteState };
/// <summary>A <see cref="CancellationTokenSource"/> that's never canceled. This isn't enforced programmatically, only by usage. Do not cancel!</summary>
internal static readonly CancellationTokenSource s_neverCanceledSource = new CancellationTokenSource();
/// <summary>Delegate used with <see cref="Timer"/> to trigger cancellation of a <see cref="CancellationTokenSource"/>.</summary>
private static readonly TimerCallback s_timerCallback = TimerCallback;
private static void TimerCallback(object? state) => // separated out into a named method to improve Timer diagnostics in a debugger
((CancellationTokenSource)state!).NotifyCancellation(throwOnFirstException: false); // skip ThrowIfDisposed() check in Cancel()
/// <summary>The current state of the CancellationTokenSource.</summary>
private volatile int _state;
/// <summary>Whether this <see cref="CancellationTokenSource"/> has been disposed.</summary>
private bool _disposed;
/// <summary>TimerQueueTimer used by CancelAfter and Timer-related ctors. Used instead of Timer to avoid extra allocations and because the rooted behavior is desired.</summary>
private volatile TimerQueueTimer? _timer;
/// <summary><see cref="System.Threading.WaitHandle"/> lazily initialized and returned from <see cref="WaitHandle"/>.</summary>
private volatile ManualResetEvent? _kernelEvent;
/// <summary>Registration state for the source.</summary>
/// <remarks>Lazily-initialized, also serving as the lock to protect its contained state.</remarks>
private Registrations? _registrations;
// legal values for _state
private const int NotCanceledState = 0; // default value of _state
private const int NotifyingState = 1;
private const int NotifyingCompleteState = 2;
/// <summary>Gets whether cancellation has been requested for this <see cref="CancellationTokenSource" />.</summary>
/// <value>Whether cancellation has been requested for this <see cref="CancellationTokenSource" />.</value>
/// <remarks>
/// <para>
/// This property indicates whether cancellation has been requested for this token source, such as
/// due to a call to its <see cref="Cancel()"/> method.
/// </para>
/// <para>
/// If this property returns true, it only guarantees that cancellation has been requested. It does not
/// guarantee that every handler registered with the corresponding token has finished executing, nor
/// that cancellation requests have finished propagating to all registered handlers. Additional
/// synchronization may be required, particularly in situations where related objects are being
/// canceled concurrently.
/// </para>
/// </remarks>
public bool IsCancellationRequested => _state != NotCanceledState;
/// <summary>A simple helper to determine whether cancellation has finished.</summary>
internal bool IsCancellationCompleted => _state == NotifyingCompleteState;
/// <summary>Gets the <see cref="CancellationToken"/> associated with this <see cref="CancellationTokenSource"/>.</summary>
/// <value>The <see cref="CancellationToken"/> associated with this <see cref="CancellationTokenSource"/>.</value>
/// <exception cref="ObjectDisposedException">The token source has been disposed.</exception>
public CancellationToken Token
{
get
{
ThrowIfDisposed();
return new CancellationToken(this);
}
}
internal WaitHandle WaitHandle
{
get
{
ThrowIfDisposed();
// Return the handle if it was already allocated.
if (_kernelEvent != null)
{
return _kernelEvent;
}
// Lazily-initialize the handle.
var mre = new ManualResetEvent(false);
if (Interlocked.CompareExchange(ref _kernelEvent, mre, null) != null)
{
mre.Dispose();
}
// There is a race condition between checking IsCancellationRequested and setting the event.
// However, at this point, the kernel object definitely exists and the cases are:
// 1. if IsCancellationRequested = true, then we will call Set()
// 2. if IsCancellationRequested = false, then NotifyCancellation will see that the event exists, and will call Set().
if (IsCancellationRequested)
{
_kernelEvent.Set();
}
return _kernelEvent;
}
}
/// <summary>Initializes the <see cref="CancellationTokenSource"/>.</summary>
public CancellationTokenSource() { }
/// <summary>
/// Constructs a <see cref="CancellationTokenSource"/> that will be canceled after a specified time span.
/// </summary>
/// <param name="delay">The time span to wait before canceling this <see cref="CancellationTokenSource"/></param>
/// <exception cref="ArgumentOutOfRangeException">
/// The <paramref name="delay"/> is less than -1 or greater than the maximum allowed timer duration.
/// </exception>
/// <remarks>
/// <para>
/// The countdown for the delay starts during the call to the constructor. When the delay expires,
/// the constructed <see cref="CancellationTokenSource"/> is canceled, if it has
/// not been canceled already.
/// </para>
/// <para>
/// Subsequent calls to CancelAfter will reset the delay for the constructed
/// <see cref="CancellationTokenSource"/>, if it has not been
/// canceled already.
/// </para>
/// </remarks>
public CancellationTokenSource(TimeSpan delay)
{
long totalMilliseconds = (long)delay.TotalMilliseconds;
if (totalMilliseconds < -1 || totalMilliseconds > Timer.MaxSupportedTimeout)
{
ThrowHelper.ThrowArgumentOutOfRangeException(ExceptionArgument.delay);
}
InitializeWithTimer((uint)totalMilliseconds);
}
/// <summary>
/// Constructs a <see cref="CancellationTokenSource"/> that will be canceled after a specified time span.
/// </summary>
/// <param name="millisecondsDelay">The time span to wait before canceling this <see cref="CancellationTokenSource"/></param>
/// <exception cref="ArgumentOutOfRangeException">
/// The exception that is thrown when <paramref name="millisecondsDelay"/> is less than -1.
/// </exception>
/// <remarks>
/// <para>
/// The countdown for the millisecondsDelay starts during the call to the constructor. When the millisecondsDelay expires,
/// the constructed <see cref="CancellationTokenSource"/> is canceled (if it has
/// not been canceled already).
/// </para>
/// <para>
/// Subsequent calls to CancelAfter will reset the millisecondsDelay for the constructed
/// <see cref="CancellationTokenSource"/>, if it has not been
/// canceled already.
/// </para>
/// </remarks>
public CancellationTokenSource(int millisecondsDelay)
{
if (millisecondsDelay < -1)
{
ThrowHelper.ThrowArgumentOutOfRangeException(ExceptionArgument.millisecondsDelay);
}
InitializeWithTimer((uint)millisecondsDelay);
}
/// <summary>
/// Common initialization logic when constructing a CTS with a delay parameter.
/// A zero delay will result in immediate cancellation.
/// </summary>
private void InitializeWithTimer(uint millisecondsDelay)
{
if (millisecondsDelay == 0)
{
_state = NotifyingCompleteState;
}
else
{
_timer = new TimerQueueTimer(s_timerCallback, this, millisecondsDelay, Timeout.UnsignedInfinite, flowExecutionContext: false);
// The timer roots this CTS instance while it's scheduled. That is by design, so
// that code like:
// new CancellationTokenSource(timeout).Token.Register(() => ...);
// will successfully invoke the delegate after the timeout.
}
}
/// <summary>Communicates a request for cancellation.</summary>
/// <remarks>
/// <para>
/// The associated <see cref="CancellationToken" /> will be notified of the cancellation
/// and will transition to a state where <see cref="CancellationToken.IsCancellationRequested"/> returns true.
/// Any callbacks or cancelable operations registered with the <see cref="CancellationToken"/> will be executed.
/// </para>
/// <para>
/// Cancelable operations and callbacks registered with the token should not throw exceptions.
/// However, this overload of Cancel will aggregate any exceptions thrown into a <see cref="AggregateException"/>,
/// such that one callback throwing an exception will not prevent other registered callbacks from being executed.
/// </para>
/// <para>
/// The <see cref="ExecutionContext"/> that was captured when each callback was registered
/// will be reestablished when the callback is invoked.
/// </para>
/// </remarks>
/// <exception cref="AggregateException">An aggregate exception containing all the exceptions thrown
/// by the registered callbacks on the associated <see cref="CancellationToken"/>.</exception>
/// <exception cref="ObjectDisposedException">This <see cref="CancellationTokenSource"/> has been disposed.</exception>
public void Cancel() => Cancel(false);
/// <summary>Communicates a request for cancellation.</summary>
/// <remarks>
/// <para>
/// The associated <see cref="CancellationToken" /> will be notified of the cancellation and will transition to a state where
/// <see cref="CancellationToken.IsCancellationRequested"/> returns true. Any callbacks or cancelable operationsregistered
/// with the <see cref="CancellationToken"/> will be executed.
/// </para>
/// <para>
/// Cancelable operations and callbacks registered with the token should not throw exceptions.
/// If <paramref name="throwOnFirstException"/> is true, an exception will immediately propagate out of the
/// call to Cancel, preventing the remaining callbacks and cancelable operations from being processed.
/// If <paramref name="throwOnFirstException"/> is false, this overload will aggregate any
/// exceptions thrown into a <see cref="AggregateException"/>,
/// such that one callback throwing an exception will not prevent other registered callbacks from being executed.
/// </para>
/// <para>
/// The <see cref="ExecutionContext"/> that was captured when each callback was registered
/// will be reestablished when the callback is invoked.
/// </para>
/// </remarks>
/// <param name="throwOnFirstException">Specifies whether exceptions should immediately propagate.</param>
/// <exception cref="AggregateException">An aggregate exception containing all the exceptions thrown
/// by the registered callbacks on the associated <see cref="CancellationToken"/>.</exception>
/// <exception cref="ObjectDisposedException">This <see cref="CancellationTokenSource"/> has been disposed.</exception>
public void Cancel(bool throwOnFirstException)
{
ThrowIfDisposed();
NotifyCancellation(throwOnFirstException);
}
/// <summary>Schedules a Cancel operation on this <see cref="CancellationTokenSource"/>.</summary>
/// <param name="delay">The time span to wait before canceling this <see cref="CancellationTokenSource"/>.
/// </param>
/// <exception cref="ObjectDisposedException">The exception thrown when this <see
/// cref="CancellationTokenSource"/> has been disposed.
/// </exception>
/// <exception cref="ArgumentOutOfRangeException">
/// The <paramref name="delay"/> is less than -1 or greater than maximum allowed timer duration.
/// </exception>
/// <remarks>
/// <para>
/// The countdown for the delay starts during this call. When the delay expires,
/// this <see cref="CancellationTokenSource"/> is canceled, if it has
/// not been canceled already.
/// </para>
/// <para>
/// Subsequent calls to CancelAfter will reset the delay for this
/// <see cref="CancellationTokenSource"/>, if it has not been canceled already.
/// </para>
/// </remarks>
public void CancelAfter(TimeSpan delay)
{
long totalMilliseconds = (long)delay.TotalMilliseconds;
if (totalMilliseconds < -1 || totalMilliseconds > Timer.MaxSupportedTimeout)
{
ThrowHelper.ThrowArgumentOutOfRangeException(ExceptionArgument.delay);
}
CancelAfter((uint)totalMilliseconds);
}
/// <summary>
/// Schedules a Cancel operation on this <see cref="CancellationTokenSource"/>.
/// </summary>
/// <param name="millisecondsDelay">The time span to wait before canceling this <see
/// cref="CancellationTokenSource"/>.
/// </param>
/// <exception cref="ObjectDisposedException">The exception thrown when this <see
/// cref="CancellationTokenSource"/> has been disposed.
/// </exception>
/// <exception cref="ArgumentOutOfRangeException">
/// The exception thrown when <paramref name="millisecondsDelay"/> is less than -1.
/// </exception>
/// <remarks>
/// <para>
/// The countdown for the millisecondsDelay starts during this call. When the millisecondsDelay expires,
/// this <see cref="CancellationTokenSource"/> is canceled, if it has
/// not been canceled already.
/// </para>
/// <para>
/// Subsequent calls to CancelAfter will reset the millisecondsDelay for this
/// <see cref="CancellationTokenSource"/>, if it has not been
/// canceled already.
/// </para>
/// </remarks>
public void CancelAfter(int millisecondsDelay)
{
if (millisecondsDelay < -1)
{
ThrowHelper.ThrowArgumentOutOfRangeException(ExceptionArgument.millisecondsDelay);
}
CancelAfter((uint)millisecondsDelay);
}
private void CancelAfter(uint millisecondsDelay)
{
ThrowIfDisposed();
if (IsCancellationRequested)
{
return;
}
// There is a race condition here as a Cancel could occur between the check of
// IsCancellationRequested and the creation of the timer. This is benign; in the
// worst case, a timer will be created that has no effect when it expires.
// Also, if Dispose() is called right here (after ThrowIfDisposed(), before timer
// creation), it would result in a leaked Timer object (at least until the timer
// expired and Disposed itself). But this would be considered bad behavior, as
// Dispose() is not thread-safe and should not be called concurrently with CancelAfter().
TimerQueueTimer? timer = _timer;
if (timer == null)
{
// Lazily initialize the timer in a thread-safe fashion.
// Initially set to "never go off" because we don't want to take a
// chance on a timer "losing" the initialization and then
// cancelling the token before it (the timer) can be disposed.
timer = new TimerQueueTimer(s_timerCallback, this, Timeout.UnsignedInfinite, Timeout.UnsignedInfinite, flowExecutionContext: false);
TimerQueueTimer? currentTimer = Interlocked.CompareExchange(ref _timer, timer, null);
if (currentTimer != null)
{
// We did not initialize the timer. Dispose the new timer.
timer.Close();
timer = currentTimer;
}
}
timer.Change(millisecondsDelay, Timeout.UnsignedInfinite, throwIfDisposed: false);
}
/// <summary>
/// Attempts to reset the <see cref="CancellationTokenSource"/> to be used for an unrelated operation.
/// </summary>
/// <returns>
/// true if the <see cref="CancellationTokenSource"/> has not had cancellation requested and could
/// have its state reset to be reused for a subsequent operation; otherwise, false.
/// </returns>
/// <remarks>
/// <see cref="TryReset"/> is intended to be used by the sole owner of the <see cref="CancellationTokenSource"/>
/// when it is known that the operation with which the <see cref="CancellationTokenSource"/> was used has
/// completed, no one else will be attempting to cancel it, and any registrations still remaining are erroneous.
/// Upon a successful reset, such registrations will no longer be notified for any subsequent cancellation of the
/// <see cref="CancellationTokenSource"/>; however, if any component still holds a reference to this
/// <see cref="CancellationTokenSource"/> either directly or indirectly via a <see cref="CancellationToken"/>
/// handed out from it, polling via their reference will show the current state any time after the reset as
/// it's the same instance. Usage of <see cref="TryReset"/> concurrently with requesting cancellation is not
/// thread-safe and may result in TryReset returning true even if cancellation was already requested and may result
/// in registrations not being invoked as part of the concurrent cancellation request.
/// </remarks>
public bool TryReset()
{
ThrowIfDisposed();
// We can only reset if cancellation has not yet been requested: we never want to allow a CancellationToken
// to transition from canceled to non-canceled.
if (_state == NotCanceledState)
{
// If there is no timer, then we're free to reset. If there is a timer, then we need to first try
// to reset it to be infinite so that it won't fire, and then recognize that it could have already
// fired by the time we successfully changed it, and so check to see whether that's possibly the case.
// If we successfully reset it and it never fired, then we can be sure it won't trigger cancellation.
bool reset =
_timer is not TimerQueueTimer timer ||
(timer.Change(Timeout.UnsignedInfinite, Timeout.UnsignedInfinite, throwIfDisposed: false) && !timer._everQueued);
if (reset)
{
// We're not canceled and no timer will run to cancel us.
// Clear out all the registrations, and return that we've successfully reset.
Volatile.Read(ref _registrations)?.UnregisterAll();
return true;
}
}
// Failed to reset.
return false;
}
/// <summary>Releases the resources used by this <see cref="CancellationTokenSource" />.</summary>
/// <remarks>This method is not thread-safe for any other concurrent calls.</remarks>
public void Dispose()
{
Dispose(true);
GC.SuppressFinalize(this);
}
/// <summary>
/// Releases the unmanaged resources used by the <see cref="CancellationTokenSource" /> class and optionally releases the managed resources.
/// </summary>
/// <param name="disposing">true to release both managed and unmanaged resources; false to release only unmanaged resources.</param>
protected virtual void Dispose(bool disposing)
{
if (disposing && !_disposed)
{
// We specifically tolerate that a callback can be unregistered
// after the CTS has been disposed and/or concurrently with cts.Dispose().
// This is safe without locks because Dispose doesn't interact with values
// in the callback partitions, only nulling out the ref to existing partitions.
//
// We also tolerate that a callback can be registered after the CTS has been
// disposed. This is safe because InternalRegister is tolerant
// of _callbackPartitions becoming null during its execution. However,
// we run the acceptable risk of _callbackPartitions getting reinitialized
// to non-null if there is a race between Dispose and Register, in which case this
// instance may unnecessarily hold onto a registered callback. But that's no worse
// than if Dispose wasn't safe to use concurrently, as Dispose would never be called,
// and thus no handlers would be dropped.
//
// And, we tolerate Dispose being used concurrently with Cancel. This is necessary
// to properly support, e.g., LinkedCancellationTokenSource, where, due to common usage patterns,
// it's possible for this pairing to occur with valid usage (e.g. a component accepts
// an external CancellationToken and uses CreateLinkedTokenSource to combine it with an
// internal source of cancellation, then Disposes of that linked source, which could
// happen at the same time the external entity is requesting cancellation).
TimerQueueTimer? timer = _timer;
if (timer != null)
{
_timer = null;
timer.Close(); // TimerQueueTimer.Close is thread-safe
}
_registrations = null; // allow the GC to clean up registrations
// If a kernel event was created via WaitHandle, we'd like to Dispose of it. However,
// we only want to do so if it's not being used by Cancel concurrently. First, we
// interlocked exchange it to be null, and then we check whether cancellation is currently
// in progress. NotifyCancellation will only try to set the event if it exists after it's
// transitioned to and while it's in the NotifyingState.
if (_kernelEvent != null)
{
ManualResetEvent? mre = Interlocked.Exchange<ManualResetEvent?>(ref _kernelEvent!, null);
if (mre != null && _state != NotifyingState)
{
mre.Dispose();
}
}
_disposed = true;
}
}
/// <summary>Throws an exception if the source has been disposed.</summary>
private void ThrowIfDisposed()
{
if (_disposed)
{
ThrowHelper.ThrowObjectDisposedException(ExceptionResource.CancellationTokenSource_Disposed);
}
}
/// <summary>
/// Registers a callback object. If cancellation has already occurred, the
/// callback will have been run by the time this method returns.
/// </summary>
internal CancellationTokenRegistration Register(
Delegate callback, object? stateForCallback, SynchronizationContext? syncContext, ExecutionContext? executionContext)
{
Debug.Assert(this != s_neverCanceledSource, "This source should never be exposed via a CancellationToken.");
Debug.Assert(callback is Action<object?> || callback is Action<object?, CancellationToken>);
// If not canceled, register the handler; if canceled already, run the callback synchronously.
if (!IsCancellationRequested)
{
// We allow Dispose to be called concurrently with Register. While this is not a recommended practice,
// consumers can and do use it this way.
if (_disposed)
{
return default;
}
// Get the registrations object. It's lazily initialized to keep the size of a CTS smaller for situations
// where all operations associated with the CTS complete synchronously and never actually need to register,
// or all only poll.
Registrations? registrations = Volatile.Read(ref _registrations);
if (registrations is null)
{
registrations = new Registrations(this);
registrations = Interlocked.CompareExchange(ref _registrations, registrations, null) ?? registrations;
}
// If it looks like there's a node in the freelist we could grab, grab the lock and try to get, configure,
// and register the node.
CallbackNode? node = null;
long id = 0;
if (registrations.FreeNodeList is not null)
{
registrations.EnterLock();
try
{
// Try to take a free node. If we're able to, configure the node and register it.
node = registrations.FreeNodeList;
if (node is not null)
{
Debug.Assert(node.Prev == null, "Nodes in the free list should all have a null Prev");
registrations.FreeNodeList = node.Next;
node.Id = id = registrations.NextAvailableId++;
node.Callback = callback;
node.CallbackState = stateForCallback;
node.ExecutionContext = executionContext;
node.SynchronizationContext = syncContext;
node.Next = registrations.Callbacks;
registrations.Callbacks = node;
if (node.Next != null)
{
node.Next.Prev = node;
}
}
}
finally
{
registrations.ExitLock();
}
}
// If we were unsuccessful in using a free node, create a new one, configure it, and register it.
if (node is null)
{
// Allocate the node if we couldn't get one from the free list. We avoid
// doing this while holding the spin lock, to avoid a potentially arbitrary
// amount of GC-related work under the lock, which we aim to keep very tight,
// just a few assignments.
node = new CallbackNode(registrations);
node.Callback = callback;
node.CallbackState = stateForCallback;
node.ExecutionContext = executionContext;
node.SynchronizationContext = syncContext;
registrations.EnterLock();
try
{
node.Id = id = registrations.NextAvailableId++;
node.Next = registrations.Callbacks;
if (node.Next != null)
{
node.Next.Prev = node;
}
registrations.Callbacks = node;
}
finally
{
registrations.ExitLock();
}
}
// If cancellation hasn't been requested, return the registration.
// if cancellation has been requested, try to undo the registration and run the callback
// ourselves, but if we can't unregister it (e.g. the thread running Cancel snagged
// our callback for execution), return the registration so that the caller can wait
// for callback completion in ctr.Dispose().
Debug.Assert(id != 0, "IDs should never be the reserved value 0.");
if (!IsCancellationRequested || !registrations.Unregister(id, node))
{
return new CancellationTokenRegistration(id, node);
}
}
// Cancellation already occurred. Run the callback on this thread and return an empty registration.
Invoke(callback, stateForCallback, this);
return default;
}
private void NotifyCancellation(bool throwOnFirstException)
{
// If we're the first to signal cancellation, do the main extra work.
if (!IsCancellationRequested && Interlocked.CompareExchange(ref _state, NotifyingState, NotCanceledState) == NotCanceledState)
{
// Dispose of the timer, if any. Dispose may be running concurrently here, but TimerQueueTimer.Close is thread-safe.
TimerQueueTimer? timer = _timer;
if (timer != null)
{
_timer = null;
timer.Close();
}
// Set the event if it's been lazily initialized and hasn't yet been disposed of. Dispose may
// be running concurrently, in which case either it'll have set m_kernelEvent back to null and
// we won't see it here, or it'll see that we've transitioned to NOTIFYING and will skip disposing it,
// leaving cleanup to finalization.
_kernelEvent?.Set(); // update the MRE value.
// - late enlisters to the Canceled event will have their callbacks called immediately in the Register() methods.
// - Callbacks are not called inside a lock.
// - After transition, no more delegates will be added to the
// - list of handlers, and hence it can be consumed and cleared at leisure by ExecuteCallbackHandlers.
ExecuteCallbackHandlers(throwOnFirstException);
Debug.Assert(IsCancellationCompleted, "Expected cancellation to have finished");
}
}
/// <summary>Invoke all registered callbacks.</summary>
/// <remarks>The handlers are invoked synchronously in LIFO order.</remarks>
private void ExecuteCallbackHandlers(bool throwOnFirstException)
{
Debug.Assert(IsCancellationRequested, "ExecuteCallbackHandlers should only be called after setting IsCancellationRequested->true");
// If there are no callbacks to run, we can safely exit. Any race conditions to lazy initialize it
// will see IsCancellationRequested and will then run the callback themselves.
Registrations? registrations = Interlocked.Exchange(ref _registrations, null);
if (registrations is null)
{
Interlocked.Exchange(ref _state, NotifyingCompleteState);
return;
}
// Record the threadID being used for running the callbacks.
registrations.ThreadIDExecutingCallbacks = Environment.CurrentManagedThreadId;
List<Exception>? exceptionList = null;
try
{
// We call the delegates in LIFO order on each partition so that callbacks fire 'deepest first'.
// This is intended to help with nesting scenarios so that child enlisters cancel before their parents.
// Iterate through all nodes in the partition. We remove each node prior
// to processing it. This allows for unregistration of subsequent registrations
// to still be effective even as other registrations are being invoked.
while (true)
{
CallbackNode? node;
registrations.EnterLock();
try
{
// Pop the next registration from the callbacks list.
node = registrations.Callbacks;
if (node == null)
{
// No more registrations to process.
break;
}
Debug.Assert(node.Registrations.Source == this);
Debug.Assert(node.Prev == null);
if (node.Next != null)
{
node.Next.Prev = null;
}
registrations.Callbacks = node.Next;
// Publish the intended callback ID, to ensure ctr.Dispose can tell if a wait is necessary.
// This write happens while the lock is held so that Dispose is either able to successfully
// unregister or is guaranteed to see an accurate executing callback ID, since it takes
// the same lock to remove the node from the callback list.
registrations.ExecutingCallbackId = node.Id;
// Now that we've grabbed the Id, reset the node's Id to 0. This signals
// to code unregistering that the node is no longer associated with a callback.
node.Id = 0;
}
finally
{
registrations.ExitLock();
}
// Invoke the callback on this thread if there's no sync context or on the
// target sync context if there is one.
try
{
if (node.SynchronizationContext != null)
{
// Transition to the target syncContext and continue there.
node.SynchronizationContext.Send(static s =>
{
var n = (CallbackNode)s!;
n.Registrations.ThreadIDExecutingCallbacks = Environment.CurrentManagedThreadId;
n.ExecuteCallback();
}, node);
registrations.ThreadIDExecutingCallbacks = Environment.CurrentManagedThreadId; // above may have altered ThreadIDExecutingCallbacks, so reset it
}
else
{
node.ExecuteCallback();
}
}
catch (Exception ex) when (!throwOnFirstException)
{
// Store the exception and continue
(exceptionList ??= new List<Exception>()).Add(ex);
}
// Drop the node. While we could add it to the free list, doing so has cost (we'd need to take the lock again)
// and very limited value. Since a source can only be canceled once, and after it's canceled registrations don't
// need nodes, the only benefit to putting this on the free list would be if Register raced with cancellation
// occurring, such that it could have used this free node but would instead need to allocate a new node (if
// there wasn't another free node available).
}
}
finally
{
_state = NotifyingCompleteState;
Interlocked.Exchange(ref registrations.ExecutingCallbackId, 0); // for safety, prevent reorderings crossing this point and seeing inconsistent state.
}
if (exceptionList != null)
{
Debug.Assert(exceptionList.Count > 0, $"Expected {exceptionList.Count} > 0");
throw new AggregateException(exceptionList);
}
}
/// <summary>
/// Creates a <see cref="CancellationTokenSource"/> that will be in the canceled state
/// when any of the source tokens are in the canceled state.
/// </summary>
/// <param name="token1">The first <see cref="CancellationToken">CancellationToken</see> to observe.</param>
/// <param name="token2">The second <see cref="CancellationToken">CancellationToken</see> to observe.</param>
/// <returns>A <see cref="CancellationTokenSource"/> that is linked
/// to the source tokens.</returns>
public static CancellationTokenSource CreateLinkedTokenSource(CancellationToken token1, CancellationToken token2) =>
!token1.CanBeCanceled ? CreateLinkedTokenSource(token2) :
token2.CanBeCanceled ? new Linked2CancellationTokenSource(token1, token2) :
(CancellationTokenSource)new Linked1CancellationTokenSource(token1);
/// <summary>
/// Creates a <see cref="CancellationTokenSource"/> that will be in the canceled state
/// when the supplied token is in the canceled state.
/// </summary>
/// <param name="token">The <see cref="CancellationToken">CancellationToken</see> to observe.</param>
/// <returns>A <see cref="CancellationTokenSource"/> that is linked to the source token.</returns>
public static CancellationTokenSource CreateLinkedTokenSource(CancellationToken token) =>
token.CanBeCanceled ? new Linked1CancellationTokenSource(token) : new CancellationTokenSource();
/// <summary>
/// Creates a <see cref="CancellationTokenSource"/> that will be in the canceled state
/// when any of the source tokens are in the canceled state.
/// </summary>
/// <param name="tokens">The <see cref="CancellationToken">CancellationToken</see> instances to observe.</param>
/// <returns>A <see cref="CancellationTokenSource"/> that is linked to the source tokens.</returns>
/// <exception cref="System.ArgumentNullException"><paramref name="tokens"/> is null.</exception>
public static CancellationTokenSource CreateLinkedTokenSource(params CancellationToken[] tokens)
{
ArgumentNullException.ThrowIfNull(tokens);
return tokens.Length switch
{
0 => throw new ArgumentException(SR.CancellationToken_CreateLinkedToken_TokensIsEmpty),
1 => CreateLinkedTokenSource(tokens[0]),
2 => CreateLinkedTokenSource(tokens[0], tokens[1]),
// a defensive copy is not required as the array has value-items that have only a single reference field,
// hence each item cannot be null itself, and reads of the payloads cannot be torn.
_ => new LinkedNCancellationTokenSource(tokens),
};
}
private sealed class Linked1CancellationTokenSource : CancellationTokenSource
{
private readonly CancellationTokenRegistration _reg1;
internal Linked1CancellationTokenSource(CancellationToken token1)
{
_reg1 = token1.UnsafeRegister(LinkedNCancellationTokenSource.s_linkedTokenCancelDelegate, this);
}
protected override void Dispose(bool disposing)
{
if (!disposing || _disposed)
{
return;
}
_reg1.Dispose();
base.Dispose(disposing);
}
}
private sealed class Linked2CancellationTokenSource : CancellationTokenSource
{
private readonly CancellationTokenRegistration _reg1;
private readonly CancellationTokenRegistration _reg2;
internal Linked2CancellationTokenSource(CancellationToken token1, CancellationToken token2)
{
_reg1 = token1.UnsafeRegister(LinkedNCancellationTokenSource.s_linkedTokenCancelDelegate, this);
_reg2 = token2.UnsafeRegister(LinkedNCancellationTokenSource.s_linkedTokenCancelDelegate, this);
}
protected override void Dispose(bool disposing)
{
if (!disposing || _disposed)
{
return;
}
_reg1.Dispose();
_reg2.Dispose();
base.Dispose(disposing);
}
}
private sealed class LinkedNCancellationTokenSource : CancellationTokenSource
{
internal static readonly Action<object?> s_linkedTokenCancelDelegate = static s =>
{
Debug.Assert(s is CancellationTokenSource, $"Expected {typeof(CancellationTokenSource)}, got {s}");
((CancellationTokenSource)s).NotifyCancellation(throwOnFirstException: false); // skip ThrowIfDisposed() check in Cancel()
};
private CancellationTokenRegistration[]? _linkingRegistrations;
internal LinkedNCancellationTokenSource(CancellationToken[] tokens)
{
_linkingRegistrations = new CancellationTokenRegistration[tokens.Length];
for (int i = 0; i < tokens.Length; i++)
{
if (tokens[i].CanBeCanceled)
{
_linkingRegistrations[i] = tokens[i].UnsafeRegister(s_linkedTokenCancelDelegate, this);
}
// Empty slots in the array will be default(CancellationTokenRegistration), which are nops to Dispose.
// Based on usage patterns, such occurrences should also be rare, such that it's not worth resizing
// the array and incurring the related costs.
}
}
protected override void Dispose(bool disposing)
{
if (!disposing || _disposed)
{
return;
}
CancellationTokenRegistration[]? linkingRegistrations = _linkingRegistrations;
if (linkingRegistrations != null)
{
_linkingRegistrations = null; // release for GC once we're done enumerating
for (int i = 0; i < linkingRegistrations.Length; i++)
{
linkingRegistrations[i].Dispose();
}
}
base.Dispose(disposing);
}
}
private static void Invoke(Delegate d, object? state, CancellationTokenSource source)
{
Debug.Assert(d is Action<object?> || d is Action<object?, CancellationToken>);
if (d is Action<object?> actionWithState)
{
actionWithState(state);
}
else
{
((Action<object?, CancellationToken>)d)(state, new CancellationToken(source));
}
}
/// <summary>Set of all the registrations in the token source.</summary>
/// <remarks>
/// Separated out into a separate instance to keep CancellationTokenSource smaller for the case where one is created but nothing is registered with it.
/// This happens not infrequently, in particular when one is created for an operation that ends up completing synchronously / quickly.
/// </remarks>
internal sealed class Registrations
{
/// <summary>The associated source.</summary>
public readonly CancellationTokenSource Source;
/// <summary>Doubly-linked list of callbacks registered with the source. Callbacks are removed during unregistration and as they're invoked.</summary>
public CallbackNode? Callbacks;
/// <summary>Singly-linked list of free nodes that can be used for subsequent callback registrations.</summary>
public CallbackNode? FreeNodeList;
/// <summary>Every callback is assigned a unique, never-reused ID. This defines the next available ID.</summary>
public long NextAvailableId = 1; // avoid using 0, as that's the default long value and used to represent an empty node
/// <summary>Tracks the running callback to assist ctr.Dispose() to wait for the target callback to complete.</summary>
public long ExecutingCallbackId;
/// <summary>The ID of the thread currently executing the main body of CTS.Cancel()</summary>
/// <remarks>
/// This helps us to know if a call to ctr.Dispose() is running 'within' a cancellation callback.
/// This is updated as we move between the main thread calling cts.Cancel() and any syncContexts
/// that are used to actually run the callbacks.
/// </remarks>
public volatile int ThreadIDExecutingCallbacks = -1;
/// <summary>Spin lock that protects state in the instance.</summary>
private int _lock;
/// <summary>Initializes the instance.</summary>
/// <param name="source">The associated source.</param>
public Registrations(CancellationTokenSource source) => Source = source;
[MethodImpl(MethodImplOptions.AggressiveInlining)] // used in only two places, one of which is a hot path
private void Recycle(CallbackNode node)
{
Debug.Assert(_lock == 1);
// Clear out the unused node and put it on the singly-linked free list.
// The only field we don't clear out is the associated Registrations, as that's fixed
// throughout the node's lifetime.
node.Id = 0;
node.Callback = null;
node.CallbackState = null;
node.ExecutionContext = null;
node.SynchronizationContext = null;
node.Prev = null;
node.Next = FreeNodeList;
FreeNodeList = node;
}
/// <summary>Unregisters a callback.</summary>
/// <param name="id">The expected id of the registration.</param>
/// <param name="node">The callback node.</param>
/// <returns>true if the node was found and removed; false if it couldn't be found or didn't match the provided id.</returns>
public bool Unregister(long id, CallbackNode node)
{
Debug.Assert(node != null, "Expected non-null node");
Debug.Assert(node.Registrations == this, "Expected node to come from this registrations instance");
if (id == 0)
{
// In general, we won't get 0 passed in here. However, race conditions between threads
// Unregistering and also zero'ing out the CancellationTokenRegistration could cause 0
// to be passed in here, in which case there's nothing to do. 0 is never a valid id.
return false;
}
EnterLock();
try
{
if (node.Id != id)
{
// Either:
// - The callback is currently or has already been invoked, in which case node.Id
// will no longer equal the assigned id, as it will have transitioned to 0.
// - The registration was already disposed of, in which case node.Id will similarly
// no longer equal the assigned id, as it will have transitioned to 0 and potentially
// then to another (larger) value when reused for a new registration.
// In either case, there's nothing to unregister.
return false;
}
// The registration must still be in the callbacks list. Remove it.
if (Callbacks == node)
{
Debug.Assert(node.Prev == null);
Callbacks = node.Next;
}
else
{
Debug.Assert(node.Prev != null);
node.Prev.Next = node.Next;
}
if (node.Next != null)
{
node.Next.Prev = node.Prev;
}
Recycle(node);
return true;
}
finally
{
ExitLock();
}
}
/// <summary>Moves all registrations to the free list.</summary>
public void UnregisterAll()
{
EnterLock();
try
{
// Null out all callbacks.
CallbackNode? node = Callbacks;
Callbacks = null;
// Reset and move each node that was in the callbacks list to the free list.
while (node != null)
{
CallbackNode? next = node.Next;