@@ -129,7 +129,7 @@ public open class LockFreeLinkedListNode {
129
129
if (prev is Removed ) return prev
130
130
prev as Node // otherwise, it can be only node otherwise
131
131
if (prev.next == = this ) return prev
132
- helpInsert (prev, null )
132
+ correctPrev (prev, null )
133
133
}
134
134
}
135
135
@@ -314,7 +314,7 @@ public open class LockFreeLinkedListNode {
314
314
continue
315
315
}
316
316
// linked improperly -- help insert
317
- queue.helpInsert (prev, op)
317
+ queue.correctPrev (prev, op)
318
318
}
319
319
}
320
320
@@ -468,7 +468,7 @@ public open class LockFreeLinkedListNode {
468
468
if (PREV .compareAndSet(next, nextPrev, this )) {
469
469
if (this .next is Removed ) {
470
470
// already removed
471
- next.helpInsert (nextPrev as Node , null )
471
+ next.correctPrev (nextPrev as Node , null )
472
472
}
473
473
return
474
474
}
@@ -477,7 +477,7 @@ public open class LockFreeLinkedListNode {
477
477
478
478
private fun finishRemove (next : Node ) {
479
479
helpDelete()
480
- next.helpInsert (_prev .unwrap(), null )
480
+ next.correctPrev (_prev .unwrap(), null )
481
481
}
482
482
483
483
private fun markPrev (): Node {
@@ -528,7 +528,7 @@ public open class LockFreeLinkedListNode {
528
528
}
529
529
530
530
// fixes prev links from this node
531
- private fun helpInsert (_prev : Node , op : OpDescriptor ? ) {
531
+ private fun correctPrev (_prev : Node , op : OpDescriptor ? ) {
532
532
var prev: Node = _prev
533
533
var last: Node ? = null // will be set so that last.next === prev
534
534
while (true ) {
0 commit comments