package c.i.e.r; import c.i.e.c; import c.i.e.d; import c.i.e.i; import c.i.e.k; import c.i.e.n.e; import c.i.e.r.d.a; import c.i.e.r.d.f; import c.i.e.r.d.g; import c.i.e.r.d.h; import c.i.e.r.d.j; import com.google.zxing.ChecksumException; import com.google.zxing.FormatException; import com.google.zxing.NotFoundException; import com.google.zxing.Result; import java.lang.reflect.Array; import java.util.ArrayList; import java.util.Iterator; import java.util.List; import java.util.Map; /* compiled from: PDF417Reader */ public final class b implements i { public static int b(k kVar, k kVar2) { if (kVar == null || kVar2 == null) { return 0; } return (int) Math.abs(kVar.a - kVar2.a); } public static int c(k kVar, k kVar2) { if (kVar == null || kVar2 == null) { return Integer.MAX_VALUE; } return (int) Math.abs(kVar.a - kVar2.a); } /* JADX WARNING: Code restructure failed: missing block: B:312:0x064c, code lost: r3 = new com.google.zxing.Result(r2.f1409c, r2.a, r4, c.i.e.a.PDF_417); r3.b(c.i.e.j.ERROR_CORRECTION_LEVEL, r2.e); r2 = (c.i.e.r.c) r2.f; */ /* JADX WARNING: Code restructure failed: missing block: B:313:0x0662, code lost: if (r2 == null) goto L_0x0669; */ /* JADX WARNING: Code restructure failed: missing block: B:314:0x0664, code lost: r3.b(c.i.e.j.PDF417_EXTRA_METADATA, r2); */ /* JADX WARNING: Code restructure failed: missing block: B:315:0x0669, code lost: r0.add(r3); r3 = r3; r2 = 0; r5 = 2; */ /* JADX WARNING: Code restructure failed: missing block: B:31:0x015e, code lost: if (r6.e != r7.e) goto L_0x0163; */ /* JADX WARNING: Code restructure failed: missing block: B:52:0x01bd, code lost: r10 = r34; */ /* JADX WARNING: Removed duplicated region for block: B:127:0x02c2 */ /* JADX WARNING: Removed duplicated region for block: B:132:0x0310 */ /* JADX WARNING: Removed duplicated region for block: B:349:0x01c5 A[SYNTHETIC] */ /* JADX WARNING: Removed duplicated region for block: B:37:0x016f */ /* JADX WARNING: Removed duplicated region for block: B:44:0x01a2 */ @Override // c.i.e.i public Result a(c cVar, Map map) throws NotFoundException, FormatException, ChecksumException { c.i.e.r.d.c cVar2; f fVar; int i; boolean z2; int i2; int i3; c.i.e.r.d.c cVar3; Iterator it; Iterator it2; int i4; c.i.e.r.d.d dVar; int i5; int i6; int i7; int i8; c.i.e.r.d.c cVar4; int i9; g gVar; int i10; int i11; c.i.e.r.d.c cVar5; int i12; a aVar; ArrayList arrayList = new ArrayList(); c.i.e.n.b a = cVar.a(); char c2 = 0; List a2 = c.i.e.r.e.a.a(false, a); int i13 = 2; if (((ArrayList) a2).isEmpty()) { int i14 = a.i; int i15 = a.j; c.i.e.n.b bVar = new c.i.e.n.b(i14, i15, a.k, (int[]) a.l.clone()); c.i.e.n.a aVar2 = new c.i.e.n.a(i14); c.i.e.n.a aVar3 = new c.i.e.n.a(i14); for (int i16 = 0; i16 < (i15 + 1) / 2; i16++) { aVar2 = bVar.h(i16, aVar2); int i17 = (i15 - 1) - i16; aVar3 = bVar.h(i17, aVar3); aVar2.i(); aVar3.i(); int[] iArr = aVar3.i; int[] iArr2 = bVar.l; int i18 = bVar.k; System.arraycopy(iArr, 0, iArr2, i16 * i18, i18); int[] iArr3 = aVar2.i; int[] iArr4 = bVar.l; int i19 = bVar.k; System.arraycopy(iArr3, 0, iArr4, i17 * i19, i19); } a2 = c.i.e.r.e.a.a(false, bVar); a = bVar; } Iterator it3 = a2.iterator(); while (it3.hasNext()) { k[] next = it3.next(); k kVar = next[4]; k kVar2 = next[5]; k kVar3 = next[6]; k kVar4 = next[7]; int min = Math.min(Math.min(c(next[c2], next[4]), (c(next[6], next[i13]) * 17) / 18), Math.min(c(next[1], next[5]), (c(next[7], next[3]) * 17) / 18)); int max = Math.max(Math.max(b(next[c2], next[4]), (b(next[6], next[i13]) * 17) / 18), Math.max(b(next[1], next[5]), (b(next[7], next[3]) * 17) / 18)); c.i.e.r.d.k.a aVar4 = j.a; c.i.e.r.d.c cVar6 = new c.i.e.r.d.c(a, kVar, kVar2, kVar3, kVar4); f fVar2 = null; h hVar = null; h hVar2 = null; int i20 = 0; while (true) { if (i20 >= i13) { cVar2 = cVar6; fVar = fVar2; break; } if (kVar != null) { i12 = i20; cVar5 = cVar6; hVar = j.d(a, cVar6, kVar, true, min, max); } else { i12 = i20; cVar5 = cVar6; } if (kVar3 != null) { hVar2 = j.d(a, cVar5, kVar3, false, min, max); } if (!(hVar == null && hVar2 == null)) { if (hVar != null && (aVar = hVar.c()) != null) { if (hVar2 != null) { a c3 = hVar2.c(); if (c3 != null) { if (aVar.a != c3.a) { if (aVar.b != c3.b) { } } } } if (aVar != null) { } } else if (hVar2 != null) { aVar = hVar2.c(); if (aVar != null) { c.i.e.r.d.c a3 = j.a(hVar); c.i.e.r.d.c a4 = j.a(hVar2); if (a3 == null) { a3 = a4; } else if (a4 != null) { a3 = new c.i.e.r.d.c(a3.a, a3.b, a3.f1437c, a4.d, a4.e); } fVar2 = new f(aVar, a3); if (fVar2 == null) { if (i12 != 0 || (cVar6 = fVar2.f1440c) == null) { break; } cVar2 = cVar5; if (cVar6.h >= cVar2.h && cVar6.i <= cVar2.i) { break; } i20 = i12 + 1; hVar = hVar; i13 = 2; } else { throw NotFoundException.k; } } } aVar = null; if (aVar != null) { } } fVar2 = null; if (fVar2 == null) { } } fVar2.f1440c = cVar2; fVar = fVar2; hVar = hVar; int i21 = fVar.d + 1; g[] gVarArr = fVar.b; gVarArr[c2] = hVar; gVarArr[i21] = hVar2; boolean z3 = hVar != null; int i22 = min; int i23 = 1; while (i23 <= i21) { int i24 = z3 ? i23 : i21 - i23; if (fVar.b[i24] == null) { g hVar3 = (i24 == 0 || i24 == i21) ? new h(cVar2, i24 == 0) : new g(cVar2); fVar.b[i24] = hVar3; int i25 = cVar2.h; int i26 = i22; int i27 = max; int i28 = -1; while (i25 <= cVar2.i) { int i29 = z3 ? 1 : -1; int i30 = i24 - i29; if (j.e(fVar, i30)) { it2 = it3; g gVar2 = fVar.b[i30]; i4 = i27; dVar = gVar2.b[i25 - gVar2.a.h]; } else { it2 = it3; i4 = i27; dVar = null; } if (dVar != null) { i6 = z3 ? dVar.b : dVar.a; } else { c.i.e.r.d.d a5 = fVar.b[i24].a(i25); if (a5 != null) { i6 = z3 ? a5.a : a5.b; } else { if (j.e(fVar, i30)) { a5 = fVar.b[i30].a(i25); } if (a5 != null) { i6 = z3 ? a5.b : a5.a; } else { int i31 = i24; int i32 = 0; while (true) { int i33 = i31 - i29; if (j.e(fVar, i33)) { c.i.e.r.d.d[] dVarArr = fVar.b[i33].b; i5 = i25; int i34 = 0; for (int length = dVarArr.length; i34 < length; length = length) { c.i.e.r.d.d dVar2 = dVarArr[i34]; if (dVar2 != null) { i6 = ((dVar2.b - dVar2.a) * i29 * i32) + (z3 ? dVar2.b : dVar2.a); } else { i34++; } } i32++; i31 = i33; i25 = i5; } else { i5 = i25; i6 = z3 ? fVar.f1440c.f : fVar.f1440c.g; } } if (i6 < 0 && i6 <= cVar2.g) { i11 = i6; } else if (i28 == -1) { i11 = i28; } else { i10 = i26; gVar = hVar3; i8 = i24; i7 = i21; i27 = i4; i9 = i5; cVar4 = cVar2; i26 = i10; i25 = i9 + 1; hVar3 = gVar; it3 = it2; cVar2 = cVar4; i24 = i8; i21 = i7; } i9 = i5; cVar4 = cVar2; i8 = i24; gVar = hVar3; i7 = i21; c.i.e.r.d.d c4 = j.c(a, cVar2.f, cVar2.g, z3, i11, i9, i26, i4); if (c4 != null) { gVar.b[i9 - gVar.a.h] = c4; int min2 = Math.min(i26, c4.b - c4.a); i27 = Math.max(i4, c4.b - c4.a); i26 = min2; i28 = i11; i25 = i9 + 1; hVar3 = gVar; it3 = it2; cVar2 = cVar4; i24 = i8; i21 = i7; } else { i27 = i4; i10 = i26; i26 = i10; i25 = i9 + 1; hVar3 = gVar; it3 = it2; cVar2 = cVar4; i24 = i8; i21 = i7; } } } } i5 = i25; if (i6 < 0) { } if (i28 == -1) { } } it = it3; cVar3 = cVar2; i3 = i21; max = i27; i22 = i26; } else { it = it3; cVar3 = cVar2; i3 = i21; } i23++; it3 = it; cVar2 = cVar3; i21 = i3; } int i35 = fVar.a.e; int[] iArr5 = new int[2]; iArr5[1] = fVar.d + 2; iArr5[0] = i35; c.i.e.r.d.b[][] bVarArr = (c.i.e.r.d.b[][]) Array.newInstance(c.i.e.r.d.b.class, iArr5); for (int i36 = 0; i36 < bVarArr.length; i36++) { for (int i37 = 0; i37 < bVarArr[i36].length; i37++) { bVarArr[i36][i37] = new c.i.e.r.d.b(); } } char c5 = 0; fVar.a(fVar.b[0]); int i38 = 1; fVar.a(fVar.b[fVar.d + 1]); int i39 = 928; while (true) { g[] gVarArr2 = fVar.b; if (gVarArr2[c5] != null) { int i40 = fVar.d + i38; if (gVarArr2[i40] != null) { c.i.e.r.d.d[] dVarArr2 = gVarArr2[c5].b; c.i.e.r.d.d[] dVarArr3 = gVarArr2[i40].b; for (int i41 = 0; i41 < dVarArr2.length; i41++) { if (!(dVarArr2[i41] == null || dVarArr3[i41] == null || dVarArr2[i41].e != dVarArr3[i41].e)) { for (int i42 = 1; i42 <= fVar.d; i42++) { c.i.e.r.d.d dVar3 = fVar.b[i42].b[i41]; if (dVar3 != null) { dVar3.e = dVarArr2[i41].e; if (!dVar3.a()) { fVar.b[i42].b[i41] = null; } } } } } } } g[] gVarArr3 = fVar.b; int i43 = 0; if (gVarArr3[0] != null) { c.i.e.r.d.d[] dVarArr4 = gVarArr3[0].b; int i44 = 0; for (int i45 = 0; i45 < dVarArr4.length; i45++) { if (dVarArr4[i45] != null) { int i46 = dVarArr4[i45].e; int i47 = i44; int i48 = 0; for (int i49 = 1; i49 < fVar.d + 1 && i48 < 2; i49++) { c.i.e.r.d.d dVar4 = fVar.b[i49].b[i45]; if (dVar4 != null) { i48 = f.b(i46, i48, dVar4); if (!dVar4.a()) { i47++; } } } i44 = i47; } } i43 = i44; } g[] gVarArr4 = fVar.b; int i50 = fVar.d + 1; if (gVarArr4[i50] == null) { i = 0; } else { c.i.e.r.d.d[] dVarArr5 = gVarArr4[i50].b; i = 0; for (int i51 = 0; i51 < dVarArr5.length; i51++) { if (dVarArr5[i51] != null) { int i52 = dVarArr5[i51].e; int i53 = i; int i54 = 0; for (int i55 = fVar.d + 1; i55 > 0 && i54 < 2; i55--) { c.i.e.r.d.d dVar5 = fVar.b[i55].b[i51]; if (dVar5 != null) { i54 = f.b(i52, i54, dVar5); if (!dVar5.a()) { i53++; } } } i = i53; } } } int i56 = i43 + i; if (i56 == 0) { i56 = 0; } else { for (int i57 = 1; i57 < fVar.d + 1; i57++) { c.i.e.r.d.d[] dVarArr6 = fVar.b[i57].b; for (int i58 = 0; i58 < dVarArr6.length; i58++) { if (dVarArr6[i58] != null && !dVarArr6[i58].a()) { c.i.e.r.d.d dVar6 = dVarArr6[i58]; g[] gVarArr5 = fVar.b; c.i.e.r.d.d[] dVarArr7 = gVarArr5[i57 - 1].b; int i59 = i57 + 1; c.i.e.r.d.d[] dVarArr8 = gVarArr5[i59] != null ? gVarArr5[i59].b : dVarArr7; c.i.e.r.d.d[] dVarArr9 = new c.i.e.r.d.d[14]; dVarArr9[2] = dVarArr7[i58]; dVarArr9[3] = dVarArr8[i58]; if (i58 > 0) { int i60 = i58 - 1; dVarArr9[0] = dVarArr6[i60]; dVarArr9[4] = dVarArr7[i60]; dVarArr9[5] = dVarArr8[i60]; } if (i58 > 1) { int i61 = i58 - 2; dVarArr9[8] = dVarArr6[i61]; dVarArr9[10] = dVarArr7[i61]; dVarArr9[11] = dVarArr8[i61]; } if (i58 < dVarArr6.length - 1) { int i62 = i58 + 1; dVarArr9[1] = dVarArr6[i62]; dVarArr9[6] = dVarArr7[i62]; dVarArr9[7] = dVarArr8[i62]; } if (i58 < dVarArr6.length - 2) { int i63 = i58 + 2; dVarArr9[9] = dVarArr6[i63]; dVarArr9[12] = dVarArr7[i63]; dVarArr9[13] = dVarArr8[i63]; } int i64 = 0; for (int i65 = 14; i64 < i65; i65 = 14) { c.i.e.r.d.d dVar7 = dVarArr9[i64]; if (dVar7 != null && dVar7.a() && dVar7.f1438c == dVar6.f1438c) { dVar6.e = dVar7.e; z2 = true; } else { z2 = false; } if (z2) { break; } i64++; } } } } } if (i56 <= 0 || i56 >= i39) { break; } i39 = i56; c5 = 0; i38 = 1; } g[] gVarArr6 = fVar.b; int i66 = 0; for (g gVar3 : gVarArr6) { if (gVar3 != null) { c.i.e.r.d.d[] dVarArr10 = gVar3.b; for (c.i.e.r.d.d dVar8 : dVarArr10) { if (dVar8 != null && (i2 = dVar8.e) >= 0 && i2 < bVarArr.length) { bVarArr[i2][i66].b(dVar8.d); } } } i66++; } c.i.e.r.d.b bVar2 = bVarArr[0][1]; int[] a6 = bVar2.a(); int i67 = fVar.d; a aVar5 = fVar.a; int i68 = (i67 * aVar5.e) - (2 << aVar5.b); if (a6.length == 0) { if (i68 <= 0 || i68 > 928) { throw NotFoundException.k; } bVar2.b(i68); } else if (a6[0] != i68) { bVar2.b(i68); } ArrayList arrayList2 = new ArrayList(); int[] iArr6 = new int[(fVar.a.e * fVar.d)]; ArrayList arrayList3 = new ArrayList(); ArrayList arrayList4 = new ArrayList(); for (int i69 = 0; i69 < fVar.a.e; i69++) { int i70 = 0; while (i70 < fVar.d) { int i71 = i70 + 1; int[] a7 = bVarArr[i69][i71].a(); int i72 = (fVar.d * i69) + i70; if (a7.length == 0) { arrayList2.add(Integer.valueOf(i72)); } else if (a7.length == 1) { iArr6[i72] = a7[0]; } else { arrayList4.add(Integer.valueOf(i72)); arrayList3.add(a7); } i70 = i71; } } int size = arrayList3.size(); int[][] iArr7 = new int[size][]; for (int i73 = 0; i73 < size; i73++) { iArr7[i73] = (int[]) arrayList3.get(i73); } int i74 = fVar.a.b; int[] b = a.b(arrayList2); int[] b2 = a.b(arrayList4); int length2 = b2.length; int[] iArr8 = new int[length2]; int i75 = 100; while (true) { int i76 = i75 - 1; if (i75 > 0) { for (int i77 = 0; i77 < length2; i77++) { iArr6[b2[i77]] = iArr7[i77][iArr8[i77]]; } try { e b3 = j.b(iArr6, i74, b); break; } catch (ChecksumException unused) { if (length2 != 0) { int i78 = 0; while (true) { if (i78 >= length2) { break; } else if (iArr8[i78] < iArr7[i78].length - 1) { iArr8[i78] = iArr8[i78] + 1; break; } else { iArr8[i78] = 0; if (i78 != length2 - 1) { i78++; } else { throw ChecksumException.a(); } } } i75 = i76; } else { throw ChecksumException.a(); } } } else { throw ChecksumException.a(); } } } Result[] resultArr = (Result[]) arrayList.toArray(new Result[arrayList.size()]); if (!(resultArr == null || resultArr.length == 0 || resultArr[0] == null)) { return resultArr[0]; } throw NotFoundException.k; } @Override // c.i.e.i public void reset() { } }