h.java

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

// Decompiled by Jad v1.5.7g. Copyright 2000 Pavel Kouznetsov.
// Jad home page: http://www.geocities.com/SiliconValley/Bridge/8617/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi 

import javax.microedition.lcdui.Graphics;

public final class h extends z
{

    public int a;
    public int b;
    public j a;
    public af a;
    public r a;
    public int c;
    public int d;
    public short a;
    public short b;
    public short c;
    public int e;
    public int f;
    public short d;
    public boolean a;
    public short e;
    public short f;
    public short g;
    public z a;
    public z b;
    public byte a;
    public short h;
    public short i;
    public short j;
    public short k;
    public int g;
    public byte c;
    public short l;
    public boolean b;
    public boolean c;
    public boolean d;
    public byte d;
    public int h;
    public int i;
    public short m;
    public short n;
    public s a;

    public h()
    {
        super((byte)1);
    }

    public final void a(short word0, short word1, byte byte0)
    {
        super.a(word0, word1, byte0);
        a = -1;
        a = -1;
        a = true;
        c = 1;
        f = 1;
        c = 0;
        l = -1;
        a = null;
        super.a = aa.a((byte)1, aa.a());
        super.j = aa.a();
        super.l = super.j;
        a = aa.a();
        d = aa.a();
        f = aa.a();
        l = aa.a();
        c = aa.a();
        switch(super.a.b)
        {
        case 2: // '\002'
        case 3: // '\003'
        case 4: // '\004'
        case 12: // '\f'
        case 19: // '\023'
        case 20: // '\024'
        case 21: // '\025'
            a = ai.b;
            // fall through

        case 5: // '\005'
        case 6: // '\006'
        case 7: // '\007'
        case 8: // '\b'
        case 9: // '\t'
        case 10: // '\n'
        case 11: // '\013'
        case 13: // '\r'
        case 14: // '\016'
        case 15: // '\017'
        case 16: // '\020'
        case 17: // '\021'
        case 18: // '\022'
        default:
            return;
        }
    }

    public final void a(int i1)
    {
        c = a();
        d = false;
        f();
        switch(super.j)
        {
        case 0: // '\0'
            b(i1);
            return;

        case 1: // '\001'
            return;

        case 2: // '\002'
            c(i1);
            return;

        case 7: // '\007'
            e(i1);
            return;

        case 4: // '\004'
            i(i1);
            return;

        case 6: // '\006'
            j(i1);
            return;

        case 8: // '\b'
            k(i1);
            return;

        case 9: // '\t'
            l(i1);
            return;

        case 10: // '\n'
            m(i1);
            return;

        case 11: // '\013'
            f(i1);
            return;

        case 12: // '\f'
            g(i1);
            return;

        case 13: // '\r'
            n(i1);
            return;

        case 14: // '\016'
            o(i1);
            return;

        case 3: // '\003'
            p(i1);
            return;

        case 15: // '\017'
            h(i1);
            return;

        case 16: // '\020'
            q(i1);
            return;

        case 18: // '\022'
            return;

        case 17: // '\021'
            r(i1);
            return;

        case 5: // '\005'
            t(i1);
            return;

        case 19: // '\023'
            s(i1);
            return;

        case 20: // '\024'
            u(i1);
            return;

        case 21: // '\025'
            v(i1);
            return;

        case 22: // '\026'
            w(i1);
            break;
        }
    }

    private void b(int i1)
    {
        a(super.a.a + a(), i1);
    }

    private void c(int i1)
    {
        a += i1;
        b += i1;
        super.a.b;
        JVM INSTR tableswitch 0 24: default 381
    //                   0 140
    //                   1 140
    //                   2 218
    //                   3 218
    //                   4 218
    //                   5 306
    //                   6 306
    //                   7 140
    //                   8 140
    //                   9 306
    //                   10 376
    //                   11 381
    //                   12 218
    //                   13 306
    //                   14 140
    //                   15 306
    //                   16 306
    //                   17 306
    //                   18 306
    //                   19 306
    //                   20 218
    //                   21 262
    //                   22 306
    //                   23 306
    //                   24 306;
           goto _L1 _L2 _L2 _L3 _L3 _L3 _L4 _L4 _L2 _L2 _L4 _L5 _L1 _L3 _L4 _L2 _L4 _L4 _L4 _L4 _L4 _L3 _L6 _L4 _L4 _L4
_L5:
        break MISSING_BLOCK_LABEL_376;
_L1:
        break; /* Loop/switch isn't completed */
_L2:
        if(j())
            return;
        if(k())
        {
            super.j = 13;
            if(((q) (a)).j != 1)
                a.j = 2;
            return;
        }
        if(a(i1))
        {
            a(super.a.b + a(), i1);
            b = 0;
            break; /* Loop/switch isn't completed */
        }
        break MISSING_BLOCK_LABEL_376;
_L3:
        if(!b(true))
        {
            if(a != null)
                break; /* Loop/switch isn't completed */
        } else
        {
            a(super.a.a + a(), i1);
            b = 0;
            break; /* Loop/switch isn't completed */
        }
        break MISSING_BLOCK_LABEL_376;
_L6:
        if(!b(true))
        {
            if(a != null)
                break; /* Loop/switch isn't completed */
        } else
        {
            a(super.a.a + a(), i1);
            b = 0;
            break; /* Loop/switch isn't completed */
        }
        break MISSING_BLOCK_LABEL_376;
_L4:
        if(k())
        {
            super.j = 13;
            if(((q) (a)).j != 1)
                a.j = 2;
            return;
        }
        if(a(i1))
        {
            a(super.a.b + a(), i1);
            b = 0;
            break; /* Loop/switch isn't completed */
        }
        super.j = 4;
        boolean flag = false;
        flag = a(false);
        if(g())
            flag = true;
        if(flag)
            return;
        a = 0;
        if(f())
            return;
        else
            return;
    }

