AtomicList.hx 2.4 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283
  1. /*
  2. * Copyright (C)2005-2019 Haxe Foundation
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a
  5. * copy of this software and associated documentation files (the "Software"),
  6. * to deal in the Software without restriction, including without limitation
  7. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8. * and/or sell copies of the Software, and to permit persons to whom the
  9. * Software is furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice shall be included in
  12. * all copies or substantial portions of the Software.
  13. *
  14. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  19. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  20. * DEALINGS IN THE SOFTWARE.
  21. */
  22. package java.vm;
  23. import java.util.concurrent.atomic.AtomicReference;
  24. /**
  25. A lock-free queue implementation
  26. **/
  27. @:native('haxe.java.vm.AtomicList')
  28. @:nativeGen class AtomicList<T> {
  29. @:volatile @:private var head:AtomicNode<T>;
  30. @:volatile @:private var tail:AtomicReference<AtomicNode<T>>;
  31. public function new() {
  32. this.head = new AtomicNode(null);
  33. this.head.set(new AtomicNode(null));
  34. this.tail = new AtomicReference(head);
  35. }
  36. public function add(v:T) {
  37. var n = new AtomicNode(v), tail = this.tail;
  38. var p = null;
  39. while (!((p = tail.get()).compareAndSet(null, n))) {
  40. tail.compareAndSet(p, p.get());
  41. }
  42. tail.compareAndSet(p, n);
  43. }
  44. public function pop():Null<T> {
  45. var p = null, pget = null, head = head;
  46. do {
  47. p = head.get();
  48. if ((pget = p.get()) == null)
  49. return null; // empty
  50. } while (!head.compareAndSet(p, pget));
  51. var ret = pget.value;
  52. pget.value = null;
  53. return ret;
  54. }
  55. public function peek() {
  56. var ret = head.get();
  57. if (ret == null)
  58. return null; // empty
  59. return ret.value;
  60. }
  61. public function peekLast() {
  62. return tail.get().value;
  63. }
  64. }
  65. @:native('haxe.java.vm.AtomicNode')
  66. @:nativeGen class AtomicNode<T> extends AtomicReference<AtomicNode<T>> {
  67. public var value:T;
  68. public function new(value) {
  69. super();
  70. this.value = value;
  71. }
  72. }