Searched refs:QNode (Results 1 - 3 of 3) sorted by relevance

/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DSynchronousQueue.java532 * nodes, and matching is done by CAS'ing QNode.item field
537 static final class QNode { class in class:SynchronousQueue.TransferQueue
538 volatile QNode next; // next node in queue
543 QNode(Object item, boolean isData) { method in class:SynchronousQueue.TransferQueue.QNode
548 boolean casNext(QNode cmp, QNode val) {
586 Class k = QNode.class;
598 transient volatile QNode head;
600 transient volatile QNode tail;
606 transient volatile QNode cleanM
[all...]
H A DPhaser.java347 private final AtomicReference<QNode> evenQ;
348 private final AtomicReference<QNode> oddQ;
350 private AtomicReference<QNode> queueFor(int phase) {
554 this.evenQ = new AtomicReference<QNode>();
555 this.oddQ = new AtomicReference<QNode>();
747 QNode node = new QNode(this, phase, true, false, 0L);
785 QNode node = new QNode(this, phase, true, true, nanos);
964 QNode
1078 static final class QNode implements ForkJoinPool.ManagedBlocker { class in class:Phaser
1089 QNode(Phaser phaser, int phase, boolean interruptible, method in class:Phaser.QNode
[all...]
/openjdk7/jdk/src/share/classes/javax/swing/tree/
H A DDefaultMutableTreeNode.java1401 QNode head; // null if empty
1402 QNode tail;
1404 final class QNode { class in class:DefaultMutableTreeNode.BreadthFirstEnumeration.Queue
1406 public QNode next; // null if end
1407 public QNode(Object object, QNode next) { method in class:DefaultMutableTreeNode.BreadthFirstEnumeration.Queue.QNode
1415 head = tail = new QNode(anObject, null);
1417 tail.next = new QNode(anObject, null);
1428 QNode oldHead = head;

Completed in 57 milliseconds