Thu, 10 May 2012 15:44:19 +0200
7165755: OS Information much longer on linux than other platforms
Reviewed-by: sla, dholmes
duke@435 | 1 | /* |
stefank@2314 | 2 | * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "classfile/stackMapTableFormat.hpp" |
stefank@2314 | 27 | #include "interpreter/bytecodes.hpp" |
stefank@2314 | 28 | #include "memory/oopFactory.hpp" |
stefank@2314 | 29 | #include "memory/universe.inline.hpp" |
stefank@2314 | 30 | #include "oops/oop.inline.hpp" |
stefank@2314 | 31 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 32 | #include "runtime/relocator.hpp" |
duke@435 | 33 | |
duke@435 | 34 | #define MAX_METHOD_LENGTH 65535 |
duke@435 | 35 | |
duke@435 | 36 | #define MAX_SHORT ((1 << 15) - 1) |
duke@435 | 37 | #define MIN_SHORT (- (1 << 15)) |
duke@435 | 38 | |
duke@435 | 39 | // Encapsulates a code change request. There are 3 types. |
duke@435 | 40 | // General instruction, jump instruction, and table/lookup switches |
duke@435 | 41 | // |
duke@435 | 42 | class ChangeItem : public ResourceObj { |
duke@435 | 43 | int _bci; |
duke@435 | 44 | public: |
duke@435 | 45 | ChangeItem(int bci) { _bci = bci; } |
duke@435 | 46 | virtual bool handle_code_change(Relocator *r) = 0; |
duke@435 | 47 | |
duke@435 | 48 | // type info |
duke@435 | 49 | virtual bool is_widen() { return false; } |
duke@435 | 50 | virtual bool is_jump_widen() { return false; } |
duke@435 | 51 | virtual bool is_switch_pad() { return false; } |
duke@435 | 52 | |
duke@435 | 53 | // accessors |
duke@435 | 54 | int bci() { return _bci; } |
duke@435 | 55 | void relocate(int break_bci, int delta) { if (_bci > break_bci) { _bci += delta; } } |
duke@435 | 56 | |
duke@435 | 57 | virtual bool adjust(int bci, int delta) { return false; } |
duke@435 | 58 | |
duke@435 | 59 | // debug |
duke@435 | 60 | virtual void print() = 0; |
duke@435 | 61 | }; |
duke@435 | 62 | |
duke@435 | 63 | class ChangeWiden : public ChangeItem { |
duke@435 | 64 | int _new_ilen; // New length of instruction at bci |
duke@435 | 65 | u_char* _inst_buffer; // New bytecodes |
duke@435 | 66 | public: |
duke@435 | 67 | ChangeWiden(int bci, int new_ilen, u_char* inst_buffer) : ChangeItem(bci) { |
duke@435 | 68 | _new_ilen = new_ilen; |
duke@435 | 69 | _inst_buffer = inst_buffer; |
duke@435 | 70 | } |
duke@435 | 71 | |
duke@435 | 72 | // Callback to do instruction |
duke@435 | 73 | bool handle_code_change(Relocator *r) { return r->handle_widen(bci(), _new_ilen, _inst_buffer); }; |
duke@435 | 74 | |
duke@435 | 75 | bool is_widen() { return true; } |
duke@435 | 76 | |
duke@435 | 77 | void print() { tty->print_cr("ChangeWiden. bci: %d New_ilen: %d", bci(), _new_ilen); } |
duke@435 | 78 | }; |
duke@435 | 79 | |
duke@435 | 80 | class ChangeJumpWiden : public ChangeItem { |
duke@435 | 81 | int _delta; // New length of instruction at bci |
duke@435 | 82 | public: |
duke@435 | 83 | ChangeJumpWiden(int bci, int delta) : ChangeItem(bci) { _delta = delta; } |
duke@435 | 84 | |
duke@435 | 85 | // Callback to do instruction |
duke@435 | 86 | bool handle_code_change(Relocator *r) { return r->handle_jump_widen(bci(), _delta); }; |
duke@435 | 87 | |
duke@435 | 88 | bool is_jump_widen() { return true; } |
duke@435 | 89 | |
duke@435 | 90 | // If the bci matches, adjust the delta in the change jump request. |
duke@435 | 91 | bool adjust(int jump_bci, int delta) { |
duke@435 | 92 | if (bci() == jump_bci) { |
duke@435 | 93 | if (_delta > 0) |
duke@435 | 94 | _delta += delta; |
duke@435 | 95 | else |
duke@435 | 96 | _delta -= delta; |
duke@435 | 97 | return true; |
duke@435 | 98 | } |
duke@435 | 99 | return false; |
duke@435 | 100 | } |
duke@435 | 101 | |
duke@435 | 102 | void print() { tty->print_cr("ChangeJumpWiden. bci: %d Delta: %d", bci(), _delta); } |
duke@435 | 103 | }; |
duke@435 | 104 | |
duke@435 | 105 | class ChangeSwitchPad : public ChangeItem { |
duke@435 | 106 | int _padding; |
duke@435 | 107 | bool _is_lookup_switch; |
duke@435 | 108 | public: |
duke@435 | 109 | ChangeSwitchPad(int bci, int padding, bool is_lookup_switch) : ChangeItem(bci) { |
duke@435 | 110 | _padding = padding; |
duke@435 | 111 | _is_lookup_switch = is_lookup_switch; |
duke@435 | 112 | } |
duke@435 | 113 | |
duke@435 | 114 | // Callback to do instruction |
duke@435 | 115 | bool handle_code_change(Relocator *r) { return r->handle_switch_pad(bci(), _padding, _is_lookup_switch); }; |
duke@435 | 116 | |
duke@435 | 117 | bool is_switch_pad() { return true; } |
duke@435 | 118 | int padding() { return _padding; } |
duke@435 | 119 | bool is_lookup_switch() { return _is_lookup_switch; } |
duke@435 | 120 | |
duke@435 | 121 | void print() { tty->print_cr("ChangeSwitchPad. bci: %d Padding: %d IsLookupSwitch: %d", bci(), _padding, _is_lookup_switch); } |
duke@435 | 122 | }; |
duke@435 | 123 | |
duke@435 | 124 | //----------------------------------------------------------------------------------------------------------- |
duke@435 | 125 | // Relocator code |
duke@435 | 126 | |
duke@435 | 127 | Relocator::Relocator(methodHandle m, RelocatorListener* listener) { |
duke@435 | 128 | set_method(m); |
duke@435 | 129 | set_code_length(method()->code_size()); |
duke@435 | 130 | set_code_array(NULL); |
duke@435 | 131 | // Allocate code array and copy bytecodes |
duke@435 | 132 | if (!expand_code_array(0)) { |
duke@435 | 133 | // Should have at least MAX_METHOD_LENGTH available or the verifier |
duke@435 | 134 | // would have failed. |
duke@435 | 135 | ShouldNotReachHere(); |
duke@435 | 136 | } |
duke@435 | 137 | set_compressed_line_number_table(NULL); |
duke@435 | 138 | set_compressed_line_number_table_size(0); |
duke@435 | 139 | _listener = listener; |
duke@435 | 140 | } |
duke@435 | 141 | |
duke@435 | 142 | // size is the new size of the instruction at bci. Hence, if size is less than the current |
duke@435 | 143 | // instruction sice, we will shrink the code. |
duke@435 | 144 | methodHandle Relocator::insert_space_at(int bci, int size, u_char inst_buffer[], TRAPS) { |
duke@435 | 145 | _changes = new GrowableArray<ChangeItem*> (10); |
duke@435 | 146 | _changes->push(new ChangeWiden(bci, size, inst_buffer)); |
duke@435 | 147 | |
duke@435 | 148 | if (TraceRelocator) { |
duke@435 | 149 | tty->print_cr("Space at: %d Size: %d", bci, size); |
duke@435 | 150 | _method->print(); |
duke@435 | 151 | _method->print_codes(); |
duke@435 | 152 | tty->print_cr("-------------------------------------------------"); |
duke@435 | 153 | } |
duke@435 | 154 | |
duke@435 | 155 | if (!handle_code_changes()) return methodHandle(); |
duke@435 | 156 | |
duke@435 | 157 | // Construct the new method |
duke@435 | 158 | methodHandle new_method = methodOopDesc::clone_with_new_data(method(), |
duke@435 | 159 | code_array(), code_length(), |
duke@435 | 160 | compressed_line_number_table(), |
duke@435 | 161 | compressed_line_number_table_size(), |
duke@435 | 162 | CHECK_(methodHandle())); |
duke@435 | 163 | set_method(new_method); |
duke@435 | 164 | |
duke@435 | 165 | if (TraceRelocator) { |
duke@435 | 166 | tty->print_cr("-------------------------------------------------"); |
duke@435 | 167 | tty->print_cr("new method"); |
duke@435 | 168 | _method->print_codes(); |
duke@435 | 169 | } |
duke@435 | 170 | |
duke@435 | 171 | return new_method; |
duke@435 | 172 | } |
duke@435 | 173 | |
duke@435 | 174 | |
duke@435 | 175 | bool Relocator::handle_code_changes() { |
duke@435 | 176 | assert(_changes != NULL, "changes vector must be initialized"); |
duke@435 | 177 | |
duke@435 | 178 | while (!_changes->is_empty()) { |
duke@435 | 179 | // Inv: everything is aligned. |
duke@435 | 180 | ChangeItem* ci = _changes->first(); |
duke@435 | 181 | |
duke@435 | 182 | if (TraceRelocator) { |
duke@435 | 183 | ci->print(); |
duke@435 | 184 | } |
duke@435 | 185 | |
duke@435 | 186 | // Execute operation |
duke@435 | 187 | if (!ci->handle_code_change(this)) return false; |
duke@435 | 188 | |
duke@435 | 189 | // Shuffel items up |
duke@435 | 190 | for (int index = 1; index < _changes->length(); index++) { |
duke@435 | 191 | _changes->at_put(index-1, _changes->at(index)); |
duke@435 | 192 | } |
duke@435 | 193 | _changes->pop(); |
duke@435 | 194 | } |
duke@435 | 195 | return true; |
duke@435 | 196 | } |
duke@435 | 197 | |
duke@435 | 198 | |
duke@435 | 199 | bool Relocator::is_opcode_lookupswitch(Bytecodes::Code bc) { |
duke@435 | 200 | switch (bc) { |
duke@435 | 201 | case Bytecodes::_tableswitch: return false; |
duke@435 | 202 | case Bytecodes::_lookupswitch: // not rewritten on ia64 |
duke@435 | 203 | case Bytecodes::_fast_linearswitch: // rewritten _lookupswitch |
duke@435 | 204 | case Bytecodes::_fast_binaryswitch: return true; // rewritten _lookupswitch |
duke@435 | 205 | default: ShouldNotReachHere(); |
duke@435 | 206 | } |
duke@435 | 207 | return true; // dummy |
duke@435 | 208 | } |
duke@435 | 209 | |
duke@435 | 210 | // We need a special instruction size method, since lookupswitches and tableswitches might not be |
duke@435 | 211 | // properly alligned during relocation |
duke@435 | 212 | int Relocator::rc_instr_len(int bci) { |
duke@435 | 213 | Bytecodes::Code bc= code_at(bci); |
duke@435 | 214 | switch (bc) { |
duke@435 | 215 | // In the case of switch instructions, see if we have the original |
duke@435 | 216 | // padding recorded. |
duke@435 | 217 | case Bytecodes::_tableswitch: |
duke@435 | 218 | case Bytecodes::_lookupswitch: |
duke@435 | 219 | case Bytecodes::_fast_linearswitch: |
duke@435 | 220 | case Bytecodes::_fast_binaryswitch: |
duke@435 | 221 | { |
duke@435 | 222 | int pad = get_orig_switch_pad(bci, is_opcode_lookupswitch(bc)); |
duke@435 | 223 | if (pad == -1) { |
duke@435 | 224 | return instruction_length_at(bci); |
duke@435 | 225 | } |
duke@435 | 226 | // Otherwise, depends on the switch type. |
duke@435 | 227 | switch (bc) { |
duke@435 | 228 | case Bytecodes::_tableswitch: { |
duke@435 | 229 | int lo = int_at(bci + 1 + pad + 4 * 1); |
duke@435 | 230 | int hi = int_at(bci + 1 + pad + 4 * 2); |
duke@435 | 231 | int n = hi - lo + 1; |
duke@435 | 232 | return 1 + pad + 4*(3 + n); |
duke@435 | 233 | } |
duke@435 | 234 | case Bytecodes::_lookupswitch: |
duke@435 | 235 | case Bytecodes::_fast_linearswitch: |
duke@435 | 236 | case Bytecodes::_fast_binaryswitch: { |
duke@435 | 237 | int npairs = int_at(bci + 1 + pad + 4 * 1); |
duke@435 | 238 | return 1 + pad + 4*(2 + 2*npairs); |
duke@435 | 239 | } |
duke@435 | 240 | default: |
duke@435 | 241 | ShouldNotReachHere(); |
duke@435 | 242 | } |
duke@435 | 243 | } |
duke@435 | 244 | } |
duke@435 | 245 | return instruction_length_at(bci); |
duke@435 | 246 | } |
duke@435 | 247 | |
duke@435 | 248 | // If a change item is recorded for "pc", with type "ct", returns the |
duke@435 | 249 | // associated padding, else -1. |
duke@435 | 250 | int Relocator::get_orig_switch_pad(int bci, bool is_lookup_switch) { |
duke@435 | 251 | for (int k = 0; k < _changes->length(); k++) { |
duke@435 | 252 | ChangeItem* ci = _changes->at(k); |
duke@435 | 253 | if (ci->is_switch_pad()) { |
duke@435 | 254 | ChangeSwitchPad* csp = (ChangeSwitchPad*)ci; |
duke@435 | 255 | if (csp->is_lookup_switch() == is_lookup_switch && csp->bci() == bci) { |
duke@435 | 256 | return csp->padding(); |
duke@435 | 257 | } |
duke@435 | 258 | } |
duke@435 | 259 | } |
duke@435 | 260 | return -1; |
duke@435 | 261 | } |
duke@435 | 262 | |
duke@435 | 263 | |
duke@435 | 264 | // Push a ChangeJumpWiden if it doesn't already exist on the work queue, |
duke@435 | 265 | // otherwise adjust the item already there by delta. The calculation for |
duke@435 | 266 | // new_delta is wrong for this because it uses the offset stored in the |
duke@435 | 267 | // code stream itself which wasn't fixed when item was pushed on the work queue. |
duke@435 | 268 | void Relocator::push_jump_widen(int bci, int delta, int new_delta) { |
duke@435 | 269 | for (int j = 0; j < _changes->length(); j++) { |
duke@435 | 270 | ChangeItem* ci = _changes->at(j); |
duke@435 | 271 | if (ci->adjust(bci, delta)) return; |
duke@435 | 272 | } |
duke@435 | 273 | _changes->push(new ChangeJumpWiden(bci, new_delta)); |
duke@435 | 274 | } |
duke@435 | 275 | |
duke@435 | 276 | |
duke@435 | 277 | // The current instruction of "c" is a jump; one of its offset starts |
duke@435 | 278 | // at "offset" and is a short if "isShort" is "TRUE", |
duke@435 | 279 | // and an integer otherwise. If the jump crosses "breakPC", change |
duke@435 | 280 | // the span of the jump by "delta". |
duke@435 | 281 | void Relocator::change_jump(int bci, int offset, bool is_short, int break_bci, int delta) { |
duke@435 | 282 | int bci_delta = (is_short) ? short_at(offset) : int_at(offset); |
duke@435 | 283 | int targ = bci + bci_delta; |
duke@435 | 284 | |
duke@435 | 285 | if ((bci <= break_bci && targ > break_bci) || |
duke@435 | 286 | (bci > break_bci && targ <= break_bci)) { |
duke@435 | 287 | int new_delta; |
duke@435 | 288 | if (bci_delta > 0) |
duke@435 | 289 | new_delta = bci_delta + delta; |
duke@435 | 290 | else |
duke@435 | 291 | new_delta = bci_delta - delta; |
duke@435 | 292 | |
duke@435 | 293 | if (is_short && ((new_delta > MAX_SHORT) || new_delta < MIN_SHORT)) { |
duke@435 | 294 | push_jump_widen(bci, delta, new_delta); |
duke@435 | 295 | } else if (is_short) { |
duke@435 | 296 | short_at_put(offset, new_delta); |
duke@435 | 297 | } else { |
duke@435 | 298 | int_at_put(offset, new_delta); |
duke@435 | 299 | } |
duke@435 | 300 | } |
duke@435 | 301 | } |
duke@435 | 302 | |
duke@435 | 303 | |
duke@435 | 304 | // Changes all jumps crossing "break_bci" by "delta". May enqueue things |
duke@435 | 305 | // on "rc->changes" |
duke@435 | 306 | void Relocator::change_jumps(int break_bci, int delta) { |
duke@435 | 307 | int bci = 0; |
duke@435 | 308 | Bytecodes::Code bc; |
duke@435 | 309 | // Now, adjust any affected instructions. |
duke@435 | 310 | while (bci < code_length()) { |
duke@435 | 311 | switch (bc= code_at(bci)) { |
duke@435 | 312 | case Bytecodes::_ifeq: |
duke@435 | 313 | case Bytecodes::_ifne: |
duke@435 | 314 | case Bytecodes::_iflt: |
duke@435 | 315 | case Bytecodes::_ifge: |
duke@435 | 316 | case Bytecodes::_ifgt: |
duke@435 | 317 | case Bytecodes::_ifle: |
duke@435 | 318 | case Bytecodes::_if_icmpeq: |
duke@435 | 319 | case Bytecodes::_if_icmpne: |
duke@435 | 320 | case Bytecodes::_if_icmplt: |
duke@435 | 321 | case Bytecodes::_if_icmpge: |
duke@435 | 322 | case Bytecodes::_if_icmpgt: |
duke@435 | 323 | case Bytecodes::_if_icmple: |
duke@435 | 324 | case Bytecodes::_if_acmpeq: |
duke@435 | 325 | case Bytecodes::_if_acmpne: |
duke@435 | 326 | case Bytecodes::_ifnull: |
duke@435 | 327 | case Bytecodes::_ifnonnull: |
duke@435 | 328 | case Bytecodes::_goto: |
duke@435 | 329 | case Bytecodes::_jsr: |
duke@435 | 330 | change_jump(bci, bci+1, true, break_bci, delta); |
duke@435 | 331 | break; |
duke@435 | 332 | case Bytecodes::_goto_w: |
duke@435 | 333 | case Bytecodes::_jsr_w: |
duke@435 | 334 | change_jump(bci, bci+1, false, break_bci, delta); |
duke@435 | 335 | break; |
duke@435 | 336 | case Bytecodes::_tableswitch: |
duke@435 | 337 | case Bytecodes::_lookupswitch: |
duke@435 | 338 | case Bytecodes::_fast_linearswitch: |
duke@435 | 339 | case Bytecodes::_fast_binaryswitch: { |
duke@435 | 340 | int recPad = get_orig_switch_pad(bci, (bc != Bytecodes::_tableswitch)); |
duke@435 | 341 | int oldPad = (recPad != -1) ? recPad : align(bci+1) - (bci+1); |
duke@435 | 342 | if (bci > break_bci) { |
duke@435 | 343 | int new_bci = bci + delta; |
duke@435 | 344 | int newPad = align(new_bci+1) - (new_bci+1); |
duke@435 | 345 | // Do we need to check the padding? |
duke@435 | 346 | if (newPad != oldPad) { |
duke@435 | 347 | if (recPad == -1) { |
duke@435 | 348 | _changes->push(new ChangeSwitchPad(bci, oldPad, (bc != Bytecodes::_tableswitch))); |
duke@435 | 349 | } |
duke@435 | 350 | } |
duke@435 | 351 | } |
duke@435 | 352 | |
duke@435 | 353 | // Then the rest, which depend on the kind of switch. |
duke@435 | 354 | switch (bc) { |
duke@435 | 355 | case Bytecodes::_tableswitch: { |
duke@435 | 356 | change_jump(bci, bci +1 + oldPad, false, break_bci, delta); |
duke@435 | 357 | // We cannot use the Bytecode_tableswitch abstraction, since the padding might not be correct. |
duke@435 | 358 | int lo = int_at(bci + 1 + oldPad + 4 * 1); |
duke@435 | 359 | int hi = int_at(bci + 1 + oldPad + 4 * 2); |
duke@435 | 360 | int n = hi - lo + 1; |
duke@435 | 361 | for (int k = 0; k < n; k++) { |
duke@435 | 362 | change_jump(bci, bci +1 + oldPad + 4*(k+3), false, break_bci, delta); |
duke@435 | 363 | } |
duke@435 | 364 | // Special next-bci calculation here... |
duke@435 | 365 | bci += 1 + oldPad + (n+3)*4; |
duke@435 | 366 | continue; |
duke@435 | 367 | } |
duke@435 | 368 | case Bytecodes::_lookupswitch: |
duke@435 | 369 | case Bytecodes::_fast_linearswitch: |
duke@435 | 370 | case Bytecodes::_fast_binaryswitch: { |
duke@435 | 371 | change_jump(bci, bci +1 + oldPad, false, break_bci, delta); |
duke@435 | 372 | // We cannot use the Bytecode_lookupswitch abstraction, since the padding might not be correct. |
duke@435 | 373 | int npairs = int_at(bci + 1 + oldPad + 4 * 1); |
duke@435 | 374 | for (int k = 0; k < npairs; k++) { |
duke@435 | 375 | change_jump(bci, bci + 1 + oldPad + 4*(2 + 2*k + 1), false, break_bci, delta); |
duke@435 | 376 | } |
duke@435 | 377 | /* Special next-bci calculation here... */ |
duke@435 | 378 | bci += 1 + oldPad + (2 + (npairs*2))*4; |
duke@435 | 379 | continue; |
duke@435 | 380 | } |
duke@435 | 381 | default: |
duke@435 | 382 | ShouldNotReachHere(); |
duke@435 | 383 | } |
duke@435 | 384 | } |
duke@435 | 385 | default: |
duke@435 | 386 | break; |
duke@435 | 387 | } |
duke@435 | 388 | bci += rc_instr_len(bci); |
duke@435 | 389 | } |
duke@435 | 390 | } |
duke@435 | 391 | |
duke@435 | 392 | // The width of instruction at "pc" is changing by "delta". Adjust the |
duke@435 | 393 | // exception table, if any, of "rc->mb". |
duke@435 | 394 | void Relocator::adjust_exception_table(int bci, int delta) { |
duke@435 | 395 | typeArrayOop table = method()->exception_table(); |
duke@435 | 396 | for (int index = 0; index < table->length(); index +=4) { |
duke@435 | 397 | if (table->int_at(index) > bci) { |
duke@435 | 398 | table->int_at_put(index+0, table->int_at(index+0) + delta); |
duke@435 | 399 | table->int_at_put(index+1, table->int_at(index+1) + delta); |
duke@435 | 400 | } else if (bci < table->int_at(index+1)) { |
duke@435 | 401 | table->int_at_put(index+1, table->int_at(index+1) + delta); |
duke@435 | 402 | } |
duke@435 | 403 | if (table->int_at(index+2) > bci) |
duke@435 | 404 | table->int_at_put(index+2, table->int_at(index+2) + delta); |
duke@435 | 405 | } |
duke@435 | 406 | } |
duke@435 | 407 | |
duke@435 | 408 | |
duke@435 | 409 | // The width of instruction at "bci" is changing by "delta". Adjust the line number table. |
duke@435 | 410 | void Relocator::adjust_line_no_table(int bci, int delta) { |
duke@435 | 411 | if (method()->has_linenumber_table()) { |
duke@435 | 412 | CompressedLineNumberReadStream reader(method()->compressed_linenumber_table()); |
duke@435 | 413 | CompressedLineNumberWriteStream writer(64); // plenty big for most line number tables |
duke@435 | 414 | while (reader.read_pair()) { |
duke@435 | 415 | int adjustment = (reader.bci() > bci) ? delta : 0; |
duke@435 | 416 | writer.write_pair(reader.bci() + adjustment, reader.line()); |
duke@435 | 417 | } |
duke@435 | 418 | writer.write_terminator(); |
duke@435 | 419 | set_compressed_line_number_table(writer.buffer()); |
duke@435 | 420 | set_compressed_line_number_table_size(writer.position()); |
duke@435 | 421 | } |
duke@435 | 422 | } |
duke@435 | 423 | |
duke@435 | 424 | |
duke@435 | 425 | // The width of instruction at "bci" is changing by "delta". Adjust the local variable table. |
duke@435 | 426 | void Relocator::adjust_local_var_table(int bci, int delta) { |
duke@435 | 427 | int localvariable_table_length = method()->localvariable_table_length(); |
duke@435 | 428 | if (localvariable_table_length > 0) { |
duke@435 | 429 | LocalVariableTableElement* table = method()->localvariable_table_start(); |
duke@435 | 430 | for (int i = 0; i < localvariable_table_length; i++) { |
duke@435 | 431 | u2 current_bci = table[i].start_bci; |
duke@435 | 432 | if (current_bci > bci) { |
duke@435 | 433 | table[i].start_bci = current_bci + delta; |
duke@435 | 434 | } else { |
duke@435 | 435 | u2 current_length = table[i].length; |
duke@435 | 436 | if (current_bci + current_length > bci) { |
duke@435 | 437 | table[i].length = current_length + delta; |
duke@435 | 438 | } |
duke@435 | 439 | } |
duke@435 | 440 | } |
duke@435 | 441 | } |
duke@435 | 442 | } |
duke@435 | 443 | |
kamg@2232 | 444 | // Create a new array, copying the src array but adding a hole at |
kamg@2232 | 445 | // the specified location |
kamg@2232 | 446 | static typeArrayOop insert_hole_at( |
kamg@2232 | 447 | size_t where, int hole_sz, typeArrayOop src) { |
kamg@2232 | 448 | Thread* THREAD = Thread::current(); |
kamg@2232 | 449 | Handle src_hnd(THREAD, src); |
kamg@2232 | 450 | typeArrayOop dst = |
kamg@2232 | 451 | oopFactory::new_permanent_byteArray(src->length() + hole_sz, CHECK_NULL); |
kamg@2232 | 452 | src = (typeArrayOop)src_hnd(); |
kamg@2232 | 453 | |
kamg@2232 | 454 | address src_addr = (address)src->byte_at_addr(0); |
kamg@2232 | 455 | address dst_addr = (address)dst->byte_at_addr(0); |
kamg@2232 | 456 | |
kamg@2232 | 457 | memcpy(dst_addr, src_addr, where); |
kamg@2232 | 458 | memcpy(dst_addr + where + hole_sz, |
kamg@2232 | 459 | src_addr + where, src->length() - where); |
kamg@2232 | 460 | return dst; |
kamg@2232 | 461 | } |
kamg@2232 | 462 | |
kamg@2232 | 463 | // The width of instruction at "bci" is changing by "delta". Adjust the stack |
kamg@2232 | 464 | // map frames. |
kamg@2232 | 465 | void Relocator::adjust_stack_map_table(int bci, int delta) { |
kamg@2232 | 466 | if (method()->has_stackmap_table()) { |
kamg@2232 | 467 | typeArrayOop data = method()->stackmap_data(); |
kamg@2232 | 468 | // The data in the array is a classfile representation of the stackmap |
kamg@2232 | 469 | // table attribute, less the initial u2 tag and u4 attribute_length fields. |
kamg@2232 | 470 | stack_map_table_attribute* attr = stack_map_table_attribute::at( |
kamg@2232 | 471 | (address)data->byte_at_addr(0) - (sizeof(u2) + sizeof(u4))); |
kamg@2232 | 472 | |
kamg@2232 | 473 | int count = attr->number_of_entries(); |
kamg@2232 | 474 | stack_map_frame* frame = attr->entries(); |
kamg@2232 | 475 | int bci_iter = -1; |
kamg@2232 | 476 | bool offset_adjusted = false; // only need to adjust one offset |
kamg@2232 | 477 | |
kamg@2232 | 478 | for (int i = 0; i < count; ++i) { |
kamg@2232 | 479 | int offset_delta = frame->offset_delta(); |
kamg@2232 | 480 | bci_iter += offset_delta; |
kamg@2232 | 481 | |
kamg@2232 | 482 | if (!offset_adjusted && bci_iter > bci) { |
kamg@2232 | 483 | int new_offset_delta = offset_delta + delta; |
kamg@2232 | 484 | |
kamg@2232 | 485 | if (frame->is_valid_offset(new_offset_delta)) { |
kamg@2232 | 486 | frame->set_offset_delta(new_offset_delta); |
kamg@2232 | 487 | } else { |
kamg@2232 | 488 | assert(frame->is_same_frame() || |
kamg@2232 | 489 | frame->is_same_frame_1_stack_item_frame(), |
kamg@2232 | 490 | "Frame must be one of the compressed forms"); |
kamg@2232 | 491 | // The new delta exceeds the capacity of the 'same_frame' or |
kamg@2232 | 492 | // 'same_frame_1_stack_item_frame' frame types. We need to |
kamg@2232 | 493 | // convert these frames to the extended versions, but the extended |
kamg@2232 | 494 | // version is bigger and requires more room. So we allocate a |
kamg@2232 | 495 | // new array and copy the data, being sure to leave u2-sized hole |
kamg@2232 | 496 | // right after the 'frame_type' for the new offset field. |
kamg@2232 | 497 | // |
kamg@2232 | 498 | // We can safely ignore the reverse situation as a small delta |
kamg@2232 | 499 | // can still be used in an extended version of the frame. |
kamg@2232 | 500 | |
kamg@2232 | 501 | size_t frame_offset = (address)frame - (address)data->byte_at_addr(0); |
kamg@2232 | 502 | |
kamg@2232 | 503 | data = insert_hole_at(frame_offset + 1, 2, data); |
kamg@2232 | 504 | if (data == NULL) { |
kamg@2232 | 505 | return; // out-of-memory? |
kamg@2232 | 506 | } |
kamg@2232 | 507 | |
kamg@2232 | 508 | address frame_addr = (address)(data->byte_at_addr(0) + frame_offset); |
kamg@2232 | 509 | frame = stack_map_frame::at(frame_addr); |
kamg@2232 | 510 | |
kamg@2232 | 511 | |
kamg@2232 | 512 | // Now convert the frames in place |
kamg@2232 | 513 | if (frame->is_same_frame()) { |
kamg@2232 | 514 | same_frame_extended::create_at(frame_addr, new_offset_delta); |
kamg@2232 | 515 | } else { |
kamg@2232 | 516 | same_frame_1_stack_item_extended::create_at( |
kamg@2232 | 517 | frame_addr, new_offset_delta, NULL); |
kamg@2232 | 518 | // the verification_info_type should already be at the right spot |
kamg@2232 | 519 | } |
kamg@2232 | 520 | } |
kamg@2232 | 521 | offset_adjusted = true; // needs to be done only once, since subsequent |
kamg@2232 | 522 | // values are offsets from the current |
kamg@2232 | 523 | } |
kamg@2232 | 524 | |
kamg@2232 | 525 | // The stack map frame may contain verification types, if so we need to |
kamg@2232 | 526 | // check and update any Uninitialized type's bci (no matter where it is). |
kamg@2232 | 527 | int number_of_types = frame->number_of_types(); |
kamg@2232 | 528 | verification_type_info* types = frame->types(); |
kamg@2232 | 529 | |
kamg@2232 | 530 | for (int i = 0; i < number_of_types; ++i) { |
kamg@2232 | 531 | if (types->is_uninitialized() && types->bci() > bci) { |
kamg@2232 | 532 | types->set_bci(types->bci() + delta); |
kamg@2232 | 533 | } |
kamg@2232 | 534 | types = types->next(); |
kamg@2232 | 535 | } |
kamg@2232 | 536 | |
kamg@2232 | 537 | // Full frame has stack values too |
kamg@2232 | 538 | full_frame* ff = frame->as_full_frame(); |
kamg@2232 | 539 | if (ff != NULL) { |
kamg@2232 | 540 | address eol = (address)types; |
kamg@2232 | 541 | number_of_types = ff->stack_slots(eol); |
kamg@2232 | 542 | types = ff->stack(eol); |
kamg@2232 | 543 | for (int i = 0; i < number_of_types; ++i) { |
kamg@2232 | 544 | if (types->is_uninitialized() && types->bci() > bci) { |
kamg@2232 | 545 | types->set_bci(types->bci() + delta); |
kamg@2232 | 546 | } |
kamg@2232 | 547 | types = types->next(); |
kamg@2232 | 548 | } |
kamg@2232 | 549 | } |
kamg@2232 | 550 | |
kamg@2232 | 551 | frame = frame->next(); |
kamg@2232 | 552 | } |
kamg@2232 | 553 | |
kamg@2232 | 554 | method()->set_stackmap_data(data); // in case it has changed |
kamg@2232 | 555 | } |
kamg@2232 | 556 | } |
kamg@2232 | 557 | |
duke@435 | 558 | |
duke@435 | 559 | bool Relocator::expand_code_array(int delta) { |
duke@435 | 560 | int length = MAX2(code_length() + delta, code_length() * (100+code_slop_pct()) / 100); |
duke@435 | 561 | |
duke@435 | 562 | if (length > MAX_METHOD_LENGTH) { |
duke@435 | 563 | if (delta == 0 && code_length() <= MAX_METHOD_LENGTH) { |
duke@435 | 564 | length = MAX_METHOD_LENGTH; |
duke@435 | 565 | } else { |
duke@435 | 566 | return false; |
duke@435 | 567 | } |
duke@435 | 568 | } |
duke@435 | 569 | |
duke@435 | 570 | unsigned char* new_code_array = NEW_RESOURCE_ARRAY(unsigned char, length); |
duke@435 | 571 | if (!new_code_array) return false; |
duke@435 | 572 | |
duke@435 | 573 | // Expanding current array |
duke@435 | 574 | if (code_array() != NULL) { |
duke@435 | 575 | memcpy(new_code_array, code_array(), code_length()); |
duke@435 | 576 | } else { |
duke@435 | 577 | // Initial copy. Copy directly from methodOop |
duke@435 | 578 | memcpy(new_code_array, method()->code_base(), code_length()); |
duke@435 | 579 | } |
duke@435 | 580 | |
duke@435 | 581 | set_code_array(new_code_array); |
duke@435 | 582 | set_code_array_length(length); |
duke@435 | 583 | |
duke@435 | 584 | return true; |
duke@435 | 585 | } |
duke@435 | 586 | |
duke@435 | 587 | |
duke@435 | 588 | // The instruction at "bci", whose size is "ilen", is changing size by |
duke@435 | 589 | // "delta". Reallocate, move code, recalculate jumps, and enqueue |
duke@435 | 590 | // change items as necessary. |
duke@435 | 591 | bool Relocator::relocate_code(int bci, int ilen, int delta) { |
duke@435 | 592 | int next_bci = bci + ilen; |
duke@435 | 593 | if (delta > 0 && code_length() + delta > code_array_length()) { |
duke@435 | 594 | // Expand allocated code space, if necessary. |
duke@435 | 595 | if (!expand_code_array(delta)) { |
duke@435 | 596 | return false; |
duke@435 | 597 | } |
duke@435 | 598 | } |
duke@435 | 599 | |
duke@435 | 600 | // We require 4-byte alignment of code arrays. |
duke@435 | 601 | assert(((intptr_t)code_array() & 3) == 0, "check code alignment"); |
duke@435 | 602 | // Change jumps before doing the copying; this routine requires aligned switches. |
duke@435 | 603 | change_jumps(bci, delta); |
duke@435 | 604 | |
duke@435 | 605 | // In case we have shrunken a tableswitch/lookupswitch statement, we store the last |
duke@435 | 606 | // bytes that get overwritten. We have to copy the bytes after the change_jumps method |
duke@435 | 607 | // has been called, since it is likly to update last offset in a tableswitch/lookupswitch |
duke@435 | 608 | if (delta < 0) { |
duke@435 | 609 | assert(delta>=-3, "we cannot overwrite more than 3 bytes"); |
duke@435 | 610 | memcpy(_overwrite, addr_at(bci + ilen + delta), -delta); |
duke@435 | 611 | } |
duke@435 | 612 | |
duke@435 | 613 | memmove(addr_at(next_bci + delta), addr_at(next_bci), code_length() - next_bci); |
duke@435 | 614 | set_code_length(code_length() + delta); |
duke@435 | 615 | // Also adjust exception tables... |
duke@435 | 616 | adjust_exception_table(bci, delta); |
duke@435 | 617 | // Line number tables... |
duke@435 | 618 | adjust_line_no_table(bci, delta); |
duke@435 | 619 | // And local variable table... |
duke@435 | 620 | adjust_local_var_table(bci, delta); |
duke@435 | 621 | |
kamg@2232 | 622 | // Adjust stack maps |
kamg@2232 | 623 | adjust_stack_map_table(bci, delta); |
kamg@2232 | 624 | |
duke@435 | 625 | // Relocate the pending change stack... |
duke@435 | 626 | for (int j = 0; j < _changes->length(); j++) { |
duke@435 | 627 | ChangeItem* ci = _changes->at(j); |
duke@435 | 628 | ci->relocate(bci, delta); |
duke@435 | 629 | } |
duke@435 | 630 | |
duke@435 | 631 | // Notify any listeners about code relocation |
duke@435 | 632 | notify(bci, delta, code_length()); |
duke@435 | 633 | |
duke@435 | 634 | return true; |
duke@435 | 635 | } |
duke@435 | 636 | |
duke@435 | 637 | // relocate a general instruction. Called by ChangeWiden class |
duke@435 | 638 | bool Relocator::handle_widen(int bci, int new_ilen, u_char inst_buffer[]) { |
duke@435 | 639 | int ilen = rc_instr_len(bci); |
duke@435 | 640 | if (!relocate_code(bci, ilen, new_ilen - ilen)) |
duke@435 | 641 | return false; |
duke@435 | 642 | |
duke@435 | 643 | // Insert new bytecode(s) |
duke@435 | 644 | for(int k = 0; k < new_ilen; k++) { |
duke@435 | 645 | code_at_put(bci + k, (Bytecodes::Code)inst_buffer[k]); |
duke@435 | 646 | } |
duke@435 | 647 | |
duke@435 | 648 | return true; |
duke@435 | 649 | } |
duke@435 | 650 | |
duke@435 | 651 | // handle jump_widen instruction. Called be ChangeJumpWiden class |
duke@435 | 652 | bool Relocator::handle_jump_widen(int bci, int delta) { |
duke@435 | 653 | int ilen = rc_instr_len(bci); |
duke@435 | 654 | |
duke@435 | 655 | Bytecodes::Code bc = code_at(bci); |
duke@435 | 656 | switch (bc) { |
duke@435 | 657 | case Bytecodes::_ifeq: |
duke@435 | 658 | case Bytecodes::_ifne: |
duke@435 | 659 | case Bytecodes::_iflt: |
duke@435 | 660 | case Bytecodes::_ifge: |
duke@435 | 661 | case Bytecodes::_ifgt: |
duke@435 | 662 | case Bytecodes::_ifle: |
duke@435 | 663 | case Bytecodes::_if_icmpeq: |
duke@435 | 664 | case Bytecodes::_if_icmpne: |
duke@435 | 665 | case Bytecodes::_if_icmplt: |
duke@435 | 666 | case Bytecodes::_if_icmpge: |
duke@435 | 667 | case Bytecodes::_if_icmpgt: |
duke@435 | 668 | case Bytecodes::_if_icmple: |
duke@435 | 669 | case Bytecodes::_if_acmpeq: |
duke@435 | 670 | case Bytecodes::_if_acmpne: |
duke@435 | 671 | case Bytecodes::_ifnull: |
duke@435 | 672 | case Bytecodes::_ifnonnull: { |
duke@435 | 673 | const int goto_length = Bytecodes::length_for(Bytecodes::_goto); |
duke@435 | 674 | |
duke@435 | 675 | // If 'if' points to the next bytecode after goto, it's already handled. |
duke@435 | 676 | // it shouldn't be. |
duke@435 | 677 | assert (short_at(bci+1) != ilen+goto_length, "if relocation already handled"); |
duke@435 | 678 | assert(ilen == 3, "check length"); |
duke@435 | 679 | |
duke@435 | 680 | // Convert to 0 if <cond> goto 6 |
duke@435 | 681 | // 3 _goto 11 |
duke@435 | 682 | // 6 _goto_w <wide delta offset> |
duke@435 | 683 | // 11 <else code> |
duke@435 | 684 | const int goto_w_length = Bytecodes::length_for(Bytecodes::_goto_w); |
duke@435 | 685 | const int add_bci = goto_length + goto_w_length; |
duke@435 | 686 | |
duke@435 | 687 | if (!relocate_code(bci, 3, /*delta*/add_bci)) return false; |
duke@435 | 688 | |
duke@435 | 689 | // if bytecode points to goto_w instruction |
duke@435 | 690 | short_at_put(bci + 1, ilen + goto_length); |
duke@435 | 691 | |
duke@435 | 692 | int cbci = bci + ilen; |
duke@435 | 693 | // goto around |
duke@435 | 694 | code_at_put(cbci, Bytecodes::_goto); |
duke@435 | 695 | short_at_put(cbci + 1, add_bci); |
duke@435 | 696 | // goto_w <wide delta> |
duke@435 | 697 | cbci = cbci + goto_length; |
duke@435 | 698 | code_at_put(cbci, Bytecodes::_goto_w); |
duke@435 | 699 | if (delta > 0) { |
duke@435 | 700 | delta += 2; // goto_w is 2 bytes more than "if" code |
duke@435 | 701 | } else { |
duke@435 | 702 | delta -= ilen+goto_length; // branch starts at goto_w offset |
duke@435 | 703 | } |
duke@435 | 704 | int_at_put(cbci + 1, delta); |
duke@435 | 705 | break; |
duke@435 | 706 | |
duke@435 | 707 | } |
duke@435 | 708 | case Bytecodes::_goto: |
duke@435 | 709 | case Bytecodes::_jsr: |
duke@435 | 710 | assert(ilen == 3, "check length"); |
duke@435 | 711 | |
duke@435 | 712 | if (!relocate_code(bci, 3, 2)) return false; |
duke@435 | 713 | if (bc == Bytecodes::_goto) |
duke@435 | 714 | code_at_put(bci, Bytecodes::_goto_w); |
duke@435 | 715 | else |
duke@435 | 716 | code_at_put(bci, Bytecodes::_jsr_w); |
duke@435 | 717 | |
duke@435 | 718 | // If it's a forward jump, add 2 for the widening. |
duke@435 | 719 | if (delta > 0) delta += 2; |
duke@435 | 720 | int_at_put(bci + 1, delta); |
duke@435 | 721 | break; |
duke@435 | 722 | |
duke@435 | 723 | default: ShouldNotReachHere(); |
duke@435 | 724 | } |
duke@435 | 725 | |
duke@435 | 726 | return true; |
duke@435 | 727 | } |
duke@435 | 728 | |
duke@435 | 729 | // handle lookup/table switch instructions. Called be ChangeSwitchPad class |
duke@435 | 730 | bool Relocator::handle_switch_pad(int bci, int old_pad, bool is_lookup_switch) { |
duke@435 | 731 | int ilen = rc_instr_len(bci); |
duke@435 | 732 | int new_pad = align(bci+1) - (bci+1); |
duke@435 | 733 | int pad_delta = new_pad - old_pad; |
duke@435 | 734 | if (pad_delta != 0) { |
duke@435 | 735 | int len; |
duke@435 | 736 | if (!is_lookup_switch) { |
duke@435 | 737 | int low = int_at(bci+1+old_pad+4); |
duke@435 | 738 | int high = int_at(bci+1+old_pad+8); |
duke@435 | 739 | len = high-low+1 + 3; // 3 for default, hi, lo. |
duke@435 | 740 | } else { |
duke@435 | 741 | int npairs = int_at(bci+1+old_pad+4); |
duke@435 | 742 | len = npairs*2 + 2; // 2 for default, npairs. |
duke@435 | 743 | } |
duke@435 | 744 | // Because "relocateCode" does a "changeJumps" loop, |
duke@435 | 745 | // which parses instructions to determine their length, |
duke@435 | 746 | // we need to call that before messing with the current |
duke@435 | 747 | // instruction. Since it may also overwrite the current |
duke@435 | 748 | // instruction when moving down, remember the possibly |
duke@435 | 749 | // overwritten part. |
duke@435 | 750 | |
duke@435 | 751 | // Move the code following the instruction... |
duke@435 | 752 | if (!relocate_code(bci, ilen, pad_delta)) return false; |
duke@435 | 753 | |
duke@435 | 754 | if (pad_delta < 0) { |
duke@435 | 755 | // Move the shrunken instruction down. |
duke@435 | 756 | memmove(addr_at(bci + 1 + new_pad), |
duke@435 | 757 | addr_at(bci + 1 + old_pad), |
duke@435 | 758 | len * 4 + pad_delta); |
duke@435 | 759 | memmove(addr_at(bci + 1 + new_pad + len*4 + pad_delta), |
duke@435 | 760 | _overwrite, -pad_delta); |
duke@435 | 761 | } else { |
duke@435 | 762 | assert(pad_delta > 0, "check"); |
duke@435 | 763 | // Move the expanded instruction up. |
duke@435 | 764 | memmove(addr_at(bci +1 + new_pad), |
duke@435 | 765 | addr_at(bci +1 + old_pad), |
duke@435 | 766 | len * 4); |
kamg@2232 | 767 | memset(addr_at(bci + 1), 0, new_pad); // pad must be 0 |
duke@435 | 768 | } |
duke@435 | 769 | } |
duke@435 | 770 | return true; |
duke@435 | 771 | } |