public void fg(int j, int k, int l, int i1, int j1) {
		int k1 = 256 - j1;
		int l1 = (i1 >> 16 & 0xff) * j1;
		int i2 = (i1 >> 8 & 0xff) * j1;
		int j2 = (i1 & 0xff) * j1;
		int j3 = k - l;
		if (j3 < 0)
			j3 = 0;
		int k3 = k + l;
		if (k3 >= yj)
			k3 = yj - 1;
		byte byte0 = 1;
		if (wk) {
			byte0 = 2;
			if ((j3 & 1) != 0)
				j3++;
		}
		for (int l3 = j3; l3 <= k3; l3 += byte0) {
			int i4 = l3 - k;
			int j4 = (int) Math.sqrt(l * l - i4 * i4);
			int k4 = j - j4;
			if (k4 < 0)
				k4 = 0;
			int l4 = j + j4;
			if (l4 >= xj)
				l4 = xj - 1;
			int i5 = k4 + l3 * xj;
			for (int j5 = k4; j5 <= l4; j5++) {
				int k2 = (dk[i5] >> 16 & 0xff) * k1;
				int l2 = (dk[i5] >> 8 & 0xff) * k1;
				int i3 = (dk[i5] & 0xff) * k1;
				int k5 = ((l1 + k2 >> 8) << 16) + ((i2 + l2 >> 8) << 8) + (j2 + i3 >> 8);
				dk[i5++] = k5;
			}

		}

	}