k.java

j2me 武林传之刀剑江湖录[前篇]反编译源代码

		G &= ~(i1 != 8 ? 8 : 0x10);
		G |= i1;
	}

	public static final void a(int i1, int j1)
	{
		if (i1 != 0)
			cV = i1;
		if (j1 != 0)
			cW = j1 / 70;
	}

	public static final void a(int ai1[])
	{
		ag = true;
		ah = ai1;
		e(8, 2000);
	}

	public static final void c()
	{
		ag = false;
		ah = null;
		cT = 0;
		G &= -9;
	}

	private static void ao()
	{
		if (y.v > 0)
		{
			au();
			ap();
			at();
			h.a(ao, ap, false);
			ax();
			return;
		}
		if (dp.size() > 0)
		{
			int i1 = dp.size();
			do
			{
				if (--i1 < 0)
					break;
				y y1;
				(y1 = (y)dp.elementAt(i1)).t();
				if (y1.s())
				{
					short word0 = Short.parseShort((String)dq.elementAt(i1));
					y1.d(word0);
					dp.removeElementAt(i1);
					dq.removeElementAt(i1);
				}
			} while (true);
			return;
		}
		if (cY <= 0)
		{
			if (aq())
			{
				dn.K = false;
				dn = null;
				do = null;
				a(dm);
				return;
			}
		} else
		if (cY > 0)
			cY--;
	}

	private static void ap()
	{
		Object obj = null;
		for (byte byte0 = 0; byte0 < v; byte0++)
		{
			y y1;
			if ((y1 = u[w[byte0]]) != null && y1.c(8) && y1.c(512))
			{
				y1.t();
				y1.b();
			}
		}

		for (int i1 = 0; i1 < 1; i1++)
			if (q[i1] != null && q[i1].c(8) && q[i1].c(512))
			{
				q[i1].t();
				q[i1].b();
			}

	}

	private static void y(Graphics g1)
	{
		a(g1);
	}

	public static final void a(y y1)
	{
		short word0;
		if ((word0 = y1.f[5]) > -1)
		{
			if (word0 < db)
			{
				y1.F = dc[word0];
				y1.G = dd[word0];
			} else
			{
				y1.F = dg[word0 - db];
				y1.G = dh[word0 - db];
			}
			y1.h();
			b(y1);
		}
	}

	public static final boolean a(int i1, byte byte0)
	{
		return aj[i1] == byte0;
	}

	public static final void a(int i1, byte byte0, int j1)
	{
		if (1 == byte0)
			ak[i1] = (short)(F << 10 | dn.f[1]);
		if (j1 == 0)
		{
			aj[i1] += byte0;
			return;
		}
		if (j1 == 1)
			aj[i1] = byte0;
	}

	public static final void b(y y1)
	{
		int j1;
		boolean flag = false;
		boolean flag1 = false;
		j1 = 0;
_L29:
		if (j1 >= y1.F.length) goto _L2; else goto _L1
_L1:
		int i1;
		byte byte0;
		dk = y1.G[j1];
		i1 = 0;
		dl = 0;
		byte0 = dk[dl++];
		boolean flag2 = false;
_L28:
		if (i1 >= byte0)
			continue; /* Loop/switch isn't completed */
		i1++;
		byte byte1 = dk[dl++];
		JVM INSTR tableswitch 0 26: default 709
	//	               0 192
	//	               1 216
	//	               2 247
	//	               3 278
	//	               4 309
	//	               5 319
	//	               6 336
	//	               7 360
	//	               8 363
	//	               9 366
	//	               10 369
	//	               11 410
	//	               12 441
	//	               13 465
	//	               14 468
	//	               15 478
	//	               16 536
	//	               17 560
	//	               18 570
	//	               19 580
	//	               20 590
	//	               21 607
	//	               22 631
	//	               23 648
	//	               24 672
	//	               25 682
	//	               26 699;
		   goto _L3 _L4 _L5 _L6 _L7 _L8 _L9 _L10 _L3 _L3 _L3 _L11 _L12 _L13 _L3 _L14 _L15 _L16 _L17 _L18 _L19 _L20 _L21 _L22 _L23 _L24 _L25 _L26
_L3:
		continue; /* Loop/switch isn't completed */
_L4:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		continue; /* Loop/switch isn't completed */
_L5:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		f(byte1, 3);
		continue; /* Loop/switch isn't completed */
_L6:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		f(byte1, 3);
		continue; /* Loop/switch isn't completed */
_L7:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		f(byte1, 3);
		continue; /* Loop/switch isn't completed */
_L8:
		f(byte1, 0);
		continue; /* Loop/switch isn't completed */
_L9:
		f(byte1, 0);
		f(byte1, 1);
		continue; /* Loop/switch isn't completed */
_L10:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		continue; /* Loop/switch isn't completed */
_L11:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		f(byte1, 3);
		f(byte1, 4);
		boolean flag3 = false;
		continue; /* Loop/switch isn't completed */
_L12:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		f(byte1, 3);
		continue; /* Loop/switch isn't completed */
_L13:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		continue; /* Loop/switch isn't completed */
_L14:
		f(byte1, 0);
		continue; /* Loop/switch isn't completed */
_L15:
		int k1 = f(byte1, 0);
		f(byte1, 1);
		int l1;
		if ((l1 = f(byte1, 2)) == 1 && !y1.L.contains(String.valueOf(k1)))
			y1.L.addElement(String.valueOf(k1));
		continue; /* Loop/switch isn't completed */
_L16:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		continue; /* Loop/switch isn't completed */
_L17:
		f(byte1, 0);
		continue; /* Loop/switch isn't completed */
_L18:
		f(byte1, 0);
		continue; /* Loop/switch isn't completed */
_L19:
		f(byte1, 0);
		continue; /* Loop/switch isn't completed */
_L20:
		f(byte1, 0);
		f(byte1, 1);
		continue; /* Loop/switch isn't completed */
_L21:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		continue; /* Loop/switch isn't completed */
_L22:
		f(byte1, 0);
		f(byte1, 1);
		continue; /* Loop/switch isn't completed */
_L23:
		f(byte1, 0);
		f(byte1, 1);
		f(byte1, 2);
		continue; /* Loop/switch isn't completed */
_L24:
		f(byte1, 0);
		continue; /* Loop/switch isn't completed */
_L25:
		f(byte1, 0);
		f(byte1, 1);
		continue; /* Loop/switch isn't completed */
_L26:
		f(byte1, 0);
		if (true) goto _L28; else goto _L27
_L27:
		j1++;
		  goto _L29
_L2:
		dk = null;
		dl = 0;
		return;
	}

	private static int f(int i1, int j1)
	{
		byte byte0 = da[i1][j1];
		int k1 = u.a(dk, dl, byte0);
		dl += byte0;
		return k1;
	}

	public static final void c(y y1)
	{
		for (int i1 = y1.H; i1 < y1.F.length; i1++)
		{
			y1.J = y1.F[i1];
			switch (y1.J[0])
			{
			case 4: // '\004'
			default:
				break;

			case 0: // '\0'
				if (!e(y1) || !s.aa())
					continue;
				break;

			case 1: // '\001'
				if (a.c(16384) && e(y1) && s.aa())
					break;
				continue;

			case 2: // '\002'
				if (!y1.c(128))
					continue;
				z z1 = y.e[y1.f[6]];
				short word0 = y1.f[7];
				byte byte0 = z1.c[word0];
				int j1 = z1.e[z1.d[word0] + (y1.q[0] << 1)] >> 10 & 0x1f;
				if (y1.q[0] + 1 >= byte0 && y1.q[1] + 1 >= j1)
					break;
				continue;

			case 3: // '\003'
				if (!s.c(128))
					continue;
				break;
			}
			y1.I = 1;
			if (d(y1))
			{
				y1.H = (short)((i1 + 1) % y1.F.length);
				y1.K = true;
				a(y1, y1.G[i1]);
				return;
			}
		}

		y1.H = 0;
	}

	private static boolean d(y y1)
	{
		boolean flag;
		int i1;
		byte byte1;
		flag = true;
		i1 = 0;
		boolean flag1 = false;
		byte1 = y1.J[y1.I++];
_L9:
		if (!flag || i1 >= byte1)
			break; /* Loop/switch isn't completed */
		i1++;
		byte byte0 = y1.J[y1.I++];
		JVM INSTR tableswitch 5 10: default 475
	//	               5 96
	//	               6 137
	//	               7 244
	//	               8 337
	//	               9 412
	//	               10 459;
		   goto _L1 _L2 _L3 _L4 _L5 _L6 _L7
_L1:
		continue; /* Loop/switch isn't completed */
_L2:
		int j1 = a(y1, byte0, 0);
		int l2 = a(y1, byte0, 1);
		int l3 = a(y1, byte0, 2);
		flag = a(aj[j1], l2, l3);
		continue; /* Loop/switch isn't completed */
_L3:
		if (y1.g == null)
		{
			flag = false;
		} else
		{
			int k1 = a(y1, byte0, 0);
			int i3 = a(y1, byte0, 1);
			int i4 = a(y1, byte0, 2);
			if (k1 < 0)
				flag = a(y1.f[-k1], i3, i4);
			else
			if (k1 == 11)
				flag = a(y1.g[k1] & 0xffff, i3, i4);
			else
				flag = a(y1.g[k1], i3, i4);
		}
		continue; /* Loop/switch isn't completed */
_L4:
		int l1 = a(y1, byte0, 0);
		int j3 = a(y1, byte0, 1);
		int j4 = a(y1, byte0, 2);
		int l4 = 0;
		if (l1 < n.k.length)
			l4 = s.aa[l1];
		else
		if (l1 < n.k.length + n.s.length)
			l4 = s.ab[l1 - n.k.length];
		flag = a(l4, j3, j4);
		continue; /* Loop/switch isn't completed */
_L5:
		int i2 = a(y1, byte0, 0);
		int k3 = a(y1, byte0, 1);
		int k4 = a(y1, byte0, 2);
		if (i2 >= 30 && i2 < 40)
			flag = a(al[i2 - 30], k3, k4);
		else
			flag = a(ai[i2], k3, k4);
		continue; /* Loop/switch isn't completed */
_L6:
		int j2 = a(y1, byte0, 0);
		j2 = Integer.parseInt(di[j2].trim());
		if (flag = cJ == j2)
			cJ = -1;
		continue; /* Loop/switch isn't completed */
_L7:
		int k2;
		flag = o(k2 = a(y1, byte0, 0));
		if (true) goto _L9; else goto _L8
_L8:
		return flag;
	}

	private static int a(y y1, int i1, int j1)
	{
		byte byte0 = cZ[i1][j1];
		int k1 = u.a(y1.J, y1.I, byte0);
		y1.I += byte0;
		return k1;
	}

	private static boolean e(y y1)
	{
		f f1 = s;
		if ((l[y1.f[0]] & 0x10) == 16)
		{
			short aword0[] = y1.i();
			return u.a(((y) (f1)).f[8], ((y) (f1)).f[9], aword0[0], aword0[1], aword0[2], aword0[3]);
		}
		return Math.abs(y1.f[8] - ((y) (f1)).f[8]) + Math.abs(y1.f[9] - ((y) (f1)).f[9]) < h.d() * 3;
	}

	private static boolean o(int i1)
	{
		switch (i1)
		{
		case 0: // '\0'
			i1 = 16;
			break;

		case 1: // '\001'
			i1 = 32;
			break;

		case 2: // '\002'
			i1 = 1;
			break;

		case 3: // '\003'
			i1 = 64;
			break;

		case 4: // '\004'
			i1 = 4;
			break;

		case 5: // '\005'
			i1 = 128;
			break;

		case 6: // '\006'
			i1 = 8;
			break;

		case 7: // '\007'
			i1 = 256;
			break;

		case 8: // '\b'
			i1 = 2;
			break;

		case 9: // '\t'
			i1 = 512;
			break;

		case 10: // '\n'
			i1 = 1024;
			break;

		case 11: // '\013'
			i1 = 4096;
			break;

		case 12: // '\f'
			i1 = 8192;
			break;
		}
		return a.c(i1);
	}

	private static boolean a(int i1, int j1, int k1)
	{
		switch (j1)
		{
		case 0: // '\0'
			return i1 > k1;

		case 1: // '\001'
			return i1 >= k1;

		case 2: // '\002'
			return i1 == k1;

		case 3: // '\003'
			return i1 <= k1;

		case 4: // '\004'
			return i1 < k1;

		case 5: // '\005'
			return i1 != k1;
		}
		return false;
	}

	public static final void a(y y1, byte abyte0[])
	{
		dm = B;
		dn = y1;
		do = abyte0;
		dr = 0;
		ds = 0;
		dt = do[ds++];
		a((byte)8);
	}

	private static boolean aq()
	{
		boolean flag = false;
		do
			if (dr < dt)
			{
				dr++;
				byte byte0;
				int i2;
				y y1;
				switch (byte0 = do[ds++])
				{
				case 0: // '\0'
					int i1 = g(byte0, 0);
					int k5 = g(byte0, 1);
					int i10 = g(byte0, 2);
					y y6;
					if ((y6 = c(i1)) != null)
					{
						y6.b((short)k5);
						if (k5 == 2)
							y6.d((short)i10);
					}
					break;

				case 1: // '\001'
					int j1 = g(byte0, 0);
					int l5 = g(byte0, 1);
					int j10 = g(byte0, 2);
					int i13 = g(byte0, 3);
					l5 = l5 * h.d() + (h.d() >> 1);
					j10 = j10 * h.e() + (h.e() >> 1);
					y y8;
					if ((y8 = c(j1)) != null)
						y8.a((short)l5, (short)j10, (short)i13, true);
					if (dr >= dt || do[ds] != 1)
						return false;
					break;

				case 2: // '\002'
					int k1 = g(byte0, 0);
					int i6 = g(byte0, 1);
					int k10 = g(byte0, 2);
					int j13 = (short)g(byte0, 3);
					i6 = (short)(i6 * h.d() + (h.d() >> 1));
					k10 = (short)(k10 * h.e() + (h.e() >> 1));
					if (k1 == F)
					{
						c(1).a((short)i6, (short)k10);
						c(1).c((short)j13);
						at();
						h.a(ao, ap, true);
					} else
					{
						a(k1, i6, k10, j13, true);
						return false;
					}
					break;

				case 3: // '\003'
					int l1 = g(byte0, 0);
					int j6 = g(byte0, 1);
					int l10 = g(byte0, 2);
					int k13 = g(byte0, 3);
					y y9;
					d d1;
					if (((y9 = c(l1)) instanceof d) && ((d)y9).a == 1)
					{
						if (!(d1 = (d)y9).c(256))
						{
							d1.b = true;
							d1.b();
							a((byte)41);
							return false;
						}
					} else
					{
						j6 = j6 * h.d() + (h.d() >> 1);
						l10 = l10 * h.e() + (h.e() >> 1);
						if (y9 != null)
						{
							if (!(y9 instanceof f))
								y9.a();
							y9.a(16);
							y9.a(8);
							y9.a((short)j6, (short)l10);
							y9.c((short)k13);
							y9.i = (short)j6;
							y9.j = (short)l10;
							au();
							ax();
						}
					}
					break;

				case 4: // '\004'
					if ((y1 = c(i2 = g(byte0, 0))) != null)
					{
						y1.b(16);
						y1.b(8);
						au();
						ax();
					}
					break;

				case 5: // '\005'
					int j2 = g(byte0, 0);
					int k6 = g(byte0, 1);
					y y3;
					if ((y3 = c(j2)) != null)
					{
						dq.addElement(String.valueOf(y3.f[7]));
						y3.d((short)k6);
						dp.addElement(y3);
						if (dr >= dt || do[ds] != 5)
							return false;
					}
					break;

				case 6: // '\006'
					int k2 = g(byte0, 0);
					int l6 = g(byte0, 1);
					int i11;
					y y7;
					if ((y7 = c(i11 = g(byte0, 2))) != null)
						if (k2 < 0)
						{
							if (Math.abs(k2) == 14)
								y7.c((short)l6);
							else
								y7.f[Math.abs(k2)] = (short)l6;
						} else
						if (k2 == 19)
						{
							y7.g[k2] = (short)l6;
						} else
						{
							y7.g[k2] += (short)l6;
							if (k2 == 10)
								s.X();
						}
					break;

				case 7: // '\007'
					g(byte0, 0);