5c5367d377
The following updates in the JVM/IR plugin were made: * Lots of refactoring with preparation for K/N support: commonization of transformations. * Improved error handling (checks for visibility constraints, appending message about usage constraints in case of an error). * Explicit requirements for the visibility of atomic properties: to prevent leaking they should be private/internal or be members of private/internal classes. * Fixed visibility of generated properties: volatile properties are always private and atomic updaters have the same visibility as the original atomic property. * Volatile fields are generated from scratch and original atomic properties are removed. * Delegated properties support is fixed (only declaration in the same scope is allowed). * Non-inline atomic extensions are forbidden. * For top-level atomics: only one wrapper class per file (with corresponding visibility) is generated. * Bug fixes. The corresponding tickets: https://github.com/Kotlin/kotlinx-atomicfu/issues/322 KT-60528 Merge-request: KT-MR-10579 Merged-by: Maria Sokolova <maria.sokolova@jetbrains.com>
56 lines
1.4 KiB
Kotlin
Vendored
56 lines
1.4 KiB
Kotlin
Vendored
import kotlinx.atomicfu.*
|
|
import kotlin.test.*
|
|
|
|
class LockFreeQueueTest {
|
|
fun testBasic() {
|
|
val q = LockFreeQueue()
|
|
assertEquals(-1, q.dequeue())
|
|
q.enqueue(42)
|
|
assertEquals(42, q.dequeue())
|
|
assertEquals(-1, q.dequeue())
|
|
q.enqueue(1)
|
|
q.enqueue(2)
|
|
assertEquals(1, q.dequeue())
|
|
assertEquals(2, q.dequeue())
|
|
assertEquals(-1, q.dequeue())
|
|
}
|
|
}
|
|
|
|
// MS-queue
|
|
public class LockFreeQueue {
|
|
private val head = atomic(Node(0))
|
|
private val tail = atomic(head.value)
|
|
|
|
private class Node(val value: Int) {
|
|
val next = atomic<Node?>(null)
|
|
}
|
|
|
|
public fun enqueue(value: Int) {
|
|
val node = Node(value)
|
|
tail.loop { curTail ->
|
|
val curNext = curTail.next.value
|
|
if (curNext != null) {
|
|
tail.compareAndSet(curTail, curNext)
|
|
return@loop
|
|
}
|
|
if (curTail.next.compareAndSet(null, node)) {
|
|
tail.compareAndSet(curTail, node)
|
|
return
|
|
}
|
|
}
|
|
}
|
|
|
|
public fun dequeue(): Int {
|
|
head.loop { curHead ->
|
|
val next = curHead.next.value ?: return -1
|
|
if (head.compareAndSet(curHead, next)) return next.value
|
|
}
|
|
}
|
|
}
|
|
|
|
fun box(): String {
|
|
val testClass = LockFreeQueueTest()
|
|
testClass.testBasic()
|
|
return "OK"
|
|
}
|