352 lines
13 KiB
Java
352 lines
13 KiB
Java
package c.i.e.s.b;
|
|
|
|
import c.i.e.d;
|
|
import c.i.e.n.b;
|
|
import c.i.e.n.l.a;
|
|
import c.i.e.n.l.c;
|
|
import c.i.e.s.b.j;
|
|
import com.google.zxing.ChecksumException;
|
|
import com.google.zxing.FormatException;
|
|
import com.google.zxing.common.reedsolomon.ReedSolomonException;
|
|
import java.util.ArrayList;
|
|
import java.util.Map;
|
|
/* compiled from: Decoder */
|
|
public final class e {
|
|
public final c a = new c(a.e);
|
|
|
|
public c.i.e.n.e a(b bVar, Map<d, ?> map) throws FormatException, ChecksumException {
|
|
ChecksumException checksumException;
|
|
FormatException e;
|
|
a aVar = new a(bVar);
|
|
try {
|
|
return b(aVar, map);
|
|
} catch (FormatException e2) {
|
|
e = e2;
|
|
checksumException = null;
|
|
try {
|
|
aVar.e();
|
|
aVar.b = null;
|
|
aVar.f1444c = null;
|
|
aVar.d = true;
|
|
aVar.d();
|
|
aVar.c();
|
|
aVar.b();
|
|
c.i.e.n.e b = b(aVar, map);
|
|
b.f = new i(true);
|
|
return b;
|
|
} catch (ChecksumException | FormatException unused) {
|
|
if (e != null) {
|
|
throw e;
|
|
}
|
|
throw checksumException;
|
|
}
|
|
} catch (ChecksumException e3) {
|
|
checksumException = e3;
|
|
e = null;
|
|
aVar.e();
|
|
aVar.b = null;
|
|
aVar.f1444c = null;
|
|
aVar.d = true;
|
|
aVar.d();
|
|
aVar.c();
|
|
aVar.b();
|
|
c.i.e.n.e b = b(aVar, map);
|
|
b.f = new i(true);
|
|
return b;
|
|
}
|
|
}
|
|
|
|
/* JADX WARNING: Removed duplicated region for block: B:138:0x0257 A[Catch:{ IllegalArgumentException -> 0x0348 }] */
|
|
/* JADX WARNING: Removed duplicated region for block: B:196:0x0343 A[LOOP:19: B:102:0x0204->B:196:0x0343, LOOP_END] */
|
|
/* JADX WARNING: Removed duplicated region for block: B:235:0x0329 A[SYNTHETIC] */
|
|
public final c.i.e.n.e b(a aVar, Map<d, ?> map) throws FormatException, ChecksumException {
|
|
h hVar;
|
|
int ordinal;
|
|
int i;
|
|
int i2;
|
|
int i3;
|
|
b bVar;
|
|
j d = aVar.d();
|
|
f fVar = aVar.c().b;
|
|
g c2 = aVar.c();
|
|
j d2 = aVar.d();
|
|
c cVar = c.values()[c2.f1445c];
|
|
b bVar2 = aVar.a;
|
|
int i4 = bVar2.j;
|
|
cVar.g(bVar2, i4);
|
|
int c3 = d2.c();
|
|
b bVar3 = new b(c3, c3);
|
|
int i5 = 0;
|
|
bVar3.k(0, 0, 9, 9);
|
|
int i6 = c3 - 8;
|
|
bVar3.k(i6, 0, 8, 9);
|
|
bVar3.k(0, i6, 9, 8);
|
|
int length = d2.d.length;
|
|
for (int i7 = 0; i7 < length; i7++) {
|
|
int i8 = d2.d[i7] - 2;
|
|
for (int i9 = 0; i9 < length; i9++) {
|
|
if (!((i7 == 0 && (i9 == 0 || i9 == length - 1)) || (i7 == length - 1 && i9 == 0))) {
|
|
bVar3.k(d2.d[i9] - 2, i8, 5, 5);
|
|
}
|
|
}
|
|
}
|
|
int i10 = c3 - 17;
|
|
int i11 = 6;
|
|
bVar3.k(6, 9, 1, i10);
|
|
bVar3.k(9, 6, i10, 1);
|
|
if (d2.f1447c > 6) {
|
|
int i12 = c3 - 11;
|
|
bVar3.k(i12, 0, 3, 6);
|
|
bVar3.k(0, i12, 6, 3);
|
|
}
|
|
int i13 = d2.f;
|
|
byte[] bArr = new byte[i13];
|
|
int i14 = i4 - 1;
|
|
int i15 = i14;
|
|
int i16 = 0;
|
|
boolean z2 = true;
|
|
int i17 = 0;
|
|
int i18 = 0;
|
|
while (true) {
|
|
int i19 = 2;
|
|
if (i15 <= 0) {
|
|
break;
|
|
}
|
|
if (i15 == i11) {
|
|
i15--;
|
|
}
|
|
int i20 = 0;
|
|
while (i20 < i4) {
|
|
int i21 = z2 ? i14 - i20 : i20;
|
|
while (i5 < i19) {
|
|
int i22 = i15 - i5;
|
|
if (!bVar3.f(i22, i21)) {
|
|
int i23 = i17 + 1;
|
|
int i24 = i18 << 1;
|
|
bVar = bVar3;
|
|
int i25 = aVar.a.f(i22, i21) ? i24 | 1 : i24;
|
|
if (i23 == 8) {
|
|
bArr[i16] = (byte) i25;
|
|
i16++;
|
|
i17 = 0;
|
|
i18 = 0;
|
|
} else {
|
|
i18 = i25;
|
|
i17 = i23;
|
|
}
|
|
} else {
|
|
bVar = bVar3;
|
|
}
|
|
i5++;
|
|
bVar3 = bVar;
|
|
i19 = 2;
|
|
}
|
|
i20++;
|
|
i5 = 0;
|
|
i19 = 2;
|
|
}
|
|
z2 = !z2;
|
|
i15 -= 2;
|
|
i5 = 0;
|
|
i11 = 6;
|
|
}
|
|
if (i16 != d2.f) {
|
|
throw FormatException.a();
|
|
} else if (i13 == d.f) {
|
|
j.b bVar4 = d.e[fVar.ordinal()];
|
|
j.a[] aVarArr = bVar4.b;
|
|
int i26 = 0;
|
|
for (j.a aVar2 : aVarArr) {
|
|
i26 += aVar2.a;
|
|
}
|
|
b[] bVarArr = new b[i26];
|
|
int i27 = 0;
|
|
for (j.a aVar3 : aVarArr) {
|
|
int i28 = 0;
|
|
while (i28 < aVar3.a) {
|
|
int i29 = aVar3.b;
|
|
bVarArr[i27] = new b(i29, new byte[(bVar4.a + i29)]);
|
|
i28++;
|
|
i27++;
|
|
}
|
|
}
|
|
int length2 = bVarArr[0].b.length;
|
|
int i30 = i26 - 1;
|
|
while (i30 >= 0 && bVarArr[i30].b.length != length2) {
|
|
i30--;
|
|
}
|
|
int i31 = i30 + 1;
|
|
int i32 = length2 - bVar4.a;
|
|
int i33 = 0;
|
|
for (int i34 = 0; i34 < i32; i34++) {
|
|
int i35 = 0;
|
|
while (i35 < i27) {
|
|
bVarArr[i35].b[i34] = bArr[i33];
|
|
i35++;
|
|
i33++;
|
|
}
|
|
}
|
|
int i36 = i31;
|
|
while (i36 < i27) {
|
|
bVarArr[i36].b[i32] = bArr[i33];
|
|
i36++;
|
|
i33++;
|
|
}
|
|
boolean z3 = false;
|
|
int length3 = bVarArr[0].b.length;
|
|
while (i32 < length3) {
|
|
int i37 = 0;
|
|
while (i37 < i27) {
|
|
bVarArr[i37].b[i37 < i31 ? i32 : i32 + 1] = bArr[i33];
|
|
i37++;
|
|
i33++;
|
|
}
|
|
i32++;
|
|
}
|
|
int i38 = 0;
|
|
for (int i39 = 0; i39 < i26; i39++) {
|
|
i38 += bVarArr[i39].a;
|
|
}
|
|
byte[] bArr2 = new byte[i38];
|
|
int i40 = 0;
|
|
for (int i41 = 0; i41 < i26; i41++) {
|
|
b bVar5 = bVarArr[i41];
|
|
byte[] bArr3 = bVar5.b;
|
|
int i42 = bVar5.a;
|
|
int length4 = bArr3.length;
|
|
int[] iArr = new int[length4];
|
|
for (int i43 = 0; i43 < length4; i43++) {
|
|
iArr[i43] = bArr3[i43] & 255;
|
|
}
|
|
try {
|
|
this.a.a(iArr, bArr3.length - i42);
|
|
for (int i44 = 0; i44 < i42; i44++) {
|
|
bArr3[i44] = (byte) iArr[i44];
|
|
}
|
|
int i45 = 0;
|
|
while (i45 < i42) {
|
|
bArr2[i40] = bArr3[i45];
|
|
i45++;
|
|
i40++;
|
|
}
|
|
} catch (ReedSolomonException unused) {
|
|
throw ChecksumException.a();
|
|
}
|
|
}
|
|
char[] cArr = d.a;
|
|
h hVar2 = h.TERMINATOR;
|
|
c.i.e.n.c cVar2 = new c.i.e.n.c(bArr2);
|
|
StringBuilder sb = new StringBuilder(50);
|
|
ArrayList arrayList = new ArrayList(1);
|
|
int i46 = -1;
|
|
int i47 = -1;
|
|
c.i.e.n.d dVar = null;
|
|
while (true) {
|
|
try {
|
|
if (cVar2.a() >= 4) {
|
|
int b = cVar2.b(4);
|
|
if (b != 0) {
|
|
if (b == 1) {
|
|
hVar = h.NUMERIC;
|
|
} else if (b == 2) {
|
|
hVar = h.ALPHANUMERIC;
|
|
} else if (b == 3) {
|
|
hVar = h.STRUCTURED_APPEND;
|
|
} else if (b == 4) {
|
|
hVar = h.BYTE;
|
|
} else if (b == 5) {
|
|
hVar = h.FNC1_FIRST_POSITION;
|
|
} else if (b == 7) {
|
|
hVar = h.ECI;
|
|
} else if (b == 8) {
|
|
hVar = h.KANJI;
|
|
} else if (b == 9) {
|
|
hVar = h.FNC1_SECOND_POSITION;
|
|
} else if (b == 13) {
|
|
hVar = h.HANZI;
|
|
} else {
|
|
throw new IllegalArgumentException();
|
|
}
|
|
ordinal = hVar.ordinal();
|
|
if (ordinal != 0) {
|
|
if (ordinal != 3) {
|
|
if (ordinal == 5) {
|
|
int b2 = cVar2.b(8);
|
|
if ((b2 & 128) == 0) {
|
|
i3 = b2 & 127;
|
|
} else if ((b2 & 192) == 128) {
|
|
i3 = ((b2 & 63) << 8) | cVar2.b(8);
|
|
} else if ((b2 & 224) == 192) {
|
|
i3 = ((b2 & 31) << 16) | cVar2.b(16);
|
|
} else {
|
|
throw FormatException.a();
|
|
}
|
|
dVar = c.i.e.n.d.f(i3);
|
|
if (dVar == null) {
|
|
throw FormatException.a();
|
|
}
|
|
} else if (ordinal == 7 || ordinal == 8) {
|
|
z3 = true;
|
|
} else if (ordinal != 9) {
|
|
int b3 = cVar2.b(hVar.f(d));
|
|
int ordinal2 = hVar.ordinal();
|
|
if (ordinal2 == 1) {
|
|
d.e(cVar2, sb, b3);
|
|
} else if (ordinal2 == 2) {
|
|
d.a(cVar2, sb, b3, z3);
|
|
} else if (ordinal2 == 4) {
|
|
d.b(cVar2, sb, b3, dVar, arrayList, map);
|
|
} else if (ordinal2 == 6) {
|
|
d.d(cVar2, sb, b3);
|
|
} else {
|
|
throw FormatException.a();
|
|
}
|
|
} else {
|
|
int b4 = cVar2.b(4);
|
|
int b5 = cVar2.b(hVar.f(d));
|
|
if (b4 == 1) {
|
|
d.c(cVar2, sb, b5);
|
|
}
|
|
}
|
|
i2 = i46;
|
|
i = i47;
|
|
if (hVar != hVar2) {
|
|
return new c.i.e.n.e(bArr2, sb.toString(), arrayList.isEmpty() ? null : arrayList, fVar.toString(), i2, i);
|
|
}
|
|
i46 = i2;
|
|
i47 = i;
|
|
} else if (cVar2.a() >= 16) {
|
|
i46 = cVar2.b(8);
|
|
i47 = cVar2.b(8);
|
|
} else {
|
|
throw FormatException.a();
|
|
}
|
|
i2 = i46;
|
|
i = i47;
|
|
if (hVar != hVar2) {
|
|
}
|
|
}
|
|
i2 = i46;
|
|
i = i47;
|
|
if (hVar != hVar2) {
|
|
}
|
|
}
|
|
}
|
|
hVar = hVar2;
|
|
ordinal = hVar.ordinal();
|
|
if (ordinal != 0) {
|
|
}
|
|
i2 = i46;
|
|
i = i47;
|
|
if (hVar != hVar2) {
|
|
}
|
|
} catch (IllegalArgumentException unused2) {
|
|
throw FormatException.a();
|
|
}
|
|
}
|
|
} else {
|
|
throw new IllegalArgumentException();
|
|
}
|
|
}
|
|
}
|