305 lines
11 KiB
Java
305 lines
11 KiB
Java
package c.i.a.f.h.l;
|
|
|
|
import c.i.a.f.e.o.f;
|
|
import com.google.android.gms.internal.measurement.zzij;
|
|
/* compiled from: com.google.android.gms:play-services-measurement-base@@18.0.0 */
|
|
public final class n7 extends m7 {
|
|
public static int d(byte[] bArr, int i, long j, int i2) {
|
|
if (i2 == 0) {
|
|
m7 m7Var = k7.a;
|
|
if (i > -12) {
|
|
return -1;
|
|
}
|
|
return i;
|
|
} else if (i2 == 1) {
|
|
byte a = j7.a(bArr, j);
|
|
m7 m7Var2 = k7.a;
|
|
if (i > -12 || a > -65) {
|
|
return -1;
|
|
}
|
|
return i ^ (a << 8);
|
|
} else if (i2 == 2) {
|
|
return k7.c(i, j7.a(bArr, j), j7.a(bArr, j + 1));
|
|
} else {
|
|
throw new AssertionError();
|
|
}
|
|
}
|
|
|
|
/* JADX WARNING: Code restructure failed: missing block: B:29:0x0061, code lost:
|
|
return -1;
|
|
*/
|
|
/* JADX WARNING: Code restructure failed: missing block: B:57:0x00b6, code lost:
|
|
return -1;
|
|
*/
|
|
@Override // c.i.a.f.h.l.m7
|
|
public final int a(int i, byte[] bArr, int i2, int i3) {
|
|
int i4;
|
|
long j;
|
|
if ((i2 | i3 | (bArr.length - i3)) >= 0) {
|
|
long j2 = (long) i2;
|
|
int i5 = (int) (((long) i3) - j2);
|
|
if (i5 >= 16) {
|
|
long j3 = j2;
|
|
i4 = 0;
|
|
while (true) {
|
|
if (i4 >= i5) {
|
|
i4 = i5;
|
|
break;
|
|
}
|
|
long j4 = j3 + 1;
|
|
if (j7.a(bArr, j3) < 0) {
|
|
break;
|
|
}
|
|
i4++;
|
|
j3 = j4;
|
|
}
|
|
} else {
|
|
i4 = 0;
|
|
}
|
|
int i6 = i5 - i4;
|
|
long j5 = j2 + ((long) i4);
|
|
while (true) {
|
|
byte b = 0;
|
|
while (true) {
|
|
if (i6 <= 0) {
|
|
break;
|
|
}
|
|
long j6 = j5 + 1;
|
|
b = j7.a(bArr, j5);
|
|
if (b < 0) {
|
|
j5 = j6;
|
|
break;
|
|
}
|
|
i6--;
|
|
j5 = j6;
|
|
}
|
|
if (i6 == 0) {
|
|
return 0;
|
|
}
|
|
int i7 = i6 - 1;
|
|
if (b >= -32) {
|
|
if (b >= -16) {
|
|
if (i7 >= 3) {
|
|
i6 = i7 - 3;
|
|
long j7 = j5 + 1;
|
|
byte a = j7.a(bArr, j5);
|
|
if (a > -65 || (((a + 112) + (b << 28)) >> 30) != 0) {
|
|
break;
|
|
}
|
|
long j8 = j7 + 1;
|
|
if (j7.a(bArr, j7) > -65) {
|
|
break;
|
|
}
|
|
j = j8 + 1;
|
|
if (j7.a(bArr, j8) > -65) {
|
|
break;
|
|
}
|
|
} else {
|
|
return d(bArr, b, j5, i7);
|
|
}
|
|
} else if (i7 >= 2) {
|
|
i6 = i7 - 2;
|
|
long j9 = j5 + 1;
|
|
byte a2 = j7.a(bArr, j5);
|
|
if (a2 > -65 || ((b == -32 && a2 < -96) || (b == -19 && a2 >= -96))) {
|
|
break;
|
|
}
|
|
j5 = j9 + 1;
|
|
if (j7.a(bArr, j9) > -65) {
|
|
break;
|
|
}
|
|
} else {
|
|
return d(bArr, b, j5, i7);
|
|
}
|
|
} else if (i7 != 0) {
|
|
i6 = i7 - 1;
|
|
if (b < -62) {
|
|
break;
|
|
}
|
|
j = j5 + 1;
|
|
if (j7.a(bArr, j5) > -65) {
|
|
break;
|
|
}
|
|
} else {
|
|
return b;
|
|
}
|
|
j5 = j;
|
|
}
|
|
return -1;
|
|
}
|
|
throw new ArrayIndexOutOfBoundsException(String.format("Array length=%d, index=%d, limit=%d", Integer.valueOf(bArr.length), Integer.valueOf(i2), Integer.valueOf(i3)));
|
|
}
|
|
|
|
@Override // c.i.a.f.h.l.m7
|
|
public final int b(CharSequence charSequence, byte[] bArr, int i, int i2) {
|
|
char c2;
|
|
long j;
|
|
long j2;
|
|
long j3;
|
|
int i3;
|
|
char charAt;
|
|
long j4 = (long) i;
|
|
long j5 = ((long) i2) + j4;
|
|
int length = charSequence.length();
|
|
if (length > i2 || bArr.length - i2 < i) {
|
|
char charAt2 = charSequence.charAt(length - 1);
|
|
StringBuilder sb = new StringBuilder(37);
|
|
sb.append("Failed writing ");
|
|
sb.append(charAt2);
|
|
sb.append(" at index ");
|
|
sb.append(i + i2);
|
|
throw new ArrayIndexOutOfBoundsException(sb.toString());
|
|
}
|
|
int i4 = 0;
|
|
while (true) {
|
|
c2 = 128;
|
|
j = 1;
|
|
if (i4 >= length || (charAt = charSequence.charAt(i4)) >= 128) {
|
|
break;
|
|
}
|
|
j7.g(bArr, j4, (byte) charAt);
|
|
i4++;
|
|
j4 = 1 + j4;
|
|
}
|
|
if (i4 == length) {
|
|
return (int) j4;
|
|
}
|
|
while (i4 < length) {
|
|
char charAt3 = charSequence.charAt(i4);
|
|
if (charAt3 < c2 && j4 < j5) {
|
|
long j6 = j4 + j;
|
|
j7.g(bArr, j4, (byte) charAt3);
|
|
j3 = j;
|
|
j2 = j6;
|
|
} else if (charAt3 < 2048 && j4 <= j5 - 2) {
|
|
long j7 = j4 + j;
|
|
j7.g(bArr, j4, (byte) ((charAt3 >>> 6) | 960));
|
|
j7.g(bArr, j7, (byte) ((charAt3 & '?') | 128));
|
|
j2 = j7 + j;
|
|
j3 = j;
|
|
i4++;
|
|
c2 = 128;
|
|
j4 = j2;
|
|
j = j3;
|
|
} else if ((charAt3 < 55296 || 57343 < charAt3) && j4 <= j5 - 3) {
|
|
long j8 = j4 + j;
|
|
j7.g(bArr, j4, (byte) ((charAt3 >>> '\f') | 480));
|
|
long j9 = j8 + j;
|
|
j7.g(bArr, j8, (byte) (((charAt3 >>> 6) & 63) | 128));
|
|
j7.g(bArr, j9, (byte) ((charAt3 & '?') | 128));
|
|
j2 = j9 + 1;
|
|
j3 = 1;
|
|
} else if (j4 <= j5 - 4) {
|
|
int i5 = i4 + 1;
|
|
if (i5 != length) {
|
|
char charAt4 = charSequence.charAt(i5);
|
|
if (Character.isSurrogatePair(charAt3, charAt4)) {
|
|
int codePoint = Character.toCodePoint(charAt3, charAt4);
|
|
long j10 = j4 + 1;
|
|
j7.g(bArr, j4, (byte) ((codePoint >>> 18) | 240));
|
|
long j11 = j10 + 1;
|
|
j7.g(bArr, j10, (byte) (((codePoint >>> 12) & 63) | 128));
|
|
long j12 = j11 + 1;
|
|
j7.g(bArr, j11, (byte) (((codePoint >>> 6) & 63) | 128));
|
|
j3 = 1;
|
|
j2 = j12 + 1;
|
|
j7.g(bArr, j12, (byte) ((codePoint & 63) | 128));
|
|
i4 = i5;
|
|
i4++;
|
|
c2 = 128;
|
|
j4 = j2;
|
|
j = j3;
|
|
} else {
|
|
i4 = i5;
|
|
}
|
|
}
|
|
throw new o7(i4 - 1, length);
|
|
} else if (55296 > charAt3 || charAt3 > 57343 || ((i3 = i4 + 1) != length && Character.isSurrogatePair(charAt3, charSequence.charAt(i3)))) {
|
|
StringBuilder sb2 = new StringBuilder(46);
|
|
sb2.append("Failed writing ");
|
|
sb2.append(charAt3);
|
|
sb2.append(" at index ");
|
|
sb2.append(j4);
|
|
throw new ArrayIndexOutOfBoundsException(sb2.toString());
|
|
} else {
|
|
throw new o7(i4, length);
|
|
}
|
|
i4++;
|
|
c2 = 128;
|
|
j4 = j2;
|
|
j = j3;
|
|
}
|
|
return (int) j4;
|
|
}
|
|
|
|
@Override // c.i.a.f.h.l.m7
|
|
public final String c(byte[] bArr, int i, int i2) throws zzij {
|
|
if ((i | i2 | ((bArr.length - i) - i2)) >= 0) {
|
|
int i3 = i + i2;
|
|
char[] cArr = new char[i2];
|
|
int i4 = 0;
|
|
while (i < i3) {
|
|
byte a = j7.a(bArr, (long) i);
|
|
if (!f.R1(a)) {
|
|
break;
|
|
}
|
|
i++;
|
|
cArr[i4] = (char) a;
|
|
i4++;
|
|
}
|
|
int i5 = i4;
|
|
while (i < i3) {
|
|
int i6 = i + 1;
|
|
byte a2 = j7.a(bArr, (long) i);
|
|
if (f.R1(a2)) {
|
|
int i7 = i5 + 1;
|
|
cArr[i5] = (char) a2;
|
|
i = i6;
|
|
while (true) {
|
|
i5 = i7;
|
|
if (i >= i3) {
|
|
break;
|
|
}
|
|
byte a3 = j7.a(bArr, (long) i);
|
|
if (!f.R1(a3)) {
|
|
break;
|
|
}
|
|
i++;
|
|
i7 = i5 + 1;
|
|
cArr[i5] = (char) a3;
|
|
}
|
|
} else {
|
|
if (!(a2 < -32)) {
|
|
if (a2 < -16) {
|
|
if (i6 < i3 - 1) {
|
|
int i8 = i6 + 1;
|
|
f.J1(a2, j7.a(bArr, (long) i6), j7.a(bArr, (long) i8), cArr, i5);
|
|
i = i8 + 1;
|
|
i5++;
|
|
} else {
|
|
throw zzij.e();
|
|
}
|
|
} else if (i6 < i3 - 2) {
|
|
int i9 = i6 + 1;
|
|
int i10 = i9 + 1;
|
|
f.I1(a2, j7.a(bArr, (long) i6), j7.a(bArr, (long) i9), j7.a(bArr, (long) i10), cArr, i5);
|
|
i5 = i5 + 1 + 1;
|
|
i = i10 + 1;
|
|
} else {
|
|
throw zzij.e();
|
|
}
|
|
} else if (i6 < i3) {
|
|
f.K1(a2, j7.a(bArr, (long) i6), cArr, i5);
|
|
i = i6 + 1;
|
|
i5++;
|
|
} else {
|
|
throw zzij.e();
|
|
}
|
|
}
|
|
}
|
|
return new String(cArr, 0, i5);
|
|
}
|
|
throw new ArrayIndexOutOfBoundsException(String.format("buffer length=%d, index=%d, size=%d", Integer.valueOf(bArr.length), Integer.valueOf(i), Integer.valueOf(i2)));
|
|
}
|
|
}
|