package kotlinx.coroutines.internal; import androidx.concurrent.futures.AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0; import com.alibaba.fastjson.asm.Opcodes; import com.seewo.vcommons.constants.SeewoIntent; import java.util.concurrent.atomic.AtomicReferenceFieldUpdater; import kotlin.Metadata; import kotlin.jvm.functions.Function0; import kotlin.jvm.functions.Function1; import kotlin.jvm.internal.Intrinsics; import kotlin.jvm.internal.PropertyReference0Impl; import kotlinx.coroutines.DebugKt; import kotlinx.coroutines.DebugStringsKt; /* JADX INFO: compiled from: LockFreeLinkedList.kt */ /* JADX INFO: loaded from: classes2.dex */ @Metadata(d1 = {"\u0000j\n\u0002\u0018\u0002\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0000\n\u0002\u0010\u0002\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0002\u0010\u000b\n\u0002\b\u0003\n\u0002\u0018\u0002\n\u0002\b\n\n\u0002\u0018\u0002\n\u0002\b\u0004\n\u0002\u0018\u0002\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0002\b\b\n\u0002\u0018\u0002\n\u0002\b\n\n\u0002\u0018\u0002\n\u0002\b\u0002\n\u0002\u0010\u000e\n\u0002\b\u0003\n\u0002\u0010\b\n\u0002\b\u0007\n\u0002\u0010\u0000\n\u0002\b\f\b\u0017\u0018\u00002\u00020C:\u0005JKLMNB\u0007¢\u0006\u0004\b\u0001\u0010\u0002J\u0019\u0010\u0006\u001a\u00020\u00052\n\u0010\u0004\u001a\u00060\u0000j\u0002`\u0003¢\u0006\u0004\b\u0006\u0010\u0007J,\u0010\u000b\u001a\u00020\t2\n\u0010\u0004\u001a\u00060\u0000j\u0002`\u00032\u000e\b\u0004\u0010\n\u001a\b\u0012\u0004\u0012\u00020\t0\bH\u0086\b¢\u0006\u0004\b\u000b\u0010\fJ4\u0010\u000f\u001a\u00020\t2\n\u0010\u0004\u001a\u00060\u0000j\u0002`\u00032\u0016\u0010\u000e\u001a\u0012\u0012\b\u0012\u00060\u0000j\u0002`\u0003\u0012\u0004\u0012\u00020\t0\rH\u0086\b¢\u0006\u0004\b\u000f\u0010\u0010JD\u0010\u0011\u001a\u00020\t2\n\u0010\u0004\u001a\u00060\u0000j\u0002`\u00032\u0016\u0010\u000e\u001a\u0012\u0012\b\u0012\u00060\u0000j\u0002`\u0003\u0012\u0004\u0012\u00020\t0\r2\u000e\b\u0004\u0010\n\u001a\b\u0012\u0004\u0012\u00020\t0\bH\u0086\b¢\u0006\u0004\b\u0011\u0010\u0012J'\u0010\u0014\u001a\u00020\t2\n\u0010\u0004\u001a\u00060\u0000j\u0002`\u00032\n\u0010\u0013\u001a\u00060\u0000j\u0002`\u0003H\u0001¢\u0006\u0004\b\u0014\u0010\u0015J\u0019\u0010\u0016\u001a\u00020\t2\n\u0010\u0004\u001a\u00060\u0000j\u0002`\u0003¢\u0006\u0004\b\u0016\u0010\u0017J\"\u0010\u001a\u001a\n\u0018\u00010\u0000j\u0004\u0018\u0001`\u00032\b\u0010\u0019\u001a\u0004\u0018\u00010\u0018H\u0082\u0010¢\u0006\u0004\b\u001a\u0010\u001bJ)\u0010\u001e\u001a\b\u0012\u0004\u0012\u00028\u00000\u001d\"\f\b\u0000\u0010\u001c*\u00060\u0000j\u0002`\u00032\u0006\u0010\u0004\u001a\u00028\u0000¢\u0006\u0004\b\u001e\u0010\u001fJ\u0017\u0010!\u001a\f\u0012\b\u0012\u00060\u0000j\u0002`\u00030 ¢\u0006\u0004\b!\u0010\"J \u0010$\u001a\u00060\u0000j\u0002`\u00032\n\u0010#\u001a\u00060\u0000j\u0002`\u0003H\u0082\u0010¢\u0006\u0004\b$\u0010%J\u001b\u0010&\u001a\u00020\u00052\n\u0010\u0013\u001a\u00060\u0000j\u0002`\u0003H\u0002¢\u0006\u0004\b&\u0010\u0007J\r\u0010'\u001a\u00020\u0005¢\u0006\u0004\b'\u0010\u0002J\u000f\u0010(\u001a\u00020\u0005H\u0001¢\u0006\u0004\b(\u0010\u0002J,\u0010*\u001a\u00020)2\n\u0010\u0004\u001a\u00060\u0000j\u0002`\u00032\u000e\b\u0004\u0010\n\u001a\b\u0012\u0004\u0012\u00020\t0\bH\u0081\b¢\u0006\u0004\b*\u0010+J\u0017\u0010,\u001a\n\u0018\u00010\u0000j\u0004\u0018\u0001`\u0003H\u0014¢\u0006\u0004\b,\u0010-J\u000f\u0010.\u001a\u00020\tH\u0016¢\u0006\u0004\b.\u0010/J.\u00100\u001a\u0004\u0018\u00018\u0000\"\u0006\b\u0000\u0010\u001c\u0018\u00012\u0012\u0010\u000e\u001a\u000e\u0012\u0004\u0012\u00028\u0000\u0012\u0004\u0012\u00020\t0\rH\u0086\b¢\u0006\u0004\b0\u00101J\u0015\u00102\u001a\n\u0018\u00010\u0000j\u0004\u0018\u0001`\u0003¢\u0006\u0004\b2\u0010-J\u0017\u00103\u001a\n\u0018\u00010\u0000j\u0004\u0018\u0001`\u0003H\u0001¢\u0006\u0004\b3\u0010-J\u000f\u00105\u001a\u000204H\u0002¢\u0006\u0004\b5\u00106J\u000f\u00108\u001a\u000207H\u0016¢\u0006\u0004\b8\u00109J/\u0010<\u001a\u00020;2\n\u0010\u0004\u001a\u00060\u0000j\u0002`\u00032\n\u0010\u0013\u001a\u00060\u0000j\u0002`\u00032\u0006\u0010:\u001a\u00020)H\u0001¢\u0006\u0004\b<\u0010=J'\u0010A\u001a\u00020\u00052\n\u0010>\u001a\u00060\u0000j\u0002`\u00032\n\u0010\u0013\u001a\u00060\u0000j\u0002`\u0003H\u0000¢\u0006\u0004\b?\u0010@R\u0014\u0010B\u001a\u00020\t8VX\u0096\u0004¢\u0006\u0006\u001a\u0004\bB\u0010/R\u0011\u0010\u0013\u001a\u00020C8F¢\u0006\u0006\u001a\u0004\bD\u0010ER\u0015\u0010G\u001a\u00060\u0000j\u0002`\u00038F¢\u0006\u0006\u001a\u0004\bF\u0010-R\u0015\u0010I\u001a\u00060\u0000j\u0002`\u00038F¢\u0006\u0006\u001a\u0004\bH\u0010-¨\u0006O"}, d2 = {"Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "", "()V", "Lkotlinx/coroutines/internal/Node;", "node", "", "addLast", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)V", "Lkotlin/Function0;", "", "condition", "addLastIf", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlin/jvm/functions/Function0;)Z", "Lkotlin/Function1;", "predicate", "addLastIfPrev", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlin/jvm/functions/Function1;)Z", "addLastIfPrevAndIf", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlin/jvm/functions/Function1;Lkotlin/jvm/functions/Function0;)Z", "next", "addNext", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)Z", "addOneIfEmpty", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)Z", "Lkotlinx/coroutines/internal/OpDescriptor;", "op", "correctPrev", "(Lkotlinx/coroutines/internal/OpDescriptor;)Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "T", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode$AddLastDesc;", "describeAddLast", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)Lkotlinx/coroutines/internal/LockFreeLinkedListNode$AddLastDesc;", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode$RemoveFirstDesc;", "describeRemoveFirst", "()Lkotlinx/coroutines/internal/LockFreeLinkedListNode$RemoveFirstDesc;", "current", "findPrevNonRemoved", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "finishAdd", "helpRemove", "helpRemovePrev", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode$CondAddOp;", "makeCondAddOp", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlin/jvm/functions/Function0;)Lkotlinx/coroutines/internal/LockFreeLinkedListNode$CondAddOp;", "nextIfRemoved", "()Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "remove", "()Z", "removeFirstIfIsInstanceOfOrPeekIf", "(Lkotlin/jvm/functions/Function1;)Ljava/lang/Object;", "removeFirstOrNull", "removeOrNext", "Lkotlinx/coroutines/internal/Removed;", "removed", "()Lkotlinx/coroutines/internal/Removed;", "", "toString", "()Ljava/lang/String;", "condAdd", "", "tryCondAddNext", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlinx/coroutines/internal/LockFreeLinkedListNode$CondAddOp;)I", "prev", "validateNode$kotlinx_coroutines_core", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)V", "validateNode", "isRemoved", "", "getNext", "()Ljava/lang/Object;", "getNextNode", "nextNode", "getPrevNode", "prevNode", "AbstractAtomicDesc", "AddLastDesc", "CondAddOp", "PrepareOp", "RemoveFirstDesc", "kotlinx-coroutines-core"}, k = 1, mv = {1, 6, 0}, xi = 48) public class LockFreeLinkedListNode { static final /* synthetic */ AtomicReferenceFieldUpdater _next$FU = AtomicReferenceFieldUpdater.newUpdater(LockFreeLinkedListNode.class, Object.class, "_next"); static final /* synthetic */ AtomicReferenceFieldUpdater _prev$FU = AtomicReferenceFieldUpdater.newUpdater(LockFreeLinkedListNode.class, Object.class, "_prev"); private static final /* synthetic */ AtomicReferenceFieldUpdater _removedRef$FU = AtomicReferenceFieldUpdater.newUpdater(LockFreeLinkedListNode.class, Object.class, "_removedRef"); volatile /* synthetic */ Object _next = this; volatile /* synthetic */ Object _prev = this; private volatile /* synthetic */ Object _removedRef = null; /* JADX INFO: Access modifiers changed from: private */ public final Removed removed() { Removed removed = (Removed) this._removedRef; if (removed != null) { return removed; } Removed removed2 = new Removed(this); _removedRef$FU.lazySet(this, removed2); return removed2; } /* JADX INFO: compiled from: LockFreeLinkedList.kt */ @Metadata(d1 = {"\u0000\"\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\b\u0004\n\u0002\u0010\u0002\n\u0002\b\u0002\n\u0002\u0010\u0000\n\u0000\b!\u0018\u00002\f\u0012\b\u0012\u00060\u0002j\u0002`\u00030\u0001B\u0011\u0012\n\u0010\u0004\u001a\u00060\u0002j\u0002`\u0003¢\u0006\u0002\u0010\u0005J\u001e\u0010\u0007\u001a\u00020\b2\n\u0010\t\u001a\u00060\u0002j\u0002`\u00032\b\u0010\n\u001a\u0004\u0018\u00010\u000bH\u0016R\u0014\u0010\u0004\u001a\u00060\u0002j\u0002`\u00038\u0006X\u0087\u0004¢\u0006\u0002\n\u0000R\u001a\u0010\u0006\u001a\n\u0018\u00010\u0002j\u0004\u0018\u0001`\u00038\u0006@\u0006X\u0087\u000e¢\u0006\u0002\n\u0000¨\u0006\f"}, d2 = {"Lkotlinx/coroutines/internal/LockFreeLinkedListNode$CondAddOp;", "Lkotlinx/coroutines/internal/AtomicOp;", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "Lkotlinx/coroutines/internal/Node;", "newNode", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)V", "oldNext", "complete", "", "affected", "failure", "", "kotlinx-coroutines-core"}, k = 1, mv = {1, 6, 0}, xi = 48) public static abstract class CondAddOp extends AtomicOp { public final LockFreeLinkedListNode newNode; public LockFreeLinkedListNode oldNext; public CondAddOp(LockFreeLinkedListNode lockFreeLinkedListNode) { this.newNode = lockFreeLinkedListNode; } @Override // kotlinx.coroutines.internal.AtomicOp public void complete(LockFreeLinkedListNode affected, Object failure) { boolean z = failure == null; LockFreeLinkedListNode lockFreeLinkedListNode = z ? this.newNode : this.oldNext; if (lockFreeLinkedListNode != null && AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(LockFreeLinkedListNode._next$FU, affected, this, lockFreeLinkedListNode) && z) { LockFreeLinkedListNode lockFreeLinkedListNode2 = this.newNode; LockFreeLinkedListNode lockFreeLinkedListNode3 = this.oldNext; Intrinsics.checkNotNull(lockFreeLinkedListNode3); lockFreeLinkedListNode2.finishAdd(lockFreeLinkedListNode3); } } } /* JADX INFO: renamed from: kotlinx.coroutines.internal.LockFreeLinkedListNode$makeCondAddOp$1, reason: invalid class name */ /* JADX INFO: compiled from: LockFreeLinkedList.kt */ @Metadata(d1 = {"\u0000\u001b\n\u0000\n\u0002\u0018\u0002\n\u0000\n\u0002\u0010\u0000\n\u0000\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0000*\u0001\u0000\b\n\u0018\u00002\u00020\u0001J\u0016\u0010\u0002\u001a\u0004\u0018\u00010\u00032\n\u0010\u0004\u001a\u00060\u0005j\u0002`\u0006H\u0016¨\u0006\u0007"}, d2 = {"kotlinx/coroutines/internal/LockFreeLinkedListNode$makeCondAddOp$1", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode$CondAddOp;", "prepare", "", "affected", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "Lkotlinx/coroutines/internal/Node;", "kotlinx-coroutines-core"}, k = 1, mv = {1, 6, 0}, xi = Opcodes.ARETURN) public static final class AnonymousClass1 extends CondAddOp { final /* synthetic */ Function0 $condition; /* JADX WARN: 'super' call moved to the top of the method (can break code semantics) */ public AnonymousClass1(LockFreeLinkedListNode lockFreeLinkedListNode, Function0 function0) { super(lockFreeLinkedListNode); this.$condition = function0; } @Override // kotlinx.coroutines.internal.AtomicOp public Object prepare(LockFreeLinkedListNode affected) { if (this.$condition.invoke().booleanValue()) { return null; } return LockFreeLinkedListKt.getCONDITION_FALSE(); } } public final CondAddOp makeCondAddOp(LockFreeLinkedListNode node, Function0 condition) { return new AnonymousClass1(node, condition); } public boolean isRemoved() { return getNext() instanceof Removed; } public final LockFreeLinkedListNode getNextNode() { return LockFreeLinkedListKt.unwrap(getNext()); } public final LockFreeLinkedListNode getPrevNode() { LockFreeLinkedListNode lockFreeLinkedListNodeCorrectPrev = correctPrev(null); return lockFreeLinkedListNodeCorrectPrev == null ? findPrevNonRemoved((LockFreeLinkedListNode) this._prev) : lockFreeLinkedListNodeCorrectPrev; } private final LockFreeLinkedListNode findPrevNonRemoved(LockFreeLinkedListNode current) { while (current.isRemoved()) { current = (LockFreeLinkedListNode) current._prev; } return current; } public final boolean addOneIfEmpty(LockFreeLinkedListNode node) { _prev$FU.lazySet(node, this); _next$FU.lazySet(node, this); while (getNext() == this) { if (AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(_next$FU, this, this, node)) { node.finishAdd(this); return true; } } return false; } public final void addLast(LockFreeLinkedListNode node) { while (!getPrevNode().addNext(node, this)) { } } public final AddLastDesc describeAddLast(T node) { return new AddLastDesc<>(this, node); } public final boolean addLastIfPrev(LockFreeLinkedListNode node, Function1 predicate) { LockFreeLinkedListNode prevNode; do { prevNode = getPrevNode(); if (!predicate.invoke(prevNode).booleanValue()) { return false; } } while (!prevNode.addNext(node, this)); return true; } public final boolean addNext(LockFreeLinkedListNode node, LockFreeLinkedListNode next) { _prev$FU.lazySet(node, this); AtomicReferenceFieldUpdater atomicReferenceFieldUpdater = _next$FU; atomicReferenceFieldUpdater.lazySet(node, next); if (!AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(atomicReferenceFieldUpdater, this, next, node)) { return false; } node.finishAdd(next); return true; } public final int tryCondAddNext(LockFreeLinkedListNode node, LockFreeLinkedListNode next, CondAddOp condAdd) { _prev$FU.lazySet(node, this); AtomicReferenceFieldUpdater atomicReferenceFieldUpdater = _next$FU; atomicReferenceFieldUpdater.lazySet(node, next); condAdd.oldNext = next; if (AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(atomicReferenceFieldUpdater, this, next, condAdd)) { return condAdd.perform(this) == null ? 1 : 2; } return 0; } /* JADX INFO: renamed from: remove */ public boolean mo1770remove() { return removeOrNext() == null; } public final LockFreeLinkedListNode removeOrNext() { Object next; LockFreeLinkedListNode lockFreeLinkedListNode; do { next = getNext(); if (next instanceof Removed) { return ((Removed) next).ref; } if (next == this) { return (LockFreeLinkedListNode) next; } lockFreeLinkedListNode = (LockFreeLinkedListNode) next; } while (!AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(_next$FU, this, next, lockFreeLinkedListNode.removed())); lockFreeLinkedListNode.correctPrev(null); return null; } public final void helpRemove() { ((Removed) getNext()).ref.helpRemovePrev(); } public final void helpRemovePrev() { while (true) { Object next = this.getNext(); if (next instanceof Removed) { this = ((Removed) next).ref; } else { this.correctPrev(null); return; } } } public final LockFreeLinkedListNode removeFirstOrNull() { while (true) { LockFreeLinkedListNode lockFreeLinkedListNode = (LockFreeLinkedListNode) getNext(); if (lockFreeLinkedListNode == this) { return null; } if (lockFreeLinkedListNode.mo1770remove()) { return lockFreeLinkedListNode; } lockFreeLinkedListNode.helpRemove(); } } public final RemoveFirstDesc describeRemoveFirst() { return new RemoveFirstDesc<>(this); } /* JADX WARN: Type inference failed for: r0v1, types: [T, java.lang.Object, kotlinx.coroutines.internal.LockFreeLinkedListNode] */ public final /* synthetic */ T removeFirstIfIsInstanceOfOrPeekIf(Function1 predicate) { LockFreeLinkedListNode lockFreeLinkedListNodeRemoveOrNext; while (true) { LockFreeLinkedListNode lockFreeLinkedListNode = (LockFreeLinkedListNode) getNext(); if (lockFreeLinkedListNode == this) { return null; } Intrinsics.reifiedOperationMarker(3, "T"); if (!(lockFreeLinkedListNode instanceof Object)) { return null; } if ((predicate.invoke(lockFreeLinkedListNode).booleanValue() && !lockFreeLinkedListNode.isRemoved()) || (lockFreeLinkedListNodeRemoveOrNext = lockFreeLinkedListNode.removeOrNext()) == null) { return lockFreeLinkedListNode; } lockFreeLinkedListNodeRemoveOrNext.helpRemovePrev(); } } /* JADX INFO: compiled from: LockFreeLinkedList.kt */ @Metadata(d1 = {"\u00006\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\b\u0007\n\u0002\u0010\u0002\n\u0000\n\u0002\u0018\u0002\n\u0002\b\u0003\n\u0002\u0010\u0000\n\u0002\u0010\u000b\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0002\b\f\n\u0002\u0018\u0002\b\u0016\u0018\u0000*\f\b\u0000\u0010\u0003*\u00060\u0001j\u0002`\u00022\u00020!B\u001b\u0012\n\u0010\u0004\u001a\u00060\u0001j\u0002`\u0002\u0012\u0006\u0010\u0005\u001a\u00028\u0000¢\u0006\u0004\b\u0006\u0010\u0007J'\u0010\u000b\u001a\u00020\n2\n\u0010\b\u001a\u00060\u0001j\u0002`\u00022\n\u0010\t\u001a\u00060\u0001j\u0002`\u0002H\u0014¢\u0006\u0004\b\u000b\u0010\u0007J\u0017\u0010\u000e\u001a\u00020\n2\u0006\u0010\r\u001a\u00020\fH\u0016¢\u0006\u0004\b\u000e\u0010\u000fJ#\u0010\u0012\u001a\u00020\u00112\n\u0010\b\u001a\u00060\u0001j\u0002`\u00022\u0006\u0010\t\u001a\u00020\u0010H\u0014¢\u0006\u0004\b\u0012\u0010\u0013J\u001f\u0010\u0016\u001a\n\u0018\u00010\u0001j\u0004\u0018\u0001`\u00022\u0006\u0010\u0015\u001a\u00020\u0014H\u0004¢\u0006\u0004\b\u0016\u0010\u0017J'\u0010\u0018\u001a\u00020\u00102\n\u0010\b\u001a\u00060\u0001j\u0002`\u00022\n\u0010\t\u001a\u00060\u0001j\u0002`\u0002H\u0016¢\u0006\u0004\b\u0018\u0010\u0019R\u001c\u0010\u001c\u001a\n\u0018\u00010\u0001j\u0004\u0018\u0001`\u00028DX\u0084\u0004¢\u0006\u0006\u001a\u0004\b\u001a\u0010\u001bR\u0014\u0010\u0005\u001a\u00028\u00008\u0006X\u0087\u0004¢\u0006\u0006\n\u0004\b\u0005\u0010\u001dR\u0018\u0010\u001f\u001a\u00060\u0001j\u0002`\u00028DX\u0084\u0004¢\u0006\u0006\u001a\u0004\b\u001e\u0010\u001bR\u0018\u0010\u0004\u001a\u00060\u0001j\u0002`\u00028\u0006X\u0087\u0004¢\u0006\u0006\n\u0004\b\u0004\u0010\u001d¨\u0006 "}, d2 = {"Lkotlinx/coroutines/internal/LockFreeLinkedListNode$AddLastDesc;", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "Lkotlinx/coroutines/internal/Node;", "T", "queue", "node", "", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)V", "affected", "next", "", "finishOnSuccess", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode$PrepareOp;", "prepareOp", "finishPrepare", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode$PrepareOp;)V", "", "", "retry", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Ljava/lang/Object;)Z", "Lkotlinx/coroutines/internal/OpDescriptor;", "op", "takeAffectedNode", "(Lkotlinx/coroutines/internal/OpDescriptor;)Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "updatedNext", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)Ljava/lang/Object;", "getAffectedNode", "()Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "affectedNode", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "getOriginalNext", "originalNext", "kotlinx-coroutines-core", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode$AbstractAtomicDesc;"}, k = 1, mv = {1, 6, 0}, xi = 48) public static class AddLastDesc extends AbstractAtomicDesc { private static final /* synthetic */ AtomicReferenceFieldUpdater _affectedNode$FU = AtomicReferenceFieldUpdater.newUpdater(AddLastDesc.class, Object.class, "_affectedNode"); private volatile /* synthetic */ Object _affectedNode; public final T node; public final LockFreeLinkedListNode queue; public AddLastDesc(LockFreeLinkedListNode lockFreeLinkedListNode, T t) { this.queue = lockFreeLinkedListNode; this.node = t; if (DebugKt.getASSERTIONS_ENABLED() && (t._next != t || t._prev != t)) { throw new AssertionError(); } this._affectedNode = null; } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc protected final LockFreeLinkedListNode takeAffectedNode(OpDescriptor op) { return this.queue.correctPrev(op); } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc protected final LockFreeLinkedListNode getAffectedNode() { return (LockFreeLinkedListNode) this._affectedNode; } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc /* JADX INFO: renamed from: getOriginalNext, reason: from getter */ protected final LockFreeLinkedListNode getQueue() { return this.queue; } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc protected boolean retry(LockFreeLinkedListNode affected, Object next) { return next != this.queue; } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc public void finishPrepare(PrepareOp prepareOp) { AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(_affectedNode$FU, this, null, prepareOp.affected); } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc public Object updatedNext(LockFreeLinkedListNode affected, LockFreeLinkedListNode next) { AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(LockFreeLinkedListNode._prev$FU, this.node, this.node, affected); AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(LockFreeLinkedListNode._next$FU, this.node, this.node, this.queue); return this.node; } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc protected void finishOnSuccess(LockFreeLinkedListNode affected, LockFreeLinkedListNode next) { this.node.finishAdd(this.queue); } } /* JADX INFO: compiled from: LockFreeLinkedList.kt */ @Metadata(d1 = {"\u0000>\n\u0002\u0018\u0002\n\u0000\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\b\u0004\n\u0002\u0010\u0000\n\u0002\b\u0003\n\u0002\u0010\u0002\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0002\b\u0003\n\u0002\u0010\u000b\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0002\b\u0011\n\u0002\u0018\u0002\b\u0016\u0018\u0000*\u0004\b\u0000\u0010\u00012\u00020(B\u0013\u0012\n\u0010\u0004\u001a\u00060\u0002j\u0002`\u0003¢\u0006\u0004\b\u0005\u0010\u0006J\u001d\u0010\t\u001a\u0004\u0018\u00010\b2\n\u0010\u0007\u001a\u00060\u0002j\u0002`\u0003H\u0014¢\u0006\u0004\b\t\u0010\nJ'\u0010\r\u001a\u00020\f2\n\u0010\u0007\u001a\u00060\u0002j\u0002`\u00032\n\u0010\u000b\u001a\u00060\u0002j\u0002`\u0003H\u0004¢\u0006\u0004\b\r\u0010\u000eJ\u0017\u0010\u0011\u001a\u00020\f2\u0006\u0010\u0010\u001a\u00020\u000fH\u0016¢\u0006\u0004\b\u0011\u0010\u0012J#\u0010\u0014\u001a\u00020\u00132\n\u0010\u0007\u001a\u00060\u0002j\u0002`\u00032\u0006\u0010\u000b\u001a\u00020\bH\u0004¢\u0006\u0004\b\u0014\u0010\u0015J\u001f\u0010\u0018\u001a\n\u0018\u00010\u0002j\u0004\u0018\u0001`\u00032\u0006\u0010\u0017\u001a\u00020\u0016H\u0004¢\u0006\u0004\b\u0018\u0010\u0019J%\u0010\u001a\u001a\u00020\b2\n\u0010\u0007\u001a\u00060\u0002j\u0002`\u00032\n\u0010\u000b\u001a\u00060\u0002j\u0002`\u0003¢\u0006\u0004\b\u001a\u0010\u001bR\u001c\u0010\u001e\u001a\n\u0018\u00010\u0002j\u0004\u0018\u0001`\u00038DX\u0084\u0004¢\u0006\u0006\u001a\u0004\b\u001c\u0010\u001dR\u001c\u0010 \u001a\n\u0018\u00010\u0002j\u0004\u0018\u0001`\u00038DX\u0084\u0004¢\u0006\u0006\u001a\u0004\b\u001f\u0010\u001dR\u0018\u0010\u0004\u001a\u00060\u0002j\u0002`\u00038\u0006X\u0087\u0004¢\u0006\u0006\n\u0004\b\u0004\u0010!R\u0017\u0010&\u001a\u00028\u00008F¢\u0006\f\u0012\u0004\b$\u0010%\u001a\u0004\b\"\u0010#¨\u0006'"}, d2 = {"Lkotlinx/coroutines/internal/LockFreeLinkedListNode$RemoveFirstDesc;", "T", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "Lkotlinx/coroutines/internal/Node;", "queue", "", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)V", "affected", "", "failure", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)Ljava/lang/Object;", "next", "", "finishOnSuccess", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)V", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode$PrepareOp;", "prepareOp", "finishPrepare", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode$PrepareOp;)V", "", "retry", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Ljava/lang/Object;)Z", "Lkotlinx/coroutines/internal/OpDescriptor;", "op", "takeAffectedNode", "(Lkotlinx/coroutines/internal/OpDescriptor;)Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "updatedNext", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlinx/coroutines/internal/LockFreeLinkedListNode;)Ljava/lang/Object;", "getAffectedNode", "()Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "affectedNode", "getOriginalNext", "originalNext", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "getResult", "()Ljava/lang/Object;", "getResult$annotations", "()V", SeewoIntent.EXTRA_TOUCH_TEST_RESULT, "kotlinx-coroutines-core", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode$AbstractAtomicDesc;"}, k = 1, mv = {1, 6, 0}, xi = 48) public static class RemoveFirstDesc extends AbstractAtomicDesc { private static final /* synthetic */ AtomicReferenceFieldUpdater _affectedNode$FU = AtomicReferenceFieldUpdater.newUpdater(RemoveFirstDesc.class, Object.class, "_affectedNode"); private static final /* synthetic */ AtomicReferenceFieldUpdater _originalNext$FU = AtomicReferenceFieldUpdater.newUpdater(RemoveFirstDesc.class, Object.class, "_originalNext"); private volatile /* synthetic */ Object _affectedNode = null; private volatile /* synthetic */ Object _originalNext = null; public final LockFreeLinkedListNode queue; public static /* synthetic */ void getResult$annotations() { } public RemoveFirstDesc(LockFreeLinkedListNode lockFreeLinkedListNode) { this.queue = lockFreeLinkedListNode; } public final T getResult() { Object affectedNode = getAffectedNode(); Intrinsics.checkNotNull(affectedNode); return (T) affectedNode; } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc protected final LockFreeLinkedListNode takeAffectedNode(OpDescriptor op) { LockFreeLinkedListNode lockFreeLinkedListNode = this.queue; while (true) { Object obj = lockFreeLinkedListNode._next; if (obj instanceof OpDescriptor) { OpDescriptor opDescriptor = (OpDescriptor) obj; if (op.isEarlierThan(opDescriptor)) { return null; } opDescriptor.perform(this.queue); } else { return (LockFreeLinkedListNode) obj; } } } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc protected final LockFreeLinkedListNode getAffectedNode() { return (LockFreeLinkedListNode) this._affectedNode; } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc /* JADX INFO: renamed from: getOriginalNext */ protected final LockFreeLinkedListNode getQueue() { return (LockFreeLinkedListNode) this._originalNext; } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc protected Object failure(LockFreeLinkedListNode affected) { if (affected == this.queue) { return LockFreeLinkedListKt.getLIST_EMPTY(); } return null; } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc protected final boolean retry(LockFreeLinkedListNode affected, Object next) { if (!(next instanceof Removed)) { return false; } ((Removed) next).ref.helpRemovePrev(); return true; } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc public void finishPrepare(PrepareOp prepareOp) { AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(_affectedNode$FU, this, null, prepareOp.affected); AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(_originalNext$FU, this, null, prepareOp.next); } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc public final Object updatedNext(LockFreeLinkedListNode affected, LockFreeLinkedListNode next) { return next.removed(); } @Override // kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc protected final void finishOnSuccess(LockFreeLinkedListNode affected, LockFreeLinkedListNode next) { next.correctPrev(null); } } /* JADX INFO: compiled from: LockFreeLinkedList.kt */ @Metadata(d1 = {"\u00008\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0000\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0002\b\u0003\n\u0002\u0010\u0002\n\u0000\n\u0002\u0010\u0000\n\u0000\n\u0002\u0010\u000e\n\u0000\u0018\u00002\u00020\u0001B%\u0012\n\u0010\u0002\u001a\u00060\u0003j\u0002`\u0004\u0012\n\u0010\u0005\u001a\u00060\u0003j\u0002`\u0004\u0012\u0006\u0010\u0006\u001a\u00020\u0007¢\u0006\u0002\u0010\bJ\u0006\u0010\r\u001a\u00020\u000eJ\u0014\u0010\u000f\u001a\u0004\u0018\u00010\u00102\b\u0010\u0002\u001a\u0004\u0018\u00010\u0010H\u0016J\b\u0010\u0011\u001a\u00020\u0012H\u0016R\u0014\u0010\u0002\u001a\u00060\u0003j\u0002`\u00048\u0006X\u0087\u0004¢\u0006\u0002\n\u0000R\u0018\u0010\t\u001a\u0006\u0012\u0002\b\u00030\n8VX\u0096\u0004¢\u0006\u0006\u001a\u0004\b\u000b\u0010\fR\u0010\u0010\u0006\u001a\u00020\u00078\u0006X\u0087\u0004¢\u0006\u0002\n\u0000R\u0014\u0010\u0005\u001a\u00060\u0003j\u0002`\u00048\u0006X\u0087\u0004¢\u0006\u0002\n\u0000¨\u0006\u0013"}, d2 = {"Lkotlinx/coroutines/internal/LockFreeLinkedListNode$PrepareOp;", "Lkotlinx/coroutines/internal/OpDescriptor;", "affected", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "Lkotlinx/coroutines/internal/Node;", "next", "desc", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode$AbstractAtomicDesc;", "(Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlinx/coroutines/internal/LockFreeLinkedListNode;Lkotlinx/coroutines/internal/LockFreeLinkedListNode$AbstractAtomicDesc;)V", "atomicOp", "Lkotlinx/coroutines/internal/AtomicOp;", "getAtomicOp", "()Lkotlinx/coroutines/internal/AtomicOp;", "finishPrepare", "", "perform", "", "toString", "", "kotlinx-coroutines-core"}, k = 1, mv = {1, 6, 0}, xi = 48) public static final class PrepareOp extends OpDescriptor { public final LockFreeLinkedListNode affected; public final AbstractAtomicDesc desc; public final LockFreeLinkedListNode next; public PrepareOp(LockFreeLinkedListNode lockFreeLinkedListNode, LockFreeLinkedListNode lockFreeLinkedListNode2, AbstractAtomicDesc abstractAtomicDesc) { this.affected = lockFreeLinkedListNode; this.next = lockFreeLinkedListNode2; this.desc = abstractAtomicDesc; } @Override // kotlinx.coroutines.internal.OpDescriptor public AtomicOp getAtomicOp() { return this.desc.getAtomicOp(); } @Override // kotlinx.coroutines.internal.OpDescriptor public Object perform(Object affected) { Object objDecide; Object objUpdatedNext; if (DebugKt.getASSERTIONS_ENABLED() && affected != this.affected) { throw new AssertionError(); } if (affected != null) { LockFreeLinkedListNode lockFreeLinkedListNode = (LockFreeLinkedListNode) affected; Object objOnPrepare = this.desc.onPrepare(this); if (objOnPrepare == LockFreeLinkedList_commonKt.REMOVE_PREPARED) { LockFreeLinkedListNode lockFreeLinkedListNode2 = this.next; if (AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(LockFreeLinkedListNode._next$FU, lockFreeLinkedListNode, this, lockFreeLinkedListNode2.removed())) { this.desc.onRemoved(lockFreeLinkedListNode); lockFreeLinkedListNode2.correctPrev(null); } return LockFreeLinkedList_commonKt.REMOVE_PREPARED; } if (objOnPrepare != null) { objDecide = getAtomicOp().decide(objOnPrepare); } else { objDecide = getAtomicOp().get_consensus(); } if (objDecide == AtomicKt.NO_DECISION) { objUpdatedNext = getAtomicOp(); } else if (objDecide == null) { objUpdatedNext = this.desc.updatedNext(lockFreeLinkedListNode, this.next); } else { objUpdatedNext = this.next; } AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(LockFreeLinkedListNode._next$FU, lockFreeLinkedListNode, this, objUpdatedNext); return null; } throw new NullPointerException("null cannot be cast to non-null type kotlinx.coroutines.internal.LockFreeLinkedListNode{ kotlinx.coroutines.internal.LockFreeLinkedListKt.Node }"); } public final void finishPrepare() { this.desc.finishPrepare(this); } @Override // kotlinx.coroutines.internal.OpDescriptor public String toString() { return "PrepareOp(op=" + getAtomicOp() + ')'; } } /* JADX INFO: compiled from: LockFreeLinkedList.kt */ @Metadata(d1 = {"\u0000B\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\b\u0005\n\u0002\u0010\u0002\n\u0000\n\u0002\u0018\u0002\n\u0000\n\u0002\u0010\u0000\n\u0002\b\u0005\n\u0002\u0018\u0002\n\u0002\b\u0004\n\u0002\u0010\u000b\n\u0000\n\u0002\u0018\u0002\n\u0002\b\u0002\b&\u0018\u00002\u00020\u0001B\u0005¢\u0006\u0002\u0010\u0002J\u001c\u0010\n\u001a\u00020\u000b2\n\u0010\f\u001a\u0006\u0012\u0002\b\u00030\r2\b\u0010\u000e\u001a\u0004\u0018\u00010\u000fJ\u0016\u0010\u000e\u001a\u0004\u0018\u00010\u000f2\n\u0010\u0010\u001a\u00060\u0004j\u0002`\u0005H\u0014J \u0010\u0011\u001a\u00020\u000b2\n\u0010\u0010\u001a\u00060\u0004j\u0002`\u00052\n\u0010\u0012\u001a\u00060\u0004j\u0002`\u0005H$J\u0010\u0010\u0013\u001a\u00020\u000b2\u0006\u0010\u0014\u001a\u00020\u0015H&J\u0012\u0010\u0016\u001a\u0004\u0018\u00010\u000f2\u0006\u0010\u0014\u001a\u00020\u0015H\u0016J\u0014\u0010\u0017\u001a\u00020\u000b2\n\u0010\u0010\u001a\u00060\u0004j\u0002`\u0005H\u0016J\u0014\u0010\u0018\u001a\u0004\u0018\u00010\u000f2\n\u0010\f\u001a\u0006\u0012\u0002\b\u00030\rJ\u001c\u0010\u0019\u001a\u00020\u001a2\n\u0010\u0010\u001a\u00060\u0004j\u0002`\u00052\u0006\u0010\u0012\u001a\u00020\u000fH\u0014J\u0018\u0010\u001b\u001a\n\u0018\u00010\u0004j\u0004\u0018\u0001`\u00052\u0006\u0010\f\u001a\u00020\u001cH\u0014J \u0010\u001d\u001a\u00020\u000f2\n\u0010\u0010\u001a\u00060\u0004j\u0002`\u00052\n\u0010\u0012\u001a\u00060\u0004j\u0002`\u0005H&R\u001a\u0010\u0003\u001a\n\u0018\u00010\u0004j\u0004\u0018\u0001`\u0005X¤\u0004¢\u0006\u0006\u001a\u0004\b\u0006\u0010\u0007R\u001a\u0010\b\u001a\n\u0018\u00010\u0004j\u0004\u0018\u0001`\u0005X¤\u0004¢\u0006\u0006\u001a\u0004\b\t\u0010\u0007¨\u0006\u001e"}, d2 = {"Lkotlinx/coroutines/internal/LockFreeLinkedListNode$AbstractAtomicDesc;", "Lkotlinx/coroutines/internal/AtomicDesc;", "()V", "affectedNode", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "Lkotlinx/coroutines/internal/Node;", "getAffectedNode", "()Lkotlinx/coroutines/internal/LockFreeLinkedListNode;", "originalNext", "getOriginalNext", "complete", "", "op", "Lkotlinx/coroutines/internal/AtomicOp;", "failure", "", "affected", "finishOnSuccess", "next", "finishPrepare", "prepareOp", "Lkotlinx/coroutines/internal/LockFreeLinkedListNode$PrepareOp;", "onPrepare", "onRemoved", "prepare", "retry", "", "takeAffectedNode", "Lkotlinx/coroutines/internal/OpDescriptor;", "updatedNext", "kotlinx-coroutines-core"}, k = 1, mv = {1, 6, 0}, xi = 48) public static abstract class AbstractAtomicDesc extends AtomicDesc { protected Object failure(LockFreeLinkedListNode affected) { return null; } protected abstract void finishOnSuccess(LockFreeLinkedListNode affected, LockFreeLinkedListNode next); public abstract void finishPrepare(PrepareOp prepareOp); protected abstract LockFreeLinkedListNode getAffectedNode(); /* JADX INFO: renamed from: getOriginalNext */ protected abstract LockFreeLinkedListNode getQueue(); public void onRemoved(LockFreeLinkedListNode affected) { } protected boolean retry(LockFreeLinkedListNode affected, Object next) { return false; } public abstract Object updatedNext(LockFreeLinkedListNode affected, LockFreeLinkedListNode next); protected LockFreeLinkedListNode takeAffectedNode(OpDescriptor op) { LockFreeLinkedListNode affectedNode = getAffectedNode(); Intrinsics.checkNotNull(affectedNode); return affectedNode; } public Object onPrepare(PrepareOp prepareOp) { finishPrepare(prepareOp); return null; } /* JADX WARN: Code restructure failed: missing block: B:29:0x0055, code lost: if (kotlinx.coroutines.DebugKt.getASSERTIONS_ENABLED() == false) goto L34; */ /* JADX WARN: Code restructure failed: missing block: B:30:0x0057, code lost: if (r4 != null) goto L32; */ /* JADX WARN: Code restructure failed: missing block: B:33:0x005f, code lost: throw new java.lang.AssertionError(); */ /* JADX WARN: Code restructure failed: missing block: B:34:0x0060, code lost: return null; */ @Override // kotlinx.coroutines.internal.AtomicDesc /* Code decompiled incorrectly, please refer to instructions dump. To view partially-correct add '--show-bad-code' argument */ public final java.lang.Object prepare(kotlinx.coroutines.internal.AtomicOp r7) { /* r6 = this; L0: r0 = r7 kotlinx.coroutines.internal.OpDescriptor r0 = (kotlinx.coroutines.internal.OpDescriptor) r0 kotlinx.coroutines.internal.LockFreeLinkedListNode r0 = r6.takeAffectedNode(r0) if (r0 != 0) goto Lc java.lang.Object r6 = kotlinx.coroutines.internal.AtomicKt.RETRY_ATOMIC return r6 Lc: java.lang.Object r1 = r0._next r2 = 0 if (r1 != r7) goto L12 return r2 L12: boolean r3 = r7.isDecided() if (r3 == 0) goto L19 return r2 L19: boolean r3 = r1 instanceof kotlinx.coroutines.internal.OpDescriptor if (r3 == 0) goto L2c kotlinx.coroutines.internal.OpDescriptor r1 = (kotlinx.coroutines.internal.OpDescriptor) r1 boolean r2 = r7.isEarlierThan(r1) if (r2 == 0) goto L28 java.lang.Object r6 = kotlinx.coroutines.internal.AtomicKt.RETRY_ATOMIC return r6 L28: r1.perform(r0) goto L0 L2c: java.lang.Object r3 = r6.failure(r0) if (r3 == 0) goto L33 return r3 L33: boolean r3 = r6.retry(r0, r1) if (r3 != 0) goto L0 kotlinx.coroutines.internal.LockFreeLinkedListNode$PrepareOp r3 = new kotlinx.coroutines.internal.LockFreeLinkedListNode$PrepareOp r4 = r1 kotlinx.coroutines.internal.LockFreeLinkedListNode r4 = (kotlinx.coroutines.internal.LockFreeLinkedListNode) r4 r3.(r0, r4, r6) java.util.concurrent.atomic.AtomicReferenceFieldUpdater r4 = kotlinx.coroutines.internal.LockFreeLinkedListNode._next$FU boolean r4 = androidx.concurrent.futures.AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(r4, r0, r1, r3) if (r4 == 0) goto L0 java.lang.Object r4 = r3.perform(r0) // Catch: java.lang.Throwable -> L61 java.lang.Object r5 = kotlinx.coroutines.internal.LockFreeLinkedList_commonKt.REMOVE_PREPARED // Catch: java.lang.Throwable -> L61 if (r4 == r5) goto L0 boolean r6 = kotlinx.coroutines.DebugKt.getASSERTIONS_ENABLED() // Catch: java.lang.Throwable -> L61 if (r6 == 0) goto L60 if (r4 != 0) goto L5a goto L60 L5a: java.lang.AssertionError r6 = new java.lang.AssertionError // Catch: java.lang.Throwable -> L61 r6.() // Catch: java.lang.Throwable -> L61 throw r6 // Catch: java.lang.Throwable -> L61 L60: return r2 L61: r6 = move-exception java.util.concurrent.atomic.AtomicReferenceFieldUpdater r7 = kotlinx.coroutines.internal.LockFreeLinkedListNode._next$FU androidx.concurrent.futures.AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(r7, r0, r3, r1) throw r6 */ throw new UnsupportedOperationException("Method not decompiled: kotlinx.coroutines.internal.LockFreeLinkedListNode.AbstractAtomicDesc.prepare(kotlinx.coroutines.internal.AtomicOp):java.lang.Object"); } @Override // kotlinx.coroutines.internal.AtomicDesc public final void complete(AtomicOp op, Object failure) { boolean z = failure == null; LockFreeLinkedListNode affectedNode = getAffectedNode(); if (affectedNode == null) { if (DebugKt.getASSERTIONS_ENABLED() && z) { throw new AssertionError(); } return; } LockFreeLinkedListNode queue = getQueue(); if (queue == null) { if (DebugKt.getASSERTIONS_ENABLED() && z) { throw new AssertionError(); } } else { if (AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(LockFreeLinkedListNode._next$FU, affectedNode, op, z ? updatedNext(affectedNode, queue) : queue) && z) { finishOnSuccess(affectedNode, queue); } } } } protected LockFreeLinkedListNode nextIfRemoved() { Object next = getNext(); Removed removed = next instanceof Removed ? (Removed) next : null; if (removed != null) { return removed.ref; } return null; } /* JADX INFO: Access modifiers changed from: private */ /* JADX WARN: Code restructure failed: missing block: B:28:0x0048, code lost: if (androidx.concurrent.futures.AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(kotlinx.coroutines.internal.LockFreeLinkedListNode._next$FU, r3, r2, ((kotlinx.coroutines.internal.Removed) r4).ref) != false) goto L30; */ /* Code decompiled incorrectly, please refer to instructions dump. To view partially-correct add '--show-bad-code' argument */ public final kotlinx.coroutines.internal.LockFreeLinkedListNode correctPrev(kotlinx.coroutines.internal.OpDescriptor r8) { /* r7 = this; L0: java.lang.Object r0 = r7._prev kotlinx.coroutines.internal.LockFreeLinkedListNode r0 = (kotlinx.coroutines.internal.LockFreeLinkedListNode) r0 r1 = 0 r2 = r0 L6: r3 = r1 L7: java.lang.Object r4 = r2._next if (r4 != r7) goto L18 if (r0 != r2) goto Le return r2 Le: java.util.concurrent.atomic.AtomicReferenceFieldUpdater r1 = kotlinx.coroutines.internal.LockFreeLinkedListNode._prev$FU boolean r0 = androidx.concurrent.futures.AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(r1, r7, r0, r2) if (r0 != 0) goto L17 goto L0 L17: return r2 L18: boolean r5 = r7.isRemoved() if (r5 == 0) goto L1f return r1 L1f: if (r4 != r8) goto L22 return r2 L22: boolean r5 = r4 instanceof kotlinx.coroutines.internal.OpDescriptor if (r5 == 0) goto L38 if (r8 == 0) goto L32 r0 = r4 kotlinx.coroutines.internal.OpDescriptor r0 = (kotlinx.coroutines.internal.OpDescriptor) r0 boolean r0 = r8.isEarlierThan(r0) if (r0 == 0) goto L32 return r1 L32: kotlinx.coroutines.internal.OpDescriptor r4 = (kotlinx.coroutines.internal.OpDescriptor) r4 r4.perform(r2) goto L0 L38: boolean r5 = r4 instanceof kotlinx.coroutines.internal.Removed if (r5 == 0) goto L52 if (r3 == 0) goto L4d java.util.concurrent.atomic.AtomicReferenceFieldUpdater r5 = kotlinx.coroutines.internal.LockFreeLinkedListNode._next$FU kotlinx.coroutines.internal.Removed r4 = (kotlinx.coroutines.internal.Removed) r4 kotlinx.coroutines.internal.LockFreeLinkedListNode r4 = r4.ref boolean r2 = androidx.concurrent.futures.AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(r5, r3, r2, r4) if (r2 != 0) goto L4b goto L0 L4b: r2 = r3 goto L6 L4d: java.lang.Object r2 = r2._prev kotlinx.coroutines.internal.LockFreeLinkedListNode r2 = (kotlinx.coroutines.internal.LockFreeLinkedListNode) r2 goto L7 L52: r3 = r4 kotlinx.coroutines.internal.LockFreeLinkedListNode r3 = (kotlinx.coroutines.internal.LockFreeLinkedListNode) r3 r6 = r3 r3 = r2 r2 = r6 goto L7 */ throw new UnsupportedOperationException("Method not decompiled: kotlinx.coroutines.internal.LockFreeLinkedListNode.correctPrev(kotlinx.coroutines.internal.OpDescriptor):kotlinx.coroutines.internal.LockFreeLinkedListNode"); } public final void validateNode$kotlinx_coroutines_core(LockFreeLinkedListNode prev, LockFreeLinkedListNode next) { if (DebugKt.getASSERTIONS_ENABLED() && prev != this._prev) { throw new AssertionError(); } if (DebugKt.getASSERTIONS_ENABLED() && next != this._next) { throw new AssertionError(); } } public String toString() { return new PropertyReference0Impl(this) { // from class: kotlinx.coroutines.internal.LockFreeLinkedListNode.toString.1 @Override // kotlin.jvm.internal.PropertyReference0Impl, kotlin.reflect.KProperty0 public Object get() { return DebugStringsKt.getClassSimpleName(this.receiver); } } + '@' + DebugStringsKt.getHexAddress(this); } public final Object getNext() { while (true) { Object obj = this._next; if (!(obj instanceof OpDescriptor)) { return obj; } ((OpDescriptor) obj).perform(this); } } public final boolean addLastIf(LockFreeLinkedListNode node, Function0 condition) { int iTryCondAddNext; AnonymousClass1 anonymousClass1 = new AnonymousClass1(node, condition); do { iTryCondAddNext = getPrevNode().tryCondAddNext(node, this, anonymousClass1); if (iTryCondAddNext == 1) { return true; } } while (iTryCondAddNext != 2); return false; } public final boolean addLastIfPrevAndIf(LockFreeLinkedListNode node, Function1 predicate, Function0 condition) { int iTryCondAddNext; AnonymousClass1 anonymousClass1 = new AnonymousClass1(node, condition); do { LockFreeLinkedListNode prevNode = getPrevNode(); if (!predicate.invoke(prevNode).booleanValue()) { return false; } iTryCondAddNext = prevNode.tryCondAddNext(node, this, anonymousClass1); if (iTryCondAddNext == 1) { return true; } } while (iTryCondAddNext != 2); return false; } /* JADX INFO: Access modifiers changed from: private */ public final void finishAdd(LockFreeLinkedListNode next) { LockFreeLinkedListNode lockFreeLinkedListNode; do { lockFreeLinkedListNode = (LockFreeLinkedListNode) next._prev; if (getNext() != next) { return; } } while (!AbstractResolvableFuture$SafeAtomicHelper$$ExternalSyntheticBackportWithForwarding0.m(_prev$FU, next, lockFreeLinkedListNode, this)); if (isRemoved()) { next.correctPrev(null); } } }