    private void e(int i1)
    {
        o o1 = aa.a.a;
        switch(super.a.b)
        {
        case 2: // '\002'
        case 3: // '\003'
        case 4: // '\004'
        case 10: // '\n'
        case 11: // '\013'
        case 12: // '\f'
        case 20: // '\024'
        case 21: // '\025'
        default:
            break;

        case 0: // '\0'
        case 8: // '\b'
        case 14: // '\016'
            if((c > 0 || l >= 0) && b == o1)
            {
                o1.a_ = o1.a(super.o - ((q) (o1)).o, super.p - ((q) (o1)).p);
                aa.a.a.d = ((q) (o1)).a_;
                if(b)
                {
                    if(l >= 0)
                        aa.h(l);
                    if(c > 1)
                        aa.l = (8 + c) - 1;
                    b = false;
                    return;
                }
                if(!aa.c())
                {
                    i();
                    if(c > 1)
                    {
                        super.j = 1;
                        return;
                    }
                    if(c == 1)
                    {
                        o1.a(super.a.r);
                        return;
                    }
                    if(a != null && a == null)
                    {
                        super.j = 6;
                        return;
                    } else
                    {
                        super.j = 2;
                        return;
                    }
                }
                break;
            }
            if(a != null && a == null)
            {
                super.j = 6;
                return;
            } else
            {
                super.j = 2;
                return;
            }

        case 1: // '\001'
        case 7: // '\007'
            if((c > 0 || l >= 0) && b == o1)
            {
                o1.a_ = o1.a(super.o - ((q) (o1)).o, super.p - ((q) (o1)).p);
                aa.a.a.d = ((q) (o1)).a_;
                if(b)
                {
                    if(l >= 0)
                        aa.h(l);
                    if(c > 1)
                        aa.l = (8 + c) - 1;
                    b = false;
                    return;
                }
                if(aa.c())
                    break;
                i();
                if(c > 1)
                {
                    super.j = 1;
                    return;
                }
                if(c == 1)
                {
                    o1.a(super.a.r);
                    return;
                }
                if(a != null && a == null)
                {
                    super.j = 6;
                    return;
                } else
                {
                    super.j = 2;
                    return;
                }
            }
            if(a <= super.a.o)
            {
                super.a_ = a(((q) (b)).o - super.o, ((q) (b)).p - super.p);
                a(super.a.a + a(), i1);
                a += i1;
                return;
            }
            if(b == o1 && a(true))
            {
                super.j = 11;
                d();
                e();
                return;
            }
            if(b != o1)
            {
                super.j = 11;
                return;
            } else
            {
                super.j = 15;
                return;
            }

        case 5: // '\005'
        case 6: // '\006'
        case 9: // '\t'
        case 13: // '\r'
        case 15: // '\017'
        case 16: // '\020'
        case 17: // '\021'
        case 18: // '\022'
        case 19: // '\023'
        case 22: // '\026'
        case 23: // '\027'
        case 24: // '\030'
            if(c <= 0 && l < 0 || b != o1)
                break;
            if(aa.a == 0 && super.a.b == 6)
            {
                b = false;
                o1.e();
                aa.a.h();
                return;
            }
            if(b)
            {
                o1.a_ = o1.a(super.o - ((q) (o1)).o, super.p - ((q) (o1)).p);
                aa.a.a.d = ((q) (o1)).a_;
                if(l >= 0)
                    aa.h(l);
                if(c > 1)
                    aa.l = (8 + c) - 1;
                b = false;
                return;
            }