137 lines
3.5 KiB
Java
137 lines
3.5 KiB
Java
package h0.a.a;
|
|
|
|
import c.d.b.a.a;
|
|
/* compiled from: Label */
|
|
public class p {
|
|
public static final p a = new p();
|
|
public short b;
|
|
|
|
/* renamed from: c reason: collision with root package name */
|
|
public short f2806c;
|
|
public int[] d;
|
|
public int e;
|
|
public int[] f;
|
|
public short g;
|
|
public short h;
|
|
public short i;
|
|
public short j;
|
|
public m k;
|
|
public p l;
|
|
public j m;
|
|
public p n;
|
|
|
|
public final void a(int i, int i2, int i3) {
|
|
if (this.f == null) {
|
|
this.f = new int[6];
|
|
}
|
|
int[] iArr = this.f;
|
|
int i4 = iArr[0];
|
|
if (i4 + 2 >= iArr.length) {
|
|
int[] iArr2 = new int[(iArr.length + 6)];
|
|
System.arraycopy(iArr, 0, iArr2, 0, iArr.length);
|
|
this.f = iArr2;
|
|
}
|
|
int[] iArr3 = this.f;
|
|
int i5 = i4 + 1;
|
|
iArr3[i5] = i;
|
|
int i6 = i5 + 1;
|
|
iArr3[i6] = i2 | i3;
|
|
iArr3[0] = i6;
|
|
}
|
|
|
|
public final p b() {
|
|
m mVar = this.k;
|
|
return mVar == null ? this : mVar.a;
|
|
}
|
|
|
|
public final void c(short s2) {
|
|
this.n = a;
|
|
p pVar = this;
|
|
while (pVar != a) {
|
|
p pVar2 = pVar.n;
|
|
pVar.n = null;
|
|
if (pVar.j == 0) {
|
|
pVar.j = s2;
|
|
pVar = pVar.d(pVar2);
|
|
} else {
|
|
pVar = pVar2;
|
|
}
|
|
}
|
|
}
|
|
|
|
public final p d(p pVar) {
|
|
j jVar = this.m;
|
|
while (jVar != null) {
|
|
if (!((this.b & 16) != 0 && jVar == this.m.f2801c)) {
|
|
p pVar2 = jVar.b;
|
|
if (pVar2.n == null) {
|
|
pVar2.n = pVar;
|
|
pVar = pVar2;
|
|
}
|
|
}
|
|
jVar = jVar.f2801c;
|
|
}
|
|
return pVar;
|
|
}
|
|
|
|
public final void e(c cVar, int i, boolean z2) {
|
|
if ((this.b & 4) == 0) {
|
|
if (z2) {
|
|
a(i, 536870912, cVar.b);
|
|
cVar.i(-1);
|
|
return;
|
|
}
|
|
a(i, 268435456, cVar.b);
|
|
cVar.j(-1);
|
|
} else if (z2) {
|
|
cVar.i(this.e - i);
|
|
} else {
|
|
cVar.j(this.e - i);
|
|
}
|
|
}
|
|
|
|
public final boolean f(byte[] bArr, int i) {
|
|
this.b = (short) (this.b | 4);
|
|
this.e = i;
|
|
int[] iArr = this.f;
|
|
boolean z2 = false;
|
|
if (iArr == null) {
|
|
return false;
|
|
}
|
|
for (int i2 = iArr[0]; i2 > 0; i2 -= 2) {
|
|
int[] iArr2 = this.f;
|
|
int i3 = iArr2[i2 - 1];
|
|
int i4 = iArr2[i2];
|
|
int i5 = i - i3;
|
|
int i6 = 268435455 & i4;
|
|
if ((i4 & -268435456) == 268435456) {
|
|
if (i5 < -32768 || i5 > 32767) {
|
|
int i7 = bArr[i3] & 255;
|
|
if (i7 < 198) {
|
|
bArr[i3] = (byte) (i7 + 49);
|
|
} else {
|
|
bArr[i3] = (byte) (i7 + 20);
|
|
}
|
|
z2 = true;
|
|
}
|
|
bArr[i6] = (byte) (i5 >>> 8);
|
|
bArr[i6 + 1] = (byte) i5;
|
|
} else {
|
|
int i8 = i6 + 1;
|
|
bArr[i6] = (byte) (i5 >>> 24);
|
|
int i9 = i8 + 1;
|
|
bArr[i8] = (byte) (i5 >>> 16);
|
|
bArr[i9] = (byte) (i5 >>> 8);
|
|
bArr[i9 + 1] = (byte) i5;
|
|
}
|
|
}
|
|
return z2;
|
|
}
|
|
|
|
public String toString() {
|
|
StringBuilder L = a.L("L");
|
|
L.append(System.identityHashCode(this));
|
|
return L.toString();
|
|
}
|
|
}
|