Print this page
rev 6875 : 8056240: Investigate increased GC remark time after class unloading changes in CRM Fuse
Reviewed-by: mgerdin, coleenp, bdelsart
| Split |
Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/oops/method.cpp
+++ new/src/share/vm/oops/method.cpp
1 1 /*
2 2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #include "precompiled.hpp"
26 26 #include "classfile/metadataOnStackMark.hpp"
27 27 #include "classfile/systemDictionary.hpp"
28 28 #include "code/debugInfoRec.hpp"
29 29 #include "gc_interface/collectedHeap.inline.hpp"
30 30 #include "interpreter/bytecodeStream.hpp"
31 31 #include "interpreter/bytecodeTracer.hpp"
32 32 #include "interpreter/bytecodes.hpp"
33 33 #include "interpreter/interpreter.hpp"
34 34 #include "interpreter/oopMapCache.hpp"
35 35 #include "memory/gcLocker.hpp"
36 36 #include "memory/generation.hpp"
37 37 #include "memory/heapInspection.hpp"
38 38 #include "memory/metadataFactory.hpp"
39 39 #include "memory/oopFactory.hpp"
40 40 #include "oops/constMethod.hpp"
41 41 #include "oops/methodData.hpp"
42 42 #include "oops/method.hpp"
43 43 #include "oops/oop.inline.hpp"
44 44 #include "oops/symbol.hpp"
45 45 #include "prims/jvmtiExport.hpp"
46 46 #include "prims/methodHandles.hpp"
47 47 #include "prims/nativeLookup.hpp"
48 48 #include "runtime/arguments.hpp"
49 49 #include "runtime/compilationPolicy.hpp"
50 50 #include "runtime/frame.inline.hpp"
51 51 #include "runtime/handles.inline.hpp"
52 52 #include "runtime/orderAccess.inline.hpp"
53 53 #include "runtime/relocator.hpp"
54 54 #include "runtime/sharedRuntime.hpp"
55 55 #include "runtime/signature.hpp"
56 56 #include "utilities/quickSort.hpp"
57 57 #include "utilities/xmlstream.hpp"
58 58
59 59 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
60 60
61 61 // Implementation of Method
62 62
63 63 Method* Method::allocate(ClassLoaderData* loader_data,
64 64 int byte_code_size,
65 65 AccessFlags access_flags,
66 66 InlineTableSizes* sizes,
67 67 ConstMethod::MethodType method_type,
68 68 TRAPS) {
69 69 assert(!access_flags.is_native() || byte_code_size == 0,
70 70 "native methods should not contain byte codes");
71 71 ConstMethod* cm = ConstMethod::allocate(loader_data,
72 72 byte_code_size,
73 73 sizes,
74 74 method_type,
75 75 CHECK_NULL);
76 76
77 77 int size = Method::size(access_flags.is_native());
78 78
79 79 return new (loader_data, size, false, MetaspaceObj::MethodType, THREAD) Method(cm, access_flags, size);
80 80 }
81 81
82 82 Method::Method(ConstMethod* xconst, AccessFlags access_flags, int size) {
83 83 No_Safepoint_Verifier no_safepoint;
84 84 set_constMethod(xconst);
85 85 set_access_flags(access_flags);
86 86 set_method_size(size);
87 87 #ifdef CC_INTERP
88 88 set_result_index(T_VOID);
89 89 #endif
90 90 set_intrinsic_id(vmIntrinsics::_none);
91 91 set_jfr_towrite(false);
92 92 set_force_inline(false);
93 93 set_hidden(false);
94 94 set_dont_inline(false);
95 95 set_method_data(NULL);
96 96 clear_method_counters();
97 97 set_vtable_index(Method::garbage_vtable_index);
98 98
99 99 // Fix and bury in Method*
100 100 set_interpreter_entry(NULL); // sets i2i entry and from_int
101 101 set_adapter_entry(NULL);
102 102 clear_code(); // from_c/from_i get set to c2i/i2i
103 103
104 104 if (access_flags.is_native()) {
105 105 clear_native_function();
106 106 set_signature_handler(NULL);
107 107 }
108 108
109 109 NOT_PRODUCT(set_compiled_invocation_count(0);)
110 110 }
111 111
112 112 // Release Method*. The nmethod will be gone when we get here because
113 113 // we've walked the code cache.
114 114 void Method::deallocate_contents(ClassLoaderData* loader_data) {
115 115 MetadataFactory::free_metadata(loader_data, constMethod());
116 116 set_constMethod(NULL);
117 117 MetadataFactory::free_metadata(loader_data, method_data());
118 118 set_method_data(NULL);
119 119 MetadataFactory::free_metadata(loader_data, method_counters());
120 120 clear_method_counters();
121 121 // The nmethod will be gone when we get here.
122 122 if (code() != NULL) _code = NULL;
123 123 }
124 124
125 125 address Method::get_i2c_entry() {
126 126 assert(_adapter != NULL, "must have");
127 127 return _adapter->get_i2c_entry();
128 128 }
129 129
130 130 address Method::get_c2i_entry() {
131 131 assert(_adapter != NULL, "must have");
132 132 return _adapter->get_c2i_entry();
133 133 }
134 134
135 135 address Method::get_c2i_unverified_entry() {
136 136 assert(_adapter != NULL, "must have");
137 137 return _adapter->get_c2i_unverified_entry();
138 138 }
139 139
140 140 char* Method::name_and_sig_as_C_string() const {
141 141 return name_and_sig_as_C_string(constants()->pool_holder(), name(), signature());
142 142 }
143 143
144 144 char* Method::name_and_sig_as_C_string(char* buf, int size) const {
145 145 return name_and_sig_as_C_string(constants()->pool_holder(), name(), signature(), buf, size);
146 146 }
147 147
148 148 char* Method::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature) {
149 149 const char* klass_name = klass->external_name();
150 150 int klass_name_len = (int)strlen(klass_name);
151 151 int method_name_len = method_name->utf8_length();
152 152 int len = klass_name_len + 1 + method_name_len + signature->utf8_length();
153 153 char* dest = NEW_RESOURCE_ARRAY(char, len + 1);
154 154 strcpy(dest, klass_name);
155 155 dest[klass_name_len] = '.';
156 156 strcpy(&dest[klass_name_len + 1], method_name->as_C_string());
157 157 strcpy(&dest[klass_name_len + 1 + method_name_len], signature->as_C_string());
158 158 dest[len] = 0;
159 159 return dest;
160 160 }
161 161
162 162 char* Method::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature, char* buf, int size) {
163 163 Symbol* klass_name = klass->name();
164 164 klass_name->as_klass_external_name(buf, size);
165 165 int len = (int)strlen(buf);
166 166
167 167 if (len < size - 1) {
168 168 buf[len++] = '.';
169 169
170 170 method_name->as_C_string(&(buf[len]), size - len);
171 171 len = (int)strlen(buf);
172 172
173 173 signature->as_C_string(&(buf[len]), size - len);
174 174 }
175 175
176 176 return buf;
177 177 }
178 178
179 179 int Method::fast_exception_handler_bci_for(methodHandle mh, KlassHandle ex_klass, int throw_bci, TRAPS) {
180 180 // exception table holds quadruple entries of the form (beg_bci, end_bci, handler_bci, klass_index)
181 181 // access exception table
182 182 ExceptionTable table(mh());
183 183 int length = table.length();
184 184 // iterate through all entries sequentially
185 185 constantPoolHandle pool(THREAD, mh->constants());
186 186 for (int i = 0; i < length; i ++) {
187 187 //reacquire the table in case a GC happened
188 188 ExceptionTable table(mh());
189 189 int beg_bci = table.start_pc(i);
190 190 int end_bci = table.end_pc(i);
191 191 assert(beg_bci <= end_bci, "inconsistent exception table");
192 192 if (beg_bci <= throw_bci && throw_bci < end_bci) {
193 193 // exception handler bci range covers throw_bci => investigate further
194 194 int handler_bci = table.handler_pc(i);
195 195 int klass_index = table.catch_type_index(i);
196 196 if (klass_index == 0) {
197 197 return handler_bci;
198 198 } else if (ex_klass.is_null()) {
199 199 return handler_bci;
200 200 } else {
201 201 // we know the exception class => get the constraint class
202 202 // this may require loading of the constraint class; if verification
203 203 // fails or some other exception occurs, return handler_bci
204 204 Klass* k = pool->klass_at(klass_index, CHECK_(handler_bci));
205 205 KlassHandle klass = KlassHandle(THREAD, k);
206 206 assert(klass.not_null(), "klass not loaded");
207 207 if (ex_klass->is_subtype_of(klass())) {
208 208 return handler_bci;
209 209 }
210 210 }
211 211 }
212 212 }
213 213
214 214 return -1;
215 215 }
216 216
217 217 void Method::mask_for(int bci, InterpreterOopMap* mask) {
218 218
219 219 Thread* myThread = Thread::current();
220 220 methodHandle h_this(myThread, this);
221 221 #ifdef ASSERT
222 222 bool has_capability = myThread->is_VM_thread() ||
223 223 myThread->is_ConcurrentGC_thread() ||
224 224 myThread->is_GC_task_thread();
225 225
226 226 if (!has_capability) {
227 227 if (!VerifyStack && !VerifyLastFrame) {
228 228 // verify stack calls this outside VM thread
229 229 warning("oopmap should only be accessed by the "
230 230 "VM, GC task or CMS threads (or during debugging)");
231 231 InterpreterOopMap local_mask;
232 232 method_holder()->mask_for(h_this, bci, &local_mask);
233 233 local_mask.print();
234 234 }
235 235 }
236 236 #endif
237 237 method_holder()->mask_for(h_this, bci, mask);
238 238 return;
239 239 }
240 240
241 241
242 242 int Method::bci_from(address bcp) const {
243 243 #ifdef ASSERT
244 244 { ResourceMark rm;
245 245 assert(is_native() && bcp == code_base() || contains(bcp) || is_error_reported(),
246 246 err_msg("bcp doesn't belong to this method: bcp: " INTPTR_FORMAT ", method: %s", bcp, name_and_sig_as_C_string()));
247 247 }
248 248 #endif
249 249 return bcp - code_base();
250 250 }
251 251
252 252
253 253 // Return (int)bcx if it appears to be a valid BCI.
254 254 // Return bci_from((address)bcx) if it appears to be a valid BCP.
255 255 // Return -1 otherwise.
256 256 // Used by profiling code, when invalid data is a possibility.
257 257 // The caller is responsible for validating the Method* itself.
258 258 int Method::validate_bci_from_bcx(intptr_t bcx) const {
259 259 // keep bci as -1 if not a valid bci
260 260 int bci = -1;
261 261 if (bcx == 0 || (address)bcx == code_base()) {
262 262 // code_size() may return 0 and we allow 0 here
263 263 // the method may be native
264 264 bci = 0;
265 265 } else if (frame::is_bci(bcx)) {
266 266 if (bcx < code_size()) {
267 267 bci = (int)bcx;
268 268 }
269 269 } else if (contains((address)bcx)) {
270 270 bci = (address)bcx - code_base();
271 271 }
272 272 // Assert that if we have dodged any asserts, bci is negative.
273 273 assert(bci == -1 || bci == bci_from(bcp_from(bci)), "sane bci if >=0");
274 274 return bci;
275 275 }
276 276
277 277 address Method::bcp_from(int bci) const {
278 278 assert((is_native() && bci == 0) || (!is_native() && 0 <= bci && bci < code_size()), err_msg("illegal bci: %d", bci));
279 279 address bcp = code_base() + bci;
280 280 assert(is_native() && bcp == code_base() || contains(bcp), "bcp doesn't belong to this method");
281 281 return bcp;
282 282 }
283 283
284 284
285 285 int Method::size(bool is_native) {
286 286 // If native, then include pointers for native_function and signature_handler
287 287 int extra_bytes = (is_native) ? 2*sizeof(address*) : 0;
288 288 int extra_words = align_size_up(extra_bytes, BytesPerWord) / BytesPerWord;
289 289 return align_object_size(header_size() + extra_words);
290 290 }
291 291
292 292
293 293 Symbol* Method::klass_name() const {
294 294 Klass* k = method_holder();
295 295 assert(k->is_klass(), "must be klass");
296 296 InstanceKlass* ik = (InstanceKlass*) k;
297 297 return ik->name();
298 298 }
299 299
300 300
301 301 // Attempt to return method oop to original state. Clear any pointers
302 302 // (to objects outside the shared spaces). We won't be able to predict
303 303 // where they should point in a new JVM. Further initialize some
304 304 // entries now in order allow them to be write protected later.
305 305
306 306 void Method::remove_unshareable_info() {
307 307 unlink_method();
308 308 }
309 309
310 310
311 311 bool Method::was_executed_more_than(int n) {
312 312 // Invocation counter is reset when the Method* is compiled.
313 313 // If the method has compiled code we therefore assume it has
314 314 // be excuted more than n times.
315 315 if (is_accessor() || is_empty_method() || (code() != NULL)) {
316 316 // interpreter doesn't bump invocation counter of trivial methods
317 317 // compiler does not bump invocation counter of compiled methods
318 318 return true;
319 319 }
320 320 else if ((method_counters() != NULL &&
321 321 method_counters()->invocation_counter()->carry()) ||
322 322 (method_data() != NULL &&
323 323 method_data()->invocation_counter()->carry())) {
324 324 // The carry bit is set when the counter overflows and causes
325 325 // a compilation to occur. We don't know how many times
326 326 // the counter has been reset, so we simply assume it has
327 327 // been executed more than n times.
328 328 return true;
329 329 } else {
330 330 return invocation_count() > n;
331 331 }
332 332 }
333 333
334 334 #ifndef PRODUCT
335 335 void Method::print_invocation_count() {
336 336 if (is_static()) tty->print("static ");
337 337 if (is_final()) tty->print("final ");
338 338 if (is_synchronized()) tty->print("synchronized ");
339 339 if (is_native()) tty->print("native ");
340 340 method_holder()->name()->print_symbol_on(tty);
341 341 tty->print(".");
342 342 name()->print_symbol_on(tty);
343 343 signature()->print_symbol_on(tty);
344 344
345 345 if (WizardMode) {
346 346 // dump the size of the byte codes
347 347 tty->print(" {%d}", code_size());
348 348 }
349 349 tty->cr();
350 350
351 351 tty->print_cr (" interpreter_invocation_count: %8d ", interpreter_invocation_count());
352 352 tty->print_cr (" invocation_counter: %8d ", invocation_count());
353 353 tty->print_cr (" backedge_counter: %8d ", backedge_count());
354 354 if (CountCompiledCalls) {
355 355 tty->print_cr (" compiled_invocation_count: %8d ", compiled_invocation_count());
356 356 }
357 357
358 358 }
359 359 #endif
360 360
361 361 // Build a MethodData* object to hold information about this method
362 362 // collected in the interpreter.
363 363 void Method::build_interpreter_method_data(methodHandle method, TRAPS) {
364 364 // Do not profile method if current thread holds the pending list lock,
365 365 // which avoids deadlock for acquiring the MethodData_lock.
366 366 if (InstanceRefKlass::owns_pending_list_lock((JavaThread*)THREAD)) {
367 367 return;
368 368 }
369 369
370 370 // Grab a lock here to prevent multiple
371 371 // MethodData*s from being created.
372 372 MutexLocker ml(MethodData_lock, THREAD);
373 373 if (method->method_data() == NULL) {
374 374 ClassLoaderData* loader_data = method->method_holder()->class_loader_data();
375 375 MethodData* method_data = MethodData::allocate(loader_data, method, CHECK);
376 376 method->set_method_data(method_data);
377 377 if (PrintMethodData && (Verbose || WizardMode)) {
378 378 ResourceMark rm(THREAD);
379 379 tty->print("build_interpreter_method_data for ");
380 380 method->print_name(tty);
381 381 tty->cr();
382 382 // At the end of the run, the MDO, full of data, will be dumped.
383 383 }
384 384 }
385 385 }
386 386
387 387 MethodCounters* Method::build_method_counters(Method* m, TRAPS) {
388 388 methodHandle mh(m);
389 389 ClassLoaderData* loader_data = mh->method_holder()->class_loader_data();
390 390 MethodCounters* counters = MethodCounters::allocate(loader_data, CHECK_NULL);
391 391 if (!mh->init_method_counters(counters)) {
392 392 MetadataFactory::free_metadata(loader_data, counters);
393 393 }
394 394 return mh->method_counters();
395 395 }
396 396
397 397 void Method::cleanup_inline_caches() {
398 398 // The current system doesn't use inline caches in the interpreter
399 399 // => nothing to do (keep this method around for future use)
400 400 }
401 401
402 402
403 403 int Method::extra_stack_words() {
404 404 // not an inline function, to avoid a header dependency on Interpreter
405 405 return extra_stack_entries() * Interpreter::stackElementSize;
406 406 }
407 407
408 408
409 409 void Method::compute_size_of_parameters(Thread *thread) {
410 410 ArgumentSizeComputer asc(signature());
411 411 set_size_of_parameters(asc.size() + (is_static() ? 0 : 1));
412 412 }
413 413
414 414 #ifdef CC_INTERP
415 415 void Method::set_result_index(BasicType type) {
416 416 _result_index = Interpreter::BasicType_as_index(type);
417 417 }
418 418 #endif
419 419
420 420 BasicType Method::result_type() const {
421 421 ResultTypeFinder rtf(signature());
422 422 return rtf.type();
423 423 }
424 424
425 425
426 426 bool Method::is_empty_method() const {
427 427 return code_size() == 1
428 428 && *code_base() == Bytecodes::_return;
429 429 }
430 430
431 431
432 432 bool Method::is_vanilla_constructor() const {
433 433 // Returns true if this method is a vanilla constructor, i.e. an "<init>" "()V" method
434 434 // which only calls the superclass vanilla constructor and possibly does stores of
435 435 // zero constants to local fields:
436 436 //
437 437 // aload_0
438 438 // invokespecial
439 439 // indexbyte1
440 440 // indexbyte2
441 441 //
442 442 // followed by an (optional) sequence of:
443 443 //
444 444 // aload_0
445 445 // aconst_null / iconst_0 / fconst_0 / dconst_0
446 446 // putfield
447 447 // indexbyte1
448 448 // indexbyte2
449 449 //
450 450 // followed by:
451 451 //
452 452 // return
453 453
454 454 assert(name() == vmSymbols::object_initializer_name(), "Should only be called for default constructors");
455 455 assert(signature() == vmSymbols::void_method_signature(), "Should only be called for default constructors");
456 456 int size = code_size();
457 457 // Check if size match
458 458 if (size == 0 || size % 5 != 0) return false;
459 459 address cb = code_base();
460 460 int last = size - 1;
461 461 if (cb[0] != Bytecodes::_aload_0 || cb[1] != Bytecodes::_invokespecial || cb[last] != Bytecodes::_return) {
462 462 // Does not call superclass default constructor
463 463 return false;
464 464 }
465 465 // Check optional sequence
466 466 for (int i = 4; i < last; i += 5) {
467 467 if (cb[i] != Bytecodes::_aload_0) return false;
468 468 if (!Bytecodes::is_zero_const(Bytecodes::cast(cb[i+1]))) return false;
469 469 if (cb[i+2] != Bytecodes::_putfield) return false;
470 470 }
471 471 return true;
472 472 }
473 473
474 474
475 475 bool Method::compute_has_loops_flag() {
476 476 BytecodeStream bcs(this);
477 477 Bytecodes::Code bc;
478 478
479 479 while ((bc = bcs.next()) >= 0) {
480 480 switch( bc ) {
481 481 case Bytecodes::_ifeq:
482 482 case Bytecodes::_ifnull:
483 483 case Bytecodes::_iflt:
484 484 case Bytecodes::_ifle:
485 485 case Bytecodes::_ifne:
486 486 case Bytecodes::_ifnonnull:
487 487 case Bytecodes::_ifgt:
488 488 case Bytecodes::_ifge:
489 489 case Bytecodes::_if_icmpeq:
490 490 case Bytecodes::_if_icmpne:
491 491 case Bytecodes::_if_icmplt:
492 492 case Bytecodes::_if_icmpgt:
493 493 case Bytecodes::_if_icmple:
494 494 case Bytecodes::_if_icmpge:
495 495 case Bytecodes::_if_acmpeq:
496 496 case Bytecodes::_if_acmpne:
497 497 case Bytecodes::_goto:
498 498 case Bytecodes::_jsr:
499 499 if( bcs.dest() < bcs.next_bci() ) _access_flags.set_has_loops();
500 500 break;
501 501
502 502 case Bytecodes::_goto_w:
503 503 case Bytecodes::_jsr_w:
504 504 if( bcs.dest_w() < bcs.next_bci() ) _access_flags.set_has_loops();
505 505 break;
506 506 }
507 507 }
508 508 _access_flags.set_loops_flag_init();
509 509 return _access_flags.has_loops();
510 510 }
511 511
512 512 bool Method::is_final_method(AccessFlags class_access_flags) const {
513 513 // or "does_not_require_vtable_entry"
514 514 // default method or overpass can occur, is not final (reuses vtable entry)
515 515 // private methods get vtable entries for backward class compatibility.
516 516 if (is_overpass() || is_default_method()) return false;
517 517 return is_final() || class_access_flags.is_final();
518 518 }
519 519
520 520 bool Method::is_final_method() const {
521 521 return is_final_method(method_holder()->access_flags());
522 522 }
523 523
524 524 bool Method::is_default_method() const {
525 525 if (method_holder() != NULL &&
526 526 method_holder()->is_interface() &&
527 527 !is_abstract()) {
528 528 return true;
529 529 } else {
530 530 return false;
531 531 }
532 532 }
533 533
534 534 bool Method::can_be_statically_bound(AccessFlags class_access_flags) const {
535 535 if (is_final_method(class_access_flags)) return true;
536 536 #ifdef ASSERT
537 537 ResourceMark rm;
538 538 bool is_nonv = (vtable_index() == nonvirtual_vtable_index);
539 539 if (class_access_flags.is_interface()) {
540 540 assert(is_nonv == is_static(), err_msg("is_nonv=%s", name_and_sig_as_C_string()));
541 541 }
542 542 #endif
543 543 assert(valid_vtable_index() || valid_itable_index(), "method must be linked before we ask this question");
544 544 return vtable_index() == nonvirtual_vtable_index;
545 545 }
546 546
547 547 bool Method::can_be_statically_bound() const {
548 548 return can_be_statically_bound(method_holder()->access_flags());
549 549 }
550 550
551 551 bool Method::is_accessor() const {
552 552 if (code_size() != 5) return false;
553 553 if (size_of_parameters() != 1) return false;
554 554 if (java_code_at(0) != Bytecodes::_aload_0 ) return false;
555 555 if (java_code_at(1) != Bytecodes::_getfield) return false;
556 556 if (java_code_at(4) != Bytecodes::_areturn &&
557 557 java_code_at(4) != Bytecodes::_ireturn ) return false;
558 558 return true;
559 559 }
560 560
561 561
562 562 bool Method::is_initializer() const {
563 563 return name() == vmSymbols::object_initializer_name() || is_static_initializer();
564 564 }
565 565
566 566 bool Method::has_valid_initializer_flags() const {
567 567 return (is_static() ||
568 568 method_holder()->major_version() < 51);
569 569 }
570 570
571 571 bool Method::is_static_initializer() const {
572 572 // For classfiles version 51 or greater, ensure that the clinit method is
573 573 // static. Non-static methods with the name "<clinit>" are not static
574 574 // initializers. (older classfiles exempted for backward compatibility)
575 575 return name() == vmSymbols::class_initializer_name() &&
576 576 has_valid_initializer_flags();
577 577 }
578 578
579 579
580 580 objArrayHandle Method::resolved_checked_exceptions_impl(Method* this_oop, TRAPS) {
581 581 int length = this_oop->checked_exceptions_length();
582 582 if (length == 0) { // common case
583 583 return objArrayHandle(THREAD, Universe::the_empty_class_klass_array());
584 584 } else {
585 585 methodHandle h_this(THREAD, this_oop);
586 586 objArrayOop m_oop = oopFactory::new_objArray(SystemDictionary::Class_klass(), length, CHECK_(objArrayHandle()));
587 587 objArrayHandle mirrors (THREAD, m_oop);
588 588 for (int i = 0; i < length; i++) {
589 589 CheckedExceptionElement* table = h_this->checked_exceptions_start(); // recompute on each iteration, not gc safe
590 590 Klass* k = h_this->constants()->klass_at(table[i].class_cp_index, CHECK_(objArrayHandle()));
591 591 assert(k->is_subclass_of(SystemDictionary::Throwable_klass()), "invalid exception class");
592 592 mirrors->obj_at_put(i, k->java_mirror());
593 593 }
594 594 return mirrors;
595 595 }
596 596 };
597 597
598 598
599 599 int Method::line_number_from_bci(int bci) const {
600 600 if (bci == SynchronizationEntryBCI) bci = 0;
601 601 assert(bci == 0 || 0 <= bci && bci < code_size(), "illegal bci");
602 602 int best_bci = 0;
603 603 int best_line = -1;
604 604
605 605 if (has_linenumber_table()) {
606 606 // The line numbers are a short array of 2-tuples [start_pc, line_number].
607 607 // Not necessarily sorted and not necessarily one-to-one.
608 608 CompressedLineNumberReadStream stream(compressed_linenumber_table());
609 609 while (stream.read_pair()) {
610 610 if (stream.bci() == bci) {
611 611 // perfect match
612 612 return stream.line();
613 613 } else {
614 614 // update best_bci/line
615 615 if (stream.bci() < bci && stream.bci() >= best_bci) {
616 616 best_bci = stream.bci();
617 617 best_line = stream.line();
618 618 }
619 619 }
620 620 }
621 621 }
622 622 return best_line;
623 623 }
624 624
625 625
626 626 bool Method::is_klass_loaded_by_klass_index(int klass_index) const {
627 627 if( constants()->tag_at(klass_index).is_unresolved_klass() ) {
628 628 Thread *thread = Thread::current();
629 629 Symbol* klass_name = constants()->klass_name_at(klass_index);
630 630 Handle loader(thread, method_holder()->class_loader());
631 631 Handle prot (thread, method_holder()->protection_domain());
632 632 return SystemDictionary::find(klass_name, loader, prot, thread) != NULL;
633 633 } else {
634 634 return true;
635 635 }
636 636 }
637 637
638 638
639 639 bool Method::is_klass_loaded(int refinfo_index, bool must_be_resolved) const {
640 640 int klass_index = constants()->klass_ref_index_at(refinfo_index);
641 641 if (must_be_resolved) {
642 642 // Make sure klass is resolved in constantpool.
643 643 if (constants()->tag_at(klass_index).is_unresolved_klass()) return false;
644 644 }
645 645 return is_klass_loaded_by_klass_index(klass_index);
646 646 }
647 647
648 648
649 649 void Method::set_native_function(address function, bool post_event_flag) {
650 650 assert(function != NULL, "use clear_native_function to unregister natives");
651 651 assert(!is_method_handle_intrinsic() || function == SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), "");
652 652 address* native_function = native_function_addr();
653 653
654 654 // We can see racers trying to place the same native function into place. Once
655 655 // is plenty.
656 656 address current = *native_function;
657 657 if (current == function) return;
658 658 if (post_event_flag && JvmtiExport::should_post_native_method_bind() &&
659 659 function != NULL) {
660 660 // native_method_throw_unsatisfied_link_error_entry() should only
661 661 // be passed when post_event_flag is false.
662 662 assert(function !=
663 663 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
664 664 "post_event_flag mis-match");
665 665
666 666 // post the bind event, and possible change the bind function
667 667 JvmtiExport::post_native_method_bind(this, &function);
668 668 }
669 669 *native_function = function;
670 670 // This function can be called more than once. We must make sure that we always
671 671 // use the latest registered method -> check if a stub already has been generated.
672 672 // If so, we have to make it not_entrant.
673 673 nmethod* nm = code(); // Put it into local variable to guard against concurrent updates
674 674 if (nm != NULL) {
675 675 nm->make_not_entrant();
676 676 }
677 677 }
678 678
679 679
680 680 bool Method::has_native_function() const {
681 681 if (is_method_handle_intrinsic())
682 682 return false; // special-cased in SharedRuntime::generate_native_wrapper
683 683 address func = native_function();
684 684 return (func != NULL && func != SharedRuntime::native_method_throw_unsatisfied_link_error_entry());
685 685 }
686 686
687 687
688 688 void Method::clear_native_function() {
689 689 // Note: is_method_handle_intrinsic() is allowed here.
690 690 set_native_function(
691 691 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
692 692 !native_bind_event_is_interesting);
693 693 clear_code();
694 694 }
695 695
696 696 address Method::critical_native_function() {
697 697 methodHandle mh(this);
698 698 return NativeLookup::lookup_critical_entry(mh);
699 699 }
700 700
701 701
702 702 void Method::set_signature_handler(address handler) {
703 703 address* signature_handler = signature_handler_addr();
704 704 *signature_handler = handler;
705 705 }
706 706
707 707
708 708 void Method::print_made_not_compilable(int comp_level, bool is_osr, bool report, const char* reason) {
709 709 if (PrintCompilation && report) {
710 710 ttyLocker ttyl;
711 711 tty->print("made not %scompilable on ", is_osr ? "OSR " : "");
712 712 if (comp_level == CompLevel_all) {
713 713 tty->print("all levels ");
714 714 } else {
715 715 tty->print("levels ");
716 716 for (int i = (int)CompLevel_none; i <= comp_level; i++) {
717 717 tty->print("%d ", i);
718 718 }
719 719 }
720 720 this->print_short_name(tty);
721 721 int size = this->code_size();
722 722 if (size > 0) {
723 723 tty->print(" (%d bytes)", size);
724 724 }
725 725 if (reason != NULL) {
726 726 tty->print(" %s", reason);
727 727 }
728 728 tty->cr();
729 729 }
730 730 if ((TraceDeoptimization || LogCompilation) && (xtty != NULL)) {
731 731 ttyLocker ttyl;
732 732 xtty->begin_elem("make_not_compilable thread='" UINTX_FORMAT "' osr='%d' level='%d'",
733 733 os::current_thread_id(), is_osr, comp_level);
734 734 if (reason != NULL) {
735 735 xtty->print(" reason=\'%s\'", reason);
736 736 }
737 737 xtty->method(this);
738 738 xtty->stamp();
739 739 xtty->end_elem();
740 740 }
741 741 }
742 742
743 743 bool Method::is_always_compilable() const {
744 744 // Generated adapters must be compiled
745 745 if (is_method_handle_intrinsic() && is_synthetic()) {
746 746 assert(!is_not_c1_compilable(), "sanity check");
747 747 assert(!is_not_c2_compilable(), "sanity check");
748 748 return true;
749 749 }
750 750
751 751 return false;
752 752 }
753 753
754 754 bool Method::is_not_compilable(int comp_level) const {
755 755 if (number_of_breakpoints() > 0)
756 756 return true;
757 757 if (is_always_compilable())
758 758 return false;
759 759 if (comp_level == CompLevel_any)
760 760 return is_not_c1_compilable() || is_not_c2_compilable();
761 761 if (is_c1_compile(comp_level))
762 762 return is_not_c1_compilable();
763 763 if (is_c2_compile(comp_level))
764 764 return is_not_c2_compilable();
765 765 return false;
766 766 }
767 767
768 768 // call this when compiler finds that this method is not compilable
769 769 void Method::set_not_compilable(int comp_level, bool report, const char* reason) {
770 770 if (is_always_compilable()) {
771 771 // Don't mark a method which should be always compilable
772 772 return;
773 773 }
774 774 print_made_not_compilable(comp_level, /*is_osr*/ false, report, reason);
775 775 if (comp_level == CompLevel_all) {
776 776 set_not_c1_compilable();
777 777 set_not_c2_compilable();
778 778 } else {
779 779 if (is_c1_compile(comp_level))
780 780 set_not_c1_compilable();
781 781 if (is_c2_compile(comp_level))
782 782 set_not_c2_compilable();
783 783 }
784 784 CompilationPolicy::policy()->disable_compilation(this);
785 785 assert(!CompilationPolicy::can_be_compiled(this, comp_level), "sanity check");
786 786 }
787 787
788 788 bool Method::is_not_osr_compilable(int comp_level) const {
789 789 if (is_not_compilable(comp_level))
790 790 return true;
791 791 if (comp_level == CompLevel_any)
792 792 return is_not_c1_osr_compilable() || is_not_c2_osr_compilable();
793 793 if (is_c1_compile(comp_level))
794 794 return is_not_c1_osr_compilable();
795 795 if (is_c2_compile(comp_level))
796 796 return is_not_c2_osr_compilable();
797 797 return false;
798 798 }
799 799
800 800 void Method::set_not_osr_compilable(int comp_level, bool report, const char* reason) {
801 801 print_made_not_compilable(comp_level, /*is_osr*/ true, report, reason);
802 802 if (comp_level == CompLevel_all) {
803 803 set_not_c1_osr_compilable();
804 804 set_not_c2_osr_compilable();
805 805 } else {
806 806 if (is_c1_compile(comp_level))
807 807 set_not_c1_osr_compilable();
808 808 if (is_c2_compile(comp_level))
809 809 set_not_c2_osr_compilable();
810 810 }
811 811 CompilationPolicy::policy()->disable_compilation(this);
812 812 assert(!CompilationPolicy::can_be_osr_compiled(this, comp_level), "sanity check");
813 813 }
814 814
815 815 // Revert to using the interpreter and clear out the nmethod
816 816 void Method::clear_code() {
817 817
818 818 // this may be NULL if c2i adapters have not been made yet
819 819 // Only should happen at allocate time.
820 820 if (_adapter == NULL) {
821 821 _from_compiled_entry = NULL;
822 822 } else {
823 823 _from_compiled_entry = _adapter->get_c2i_entry();
824 824 }
825 825 OrderAccess::storestore();
826 826 _from_interpreted_entry = _i2i_entry;
827 827 OrderAccess::storestore();
828 828 _code = NULL;
829 829 }
830 830
831 831 // Called by class data sharing to remove any entry points (which are not shared)
832 832 void Method::unlink_method() {
833 833 _code = NULL;
834 834 _i2i_entry = NULL;
835 835 _from_interpreted_entry = NULL;
836 836 if (is_native()) {
837 837 *native_function_addr() = NULL;
838 838 set_signature_handler(NULL);
839 839 }
840 840 NOT_PRODUCT(set_compiled_invocation_count(0);)
841 841 _adapter = NULL;
842 842 _from_compiled_entry = NULL;
843 843
844 844 // In case of DumpSharedSpaces, _method_data should always be NULL.
845 845 //
846 846 // During runtime (!DumpSharedSpaces), when we are cleaning a
847 847 // shared class that failed to load, this->link_method() may
848 848 // have already been called (before an exception happened), so
849 849 // this->_method_data may not be NULL.
850 850 assert(!DumpSharedSpaces || _method_data == NULL, "unexpected method data?");
851 851
852 852 set_method_data(NULL);
853 853 clear_method_counters();
854 854 }
855 855
856 856 // Called when the method_holder is getting linked. Setup entrypoints so the method
857 857 // is ready to be called from interpreter, compiler, and vtables.
858 858 void Method::link_method(methodHandle h_method, TRAPS) {
859 859 // If the code cache is full, we may reenter this function for the
860 860 // leftover methods that weren't linked.
861 861 if (_i2i_entry != NULL) return;
862 862
863 863 assert(_adapter == NULL, "init'd to NULL" );
864 864 assert( _code == NULL, "nothing compiled yet" );
865 865
866 866 // Setup interpreter entrypoint
867 867 assert(this == h_method(), "wrong h_method()" );
868 868 address entry = Interpreter::entry_for_method(h_method);
869 869 assert(entry != NULL, "interpreter entry must be non-null");
870 870 // Sets both _i2i_entry and _from_interpreted_entry
871 871 set_interpreter_entry(entry);
872 872
873 873 // Don't overwrite already registered native entries.
874 874 if (is_native() && !has_native_function()) {
875 875 set_native_function(
876 876 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
877 877 !native_bind_event_is_interesting);
878 878 }
879 879
880 880 // Setup compiler entrypoint. This is made eagerly, so we do not need
881 881 // special handling of vtables. An alternative is to make adapters more
882 882 // lazily by calling make_adapter() from from_compiled_entry() for the
883 883 // normal calls. For vtable calls life gets more complicated. When a
884 884 // call-site goes mega-morphic we need adapters in all methods which can be
885 885 // called from the vtable. We need adapters on such methods that get loaded
886 886 // later. Ditto for mega-morphic itable calls. If this proves to be a
887 887 // problem we'll make these lazily later.
888 888 (void) make_adapters(h_method, CHECK);
889 889
890 890 // ONLY USE the h_method now as make_adapter may have blocked
891 891
892 892 }
893 893
894 894 address Method::make_adapters(methodHandle mh, TRAPS) {
895 895 // Adapters for compiled code are made eagerly here. They are fairly
896 896 // small (generally < 100 bytes) and quick to make (and cached and shared)
897 897 // so making them eagerly shouldn't be too expensive.
898 898 AdapterHandlerEntry* adapter = AdapterHandlerLibrary::get_adapter(mh);
899 899 if (adapter == NULL ) {
900 900 THROW_MSG_NULL(vmSymbols::java_lang_VirtualMachineError(), "out of space in CodeCache for adapters");
901 901 }
902 902
903 903 mh->set_adapter_entry(adapter);
904 904 mh->_from_compiled_entry = adapter->get_c2i_entry();
905 905 return adapter->get_c2i_entry();
906 906 }
907 907
908 908 void Method::restore_unshareable_info(TRAPS) {
909 909 // Since restore_unshareable_info can be called more than once for a method, don't
910 910 // redo any work. If this field is restored, there is nothing to do.
911 911 if (_from_compiled_entry == NULL) {
912 912 // restore method's vtable by calling a virtual function
913 913 restore_vtable();
914 914
915 915 methodHandle mh(THREAD, this);
916 916 link_method(mh, CHECK);
917 917 }
918 918 }
919 919
920 920
921 921 // The verified_code_entry() must be called when a invoke is resolved
922 922 // on this method.
923 923
924 924 // It returns the compiled code entry point, after asserting not null.
925 925 // This function is called after potential safepoints so that nmethod
926 926 // or adapter that it points to is still live and valid.
927 927 // This function must not hit a safepoint!
928 928 address Method::verified_code_entry() {
929 929 debug_only(No_Safepoint_Verifier nsv;)
930 930 assert(_from_compiled_entry != NULL, "must be set");
931 931 return _from_compiled_entry;
932 932 }
933 933
934 934 // Check that if an nmethod ref exists, it has a backlink to this or no backlink at all
935 935 // (could be racing a deopt).
936 936 // Not inline to avoid circular ref.
937 937 bool Method::check_code() const {
938 938 // cached in a register or local. There's a race on the value of the field.
939 939 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code);
940 940 return code == NULL || (code->method() == NULL) || (code->method() == (Method*)this && !code->is_osr_method());
941 941 }
942 942
943 943 // Install compiled code. Instantly it can execute.
944 944 void Method::set_code(methodHandle mh, nmethod *code) {
945 945 assert( code, "use clear_code to remove code" );
946 946 assert( mh->check_code(), "" );
947 947
948 948 guarantee(mh->adapter() != NULL, "Adapter blob must already exist!");
949 949
950 950 // These writes must happen in this order, because the interpreter will
951 951 // directly jump to from_interpreted_entry which jumps to an i2c adapter
952 952 // which jumps to _from_compiled_entry.
953 953 mh->_code = code; // Assign before allowing compiled code to exec
954 954
955 955 int comp_level = code->comp_level();
956 956 // In theory there could be a race here. In practice it is unlikely
957 957 // and not worth worrying about.
958 958 if (comp_level > mh->highest_comp_level()) {
959 959 mh->set_highest_comp_level(comp_level);
960 960 }
961 961
962 962 OrderAccess::storestore();
963 963 #ifdef SHARK
964 964 mh->_from_interpreted_entry = code->insts_begin();
965 965 #else //!SHARK
966 966 mh->_from_compiled_entry = code->verified_entry_point();
967 967 OrderAccess::storestore();
968 968 // Instantly compiled code can execute.
969 969 if (!mh->is_method_handle_intrinsic())
970 970 mh->_from_interpreted_entry = mh->get_i2c_entry();
971 971 #endif //!SHARK
972 972 }
973 973
974 974
975 975 bool Method::is_overridden_in(Klass* k) const {
976 976 InstanceKlass* ik = InstanceKlass::cast(k);
977 977
978 978 if (ik->is_interface()) return false;
979 979
980 980 // If method is an interface, we skip it - except if it
981 981 // is a miranda method
982 982 if (method_holder()->is_interface()) {
983 983 // Check that method is not a miranda method
984 984 if (ik->lookup_method(name(), signature()) == NULL) {
985 985 // No implementation exist - so miranda method
986 986 return false;
987 987 }
988 988 return true;
989 989 }
990 990
991 991 assert(ik->is_subclass_of(method_holder()), "should be subklass");
992 992 assert(ik->vtable() != NULL, "vtable should exist");
993 993 if (!has_vtable_index()) {
994 994 return false;
995 995 } else {
996 996 Method* vt_m = ik->method_at_vtable(vtable_index());
997 997 return vt_m != this;
998 998 }
999 999 }
1000 1000
1001 1001
1002 1002 // give advice about whether this Method* should be cached or not
1003 1003 bool Method::should_not_be_cached() const {
1004 1004 if (is_old()) {
1005 1005 // This method has been redefined. It is either EMCP or obsolete
1006 1006 // and we don't want to cache it because that would pin the method
1007 1007 // down and prevent it from being collectible if and when it
1008 1008 // finishes executing.
1009 1009 return true;
1010 1010 }
1011 1011
1012 1012 // caching this method should be just fine
1013 1013 return false;
1014 1014 }
1015 1015
1016 1016
1017 1017 /**
1018 1018 * Returns true if this is one of the specially treated methods for
1019 1019 * security related stack walks (like Reflection.getCallerClass).
1020 1020 */
1021 1021 bool Method::is_ignored_by_security_stack_walk() const {
1022 1022 const bool use_new_reflection = JDK_Version::is_gte_jdk14x_version() && UseNewReflection;
1023 1023
1024 1024 if (intrinsic_id() == vmIntrinsics::_invoke) {
1025 1025 // This is Method.invoke() -- ignore it
1026 1026 return true;
1027 1027 }
1028 1028 if (use_new_reflection &&
1029 1029 method_holder()->is_subclass_of(SystemDictionary::reflect_MethodAccessorImpl_klass())) {
1030 1030 // This is an auxilary frame -- ignore it
1031 1031 return true;
1032 1032 }
1033 1033 if (is_method_handle_intrinsic() || is_compiled_lambda_form()) {
1034 1034 // This is an internal adapter frame for method handles -- ignore it
1035 1035 return true;
1036 1036 }
1037 1037 return false;
1038 1038 }
1039 1039
1040 1040
1041 1041 // Constant pool structure for invoke methods:
1042 1042 enum {
1043 1043 _imcp_invoke_name = 1, // utf8: 'invokeExact', etc.
1044 1044 _imcp_invoke_signature, // utf8: (variable Symbol*)
1045 1045 _imcp_limit
1046 1046 };
1047 1047
1048 1048 // Test if this method is an MH adapter frame generated by Java code.
1049 1049 // Cf. java/lang/invoke/InvokerBytecodeGenerator
1050 1050 bool Method::is_compiled_lambda_form() const {
1051 1051 return intrinsic_id() == vmIntrinsics::_compiledLambdaForm;
1052 1052 }
1053 1053
1054 1054 // Test if this method is an internal MH primitive method.
1055 1055 bool Method::is_method_handle_intrinsic() const {
1056 1056 vmIntrinsics::ID iid = intrinsic_id();
1057 1057 return (MethodHandles::is_signature_polymorphic(iid) &&
1058 1058 MethodHandles::is_signature_polymorphic_intrinsic(iid));
1059 1059 }
1060 1060
1061 1061 bool Method::has_member_arg() const {
1062 1062 vmIntrinsics::ID iid = intrinsic_id();
1063 1063 return (MethodHandles::is_signature_polymorphic(iid) &&
1064 1064 MethodHandles::has_member_arg(iid));
1065 1065 }
1066 1066
1067 1067 // Make an instance of a signature-polymorphic internal MH primitive.
1068 1068 methodHandle Method::make_method_handle_intrinsic(vmIntrinsics::ID iid,
1069 1069 Symbol* signature,
1070 1070 TRAPS) {
1071 1071 ResourceMark rm;
1072 1072 methodHandle empty;
1073 1073
1074 1074 KlassHandle holder = SystemDictionary::MethodHandle_klass();
1075 1075 Symbol* name = MethodHandles::signature_polymorphic_intrinsic_name(iid);
1076 1076 assert(iid == MethodHandles::signature_polymorphic_name_id(name), "");
1077 1077 if (TraceMethodHandles) {
1078 1078 tty->print_cr("make_method_handle_intrinsic MH.%s%s", name->as_C_string(), signature->as_C_string());
1079 1079 }
1080 1080
1081 1081 // invariant: cp->symbol_at_put is preceded by a refcount increment (more usually a lookup)
1082 1082 name->increment_refcount();
1083 1083 signature->increment_refcount();
1084 1084
1085 1085 int cp_length = _imcp_limit;
1086 1086 ClassLoaderData* loader_data = holder->class_loader_data();
1087 1087 constantPoolHandle cp;
1088 1088 {
1089 1089 ConstantPool* cp_oop = ConstantPool::allocate(loader_data, cp_length, CHECK_(empty));
1090 1090 cp = constantPoolHandle(THREAD, cp_oop);
1091 1091 }
1092 1092 cp->set_pool_holder(InstanceKlass::cast(holder()));
1093 1093 cp->symbol_at_put(_imcp_invoke_name, name);
1094 1094 cp->symbol_at_put(_imcp_invoke_signature, signature);
1095 1095 cp->set_has_preresolution();
1096 1096
1097 1097 // decide on access bits: public or not?
1098 1098 int flags_bits = (JVM_ACC_NATIVE | JVM_ACC_SYNTHETIC | JVM_ACC_FINAL);
1099 1099 bool must_be_static = MethodHandles::is_signature_polymorphic_static(iid);
1100 1100 if (must_be_static) flags_bits |= JVM_ACC_STATIC;
1101 1101 assert((flags_bits & JVM_ACC_PUBLIC) == 0, "do not expose these methods");
1102 1102
1103 1103 methodHandle m;
1104 1104 {
1105 1105 InlineTableSizes sizes;
1106 1106 Method* m_oop = Method::allocate(loader_data, 0,
1107 1107 accessFlags_from(flags_bits), &sizes,
1108 1108 ConstMethod::NORMAL, CHECK_(empty));
1109 1109 m = methodHandle(THREAD, m_oop);
1110 1110 }
1111 1111 m->set_constants(cp());
1112 1112 m->set_name_index(_imcp_invoke_name);
1113 1113 m->set_signature_index(_imcp_invoke_signature);
1114 1114 assert(MethodHandles::is_signature_polymorphic_name(m->name()), "");
1115 1115 assert(m->signature() == signature, "");
1116 1116 #ifdef CC_INTERP
1117 1117 ResultTypeFinder rtf(signature);
1118 1118 m->set_result_index(rtf.type());
1119 1119 #endif
1120 1120 m->compute_size_of_parameters(THREAD);
1121 1121 m->init_intrinsic_id();
1122 1122 assert(m->is_method_handle_intrinsic(), "");
1123 1123 #ifdef ASSERT
1124 1124 if (!MethodHandles::is_signature_polymorphic(m->intrinsic_id())) m->print();
1125 1125 assert(MethodHandles::is_signature_polymorphic(m->intrinsic_id()), "must be an invoker");
1126 1126 assert(m->intrinsic_id() == iid, "correctly predicted iid");
1127 1127 #endif //ASSERT
1128 1128
1129 1129 // Finally, set up its entry points.
1130 1130 assert(m->can_be_statically_bound(), "");
1131 1131 m->set_vtable_index(Method::nonvirtual_vtable_index);
1132 1132 m->link_method(m, CHECK_(empty));
1133 1133
1134 1134 if (TraceMethodHandles && (Verbose || WizardMode))
1135 1135 m->print_on(tty);
1136 1136
1137 1137 return m;
1138 1138 }
1139 1139
1140 1140 Klass* Method::check_non_bcp_klass(Klass* klass) {
1141 1141 if (klass != NULL && klass->class_loader() != NULL) {
1142 1142 if (klass->oop_is_objArray())
1143 1143 klass = ObjArrayKlass::cast(klass)->bottom_klass();
1144 1144 return klass;
1145 1145 }
1146 1146 return NULL;
1147 1147 }
1148 1148
1149 1149
1150 1150 methodHandle Method::clone_with_new_data(methodHandle m, u_char* new_code, int new_code_length,
1151 1151 u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS) {
1152 1152 // Code below does not work for native methods - they should never get rewritten anyway
1153 1153 assert(!m->is_native(), "cannot rewrite native methods");
1154 1154 // Allocate new Method*
1155 1155 AccessFlags flags = m->access_flags();
1156 1156
1157 1157 ConstMethod* cm = m->constMethod();
1158 1158 int checked_exceptions_len = cm->checked_exceptions_length();
1159 1159 int localvariable_len = cm->localvariable_table_length();
1160 1160 int exception_table_len = cm->exception_table_length();
1161 1161 int method_parameters_len = cm->method_parameters_length();
1162 1162 int method_annotations_len = cm->method_annotations_length();
1163 1163 int parameter_annotations_len = cm->parameter_annotations_length();
1164 1164 int type_annotations_len = cm->type_annotations_length();
1165 1165 int default_annotations_len = cm->default_annotations_length();
1166 1166
1167 1167 InlineTableSizes sizes(
1168 1168 localvariable_len,
1169 1169 new_compressed_linenumber_size,
1170 1170 exception_table_len,
1171 1171 checked_exceptions_len,
1172 1172 method_parameters_len,
1173 1173 cm->generic_signature_index(),
1174 1174 method_annotations_len,
1175 1175 parameter_annotations_len,
1176 1176 type_annotations_len,
1177 1177 default_annotations_len,
1178 1178 0);
1179 1179
1180 1180 ClassLoaderData* loader_data = m->method_holder()->class_loader_data();
1181 1181 Method* newm_oop = Method::allocate(loader_data,
1182 1182 new_code_length,
1183 1183 flags,
1184 1184 &sizes,
1185 1185 m->method_type(),
1186 1186 CHECK_(methodHandle()));
1187 1187 methodHandle newm (THREAD, newm_oop);
1188 1188 int new_method_size = newm->method_size();
1189 1189
1190 1190 // Create a shallow copy of Method part, but be careful to preserve the new ConstMethod*
1191 1191 ConstMethod* newcm = newm->constMethod();
1192 1192 int new_const_method_size = newm->constMethod()->size();
1193 1193
1194 1194 memcpy(newm(), m(), sizeof(Method));
1195 1195
1196 1196 // Create shallow copy of ConstMethod.
1197 1197 memcpy(newcm, m->constMethod(), sizeof(ConstMethod));
1198 1198
1199 1199 // Reset correct method/const method, method size, and parameter info
1200 1200 newm->set_constMethod(newcm);
1201 1201 newm->constMethod()->set_code_size(new_code_length);
1202 1202 newm->constMethod()->set_constMethod_size(new_const_method_size);
1203 1203 newm->set_method_size(new_method_size);
1204 1204 assert(newm->code_size() == new_code_length, "check");
1205 1205 assert(newm->method_parameters_length() == method_parameters_len, "check");
1206 1206 assert(newm->checked_exceptions_length() == checked_exceptions_len, "check");
1207 1207 assert(newm->exception_table_length() == exception_table_len, "check");
1208 1208 assert(newm->localvariable_table_length() == localvariable_len, "check");
1209 1209 // Copy new byte codes
1210 1210 memcpy(newm->code_base(), new_code, new_code_length);
1211 1211 // Copy line number table
1212 1212 if (new_compressed_linenumber_size > 0) {
1213 1213 memcpy(newm->compressed_linenumber_table(),
1214 1214 new_compressed_linenumber_table,
1215 1215 new_compressed_linenumber_size);
1216 1216 }
1217 1217 // Copy method_parameters
1218 1218 if (method_parameters_len > 0) {
1219 1219 memcpy(newm->method_parameters_start(),
1220 1220 m->method_parameters_start(),
1221 1221 method_parameters_len * sizeof(MethodParametersElement));
1222 1222 }
1223 1223 // Copy checked_exceptions
1224 1224 if (checked_exceptions_len > 0) {
1225 1225 memcpy(newm->checked_exceptions_start(),
1226 1226 m->checked_exceptions_start(),
1227 1227 checked_exceptions_len * sizeof(CheckedExceptionElement));
1228 1228 }
1229 1229 // Copy exception table
1230 1230 if (exception_table_len > 0) {
1231 1231 memcpy(newm->exception_table_start(),
1232 1232 m->exception_table_start(),
1233 1233 exception_table_len * sizeof(ExceptionTableElement));
1234 1234 }
1235 1235 // Copy local variable number table
1236 1236 if (localvariable_len > 0) {
1237 1237 memcpy(newm->localvariable_table_start(),
1238 1238 m->localvariable_table_start(),
1239 1239 localvariable_len * sizeof(LocalVariableTableElement));
1240 1240 }
1241 1241 // Copy stackmap table
1242 1242 if (m->has_stackmap_table()) {
1243 1243 int code_attribute_length = m->stackmap_data()->length();
1244 1244 Array<u1>* stackmap_data =
1245 1245 MetadataFactory::new_array<u1>(loader_data, code_attribute_length, 0, CHECK_NULL);
1246 1246 memcpy((void*)stackmap_data->adr_at(0),
1247 1247 (void*)m->stackmap_data()->adr_at(0), code_attribute_length);
1248 1248 newm->set_stackmap_data(stackmap_data);
1249 1249 }
1250 1250
1251 1251 // copy annotations over to new method
1252 1252 newcm->copy_annotations_from(cm);
1253 1253 return newm;
1254 1254 }
1255 1255
1256 1256 vmSymbols::SID Method::klass_id_for_intrinsics(Klass* holder) {
1257 1257 // if loader is not the default loader (i.e., != NULL), we can't know the intrinsics
1258 1258 // because we are not loading from core libraries
1259 1259 // exception: the AES intrinsics come from lib/ext/sunjce_provider.jar
1260 1260 // which does not use the class default class loader so we check for its loader here
1261 1261 InstanceKlass* ik = InstanceKlass::cast(holder);
1262 1262 if ((ik->class_loader() != NULL) && !SystemDictionary::is_ext_class_loader(ik->class_loader())) {
1263 1263 return vmSymbols::NO_SID; // regardless of name, no intrinsics here
1264 1264 }
1265 1265
1266 1266 // see if the klass name is well-known:
1267 1267 Symbol* klass_name = ik->name();
1268 1268 return vmSymbols::find_sid(klass_name);
1269 1269 }
1270 1270
1271 1271 void Method::init_intrinsic_id() {
1272 1272 assert(_intrinsic_id == vmIntrinsics::_none, "do this just once");
1273 1273 const uintptr_t max_id_uint = right_n_bits((int)(sizeof(_intrinsic_id) * BitsPerByte));
1274 1274 assert((uintptr_t)vmIntrinsics::ID_LIMIT <= max_id_uint, "else fix size");
1275 1275 assert(intrinsic_id_size_in_bytes() == sizeof(_intrinsic_id), "");
1276 1276
1277 1277 // the klass name is well-known:
1278 1278 vmSymbols::SID klass_id = klass_id_for_intrinsics(method_holder());
1279 1279 assert(klass_id != vmSymbols::NO_SID, "caller responsibility");
1280 1280
1281 1281 // ditto for method and signature:
1282 1282 vmSymbols::SID name_id = vmSymbols::find_sid(name());
1283 1283 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle)
1284 1284 && name_id == vmSymbols::NO_SID)
1285 1285 return;
1286 1286 vmSymbols::SID sig_id = vmSymbols::find_sid(signature());
1287 1287 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle)
1288 1288 && sig_id == vmSymbols::NO_SID) return;
1289 1289 jshort flags = access_flags().as_short();
1290 1290
1291 1291 vmIntrinsics::ID id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1292 1292 if (id != vmIntrinsics::_none) {
1293 1293 set_intrinsic_id(id);
1294 1294 return;
1295 1295 }
1296 1296
1297 1297 // A few slightly irregular cases:
1298 1298 switch (klass_id) {
1299 1299 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_StrictMath):
1300 1300 // Second chance: check in regular Math.
1301 1301 switch (name_id) {
1302 1302 case vmSymbols::VM_SYMBOL_ENUM_NAME(min_name):
1303 1303 case vmSymbols::VM_SYMBOL_ENUM_NAME(max_name):
1304 1304 case vmSymbols::VM_SYMBOL_ENUM_NAME(sqrt_name):
1305 1305 // pretend it is the corresponding method in the non-strict class:
1306 1306 klass_id = vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_Math);
1307 1307 id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1308 1308 break;
1309 1309 }
1310 1310 break;
1311 1311
1312 1312 // Signature-polymorphic methods: MethodHandle.invoke*, InvokeDynamic.*.
1313 1313 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle):
1314 1314 if (!is_native()) break;
1315 1315 id = MethodHandles::signature_polymorphic_name_id(method_holder(), name());
1316 1316 if (is_static() != MethodHandles::is_signature_polymorphic_static(id))
1317 1317 id = vmIntrinsics::_none;
1318 1318 break;
1319 1319 }
1320 1320
1321 1321 if (id != vmIntrinsics::_none) {
1322 1322 // Set up its iid. It is an alias method.
1323 1323 set_intrinsic_id(id);
1324 1324 return;
1325 1325 }
1326 1326 }
1327 1327
1328 1328 // These two methods are static since a GC may move the Method
1329 1329 bool Method::load_signature_classes(methodHandle m, TRAPS) {
1330 1330 if (THREAD->is_Compiler_thread()) {
1331 1331 // There is nothing useful this routine can do from within the Compile thread.
1332 1332 // Hopefully, the signature contains only well-known classes.
1333 1333 // We could scan for this and return true/false, but the caller won't care.
1334 1334 return false;
1335 1335 }
1336 1336 bool sig_is_loaded = true;
1337 1337 Handle class_loader(THREAD, m->method_holder()->class_loader());
1338 1338 Handle protection_domain(THREAD, m->method_holder()->protection_domain());
1339 1339 ResourceMark rm(THREAD);
1340 1340 Symbol* signature = m->signature();
1341 1341 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1342 1342 if (ss.is_object()) {
1343 1343 Symbol* sym = ss.as_symbol(CHECK_(false));
1344 1344 Symbol* name = sym;
1345 1345 Klass* klass = SystemDictionary::resolve_or_null(name, class_loader,
1346 1346 protection_domain, THREAD);
1347 1347 // We are loading classes eagerly. If a ClassNotFoundException or
1348 1348 // a LinkageError was generated, be sure to ignore it.
1349 1349 if (HAS_PENDING_EXCEPTION) {
1350 1350 if (PENDING_EXCEPTION->is_a(SystemDictionary::ClassNotFoundException_klass()) ||
1351 1351 PENDING_EXCEPTION->is_a(SystemDictionary::LinkageError_klass())) {
1352 1352 CLEAR_PENDING_EXCEPTION;
1353 1353 } else {
1354 1354 return false;
1355 1355 }
1356 1356 }
1357 1357 if( klass == NULL) { sig_is_loaded = false; }
1358 1358 }
1359 1359 }
1360 1360 return sig_is_loaded;
1361 1361 }
1362 1362
1363 1363 bool Method::has_unloaded_classes_in_signature(methodHandle m, TRAPS) {
1364 1364 Handle class_loader(THREAD, m->method_holder()->class_loader());
1365 1365 Handle protection_domain(THREAD, m->method_holder()->protection_domain());
1366 1366 ResourceMark rm(THREAD);
1367 1367 Symbol* signature = m->signature();
1368 1368 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1369 1369 if (ss.type() == T_OBJECT) {
1370 1370 Symbol* name = ss.as_symbol_or_null();
1371 1371 if (name == NULL) return true;
1372 1372 Klass* klass = SystemDictionary::find(name, class_loader, protection_domain, THREAD);
1373 1373 if (klass == NULL) return true;
1374 1374 }
1375 1375 }
1376 1376 return false;
1377 1377 }
1378 1378
1379 1379 // Exposed so field engineers can debug VM
1380 1380 void Method::print_short_name(outputStream* st) {
1381 1381 ResourceMark rm;
1382 1382 #ifdef PRODUCT
1383 1383 st->print(" %s::", method_holder()->external_name());
1384 1384 #else
1385 1385 st->print(" %s::", method_holder()->internal_name());
1386 1386 #endif
1387 1387 name()->print_symbol_on(st);
1388 1388 if (WizardMode) signature()->print_symbol_on(st);
1389 1389 else if (MethodHandles::is_signature_polymorphic(intrinsic_id()))
1390 1390 MethodHandles::print_as_basic_type_signature_on(st, signature(), true);
1391 1391 }
1392 1392
1393 1393 // Comparer for sorting an object array containing
1394 1394 // Method*s.
1395 1395 static int method_comparator(Method* a, Method* b) {
1396 1396 return a->name()->fast_compare(b->name());
1397 1397 }
1398 1398
1399 1399 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array
1400 1400 // default_methods also uses this without the ordering for fast find_method
1401 1401 void Method::sort_methods(Array<Method*>* methods, bool idempotent, bool set_idnums) {
1402 1402 int length = methods->length();
1403 1403 if (length > 1) {
1404 1404 {
1405 1405 No_Safepoint_Verifier nsv;
1406 1406 QuickSort::sort<Method*>(methods->data(), length, method_comparator, idempotent);
1407 1407 }
1408 1408 // Reset method ordering
1409 1409 if (set_idnums) {
1410 1410 for (int i = 0; i < length; i++) {
1411 1411 Method* m = methods->at(i);
1412 1412 m->set_method_idnum(i);
1413 1413 }
1414 1414 }
1415 1415 }
1416 1416 }
1417 1417
1418 1418 //-----------------------------------------------------------------------------------
1419 1419 // Non-product code unless JVM/TI needs it
1420 1420
1421 1421 #if !defined(PRODUCT) || INCLUDE_JVMTI
1422 1422 class SignatureTypePrinter : public SignatureTypeNames {
1423 1423 private:
1424 1424 outputStream* _st;
1425 1425 bool _use_separator;
1426 1426
1427 1427 void type_name(const char* name) {
1428 1428 if (_use_separator) _st->print(", ");
1429 1429 _st->print("%s", name);
1430 1430 _use_separator = true;
1431 1431 }
1432 1432
1433 1433 public:
1434 1434 SignatureTypePrinter(Symbol* signature, outputStream* st) : SignatureTypeNames(signature) {
1435 1435 _st = st;
1436 1436 _use_separator = false;
1437 1437 }
1438 1438
1439 1439 void print_parameters() { _use_separator = false; iterate_parameters(); }
1440 1440 void print_returntype() { _use_separator = false; iterate_returntype(); }
1441 1441 };
1442 1442
1443 1443
1444 1444 void Method::print_name(outputStream* st) {
1445 1445 Thread *thread = Thread::current();
1446 1446 ResourceMark rm(thread);
1447 1447 SignatureTypePrinter sig(signature(), st);
1448 1448 st->print("%s ", is_static() ? "static" : "virtual");
1449 1449 sig.print_returntype();
1450 1450 st->print(" %s.", method_holder()->internal_name());
1451 1451 name()->print_symbol_on(st);
1452 1452 st->print("(");
1453 1453 sig.print_parameters();
1454 1454 st->print(")");
1455 1455 }
1456 1456 #endif // !PRODUCT || INCLUDE_JVMTI
1457 1457
1458 1458
1459 1459 //-----------------------------------------------------------------------------------
1460 1460 // Non-product code
1461 1461
1462 1462 #ifndef PRODUCT
1463 1463 void Method::print_codes_on(outputStream* st) const {
1464 1464 print_codes_on(0, code_size(), st);
1465 1465 }
1466 1466
1467 1467 void Method::print_codes_on(int from, int to, outputStream* st) const {
1468 1468 Thread *thread = Thread::current();
1469 1469 ResourceMark rm(thread);
1470 1470 methodHandle mh (thread, (Method*)this);
1471 1471 BytecodeStream s(mh);
1472 1472 s.set_interval(from, to);
1473 1473 BytecodeTracer::set_closure(BytecodeTracer::std_closure());
1474 1474 while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st);
1475 1475 }
1476 1476 #endif // not PRODUCT
1477 1477
1478 1478
1479 1479 // Simple compression of line number tables. We use a regular compressed stream, except that we compress deltas
1480 1480 // between (bci,line) pairs since they are smaller. If (bci delta, line delta) fits in (5-bit unsigned, 3-bit unsigned)
1481 1481 // we save it as one byte, otherwise we write a 0xFF escape character and use regular compression. 0x0 is used
1482 1482 // as end-of-stream terminator.
1483 1483
1484 1484 void CompressedLineNumberWriteStream::write_pair_regular(int bci_delta, int line_delta) {
1485 1485 // bci and line number does not compress into single byte.
1486 1486 // Write out escape character and use regular compression for bci and line number.
1487 1487 write_byte((jubyte)0xFF);
1488 1488 write_signed_int(bci_delta);
1489 1489 write_signed_int(line_delta);
1490 1490 }
1491 1491
1492 1492 // See comment in method.hpp which explains why this exists.
1493 1493 #if defined(_M_AMD64) && _MSC_VER >= 1400
1494 1494 #pragma optimize("", off)
1495 1495 void CompressedLineNumberWriteStream::write_pair(int bci, int line) {
1496 1496 write_pair_inline(bci, line);
1497 1497 }
1498 1498 #pragma optimize("", on)
1499 1499 #endif
1500 1500
1501 1501 CompressedLineNumberReadStream::CompressedLineNumberReadStream(u_char* buffer) : CompressedReadStream(buffer) {
1502 1502 _bci = 0;
1503 1503 _line = 0;
1504 1504 };
1505 1505
1506 1506
1507 1507 bool CompressedLineNumberReadStream::read_pair() {
1508 1508 jubyte next = read_byte();
1509 1509 // Check for terminator
1510 1510 if (next == 0) return false;
1511 1511 if (next == 0xFF) {
1512 1512 // Escape character, regular compression used
1513 1513 _bci += read_signed_int();
1514 1514 _line += read_signed_int();
1515 1515 } else {
1516 1516 // Single byte compression used
1517 1517 _bci += next >> 3;
1518 1518 _line += next & 0x7;
1519 1519 }
1520 1520 return true;
1521 1521 }
1522 1522
1523 1523
1524 1524 Bytecodes::Code Method::orig_bytecode_at(int bci) const {
1525 1525 BreakpointInfo* bp = method_holder()->breakpoints();
1526 1526 for (; bp != NULL; bp = bp->next()) {
1527 1527 if (bp->match(this, bci)) {
1528 1528 return bp->orig_bytecode();
1529 1529 }
1530 1530 }
1531 1531 {
1532 1532 ResourceMark rm;
1533 1533 fatal(err_msg("no original bytecode found in %s at bci %d", name_and_sig_as_C_string(), bci));
1534 1534 }
1535 1535 return Bytecodes::_shouldnotreachhere;
1536 1536 }
1537 1537
1538 1538 void Method::set_orig_bytecode_at(int bci, Bytecodes::Code code) {
1539 1539 assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way");
1540 1540 BreakpointInfo* bp = method_holder()->breakpoints();
1541 1541 for (; bp != NULL; bp = bp->next()) {
1542 1542 if (bp->match(this, bci)) {
1543 1543 bp->set_orig_bytecode(code);
1544 1544 // and continue, in case there is more than one
1545 1545 }
1546 1546 }
1547 1547 }
1548 1548
1549 1549 void Method::set_breakpoint(int bci) {
1550 1550 InstanceKlass* ik = method_holder();
1551 1551 BreakpointInfo *bp = new BreakpointInfo(this, bci);
1552 1552 bp->set_next(ik->breakpoints());
1553 1553 ik->set_breakpoints(bp);
1554 1554 // do this last:
1555 1555 bp->set(this);
1556 1556 }
1557 1557
1558 1558 static void clear_matches(Method* m, int bci) {
1559 1559 InstanceKlass* ik = m->method_holder();
1560 1560 BreakpointInfo* prev_bp = NULL;
1561 1561 BreakpointInfo* next_bp;
1562 1562 for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) {
1563 1563 next_bp = bp->next();
1564 1564 // bci value of -1 is used to delete all breakpoints in method m (ex: clear_all_breakpoint).
1565 1565 if (bci >= 0 ? bp->match(m, bci) : bp->match(m)) {
1566 1566 // do this first:
1567 1567 bp->clear(m);
1568 1568 // unhook it
1569 1569 if (prev_bp != NULL)
1570 1570 prev_bp->set_next(next_bp);
1571 1571 else
1572 1572 ik->set_breakpoints(next_bp);
1573 1573 delete bp;
1574 1574 // When class is redefined JVMTI sets breakpoint in all versions of EMCP methods
1575 1575 // at same location. So we have multiple matching (method_index and bci)
1576 1576 // BreakpointInfo nodes in BreakpointInfo list. We should just delete one
1577 1577 // breakpoint for clear_breakpoint request and keep all other method versions
1578 1578 // BreakpointInfo for future clear_breakpoint request.
1579 1579 // bcivalue of -1 is used to clear all breakpoints (see clear_all_breakpoints)
1580 1580 // which is being called when class is unloaded. We delete all the Breakpoint
1581 1581 // information for all versions of method. We may not correctly restore the original
1582 1582 // bytecode in all method versions, but that is ok. Because the class is being unloaded
1583 1583 // so these methods won't be used anymore.
1584 1584 if (bci >= 0) {
1585 1585 break;
1586 1586 }
1587 1587 } else {
1588 1588 // This one is a keeper.
1589 1589 prev_bp = bp;
1590 1590 }
1591 1591 }
1592 1592 }
1593 1593
1594 1594 void Method::clear_breakpoint(int bci) {
1595 1595 assert(bci >= 0, "");
1596 1596 clear_matches(this, bci);
1597 1597 }
1598 1598
1599 1599 void Method::clear_all_breakpoints() {
1600 1600 clear_matches(this, -1);
1601 1601 }
1602 1602
1603 1603
1604 1604 int Method::invocation_count() {
1605 1605 MethodCounters *mcs = method_counters();
1606 1606 if (TieredCompilation) {
1607 1607 MethodData* const mdo = method_data();
1608 1608 if (((mcs != NULL) ? mcs->invocation_counter()->carry() : false) ||
1609 1609 ((mdo != NULL) ? mdo->invocation_counter()->carry() : false)) {
1610 1610 return InvocationCounter::count_limit;
1611 1611 } else {
1612 1612 return ((mcs != NULL) ? mcs->invocation_counter()->count() : 0) +
1613 1613 ((mdo != NULL) ? mdo->invocation_counter()->count() : 0);
1614 1614 }
1615 1615 } else {
1616 1616 return (mcs == NULL) ? 0 : mcs->invocation_counter()->count();
1617 1617 }
1618 1618 }
1619 1619
1620 1620 int Method::backedge_count() {
1621 1621 MethodCounters *mcs = method_counters();
1622 1622 if (TieredCompilation) {
1623 1623 MethodData* const mdo = method_data();
1624 1624 if (((mcs != NULL) ? mcs->backedge_counter()->carry() : false) ||
1625 1625 ((mdo != NULL) ? mdo->backedge_counter()->carry() : false)) {
1626 1626 return InvocationCounter::count_limit;
1627 1627 } else {
1628 1628 return ((mcs != NULL) ? mcs->backedge_counter()->count() : 0) +
1629 1629 ((mdo != NULL) ? mdo->backedge_counter()->count() : 0);
1630 1630 }
1631 1631 } else {
1632 1632 return (mcs == NULL) ? 0 : mcs->backedge_counter()->count();
1633 1633 }
1634 1634 }
1635 1635
1636 1636 int Method::highest_comp_level() const {
1637 1637 const MethodCounters* mcs = method_counters();
1638 1638 if (mcs != NULL) {
1639 1639 return mcs->highest_comp_level();
1640 1640 } else {
1641 1641 return CompLevel_none;
1642 1642 }
1643 1643 }
1644 1644
1645 1645 int Method::highest_osr_comp_level() const {
1646 1646 const MethodCounters* mcs = method_counters();
1647 1647 if (mcs != NULL) {
1648 1648 return mcs->highest_osr_comp_level();
1649 1649 } else {
1650 1650 return CompLevel_none;
1651 1651 }
1652 1652 }
1653 1653
1654 1654 void Method::set_highest_comp_level(int level) {
1655 1655 MethodCounters* mcs = method_counters();
1656 1656 if (mcs != NULL) {
1657 1657 mcs->set_highest_comp_level(level);
1658 1658 }
1659 1659 }
1660 1660
1661 1661 void Method::set_highest_osr_comp_level(int level) {
1662 1662 MethodCounters* mcs = method_counters();
1663 1663 if (mcs != NULL) {
1664 1664 mcs->set_highest_osr_comp_level(level);
1665 1665 }
1666 1666 }
1667 1667
1668 1668 BreakpointInfo::BreakpointInfo(Method* m, int bci) {
1669 1669 _bci = bci;
1670 1670 _name_index = m->name_index();
1671 1671 _signature_index = m->signature_index();
1672 1672 _orig_bytecode = (Bytecodes::Code) *m->bcp_from(_bci);
1673 1673 if (_orig_bytecode == Bytecodes::_breakpoint)
1674 1674 _orig_bytecode = m->orig_bytecode_at(_bci);
1675 1675 _next = NULL;
1676 1676 }
1677 1677
1678 1678 void BreakpointInfo::set(Method* method) {
1679 1679 #ifdef ASSERT
1680 1680 {
1681 1681 Bytecodes::Code code = (Bytecodes::Code) *method->bcp_from(_bci);
1682 1682 if (code == Bytecodes::_breakpoint)
1683 1683 code = method->orig_bytecode_at(_bci);
1684 1684 assert(orig_bytecode() == code, "original bytecode must be the same");
1685 1685 }
1686 1686 #endif
1687 1687 Thread *thread = Thread::current();
1688 1688 *method->bcp_from(_bci) = Bytecodes::_breakpoint;
1689 1689 method->incr_number_of_breakpoints(thread);
1690 1690 SystemDictionary::notice_modification();
1691 1691 {
1692 1692 // Deoptimize all dependents on this method
1693 1693 HandleMark hm(thread);
1694 1694 methodHandle mh(thread, method);
1695 1695 Universe::flush_dependents_on_method(mh);
1696 1696 }
1697 1697 }
1698 1698
1699 1699 void BreakpointInfo::clear(Method* method) {
1700 1700 *method->bcp_from(_bci) = orig_bytecode();
1701 1701 assert(method->number_of_breakpoints() > 0, "must not go negative");
1702 1702 method->decr_number_of_breakpoints(Thread::current());
1703 1703 }
1704 1704
1705 1705 // jmethodID handling
1706 1706
1707 1707 // This is a block allocating object, sort of like JNIHandleBlock, only a
1708 1708 // lot simpler. There aren't many of these, they aren't long, they are rarely
1709 1709 // deleted and so we can do some suboptimal things.
1710 1710 // It's allocated on the CHeap because once we allocate a jmethodID, we can
1711 1711 // never get rid of it.
1712 1712 // It would be nice to be able to parameterize the number of methods for
1713 1713 // the null_class_loader but then we'd have to turn this and ClassLoaderData
1714 1714 // into templates.
1715 1715
1716 1716 // I feel like this brain dead class should exist somewhere in the STL
1717 1717
1718 1718 class JNIMethodBlock : public CHeapObj<mtClass> {
1719 1719 enum { number_of_methods = 8 };
1720 1720
1721 1721 Method* _methods[number_of_methods];
1722 1722 int _top;
1723 1723 JNIMethodBlock* _next;
1724 1724 public:
1725 1725 static Method* const _free_method;
1726 1726
1727 1727 JNIMethodBlock() : _next(NULL), _top(0) {
1728 1728 for (int i = 0; i< number_of_methods; i++) _methods[i] = _free_method;
1729 1729 }
1730 1730
1731 1731 Method** add_method(Method* m) {
1732 1732 if (_top < number_of_methods) {
1733 1733 // top points to the next free entry.
1734 1734 int i = _top;
1735 1735 _methods[i] = m;
1736 1736 _top++;
1737 1737 return &_methods[i];
1738 1738 } else if (_top == number_of_methods) {
1739 1739 // if the next free entry ran off the block see if there's a free entry
1740 1740 for (int i = 0; i< number_of_methods; i++) {
1741 1741 if (_methods[i] == _free_method) {
1742 1742 _methods[i] = m;
1743 1743 return &_methods[i];
1744 1744 }
1745 1745 }
1746 1746 // Only check each block once for frees. They're very unlikely.
1747 1747 // Increment top past the end of the block.
1748 1748 _top++;
1749 1749 }
1750 1750 // need to allocate a next block.
1751 1751 if (_next == NULL) {
1752 1752 _next = new JNIMethodBlock();
1753 1753 }
1754 1754 return _next->add_method(m);
1755 1755 }
1756 1756
1757 1757 bool contains(Method** m) {
1758 1758 for (JNIMethodBlock* b = this; b != NULL; b = b->_next) {
1759 1759 for (int i = 0; i< number_of_methods; i++) {
1760 1760 if (&(b->_methods[i]) == m) {
1761 1761 return true;
1762 1762 }
1763 1763 }
1764 1764 }
1765 1765 return false; // not found
1766 1766 }
1767 1767
1768 1768 // Doesn't really destroy it, just marks it as free so it can be reused.
1769 1769 void destroy_method(Method** m) {
1770 1770 #ifdef ASSERT
1771 1771 assert(contains(m), "should be a methodID");
1772 1772 #endif // ASSERT
1773 1773 *m = _free_method;
1774 1774 }
1775 1775
1776 1776 // During class unloading the methods are cleared, which is different
1777 1777 // than freed.
1778 1778 void clear_all_methods() {
1779 1779 for (JNIMethodBlock* b = this; b != NULL; b = b->_next) {
1780 1780 for (int i = 0; i< number_of_methods; i++) {
1781 1781 _methods[i] = NULL;
1782 1782 }
1783 1783 }
1784 1784 }
1785 1785 #ifndef PRODUCT
1786 1786 int count_methods() {
1787 1787 // count all allocated methods
1788 1788 int count = 0;
1789 1789 for (JNIMethodBlock* b = this; b != NULL; b = b->_next) {
1790 1790 for (int i = 0; i< number_of_methods; i++) {
1791 1791 if (_methods[i] != _free_method) count++;
1792 1792 }
1793 1793 }
1794 1794 return count;
1795 1795 }
1796 1796 #endif // PRODUCT
1797 1797 };
1798 1798
1799 1799 // Something that can't be mistaken for an address or a markOop
1800 1800 Method* const JNIMethodBlock::_free_method = (Method*)55;
1801 1801
1802 1802 // Add a method id to the jmethod_ids
1803 1803 jmethodID Method::make_jmethod_id(ClassLoaderData* loader_data, Method* m) {
1804 1804 ClassLoaderData* cld = loader_data;
1805 1805
1806 1806 if (!SafepointSynchronize::is_at_safepoint()) {
1807 1807 // Have to add jmethod_ids() to class loader data thread-safely.
1808 1808 // Also have to add the method to the list safely, which the cld lock
1809 1809 // protects as well.
1810 1810 MutexLockerEx ml(cld->metaspace_lock(), Mutex::_no_safepoint_check_flag);
1811 1811 if (cld->jmethod_ids() == NULL) {
1812 1812 cld->set_jmethod_ids(new JNIMethodBlock());
1813 1813 }
1814 1814 // jmethodID is a pointer to Method*
1815 1815 return (jmethodID)cld->jmethod_ids()->add_method(m);
1816 1816 } else {
1817 1817 // At safepoint, we are single threaded and can set this.
1818 1818 if (cld->jmethod_ids() == NULL) {
1819 1819 cld->set_jmethod_ids(new JNIMethodBlock());
1820 1820 }
1821 1821 // jmethodID is a pointer to Method*
1822 1822 return (jmethodID)cld->jmethod_ids()->add_method(m);
1823 1823 }
1824 1824 }
1825 1825
1826 1826 // Mark a jmethodID as free. This is called when there is a data race in
1827 1827 // InstanceKlass while creating the jmethodID cache.
1828 1828 void Method::destroy_jmethod_id(ClassLoaderData* loader_data, jmethodID m) {
1829 1829 ClassLoaderData* cld = loader_data;
1830 1830 Method** ptr = (Method**)m;
1831 1831 assert(cld->jmethod_ids() != NULL, "should have method handles");
1832 1832 cld->jmethod_ids()->destroy_method(ptr);
1833 1833 }
1834 1834
1835 1835 void Method::change_method_associated_with_jmethod_id(jmethodID jmid, Method* new_method) {
1836 1836 // Can't assert the method_holder is the same because the new method has the
1837 1837 // scratch method holder.
1838 1838 assert(resolve_jmethod_id(jmid)->method_holder()->class_loader()
1839 1839 == new_method->method_holder()->class_loader(),
1840 1840 "changing to a different class loader");
1841 1841 // Just change the method in place, jmethodID pointer doesn't change.
1842 1842 *((Method**)jmid) = new_method;
1843 1843 }
1844 1844
1845 1845 bool Method::is_method_id(jmethodID mid) {
1846 1846 Method* m = resolve_jmethod_id(mid);
1847 1847 assert(m != NULL, "should be called with non-null method");
1848 1848 InstanceKlass* ik = m->method_holder();
1849 1849 ClassLoaderData* cld = ik->class_loader_data();
1850 1850 if (cld->jmethod_ids() == NULL) return false;
1851 1851 return (cld->jmethod_ids()->contains((Method**)mid));
1852 1852 }
1853 1853
1854 1854 Method* Method::checked_resolve_jmethod_id(jmethodID mid) {
1855 1855 if (mid == NULL) return NULL;
|
↓ open down ↓ |
1855 lines elided |
↑ open up ↑ |
1856 1856 Method* o = resolve_jmethod_id(mid);
1857 1857 if (o == NULL || o == JNIMethodBlock::_free_method || !((Metadata*)o)->is_method()) {
1858 1858 return NULL;
1859 1859 }
1860 1860 return o;
1861 1861 };
1862 1862
1863 1863 void Method::set_on_stack(const bool value) {
1864 1864 // Set both the method itself and its constant pool. The constant pool
1865 1865 // on stack means some method referring to it is also on the stack.
1866 - _access_flags.set_on_stack(value);
1867 1866 constants()->set_on_stack(value);
1868 - if (value) MetadataOnStackMark::record(this);
1867 +
1868 + bool succeeded = _access_flags.set_on_stack(value);
1869 + if (value && succeeded) {
1870 + MetadataOnStackMark::record(this, Thread::current());
1871 + }
1869 1872 }
1870 1873
1871 1874 // Called when the class loader is unloaded to make all methods weak.
1872 1875 void Method::clear_jmethod_ids(ClassLoaderData* loader_data) {
1873 1876 loader_data->jmethod_ids()->clear_all_methods();
1874 1877 }
1875 1878
1876 1879 bool Method::has_method_vptr(const void* ptr) {
1877 1880 Method m;
1878 1881 // This assumes that the vtbl pointer is the first word of a C++ object.
1879 1882 // This assumption is also in universe.cpp patch_klass_vtble
1880 1883 void* vtbl2 = dereference_vptr((const void*)&m);
1881 1884 void* this_vtbl = dereference_vptr(ptr);
1882 1885 return vtbl2 == this_vtbl;
1883 1886 }
1884 1887
1885 1888 // Check that this pointer is valid by checking that the vtbl pointer matches
1886 1889 bool Method::is_valid_method() const {
1887 1890 if (this == NULL) {
1888 1891 return false;
1889 1892 } else if (!is_metaspace_object()) {
1890 1893 return false;
1891 1894 } else {
1892 1895 return has_method_vptr((const void*)this);
1893 1896 }
1894 1897 }
1895 1898
1896 1899 #ifndef PRODUCT
1897 1900 void Method::print_jmethod_ids(ClassLoaderData* loader_data, outputStream* out) {
1898 1901 out->print_cr("jni_method_id count = %d", loader_data->jmethod_ids()->count_methods());
1899 1902 }
1900 1903 #endif // PRODUCT
1901 1904
1902 1905
1903 1906 // Printing
1904 1907
1905 1908 #ifndef PRODUCT
1906 1909
1907 1910 void Method::print_on(outputStream* st) const {
1908 1911 ResourceMark rm;
1909 1912 assert(is_method(), "must be method");
1910 1913 st->print_cr("%s", internal_name());
1911 1914 // get the effect of PrintOopAddress, always, for methods:
1912 1915 st->print_cr(" - this oop: "INTPTR_FORMAT, (intptr_t)this);
1913 1916 st->print (" - method holder: "); method_holder()->print_value_on(st); st->cr();
1914 1917 st->print (" - constants: "INTPTR_FORMAT" ", (address)constants());
1915 1918 constants()->print_value_on(st); st->cr();
1916 1919 st->print (" - access: 0x%x ", access_flags().as_int()); access_flags().print_on(st); st->cr();
1917 1920 st->print (" - name: "); name()->print_value_on(st); st->cr();
1918 1921 st->print (" - signature: "); signature()->print_value_on(st); st->cr();
1919 1922 st->print_cr(" - max stack: %d", max_stack());
1920 1923 st->print_cr(" - max locals: %d", max_locals());
1921 1924 st->print_cr(" - size of params: %d", size_of_parameters());
1922 1925 st->print_cr(" - method size: %d", method_size());
1923 1926 if (intrinsic_id() != vmIntrinsics::_none)
1924 1927 st->print_cr(" - intrinsic id: %d %s", intrinsic_id(), vmIntrinsics::name_at(intrinsic_id()));
1925 1928 if (highest_comp_level() != CompLevel_none)
1926 1929 st->print_cr(" - highest level: %d", highest_comp_level());
1927 1930 st->print_cr(" - vtable index: %d", _vtable_index);
1928 1931 st->print_cr(" - i2i entry: " INTPTR_FORMAT, interpreter_entry());
1929 1932 st->print( " - adapters: ");
1930 1933 AdapterHandlerEntry* a = ((Method*)this)->adapter();
1931 1934 if (a == NULL)
1932 1935 st->print_cr(INTPTR_FORMAT, a);
1933 1936 else
1934 1937 a->print_adapter_on(st);
1935 1938 st->print_cr(" - compiled entry " INTPTR_FORMAT, from_compiled_entry());
1936 1939 st->print_cr(" - code size: %d", code_size());
1937 1940 if (code_size() != 0) {
1938 1941 st->print_cr(" - code start: " INTPTR_FORMAT, code_base());
1939 1942 st->print_cr(" - code end (excl): " INTPTR_FORMAT, code_base() + code_size());
1940 1943 }
1941 1944 if (method_data() != NULL) {
1942 1945 st->print_cr(" - method data: " INTPTR_FORMAT, (address)method_data());
1943 1946 }
1944 1947 st->print_cr(" - checked ex length: %d", checked_exceptions_length());
1945 1948 if (checked_exceptions_length() > 0) {
1946 1949 CheckedExceptionElement* table = checked_exceptions_start();
1947 1950 st->print_cr(" - checked ex start: " INTPTR_FORMAT, table);
1948 1951 if (Verbose) {
1949 1952 for (int i = 0; i < checked_exceptions_length(); i++) {
1950 1953 st->print_cr(" - throws %s", constants()->printable_name_at(table[i].class_cp_index));
1951 1954 }
1952 1955 }
1953 1956 }
1954 1957 if (has_linenumber_table()) {
1955 1958 u_char* table = compressed_linenumber_table();
1956 1959 st->print_cr(" - linenumber start: " INTPTR_FORMAT, table);
1957 1960 if (Verbose) {
1958 1961 CompressedLineNumberReadStream stream(table);
1959 1962 while (stream.read_pair()) {
1960 1963 st->print_cr(" - line %d: %d", stream.line(), stream.bci());
1961 1964 }
1962 1965 }
1963 1966 }
1964 1967 st->print_cr(" - localvar length: %d", localvariable_table_length());
1965 1968 if (localvariable_table_length() > 0) {
1966 1969 LocalVariableTableElement* table = localvariable_table_start();
1967 1970 st->print_cr(" - localvar start: " INTPTR_FORMAT, table);
1968 1971 if (Verbose) {
1969 1972 for (int i = 0; i < localvariable_table_length(); i++) {
1970 1973 int bci = table[i].start_bci;
1971 1974 int len = table[i].length;
1972 1975 const char* name = constants()->printable_name_at(table[i].name_cp_index);
1973 1976 const char* desc = constants()->printable_name_at(table[i].descriptor_cp_index);
1974 1977 int slot = table[i].slot;
1975 1978 st->print_cr(" - %s %s bci=%d len=%d slot=%d", desc, name, bci, len, slot);
1976 1979 }
1977 1980 }
1978 1981 }
1979 1982 if (code() != NULL) {
1980 1983 st->print (" - compiled code: ");
1981 1984 code()->print_value_on(st);
1982 1985 }
1983 1986 if (is_native()) {
1984 1987 st->print_cr(" - native function: " INTPTR_FORMAT, native_function());
1985 1988 st->print_cr(" - signature handler: " INTPTR_FORMAT, signature_handler());
1986 1989 }
1987 1990 }
1988 1991
1989 1992 #endif //PRODUCT
1990 1993
1991 1994 void Method::print_value_on(outputStream* st) const {
1992 1995 assert(is_method(), "must be method");
1993 1996 st->print("%s", internal_name());
1994 1997 print_address_on(st);
1995 1998 st->print(" ");
1996 1999 name()->print_value_on(st);
1997 2000 st->print(" ");
1998 2001 signature()->print_value_on(st);
1999 2002 st->print(" in ");
2000 2003 method_holder()->print_value_on(st);
2001 2004 if (WizardMode) st->print("#%d", _vtable_index);
2002 2005 if (WizardMode) st->print("[%d,%d]", size_of_parameters(), max_locals());
2003 2006 if (WizardMode && code() != NULL) st->print(" ((nmethod*)%p)", code());
2004 2007 }
2005 2008
2006 2009 #if INCLUDE_SERVICES
2007 2010 // Size Statistics
2008 2011 void Method::collect_statistics(KlassSizeStats *sz) const {
2009 2012 int mysize = sz->count(this);
2010 2013 sz->_method_bytes += mysize;
2011 2014 sz->_method_all_bytes += mysize;
2012 2015 sz->_rw_bytes += mysize;
2013 2016
2014 2017 if (constMethod()) {
2015 2018 constMethod()->collect_statistics(sz);
2016 2019 }
2017 2020 if (method_data()) {
2018 2021 method_data()->collect_statistics(sz);
2019 2022 }
2020 2023 }
2021 2024 #endif // INCLUDE_SERVICES
2022 2025
2023 2026 // Verification
2024 2027
2025 2028 void Method::verify_on(outputStream* st) {
2026 2029 guarantee(is_method(), "object must be method");
2027 2030 guarantee(constants()->is_constantPool(), "should be constant pool");
2028 2031 guarantee(constMethod()->is_constMethod(), "should be ConstMethod*");
2029 2032 MethodData* md = method_data();
2030 2033 guarantee(md == NULL ||
2031 2034 md->is_methodData(), "should be method data");
2032 2035 }
|
↓ open down ↓ |
154 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX