Lines Matching refs:gapLength
683 * @param gapLength gap length
685 public void appendGap(int gapLength) {
688 byte[] newcode = new byte[codeLength + gapLength];
694 for (i = codeLength; i < codeLength + gapLength; ++i)
789 * The inserted gap is filled with NOP. gapLength may be extended to
796 static byte[] insertGapCore0(byte[] code, int where, int gapLength,
800 if (gapLength <= 0)
804 return insertGapCore1(code, where, gapLength, exclusive, etable, ca);
808 return insertGapCore1(code, where, (gapLength + 3) & ~3,
817 private static byte[] insertGapCore1(byte[] code, int where, int gapLength,
823 byte[] newcode = new byte[codeLength + gapLength];
824 insertGap2(code, where, gapLength, codeLength, newcode, exclusive);
825 etable.shiftPc(where, gapLength, exclusive);
829 na.shiftPc(where, gapLength, exclusive);
834 va.shiftPc(where, gapLength, exclusive);
840 vta.shiftPc(where, gapLength, exclusive);
844 smt.shiftPc(where, gapLength, exclusive);
848 sm.shiftPc(where, gapLength, exclusive);
853 private static void insertGap2(byte[] code, int where, int gapLength,
862 int j2 = j + gapLength;
874 offset = newOffset(i, offset, where, gapLength, exclusive);
882 offset = newOffset(i, offset, where, gapLength, exclusive);
888 if (i != j && (gapLength & 3) != 0)
901 where, gapLength, exclusive);
912 where, gapLength, exclusive);
919 if (i != j && (gapLength & 3) != 0)
933 where, gapLength, exclusive);
944 where, gapLength, exclusive);
974 int gapLength, boolean exclusive) {
978 offset += gapLength;
984 offset -= gapLength;
988 offset -= gapLength;
1014 void shiftPc(int where, int gapLength, boolean exclusive) throws BadBytecode {
1016 cursor += gapLength;
1019 mark += gapLength;
1022 mark0 += gapLength;
1024 etable.shiftPc(where, gapLength, exclusive);
1026 line.shiftPc(where, gapLength, exclusive);
1029 vars.shiftPc(where, gapLength, exclusive);
1032 types.shiftPc(where, gapLength, exclusive);
1035 stack.shiftPc(where, gapLength, exclusive);
1038 stack2.shiftPc(where, gapLength, exclusive);
1076 * gapLength. No other NOPs except some NOPs following TABLESWITCH or
1086 private byte[] insertGapCore0w(byte[] code, int where, int gapLength, boolean exclusive,
1090 if (gapLength <= 0)
1095 byte[] r = insertGap2w(code, where, gapLength, exclusive, jumps, pointers);
1100 currentPos += gapLength;
1103 where2 -= gapLength;
1106 newWhere.length = gapLength;
1110 private static byte[] insertGap2w(byte[] code, int where, int gapLength,
1115 if (gapLength > 0) {
1116 ptrs.shiftPc(where, gapLength, exclusive);
1118 ((Branch)jumps.get(i)).shift(where, gapLength, exclusive);
1151 return makeExapndedCode(code, jumps, where, gapLength);
1216 int where, int gapLength)
1220 int size = code.length + gapLength;
1242 int pos2 = dest + gapLength;
1270 void shift(int where, int gapLength, boolean exclusive) {
1272 pos += gapLength;
1276 int gapLength, boolean exclusive) {
1280 offset += gapLength;
1286 offset -= gapLength;
1288 offset += gapLength;
1292 offset -= gapLength;
1347 void shift(int where, int gapLength, boolean exclusive) {
1348 offset = shiftOffset(pos, offset, where, gapLength, exclusive);
1349 super.shift(where, gapLength, exclusive);
1435 void shift(int where, int gapLength, boolean exclusive) {
1436 offset = shiftOffset(pos, offset, where, gapLength, exclusive);
1437 super.shift(where, gapLength, exclusive);
1458 void shift(int where, int gapLength, boolean exclusive) {
1460 defaultByte = shiftOffset(p, defaultByte, where, gapLength, exclusive);
1463 offsets[i] = shiftOffset(p, offsets[i], where, gapLength, exclusive);
1465 super.shift(where, gapLength, exclusive);
