Tue, 15 Nov 2011 20:17:33 +0100
7110152: assert(size_in_words <= (julong)max_jint) failed: no overflow
Summary: Reduce what arrayOopDesc::max_array_length() returns to avoid int overflow
Reviewed-by: kvn, dholmes, tonyp
duke@435 | 1 | /* |
never@2462 | 2 | * Copyright (c) 1997, 2011, 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/systemDictionary.hpp" |
stefank@2314 | 27 | #include "code/debugInfoRec.hpp" |
stefank@2314 | 28 | #include "gc_interface/collectedHeap.inline.hpp" |
stefank@2314 | 29 | #include "interpreter/bytecodeStream.hpp" |
stefank@2314 | 30 | #include "interpreter/bytecodeTracer.hpp" |
stefank@2314 | 31 | #include "interpreter/bytecodes.hpp" |
stefank@2314 | 32 | #include "interpreter/interpreter.hpp" |
stefank@2314 | 33 | #include "interpreter/oopMapCache.hpp" |
stefank@2314 | 34 | #include "memory/gcLocker.hpp" |
stefank@2314 | 35 | #include "memory/generation.hpp" |
stefank@2314 | 36 | #include "memory/oopFactory.hpp" |
stefank@2314 | 37 | #include "oops/klassOop.hpp" |
stefank@2314 | 38 | #include "oops/methodDataOop.hpp" |
stefank@2314 | 39 | #include "oops/methodOop.hpp" |
stefank@2314 | 40 | #include "oops/oop.inline.hpp" |
coleenp@2497 | 41 | #include "oops/symbol.hpp" |
stefank@2314 | 42 | #include "prims/jvmtiExport.hpp" |
stefank@2314 | 43 | #include "prims/methodHandleWalk.hpp" |
stefank@2314 | 44 | #include "prims/nativeLookup.hpp" |
stefank@2314 | 45 | #include "runtime/arguments.hpp" |
stefank@2314 | 46 | #include "runtime/compilationPolicy.hpp" |
stefank@2314 | 47 | #include "runtime/frame.inline.hpp" |
stefank@2314 | 48 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 49 | #include "runtime/relocator.hpp" |
stefank@2314 | 50 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 51 | #include "runtime/signature.hpp" |
brutisso@2976 | 52 | #include "utilities/quickSort.hpp" |
stefank@2314 | 53 | #include "utilities/xmlstream.hpp" |
duke@435 | 54 | |
duke@435 | 55 | |
duke@435 | 56 | // Implementation of methodOopDesc |
duke@435 | 57 | |
duke@435 | 58 | address methodOopDesc::get_i2c_entry() { |
duke@435 | 59 | assert(_adapter != NULL, "must have"); |
duke@435 | 60 | return _adapter->get_i2c_entry(); |
duke@435 | 61 | } |
duke@435 | 62 | |
duke@435 | 63 | address methodOopDesc::get_c2i_entry() { |
duke@435 | 64 | assert(_adapter != NULL, "must have"); |
duke@435 | 65 | return _adapter->get_c2i_entry(); |
duke@435 | 66 | } |
duke@435 | 67 | |
duke@435 | 68 | address methodOopDesc::get_c2i_unverified_entry() { |
duke@435 | 69 | assert(_adapter != NULL, "must have"); |
duke@435 | 70 | return _adapter->get_c2i_unverified_entry(); |
duke@435 | 71 | } |
duke@435 | 72 | |
duke@435 | 73 | char* methodOopDesc::name_and_sig_as_C_string() { |
duke@435 | 74 | return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature()); |
duke@435 | 75 | } |
duke@435 | 76 | |
duke@435 | 77 | char* methodOopDesc::name_and_sig_as_C_string(char* buf, int size) { |
duke@435 | 78 | return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature(), buf, size); |
duke@435 | 79 | } |
duke@435 | 80 | |
coleenp@2497 | 81 | char* methodOopDesc::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature) { |
duke@435 | 82 | const char* klass_name = klass->external_name(); |
duke@435 | 83 | int klass_name_len = (int)strlen(klass_name); |
duke@435 | 84 | int method_name_len = method_name->utf8_length(); |
duke@435 | 85 | int len = klass_name_len + 1 + method_name_len + signature->utf8_length(); |
duke@435 | 86 | char* dest = NEW_RESOURCE_ARRAY(char, len + 1); |
duke@435 | 87 | strcpy(dest, klass_name); |
duke@435 | 88 | dest[klass_name_len] = '.'; |
duke@435 | 89 | strcpy(&dest[klass_name_len + 1], method_name->as_C_string()); |
duke@435 | 90 | strcpy(&dest[klass_name_len + 1 + method_name_len], signature->as_C_string()); |
duke@435 | 91 | dest[len] = 0; |
duke@435 | 92 | return dest; |
duke@435 | 93 | } |
duke@435 | 94 | |
coleenp@2497 | 95 | char* methodOopDesc::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature, char* buf, int size) { |
coleenp@2497 | 96 | Symbol* klass_name = klass->name(); |
duke@435 | 97 | klass_name->as_klass_external_name(buf, size); |
duke@435 | 98 | int len = (int)strlen(buf); |
duke@435 | 99 | |
duke@435 | 100 | if (len < size - 1) { |
duke@435 | 101 | buf[len++] = '.'; |
duke@435 | 102 | |
duke@435 | 103 | method_name->as_C_string(&(buf[len]), size - len); |
duke@435 | 104 | len = (int)strlen(buf); |
duke@435 | 105 | |
duke@435 | 106 | signature->as_C_string(&(buf[len]), size - len); |
duke@435 | 107 | } |
duke@435 | 108 | |
duke@435 | 109 | return buf; |
duke@435 | 110 | } |
duke@435 | 111 | |
duke@435 | 112 | int methodOopDesc::fast_exception_handler_bci_for(KlassHandle ex_klass, int throw_bci, TRAPS) { |
duke@435 | 113 | // exception table holds quadruple entries of the form (beg_bci, end_bci, handler_bci, klass_index) |
duke@435 | 114 | const int beg_bci_offset = 0; |
duke@435 | 115 | const int end_bci_offset = 1; |
duke@435 | 116 | const int handler_bci_offset = 2; |
duke@435 | 117 | const int klass_index_offset = 3; |
duke@435 | 118 | const int entry_size = 4; |
duke@435 | 119 | // access exception table |
duke@435 | 120 | typeArrayHandle table (THREAD, constMethod()->exception_table()); |
duke@435 | 121 | int length = table->length(); |
duke@435 | 122 | assert(length % entry_size == 0, "exception table format has changed"); |
duke@435 | 123 | // iterate through all entries sequentially |
duke@435 | 124 | constantPoolHandle pool(THREAD, constants()); |
duke@435 | 125 | for (int i = 0; i < length; i += entry_size) { |
duke@435 | 126 | int beg_bci = table->int_at(i + beg_bci_offset); |
duke@435 | 127 | int end_bci = table->int_at(i + end_bci_offset); |
duke@435 | 128 | assert(beg_bci <= end_bci, "inconsistent exception table"); |
duke@435 | 129 | if (beg_bci <= throw_bci && throw_bci < end_bci) { |
duke@435 | 130 | // exception handler bci range covers throw_bci => investigate further |
duke@435 | 131 | int handler_bci = table->int_at(i + handler_bci_offset); |
duke@435 | 132 | int klass_index = table->int_at(i + klass_index_offset); |
duke@435 | 133 | if (klass_index == 0) { |
duke@435 | 134 | return handler_bci; |
duke@435 | 135 | } else if (ex_klass.is_null()) { |
duke@435 | 136 | return handler_bci; |
duke@435 | 137 | } else { |
duke@435 | 138 | // we know the exception class => get the constraint class |
duke@435 | 139 | // this may require loading of the constraint class; if verification |
duke@435 | 140 | // fails or some other exception occurs, return handler_bci |
duke@435 | 141 | klassOop k = pool->klass_at(klass_index, CHECK_(handler_bci)); |
duke@435 | 142 | KlassHandle klass = KlassHandle(THREAD, k); |
duke@435 | 143 | assert(klass.not_null(), "klass not loaded"); |
duke@435 | 144 | if (ex_klass->is_subtype_of(klass())) { |
duke@435 | 145 | return handler_bci; |
duke@435 | 146 | } |
duke@435 | 147 | } |
duke@435 | 148 | } |
duke@435 | 149 | } |
duke@435 | 150 | |
duke@435 | 151 | return -1; |
duke@435 | 152 | } |
duke@435 | 153 | |
duke@435 | 154 | void methodOopDesc::mask_for(int bci, InterpreterOopMap* mask) { |
duke@435 | 155 | |
duke@435 | 156 | Thread* myThread = Thread::current(); |
duke@435 | 157 | methodHandle h_this(myThread, this); |
duke@435 | 158 | #ifdef ASSERT |
duke@435 | 159 | bool has_capability = myThread->is_VM_thread() || |
duke@435 | 160 | myThread->is_ConcurrentGC_thread() || |
duke@435 | 161 | myThread->is_GC_task_thread(); |
duke@435 | 162 | |
duke@435 | 163 | if (!has_capability) { |
duke@435 | 164 | if (!VerifyStack && !VerifyLastFrame) { |
duke@435 | 165 | // verify stack calls this outside VM thread |
duke@435 | 166 | warning("oopmap should only be accessed by the " |
duke@435 | 167 | "VM, GC task or CMS threads (or during debugging)"); |
duke@435 | 168 | InterpreterOopMap local_mask; |
duke@435 | 169 | instanceKlass::cast(method_holder())->mask_for(h_this, bci, &local_mask); |
duke@435 | 170 | local_mask.print(); |
duke@435 | 171 | } |
duke@435 | 172 | } |
duke@435 | 173 | #endif |
duke@435 | 174 | instanceKlass::cast(method_holder())->mask_for(h_this, bci, mask); |
duke@435 | 175 | return; |
duke@435 | 176 | } |
duke@435 | 177 | |
duke@435 | 178 | |
duke@435 | 179 | int methodOopDesc::bci_from(address bcp) const { |
jrose@1161 | 180 | assert(is_native() && bcp == code_base() || contains(bcp) || is_error_reported(), "bcp doesn't belong to this method"); |
duke@435 | 181 | return bcp - code_base(); |
duke@435 | 182 | } |
duke@435 | 183 | |
duke@435 | 184 | |
duke@435 | 185 | // Return (int)bcx if it appears to be a valid BCI. |
duke@435 | 186 | // Return bci_from((address)bcx) if it appears to be a valid BCP. |
duke@435 | 187 | // Return -1 otherwise. |
duke@435 | 188 | // Used by profiling code, when invalid data is a possibility. |
duke@435 | 189 | // The caller is responsible for validating the methodOop itself. |
duke@435 | 190 | int methodOopDesc::validate_bci_from_bcx(intptr_t bcx) const { |
duke@435 | 191 | // keep bci as -1 if not a valid bci |
duke@435 | 192 | int bci = -1; |
duke@435 | 193 | if (bcx == 0 || (address)bcx == code_base()) { |
duke@435 | 194 | // code_size() may return 0 and we allow 0 here |
duke@435 | 195 | // the method may be native |
duke@435 | 196 | bci = 0; |
duke@435 | 197 | } else if (frame::is_bci(bcx)) { |
duke@435 | 198 | if (bcx < code_size()) { |
duke@435 | 199 | bci = (int)bcx; |
duke@435 | 200 | } |
duke@435 | 201 | } else if (contains((address)bcx)) { |
duke@435 | 202 | bci = (address)bcx - code_base(); |
duke@435 | 203 | } |
duke@435 | 204 | // Assert that if we have dodged any asserts, bci is negative. |
duke@435 | 205 | assert(bci == -1 || bci == bci_from(bcp_from(bci)), "sane bci if >=0"); |
duke@435 | 206 | return bci; |
duke@435 | 207 | } |
duke@435 | 208 | |
duke@435 | 209 | address methodOopDesc::bcp_from(int bci) const { |
duke@435 | 210 | assert((is_native() && bci == 0) || (!is_native() && 0 <= bci && bci < code_size()), "illegal bci"); |
duke@435 | 211 | address bcp = code_base() + bci; |
duke@435 | 212 | assert(is_native() && bcp == code_base() || contains(bcp), "bcp doesn't belong to this method"); |
duke@435 | 213 | return bcp; |
duke@435 | 214 | } |
duke@435 | 215 | |
duke@435 | 216 | |
duke@435 | 217 | int methodOopDesc::object_size(bool is_native) { |
duke@435 | 218 | // If native, then include pointers for native_function and signature_handler |
duke@435 | 219 | int extra_bytes = (is_native) ? 2*sizeof(address*) : 0; |
duke@435 | 220 | int extra_words = align_size_up(extra_bytes, BytesPerWord) / BytesPerWord; |
duke@435 | 221 | return align_object_size(header_size() + extra_words); |
duke@435 | 222 | } |
duke@435 | 223 | |
duke@435 | 224 | |
coleenp@2497 | 225 | Symbol* methodOopDesc::klass_name() const { |
duke@435 | 226 | klassOop k = method_holder(); |
duke@435 | 227 | assert(k->is_klass(), "must be klass"); |
duke@435 | 228 | instanceKlass* ik = (instanceKlass*) k->klass_part(); |
duke@435 | 229 | return ik->name(); |
duke@435 | 230 | } |
duke@435 | 231 | |
duke@435 | 232 | |
duke@435 | 233 | void methodOopDesc::set_interpreter_kind() { |
duke@435 | 234 | int kind = Interpreter::method_kind(methodOop(this)); |
duke@435 | 235 | assert(kind != Interpreter::invalid, |
duke@435 | 236 | "interpreter entry must be valid"); |
duke@435 | 237 | set_interpreter_kind(kind); |
duke@435 | 238 | } |
duke@435 | 239 | |
duke@435 | 240 | |
duke@435 | 241 | // Attempt to return method oop to original state. Clear any pointers |
duke@435 | 242 | // (to objects outside the shared spaces). We won't be able to predict |
duke@435 | 243 | // where they should point in a new JVM. Further initialize some |
duke@435 | 244 | // entries now in order allow them to be write protected later. |
duke@435 | 245 | |
duke@435 | 246 | void methodOopDesc::remove_unshareable_info() { |
duke@435 | 247 | unlink_method(); |
duke@435 | 248 | set_interpreter_kind(); |
duke@435 | 249 | } |
duke@435 | 250 | |
duke@435 | 251 | |
iveresov@2138 | 252 | bool methodOopDesc::was_executed_more_than(int n) { |
duke@435 | 253 | // Invocation counter is reset when the methodOop is compiled. |
duke@435 | 254 | // If the method has compiled code we therefore assume it has |
duke@435 | 255 | // be excuted more than n times. |
duke@435 | 256 | if (is_accessor() || is_empty_method() || (code() != NULL)) { |
duke@435 | 257 | // interpreter doesn't bump invocation counter of trivial methods |
duke@435 | 258 | // compiler does not bump invocation counter of compiled methods |
duke@435 | 259 | return true; |
iveresov@2138 | 260 | } |
iveresov@2138 | 261 | else if (_invocation_counter.carry() || (method_data() != NULL && method_data()->invocation_counter()->carry())) { |
duke@435 | 262 | // The carry bit is set when the counter overflows and causes |
duke@435 | 263 | // a compilation to occur. We don't know how many times |
duke@435 | 264 | // the counter has been reset, so we simply assume it has |
duke@435 | 265 | // been executed more than n times. |
duke@435 | 266 | return true; |
duke@435 | 267 | } else { |
duke@435 | 268 | return invocation_count() > n; |
duke@435 | 269 | } |
duke@435 | 270 | } |
duke@435 | 271 | |
duke@435 | 272 | #ifndef PRODUCT |
iveresov@2138 | 273 | void methodOopDesc::print_invocation_count() { |
duke@435 | 274 | if (is_static()) tty->print("static "); |
duke@435 | 275 | if (is_final()) tty->print("final "); |
duke@435 | 276 | if (is_synchronized()) tty->print("synchronized "); |
duke@435 | 277 | if (is_native()) tty->print("native "); |
duke@435 | 278 | method_holder()->klass_part()->name()->print_symbol_on(tty); |
duke@435 | 279 | tty->print("."); |
duke@435 | 280 | name()->print_symbol_on(tty); |
duke@435 | 281 | signature()->print_symbol_on(tty); |
duke@435 | 282 | |
duke@435 | 283 | if (WizardMode) { |
duke@435 | 284 | // dump the size of the byte codes |
duke@435 | 285 | tty->print(" {%d}", code_size()); |
duke@435 | 286 | } |
duke@435 | 287 | tty->cr(); |
duke@435 | 288 | |
duke@435 | 289 | tty->print_cr (" interpreter_invocation_count: %8d ", interpreter_invocation_count()); |
duke@435 | 290 | tty->print_cr (" invocation_counter: %8d ", invocation_count()); |
duke@435 | 291 | tty->print_cr (" backedge_counter: %8d ", backedge_count()); |
duke@435 | 292 | if (CountCompiledCalls) { |
duke@435 | 293 | tty->print_cr (" compiled_invocation_count: %8d ", compiled_invocation_count()); |
duke@435 | 294 | } |
duke@435 | 295 | |
duke@435 | 296 | } |
duke@435 | 297 | #endif |
duke@435 | 298 | |
duke@435 | 299 | // Build a methodDataOop object to hold information about this method |
duke@435 | 300 | // collected in the interpreter. |
duke@435 | 301 | void methodOopDesc::build_interpreter_method_data(methodHandle method, TRAPS) { |
coleenp@2363 | 302 | // Do not profile method if current thread holds the pending list lock, |
coleenp@2363 | 303 | // which avoids deadlock for acquiring the MethodData_lock. |
coleenp@2363 | 304 | if (instanceRefKlass::owns_pending_list_lock((JavaThread*)THREAD)) { |
coleenp@2363 | 305 | return; |
coleenp@2363 | 306 | } |
coleenp@2363 | 307 | |
duke@435 | 308 | // Grab a lock here to prevent multiple |
duke@435 | 309 | // methodDataOops from being created. |
duke@435 | 310 | MutexLocker ml(MethodData_lock, THREAD); |
duke@435 | 311 | if (method->method_data() == NULL) { |
duke@435 | 312 | methodDataOop method_data = oopFactory::new_methodData(method, CHECK); |
duke@435 | 313 | method->set_method_data(method_data); |
duke@435 | 314 | if (PrintMethodData && (Verbose || WizardMode)) { |
duke@435 | 315 | ResourceMark rm(THREAD); |
duke@435 | 316 | tty->print("build_interpreter_method_data for "); |
duke@435 | 317 | method->print_name(tty); |
duke@435 | 318 | tty->cr(); |
duke@435 | 319 | // At the end of the run, the MDO, full of data, will be dumped. |
duke@435 | 320 | } |
duke@435 | 321 | } |
duke@435 | 322 | } |
duke@435 | 323 | |
duke@435 | 324 | void methodOopDesc::cleanup_inline_caches() { |
duke@435 | 325 | // The current system doesn't use inline caches in the interpreter |
duke@435 | 326 | // => nothing to do (keep this method around for future use) |
duke@435 | 327 | } |
duke@435 | 328 | |
duke@435 | 329 | |
jrose@1145 | 330 | int methodOopDesc::extra_stack_words() { |
jrose@1145 | 331 | // not an inline function, to avoid a header dependency on Interpreter |
twisti@1861 | 332 | return extra_stack_entries() * Interpreter::stackElementSize; |
jrose@1145 | 333 | } |
jrose@1145 | 334 | |
jrose@1145 | 335 | |
duke@435 | 336 | void methodOopDesc::compute_size_of_parameters(Thread *thread) { |
coleenp@2497 | 337 | ArgumentSizeComputer asc(signature()); |
duke@435 | 338 | set_size_of_parameters(asc.size() + (is_static() ? 0 : 1)); |
duke@435 | 339 | } |
duke@435 | 340 | |
duke@435 | 341 | #ifdef CC_INTERP |
duke@435 | 342 | void methodOopDesc::set_result_index(BasicType type) { |
duke@435 | 343 | _result_index = Interpreter::BasicType_as_index(type); |
duke@435 | 344 | } |
duke@435 | 345 | #endif |
duke@435 | 346 | |
duke@435 | 347 | BasicType methodOopDesc::result_type() const { |
duke@435 | 348 | ResultTypeFinder rtf(signature()); |
duke@435 | 349 | return rtf.type(); |
duke@435 | 350 | } |
duke@435 | 351 | |
duke@435 | 352 | |
duke@435 | 353 | bool methodOopDesc::is_empty_method() const { |
duke@435 | 354 | return code_size() == 1 |
duke@435 | 355 | && *code_base() == Bytecodes::_return; |
duke@435 | 356 | } |
duke@435 | 357 | |
duke@435 | 358 | |
duke@435 | 359 | bool methodOopDesc::is_vanilla_constructor() const { |
duke@435 | 360 | // Returns true if this method is a vanilla constructor, i.e. an "<init>" "()V" method |
duke@435 | 361 | // which only calls the superclass vanilla constructor and possibly does stores of |
duke@435 | 362 | // zero constants to local fields: |
duke@435 | 363 | // |
duke@435 | 364 | // aload_0 |
duke@435 | 365 | // invokespecial |
duke@435 | 366 | // indexbyte1 |
duke@435 | 367 | // indexbyte2 |
duke@435 | 368 | // |
duke@435 | 369 | // followed by an (optional) sequence of: |
duke@435 | 370 | // |
duke@435 | 371 | // aload_0 |
duke@435 | 372 | // aconst_null / iconst_0 / fconst_0 / dconst_0 |
duke@435 | 373 | // putfield |
duke@435 | 374 | // indexbyte1 |
duke@435 | 375 | // indexbyte2 |
duke@435 | 376 | // |
duke@435 | 377 | // followed by: |
duke@435 | 378 | // |
duke@435 | 379 | // return |
duke@435 | 380 | |
duke@435 | 381 | assert(name() == vmSymbols::object_initializer_name(), "Should only be called for default constructors"); |
duke@435 | 382 | assert(signature() == vmSymbols::void_method_signature(), "Should only be called for default constructors"); |
duke@435 | 383 | int size = code_size(); |
duke@435 | 384 | // Check if size match |
duke@435 | 385 | if (size == 0 || size % 5 != 0) return false; |
duke@435 | 386 | address cb = code_base(); |
duke@435 | 387 | int last = size - 1; |
duke@435 | 388 | if (cb[0] != Bytecodes::_aload_0 || cb[1] != Bytecodes::_invokespecial || cb[last] != Bytecodes::_return) { |
duke@435 | 389 | // Does not call superclass default constructor |
duke@435 | 390 | return false; |
duke@435 | 391 | } |
duke@435 | 392 | // Check optional sequence |
duke@435 | 393 | for (int i = 4; i < last; i += 5) { |
duke@435 | 394 | if (cb[i] != Bytecodes::_aload_0) return false; |
duke@435 | 395 | if (!Bytecodes::is_zero_const(Bytecodes::cast(cb[i+1]))) return false; |
duke@435 | 396 | if (cb[i+2] != Bytecodes::_putfield) return false; |
duke@435 | 397 | } |
duke@435 | 398 | return true; |
duke@435 | 399 | } |
duke@435 | 400 | |
duke@435 | 401 | |
duke@435 | 402 | bool methodOopDesc::compute_has_loops_flag() { |
duke@435 | 403 | BytecodeStream bcs(methodOop(this)); |
duke@435 | 404 | Bytecodes::Code bc; |
duke@435 | 405 | |
duke@435 | 406 | while ((bc = bcs.next()) >= 0) { |
duke@435 | 407 | switch( bc ) { |
duke@435 | 408 | case Bytecodes::_ifeq: |
duke@435 | 409 | case Bytecodes::_ifnull: |
duke@435 | 410 | case Bytecodes::_iflt: |
duke@435 | 411 | case Bytecodes::_ifle: |
duke@435 | 412 | case Bytecodes::_ifne: |
duke@435 | 413 | case Bytecodes::_ifnonnull: |
duke@435 | 414 | case Bytecodes::_ifgt: |
duke@435 | 415 | case Bytecodes::_ifge: |
duke@435 | 416 | case Bytecodes::_if_icmpeq: |
duke@435 | 417 | case Bytecodes::_if_icmpne: |
duke@435 | 418 | case Bytecodes::_if_icmplt: |
duke@435 | 419 | case Bytecodes::_if_icmpgt: |
duke@435 | 420 | case Bytecodes::_if_icmple: |
duke@435 | 421 | case Bytecodes::_if_icmpge: |
duke@435 | 422 | case Bytecodes::_if_acmpeq: |
duke@435 | 423 | case Bytecodes::_if_acmpne: |
duke@435 | 424 | case Bytecodes::_goto: |
duke@435 | 425 | case Bytecodes::_jsr: |
duke@435 | 426 | if( bcs.dest() < bcs.next_bci() ) _access_flags.set_has_loops(); |
duke@435 | 427 | break; |
duke@435 | 428 | |
duke@435 | 429 | case Bytecodes::_goto_w: |
duke@435 | 430 | case Bytecodes::_jsr_w: |
duke@435 | 431 | if( bcs.dest_w() < bcs.next_bci() ) _access_flags.set_has_loops(); |
duke@435 | 432 | break; |
duke@435 | 433 | } |
duke@435 | 434 | } |
duke@435 | 435 | _access_flags.set_loops_flag_init(); |
duke@435 | 436 | return _access_flags.has_loops(); |
duke@435 | 437 | } |
duke@435 | 438 | |
duke@435 | 439 | |
duke@435 | 440 | bool methodOopDesc::is_final_method() const { |
duke@435 | 441 | // %%% Should return true for private methods also, |
duke@435 | 442 | // since there is no way to override them. |
duke@435 | 443 | return is_final() || Klass::cast(method_holder())->is_final(); |
duke@435 | 444 | } |
duke@435 | 445 | |
duke@435 | 446 | |
duke@435 | 447 | bool methodOopDesc::is_strict_method() const { |
duke@435 | 448 | return is_strict(); |
duke@435 | 449 | } |
duke@435 | 450 | |
duke@435 | 451 | |
duke@435 | 452 | bool methodOopDesc::can_be_statically_bound() const { |
duke@435 | 453 | if (is_final_method()) return true; |
duke@435 | 454 | return vtable_index() == nonvirtual_vtable_index; |
duke@435 | 455 | } |
duke@435 | 456 | |
duke@435 | 457 | |
duke@435 | 458 | bool methodOopDesc::is_accessor() const { |
duke@435 | 459 | if (code_size() != 5) return false; |
duke@435 | 460 | if (size_of_parameters() != 1) return false; |
never@2462 | 461 | if (java_code_at(0) != Bytecodes::_aload_0 ) return false; |
never@2462 | 462 | if (java_code_at(1) != Bytecodes::_getfield) return false; |
never@2462 | 463 | if (java_code_at(4) != Bytecodes::_areturn && |
never@2462 | 464 | java_code_at(4) != Bytecodes::_ireturn ) return false; |
duke@435 | 465 | return true; |
duke@435 | 466 | } |
duke@435 | 467 | |
duke@435 | 468 | |
duke@435 | 469 | bool methodOopDesc::is_initializer() const { |
kamg@2616 | 470 | return name() == vmSymbols::object_initializer_name() || is_static_initializer(); |
kamg@2616 | 471 | } |
kamg@2616 | 472 | |
kamg@2616 | 473 | bool methodOopDesc::has_valid_initializer_flags() const { |
kamg@2616 | 474 | return (is_static() || |
kamg@2616 | 475 | instanceKlass::cast(method_holder())->major_version() < 51); |
kamg@2616 | 476 | } |
kamg@2616 | 477 | |
kamg@2616 | 478 | bool methodOopDesc::is_static_initializer() const { |
kamg@2616 | 479 | // For classfiles version 51 or greater, ensure that the clinit method is |
kamg@2616 | 480 | // static. Non-static methods with the name "<clinit>" are not static |
kamg@2616 | 481 | // initializers. (older classfiles exempted for backward compatibility) |
kamg@2616 | 482 | return name() == vmSymbols::class_initializer_name() && |
kamg@2616 | 483 | has_valid_initializer_flags(); |
duke@435 | 484 | } |
duke@435 | 485 | |
duke@435 | 486 | |
duke@435 | 487 | objArrayHandle methodOopDesc::resolved_checked_exceptions_impl(methodOop this_oop, TRAPS) { |
duke@435 | 488 | int length = this_oop->checked_exceptions_length(); |
duke@435 | 489 | if (length == 0) { // common case |
duke@435 | 490 | return objArrayHandle(THREAD, Universe::the_empty_class_klass_array()); |
duke@435 | 491 | } else { |
duke@435 | 492 | methodHandle h_this(THREAD, this_oop); |
never@1577 | 493 | objArrayOop m_oop = oopFactory::new_objArray(SystemDictionary::Class_klass(), length, CHECK_(objArrayHandle())); |
duke@435 | 494 | objArrayHandle mirrors (THREAD, m_oop); |
duke@435 | 495 | for (int i = 0; i < length; i++) { |
duke@435 | 496 | CheckedExceptionElement* table = h_this->checked_exceptions_start(); // recompute on each iteration, not gc safe |
duke@435 | 497 | klassOop k = h_this->constants()->klass_at(table[i].class_cp_index, CHECK_(objArrayHandle())); |
never@1577 | 498 | assert(Klass::cast(k)->is_subclass_of(SystemDictionary::Throwable_klass()), "invalid exception class"); |
duke@435 | 499 | mirrors->obj_at_put(i, Klass::cast(k)->java_mirror()); |
duke@435 | 500 | } |
duke@435 | 501 | return mirrors; |
duke@435 | 502 | } |
duke@435 | 503 | }; |
duke@435 | 504 | |
duke@435 | 505 | |
duke@435 | 506 | int methodOopDesc::line_number_from_bci(int bci) const { |
duke@435 | 507 | if (bci == SynchronizationEntryBCI) bci = 0; |
duke@435 | 508 | assert(bci == 0 || 0 <= bci && bci < code_size(), "illegal bci"); |
duke@435 | 509 | int best_bci = 0; |
duke@435 | 510 | int best_line = -1; |
duke@435 | 511 | |
duke@435 | 512 | if (has_linenumber_table()) { |
duke@435 | 513 | // The line numbers are a short array of 2-tuples [start_pc, line_number]. |
duke@435 | 514 | // Not necessarily sorted and not necessarily one-to-one. |
duke@435 | 515 | CompressedLineNumberReadStream stream(compressed_linenumber_table()); |
duke@435 | 516 | while (stream.read_pair()) { |
duke@435 | 517 | if (stream.bci() == bci) { |
duke@435 | 518 | // perfect match |
duke@435 | 519 | return stream.line(); |
duke@435 | 520 | } else { |
duke@435 | 521 | // update best_bci/line |
duke@435 | 522 | if (stream.bci() < bci && stream.bci() >= best_bci) { |
duke@435 | 523 | best_bci = stream.bci(); |
duke@435 | 524 | best_line = stream.line(); |
duke@435 | 525 | } |
duke@435 | 526 | } |
duke@435 | 527 | } |
duke@435 | 528 | } |
duke@435 | 529 | return best_line; |
duke@435 | 530 | } |
duke@435 | 531 | |
duke@435 | 532 | |
duke@435 | 533 | bool methodOopDesc::is_klass_loaded_by_klass_index(int klass_index) const { |
duke@435 | 534 | if( _constants->tag_at(klass_index).is_unresolved_klass() ) { |
duke@435 | 535 | Thread *thread = Thread::current(); |
coleenp@2497 | 536 | Symbol* klass_name = _constants->klass_name_at(klass_index); |
duke@435 | 537 | Handle loader(thread, instanceKlass::cast(method_holder())->class_loader()); |
duke@435 | 538 | Handle prot (thread, Klass::cast(method_holder())->protection_domain()); |
duke@435 | 539 | return SystemDictionary::find(klass_name, loader, prot, thread) != NULL; |
duke@435 | 540 | } else { |
duke@435 | 541 | return true; |
duke@435 | 542 | } |
duke@435 | 543 | } |
duke@435 | 544 | |
duke@435 | 545 | |
duke@435 | 546 | bool methodOopDesc::is_klass_loaded(int refinfo_index, bool must_be_resolved) const { |
duke@435 | 547 | int klass_index = _constants->klass_ref_index_at(refinfo_index); |
duke@435 | 548 | if (must_be_resolved) { |
duke@435 | 549 | // Make sure klass is resolved in constantpool. |
duke@435 | 550 | if (constants()->tag_at(klass_index).is_unresolved_klass()) return false; |
duke@435 | 551 | } |
duke@435 | 552 | return is_klass_loaded_by_klass_index(klass_index); |
duke@435 | 553 | } |
duke@435 | 554 | |
duke@435 | 555 | |
duke@435 | 556 | void methodOopDesc::set_native_function(address function, bool post_event_flag) { |
duke@435 | 557 | assert(function != NULL, "use clear_native_function to unregister natives"); |
duke@435 | 558 | address* native_function = native_function_addr(); |
duke@435 | 559 | |
duke@435 | 560 | // We can see racers trying to place the same native function into place. Once |
duke@435 | 561 | // is plenty. |
duke@435 | 562 | address current = *native_function; |
duke@435 | 563 | if (current == function) return; |
duke@435 | 564 | if (post_event_flag && JvmtiExport::should_post_native_method_bind() && |
duke@435 | 565 | function != NULL) { |
duke@435 | 566 | // native_method_throw_unsatisfied_link_error_entry() should only |
duke@435 | 567 | // be passed when post_event_flag is false. |
duke@435 | 568 | assert(function != |
duke@435 | 569 | SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), |
duke@435 | 570 | "post_event_flag mis-match"); |
duke@435 | 571 | |
duke@435 | 572 | // post the bind event, and possible change the bind function |
duke@435 | 573 | JvmtiExport::post_native_method_bind(this, &function); |
duke@435 | 574 | } |
duke@435 | 575 | *native_function = function; |
duke@435 | 576 | // This function can be called more than once. We must make sure that we always |
duke@435 | 577 | // use the latest registered method -> check if a stub already has been generated. |
duke@435 | 578 | // If so, we have to make it not_entrant. |
duke@435 | 579 | nmethod* nm = code(); // Put it into local variable to guard against concurrent updates |
duke@435 | 580 | if (nm != NULL) { |
duke@435 | 581 | nm->make_not_entrant(); |
duke@435 | 582 | } |
duke@435 | 583 | } |
duke@435 | 584 | |
duke@435 | 585 | |
duke@435 | 586 | bool methodOopDesc::has_native_function() const { |
duke@435 | 587 | address func = native_function(); |
duke@435 | 588 | return (func != NULL && func != SharedRuntime::native_method_throw_unsatisfied_link_error_entry()); |
duke@435 | 589 | } |
duke@435 | 590 | |
duke@435 | 591 | |
duke@435 | 592 | void methodOopDesc::clear_native_function() { |
duke@435 | 593 | set_native_function( |
duke@435 | 594 | SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), |
duke@435 | 595 | !native_bind_event_is_interesting); |
duke@435 | 596 | clear_code(); |
duke@435 | 597 | } |
duke@435 | 598 | |
duke@435 | 599 | |
duke@435 | 600 | void methodOopDesc::set_signature_handler(address handler) { |
duke@435 | 601 | address* signature_handler = signature_handler_addr(); |
duke@435 | 602 | *signature_handler = handler; |
duke@435 | 603 | } |
duke@435 | 604 | |
duke@435 | 605 | |
duke@435 | 606 | bool methodOopDesc::is_not_compilable(int comp_level) const { |
jrose@1145 | 607 | if (is_method_handle_invoke()) { |
jrose@1145 | 608 | // compilers must recognize this method specially, or not at all |
jrose@1145 | 609 | return true; |
jrose@1145 | 610 | } |
iveresov@2138 | 611 | if (number_of_breakpoints() > 0) { |
iveresov@2138 | 612 | return true; |
duke@435 | 613 | } |
iveresov@2138 | 614 | if (comp_level == CompLevel_any) { |
iveresov@2138 | 615 | return is_not_c1_compilable() || is_not_c2_compilable(); |
iveresov@2138 | 616 | } |
iveresov@2138 | 617 | if (is_c1_compile(comp_level)) { |
iveresov@2138 | 618 | return is_not_c1_compilable(); |
iveresov@2138 | 619 | } |
iveresov@2138 | 620 | if (is_c2_compile(comp_level)) { |
iveresov@2138 | 621 | return is_not_c2_compilable(); |
iveresov@2138 | 622 | } |
iveresov@2138 | 623 | return false; |
duke@435 | 624 | } |
duke@435 | 625 | |
duke@435 | 626 | // call this when compiler finds that this method is not compilable |
kvn@1643 | 627 | void methodOopDesc::set_not_compilable(int comp_level, bool report) { |
kvn@1643 | 628 | if (PrintCompilation && report) { |
kvn@1641 | 629 | ttyLocker ttyl; |
kvn@1641 | 630 | tty->print("made not compilable "); |
kvn@1641 | 631 | this->print_short_name(tty); |
kvn@1641 | 632 | int size = this->code_size(); |
kvn@1641 | 633 | if (size > 0) |
kvn@1641 | 634 | tty->print(" (%d bytes)", size); |
kvn@1641 | 635 | tty->cr(); |
kvn@1641 | 636 | } |
duke@435 | 637 | if ((TraceDeoptimization || LogCompilation) && (xtty != NULL)) { |
duke@435 | 638 | ttyLocker ttyl; |
duke@435 | 639 | xtty->begin_elem("make_not_compilable thread='%d'", (int) os::current_thread_id()); |
duke@435 | 640 | xtty->method(methodOop(this)); |
duke@435 | 641 | xtty->stamp(); |
duke@435 | 642 | xtty->end_elem(); |
duke@435 | 643 | } |
iveresov@2138 | 644 | if (comp_level == CompLevel_all) { |
iveresov@2138 | 645 | set_not_c1_compilable(); |
iveresov@2138 | 646 | set_not_c2_compilable(); |
iveresov@2138 | 647 | } else { |
iveresov@2138 | 648 | if (is_c1_compile(comp_level)) { |
iveresov@2138 | 649 | set_not_c1_compilable(); |
iveresov@2138 | 650 | } else |
iveresov@2138 | 651 | if (is_c2_compile(comp_level)) { |
iveresov@2138 | 652 | set_not_c2_compilable(); |
iveresov@2138 | 653 | } |
duke@435 | 654 | } |
iveresov@2138 | 655 | CompilationPolicy::policy()->disable_compilation(this); |
duke@435 | 656 | } |
duke@435 | 657 | |
duke@435 | 658 | // Revert to using the interpreter and clear out the nmethod |
duke@435 | 659 | void methodOopDesc::clear_code() { |
duke@435 | 660 | |
duke@435 | 661 | // this may be NULL if c2i adapters have not been made yet |
duke@435 | 662 | // Only should happen at allocate time. |
duke@435 | 663 | if (_adapter == NULL) { |
duke@435 | 664 | _from_compiled_entry = NULL; |
duke@435 | 665 | } else { |
duke@435 | 666 | _from_compiled_entry = _adapter->get_c2i_entry(); |
duke@435 | 667 | } |
duke@435 | 668 | OrderAccess::storestore(); |
duke@435 | 669 | _from_interpreted_entry = _i2i_entry; |
duke@435 | 670 | OrderAccess::storestore(); |
duke@435 | 671 | _code = NULL; |
duke@435 | 672 | } |
duke@435 | 673 | |
duke@435 | 674 | // Called by class data sharing to remove any entry points (which are not shared) |
duke@435 | 675 | void methodOopDesc::unlink_method() { |
duke@435 | 676 | _code = NULL; |
duke@435 | 677 | _i2i_entry = NULL; |
duke@435 | 678 | _from_interpreted_entry = NULL; |
duke@435 | 679 | if (is_native()) { |
duke@435 | 680 | *native_function_addr() = NULL; |
duke@435 | 681 | set_signature_handler(NULL); |
duke@435 | 682 | } |
duke@435 | 683 | NOT_PRODUCT(set_compiled_invocation_count(0);) |
duke@435 | 684 | invocation_counter()->reset(); |
duke@435 | 685 | backedge_counter()->reset(); |
duke@435 | 686 | _adapter = NULL; |
duke@435 | 687 | _from_compiled_entry = NULL; |
duke@435 | 688 | assert(_method_data == NULL, "unexpected method data?"); |
duke@435 | 689 | set_method_data(NULL); |
duke@435 | 690 | set_interpreter_throwout_count(0); |
duke@435 | 691 | set_interpreter_invocation_count(0); |
duke@435 | 692 | } |
duke@435 | 693 | |
duke@435 | 694 | // Called when the method_holder is getting linked. Setup entrypoints so the method |
duke@435 | 695 | // is ready to be called from interpreter, compiler, and vtables. |
duke@435 | 696 | void methodOopDesc::link_method(methodHandle h_method, TRAPS) { |
coleenp@2945 | 697 | // If the code cache is full, we may reenter this function for the |
coleenp@2945 | 698 | // leftover methods that weren't linked. |
coleenp@2945 | 699 | if (_i2i_entry != NULL) return; |
coleenp@2945 | 700 | |
duke@435 | 701 | assert(_adapter == NULL, "init'd to NULL" ); |
duke@435 | 702 | assert( _code == NULL, "nothing compiled yet" ); |
duke@435 | 703 | |
duke@435 | 704 | // Setup interpreter entrypoint |
duke@435 | 705 | assert(this == h_method(), "wrong h_method()" ); |
duke@435 | 706 | address entry = Interpreter::entry_for_method(h_method); |
duke@435 | 707 | assert(entry != NULL, "interpreter entry must be non-null"); |
duke@435 | 708 | // Sets both _i2i_entry and _from_interpreted_entry |
duke@435 | 709 | set_interpreter_entry(entry); |
jrose@1145 | 710 | if (is_native() && !is_method_handle_invoke()) { |
duke@435 | 711 | set_native_function( |
duke@435 | 712 | SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), |
duke@435 | 713 | !native_bind_event_is_interesting); |
duke@435 | 714 | } |
duke@435 | 715 | |
duke@435 | 716 | // Setup compiler entrypoint. This is made eagerly, so we do not need |
duke@435 | 717 | // special handling of vtables. An alternative is to make adapters more |
duke@435 | 718 | // lazily by calling make_adapter() from from_compiled_entry() for the |
duke@435 | 719 | // normal calls. For vtable calls life gets more complicated. When a |
duke@435 | 720 | // call-site goes mega-morphic we need adapters in all methods which can be |
duke@435 | 721 | // called from the vtable. We need adapters on such methods that get loaded |
duke@435 | 722 | // later. Ditto for mega-morphic itable calls. If this proves to be a |
duke@435 | 723 | // problem we'll make these lazily later. |
coleenp@2946 | 724 | (void) make_adapters(h_method, CHECK); |
duke@435 | 725 | |
duke@435 | 726 | // ONLY USE the h_method now as make_adapter may have blocked |
duke@435 | 727 | |
duke@435 | 728 | } |
duke@435 | 729 | |
duke@435 | 730 | address methodOopDesc::make_adapters(methodHandle mh, TRAPS) { |
duke@435 | 731 | // Adapters for compiled code are made eagerly here. They are fairly |
duke@435 | 732 | // small (generally < 100 bytes) and quick to make (and cached and shared) |
duke@435 | 733 | // so making them eagerly shouldn't be too expensive. |
duke@435 | 734 | AdapterHandlerEntry* adapter = AdapterHandlerLibrary::get_adapter(mh); |
duke@435 | 735 | if (adapter == NULL ) { |
never@1622 | 736 | THROW_MSG_NULL(vmSymbols::java_lang_VirtualMachineError(), "out of space in CodeCache for adapters"); |
duke@435 | 737 | } |
duke@435 | 738 | |
duke@435 | 739 | mh->set_adapter_entry(adapter); |
duke@435 | 740 | mh->_from_compiled_entry = adapter->get_c2i_entry(); |
duke@435 | 741 | return adapter->get_c2i_entry(); |
duke@435 | 742 | } |
duke@435 | 743 | |
duke@435 | 744 | // The verified_code_entry() must be called when a invoke is resolved |
duke@435 | 745 | // on this method. |
duke@435 | 746 | |
duke@435 | 747 | // It returns the compiled code entry point, after asserting not null. |
duke@435 | 748 | // This function is called after potential safepoints so that nmethod |
duke@435 | 749 | // or adapter that it points to is still live and valid. |
duke@435 | 750 | // This function must not hit a safepoint! |
duke@435 | 751 | address methodOopDesc::verified_code_entry() { |
duke@435 | 752 | debug_only(No_Safepoint_Verifier nsv;) |
kvn@1637 | 753 | nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code); |
kvn@1637 | 754 | if (code == NULL && UseCodeCacheFlushing) { |
kvn@1637 | 755 | nmethod *saved_code = CodeCache::find_and_remove_saved_code(this); |
kvn@1637 | 756 | if (saved_code != NULL) { |
kvn@1637 | 757 | methodHandle method(this); |
kvn@1637 | 758 | assert( ! saved_code->is_osr_method(), "should not get here for osr" ); |
kvn@1637 | 759 | set_code( method, saved_code ); |
kvn@1637 | 760 | } |
kvn@1637 | 761 | } |
kvn@1637 | 762 | |
duke@435 | 763 | assert(_from_compiled_entry != NULL, "must be set"); |
duke@435 | 764 | return _from_compiled_entry; |
duke@435 | 765 | } |
duke@435 | 766 | |
duke@435 | 767 | // Check that if an nmethod ref exists, it has a backlink to this or no backlink at all |
duke@435 | 768 | // (could be racing a deopt). |
duke@435 | 769 | // Not inline to avoid circular ref. |
duke@435 | 770 | bool methodOopDesc::check_code() const { |
duke@435 | 771 | // cached in a register or local. There's a race on the value of the field. |
duke@435 | 772 | nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code); |
duke@435 | 773 | return code == NULL || (code->method() == NULL) || (code->method() == (methodOop)this && !code->is_osr_method()); |
duke@435 | 774 | } |
duke@435 | 775 | |
duke@435 | 776 | // Install compiled code. Instantly it can execute. |
duke@435 | 777 | void methodOopDesc::set_code(methodHandle mh, nmethod *code) { |
duke@435 | 778 | assert( code, "use clear_code to remove code" ); |
duke@435 | 779 | assert( mh->check_code(), "" ); |
duke@435 | 780 | |
duke@435 | 781 | guarantee(mh->adapter() != NULL, "Adapter blob must already exist!"); |
duke@435 | 782 | |
duke@435 | 783 | // These writes must happen in this order, because the interpreter will |
duke@435 | 784 | // directly jump to from_interpreted_entry which jumps to an i2c adapter |
duke@435 | 785 | // which jumps to _from_compiled_entry. |
duke@435 | 786 | mh->_code = code; // Assign before allowing compiled code to exec |
duke@435 | 787 | |
duke@435 | 788 | int comp_level = code->comp_level(); |
duke@435 | 789 | // In theory there could be a race here. In practice it is unlikely |
duke@435 | 790 | // and not worth worrying about. |
iveresov@2138 | 791 | if (comp_level > mh->highest_comp_level()) { |
iveresov@2138 | 792 | mh->set_highest_comp_level(comp_level); |
duke@435 | 793 | } |
duke@435 | 794 | |
duke@435 | 795 | OrderAccess::storestore(); |
twisti@2047 | 796 | #ifdef SHARK |
twisti@2200 | 797 | mh->_from_interpreted_entry = code->insts_begin(); |
twisti@2047 | 798 | #else |
duke@435 | 799 | mh->_from_compiled_entry = code->verified_entry_point(); |
duke@435 | 800 | OrderAccess::storestore(); |
duke@435 | 801 | // Instantly compiled code can execute. |
duke@435 | 802 | mh->_from_interpreted_entry = mh->get_i2c_entry(); |
twisti@2047 | 803 | #endif // SHARK |
duke@435 | 804 | |
duke@435 | 805 | } |
duke@435 | 806 | |
duke@435 | 807 | |
duke@435 | 808 | bool methodOopDesc::is_overridden_in(klassOop k) const { |
duke@435 | 809 | instanceKlass* ik = instanceKlass::cast(k); |
duke@435 | 810 | |
duke@435 | 811 | if (ik->is_interface()) return false; |
duke@435 | 812 | |
duke@435 | 813 | // If method is an interface, we skip it - except if it |
duke@435 | 814 | // is a miranda method |
duke@435 | 815 | if (instanceKlass::cast(method_holder())->is_interface()) { |
duke@435 | 816 | // Check that method is not a miranda method |
duke@435 | 817 | if (ik->lookup_method(name(), signature()) == NULL) { |
duke@435 | 818 | // No implementation exist - so miranda method |
duke@435 | 819 | return false; |
duke@435 | 820 | } |
duke@435 | 821 | return true; |
duke@435 | 822 | } |
duke@435 | 823 | |
duke@435 | 824 | assert(ik->is_subclass_of(method_holder()), "should be subklass"); |
duke@435 | 825 | assert(ik->vtable() != NULL, "vtable should exist"); |
duke@435 | 826 | if (vtable_index() == nonvirtual_vtable_index) { |
duke@435 | 827 | return false; |
duke@435 | 828 | } else { |
duke@435 | 829 | methodOop vt_m = ik->method_at_vtable(vtable_index()); |
duke@435 | 830 | return vt_m != methodOop(this); |
duke@435 | 831 | } |
duke@435 | 832 | } |
duke@435 | 833 | |
duke@435 | 834 | |
dcubed@483 | 835 | // give advice about whether this methodOop should be cached or not |
dcubed@483 | 836 | bool methodOopDesc::should_not_be_cached() const { |
dcubed@483 | 837 | if (is_old()) { |
dcubed@483 | 838 | // This method has been redefined. It is either EMCP or obsolete |
dcubed@483 | 839 | // and we don't want to cache it because that would pin the method |
dcubed@483 | 840 | // down and prevent it from being collectible if and when it |
dcubed@483 | 841 | // finishes executing. |
dcubed@483 | 842 | return true; |
dcubed@483 | 843 | } |
dcubed@483 | 844 | |
dcubed@483 | 845 | if (mark()->should_not_be_cached()) { |
dcubed@483 | 846 | // It is either not safe or not a good idea to cache this |
dcubed@483 | 847 | // method at this time because of the state of the embedded |
dcubed@483 | 848 | // markOop. See markOop.cpp for the gory details. |
dcubed@483 | 849 | return true; |
dcubed@483 | 850 | } |
dcubed@483 | 851 | |
dcubed@483 | 852 | // caching this method should be just fine |
dcubed@483 | 853 | return false; |
dcubed@483 | 854 | } |
dcubed@483 | 855 | |
jrose@1862 | 856 | bool methodOopDesc::is_method_handle_invoke_name(vmSymbols::SID name_sid) { |
jrose@1862 | 857 | switch (name_sid) { |
jrose@1862 | 858 | case vmSymbols::VM_SYMBOL_ENUM_NAME(invokeExact_name): |
jrose@2742 | 859 | case vmSymbols::VM_SYMBOL_ENUM_NAME(invoke_name): |
jrose@1862 | 860 | return true; |
jrose@1862 | 861 | } |
jrose@2742 | 862 | if (AllowInvokeGeneric |
jrose@2742 | 863 | && name_sid == vmSymbols::VM_SYMBOL_ENUM_NAME(invokeGeneric_name)) |
jrose@2148 | 864 | return true; |
jrose@1862 | 865 | return false; |
jrose@1862 | 866 | } |
jrose@1862 | 867 | |
jrose@1145 | 868 | // Constant pool structure for invoke methods: |
jrose@1145 | 869 | enum { |
jrose@1862 | 870 | _imcp_invoke_name = 1, // utf8: 'invokeExact' or 'invokeGeneric' |
coleenp@2497 | 871 | _imcp_invoke_signature, // utf8: (variable Symbol*) |
jrose@2639 | 872 | _imcp_method_type_value, // string: (variable java/lang/invoke/MethodType, sic) |
jrose@1145 | 873 | _imcp_limit |
jrose@1145 | 874 | }; |
jrose@1145 | 875 | |
jrose@1145 | 876 | oop methodOopDesc::method_handle_type() const { |
jrose@1145 | 877 | if (!is_method_handle_invoke()) { assert(false, "caller resp."); return NULL; } |
jrose@1145 | 878 | oop mt = constants()->resolved_string_at(_imcp_method_type_value); |
jrose@1145 | 879 | assert(mt->klass() == SystemDictionary::MethodType_klass(), ""); |
jrose@1145 | 880 | return mt; |
jrose@1145 | 881 | } |
jrose@1145 | 882 | |
jrose@1145 | 883 | jint* methodOopDesc::method_type_offsets_chain() { |
jrose@1145 | 884 | static jint pchase[] = { -1, -1, -1 }; |
jrose@1145 | 885 | if (pchase[0] == -1) { |
jrose@1145 | 886 | jint step0 = in_bytes(constants_offset()); |
jrose@1145 | 887 | jint step1 = (constantPoolOopDesc::header_size() + _imcp_method_type_value) * HeapWordSize; |
jrose@1145 | 888 | // do this in reverse to avoid races: |
jrose@1145 | 889 | OrderAccess::release_store(&pchase[1], step1); |
jrose@1145 | 890 | OrderAccess::release_store(&pchase[0], step0); |
jrose@1145 | 891 | } |
jrose@1145 | 892 | return pchase; |
jrose@1145 | 893 | } |
jrose@1145 | 894 | |
twisti@1587 | 895 | //------------------------------------------------------------------------------ |
twisti@1587 | 896 | // methodOopDesc::is_method_handle_adapter |
twisti@1587 | 897 | // |
twisti@1587 | 898 | // Tests if this method is an internal adapter frame from the |
twisti@1587 | 899 | // MethodHandleCompiler. |
jrose@1862 | 900 | // Must be consistent with MethodHandleCompiler::get_method_oop(). |
twisti@1587 | 901 | bool methodOopDesc::is_method_handle_adapter() const { |
jrose@2017 | 902 | if (is_synthetic() && |
jrose@2017 | 903 | !is_native() && // has code from MethodHandleCompiler |
jrose@2017 | 904 | is_method_handle_invoke_name(name()) && |
jrose@2017 | 905 | MethodHandleCompiler::klass_is_method_handle_adapter_holder(method_holder())) { |
jrose@2017 | 906 | assert(!is_method_handle_invoke(), "disjoint"); |
jrose@2017 | 907 | return true; |
jrose@2017 | 908 | } else { |
jrose@2017 | 909 | return false; |
jrose@2017 | 910 | } |
twisti@1587 | 911 | } |
twisti@1587 | 912 | |
jrose@1145 | 913 | methodHandle methodOopDesc::make_invoke_method(KlassHandle holder, |
coleenp@2497 | 914 | Symbol* name, |
coleenp@2497 | 915 | Symbol* signature, |
jrose@1145 | 916 | Handle method_type, TRAPS) { |
never@3091 | 917 | ResourceMark rm; |
jrose@1145 | 918 | methodHandle empty; |
jrose@1145 | 919 | |
jrose@1145 | 920 | assert(holder() == SystemDictionary::MethodHandle_klass(), |
jrose@1145 | 921 | "must be a JSR 292 magic type"); |
jrose@1145 | 922 | |
jrose@1145 | 923 | if (TraceMethodHandles) { |
jrose@1145 | 924 | tty->print("Creating invoke method for "); |
jrose@1145 | 925 | signature->print_value(); |
jrose@1145 | 926 | tty->cr(); |
jrose@1145 | 927 | } |
jrose@1145 | 928 | |
jrose@2760 | 929 | // invariant: cp->symbol_at_put is preceded by a refcount increment (more usually a lookup) |
jrose@2760 | 930 | name->increment_refcount(); |
jrose@2760 | 931 | signature->increment_refcount(); |
jrose@2760 | 932 | |
jrose@2982 | 933 | // record non-BCP method types in the constant pool |
jrose@2982 | 934 | GrowableArray<KlassHandle>* extra_klasses = NULL; |
jrose@2982 | 935 | for (int i = -1, len = java_lang_invoke_MethodType::ptype_count(method_type()); i < len; i++) { |
jrose@2982 | 936 | oop ptype = (i == -1 |
jrose@2982 | 937 | ? java_lang_invoke_MethodType::rtype(method_type()) |
jrose@2982 | 938 | : java_lang_invoke_MethodType::ptype(method_type(), i)); |
jrose@2982 | 939 | klassOop klass = check_non_bcp_klass(java_lang_Class::as_klassOop(ptype)); |
jrose@2982 | 940 | if (klass != NULL) { |
jrose@2982 | 941 | if (extra_klasses == NULL) |
jrose@2982 | 942 | extra_klasses = new GrowableArray<KlassHandle>(len+1); |
jrose@2982 | 943 | bool dup = false; |
jrose@2982 | 944 | for (int j = 0; j < extra_klasses->length(); j++) { |
jrose@2982 | 945 | if (extra_klasses->at(j) == klass) { dup = true; break; } |
jrose@2982 | 946 | } |
jrose@2982 | 947 | if (!dup) |
jrose@2982 | 948 | extra_klasses->append(KlassHandle(THREAD, klass)); |
jrose@2982 | 949 | } |
jrose@2982 | 950 | } |
jrose@2982 | 951 | |
jrose@2982 | 952 | int extra_klass_count = (extra_klasses == NULL ? 0 : extra_klasses->length()); |
jrose@2982 | 953 | int cp_length = _imcp_limit + extra_klass_count; |
jrose@1145 | 954 | constantPoolHandle cp; |
jrose@1145 | 955 | { |
jrose@2982 | 956 | constantPoolOop cp_oop = oopFactory::new_constantPool(cp_length, IsSafeConc, CHECK_(empty)); |
jrose@1145 | 957 | cp = constantPoolHandle(THREAD, cp_oop); |
jrose@1145 | 958 | } |
coleenp@2497 | 959 | cp->symbol_at_put(_imcp_invoke_name, name); |
coleenp@2497 | 960 | cp->symbol_at_put(_imcp_invoke_signature, signature); |
coleenp@2497 | 961 | cp->string_at_put(_imcp_method_type_value, Universe::the_null_string()); |
jrose@2982 | 962 | for (int j = 0; j < extra_klass_count; j++) { |
jrose@2982 | 963 | KlassHandle klass = extra_klasses->at(j); |
jrose@2982 | 964 | cp->klass_at_put(_imcp_limit + j, klass()); |
jrose@2982 | 965 | } |
jrose@2982 | 966 | cp->set_preresolution(); |
jrose@1145 | 967 | cp->set_pool_holder(holder()); |
jrose@1145 | 968 | |
jrose@1145 | 969 | // set up the fancy stuff: |
jrose@1145 | 970 | cp->pseudo_string_at_put(_imcp_method_type_value, method_type()); |
jrose@1145 | 971 | methodHandle m; |
jrose@1145 | 972 | { |
jrose@1145 | 973 | int flags_bits = (JVM_MH_INVOKE_BITS | JVM_ACC_PUBLIC | JVM_ACC_FINAL); |
jrose@1145 | 974 | methodOop m_oop = oopFactory::new_method(0, accessFlags_from(flags_bits), |
jrose@1145 | 975 | 0, 0, 0, IsSafeConc, CHECK_(empty)); |
jrose@1145 | 976 | m = methodHandle(THREAD, m_oop); |
jrose@1145 | 977 | } |
jrose@1145 | 978 | m->set_constants(cp()); |
jrose@1145 | 979 | m->set_name_index(_imcp_invoke_name); |
jrose@1145 | 980 | m->set_signature_index(_imcp_invoke_signature); |
jrose@1862 | 981 | assert(is_method_handle_invoke_name(m->name()), ""); |
coleenp@2497 | 982 | assert(m->signature() == signature, ""); |
jrose@2148 | 983 | assert(m->is_method_handle_invoke(), ""); |
jrose@1145 | 984 | #ifdef CC_INTERP |
twisti@2563 | 985 | ResultTypeFinder rtf(signature); |
jrose@1145 | 986 | m->set_result_index(rtf.type()); |
jrose@1145 | 987 | #endif |
jrose@1145 | 988 | m->compute_size_of_parameters(THREAD); |
jrose@1145 | 989 | m->set_exception_table(Universe::the_empty_int_array()); |
jrose@2148 | 990 | m->init_intrinsic_id(); |
jrose@2148 | 991 | assert(m->intrinsic_id() == vmIntrinsics::_invokeExact || |
jrose@2148 | 992 | m->intrinsic_id() == vmIntrinsics::_invokeGeneric, "must be an invoker"); |
jrose@1145 | 993 | |
jrose@1145 | 994 | // Finally, set up its entry points. |
jrose@1145 | 995 | assert(m->method_handle_type() == method_type(), ""); |
jrose@1145 | 996 | assert(m->can_be_statically_bound(), ""); |
jrose@1145 | 997 | m->set_vtable_index(methodOopDesc::nonvirtual_vtable_index); |
jrose@1145 | 998 | m->link_method(m, CHECK_(empty)); |
jrose@1145 | 999 | |
jrose@1145 | 1000 | #ifdef ASSERT |
jrose@1145 | 1001 | // Make sure the pointer chase works. |
jrose@1145 | 1002 | address p = (address) m(); |
jrose@1145 | 1003 | for (jint* pchase = method_type_offsets_chain(); (*pchase) != -1; pchase++) { |
jrose@1145 | 1004 | p = *(address*)(p + (*pchase)); |
jrose@1145 | 1005 | } |
jrose@1145 | 1006 | assert((oop)p == method_type(), "pointer chase is correct"); |
jrose@1145 | 1007 | #endif |
jrose@1145 | 1008 | |
jrose@1474 | 1009 | if (TraceMethodHandles && (Verbose || WizardMode)) |
jrose@1145 | 1010 | m->print_on(tty); |
jrose@1145 | 1011 | |
jrose@1145 | 1012 | return m; |
jrose@1145 | 1013 | } |
jrose@1145 | 1014 | |
jrose@2982 | 1015 | klassOop methodOopDesc::check_non_bcp_klass(klassOop klass) { |
jrose@2982 | 1016 | if (klass != NULL && Klass::cast(klass)->class_loader() != NULL) { |
jrose@2982 | 1017 | if (Klass::cast(klass)->oop_is_objArray()) |
jrose@2982 | 1018 | klass = objArrayKlass::cast(klass)->bottom_klass(); |
jrose@2982 | 1019 | return klass; |
jrose@2982 | 1020 | } |
jrose@2982 | 1021 | return NULL; |
jrose@2982 | 1022 | } |
jrose@1145 | 1023 | |
dcubed@483 | 1024 | |
duke@435 | 1025 | methodHandle methodOopDesc:: clone_with_new_data(methodHandle m, u_char* new_code, int new_code_length, |
duke@435 | 1026 | u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS) { |
duke@435 | 1027 | // Code below does not work for native methods - they should never get rewritten anyway |
duke@435 | 1028 | assert(!m->is_native(), "cannot rewrite native methods"); |
duke@435 | 1029 | // Allocate new methodOop |
duke@435 | 1030 | AccessFlags flags = m->access_flags(); |
duke@435 | 1031 | int checked_exceptions_len = m->checked_exceptions_length(); |
duke@435 | 1032 | int localvariable_len = m->localvariable_table_length(); |
jmasa@953 | 1033 | // Allocate newm_oop with the is_conc_safe parameter set |
jmasa@953 | 1034 | // to IsUnsafeConc to indicate that newm_oop is not yet |
jmasa@953 | 1035 | // safe for concurrent processing by a GC. |
jmasa@953 | 1036 | methodOop newm_oop = oopFactory::new_method(new_code_length, |
jmasa@953 | 1037 | flags, |
jmasa@953 | 1038 | new_compressed_linenumber_size, |
jmasa@953 | 1039 | localvariable_len, |
jmasa@953 | 1040 | checked_exceptions_len, |
jmasa@953 | 1041 | IsUnsafeConc, |
jmasa@953 | 1042 | CHECK_(methodHandle())); |
duke@435 | 1043 | methodHandle newm (THREAD, newm_oop); |
ysr@2533 | 1044 | NOT_PRODUCT(int nmsz = newm->is_parsable() ? newm->size() : -1;) |
duke@435 | 1045 | int new_method_size = newm->method_size(); |
duke@435 | 1046 | // Create a shallow copy of methodOopDesc part, but be careful to preserve the new constMethodOop |
duke@435 | 1047 | constMethodOop newcm = newm->constMethod(); |
ysr@2533 | 1048 | NOT_PRODUCT(int ncmsz = newcm->is_parsable() ? newcm->size() : -1;) |
duke@435 | 1049 | int new_const_method_size = newm->constMethod()->object_size(); |
jmasa@953 | 1050 | |
duke@435 | 1051 | memcpy(newm(), m(), sizeof(methodOopDesc)); |
duke@435 | 1052 | // Create shallow copy of constMethodOopDesc, but be careful to preserve the methodOop |
jmasa@953 | 1053 | // is_conc_safe is set to false because that is the value of |
jmasa@953 | 1054 | // is_conc_safe initialzied into newcm and the copy should |
jmasa@953 | 1055 | // not overwrite that value. During the window during which it is |
jmasa@953 | 1056 | // tagged as unsafe, some extra work could be needed during precleaning |
jmasa@953 | 1057 | // or concurrent marking but those phases will be correct. Setting and |
jmasa@953 | 1058 | // resetting is done in preference to a careful copying into newcm to |
jmasa@953 | 1059 | // avoid having to know the precise layout of a constMethodOop. |
ysr@2533 | 1060 | m->constMethod()->set_is_conc_safe(oopDesc::IsUnsafeConc); |
ysr@2533 | 1061 | assert(m->constMethod()->is_parsable(), "Should remain parsable"); |
ysr@2533 | 1062 | |
ysr@2533 | 1063 | // NOTE: this is a reachable object that transiently signals "conc_unsafe" |
ysr@2533 | 1064 | // However, no allocations are done during this window |
ysr@2533 | 1065 | // during which it is tagged conc_unsafe, so we are assured that any concurrent |
ysr@2533 | 1066 | // thread will not wait forever for the object to revert to "conc_safe". |
ysr@2533 | 1067 | // Further, any such conc_unsafe object will indicate a stable size |
ysr@2533 | 1068 | // through the transition. |
duke@435 | 1069 | memcpy(newcm, m->constMethod(), sizeof(constMethodOopDesc)); |
ysr@2533 | 1070 | m->constMethod()->set_is_conc_safe(oopDesc::IsSafeConc); |
ysr@2533 | 1071 | assert(m->constMethod()->is_parsable(), "Should remain parsable"); |
ysr@2533 | 1072 | |
duke@435 | 1073 | // Reset correct method/const method, method size, and parameter info |
duke@435 | 1074 | newcm->set_method(newm()); |
duke@435 | 1075 | newm->set_constMethod(newcm); |
duke@435 | 1076 | assert(newcm->method() == newm(), "check"); |
duke@435 | 1077 | newm->constMethod()->set_code_size(new_code_length); |
duke@435 | 1078 | newm->constMethod()->set_constMethod_size(new_const_method_size); |
duke@435 | 1079 | newm->set_method_size(new_method_size); |
duke@435 | 1080 | assert(newm->code_size() == new_code_length, "check"); |
duke@435 | 1081 | assert(newm->checked_exceptions_length() == checked_exceptions_len, "check"); |
duke@435 | 1082 | assert(newm->localvariable_table_length() == localvariable_len, "check"); |
duke@435 | 1083 | // Copy new byte codes |
duke@435 | 1084 | memcpy(newm->code_base(), new_code, new_code_length); |
duke@435 | 1085 | // Copy line number table |
duke@435 | 1086 | if (new_compressed_linenumber_size > 0) { |
duke@435 | 1087 | memcpy(newm->compressed_linenumber_table(), |
duke@435 | 1088 | new_compressed_linenumber_table, |
duke@435 | 1089 | new_compressed_linenumber_size); |
duke@435 | 1090 | } |
duke@435 | 1091 | // Copy checked_exceptions |
duke@435 | 1092 | if (checked_exceptions_len > 0) { |
duke@435 | 1093 | memcpy(newm->checked_exceptions_start(), |
duke@435 | 1094 | m->checked_exceptions_start(), |
duke@435 | 1095 | checked_exceptions_len * sizeof(CheckedExceptionElement)); |
duke@435 | 1096 | } |
duke@435 | 1097 | // Copy local variable number table |
duke@435 | 1098 | if (localvariable_len > 0) { |
duke@435 | 1099 | memcpy(newm->localvariable_table_start(), |
duke@435 | 1100 | m->localvariable_table_start(), |
duke@435 | 1101 | localvariable_len * sizeof(LocalVariableTableElement)); |
duke@435 | 1102 | } |
jmasa@953 | 1103 | |
jmasa@953 | 1104 | // Only set is_conc_safe to true when changes to newcm are |
jmasa@953 | 1105 | // complete. |
ysr@2533 | 1106 | assert(!newm->is_parsable() || nmsz < 0 || newm->size() == nmsz, "newm->size() inconsistency"); |
ysr@2533 | 1107 | assert(!newcm->is_parsable() || ncmsz < 0 || newcm->size() == ncmsz, "newcm->size() inconsistency"); |
jmasa@953 | 1108 | newcm->set_is_conc_safe(true); |
duke@435 | 1109 | return newm; |
duke@435 | 1110 | } |
duke@435 | 1111 | |
jrose@1291 | 1112 | vmSymbols::SID methodOopDesc::klass_id_for_intrinsics(klassOop holder) { |
duke@435 | 1113 | // if loader is not the default loader (i.e., != NULL), we can't know the intrinsics |
duke@435 | 1114 | // because we are not loading from core libraries |
jrose@1291 | 1115 | if (instanceKlass::cast(holder)->class_loader() != NULL) |
jrose@1291 | 1116 | return vmSymbols::NO_SID; // regardless of name, no intrinsics here |
duke@435 | 1117 | |
duke@435 | 1118 | // see if the klass name is well-known: |
coleenp@2497 | 1119 | Symbol* klass_name = instanceKlass::cast(holder)->name(); |
jrose@1291 | 1120 | return vmSymbols::find_sid(klass_name); |
jrose@1291 | 1121 | } |
jrose@1291 | 1122 | |
jrose@1291 | 1123 | void methodOopDesc::init_intrinsic_id() { |
jrose@1291 | 1124 | assert(_intrinsic_id == vmIntrinsics::_none, "do this just once"); |
jrose@1291 | 1125 | const uintptr_t max_id_uint = right_n_bits((int)(sizeof(_intrinsic_id) * BitsPerByte)); |
jrose@1291 | 1126 | assert((uintptr_t)vmIntrinsics::ID_LIMIT <= max_id_uint, "else fix size"); |
jrose@2148 | 1127 | assert(intrinsic_id_size_in_bytes() == sizeof(_intrinsic_id), ""); |
jrose@1291 | 1128 | |
jrose@1291 | 1129 | // the klass name is well-known: |
jrose@1291 | 1130 | vmSymbols::SID klass_id = klass_id_for_intrinsics(method_holder()); |
jrose@1291 | 1131 | assert(klass_id != vmSymbols::NO_SID, "caller responsibility"); |
duke@435 | 1132 | |
duke@435 | 1133 | // ditto for method and signature: |
duke@435 | 1134 | vmSymbols::SID name_id = vmSymbols::find_sid(name()); |
jrose@2148 | 1135 | if (name_id == vmSymbols::NO_SID) return; |
duke@435 | 1136 | vmSymbols::SID sig_id = vmSymbols::find_sid(signature()); |
jrose@2639 | 1137 | if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle) |
jrose@2148 | 1138 | && sig_id == vmSymbols::NO_SID) return; |
duke@435 | 1139 | jshort flags = access_flags().as_short(); |
duke@435 | 1140 | |
jrose@1291 | 1141 | vmIntrinsics::ID id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags); |
jrose@1291 | 1142 | if (id != vmIntrinsics::_none) { |
jrose@1291 | 1143 | set_intrinsic_id(id); |
jrose@1291 | 1144 | return; |
jrose@1291 | 1145 | } |
jrose@1291 | 1146 | |
duke@435 | 1147 | // A few slightly irregular cases: |
duke@435 | 1148 | switch (klass_id) { |
duke@435 | 1149 | case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_StrictMath): |
duke@435 | 1150 | // Second chance: check in regular Math. |
duke@435 | 1151 | switch (name_id) { |
duke@435 | 1152 | case vmSymbols::VM_SYMBOL_ENUM_NAME(min_name): |
duke@435 | 1153 | case vmSymbols::VM_SYMBOL_ENUM_NAME(max_name): |
duke@435 | 1154 | case vmSymbols::VM_SYMBOL_ENUM_NAME(sqrt_name): |
duke@435 | 1155 | // pretend it is the corresponding method in the non-strict class: |
duke@435 | 1156 | klass_id = vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_Math); |
jrose@1291 | 1157 | id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags); |
duke@435 | 1158 | break; |
duke@435 | 1159 | } |
jrose@1862 | 1160 | break; |
jrose@1862 | 1161 | |
jrose@1862 | 1162 | // Signature-polymorphic methods: MethodHandle.invoke*, InvokeDynamic.*. |
jrose@2639 | 1163 | case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle): |
jrose@1862 | 1164 | if (is_static() || !is_native()) break; |
jrose@1862 | 1165 | switch (name_id) { |
jrose@1862 | 1166 | case vmSymbols::VM_SYMBOL_ENUM_NAME(invokeGeneric_name): |
jrose@2742 | 1167 | if (!AllowInvokeGeneric) break; |
jrose@2742 | 1168 | case vmSymbols::VM_SYMBOL_ENUM_NAME(invoke_name): |
jrose@2148 | 1169 | id = vmIntrinsics::_invokeGeneric; |
jrose@2148 | 1170 | break; |
jrose@2148 | 1171 | case vmSymbols::VM_SYMBOL_ENUM_NAME(invokeExact_name): |
jrose@2148 | 1172 | id = vmIntrinsics::_invokeExact; |
jrose@2148 | 1173 | break; |
jrose@1862 | 1174 | } |
jrose@1862 | 1175 | break; |
jrose@2639 | 1176 | case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_InvokeDynamic): |
jrose@1862 | 1177 | if (!is_static() || !is_native()) break; |
jrose@1862 | 1178 | id = vmIntrinsics::_invokeDynamic; |
jrose@1862 | 1179 | break; |
duke@435 | 1180 | } |
duke@435 | 1181 | |
jrose@1291 | 1182 | if (id != vmIntrinsics::_none) { |
jrose@1291 | 1183 | // Set up its iid. It is an alias method. |
jrose@1291 | 1184 | set_intrinsic_id(id); |
jrose@1291 | 1185 | return; |
jrose@1291 | 1186 | } |
duke@435 | 1187 | } |
duke@435 | 1188 | |
duke@435 | 1189 | // These two methods are static since a GC may move the methodOopDesc |
duke@435 | 1190 | bool methodOopDesc::load_signature_classes(methodHandle m, TRAPS) { |
duke@435 | 1191 | bool sig_is_loaded = true; |
duke@435 | 1192 | Handle class_loader(THREAD, instanceKlass::cast(m->method_holder())->class_loader()); |
duke@435 | 1193 | Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain()); |
coleenp@2497 | 1194 | ResourceMark rm(THREAD); |
coleenp@2497 | 1195 | Symbol* signature = m->signature(); |
duke@435 | 1196 | for(SignatureStream ss(signature); !ss.is_done(); ss.next()) { |
duke@435 | 1197 | if (ss.is_object()) { |
coleenp@2497 | 1198 | Symbol* sym = ss.as_symbol(CHECK_(false)); |
coleenp@2497 | 1199 | Symbol* name = sym; |
duke@435 | 1200 | klassOop klass = SystemDictionary::resolve_or_null(name, class_loader, |
duke@435 | 1201 | protection_domain, THREAD); |
rasbold@539 | 1202 | // We are loading classes eagerly. If a ClassNotFoundException or |
rasbold@539 | 1203 | // a LinkageError was generated, be sure to ignore it. |
duke@435 | 1204 | if (HAS_PENDING_EXCEPTION) { |
never@1577 | 1205 | if (PENDING_EXCEPTION->is_a(SystemDictionary::ClassNotFoundException_klass()) || |
never@1577 | 1206 | PENDING_EXCEPTION->is_a(SystemDictionary::LinkageError_klass())) { |
duke@435 | 1207 | CLEAR_PENDING_EXCEPTION; |
duke@435 | 1208 | } else { |
duke@435 | 1209 | return false; |
duke@435 | 1210 | } |
duke@435 | 1211 | } |
duke@435 | 1212 | if( klass == NULL) { sig_is_loaded = false; } |
duke@435 | 1213 | } |
duke@435 | 1214 | } |
duke@435 | 1215 | return sig_is_loaded; |
duke@435 | 1216 | } |
duke@435 | 1217 | |
duke@435 | 1218 | bool methodOopDesc::has_unloaded_classes_in_signature(methodHandle m, TRAPS) { |
duke@435 | 1219 | Handle class_loader(THREAD, instanceKlass::cast(m->method_holder())->class_loader()); |
duke@435 | 1220 | Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain()); |
coleenp@2497 | 1221 | ResourceMark rm(THREAD); |
coleenp@2497 | 1222 | Symbol* signature = m->signature(); |
duke@435 | 1223 | for(SignatureStream ss(signature); !ss.is_done(); ss.next()) { |
duke@435 | 1224 | if (ss.type() == T_OBJECT) { |
coleenp@2497 | 1225 | Symbol* name = ss.as_symbol_or_null(); |
coleenp@2497 | 1226 | if (name == NULL) return true; |
duke@435 | 1227 | klassOop klass = SystemDictionary::find(name, class_loader, protection_domain, THREAD); |
duke@435 | 1228 | if (klass == NULL) return true; |
duke@435 | 1229 | } |
duke@435 | 1230 | } |
duke@435 | 1231 | return false; |
duke@435 | 1232 | } |
duke@435 | 1233 | |
duke@435 | 1234 | // Exposed so field engineers can debug VM |
duke@435 | 1235 | void methodOopDesc::print_short_name(outputStream* st) { |
duke@435 | 1236 | ResourceMark rm; |
duke@435 | 1237 | #ifdef PRODUCT |
duke@435 | 1238 | st->print(" %s::", method_holder()->klass_part()->external_name()); |
duke@435 | 1239 | #else |
duke@435 | 1240 | st->print(" %s::", method_holder()->klass_part()->internal_name()); |
duke@435 | 1241 | #endif |
duke@435 | 1242 | name()->print_symbol_on(st); |
duke@435 | 1243 | if (WizardMode) signature()->print_symbol_on(st); |
duke@435 | 1244 | } |
duke@435 | 1245 | |
duke@435 | 1246 | // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array |
duke@435 | 1247 | static void reorder_based_on_method_index(objArrayOop methods, |
duke@435 | 1248 | objArrayOop annotations, |
coleenp@548 | 1249 | GrowableArray<oop>* temp_array) { |
duke@435 | 1250 | if (annotations == NULL) { |
duke@435 | 1251 | return; |
duke@435 | 1252 | } |
duke@435 | 1253 | |
duke@435 | 1254 | int length = methods->length(); |
duke@435 | 1255 | int i; |
duke@435 | 1256 | // Copy to temp array |
coleenp@548 | 1257 | temp_array->clear(); |
coleenp@548 | 1258 | for (i = 0; i < length; i++) { |
coleenp@548 | 1259 | temp_array->append(annotations->obj_at(i)); |
coleenp@548 | 1260 | } |
duke@435 | 1261 | |
duke@435 | 1262 | // Copy back using old method indices |
duke@435 | 1263 | for (i = 0; i < length; i++) { |
duke@435 | 1264 | methodOop m = (methodOop) methods->obj_at(i); |
coleenp@548 | 1265 | annotations->obj_at_put(i, temp_array->at(m->method_idnum())); |
duke@435 | 1266 | } |
duke@435 | 1267 | } |
duke@435 | 1268 | |
brutisso@2976 | 1269 | // Comparer for sorting an object array containing |
brutisso@2976 | 1270 | // methodOops. |
kvn@3128 | 1271 | // Used non-template method_comparator methods since |
kvn@3128 | 1272 | // Visual Studio 2003 compiler generates incorrect |
kvn@3128 | 1273 | // optimized code for it. |
kvn@3128 | 1274 | static int method_comparator_narrowOop(narrowOop a, narrowOop b) { |
brutisso@2976 | 1275 | methodOop m = (methodOop)oopDesc::decode_heap_oop_not_null(a); |
brutisso@2976 | 1276 | methodOop n = (methodOop)oopDesc::decode_heap_oop_not_null(b); |
brutisso@2976 | 1277 | return m->name()->fast_compare(n->name()); |
brutisso@2976 | 1278 | } |
kvn@3128 | 1279 | static int method_comparator_oop(oop a, oop b) { |
kvn@3128 | 1280 | methodOop m = (methodOop)a; |
kvn@3128 | 1281 | methodOop n = (methodOop)b; |
kvn@3128 | 1282 | return m->name()->fast_compare(n->name()); |
kvn@3128 | 1283 | } |
duke@435 | 1284 | |
duke@435 | 1285 | // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array |
duke@435 | 1286 | void methodOopDesc::sort_methods(objArrayOop methods, |
duke@435 | 1287 | objArrayOop methods_annotations, |
duke@435 | 1288 | objArrayOop methods_parameter_annotations, |
duke@435 | 1289 | objArrayOop methods_default_annotations, |
duke@435 | 1290 | bool idempotent) { |
duke@435 | 1291 | int length = methods->length(); |
duke@435 | 1292 | if (length > 1) { |
duke@435 | 1293 | bool do_annotations = false; |
duke@435 | 1294 | if (methods_annotations != NULL || |
duke@435 | 1295 | methods_parameter_annotations != NULL || |
duke@435 | 1296 | methods_default_annotations != NULL) { |
duke@435 | 1297 | do_annotations = true; |
duke@435 | 1298 | } |
duke@435 | 1299 | if (do_annotations) { |
duke@435 | 1300 | // Remember current method ordering so we can reorder annotations |
duke@435 | 1301 | for (int i = 0; i < length; i++) { |
duke@435 | 1302 | methodOop m = (methodOop) methods->obj_at(i); |
duke@435 | 1303 | m->set_method_idnum(i); |
duke@435 | 1304 | } |
duke@435 | 1305 | } |
brutisso@2976 | 1306 | { |
brutisso@2976 | 1307 | No_Safepoint_Verifier nsv; |
brutisso@2976 | 1308 | if (UseCompressedOops) { |
kvn@3128 | 1309 | QuickSort::sort<narrowOop>((narrowOop*)(methods->base()), length, method_comparator_narrowOop, idempotent); |
brutisso@2976 | 1310 | } else { |
kvn@3128 | 1311 | QuickSort::sort<oop>((oop*)(methods->base()), length, method_comparator_oop, idempotent); |
duke@435 | 1312 | } |
brutisso@2976 | 1313 | if (UseConcMarkSweepGC) { |
brutisso@2976 | 1314 | // For CMS we need to dirty the cards for the array |
brutisso@2976 | 1315 | BarrierSet* bs = Universe::heap()->barrier_set(); |
brutisso@2976 | 1316 | assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); |
brutisso@2976 | 1317 | bs->write_ref_array(methods->base(), length); |
brutisso@2976 | 1318 | } |
duke@435 | 1319 | } |
duke@435 | 1320 | |
duke@435 | 1321 | // Sort annotations if necessary |
duke@435 | 1322 | assert(methods_annotations == NULL || methods_annotations->length() == methods->length(), ""); |
duke@435 | 1323 | assert(methods_parameter_annotations == NULL || methods_parameter_annotations->length() == methods->length(), ""); |
duke@435 | 1324 | assert(methods_default_annotations == NULL || methods_default_annotations->length() == methods->length(), ""); |
duke@435 | 1325 | if (do_annotations) { |
coleenp@548 | 1326 | ResourceMark rm; |
duke@435 | 1327 | // Allocate temporary storage |
coleenp@548 | 1328 | GrowableArray<oop>* temp_array = new GrowableArray<oop>(length); |
duke@435 | 1329 | reorder_based_on_method_index(methods, methods_annotations, temp_array); |
duke@435 | 1330 | reorder_based_on_method_index(methods, methods_parameter_annotations, temp_array); |
duke@435 | 1331 | reorder_based_on_method_index(methods, methods_default_annotations, temp_array); |
duke@435 | 1332 | } |
duke@435 | 1333 | |
duke@435 | 1334 | // Reset method ordering |
duke@435 | 1335 | for (int i = 0; i < length; i++) { |
duke@435 | 1336 | methodOop m = (methodOop) methods->obj_at(i); |
duke@435 | 1337 | m->set_method_idnum(i); |
duke@435 | 1338 | } |
duke@435 | 1339 | } |
duke@435 | 1340 | } |
duke@435 | 1341 | |
duke@435 | 1342 | |
duke@435 | 1343 | //----------------------------------------------------------------------------------- |
duke@435 | 1344 | // Non-product code |
duke@435 | 1345 | |
duke@435 | 1346 | #ifndef PRODUCT |
duke@435 | 1347 | class SignatureTypePrinter : public SignatureTypeNames { |
duke@435 | 1348 | private: |
duke@435 | 1349 | outputStream* _st; |
duke@435 | 1350 | bool _use_separator; |
duke@435 | 1351 | |
duke@435 | 1352 | void type_name(const char* name) { |
duke@435 | 1353 | if (_use_separator) _st->print(", "); |
duke@435 | 1354 | _st->print(name); |
duke@435 | 1355 | _use_separator = true; |
duke@435 | 1356 | } |
duke@435 | 1357 | |
duke@435 | 1358 | public: |
coleenp@2497 | 1359 | SignatureTypePrinter(Symbol* signature, outputStream* st) : SignatureTypeNames(signature) { |
duke@435 | 1360 | _st = st; |
duke@435 | 1361 | _use_separator = false; |
duke@435 | 1362 | } |
duke@435 | 1363 | |
duke@435 | 1364 | void print_parameters() { _use_separator = false; iterate_parameters(); } |
duke@435 | 1365 | void print_returntype() { _use_separator = false; iterate_returntype(); } |
duke@435 | 1366 | }; |
duke@435 | 1367 | |
duke@435 | 1368 | |
duke@435 | 1369 | void methodOopDesc::print_name(outputStream* st) { |
duke@435 | 1370 | Thread *thread = Thread::current(); |
duke@435 | 1371 | ResourceMark rm(thread); |
duke@435 | 1372 | SignatureTypePrinter sig(signature(), st); |
duke@435 | 1373 | st->print("%s ", is_static() ? "static" : "virtual"); |
duke@435 | 1374 | sig.print_returntype(); |
duke@435 | 1375 | st->print(" %s.", method_holder()->klass_part()->internal_name()); |
duke@435 | 1376 | name()->print_symbol_on(st); |
duke@435 | 1377 | st->print("("); |
duke@435 | 1378 | sig.print_parameters(); |
duke@435 | 1379 | st->print(")"); |
duke@435 | 1380 | } |
duke@435 | 1381 | |
duke@435 | 1382 | |
duke@435 | 1383 | void methodOopDesc::print_codes_on(outputStream* st) const { |
duke@435 | 1384 | print_codes_on(0, code_size(), st); |
duke@435 | 1385 | } |
duke@435 | 1386 | |
duke@435 | 1387 | void methodOopDesc::print_codes_on(int from, int to, outputStream* st) const { |
duke@435 | 1388 | Thread *thread = Thread::current(); |
duke@435 | 1389 | ResourceMark rm(thread); |
duke@435 | 1390 | methodHandle mh (thread, (methodOop)this); |
duke@435 | 1391 | BytecodeStream s(mh); |
duke@435 | 1392 | s.set_interval(from, to); |
duke@435 | 1393 | BytecodeTracer::set_closure(BytecodeTracer::std_closure()); |
duke@435 | 1394 | while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st); |
duke@435 | 1395 | } |
duke@435 | 1396 | #endif // not PRODUCT |
duke@435 | 1397 | |
duke@435 | 1398 | |
duke@435 | 1399 | // Simple compression of line number tables. We use a regular compressed stream, except that we compress deltas |
duke@435 | 1400 | // between (bci,line) pairs since they are smaller. If (bci delta, line delta) fits in (5-bit unsigned, 3-bit unsigned) |
duke@435 | 1401 | // we save it as one byte, otherwise we write a 0xFF escape character and use regular compression. 0x0 is used |
duke@435 | 1402 | // as end-of-stream terminator. |
duke@435 | 1403 | |
duke@435 | 1404 | void CompressedLineNumberWriteStream::write_pair_regular(int bci_delta, int line_delta) { |
duke@435 | 1405 | // bci and line number does not compress into single byte. |
duke@435 | 1406 | // Write out escape character and use regular compression for bci and line number. |
duke@435 | 1407 | write_byte((jubyte)0xFF); |
duke@435 | 1408 | write_signed_int(bci_delta); |
duke@435 | 1409 | write_signed_int(line_delta); |
duke@435 | 1410 | } |
duke@435 | 1411 | |
duke@435 | 1412 | // See comment in methodOop.hpp which explains why this exists. |
sla@2540 | 1413 | #if defined(_M_AMD64) && _MSC_VER >= 1400 |
duke@435 | 1414 | #pragma optimize("", off) |
duke@435 | 1415 | void CompressedLineNumberWriteStream::write_pair(int bci, int line) { |
duke@435 | 1416 | write_pair_inline(bci, line); |
duke@435 | 1417 | } |
duke@435 | 1418 | #pragma optimize("", on) |
duke@435 | 1419 | #endif |
duke@435 | 1420 | |
duke@435 | 1421 | CompressedLineNumberReadStream::CompressedLineNumberReadStream(u_char* buffer) : CompressedReadStream(buffer) { |
duke@435 | 1422 | _bci = 0; |
duke@435 | 1423 | _line = 0; |
duke@435 | 1424 | }; |
duke@435 | 1425 | |
duke@435 | 1426 | |
duke@435 | 1427 | bool CompressedLineNumberReadStream::read_pair() { |
duke@435 | 1428 | jubyte next = read_byte(); |
duke@435 | 1429 | // Check for terminator |
duke@435 | 1430 | if (next == 0) return false; |
duke@435 | 1431 | if (next == 0xFF) { |
duke@435 | 1432 | // Escape character, regular compression used |
duke@435 | 1433 | _bci += read_signed_int(); |
duke@435 | 1434 | _line += read_signed_int(); |
duke@435 | 1435 | } else { |
duke@435 | 1436 | // Single byte compression used |
duke@435 | 1437 | _bci += next >> 3; |
duke@435 | 1438 | _line += next & 0x7; |
duke@435 | 1439 | } |
duke@435 | 1440 | return true; |
duke@435 | 1441 | } |
duke@435 | 1442 | |
duke@435 | 1443 | |
never@2462 | 1444 | Bytecodes::Code methodOopDesc::orig_bytecode_at(int bci) const { |
duke@435 | 1445 | BreakpointInfo* bp = instanceKlass::cast(method_holder())->breakpoints(); |
duke@435 | 1446 | for (; bp != NULL; bp = bp->next()) { |
duke@435 | 1447 | if (bp->match(this, bci)) { |
duke@435 | 1448 | return bp->orig_bytecode(); |
duke@435 | 1449 | } |
duke@435 | 1450 | } |
duke@435 | 1451 | ShouldNotReachHere(); |
duke@435 | 1452 | return Bytecodes::_shouldnotreachhere; |
duke@435 | 1453 | } |
duke@435 | 1454 | |
duke@435 | 1455 | void methodOopDesc::set_orig_bytecode_at(int bci, Bytecodes::Code code) { |
duke@435 | 1456 | assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way"); |
duke@435 | 1457 | BreakpointInfo* bp = instanceKlass::cast(method_holder())->breakpoints(); |
duke@435 | 1458 | for (; bp != NULL; bp = bp->next()) { |
duke@435 | 1459 | if (bp->match(this, bci)) { |
duke@435 | 1460 | bp->set_orig_bytecode(code); |
duke@435 | 1461 | // and continue, in case there is more than one |
duke@435 | 1462 | } |
duke@435 | 1463 | } |
duke@435 | 1464 | } |
duke@435 | 1465 | |
duke@435 | 1466 | void methodOopDesc::set_breakpoint(int bci) { |
duke@435 | 1467 | instanceKlass* ik = instanceKlass::cast(method_holder()); |
duke@435 | 1468 | BreakpointInfo *bp = new BreakpointInfo(this, bci); |
duke@435 | 1469 | bp->set_next(ik->breakpoints()); |
duke@435 | 1470 | ik->set_breakpoints(bp); |
duke@435 | 1471 | // do this last: |
duke@435 | 1472 | bp->set(this); |
duke@435 | 1473 | } |
duke@435 | 1474 | |
duke@435 | 1475 | static void clear_matches(methodOop m, int bci) { |
duke@435 | 1476 | instanceKlass* ik = instanceKlass::cast(m->method_holder()); |
duke@435 | 1477 | BreakpointInfo* prev_bp = NULL; |
duke@435 | 1478 | BreakpointInfo* next_bp; |
duke@435 | 1479 | for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) { |
duke@435 | 1480 | next_bp = bp->next(); |
duke@435 | 1481 | // bci value of -1 is used to delete all breakpoints in method m (ex: clear_all_breakpoint). |
duke@435 | 1482 | if (bci >= 0 ? bp->match(m, bci) : bp->match(m)) { |
duke@435 | 1483 | // do this first: |
duke@435 | 1484 | bp->clear(m); |
duke@435 | 1485 | // unhook it |
duke@435 | 1486 | if (prev_bp != NULL) |
duke@435 | 1487 | prev_bp->set_next(next_bp); |
duke@435 | 1488 | else |
duke@435 | 1489 | ik->set_breakpoints(next_bp); |
duke@435 | 1490 | delete bp; |
duke@435 | 1491 | // When class is redefined JVMTI sets breakpoint in all versions of EMCP methods |
duke@435 | 1492 | // at same location. So we have multiple matching (method_index and bci) |
duke@435 | 1493 | // BreakpointInfo nodes in BreakpointInfo list. We should just delete one |
duke@435 | 1494 | // breakpoint for clear_breakpoint request and keep all other method versions |
duke@435 | 1495 | // BreakpointInfo for future clear_breakpoint request. |
duke@435 | 1496 | // bcivalue of -1 is used to clear all breakpoints (see clear_all_breakpoints) |
duke@435 | 1497 | // which is being called when class is unloaded. We delete all the Breakpoint |
duke@435 | 1498 | // information for all versions of method. We may not correctly restore the original |
duke@435 | 1499 | // bytecode in all method versions, but that is ok. Because the class is being unloaded |
duke@435 | 1500 | // so these methods won't be used anymore. |
duke@435 | 1501 | if (bci >= 0) { |
duke@435 | 1502 | break; |
duke@435 | 1503 | } |
duke@435 | 1504 | } else { |
duke@435 | 1505 | // This one is a keeper. |
duke@435 | 1506 | prev_bp = bp; |
duke@435 | 1507 | } |
duke@435 | 1508 | } |
duke@435 | 1509 | } |
duke@435 | 1510 | |
duke@435 | 1511 | void methodOopDesc::clear_breakpoint(int bci) { |
duke@435 | 1512 | assert(bci >= 0, ""); |
duke@435 | 1513 | clear_matches(this, bci); |
duke@435 | 1514 | } |
duke@435 | 1515 | |
duke@435 | 1516 | void methodOopDesc::clear_all_breakpoints() { |
duke@435 | 1517 | clear_matches(this, -1); |
duke@435 | 1518 | } |
duke@435 | 1519 | |
duke@435 | 1520 | |
iveresov@2138 | 1521 | int methodOopDesc::invocation_count() { |
iveresov@2138 | 1522 | if (TieredCompilation) { |
iveresov@2138 | 1523 | const methodDataOop mdo = method_data(); |
iveresov@2138 | 1524 | if (invocation_counter()->carry() || ((mdo != NULL) ? mdo->invocation_counter()->carry() : false)) { |
iveresov@2138 | 1525 | return InvocationCounter::count_limit; |
iveresov@2138 | 1526 | } else { |
iveresov@2138 | 1527 | return invocation_counter()->count() + ((mdo != NULL) ? mdo->invocation_counter()->count() : 0); |
iveresov@2138 | 1528 | } |
iveresov@2138 | 1529 | } else { |
iveresov@2138 | 1530 | return invocation_counter()->count(); |
iveresov@2138 | 1531 | } |
iveresov@2138 | 1532 | } |
iveresov@2138 | 1533 | |
iveresov@2138 | 1534 | int methodOopDesc::backedge_count() { |
iveresov@2138 | 1535 | if (TieredCompilation) { |
iveresov@2138 | 1536 | const methodDataOop mdo = method_data(); |
iveresov@2138 | 1537 | if (backedge_counter()->carry() || ((mdo != NULL) ? mdo->backedge_counter()->carry() : false)) { |
iveresov@2138 | 1538 | return InvocationCounter::count_limit; |
iveresov@2138 | 1539 | } else { |
iveresov@2138 | 1540 | return backedge_counter()->count() + ((mdo != NULL) ? mdo->backedge_counter()->count() : 0); |
iveresov@2138 | 1541 | } |
iveresov@2138 | 1542 | } else { |
iveresov@2138 | 1543 | return backedge_counter()->count(); |
iveresov@2138 | 1544 | } |
iveresov@2138 | 1545 | } |
iveresov@2138 | 1546 | |
iveresov@2138 | 1547 | int methodOopDesc::highest_comp_level() const { |
iveresov@2138 | 1548 | methodDataOop mdo = method_data(); |
iveresov@2138 | 1549 | if (mdo != NULL) { |
iveresov@2138 | 1550 | return mdo->highest_comp_level(); |
iveresov@2138 | 1551 | } else { |
iveresov@2138 | 1552 | return CompLevel_none; |
iveresov@2138 | 1553 | } |
iveresov@2138 | 1554 | } |
iveresov@2138 | 1555 | |
iveresov@2138 | 1556 | int methodOopDesc::highest_osr_comp_level() const { |
iveresov@2138 | 1557 | methodDataOop mdo = method_data(); |
iveresov@2138 | 1558 | if (mdo != NULL) { |
iveresov@2138 | 1559 | return mdo->highest_osr_comp_level(); |
iveresov@2138 | 1560 | } else { |
iveresov@2138 | 1561 | return CompLevel_none; |
iveresov@2138 | 1562 | } |
iveresov@2138 | 1563 | } |
iveresov@2138 | 1564 | |
iveresov@2138 | 1565 | void methodOopDesc::set_highest_comp_level(int level) { |
iveresov@2138 | 1566 | methodDataOop mdo = method_data(); |
iveresov@2138 | 1567 | if (mdo != NULL) { |
iveresov@2138 | 1568 | mdo->set_highest_comp_level(level); |
iveresov@2138 | 1569 | } |
iveresov@2138 | 1570 | } |
iveresov@2138 | 1571 | |
iveresov@2138 | 1572 | void methodOopDesc::set_highest_osr_comp_level(int level) { |
iveresov@2138 | 1573 | methodDataOop mdo = method_data(); |
iveresov@2138 | 1574 | if (mdo != NULL) { |
iveresov@2138 | 1575 | mdo->set_highest_osr_comp_level(level); |
iveresov@2138 | 1576 | } |
iveresov@2138 | 1577 | } |
iveresov@2138 | 1578 | |
duke@435 | 1579 | BreakpointInfo::BreakpointInfo(methodOop m, int bci) { |
duke@435 | 1580 | _bci = bci; |
duke@435 | 1581 | _name_index = m->name_index(); |
duke@435 | 1582 | _signature_index = m->signature_index(); |
duke@435 | 1583 | _orig_bytecode = (Bytecodes::Code) *m->bcp_from(_bci); |
duke@435 | 1584 | if (_orig_bytecode == Bytecodes::_breakpoint) |
duke@435 | 1585 | _orig_bytecode = m->orig_bytecode_at(_bci); |
duke@435 | 1586 | _next = NULL; |
duke@435 | 1587 | } |
duke@435 | 1588 | |
duke@435 | 1589 | void BreakpointInfo::set(methodOop method) { |
duke@435 | 1590 | #ifdef ASSERT |
duke@435 | 1591 | { |
duke@435 | 1592 | Bytecodes::Code code = (Bytecodes::Code) *method->bcp_from(_bci); |
duke@435 | 1593 | if (code == Bytecodes::_breakpoint) |
duke@435 | 1594 | code = method->orig_bytecode_at(_bci); |
duke@435 | 1595 | assert(orig_bytecode() == code, "original bytecode must be the same"); |
duke@435 | 1596 | } |
duke@435 | 1597 | #endif |
duke@435 | 1598 | *method->bcp_from(_bci) = Bytecodes::_breakpoint; |
duke@435 | 1599 | method->incr_number_of_breakpoints(); |
duke@435 | 1600 | SystemDictionary::notice_modification(); |
duke@435 | 1601 | { |
duke@435 | 1602 | // Deoptimize all dependents on this method |
duke@435 | 1603 | Thread *thread = Thread::current(); |
duke@435 | 1604 | HandleMark hm(thread); |
duke@435 | 1605 | methodHandle mh(thread, method); |
duke@435 | 1606 | Universe::flush_dependents_on_method(mh); |
duke@435 | 1607 | } |
duke@435 | 1608 | } |
duke@435 | 1609 | |
duke@435 | 1610 | void BreakpointInfo::clear(methodOop method) { |
duke@435 | 1611 | *method->bcp_from(_bci) = orig_bytecode(); |
duke@435 | 1612 | assert(method->number_of_breakpoints() > 0, "must not go negative"); |
duke@435 | 1613 | method->decr_number_of_breakpoints(); |
duke@435 | 1614 | } |