a.java

哈利波特与凤凰令的一个小游戏

            {
                int j1;
                int k1 = (j1 = super.d[i1] & 0xffff) & 0xfff;
                int l1;
                if((l1 = j1 >> 12) == 11)
                    aa.a.a[l1][k1].j = (byte)(c - 6);
            }

        }
    }

    private void h()
    {
        Object obj = null;
        if(super.d != null)
        {
            for(int i1 = 0; i1 < super.d.length; i1++)
            {
                int j1;
                int k1 = (j1 = super.d[i1] & 0xffff) & 0xfff;
                int l1 = j1 >> 12;
                q q1 = aa.a.a[l1][k1];
                switch(l1)
                {
                default:
                    break;

                case 1: // '\001'
                    if(c < 6)
                    {
                        q1.j = c;
                        ((h)q1).g = 0;
                    }
                    break;

                case 11: // '\013'
                    if(c >= 6 && c < 11)
                        q1.j = (byte)(c - 6);
                    break;
                }
            }

        }
    }

    private boolean a()
    {
        if(c < 11)
            return false;
        if(super.d != null)
        {
            for(int i1 = 0; i1 < super.d.length; i1++)
            {
                int j1;
                int k1 = (j1 = super.d[i1] & 0xffff) & 0xfff;
                q q1;
                int l1;
                if((l1 = j1 >> 12) == 1 && (q1 = aa.a.a[l1][k1]).j != 18)
                    return true;
            }

        }
        return false;
    }

    public final void b()
    {
        if(super.j == 2)
        {
            super.j = 0;
            return;
        }
        super.j = 2;
        aa.a.a.e = false;
        if(a == 2 && a)
            aa.a.a.a(aa.a.a, true);
        if(a == 14)
        {
            aa.a.a.d = 20;
            aa.a.a.e = 200;
            aa.a.a.c = 135;
            aa.a.a.b = 315;
        }
    }

    private static boolean b()
    {
        ai ai1;
        if((ai1 = aa.a).f < 18)
        {
            ai1.f++;
            return false;
        } else
        {
            return true;
        }
    }

    private static boolean c()
    {
        ai ai1;
        if((ai1 = aa.a).f > 0)
        {
            ai1.f--;
            return false;
        } else
        {
            return true;
        }
    }

    private static boolean a(h h1)
    {
        if(((q) (h1)).j == 1)
        {
            h1.j = 2;
            h1.b = h1.d;
            h1.a = true;
        }
        if(((q) (h1)).j == 0)
            return true;
        if(h1.a != null)
        {
            if(h1.a == h1.a.a - 1 && ((q) (h1)).j == 4)
                h1.j = 0;
            return false;
        } else
        {
            return true;
        }
    }

    private static boolean b(h h1)
    {
        if(((q) (h1)).j == 0)
        {
            h1.j = 2;
            h1.b = h1.d;
        }
        if(((q) (h1)).j == 1)
            return true;
        if(h1.a != null)
        {
            if(h1.a == 0)
            {
                if(((q) (h1)).j == 4)
                    h1.j = 1;
                h1.a = false;
            }
            return false;
        } else
        {
            return true;
        }
    }

    private static void a(h h1, int i1)
    {
        if(((q) (h1)).j == 0)
        {
            h1.a += i1;
            if(h1.a > ((z) (h1)).a.o + aa.b(0, 1024))
            {
                ah ah1 = null;
                if(((q) (h1)).d != null)
                {
                    int j1 = 0;
                    do
                    {
                        if(j1 >= ((q) (h1)).d.length)
                            break;
                        int k1;
                        int l1 = (k1 = ((q) (h1)).d[j1] & 0xffff) & 0xfff;
                        int i2;
                        if((i2 = k1 >> 12) == 4)
                        {
                            ah1 = (ah)aa.a.a[i2][l1];
                            break;
                        }
                        j1++;
                    } while(true);
                }
                if(ah1 != null)
                {
                    ah1.E = 100;
                    h1.b = ah1;
                    h1.j = 11;
                    h1.a = 0;
                }
            }
        }
    }

    private void a(o o1, int i1)
    {
        if(((q) (o1)).j == 15 || ((q) (o1)).j == 3)
        {
            ah ah1 = null;
            if(((q) (o1)).d != null)
            {
                int j1 = 0;
                do
                {
                    if(j1 >= ((q) (o1)).d.length)
                        break;
                    int k1;
                    int l1 = (k1 = ((q) (o1)).d[j1] & 0xffff) & 0xfff;
                    int i2;
                    if((i2 = k1 >> 12) == 4)
                    {
                        ah1 = (ah)aa.a.a[i2][l1];
                        break;
                    }
                    j1++;
                } while(true);
            }
            if(ah1 != null)
            {
                ah1.E = 100;
                o1.a = ah1;
                o1.a_ = o1.a(((q) (ah1)).o - super.o, ((q) (ah1)).p - super.p);
                o1.a(((z) (o1)).a.c + o1.a(), i1);
                if(((q) (o1)).j != 3)
                {
                    if(o1.c())
                    {
                        o1.r = 7;
                        o1.j = 3;
                        o1.g = 0;
                        o1.a = o1.a();
                        if(o1.a == 1)
                        {
                            o1.a = 5;
                            return;
                        }
                    }
                } else
                {
                    o1.g += i1;
                    if(o1.g > aa.a[o1.a].b)
                    {
                        if(o1.r > 0)
                        {
                            o1.f();
                            o1.b(i1);
                            o1.r = 0;
                            return;
                        }
                        if(o1.g > (aa.a[o1.a].b << 1) + aa.b(0, 1024))
                        {
                            o1.j = 15;
                            o1.d(((z) (o1)).a.a + o1.a());
                            return;
                        }
                    } else
                    if(o1.r < 12)
                        o1.r++;
                }
            }
        }
    }

    private q a()
    {
        int i1;
        int j1 = (i1 = super.d[0] & 0xffff) & 0xfff;
        int k1 = i1 >> 12;
        return aa.a.a[k1][j1];
    }

    private void i()
    {
        e e1 = aa.a.a;
        o o1 = aa.a.a;
        ah ah1 = (ah)a();
        switch(d)
        {
        default:
            break;

        case 100: // 'd'
            e1.a(ah1, false);
            if(e1.a())
            {
                if(a > 0)
                    aa.h(a);
                d = 101;
                return;
            }
            break;

        case 101: // 'e'
            ah1.c();
            o1.e = false;
            o1.a(b != 0, ((q) (ah1)).o, ((q) (ah1)).p);
            d = 102;
            return;

        case 102: // 'f'
            e1.a(o1.a, true);
            if(((q) (o1)).j != 23)
            {
                ah1.d();
                e();
                super.j = 2;
            }
            break;
        }
    }

    private void j()
    {
        o o1 = aa.a.a;
        e e1 = aa.a.a;
        switch(d)
        {
        default:
            break;

        case 100: // 'd'
            o1.j = 0;
            e1.a(o1, true);
            aa.a.b();
            aa.g();
            d = 101;
            return;

        case 101: // 'e'
            o1.a(false, e1.a - 70, (e1.b + e1.j + 70) - 56);
            d = 102;
            return;

        case 102: // 'f'
            if(((q) (o1)).j == 25)
            {
                aa.h(a);
                d = 103;
                o1.j = 32;
                return;
            }
            break;

        case 103: // 'g'
            if(((q) (o1)).j == 0)
            {
                e();
                super.j = 2;
            }
            break;
        }
    }

    private void k()
    {
        a;
        JVM INSTR tableswitch 0 4: default 60
    //                   0 40
    //                   1 49
    //                   2 55
    //                   3 55
    //                   4 55;
           goto _L1 _L2 _L3 _L4 _L4 _L4
_L4:
        break MISSING_BLOCK_LABEL_55;
_L1:
        break; /* Loop/switch isn't completed */
_L2:
        if(!b())
            break; /* Loop/switch isn't completed */
        break MISSING_BLOCK_LABEL_55;
_L3:
        if(!c())
            break; /* Loop/switch isn't completed */
        super.j = 2;
        if(super.j == 2)
        {
            aa.a.a.e = false;
            e();
        }
        return;
    }

    private void l()
    {
        boolean flag = false;
        ai ai1 = aa.a;
        if(a > 0 && b > 0)
            ai1.a.a((short)a, (short)b, false);
        ai1.a.a_ = 0;
        ai1.a.e();
        switch(d)
        {
        default:
            break;

        case 100: // 'd'
            if(b())
            {
                boolean flag1 = true;
                ai1.a.e = true;
                if(super.d != null)
                {
                    for(int i1 = 0; i1 < super.d.length; i1++)
                    {
                        int i2;
                        int i3 = (i2 = super.d[i1] & 0xffff) & 0xfff;
                        h h1;
                        int i4;
                        if((i4 = i2 >> 12) == 1 && ((z) (h1 = (h)ai1.a[i4][i3])).a.a == aa.a[6] && !a(h1))
                            flag1 = false;
                    }

                }
                if(flag1)
                {
                    d = 101;
                    aa.h(c);
                    return;
                }
            }
            break;

        case 101: // 'e'
            ai1.a.e = true;
            if(!aa.c())
            {
                d = 102;
                return;
            }
            break;

        case 102: // 'f'
            ai1.a.e = true;
            if(!aa.c())
            {
                d = 103;
                return;
            }
            break;

        case 103: // 'g'
            boolean flag2 = true;
            ai1.a.e = true;
            if(super.d != null)
            {
                for(int j1 = 0; j1 < super.d.length; j1++)
                {
                    int j2;
                    int j3 = (j2 = super.d[j1] & 0xffff) & 0xfff;
                    h h2;
                    int j4;
                    if((j4 = j2 >> 12) == 1 && ((z) (h2 = (h)ai1.a[j4][j3])).a.b == 1 && !b(h2))
                        flag2 = false;
                }

            }
            if(flag2)
            {
                d = 104;
                aa.h();
                aa.d(10);
                return;
            }
            break;

        case 104: // 'h'
            if(a > 0 && b > 0)
                ai1.a.a((short)a, (short)b, true);
            d = 106;
            aa.h(113);
            return;

        case 105: // 'i'
            ai1.a.e = true;
            if(a > 0 && b > 0)
                ai1.a.a((short)a, (short)b, true);
            if(!aa.c())
            {
                d = 106;
                return;
            }
            break;

        case 106: // 'j'
            boolean flag3 = true;
            ai1.a.e = true;
            if(super.d != null)
            {
                for(int k1 = 0; k1 < super.d.length; k1++)
                {
                    int k2;
                    int k3 = (k2 = super.d[k1] & 0xffff) & 0xfff;
                    h h3;
                    int k4;
                    if((k4 = k2 >> 12) == 1 && ((z) (h3 = (h)ai1.a[k4][k3])).a.a == aa.a[5] && !a(h3))
                        flag3 = false;
                }

            }
            if(flag3)
            {
                d = 107;
                aa.h(c + 3);
                return;
            }
            break;

        case 107: // 'k'
            ai1.a.e = true;
            if(!aa.c())
            {
                d = 108;
                return;
            }
            break;

        case 108: // 'l'
            boolean flag4 = true;
            ai1.a.e = true;
            if(super.d != null)
            {
                for(int l1 = 0; l1 < super.d.length; l1++)
                {
                    int l2;
                    int l3 = (l2 = super.d[l1] & 0xffff) & 0xfff;
                    h h4;
                    int l4;
                    if((l4 = l2 >> 12) == 1 && (((z) (h4 = (h)ai1.a[l4][l3])).a.a == aa.a[6] || ((z) (h4)).a.a == aa.a[5]) && !b(h4))
                        flag4 = false;
                }

            }
            if(flag4 && c())
            {
                super.j = 2;
                e();
                aa.a.a.e = false;
            }
            break;
        }
    }

    private void c(int i1)
    {
        boolean flag = false;
        ai ai1;
        o o1 = (ai1 = aa.a).a;
        af af1 = (af)ai1.a[7][super.d[0] & 0xfff];
        e e1 = ai1.a;
label0:
        switch(d)
        {
        default:
            break;

        case 100: // 'd'
            if(af1 != null)
                e1.a(aa.a(af1.a[0]), aa.b(af1.a[0]), true);
            if(b())
            {
                e += i1;
                if(e > a)
                {
                    d = 101;
                    return;
                }
            } else
            {
                e = 0;
                return;
            }
            break;

        case 101: // 'e'
            o1.e = true;
            if(af1 != null)
            {
                int i3 = aa.a(af1.a[1]);
                int k4 = aa.b(af1.a[1]);
                e1.a((short)i3, (short)k4, false);
                if(e1.a == i3 && e1.b == k4)
                {
                    e += i1;
                    if(e > b)
                        d = 102;
                } else
                {
                    e = 0;
                    return;
                }
            } else
            {
                d = 102;
                return;
            }