Searched refs:prevNode (Results 1 – 8 of 8) sorted by relevance
109 public actual val prevNode: Node in <lambda>() constant in kotlinx.coroutines.internal.LockFreeLinkedListNode140 if (prevNode.addNext(node, this)) return in <lambda>()152 val prev = prevNode // sentinel node is never removed, so prev is always defined in <lambda>()162 val prev = prevNode // sentinel node is never removed, so prev is always defined in <lambda>()175 val prev = prevNode // sentinel node is never removed, so prev is always defined in <lambda>()
171 String prevNode = String.valueOf(j + (100 * (depth - 1))); in findPredecessorsTiming() local172 g.addPredecessor(newNode, prevNode); in findPredecessorsTiming()
15 public val prevNode: LockFreeLinkedListNode constant in kotlinx.coroutines.internal.LockFreeLinkedListNode
83 …protected val closedForSend: Closed<*>? get() = (queue.prevNode as? Closed<*>)?.also { helpClose(i… in <lambda>()250 val actuallyClosed = if (closeAdded) closed else queue.prevNode as Closed<*> in <lambda>()308 val previous = closed.prevNode as? Receive<E> ?: break in <lambda>()425 val tail = queue.prevNode in <lambda>()659 val previous = closed.prevNode in onCancelIdempotent()
368 Operation *prevNode = getPrevNode(); in updateOrderIfNecessary() local369 if (!prevNode->hasValidOrder()) in updateOrderIfNecessary()373 orderIndex = prevNode->orderIndex + kOrderStride; in updateOrderIfNecessary()398 Operation *prevNode = getPrevNode(), *nextNode = getNextNode(); in updateOrderIfNecessary() local399 if (!prevNode->hasValidOrder() || !nextNode->hasValidOrder()) in updateOrderIfNecessary()401 unsigned prevOrder = prevNode->orderIndex, nextOrder = nextNode->orderIndex; in updateOrderIfNecessary()
24 public inline val prevNode get() = _prev constant in kotlinx.coroutines.internal.LinkedListNode
938 while (cur.isRemoved) cur = cur.prevNode // rollback to prev non-removed (or list head) in <lambda>()