package o; import java.lang.Comparable; import o.InterfaceC15123ghl; /* renamed from: o.ghk, reason: case insensitive filesystem */ /* loaded from: classes.dex */ public class C15122ghk> { public volatile int _size = 0; public T[] e; public final T b() { C15045gfe.b(); T[] tArr = this.e; C14957gcv.e(tArr); this._size--; if (this._size > 0) { d(0, this._size); int i = (-1) / 2; e(0); } T t = tArr[this._size]; C14957gcv.e(t); C15045gfe.b(); tArr[this._size] = null; return t; } public final void d(int i, int i2) { T[] tArr = this.e; C14957gcv.e(tArr); T t = tArr[i2]; C14957gcv.e(t); T t2 = tArr[i]; C14957gcv.e(t2); tArr[i] = t; tArr[i2] = t2; } public final T c() { T t; synchronized (this) { T[] tArr = this.e; t = tArr != null ? tArr[0] : null; } return t; } public final T e() { T b; synchronized (this) { b = this._size > 0 ? b() : null; } return b; } /* JADX WARN: Code restructure failed: missing block: B:7:0x0025, code lost: if (((java.lang.Comparable) r3).compareTo(r4) < 0) goto L12; */ /* Code decompiled incorrectly, please refer to instructions dump. To view partially-correct add '--show-bad-code' argument */ private final void e(int r6) { /* r5 = this; r6 = 0 L1: int r0 = r6 << 1 int r1 = r0 + 1 int r2 = r5._size if (r1 < r2) goto La return La: T extends o.ghl & java.lang.Comparable[] r2 = r5.e o.C14957gcv.e(r2) int r0 = r0 + 2 int r3 = r5._size if (r0 >= r3) goto L28 r3 = r2[r0] o.C14957gcv.e(r3) java.lang.Comparable r3 = (java.lang.Comparable) r3 r4 = r2[r1] o.C14957gcv.e(r4) int r3 = r3.compareTo(r4) if (r3 >= 0) goto L28 goto L29 L28: r0 = r1 L29: r1 = r2[r6] o.C14957gcv.e(r1) java.lang.Comparable r1 = (java.lang.Comparable) r1 r2 = r2[r0] o.C14957gcv.e(r2) int r1 = r1.compareTo(r2) if (r1 > 0) goto L3c return L3c: r5.d(r6, r0) r6 = r0 goto L1 */ throw new UnsupportedOperationException("Method not decompiled: o.C15122ghk.e(int):void"); } }