final short[] method1268(int i, short[] is) {
	anInt2171++;
	int i_0_ = 14 % ((i - 48) / 33);
	if (anIntArrayArray2163 != null) {
	    int i_1_ = 14 + (int) ((long) anInt2159 * (long) is.length
				   / (long) anInt2164);
	    int[] is_2_ = new int[i_1_];
	    int i_3_ = 0;
	    int i_4_ = 0;
	    for (int i_5_ = 0; (is.length ^ 0xffffffff) < (i_5_ ^ 0xffffffff);
		 i_5_++) {
		int i_6_ = is[i_5_];
		int[] is_7_ = anIntArrayArray2163[i_4_];
		for (int i_8_ = 0; (i_8_ ^ 0xffffffff) > -15; i_8_++)
		    is_2_[i_3_ + i_8_] += i_6_ * is_7_[i_8_] >> -503982046;
		i_4_ += anInt2159;
		int i_9_ = i_4_ / anInt2164;
		i_4_ -= anInt2164 * i_9_;
		i_3_ += i_9_;
	    }
	    is = new short[i_1_];
	    for (int i_10_ = 0; (i_1_ ^ 0xffffffff) < (i_10_ ^ 0xffffffff);
		 i_10_++) {
		int i_11_ = 8192 + is_2_[i_10_] >> -1603539186;
		if ((i_11_ ^ 0xffffffff) <= 32767) {
		    if (i_11_ > 32767)
			is[i_10_] = (short) 32767;
		    else
			is[i_10_] = (short) i_11_;
		} else
		    is[i_10_] = (short) -32768;
	    }
	}
	return is;
    }