427 lines
13 KiB
Java
427 lines
13 KiB
Java
package h0.a.a;
|
|
/* compiled from: SymbolTable */
|
|
public final class v {
|
|
public final f a;
|
|
public final d b = null;
|
|
|
|
/* renamed from: c reason: collision with root package name */
|
|
public int f2824c;
|
|
public String d;
|
|
public int e;
|
|
public a[] f = new a[256];
|
|
public int g = 1;
|
|
public c h = new c();
|
|
public int i;
|
|
public c j;
|
|
public int k;
|
|
public a[] l;
|
|
|
|
/* compiled from: SymbolTable */
|
|
public static class a extends u {
|
|
public final int h;
|
|
public a i;
|
|
|
|
public a(int i, int i2, long j, int i3) {
|
|
super(i, i2, null, null, null, j);
|
|
this.h = i3;
|
|
}
|
|
|
|
public a(int i, int i2, String str, int i3) {
|
|
super(i, i2, null, null, str, 0);
|
|
this.h = i3;
|
|
}
|
|
|
|
public a(int i, int i2, String str, long j, int i3) {
|
|
super(i, i2, null, null, str, j);
|
|
this.h = i3;
|
|
}
|
|
|
|
public a(int i, int i2, String str, String str2, int i3) {
|
|
super(i, i2, null, str, str2, 0);
|
|
this.h = i3;
|
|
}
|
|
|
|
public a(int i, int i2, String str, String str2, String str3, long j, int i3) {
|
|
super(i, i2, str, str2, str3, j);
|
|
this.h = i3;
|
|
}
|
|
}
|
|
|
|
public v(f fVar) {
|
|
this.a = fVar;
|
|
}
|
|
|
|
public static int r(int i, int i2) {
|
|
return (i + i2) & Integer.MAX_VALUE;
|
|
}
|
|
|
|
public static int s(int i, String str, String str2, int i2) {
|
|
return Integer.MAX_VALUE & (((i2 + 1) * str2.hashCode() * str.hashCode()) + i);
|
|
}
|
|
|
|
public static int t(int i, String str, String str2, String str3) {
|
|
return Integer.MAX_VALUE & ((str3.hashCode() * str2.hashCode() * str.hashCode()) + i);
|
|
}
|
|
|
|
public static int u(int i, String str, String str2, String str3, int i2) {
|
|
return Integer.MAX_VALUE & ((str3.hashCode() * str2.hashCode() * str.hashCode() * i2) + i);
|
|
}
|
|
|
|
public u a(n nVar, Object... objArr) {
|
|
boolean z2;
|
|
c cVar = this.j;
|
|
if (cVar == null) {
|
|
cVar = new c();
|
|
this.j = cVar;
|
|
}
|
|
for (Object obj : objArr) {
|
|
b(obj);
|
|
}
|
|
int i = cVar.b;
|
|
cVar.j(i(nVar.a, nVar.b, nVar.f2811c, nVar.d, nVar.e).a);
|
|
cVar.j(objArr.length);
|
|
for (Object obj2 : objArr) {
|
|
cVar.j(b(obj2).a);
|
|
}
|
|
int i2 = cVar.b - i;
|
|
int hashCode = nVar.hashCode();
|
|
for (Object obj3 : objArr) {
|
|
hashCode ^= obj3.hashCode();
|
|
}
|
|
int i3 = hashCode & Integer.MAX_VALUE;
|
|
byte[] bArr = this.j.a;
|
|
a[] aVarArr = this.f;
|
|
for (a aVar = aVarArr[i3 % aVarArr.length]; aVar != null; aVar = aVar.i) {
|
|
if (aVar.b == 64 && aVar.h == i3) {
|
|
int i4 = (int) aVar.f;
|
|
int i5 = 0;
|
|
while (true) {
|
|
if (i5 >= i2) {
|
|
z2 = true;
|
|
break;
|
|
} else if (bArr[i + i5] != bArr[i4 + i5]) {
|
|
z2 = false;
|
|
break;
|
|
} else {
|
|
i5++;
|
|
}
|
|
}
|
|
if (z2) {
|
|
this.j.b = i;
|
|
return aVar;
|
|
}
|
|
}
|
|
}
|
|
int i6 = this.i;
|
|
this.i = i6 + 1;
|
|
a aVar2 = new a(i6, 64, (long) i, i3);
|
|
v(aVar2);
|
|
return aVar2;
|
|
}
|
|
|
|
public u b(Object obj) {
|
|
if (obj instanceof Integer) {
|
|
return e(((Integer) obj).intValue());
|
|
}
|
|
if (obj instanceof Byte) {
|
|
return e(((Byte) obj).intValue());
|
|
}
|
|
if (obj instanceof Character) {
|
|
return e(((Character) obj).charValue());
|
|
}
|
|
if (obj instanceof Short) {
|
|
return e(((Short) obj).intValue());
|
|
}
|
|
if (obj instanceof Boolean) {
|
|
return e(((Boolean) obj).booleanValue() ? 1 : 0);
|
|
}
|
|
if (obj instanceof Float) {
|
|
return f(4, Float.floatToRawIntBits(((Float) obj).floatValue()));
|
|
}
|
|
if (obj instanceof Long) {
|
|
return g(5, ((Long) obj).longValue());
|
|
}
|
|
if (obj instanceof Double) {
|
|
return g(6, Double.doubleToRawLongBits(((Double) obj).doubleValue()));
|
|
}
|
|
if (obj instanceof String) {
|
|
return m(8, (String) obj);
|
|
}
|
|
if (obj instanceof w) {
|
|
w wVar = (w) obj;
|
|
int i = wVar.i();
|
|
return i == 10 ? c(wVar.g()) : i == 11 ? m(16, wVar.d()) : c(wVar.d());
|
|
} else if (obj instanceof n) {
|
|
n nVar = (n) obj;
|
|
return i(nVar.a, nVar.b, nVar.f2811c, nVar.d, nVar.e);
|
|
} else if (obj instanceof g) {
|
|
g gVar = (g) obj;
|
|
return d(17, gVar.a, gVar.b, a(gVar.f2805c, gVar.d).a);
|
|
} else {
|
|
throw new IllegalArgumentException(c.d.b.a.a.r("value ", obj));
|
|
}
|
|
}
|
|
|
|
public u c(String str) {
|
|
return m(7, str);
|
|
}
|
|
|
|
public final u d(int i, String str, String str2, int i2) {
|
|
int s2 = s(i, str, str2, i2);
|
|
for (a q = q(s2); q != null; q = q.i) {
|
|
if (q.b == i && q.h == s2 && q.f == ((long) i2) && q.d.equals(str) && q.e.equals(str2)) {
|
|
return q;
|
|
}
|
|
}
|
|
this.h.f(i, i2, k(str, str2));
|
|
int i3 = this.g;
|
|
this.g = i3 + 1;
|
|
a aVar = new a(i3, i, null, str, str2, (long) i2, s2);
|
|
v(aVar);
|
|
return aVar;
|
|
}
|
|
|
|
public u e(int i) {
|
|
return f(3, i);
|
|
}
|
|
|
|
public final u f(int i, int i2) {
|
|
int r = r(i, i2);
|
|
for (a q = q(r); q != null; q = q.i) {
|
|
if (q.b == i && q.h == r && q.f == ((long) i2)) {
|
|
return q;
|
|
}
|
|
}
|
|
c cVar = this.h;
|
|
cVar.g(i);
|
|
cVar.i(i2);
|
|
int i3 = this.g;
|
|
this.g = i3 + 1;
|
|
a aVar = new a(i3, i, (long) i2, r);
|
|
v(aVar);
|
|
return aVar;
|
|
}
|
|
|
|
public final u g(int i, long j) {
|
|
int i2 = (int) j;
|
|
int i3 = (int) (j >>> 32);
|
|
int i4 = (i + i2 + i3) & Integer.MAX_VALUE;
|
|
for (a q = q(i4); q != null; q = q.i) {
|
|
if (q.b == i && q.h == i4 && q.f == j) {
|
|
return q;
|
|
}
|
|
}
|
|
int i5 = this.g;
|
|
c cVar = this.h;
|
|
cVar.g(i);
|
|
int i6 = cVar.b;
|
|
if (i6 + 8 > cVar.a.length) {
|
|
cVar.b(8);
|
|
}
|
|
byte[] bArr = cVar.a;
|
|
int i7 = i6 + 1;
|
|
bArr[i6] = (byte) (i3 >>> 24);
|
|
int i8 = i7 + 1;
|
|
bArr[i7] = (byte) (i3 >>> 16);
|
|
int i9 = i8 + 1;
|
|
bArr[i8] = (byte) (i3 >>> 8);
|
|
int i10 = i9 + 1;
|
|
bArr[i9] = (byte) i3;
|
|
int i11 = i10 + 1;
|
|
bArr[i10] = (byte) (i2 >>> 24);
|
|
int i12 = i11 + 1;
|
|
bArr[i11] = (byte) (i2 >>> 16);
|
|
int i13 = i12 + 1;
|
|
bArr[i12] = (byte) (i2 >>> 8);
|
|
bArr[i13] = (byte) i2;
|
|
cVar.b = i13 + 1;
|
|
this.g += 2;
|
|
a aVar = new a(i5, i, j, i4);
|
|
v(aVar);
|
|
return aVar;
|
|
}
|
|
|
|
public final a h(int i, String str, String str2, String str3) {
|
|
int t = t(i, str, str2, str3);
|
|
for (a q = q(t); q != null; q = q.i) {
|
|
if (q.b == i && q.h == t && q.f2823c.equals(str) && q.d.equals(str2) && q.e.equals(str3)) {
|
|
return q;
|
|
}
|
|
}
|
|
this.h.f(i, m(7, str).a, k(str2, str3));
|
|
int i2 = this.g;
|
|
this.g = i2 + 1;
|
|
a aVar = new a(i2, i, str, str2, str3, 0, t);
|
|
v(aVar);
|
|
return aVar;
|
|
}
|
|
|
|
public u i(int i, String str, String str2, String str3, boolean z2) {
|
|
int u = u(15, str, str2, str3, i);
|
|
for (a q = q(u); q != null; q = q.i) {
|
|
if (q.b == 15 && q.h == u && q.f == ((long) i) && q.f2823c.equals(str) && q.d.equals(str2) && q.e.equals(str3)) {
|
|
return q;
|
|
}
|
|
}
|
|
if (i <= 4) {
|
|
this.h.d(15, i, h(9, str, str2, str3).a);
|
|
} else {
|
|
this.h.d(15, i, h(z2 ? 11 : 10, str, str2, str3).a);
|
|
}
|
|
int i2 = this.g;
|
|
this.g = i2 + 1;
|
|
a aVar = new a(i2, 15, str, str2, str3, (long) i, u);
|
|
v(aVar);
|
|
return aVar;
|
|
}
|
|
|
|
public u j(String str) {
|
|
return m(19, str);
|
|
}
|
|
|
|
public int k(String str, String str2) {
|
|
int hashCode = ((str2.hashCode() * str.hashCode()) + 12) & Integer.MAX_VALUE;
|
|
for (a q = q(hashCode); q != null; q = q.i) {
|
|
if (q.b == 12 && q.h == hashCode && q.d.equals(str) && q.e.equals(str2)) {
|
|
return q.a;
|
|
}
|
|
}
|
|
this.h.f(12, l(str), l(str2));
|
|
int i = this.g;
|
|
this.g = i + 1;
|
|
v(new a(i, 12, str, str2, hashCode));
|
|
return i;
|
|
}
|
|
|
|
public int l(String str) {
|
|
int hashCode = (str.hashCode() + 1) & Integer.MAX_VALUE;
|
|
for (a q = q(hashCode); q != null; q = q.i) {
|
|
if (q.b == 1 && q.h == hashCode && q.e.equals(str)) {
|
|
return q.a;
|
|
}
|
|
}
|
|
c cVar = this.h;
|
|
cVar.g(1);
|
|
int length = str.length();
|
|
if (length <= 65535) {
|
|
int i = cVar.b;
|
|
if (i + 2 + length > cVar.a.length) {
|
|
cVar.b(length + 2);
|
|
}
|
|
byte[] bArr = cVar.a;
|
|
int i2 = i + 1;
|
|
bArr[i] = (byte) (length >>> 8);
|
|
int i3 = i2 + 1;
|
|
bArr[i2] = (byte) length;
|
|
int i4 = 0;
|
|
while (true) {
|
|
if (i4 >= length) {
|
|
cVar.b = i3;
|
|
break;
|
|
}
|
|
char charAt = str.charAt(i4);
|
|
if (charAt < 1 || charAt > 127) {
|
|
break;
|
|
}
|
|
bArr[i3] = (byte) charAt;
|
|
i4++;
|
|
i3++;
|
|
}
|
|
cVar.b = i3;
|
|
cVar.a(str, i4, 65535);
|
|
int i5 = this.g;
|
|
this.g = i5 + 1;
|
|
v(new a(i5, 1, str, hashCode));
|
|
return i5;
|
|
}
|
|
throw new IllegalArgumentException("UTF8 string too large");
|
|
}
|
|
|
|
public final u m(int i, String str) {
|
|
int hashCode = (str.hashCode() + i) & Integer.MAX_VALUE;
|
|
for (a q = q(hashCode); q != null; q = q.i) {
|
|
if (q.b == i && q.h == hashCode && q.e.equals(str)) {
|
|
return q;
|
|
}
|
|
}
|
|
this.h.e(i, l(str));
|
|
int i2 = this.g;
|
|
this.g = i2 + 1;
|
|
a aVar = new a(i2, i, str, hashCode);
|
|
v(aVar);
|
|
return aVar;
|
|
}
|
|
|
|
public int n(String str) {
|
|
int hashCode = (str.hashCode() + 128) & Integer.MAX_VALUE;
|
|
for (a q = q(hashCode); q != null; q = q.i) {
|
|
if (q.b == 128 && q.h == hashCode && q.e.equals(str)) {
|
|
return q.a;
|
|
}
|
|
}
|
|
return o(new a(this.k, 128, str, hashCode));
|
|
}
|
|
|
|
public final int o(a aVar) {
|
|
if (this.l == null) {
|
|
this.l = new a[16];
|
|
}
|
|
int i = this.k;
|
|
a[] aVarArr = this.l;
|
|
if (i == aVarArr.length) {
|
|
a[] aVarArr2 = new a[(aVarArr.length * 2)];
|
|
System.arraycopy(aVarArr, 0, aVarArr2, 0, aVarArr.length);
|
|
this.l = aVarArr2;
|
|
}
|
|
a[] aVarArr3 = this.l;
|
|
int i2 = this.k;
|
|
this.k = i2 + 1;
|
|
aVarArr3[i2] = aVar;
|
|
v(aVar);
|
|
return aVar.a;
|
|
}
|
|
|
|
public int p(String str, int i) {
|
|
int hashCode = (str.hashCode() + 129 + i) & Integer.MAX_VALUE;
|
|
for (a q = q(hashCode); q != null; q = q.i) {
|
|
if (q.b == 129 && q.h == hashCode && q.f == ((long) i) && q.e.equals(str)) {
|
|
return q.a;
|
|
}
|
|
}
|
|
return o(new a(this.k, 129, str, (long) i, hashCode));
|
|
}
|
|
|
|
public final a q(int i) {
|
|
a[] aVarArr = this.f;
|
|
return aVarArr[i % aVarArr.length];
|
|
}
|
|
|
|
public final a v(a aVar) {
|
|
int i = this.e;
|
|
a[] aVarArr = this.f;
|
|
if (i > (aVarArr.length * 3) / 4) {
|
|
int length = aVarArr.length;
|
|
int i2 = (length * 2) + 1;
|
|
a[] aVarArr2 = new a[i2];
|
|
for (int i3 = length - 1; i3 >= 0; i3--) {
|
|
a aVar2 = this.f[i3];
|
|
while (aVar2 != null) {
|
|
int i4 = aVar2.h % i2;
|
|
a aVar3 = aVar2.i;
|
|
aVar2.i = aVarArr2[i4];
|
|
aVarArr2[i4] = aVar2;
|
|
aVar2 = aVar3;
|
|
}
|
|
}
|
|
this.f = aVarArr2;
|
|
}
|
|
this.e++;
|
|
int i5 = aVar.h;
|
|
a[] aVarArr3 = this.f;
|
|
int length2 = i5 % aVarArr3.length;
|
|
aVar.i = aVarArr3[length2];
|
|
aVarArr3[length2] = aVar;
|
|
return aVar;
|
|
}
|
|
}
|