final int[][] method1274(int i, int j) {
        if (j != 6) {
            return null;
        }
        int ai[][] = super.aClass112_3320.method1036(-106, i);
        if (super.aClass112_3320.aBoolean1822) {
            int ai1[] = method1270(0, Class99.anInt1688 & i + -1, true);
            int ai2[] = method1270(0, i, true);
            int ai3[] = method1270(0, 1 + i & Class99.anInt1688, true);
            int ai5[] = ai[1];
            int ai6[] = ai[2];
            int ai4[] = ai[0];
            for (int k = 0; ~Class117.anInt1861 < ~k; k++) {
                int k1 = anInt4396 * (-ai1[k] + ai3[k]);
                int j2 = k1 >> 12;
                int l1 = (ai2[Class115.anInt1841 & 1 + k] + -ai2[k + -1 & Class115.anInt1841]) * anInt4396;
                int i2 = l1 >> 12;
                int k2 = i2 * i2 >> 12;
                int l2 = j2 * j2 >> 12;
                int i3 = (int) (Math.sqrt((float) (4096 + (k2 + l2)) / 4096F) * 4096D);
                int l;
                int i1;
                int j1;
                if (i3 != 0) {
                    l = l1 / i3;
                    i1 = k1 / i3;
                    j1 = 0x1000000 / i3;
                } else {
                    j1 = 0;
                    l = 0;
                    i1 = 0;
                }
                if (aBoolean4391) {
                    l = (l >> 1) + 2048;
                    j1 = (j1 >> 1) + 2048;
                    i1 = (i1 >> 1) + 2048;
                }
                ai4[k] = l;
                ai5[k] = i1;
                ai6[k] = j1;
            }

        }
        return ai;
    }