TaskCompletionQueue.cs 2.5 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980
  1. //
  2. // TaskCompletionQueue.cs
  3. //
  4. // Authors:
  5. // Jérémie Laval <jeremie dot laval at xamarin dot com>
  6. //
  7. // Copyright 2011 Xamarin Inc (http://www.xamarin.com).
  8. //
  9. // Permission is hereby granted, free of charge, to any person obtaining a copy
  10. // of this software and associated documentation files (the "Software"), to deal
  11. // in the Software without restriction, including without limitation the rights
  12. // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  13. // copies of the Software, and to permit persons to whom the Software is
  14. // furnished to do so, subject to the following conditions:
  15. //
  16. // The above copyright notice and this permission notice shall be included in
  17. // all copies or substantial portions of the Software.
  18. //
  19. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. // THE SOFTWARE.
  26. //
  27. //
  28. #if NET_4_0
  29. using System;
  30. using System.Threading;
  31. using System.Collections.Generic;
  32. using System.Collections.Concurrent;
  33. namespace System.Threading.Tasks
  34. {
  35. internal struct TaskCompletionQueue<TCompletion> where TCompletion : class
  36. {
  37. TCompletion single;
  38. ConcurrentOrderedList<TCompletion> completed;
  39. public void Add (TCompletion continuation)
  40. {
  41. if (single == null && Interlocked.CompareExchange (ref single, continuation, null) == null)
  42. return;
  43. if (completed == null)
  44. Interlocked.CompareExchange (ref completed, new ConcurrentOrderedList<TCompletion> (), null);
  45. completed.TryAdd (continuation);
  46. }
  47. public bool Remove (TCompletion continuation)
  48. {
  49. TCompletion temp = single;
  50. if (temp != null && temp == continuation && Interlocked.CompareExchange (ref single, null, continuation) == continuation)
  51. return true;
  52. if (completed != null)
  53. return completed.TryRemove (continuation);
  54. return false;
  55. }
  56. public bool HasElements {
  57. get {
  58. return single != null || (completed != null && completed.Count != 0);
  59. }
  60. }
  61. public bool TryGetNextCompletion (out TCompletion continuation)
  62. {
  63. continuation = null;
  64. if (single != null && (continuation = Interlocked.Exchange (ref single, null)) != null)
  65. return true;
  66. return completed != null && completed.TryPop (out continuation);
  67. }
  68. }
  69. }
  70. #endif