Tue, 15 Sep 2009 21:53:47 -0700
6863023: need non-perm oops in code cache for JSR 292
Summary: Make a special root-list for those few nmethods which might contain non-perm oops.
Reviewed-by: twisti, kvn, never, jmasa, ysr
1 /*
2 * Copyright 1997-2009 Sun Microsystems, Inc. All Rights Reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
25 # include "incls/_precompiled.incl"
26 # include "incls/_instanceKlass.cpp.incl"
28 bool instanceKlass::should_be_initialized() const {
29 return !is_initialized();
30 }
32 klassVtable* instanceKlass::vtable() const {
33 return new klassVtable(as_klassOop(), start_of_vtable(), vtable_length() / vtableEntry::size());
34 }
36 klassItable* instanceKlass::itable() const {
37 return new klassItable(as_klassOop());
38 }
40 void instanceKlass::eager_initialize(Thread *thread) {
41 if (!EagerInitialization) return;
43 if (this->is_not_initialized()) {
44 // abort if the the class has a class initializer
45 if (this->class_initializer() != NULL) return;
47 // abort if it is java.lang.Object (initialization is handled in genesis)
48 klassOop super = this->super();
49 if (super == NULL) return;
51 // abort if the super class should be initialized
52 if (!instanceKlass::cast(super)->is_initialized()) return;
54 // call body to expose the this pointer
55 instanceKlassHandle this_oop(thread, this->as_klassOop());
56 eager_initialize_impl(this_oop);
57 }
58 }
61 void instanceKlass::eager_initialize_impl(instanceKlassHandle this_oop) {
62 EXCEPTION_MARK;
63 ObjectLocker ol(this_oop, THREAD);
65 // abort if someone beat us to the initialization
66 if (!this_oop->is_not_initialized()) return; // note: not equivalent to is_initialized()
68 ClassState old_state = this_oop->_init_state;
69 link_class_impl(this_oop, true, THREAD);
70 if (HAS_PENDING_EXCEPTION) {
71 CLEAR_PENDING_EXCEPTION;
72 // Abort if linking the class throws an exception.
74 // Use a test to avoid redundantly resetting the state if there's
75 // no change. Set_init_state() asserts that state changes make
76 // progress, whereas here we might just be spinning in place.
77 if( old_state != this_oop->_init_state )
78 this_oop->set_init_state (old_state);
79 } else {
80 // linking successfull, mark class as initialized
81 this_oop->set_init_state (fully_initialized);
82 // trace
83 if (TraceClassInitialization) {
84 ResourceMark rm(THREAD);
85 tty->print_cr("[Initialized %s without side effects]", this_oop->external_name());
86 }
87 }
88 }
91 // See "The Virtual Machine Specification" section 2.16.5 for a detailed explanation of the class initialization
92 // process. The step comments refers to the procedure described in that section.
93 // Note: implementation moved to static method to expose the this pointer.
94 void instanceKlass::initialize(TRAPS) {
95 if (this->should_be_initialized()) {
96 HandleMark hm(THREAD);
97 instanceKlassHandle this_oop(THREAD, this->as_klassOop());
98 initialize_impl(this_oop, CHECK);
99 // Note: at this point the class may be initialized
100 // OR it may be in the state of being initialized
101 // in case of recursive initialization!
102 } else {
103 assert(is_initialized(), "sanity check");
104 }
105 }
108 bool instanceKlass::verify_code(
109 instanceKlassHandle this_oop, bool throw_verifyerror, TRAPS) {
110 // 1) Verify the bytecodes
111 Verifier::Mode mode =
112 throw_verifyerror ? Verifier::ThrowException : Verifier::NoException;
113 return Verifier::verify(this_oop, mode, CHECK_false);
114 }
117 // Used exclusively by the shared spaces dump mechanism to prevent
118 // classes mapped into the shared regions in new VMs from appearing linked.
120 void instanceKlass::unlink_class() {
121 assert(is_linked(), "must be linked");
122 _init_state = loaded;
123 }
125 void instanceKlass::link_class(TRAPS) {
126 assert(is_loaded(), "must be loaded");
127 if (!is_linked()) {
128 instanceKlassHandle this_oop(THREAD, this->as_klassOop());
129 link_class_impl(this_oop, true, CHECK);
130 }
131 }
133 // Called to verify that a class can link during initialization, without
134 // throwing a VerifyError.
135 bool instanceKlass::link_class_or_fail(TRAPS) {
136 assert(is_loaded(), "must be loaded");
137 if (!is_linked()) {
138 instanceKlassHandle this_oop(THREAD, this->as_klassOop());
139 link_class_impl(this_oop, false, CHECK_false);
140 }
141 return is_linked();
142 }
144 bool instanceKlass::link_class_impl(
145 instanceKlassHandle this_oop, bool throw_verifyerror, TRAPS) {
146 // check for error state
147 if (this_oop->is_in_error_state()) {
148 ResourceMark rm(THREAD);
149 THROW_MSG_(vmSymbols::java_lang_NoClassDefFoundError(),
150 this_oop->external_name(), false);
151 }
152 // return if already verified
153 if (this_oop->is_linked()) {
154 return true;
155 }
157 // Timing
158 // timer handles recursion
159 assert(THREAD->is_Java_thread(), "non-JavaThread in link_class_impl");
160 JavaThread* jt = (JavaThread*)THREAD;
162 // link super class before linking this class
163 instanceKlassHandle super(THREAD, this_oop->super());
164 if (super.not_null()) {
165 if (super->is_interface()) { // check if super class is an interface
166 ResourceMark rm(THREAD);
167 Exceptions::fthrow(
168 THREAD_AND_LOCATION,
169 vmSymbolHandles::java_lang_IncompatibleClassChangeError(),
170 "class %s has interface %s as super class",
171 this_oop->external_name(),
172 super->external_name()
173 );
174 return false;
175 }
177 link_class_impl(super, throw_verifyerror, CHECK_false);
178 }
180 // link all interfaces implemented by this class before linking this class
181 objArrayHandle interfaces (THREAD, this_oop->local_interfaces());
182 int num_interfaces = interfaces->length();
183 for (int index = 0; index < num_interfaces; index++) {
184 HandleMark hm(THREAD);
185 instanceKlassHandle ih(THREAD, klassOop(interfaces->obj_at(index)));
186 link_class_impl(ih, throw_verifyerror, CHECK_false);
187 }
189 // in case the class is linked in the process of linking its superclasses
190 if (this_oop->is_linked()) {
191 return true;
192 }
194 // trace only the link time for this klass that includes
195 // the verification time
196 PerfClassTraceTime vmtimer(ClassLoader::perf_class_link_time(),
197 ClassLoader::perf_class_link_selftime(),
198 ClassLoader::perf_classes_linked(),
199 jt->get_thread_stat()->perf_recursion_counts_addr(),
200 jt->get_thread_stat()->perf_timers_addr(),
201 PerfClassTraceTime::CLASS_LINK);
203 // verification & rewriting
204 {
205 ObjectLocker ol(this_oop, THREAD);
206 // rewritten will have been set if loader constraint error found
207 // on an earlier link attempt
208 // don't verify or rewrite if already rewritten
209 if (!this_oop->is_linked()) {
210 if (!this_oop->is_rewritten()) {
211 {
212 // Timer includes any side effects of class verification (resolution,
213 // etc), but not recursive entry into verify_code().
214 PerfClassTraceTime timer(ClassLoader::perf_class_verify_time(),
215 ClassLoader::perf_class_verify_selftime(),
216 ClassLoader::perf_classes_verified(),
217 jt->get_thread_stat()->perf_recursion_counts_addr(),
218 jt->get_thread_stat()->perf_timers_addr(),
219 PerfClassTraceTime::CLASS_VERIFY);
220 bool verify_ok = verify_code(this_oop, throw_verifyerror, THREAD);
221 if (!verify_ok) {
222 return false;
223 }
224 }
226 // Just in case a side-effect of verify linked this class already
227 // (which can sometimes happen since the verifier loads classes
228 // using custom class loaders, which are free to initialize things)
229 if (this_oop->is_linked()) {
230 return true;
231 }
233 // also sets rewritten
234 this_oop->rewrite_class(CHECK_false);
235 }
237 // Initialize the vtable and interface table after
238 // methods have been rewritten since rewrite may
239 // fabricate new methodOops.
240 // also does loader constraint checking
241 if (!this_oop()->is_shared()) {
242 ResourceMark rm(THREAD);
243 this_oop->vtable()->initialize_vtable(true, CHECK_false);
244 this_oop->itable()->initialize_itable(true, CHECK_false);
245 }
246 #ifdef ASSERT
247 else {
248 ResourceMark rm(THREAD);
249 this_oop->vtable()->verify(tty, true);
250 // In case itable verification is ever added.
251 // this_oop->itable()->verify(tty, true);
252 }
253 #endif
254 this_oop->set_init_state(linked);
255 if (JvmtiExport::should_post_class_prepare()) {
256 Thread *thread = THREAD;
257 assert(thread->is_Java_thread(), "thread->is_Java_thread()");
258 JvmtiExport::post_class_prepare((JavaThread *) thread, this_oop());
259 }
260 }
261 }
262 return true;
263 }
266 // Rewrite the byte codes of all of the methods of a class.
267 // Three cases:
268 // During the link of a newly loaded class.
269 // During the preloading of classes to be written to the shared spaces.
270 // - Rewrite the methods and update the method entry points.
271 //
272 // During the link of a class in the shared spaces.
273 // - The methods were already rewritten, update the metho entry points.
274 //
275 // The rewriter must be called exactly once. Rewriting must happen after
276 // verification but before the first method of the class is executed.
278 void instanceKlass::rewrite_class(TRAPS) {
279 assert(is_loaded(), "must be loaded");
280 instanceKlassHandle this_oop(THREAD, this->as_klassOop());
281 if (this_oop->is_rewritten()) {
282 assert(this_oop()->is_shared(), "rewriting an unshared class?");
283 return;
284 }
285 Rewriter::rewrite(this_oop, CHECK); // No exception can happen here
286 this_oop->set_rewritten();
287 }
290 void instanceKlass::initialize_impl(instanceKlassHandle this_oop, TRAPS) {
291 // Make sure klass is linked (verified) before initialization
292 // A class could already be verified, since it has been reflected upon.
293 this_oop->link_class(CHECK);
295 // refer to the JVM book page 47 for description of steps
296 // Step 1
297 { ObjectLocker ol(this_oop, THREAD);
299 Thread *self = THREAD; // it's passed the current thread
301 // Step 2
302 // If we were to use wait() instead of waitInterruptibly() then
303 // we might end up throwing IE from link/symbol resolution sites
304 // that aren't expected to throw. This would wreak havoc. See 6320309.
305 while(this_oop->is_being_initialized() && !this_oop->is_reentrant_initialization(self)) {
306 ol.waitUninterruptibly(CHECK);
307 }
309 // Step 3
310 if (this_oop->is_being_initialized() && this_oop->is_reentrant_initialization(self))
311 return;
313 // Step 4
314 if (this_oop->is_initialized())
315 return;
317 // Step 5
318 if (this_oop->is_in_error_state()) {
319 ResourceMark rm(THREAD);
320 const char* desc = "Could not initialize class ";
321 const char* className = this_oop->external_name();
322 size_t msglen = strlen(desc) + strlen(className) + 1;
323 char* message = NEW_C_HEAP_ARRAY(char, msglen);
324 if (NULL == message) {
325 // Out of memory: can't create detailed error message
326 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), className);
327 } else {
328 jio_snprintf(message, msglen, "%s%s", desc, className);
329 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), message);
330 }
331 }
333 // Step 6
334 this_oop->set_init_state(being_initialized);
335 this_oop->set_init_thread(self);
336 }
338 // Step 7
339 klassOop super_klass = this_oop->super();
340 if (super_klass != NULL && !this_oop->is_interface() && Klass::cast(super_klass)->should_be_initialized()) {
341 Klass::cast(super_klass)->initialize(THREAD);
343 if (HAS_PENDING_EXCEPTION) {
344 Handle e(THREAD, PENDING_EXCEPTION);
345 CLEAR_PENDING_EXCEPTION;
346 {
347 EXCEPTION_MARK;
348 this_oop->set_initialization_state_and_notify(initialization_error, THREAD); // Locks object, set state, and notify all waiting threads
349 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, superclass initialization error is thrown below
350 }
351 THROW_OOP(e());
352 }
353 }
355 // Step 8
356 {
357 assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl");
358 JavaThread* jt = (JavaThread*)THREAD;
359 // Timer includes any side effects of class initialization (resolution,
360 // etc), but not recursive entry into call_class_initializer().
361 PerfClassTraceTime timer(ClassLoader::perf_class_init_time(),
362 ClassLoader::perf_class_init_selftime(),
363 ClassLoader::perf_classes_inited(),
364 jt->get_thread_stat()->perf_recursion_counts_addr(),
365 jt->get_thread_stat()->perf_timers_addr(),
366 PerfClassTraceTime::CLASS_CLINIT);
367 this_oop->call_class_initializer(THREAD);
368 }
370 // Step 9
371 if (!HAS_PENDING_EXCEPTION) {
372 this_oop->set_initialization_state_and_notify(fully_initialized, CHECK);
373 { ResourceMark rm(THREAD);
374 debug_only(this_oop->vtable()->verify(tty, true);)
375 }
376 }
377 else {
378 // Step 10 and 11
379 Handle e(THREAD, PENDING_EXCEPTION);
380 CLEAR_PENDING_EXCEPTION;
381 {
382 EXCEPTION_MARK;
383 this_oop->set_initialization_state_and_notify(initialization_error, THREAD);
384 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, class initialization error is thrown below
385 }
386 if (e->is_a(SystemDictionary::error_klass())) {
387 THROW_OOP(e());
388 } else {
389 JavaCallArguments args(e);
390 THROW_ARG(vmSymbolHandles::java_lang_ExceptionInInitializerError(),
391 vmSymbolHandles::throwable_void_signature(),
392 &args);
393 }
394 }
395 }
398 // Note: implementation moved to static method to expose the this pointer.
399 void instanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) {
400 instanceKlassHandle kh(THREAD, this->as_klassOop());
401 set_initialization_state_and_notify_impl(kh, state, CHECK);
402 }
404 void instanceKlass::set_initialization_state_and_notify_impl(instanceKlassHandle this_oop, ClassState state, TRAPS) {
405 ObjectLocker ol(this_oop, THREAD);
406 this_oop->set_init_state(state);
407 ol.notify_all(CHECK);
408 }
410 void instanceKlass::add_implementor(klassOop k) {
411 assert(Compile_lock->owned_by_self(), "");
412 // Filter out my subinterfaces.
413 // (Note: Interfaces are never on the subklass list.)
414 if (instanceKlass::cast(k)->is_interface()) return;
416 // Filter out subclasses whose supers already implement me.
417 // (Note: CHA must walk subclasses of direct implementors
418 // in order to locate indirect implementors.)
419 klassOop sk = instanceKlass::cast(k)->super();
420 if (sk != NULL && instanceKlass::cast(sk)->implements_interface(as_klassOop()))
421 // We only need to check one immediate superclass, since the
422 // implements_interface query looks at transitive_interfaces.
423 // Any supers of the super have the same (or fewer) transitive_interfaces.
424 return;
426 // Update number of implementors
427 int i = _nof_implementors++;
429 // Record this implementor, if there are not too many already
430 if (i < implementors_limit) {
431 assert(_implementors[i] == NULL, "should be exactly one implementor");
432 oop_store_without_check((oop*)&_implementors[i], k);
433 } else if (i == implementors_limit) {
434 // clear out the list on first overflow
435 for (int i2 = 0; i2 < implementors_limit; i2++)
436 oop_store_without_check((oop*)&_implementors[i2], NULL);
437 }
439 // The implementor also implements the transitive_interfaces
440 for (int index = 0; index < local_interfaces()->length(); index++) {
441 instanceKlass::cast(klassOop(local_interfaces()->obj_at(index)))->add_implementor(k);
442 }
443 }
445 void instanceKlass::init_implementor() {
446 for (int i = 0; i < implementors_limit; i++)
447 oop_store_without_check((oop*)&_implementors[i], NULL);
448 _nof_implementors = 0;
449 }
452 void instanceKlass::process_interfaces(Thread *thread) {
453 // link this class into the implementors list of every interface it implements
454 KlassHandle this_as_oop (thread, this->as_klassOop());
455 for (int i = local_interfaces()->length() - 1; i >= 0; i--) {
456 assert(local_interfaces()->obj_at(i)->is_klass(), "must be a klass");
457 instanceKlass* interf = instanceKlass::cast(klassOop(local_interfaces()->obj_at(i)));
458 assert(interf->is_interface(), "expected interface");
459 interf->add_implementor(this_as_oop());
460 }
461 }
463 bool instanceKlass::can_be_primary_super_slow() const {
464 if (is_interface())
465 return false;
466 else
467 return Klass::can_be_primary_super_slow();
468 }
470 objArrayOop instanceKlass::compute_secondary_supers(int num_extra_slots, TRAPS) {
471 // The secondaries are the implemented interfaces.
472 instanceKlass* ik = instanceKlass::cast(as_klassOop());
473 objArrayHandle interfaces (THREAD, ik->transitive_interfaces());
474 int num_secondaries = num_extra_slots + interfaces->length();
475 if (num_secondaries == 0) {
476 return Universe::the_empty_system_obj_array();
477 } else if (num_extra_slots == 0) {
478 return interfaces();
479 } else {
480 // a mix of both
481 objArrayOop secondaries = oopFactory::new_system_objArray(num_secondaries, CHECK_NULL);
482 for (int i = 0; i < interfaces->length(); i++) {
483 secondaries->obj_at_put(num_extra_slots+i, interfaces->obj_at(i));
484 }
485 return secondaries;
486 }
487 }
489 bool instanceKlass::compute_is_subtype_of(klassOop k) {
490 if (Klass::cast(k)->is_interface()) {
491 return implements_interface(k);
492 } else {
493 return Klass::compute_is_subtype_of(k);
494 }
495 }
497 bool instanceKlass::implements_interface(klassOop k) const {
498 if (as_klassOop() == k) return true;
499 assert(Klass::cast(k)->is_interface(), "should be an interface class");
500 for (int i = 0; i < transitive_interfaces()->length(); i++) {
501 if (transitive_interfaces()->obj_at(i) == k) {
502 return true;
503 }
504 }
505 return false;
506 }
508 objArrayOop instanceKlass::allocate_objArray(int n, int length, TRAPS) {
509 if (length < 0) THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
510 if (length > arrayOopDesc::max_array_length(T_OBJECT)) {
511 report_java_out_of_memory("Requested array size exceeds VM limit");
512 THROW_OOP_0(Universe::out_of_memory_error_array_size());
513 }
514 int size = objArrayOopDesc::object_size(length);
515 klassOop ak = array_klass(n, CHECK_NULL);
516 KlassHandle h_ak (THREAD, ak);
517 objArrayOop o =
518 (objArrayOop)CollectedHeap::array_allocate(h_ak, size, length, CHECK_NULL);
519 return o;
520 }
522 instanceOop instanceKlass::register_finalizer(instanceOop i, TRAPS) {
523 if (TraceFinalizerRegistration) {
524 tty->print("Registered ");
525 i->print_value_on(tty);
526 tty->print_cr(" (" INTPTR_FORMAT ") as finalizable", (address)i);
527 }
528 instanceHandle h_i(THREAD, i);
529 // Pass the handle as argument, JavaCalls::call expects oop as jobjects
530 JavaValue result(T_VOID);
531 JavaCallArguments args(h_i);
532 methodHandle mh (THREAD, Universe::finalizer_register_method());
533 JavaCalls::call(&result, mh, &args, CHECK_NULL);
534 return h_i();
535 }
537 instanceOop instanceKlass::allocate_instance(TRAPS) {
538 bool has_finalizer_flag = has_finalizer(); // Query before possible GC
539 int size = size_helper(); // Query before forming handle.
541 KlassHandle h_k(THREAD, as_klassOop());
543 instanceOop i;
545 i = (instanceOop)CollectedHeap::obj_allocate(h_k, size, CHECK_NULL);
546 if (has_finalizer_flag && !RegisterFinalizersAtInit) {
547 i = register_finalizer(i, CHECK_NULL);
548 }
549 return i;
550 }
552 instanceOop instanceKlass::allocate_permanent_instance(TRAPS) {
553 // Finalizer registration occurs in the Object.<init> constructor
554 // and constructors normally aren't run when allocating perm
555 // instances so simply disallow finalizable perm objects. This can
556 // be relaxed if a need for it is found.
557 assert(!has_finalizer(), "perm objects not allowed to have finalizers");
558 int size = size_helper(); // Query before forming handle.
559 KlassHandle h_k(THREAD, as_klassOop());
560 instanceOop i = (instanceOop)
561 CollectedHeap::permanent_obj_allocate(h_k, size, CHECK_NULL);
562 return i;
563 }
565 void instanceKlass::check_valid_for_instantiation(bool throwError, TRAPS) {
566 if (is_interface() || is_abstract()) {
567 ResourceMark rm(THREAD);
568 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError()
569 : vmSymbols::java_lang_InstantiationException(), external_name());
570 }
571 if (as_klassOop() == SystemDictionary::class_klass()) {
572 ResourceMark rm(THREAD);
573 THROW_MSG(throwError ? vmSymbols::java_lang_IllegalAccessError()
574 : vmSymbols::java_lang_IllegalAccessException(), external_name());
575 }
576 }
578 klassOop instanceKlass::array_klass_impl(bool or_null, int n, TRAPS) {
579 instanceKlassHandle this_oop(THREAD, as_klassOop());
580 return array_klass_impl(this_oop, or_null, n, THREAD);
581 }
583 klassOop instanceKlass::array_klass_impl(instanceKlassHandle this_oop, bool or_null, int n, TRAPS) {
584 if (this_oop->array_klasses() == NULL) {
585 if (or_null) return NULL;
587 ResourceMark rm;
588 JavaThread *jt = (JavaThread *)THREAD;
589 {
590 // Atomic creation of array_klasses
591 MutexLocker mc(Compile_lock, THREAD); // for vtables
592 MutexLocker ma(MultiArray_lock, THREAD);
594 // Check if update has already taken place
595 if (this_oop->array_klasses() == NULL) {
596 objArrayKlassKlass* oakk =
597 (objArrayKlassKlass*)Universe::objArrayKlassKlassObj()->klass_part();
599 klassOop k = oakk->allocate_objArray_klass(1, this_oop, CHECK_NULL);
600 this_oop->set_array_klasses(k);
601 }
602 }
603 }
604 // _this will always be set at this point
605 objArrayKlass* oak = (objArrayKlass*)this_oop->array_klasses()->klass_part();
606 if (or_null) {
607 return oak->array_klass_or_null(n);
608 }
609 return oak->array_klass(n, CHECK_NULL);
610 }
612 klassOop instanceKlass::array_klass_impl(bool or_null, TRAPS) {
613 return array_klass_impl(or_null, 1, THREAD);
614 }
616 void instanceKlass::call_class_initializer(TRAPS) {
617 instanceKlassHandle ik (THREAD, as_klassOop());
618 call_class_initializer_impl(ik, THREAD);
619 }
621 static int call_class_initializer_impl_counter = 0; // for debugging
623 methodOop instanceKlass::class_initializer() {
624 return find_method(vmSymbols::class_initializer_name(), vmSymbols::void_method_signature());
625 }
627 void instanceKlass::call_class_initializer_impl(instanceKlassHandle this_oop, TRAPS) {
628 methodHandle h_method(THREAD, this_oop->class_initializer());
629 assert(!this_oop->is_initialized(), "we cannot initialize twice");
630 if (TraceClassInitialization) {
631 tty->print("%d Initializing ", call_class_initializer_impl_counter++);
632 this_oop->name()->print_value();
633 tty->print_cr("%s (" INTPTR_FORMAT ")", h_method() == NULL ? "(no method)" : "", (address)this_oop());
634 }
635 if (h_method() != NULL) {
636 JavaCallArguments args; // No arguments
637 JavaValue result(T_VOID);
638 JavaCalls::call(&result, h_method, &args, CHECK); // Static call (no args)
639 }
640 }
643 void instanceKlass::mask_for(methodHandle method, int bci,
644 InterpreterOopMap* entry_for) {
645 // Dirty read, then double-check under a lock.
646 if (_oop_map_cache == NULL) {
647 // Otherwise, allocate a new one.
648 MutexLocker x(OopMapCacheAlloc_lock);
649 // First time use. Allocate a cache in C heap
650 if (_oop_map_cache == NULL) {
651 _oop_map_cache = new OopMapCache();
652 }
653 }
654 // _oop_map_cache is constant after init; lookup below does is own locking.
655 _oop_map_cache->lookup(method, bci, entry_for);
656 }
659 bool instanceKlass::find_local_field(symbolOop name, symbolOop sig, fieldDescriptor* fd) const {
660 const int n = fields()->length();
661 for (int i = 0; i < n; i += next_offset ) {
662 int name_index = fields()->ushort_at(i + name_index_offset);
663 int sig_index = fields()->ushort_at(i + signature_index_offset);
664 symbolOop f_name = constants()->symbol_at(name_index);
665 symbolOop f_sig = constants()->symbol_at(sig_index);
666 if (f_name == name && f_sig == sig) {
667 fd->initialize(as_klassOop(), i);
668 return true;
669 }
670 }
671 return false;
672 }
675 void instanceKlass::field_names_and_sigs_iterate(OopClosure* closure) {
676 const int n = fields()->length();
677 for (int i = 0; i < n; i += next_offset ) {
678 int name_index = fields()->ushort_at(i + name_index_offset);
679 symbolOop name = constants()->symbol_at(name_index);
680 closure->do_oop((oop*)&name);
682 int sig_index = fields()->ushort_at(i + signature_index_offset);
683 symbolOop sig = constants()->symbol_at(sig_index);
684 closure->do_oop((oop*)&sig);
685 }
686 }
689 klassOop instanceKlass::find_interface_field(symbolOop name, symbolOop sig, fieldDescriptor* fd) const {
690 const int n = local_interfaces()->length();
691 for (int i = 0; i < n; i++) {
692 klassOop intf1 = klassOop(local_interfaces()->obj_at(i));
693 assert(Klass::cast(intf1)->is_interface(), "just checking type");
694 // search for field in current interface
695 if (instanceKlass::cast(intf1)->find_local_field(name, sig, fd)) {
696 assert(fd->is_static(), "interface field must be static");
697 return intf1;
698 }
699 // search for field in direct superinterfaces
700 klassOop intf2 = instanceKlass::cast(intf1)->find_interface_field(name, sig, fd);
701 if (intf2 != NULL) return intf2;
702 }
703 // otherwise field lookup fails
704 return NULL;
705 }
708 klassOop instanceKlass::find_field(symbolOop name, symbolOop sig, fieldDescriptor* fd) const {
709 // search order according to newest JVM spec (5.4.3.2, p.167).
710 // 1) search for field in current klass
711 if (find_local_field(name, sig, fd)) {
712 return as_klassOop();
713 }
714 // 2) search for field recursively in direct superinterfaces
715 { klassOop intf = find_interface_field(name, sig, fd);
716 if (intf != NULL) return intf;
717 }
718 // 3) apply field lookup recursively if superclass exists
719 { klassOop supr = super();
720 if (supr != NULL) return instanceKlass::cast(supr)->find_field(name, sig, fd);
721 }
722 // 4) otherwise field lookup fails
723 return NULL;
724 }
727 klassOop instanceKlass::find_field(symbolOop name, symbolOop sig, bool is_static, fieldDescriptor* fd) const {
728 // search order according to newest JVM spec (5.4.3.2, p.167).
729 // 1) search for field in current klass
730 if (find_local_field(name, sig, fd)) {
731 if (fd->is_static() == is_static) return as_klassOop();
732 }
733 // 2) search for field recursively in direct superinterfaces
734 if (is_static) {
735 klassOop intf = find_interface_field(name, sig, fd);
736 if (intf != NULL) return intf;
737 }
738 // 3) apply field lookup recursively if superclass exists
739 { klassOop supr = super();
740 if (supr != NULL) return instanceKlass::cast(supr)->find_field(name, sig, is_static, fd);
741 }
742 // 4) otherwise field lookup fails
743 return NULL;
744 }
747 bool instanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
748 int length = fields()->length();
749 for (int i = 0; i < length; i += next_offset) {
750 if (offset_from_fields( i ) == offset) {
751 fd->initialize(as_klassOop(), i);
752 if (fd->is_static() == is_static) return true;
753 }
754 }
755 return false;
756 }
759 bool instanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
760 klassOop klass = as_klassOop();
761 while (klass != NULL) {
762 if (instanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) {
763 return true;
764 }
765 klass = Klass::cast(klass)->super();
766 }
767 return false;
768 }
771 void instanceKlass::methods_do(void f(methodOop method)) {
772 int len = methods()->length();
773 for (int index = 0; index < len; index++) {
774 methodOop m = methodOop(methods()->obj_at(index));
775 assert(m->is_method(), "must be method");
776 f(m);
777 }
778 }
780 void instanceKlass::do_local_static_fields(FieldClosure* cl) {
781 fieldDescriptor fd;
782 int length = fields()->length();
783 for (int i = 0; i < length; i += next_offset) {
784 fd.initialize(as_klassOop(), i);
785 if (fd.is_static()) cl->do_field(&fd);
786 }
787 }
790 void instanceKlass::do_local_static_fields(void f(fieldDescriptor*, TRAPS), TRAPS) {
791 instanceKlassHandle h_this(THREAD, as_klassOop());
792 do_local_static_fields_impl(h_this, f, CHECK);
793 }
796 void instanceKlass::do_local_static_fields_impl(instanceKlassHandle this_oop, void f(fieldDescriptor* fd, TRAPS), TRAPS) {
797 fieldDescriptor fd;
798 int length = this_oop->fields()->length();
799 for (int i = 0; i < length; i += next_offset) {
800 fd.initialize(this_oop(), i);
801 if (fd.is_static()) { f(&fd, CHECK); } // Do NOT remove {}! (CHECK macro expands into several statements)
802 }
803 }
806 static int compare_fields_by_offset(int* a, int* b) {
807 return a[0] - b[0];
808 }
810 void instanceKlass::do_nonstatic_fields(FieldClosure* cl) {
811 instanceKlass* super = superklass();
812 if (super != NULL) {
813 super->do_nonstatic_fields(cl);
814 }
815 fieldDescriptor fd;
816 int length = fields()->length();
817 // In DebugInfo nonstatic fields are sorted by offset.
818 int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1));
819 int j = 0;
820 for (int i = 0; i < length; i += next_offset) {
821 fd.initialize(as_klassOop(), i);
822 if (!fd.is_static()) {
823 fields_sorted[j + 0] = fd.offset();
824 fields_sorted[j + 1] = i;
825 j += 2;
826 }
827 }
828 if (j > 0) {
829 length = j;
830 // _sort_Fn is defined in growableArray.hpp.
831 qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset);
832 for (int i = 0; i < length; i += 2) {
833 fd.initialize(as_klassOop(), fields_sorted[i + 1]);
834 assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields");
835 cl->do_field(&fd);
836 }
837 }
838 FREE_C_HEAP_ARRAY(int, fields_sorted);
839 }
842 void instanceKlass::array_klasses_do(void f(klassOop k)) {
843 if (array_klasses() != NULL)
844 arrayKlass::cast(array_klasses())->array_klasses_do(f);
845 }
848 void instanceKlass::with_array_klasses_do(void f(klassOop k)) {
849 f(as_klassOop());
850 array_klasses_do(f);
851 }
853 #ifdef ASSERT
854 static int linear_search(objArrayOop methods, symbolOop name, symbolOop signature) {
855 int len = methods->length();
856 for (int index = 0; index < len; index++) {
857 methodOop m = (methodOop)(methods->obj_at(index));
858 assert(m->is_method(), "must be method");
859 if (m->signature() == signature && m->name() == name) {
860 return index;
861 }
862 }
863 return -1;
864 }
865 #endif
867 methodOop instanceKlass::find_method(symbolOop name, symbolOop signature) const {
868 return instanceKlass::find_method(methods(), name, signature);
869 }
871 methodOop instanceKlass::find_method(objArrayOop methods, symbolOop name, symbolOop signature) {
872 int len = methods->length();
873 // methods are sorted, so do binary search
874 int l = 0;
875 int h = len - 1;
876 while (l <= h) {
877 int mid = (l + h) >> 1;
878 methodOop m = (methodOop)methods->obj_at(mid);
879 assert(m->is_method(), "must be method");
880 int res = m->name()->fast_compare(name);
881 if (res == 0) {
882 // found matching name; do linear search to find matching signature
883 // first, quick check for common case
884 if (m->signature() == signature) return m;
885 // search downwards through overloaded methods
886 int i;
887 for (i = mid - 1; i >= l; i--) {
888 methodOop m = (methodOop)methods->obj_at(i);
889 assert(m->is_method(), "must be method");
890 if (m->name() != name) break;
891 if (m->signature() == signature) return m;
892 }
893 // search upwards
894 for (i = mid + 1; i <= h; i++) {
895 methodOop m = (methodOop)methods->obj_at(i);
896 assert(m->is_method(), "must be method");
897 if (m->name() != name) break;
898 if (m->signature() == signature) return m;
899 }
900 // not found
901 #ifdef ASSERT
902 int index = linear_search(methods, name, signature);
903 if (index != -1) fatal1("binary search bug: should have found entry %d", index);
904 #endif
905 return NULL;
906 } else if (res < 0) {
907 l = mid + 1;
908 } else {
909 h = mid - 1;
910 }
911 }
912 #ifdef ASSERT
913 int index = linear_search(methods, name, signature);
914 if (index != -1) fatal1("binary search bug: should have found entry %d", index);
915 #endif
916 return NULL;
917 }
919 methodOop instanceKlass::uncached_lookup_method(symbolOop name, symbolOop signature) const {
920 klassOop klass = as_klassOop();
921 while (klass != NULL) {
922 methodOop method = instanceKlass::cast(klass)->find_method(name, signature);
923 if (method != NULL) return method;
924 klass = instanceKlass::cast(klass)->super();
925 }
926 return NULL;
927 }
929 // lookup a method in all the interfaces that this class implements
930 methodOop instanceKlass::lookup_method_in_all_interfaces(symbolOop name,
931 symbolOop signature) const {
932 objArrayOop all_ifs = instanceKlass::cast(as_klassOop())->transitive_interfaces();
933 int num_ifs = all_ifs->length();
934 instanceKlass *ik = NULL;
935 for (int i = 0; i < num_ifs; i++) {
936 ik = instanceKlass::cast(klassOop(all_ifs->obj_at(i)));
937 methodOop m = ik->lookup_method(name, signature);
938 if (m != NULL) {
939 return m;
940 }
941 }
942 return NULL;
943 }
945 /* jni_id_for_impl for jfieldIds only */
946 JNIid* instanceKlass::jni_id_for_impl(instanceKlassHandle this_oop, int offset) {
947 MutexLocker ml(JfieldIdCreation_lock);
948 // Retry lookup after we got the lock
949 JNIid* probe = this_oop->jni_ids() == NULL ? NULL : this_oop->jni_ids()->find(offset);
950 if (probe == NULL) {
951 // Slow case, allocate new static field identifier
952 probe = new JNIid(this_oop->as_klassOop(), offset, this_oop->jni_ids());
953 this_oop->set_jni_ids(probe);
954 }
955 return probe;
956 }
959 /* jni_id_for for jfieldIds only */
960 JNIid* instanceKlass::jni_id_for(int offset) {
961 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset);
962 if (probe == NULL) {
963 probe = jni_id_for_impl(this->as_klassOop(), offset);
964 }
965 return probe;
966 }
969 // Lookup or create a jmethodID.
970 // This code can be called by the VM thread. For this reason it is critical that
971 // there are no blocking operations (safepoints) while the lock is held -- or a
972 // deadlock can occur.
973 jmethodID instanceKlass::jmethod_id_for_impl(instanceKlassHandle ik_h, methodHandle method_h) {
974 size_t idnum = (size_t)method_h->method_idnum();
975 jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire();
976 size_t length = 0;
977 jmethodID id = NULL;
978 // array length stored in first element, other elements offset by one
979 if (jmeths == NULL || // If there is no jmethodID array,
980 (length = (size_t)jmeths[0]) <= idnum || // or if it is too short,
981 (id = jmeths[idnum+1]) == NULL) { // or if this jmethodID isn't allocated
983 // Do all the safepointing things (allocations) before grabbing the lock.
984 // These allocations will have to be freed if they are unused.
986 // Allocate a new array of methods.
987 jmethodID* new_jmeths = NULL;
988 if (length <= idnum) {
989 // A new array will be needed (unless some other thread beats us to it)
990 size_t size = MAX2(idnum+1, (size_t)ik_h->idnum_allocated_count());
991 new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1);
992 memset(new_jmeths, 0, (size+1)*sizeof(jmethodID));
993 new_jmeths[0] =(jmethodID)size; // array size held in the first element
994 }
996 // Allocate a new method ID.
997 jmethodID new_id = NULL;
998 if (method_h->is_old() && !method_h->is_obsolete()) {
999 // The method passed in is old (but not obsolete), we need to use the current version
1000 methodOop current_method = ik_h->method_with_idnum((int)idnum);
1001 assert(current_method != NULL, "old and but not obsolete, so should exist");
1002 methodHandle current_method_h(current_method == NULL? method_h() : current_method);
1003 new_id = JNIHandles::make_jmethod_id(current_method_h);
1004 } else {
1005 // It is the current version of the method or an obsolete method,
1006 // use the version passed in
1007 new_id = JNIHandles::make_jmethod_id(method_h);
1008 }
1010 if (Threads::number_of_threads() == 0 || SafepointSynchronize::is_at_safepoint()) {
1011 // No need and unsafe to lock the JmethodIdCreation_lock at safepoint.
1012 id = get_jmethod_id(ik_h, idnum, new_id, new_jmeths);
1013 } else {
1014 MutexLocker ml(JmethodIdCreation_lock);
1015 id = get_jmethod_id(ik_h, idnum, new_id, new_jmeths);
1016 }
1017 }
1018 return id;
1019 }
1022 jmethodID instanceKlass::get_jmethod_id(instanceKlassHandle ik_h, size_t idnum,
1023 jmethodID new_id, jmethodID* new_jmeths) {
1024 // Retry lookup after we got the lock or ensured we are at safepoint
1025 jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire();
1026 jmethodID id = NULL;
1027 jmethodID to_dealloc_id = NULL;
1028 jmethodID* to_dealloc_jmeths = NULL;
1029 size_t length;
1031 if (jmeths == NULL || (length = (size_t)jmeths[0]) <= idnum) {
1032 if (jmeths != NULL) {
1033 // We have grown the array: copy the existing entries, and delete the old array
1034 for (size_t index = 0; index < length; index++) {
1035 new_jmeths[index+1] = jmeths[index+1];
1036 }
1037 to_dealloc_jmeths = jmeths; // using the new jmeths, deallocate the old one
1038 }
1039 ik_h->release_set_methods_jmethod_ids(jmeths = new_jmeths);
1040 } else {
1041 id = jmeths[idnum+1];
1042 to_dealloc_jmeths = new_jmeths; // using the old jmeths, deallocate the new one
1043 }
1044 if (id == NULL) {
1045 id = new_id;
1046 jmeths[idnum+1] = id; // install the new method ID
1047 } else {
1048 to_dealloc_id = new_id; // the new id wasn't used, mark it for deallocation
1049 }
1051 // Free up unneeded or no longer needed resources
1052 FreeHeap(to_dealloc_jmeths);
1053 if (to_dealloc_id != NULL) {
1054 JNIHandles::destroy_jmethod_id(to_dealloc_id);
1055 }
1056 return id;
1057 }
1060 // Lookup a jmethodID, NULL if not found. Do no blocking, no allocations, no handles
1061 jmethodID instanceKlass::jmethod_id_or_null(methodOop method) {
1062 size_t idnum = (size_t)method->method_idnum();
1063 jmethodID* jmeths = methods_jmethod_ids_acquire();
1064 size_t length; // length assigned as debugging crumb
1065 jmethodID id = NULL;
1066 if (jmeths != NULL && // If there is a jmethodID array,
1067 (length = (size_t)jmeths[0]) > idnum) { // and if it is long enough,
1068 id = jmeths[idnum+1]; // Look up the id (may be NULL)
1069 }
1070 return id;
1071 }
1074 // Cache an itable index
1075 void instanceKlass::set_cached_itable_index(size_t idnum, int index) {
1076 int* indices = methods_cached_itable_indices_acquire();
1077 if (indices == NULL || // If there is no index array,
1078 ((size_t)indices[0]) <= idnum) { // or if it is too short
1079 // Lock before we allocate the array so we don't leak
1080 MutexLocker ml(JNICachedItableIndex_lock);
1081 // Retry lookup after we got the lock
1082 indices = methods_cached_itable_indices_acquire();
1083 size_t length = 0;
1084 // array length stored in first element, other elements offset by one
1085 if (indices == NULL || (length = (size_t)indices[0]) <= idnum) {
1086 size_t size = MAX2(idnum+1, (size_t)idnum_allocated_count());
1087 int* new_indices = NEW_C_HEAP_ARRAY(int, size+1);
1088 // Copy the existing entries, if any
1089 size_t i;
1090 for (i = 0; i < length; i++) {
1091 new_indices[i+1] = indices[i+1];
1092 }
1093 // Set all the rest to -1
1094 for (i = length; i < size; i++) {
1095 new_indices[i+1] = -1;
1096 }
1097 if (indices != NULL) {
1098 FreeHeap(indices); // delete any old indices
1099 }
1100 release_set_methods_cached_itable_indices(indices = new_indices);
1101 }
1102 } else {
1103 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
1104 }
1105 // This is a cache, if there is a race to set it, it doesn't matter
1106 indices[idnum+1] = index;
1107 }
1110 // Retrieve a cached itable index
1111 int instanceKlass::cached_itable_index(size_t idnum) {
1112 int* indices = methods_cached_itable_indices_acquire();
1113 if (indices != NULL && ((size_t)indices[0]) > idnum) {
1114 // indices exist and are long enough, retrieve possible cached
1115 return indices[idnum+1];
1116 }
1117 return -1;
1118 }
1121 //
1122 // nmethodBucket is used to record dependent nmethods for
1123 // deoptimization. nmethod dependencies are actually <klass, method>
1124 // pairs but we really only care about the klass part for purposes of
1125 // finding nmethods which might need to be deoptimized. Instead of
1126 // recording the method, a count of how many times a particular nmethod
1127 // was recorded is kept. This ensures that any recording errors are
1128 // noticed since an nmethod should be removed as many times are it's
1129 // added.
1130 //
1131 class nmethodBucket {
1132 private:
1133 nmethod* _nmethod;
1134 int _count;
1135 nmethodBucket* _next;
1137 public:
1138 nmethodBucket(nmethod* nmethod, nmethodBucket* next) {
1139 _nmethod = nmethod;
1140 _next = next;
1141 _count = 1;
1142 }
1143 int count() { return _count; }
1144 int increment() { _count += 1; return _count; }
1145 int decrement() { _count -= 1; assert(_count >= 0, "don't underflow"); return _count; }
1146 nmethodBucket* next() { return _next; }
1147 void set_next(nmethodBucket* b) { _next = b; }
1148 nmethod* get_nmethod() { return _nmethod; }
1149 };
1152 //
1153 // Walk the list of dependent nmethods searching for nmethods which
1154 // are dependent on the klassOop that was passed in and mark them for
1155 // deoptimization. Returns the number of nmethods found.
1156 //
1157 int instanceKlass::mark_dependent_nmethods(DepChange& changes) {
1158 assert_locked_or_safepoint(CodeCache_lock);
1159 int found = 0;
1160 nmethodBucket* b = _dependencies;
1161 while (b != NULL) {
1162 nmethod* nm = b->get_nmethod();
1163 // since dependencies aren't removed until an nmethod becomes a zombie,
1164 // the dependency list may contain nmethods which aren't alive.
1165 if (nm->is_alive() && !nm->is_marked_for_deoptimization() && nm->check_dependency_on(changes)) {
1166 if (TraceDependencies) {
1167 ResourceMark rm;
1168 tty->print_cr("Marked for deoptimization");
1169 tty->print_cr(" context = %s", this->external_name());
1170 changes.print();
1171 nm->print();
1172 nm->print_dependencies();
1173 }
1174 nm->mark_for_deoptimization();
1175 found++;
1176 }
1177 b = b->next();
1178 }
1179 return found;
1180 }
1183 //
1184 // Add an nmethodBucket to the list of dependencies for this nmethod.
1185 // It's possible that an nmethod has multiple dependencies on this klass
1186 // so a count is kept for each bucket to guarantee that creation and
1187 // deletion of dependencies is consistent.
1188 //
1189 void instanceKlass::add_dependent_nmethod(nmethod* nm) {
1190 assert_locked_or_safepoint(CodeCache_lock);
1191 nmethodBucket* b = _dependencies;
1192 nmethodBucket* last = NULL;
1193 while (b != NULL) {
1194 if (nm == b->get_nmethod()) {
1195 b->increment();
1196 return;
1197 }
1198 b = b->next();
1199 }
1200 _dependencies = new nmethodBucket(nm, _dependencies);
1201 }
1204 //
1205 // Decrement count of the nmethod in the dependency list and remove
1206 // the bucket competely when the count goes to 0. This method must
1207 // find a corresponding bucket otherwise there's a bug in the
1208 // recording of dependecies.
1209 //
1210 void instanceKlass::remove_dependent_nmethod(nmethod* nm) {
1211 assert_locked_or_safepoint(CodeCache_lock);
1212 nmethodBucket* b = _dependencies;
1213 nmethodBucket* last = NULL;
1214 while (b != NULL) {
1215 if (nm == b->get_nmethod()) {
1216 if (b->decrement() == 0) {
1217 if (last == NULL) {
1218 _dependencies = b->next();
1219 } else {
1220 last->set_next(b->next());
1221 }
1222 delete b;
1223 }
1224 return;
1225 }
1226 last = b;
1227 b = b->next();
1228 }
1229 #ifdef ASSERT
1230 tty->print_cr("### %s can't find dependent nmethod:", this->external_name());
1231 nm->print();
1232 #endif // ASSERT
1233 ShouldNotReachHere();
1234 }
1237 #ifndef PRODUCT
1238 void instanceKlass::print_dependent_nmethods(bool verbose) {
1239 nmethodBucket* b = _dependencies;
1240 int idx = 0;
1241 while (b != NULL) {
1242 nmethod* nm = b->get_nmethod();
1243 tty->print("[%d] count=%d { ", idx++, b->count());
1244 if (!verbose) {
1245 nm->print_on(tty, "nmethod");
1246 tty->print_cr(" } ");
1247 } else {
1248 nm->print();
1249 nm->print_dependencies();
1250 tty->print_cr("--- } ");
1251 }
1252 b = b->next();
1253 }
1254 }
1257 bool instanceKlass::is_dependent_nmethod(nmethod* nm) {
1258 nmethodBucket* b = _dependencies;
1259 while (b != NULL) {
1260 if (nm == b->get_nmethod()) {
1261 return true;
1262 }
1263 b = b->next();
1264 }
1265 return false;
1266 }
1267 #endif //PRODUCT
1270 #ifdef ASSERT
1271 template <class T> void assert_is_in(T *p) {
1272 T heap_oop = oopDesc::load_heap_oop(p);
1273 if (!oopDesc::is_null(heap_oop)) {
1274 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
1275 assert(Universe::heap()->is_in(o), "should be in heap");
1276 }
1277 }
1278 template <class T> void assert_is_in_closed_subset(T *p) {
1279 T heap_oop = oopDesc::load_heap_oop(p);
1280 if (!oopDesc::is_null(heap_oop)) {
1281 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
1282 assert(Universe::heap()->is_in_closed_subset(o), "should be in closed");
1283 }
1284 }
1285 template <class T> void assert_is_in_reserved(T *p) {
1286 T heap_oop = oopDesc::load_heap_oop(p);
1287 if (!oopDesc::is_null(heap_oop)) {
1288 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
1289 assert(Universe::heap()->is_in_reserved(o), "should be in reserved");
1290 }
1291 }
1292 template <class T> void assert_nothing(T *p) {}
1294 #else
1295 template <class T> void assert_is_in(T *p) {}
1296 template <class T> void assert_is_in_closed_subset(T *p) {}
1297 template <class T> void assert_is_in_reserved(T *p) {}
1298 template <class T> void assert_nothing(T *p) {}
1299 #endif // ASSERT
1301 //
1302 // Macros that iterate over areas of oops which are specialized on type of
1303 // oop pointer either narrow or wide, depending on UseCompressedOops
1304 //
1305 // Parameters are:
1306 // T - type of oop to point to (either oop or narrowOop)
1307 // start_p - starting pointer for region to iterate over
1308 // count - number of oops or narrowOops to iterate over
1309 // do_oop - action to perform on each oop (it's arbitrary C code which
1310 // makes it more efficient to put in a macro rather than making
1311 // it a template function)
1312 // assert_fn - assert function which is template function because performance
1313 // doesn't matter when enabled.
1314 #define InstanceKlass_SPECIALIZED_OOP_ITERATE( \
1315 T, start_p, count, do_oop, \
1316 assert_fn) \
1317 { \
1318 T* p = (T*)(start_p); \
1319 T* const end = p + (count); \
1320 while (p < end) { \
1321 (assert_fn)(p); \
1322 do_oop; \
1323 ++p; \
1324 } \
1325 }
1327 #define InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE( \
1328 T, start_p, count, do_oop, \
1329 assert_fn) \
1330 { \
1331 T* const start = (T*)(start_p); \
1332 T* p = start + (count); \
1333 while (start < p) { \
1334 --p; \
1335 (assert_fn)(p); \
1336 do_oop; \
1337 } \
1338 }
1340 #define InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE( \
1341 T, start_p, count, low, high, \
1342 do_oop, assert_fn) \
1343 { \
1344 T* const l = (T*)(low); \
1345 T* const h = (T*)(high); \
1346 assert(mask_bits((intptr_t)l, sizeof(T)-1) == 0 && \
1347 mask_bits((intptr_t)h, sizeof(T)-1) == 0, \
1348 "bounded region must be properly aligned"); \
1349 T* p = (T*)(start_p); \
1350 T* end = p + (count); \
1351 if (p < l) p = l; \
1352 if (end > h) end = h; \
1353 while (p < end) { \
1354 (assert_fn)(p); \
1355 do_oop; \
1356 ++p; \
1357 } \
1358 }
1361 // The following macros call specialized macros, passing either oop or
1362 // narrowOop as the specialization type. These test the UseCompressedOops
1363 // flag.
1364 #define InstanceKlass_OOP_ITERATE(start_p, count, \
1365 do_oop, assert_fn) \
1366 { \
1367 if (UseCompressedOops) { \
1368 InstanceKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
1369 start_p, count, \
1370 do_oop, assert_fn) \
1371 } else { \
1372 InstanceKlass_SPECIALIZED_OOP_ITERATE(oop, \
1373 start_p, count, \
1374 do_oop, assert_fn) \
1375 } \
1376 }
1378 #define InstanceKlass_BOUNDED_OOP_ITERATE(start_p, count, low, high, \
1379 do_oop, assert_fn) \
1380 { \
1381 if (UseCompressedOops) { \
1382 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
1383 start_p, count, \
1384 low, high, \
1385 do_oop, assert_fn) \
1386 } else { \
1387 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
1388 start_p, count, \
1389 low, high, \
1390 do_oop, assert_fn) \
1391 } \
1392 }
1394 #define InstanceKlass_OOP_MAP_ITERATE(obj, do_oop, assert_fn) \
1395 { \
1396 /* Compute oopmap block range. The common case \
1397 is nonstatic_oop_map_size == 1. */ \
1398 OopMapBlock* map = start_of_nonstatic_oop_maps(); \
1399 OopMapBlock* const end_map = map + nonstatic_oop_map_size(); \
1400 if (UseCompressedOops) { \
1401 while (map < end_map) { \
1402 InstanceKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
1403 obj->obj_field_addr<narrowOop>(map->offset()), map->length(), \
1404 do_oop, assert_fn) \
1405 ++map; \
1406 } \
1407 } else { \
1408 while (map < end_map) { \
1409 InstanceKlass_SPECIALIZED_OOP_ITERATE(oop, \
1410 obj->obj_field_addr<oop>(map->offset()), map->length(), \
1411 do_oop, assert_fn) \
1412 ++map; \
1413 } \
1414 } \
1415 }
1417 #define InstanceKlass_OOP_MAP_REVERSE_ITERATE(obj, do_oop, assert_fn) \
1418 { \
1419 OopMapBlock* const start_map = start_of_nonstatic_oop_maps(); \
1420 OopMapBlock* map = start_map + nonstatic_oop_map_size(); \
1421 if (UseCompressedOops) { \
1422 while (start_map < map) { \
1423 --map; \
1424 InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(narrowOop, \
1425 obj->obj_field_addr<narrowOop>(map->offset()), map->length(), \
1426 do_oop, assert_fn) \
1427 } \
1428 } else { \
1429 while (start_map < map) { \
1430 --map; \
1431 InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(oop, \
1432 obj->obj_field_addr<oop>(map->offset()), map->length(), \
1433 do_oop, assert_fn) \
1434 } \
1435 } \
1436 }
1438 #define InstanceKlass_BOUNDED_OOP_MAP_ITERATE(obj, low, high, do_oop, \
1439 assert_fn) \
1440 { \
1441 /* Compute oopmap block range. The common case is \
1442 nonstatic_oop_map_size == 1, so we accept the \
1443 usually non-existent extra overhead of examining \
1444 all the maps. */ \
1445 OopMapBlock* map = start_of_nonstatic_oop_maps(); \
1446 OopMapBlock* const end_map = map + nonstatic_oop_map_size(); \
1447 if (UseCompressedOops) { \
1448 while (map < end_map) { \
1449 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
1450 obj->obj_field_addr<narrowOop>(map->offset()), map->length(), \
1451 low, high, \
1452 do_oop, assert_fn) \
1453 ++map; \
1454 } \
1455 } else { \
1456 while (map < end_map) { \
1457 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
1458 obj->obj_field_addr<oop>(map->offset()), map->length(), \
1459 low, high, \
1460 do_oop, assert_fn) \
1461 ++map; \
1462 } \
1463 } \
1464 }
1466 void instanceKlass::follow_static_fields() {
1467 InstanceKlass_OOP_ITERATE( \
1468 start_of_static_fields(), static_oop_field_size(), \
1469 MarkSweep::mark_and_push(p), \
1470 assert_is_in_closed_subset)
1471 }
1473 #ifndef SERIALGC
1474 void instanceKlass::follow_static_fields(ParCompactionManager* cm) {
1475 InstanceKlass_OOP_ITERATE( \
1476 start_of_static_fields(), static_oop_field_size(), \
1477 PSParallelCompact::mark_and_push(cm, p), \
1478 assert_is_in)
1479 }
1480 #endif // SERIALGC
1482 void instanceKlass::adjust_static_fields() {
1483 InstanceKlass_OOP_ITERATE( \
1484 start_of_static_fields(), static_oop_field_size(), \
1485 MarkSweep::adjust_pointer(p), \
1486 assert_nothing)
1487 }
1489 #ifndef SERIALGC
1490 void instanceKlass::update_static_fields() {
1491 InstanceKlass_OOP_ITERATE( \
1492 start_of_static_fields(), static_oop_field_size(), \
1493 PSParallelCompact::adjust_pointer(p), \
1494 assert_nothing)
1495 }
1497 void instanceKlass::update_static_fields(HeapWord* beg_addr, HeapWord* end_addr) {
1498 InstanceKlass_BOUNDED_OOP_ITERATE( \
1499 start_of_static_fields(), static_oop_field_size(), \
1500 beg_addr, end_addr, \
1501 PSParallelCompact::adjust_pointer(p), \
1502 assert_nothing )
1503 }
1504 #endif // SERIALGC
1506 void instanceKlass::oop_follow_contents(oop obj) {
1507 assert(obj != NULL, "can't follow the content of NULL object");
1508 obj->follow_header();
1509 InstanceKlass_OOP_MAP_ITERATE( \
1510 obj, \
1511 MarkSweep::mark_and_push(p), \
1512 assert_is_in_closed_subset)
1513 }
1515 #ifndef SERIALGC
1516 void instanceKlass::oop_follow_contents(ParCompactionManager* cm,
1517 oop obj) {
1518 assert(obj != NULL, "can't follow the content of NULL object");
1519 obj->follow_header(cm);
1520 InstanceKlass_OOP_MAP_ITERATE( \
1521 obj, \
1522 PSParallelCompact::mark_and_push(cm, p), \
1523 assert_is_in)
1524 }
1525 #endif // SERIALGC
1527 // closure's do_header() method dicates whether the given closure should be
1528 // applied to the klass ptr in the object header.
1530 #define InstanceKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
1531 \
1532 int instanceKlass::oop_oop_iterate##nv_suffix(oop obj, OopClosureType* closure) { \
1533 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\
1534 /* header */ \
1535 if (closure->do_header()) { \
1536 obj->oop_iterate_header(closure); \
1537 } \
1538 InstanceKlass_OOP_MAP_ITERATE( \
1539 obj, \
1540 SpecializationStats:: \
1541 record_do_oop_call##nv_suffix(SpecializationStats::ik); \
1542 (closure)->do_oop##nv_suffix(p), \
1543 assert_is_in_closed_subset) \
1544 return size_helper(); \
1545 }
1547 #ifndef SERIALGC
1548 #define InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \
1549 \
1550 int instanceKlass::oop_oop_iterate_backwards##nv_suffix(oop obj, \
1551 OopClosureType* closure) { \
1552 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik); \
1553 /* header */ \
1554 if (closure->do_header()) { \
1555 obj->oop_iterate_header(closure); \
1556 } \
1557 /* instance variables */ \
1558 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \
1559 obj, \
1560 SpecializationStats::record_do_oop_call##nv_suffix(SpecializationStats::ik);\
1561 (closure)->do_oop##nv_suffix(p), \
1562 assert_is_in_closed_subset) \
1563 return size_helper(); \
1564 }
1565 #endif // !SERIALGC
1567 #define InstanceKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \
1568 \
1569 int instanceKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \
1570 OopClosureType* closure, \
1571 MemRegion mr) { \
1572 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\
1573 if (closure->do_header()) { \
1574 obj->oop_iterate_header(closure, mr); \
1575 } \
1576 InstanceKlass_BOUNDED_OOP_MAP_ITERATE( \
1577 obj, mr.start(), mr.end(), \
1578 (closure)->do_oop##nv_suffix(p), \
1579 assert_is_in_closed_subset) \
1580 return size_helper(); \
1581 }
1583 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN)
1584 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN)
1585 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN_m)
1586 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN_m)
1587 #ifndef SERIALGC
1588 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN)
1589 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN)
1590 #endif // !SERIALGC
1592 void instanceKlass::iterate_static_fields(OopClosure* closure) {
1593 InstanceKlass_OOP_ITERATE( \
1594 start_of_static_fields(), static_oop_field_size(), \
1595 closure->do_oop(p), \
1596 assert_is_in_reserved)
1597 }
1599 void instanceKlass::iterate_static_fields(OopClosure* closure,
1600 MemRegion mr) {
1601 InstanceKlass_BOUNDED_OOP_ITERATE( \
1602 start_of_static_fields(), static_oop_field_size(), \
1603 mr.start(), mr.end(), \
1604 (closure)->do_oop_v(p), \
1605 assert_is_in_closed_subset)
1606 }
1608 int instanceKlass::oop_adjust_pointers(oop obj) {
1609 int size = size_helper();
1610 InstanceKlass_OOP_MAP_ITERATE( \
1611 obj, \
1612 MarkSweep::adjust_pointer(p), \
1613 assert_is_in)
1614 obj->adjust_header();
1615 return size;
1616 }
1618 #ifndef SERIALGC
1619 void instanceKlass::oop_copy_contents(PSPromotionManager* pm, oop obj) {
1620 assert(!pm->depth_first(), "invariant");
1621 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \
1622 obj, \
1623 if (PSScavenge::should_scavenge(p)) { \
1624 pm->claim_or_forward_breadth(p); \
1625 }, \
1626 assert_nothing )
1627 }
1629 void instanceKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
1630 assert(pm->depth_first(), "invariant");
1631 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \
1632 obj, \
1633 if (PSScavenge::should_scavenge(p)) { \
1634 pm->claim_or_forward_depth(p); \
1635 }, \
1636 assert_nothing )
1637 }
1639 int instanceKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
1640 InstanceKlass_OOP_MAP_ITERATE( \
1641 obj, \
1642 PSParallelCompact::adjust_pointer(p), \
1643 assert_nothing)
1644 return size_helper();
1645 }
1647 int instanceKlass::oop_update_pointers(ParCompactionManager* cm, oop obj,
1648 HeapWord* beg_addr, HeapWord* end_addr) {
1649 InstanceKlass_BOUNDED_OOP_MAP_ITERATE( \
1650 obj, beg_addr, end_addr, \
1651 PSParallelCompact::adjust_pointer(p), \
1652 assert_nothing)
1653 return size_helper();
1654 }
1656 void instanceKlass::copy_static_fields(PSPromotionManager* pm) {
1657 assert(!pm->depth_first(), "invariant");
1658 InstanceKlass_OOP_ITERATE( \
1659 start_of_static_fields(), static_oop_field_size(), \
1660 if (PSScavenge::should_scavenge(p)) { \
1661 pm->claim_or_forward_breadth(p); \
1662 }, \
1663 assert_nothing )
1664 }
1666 void instanceKlass::push_static_fields(PSPromotionManager* pm) {
1667 assert(pm->depth_first(), "invariant");
1668 InstanceKlass_OOP_ITERATE( \
1669 start_of_static_fields(), static_oop_field_size(), \
1670 if (PSScavenge::should_scavenge(p)) { \
1671 pm->claim_or_forward_depth(p); \
1672 }, \
1673 assert_nothing )
1674 }
1676 void instanceKlass::copy_static_fields(ParCompactionManager* cm) {
1677 InstanceKlass_OOP_ITERATE( \
1678 start_of_static_fields(), static_oop_field_size(), \
1679 PSParallelCompact::adjust_pointer(p), \
1680 assert_is_in)
1681 }
1682 #endif // SERIALGC
1684 // This klass is alive but the implementor link is not followed/updated.
1685 // Subklass and sibling links are handled by Klass::follow_weak_klass_links
1687 void instanceKlass::follow_weak_klass_links(
1688 BoolObjectClosure* is_alive, OopClosure* keep_alive) {
1689 assert(is_alive->do_object_b(as_klassOop()), "this oop should be live");
1690 if (ClassUnloading) {
1691 for (int i = 0; i < implementors_limit; i++) {
1692 klassOop impl = _implementors[i];
1693 if (impl == NULL) break; // no more in the list
1694 if (!is_alive->do_object_b(impl)) {
1695 // remove this guy from the list by overwriting him with the tail
1696 int lasti = --_nof_implementors;
1697 assert(lasti >= i && lasti < implementors_limit, "just checking");
1698 _implementors[i] = _implementors[lasti];
1699 _implementors[lasti] = NULL;
1700 --i; // rerun the loop at this index
1701 }
1702 }
1703 } else {
1704 for (int i = 0; i < implementors_limit; i++) {
1705 keep_alive->do_oop(&adr_implementors()[i]);
1706 }
1707 }
1708 Klass::follow_weak_klass_links(is_alive, keep_alive);
1709 }
1711 void instanceKlass::remove_unshareable_info() {
1712 Klass::remove_unshareable_info();
1713 init_implementor();
1714 }
1716 static void clear_all_breakpoints(methodOop m) {
1717 m->clear_all_breakpoints();
1718 }
1720 void instanceKlass::release_C_heap_structures() {
1721 // Deallocate oop map cache
1722 if (_oop_map_cache != NULL) {
1723 delete _oop_map_cache;
1724 _oop_map_cache = NULL;
1725 }
1727 // Deallocate JNI identifiers for jfieldIDs
1728 JNIid::deallocate(jni_ids());
1729 set_jni_ids(NULL);
1731 jmethodID* jmeths = methods_jmethod_ids_acquire();
1732 if (jmeths != (jmethodID*)NULL) {
1733 release_set_methods_jmethod_ids(NULL);
1734 FreeHeap(jmeths);
1735 }
1737 int* indices = methods_cached_itable_indices_acquire();
1738 if (indices != (int*)NULL) {
1739 release_set_methods_cached_itable_indices(NULL);
1740 FreeHeap(indices);
1741 }
1743 // release dependencies
1744 nmethodBucket* b = _dependencies;
1745 _dependencies = NULL;
1746 while (b != NULL) {
1747 nmethodBucket* next = b->next();
1748 delete b;
1749 b = next;
1750 }
1752 // Deallocate breakpoint records
1753 if (breakpoints() != 0x0) {
1754 methods_do(clear_all_breakpoints);
1755 assert(breakpoints() == 0x0, "should have cleared breakpoints");
1756 }
1758 // deallocate information about previous versions
1759 if (_previous_versions != NULL) {
1760 for (int i = _previous_versions->length() - 1; i >= 0; i--) {
1761 PreviousVersionNode * pv_node = _previous_versions->at(i);
1762 delete pv_node;
1763 }
1764 delete _previous_versions;
1765 _previous_versions = NULL;
1766 }
1768 // deallocate the cached class file
1769 if (_cached_class_file_bytes != NULL) {
1770 os::free(_cached_class_file_bytes);
1771 _cached_class_file_bytes = NULL;
1772 _cached_class_file_len = 0;
1773 }
1774 }
1776 char* instanceKlass::signature_name() const {
1777 const char* src = (const char*) (name()->as_C_string());
1778 const int src_length = (int)strlen(src);
1779 char* dest = NEW_RESOURCE_ARRAY(char, src_length + 3);
1780 int src_index = 0;
1781 int dest_index = 0;
1782 dest[dest_index++] = 'L';
1783 while (src_index < src_length) {
1784 dest[dest_index++] = src[src_index++];
1785 }
1786 dest[dest_index++] = ';';
1787 dest[dest_index] = '\0';
1788 return dest;
1789 }
1791 // different verisons of is_same_class_package
1792 bool instanceKlass::is_same_class_package(klassOop class2) {
1793 klassOop class1 = as_klassOop();
1794 oop classloader1 = instanceKlass::cast(class1)->class_loader();
1795 symbolOop classname1 = Klass::cast(class1)->name();
1797 if (Klass::cast(class2)->oop_is_objArray()) {
1798 class2 = objArrayKlass::cast(class2)->bottom_klass();
1799 }
1800 oop classloader2;
1801 if (Klass::cast(class2)->oop_is_instance()) {
1802 classloader2 = instanceKlass::cast(class2)->class_loader();
1803 } else {
1804 assert(Klass::cast(class2)->oop_is_typeArray(), "should be type array");
1805 classloader2 = NULL;
1806 }
1807 symbolOop classname2 = Klass::cast(class2)->name();
1809 return instanceKlass::is_same_class_package(classloader1, classname1,
1810 classloader2, classname2);
1811 }
1813 bool instanceKlass::is_same_class_package(oop classloader2, symbolOop classname2) {
1814 klassOop class1 = as_klassOop();
1815 oop classloader1 = instanceKlass::cast(class1)->class_loader();
1816 symbolOop classname1 = Klass::cast(class1)->name();
1818 return instanceKlass::is_same_class_package(classloader1, classname1,
1819 classloader2, classname2);
1820 }
1822 // return true if two classes are in the same package, classloader
1823 // and classname information is enough to determine a class's package
1824 bool instanceKlass::is_same_class_package(oop class_loader1, symbolOop class_name1,
1825 oop class_loader2, symbolOop class_name2) {
1826 if (class_loader1 != class_loader2) {
1827 return false;
1828 } else if (class_name1 == class_name2) {
1829 return true; // skip painful bytewise comparison
1830 } else {
1831 ResourceMark rm;
1833 // The symbolOop's are in UTF8 encoding. Since we only need to check explicitly
1834 // for ASCII characters ('/', 'L', '['), we can keep them in UTF8 encoding.
1835 // Otherwise, we just compare jbyte values between the strings.
1836 jbyte *name1 = class_name1->base();
1837 jbyte *name2 = class_name2->base();
1839 jbyte *last_slash1 = UTF8::strrchr(name1, class_name1->utf8_length(), '/');
1840 jbyte *last_slash2 = UTF8::strrchr(name2, class_name2->utf8_length(), '/');
1842 if ((last_slash1 == NULL) || (last_slash2 == NULL)) {
1843 // One of the two doesn't have a package. Only return true
1844 // if the other one also doesn't have a package.
1845 return last_slash1 == last_slash2;
1846 } else {
1847 // Skip over '['s
1848 if (*name1 == '[') {
1849 do {
1850 name1++;
1851 } while (*name1 == '[');
1852 if (*name1 != 'L') {
1853 // Something is terribly wrong. Shouldn't be here.
1854 return false;
1855 }
1856 }
1857 if (*name2 == '[') {
1858 do {
1859 name2++;
1860 } while (*name2 == '[');
1861 if (*name2 != 'L') {
1862 // Something is terribly wrong. Shouldn't be here.
1863 return false;
1864 }
1865 }
1867 // Check that package part is identical
1868 int length1 = last_slash1 - name1;
1869 int length2 = last_slash2 - name2;
1871 return UTF8::equal(name1, length1, name2, length2);
1872 }
1873 }
1874 }
1876 // Returns true iff super_method can be overridden by a method in targetclassname
1877 // See JSL 3rd edition 8.4.6.1
1878 // Assumes name-signature match
1879 // "this" is instanceKlass of super_method which must exist
1880 // note that the instanceKlass of the method in the targetclassname has not always been created yet
1881 bool instanceKlass::is_override(methodHandle super_method, Handle targetclassloader, symbolHandle targetclassname, TRAPS) {
1882 // Private methods can not be overridden
1883 if (super_method->is_private()) {
1884 return false;
1885 }
1886 // If super method is accessible, then override
1887 if ((super_method->is_protected()) ||
1888 (super_method->is_public())) {
1889 return true;
1890 }
1891 // Package-private methods are not inherited outside of package
1892 assert(super_method->is_package_private(), "must be package private");
1893 return(is_same_class_package(targetclassloader(), targetclassname()));
1894 }
1896 /* defined for now in jvm.cpp, for historical reasons *--
1897 klassOop instanceKlass::compute_enclosing_class_impl(instanceKlassHandle self,
1898 symbolOop& simple_name_result, TRAPS) {
1899 ...
1900 }
1901 */
1903 // tell if two classes have the same enclosing class (at package level)
1904 bool instanceKlass::is_same_package_member_impl(instanceKlassHandle class1,
1905 klassOop class2_oop, TRAPS) {
1906 if (class2_oop == class1->as_klassOop()) return true;
1907 if (!Klass::cast(class2_oop)->oop_is_instance()) return false;
1908 instanceKlassHandle class2(THREAD, class2_oop);
1910 // must be in same package before we try anything else
1911 if (!class1->is_same_class_package(class2->class_loader(), class2->name()))
1912 return false;
1914 // As long as there is an outer1.getEnclosingClass,
1915 // shift the search outward.
1916 instanceKlassHandle outer1 = class1;
1917 for (;;) {
1918 // As we walk along, look for equalities between outer1 and class2.
1919 // Eventually, the walks will terminate as outer1 stops
1920 // at the top-level class around the original class.
1921 symbolOop ignore_name;
1922 klassOop next = outer1->compute_enclosing_class(ignore_name, CHECK_false);
1923 if (next == NULL) break;
1924 if (next == class2()) return true;
1925 outer1 = instanceKlassHandle(THREAD, next);
1926 }
1928 // Now do the same for class2.
1929 instanceKlassHandle outer2 = class2;
1930 for (;;) {
1931 symbolOop ignore_name;
1932 klassOop next = outer2->compute_enclosing_class(ignore_name, CHECK_false);
1933 if (next == NULL) break;
1934 // Might as well check the new outer against all available values.
1935 if (next == class1()) return true;
1936 if (next == outer1()) return true;
1937 outer2 = instanceKlassHandle(THREAD, next);
1938 }
1940 // If by this point we have not found an equality between the
1941 // two classes, we know they are in separate package members.
1942 return false;
1943 }
1946 jint instanceKlass::compute_modifier_flags(TRAPS) const {
1947 klassOop k = as_klassOop();
1948 jint access = access_flags().as_int();
1950 // But check if it happens to be member class.
1951 typeArrayOop inner_class_list = inner_classes();
1952 int length = (inner_class_list == NULL) ? 0 : inner_class_list->length();
1953 assert (length % instanceKlass::inner_class_next_offset == 0, "just checking");
1954 if (length > 0) {
1955 typeArrayHandle inner_class_list_h(THREAD, inner_class_list);
1956 instanceKlassHandle ik(THREAD, k);
1957 for (int i = 0; i < length; i += instanceKlass::inner_class_next_offset) {
1958 int ioff = inner_class_list_h->ushort_at(
1959 i + instanceKlass::inner_class_inner_class_info_offset);
1961 // Inner class attribute can be zero, skip it.
1962 // Strange but true: JVM spec. allows null inner class refs.
1963 if (ioff == 0) continue;
1965 // only look at classes that are already loaded
1966 // since we are looking for the flags for our self.
1967 symbolOop inner_name = ik->constants()->klass_name_at(ioff);
1968 if ((ik->name() == inner_name)) {
1969 // This is really a member class.
1970 access = inner_class_list_h->ushort_at(i + instanceKlass::inner_class_access_flags_offset);
1971 break;
1972 }
1973 }
1974 }
1975 // Remember to strip ACC_SUPER bit
1976 return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS;
1977 }
1979 jint instanceKlass::jvmti_class_status() const {
1980 jint result = 0;
1982 if (is_linked()) {
1983 result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED;
1984 }
1986 if (is_initialized()) {
1987 assert(is_linked(), "Class status is not consistent");
1988 result |= JVMTI_CLASS_STATUS_INITIALIZED;
1989 }
1990 if (is_in_error_state()) {
1991 result |= JVMTI_CLASS_STATUS_ERROR;
1992 }
1993 return result;
1994 }
1996 methodOop instanceKlass::method_at_itable(klassOop holder, int index, TRAPS) {
1997 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable();
1998 int method_table_offset_in_words = ioe->offset()/wordSize;
1999 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words())
2000 / itableOffsetEntry::size();
2002 for (int cnt = 0 ; ; cnt ++, ioe ++) {
2003 // If the interface isn't implemented by the receiver class,
2004 // the VM should throw IncompatibleClassChangeError.
2005 if (cnt >= nof_interfaces) {
2006 THROW_OOP_0(vmSymbols::java_lang_IncompatibleClassChangeError());
2007 }
2009 klassOop ik = ioe->interface_klass();
2010 if (ik == holder) break;
2011 }
2013 itableMethodEntry* ime = ioe->first_method_entry(as_klassOop());
2014 methodOop m = ime[index].method();
2015 if (m == NULL) {
2016 THROW_OOP_0(vmSymbols::java_lang_AbstractMethodError());
2017 }
2018 return m;
2019 }
2021 // On-stack replacement stuff
2022 void instanceKlass::add_osr_nmethod(nmethod* n) {
2023 // only one compilation can be active
2024 NEEDS_CLEANUP
2025 // This is a short non-blocking critical region, so the no safepoint check is ok.
2026 OsrList_lock->lock_without_safepoint_check();
2027 assert(n->is_osr_method(), "wrong kind of nmethod");
2028 n->set_osr_link(osr_nmethods_head());
2029 set_osr_nmethods_head(n);
2030 // Remember to unlock again
2031 OsrList_lock->unlock();
2032 }
2035 void instanceKlass::remove_osr_nmethod(nmethod* n) {
2036 // This is a short non-blocking critical region, so the no safepoint check is ok.
2037 OsrList_lock->lock_without_safepoint_check();
2038 assert(n->is_osr_method(), "wrong kind of nmethod");
2039 nmethod* last = NULL;
2040 nmethod* cur = osr_nmethods_head();
2041 // Search for match
2042 while(cur != NULL && cur != n) {
2043 last = cur;
2044 cur = cur->osr_link();
2045 }
2046 if (cur == n) {
2047 if (last == NULL) {
2048 // Remove first element
2049 set_osr_nmethods_head(osr_nmethods_head()->osr_link());
2050 } else {
2051 last->set_osr_link(cur->osr_link());
2052 }
2053 }
2054 n->set_osr_link(NULL);
2055 // Remember to unlock again
2056 OsrList_lock->unlock();
2057 }
2059 nmethod* instanceKlass::lookup_osr_nmethod(const methodOop m, int bci) const {
2060 // This is a short non-blocking critical region, so the no safepoint check is ok.
2061 OsrList_lock->lock_without_safepoint_check();
2062 nmethod* osr = osr_nmethods_head();
2063 while (osr != NULL) {
2064 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
2065 if (osr->method() == m &&
2066 (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) {
2067 // Found a match - return it.
2068 OsrList_lock->unlock();
2069 return osr;
2070 }
2071 osr = osr->osr_link();
2072 }
2073 OsrList_lock->unlock();
2074 return NULL;
2075 }
2077 // -----------------------------------------------------------------------------------------------------
2078 #ifndef PRODUCT
2080 // Printing
2082 #define BULLET " - "
2084 void FieldPrinter::do_field(fieldDescriptor* fd) {
2085 _st->print(BULLET);
2086 if (fd->is_static() || (_obj == NULL)) {
2087 fd->print_on(_st);
2088 _st->cr();
2089 } else {
2090 fd->print_on_for(_st, _obj);
2091 _st->cr();
2092 }
2093 }
2096 void instanceKlass::oop_print_on(oop obj, outputStream* st) {
2097 Klass::oop_print_on(obj, st);
2099 if (as_klassOop() == SystemDictionary::string_klass()) {
2100 typeArrayOop value = java_lang_String::value(obj);
2101 juint offset = java_lang_String::offset(obj);
2102 juint length = java_lang_String::length(obj);
2103 if (value != NULL &&
2104 value->is_typeArray() &&
2105 offset <= (juint) value->length() &&
2106 offset + length <= (juint) value->length()) {
2107 st->print(BULLET"string: ");
2108 Handle h_obj(obj);
2109 java_lang_String::print(h_obj, st);
2110 st->cr();
2111 if (!WizardMode) return; // that is enough
2112 }
2113 }
2115 st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj));
2116 FieldPrinter print_nonstatic_field(st, obj);
2117 do_nonstatic_fields(&print_nonstatic_field);
2119 if (as_klassOop() == SystemDictionary::class_klass()) {
2120 st->print(BULLET"signature: ");
2121 java_lang_Class::print_signature(obj, st);
2122 st->cr();
2123 klassOop mirrored_klass = java_lang_Class::as_klassOop(obj);
2124 st->print(BULLET"fake entry for mirror: ");
2125 mirrored_klass->print_value_on(st);
2126 st->cr();
2127 st->print(BULLET"fake entry resolved_constructor: ");
2128 methodOop ctor = java_lang_Class::resolved_constructor(obj);
2129 ctor->print_value_on(st);
2130 klassOop array_klass = java_lang_Class::array_klass(obj);
2131 st->cr();
2132 st->print(BULLET"fake entry for array: ");
2133 array_klass->print_value_on(st);
2134 st->cr();
2135 }
2136 }
2138 void instanceKlass::oop_print_value_on(oop obj, outputStream* st) {
2139 st->print("a ");
2140 name()->print_value_on(st);
2141 obj->print_address_on(st);
2142 if (as_klassOop() == SystemDictionary::string_klass()
2143 && java_lang_String::value(obj) != NULL) {
2144 ResourceMark rm;
2145 int len = java_lang_String::length(obj);
2146 int plen = (len < 24 ? len : 12);
2147 char* str = java_lang_String::as_utf8_string(obj, 0, plen);
2148 st->print(" = \"%s\"", str);
2149 if (len > plen)
2150 st->print("...[%d]", len);
2151 } else if (as_klassOop() == SystemDictionary::class_klass()) {
2152 klassOop k = java_lang_Class::as_klassOop(obj);
2153 st->print(" = ");
2154 if (k != NULL) {
2155 k->print_value_on(st);
2156 } else {
2157 const char* tname = type2name(java_lang_Class::primitive_type(obj));
2158 st->print("%s", tname ? tname : "type?");
2159 }
2160 } else if (java_lang_boxing_object::is_instance(obj)) {
2161 st->print(" = ");
2162 java_lang_boxing_object::print(obj, st);
2163 }
2164 }
2166 #endif // ndef PRODUCT
2168 const char* instanceKlass::internal_name() const {
2169 return external_name();
2170 }
2172 // Verification
2174 class VerifyFieldClosure: public OopClosure {
2175 protected:
2176 template <class T> void do_oop_work(T* p) {
2177 guarantee(Universe::heap()->is_in_closed_subset(p), "should be in heap");
2178 oop obj = oopDesc::load_decode_heap_oop(p);
2179 if (!obj->is_oop_or_null()) {
2180 tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p, (address)obj);
2181 Universe::print();
2182 guarantee(false, "boom");
2183 }
2184 }
2185 public:
2186 virtual void do_oop(oop* p) { VerifyFieldClosure::do_oop_work(p); }
2187 virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); }
2188 };
2190 void instanceKlass::oop_verify_on(oop obj, outputStream* st) {
2191 Klass::oop_verify_on(obj, st);
2192 VerifyFieldClosure blk;
2193 oop_oop_iterate(obj, &blk);
2194 }
2196 #ifndef PRODUCT
2198 void instanceKlass::verify_class_klass_nonstatic_oop_maps(klassOop k) {
2199 // This verification code is disabled. JDK_Version::is_gte_jdk14x_version()
2200 // cannot be called since this function is called before the VM is
2201 // able to determine what JDK version is running with.
2202 // The check below always is false since 1.4.
2203 return;
2205 // This verification code temporarily disabled for the 1.4
2206 // reflection implementation since java.lang.Class now has
2207 // Java-level instance fields. Should rewrite this to handle this
2208 // case.
2209 if (!(JDK_Version::is_gte_jdk14x_version() && UseNewReflection)) {
2210 // Verify that java.lang.Class instances have a fake oop field added.
2211 instanceKlass* ik = instanceKlass::cast(k);
2213 // Check that we have the right class
2214 static bool first_time = true;
2215 guarantee(k == SystemDictionary::class_klass() && first_time, "Invalid verify of maps");
2216 first_time = false;
2217 const int extra = java_lang_Class::number_of_fake_oop_fields;
2218 guarantee(ik->nonstatic_field_size() == extra, "just checking");
2219 guarantee(ik->nonstatic_oop_map_size() == 1, "just checking");
2220 guarantee(ik->size_helper() == align_object_size(instanceOopDesc::header_size() + extra), "just checking");
2222 // Check that the map is (2,extra)
2223 int offset = java_lang_Class::klass_offset;
2225 OopMapBlock* map = ik->start_of_nonstatic_oop_maps();
2226 guarantee(map->offset() == offset && map->length() == extra, "just checking");
2227 }
2228 }
2230 #endif // ndef PRODUCT
2232 // JNIid class for jfieldIDs only
2233 // Note to reviewers:
2234 // These JNI functions are just moved over to column 1 and not changed
2235 // in the compressed oops workspace.
2236 JNIid::JNIid(klassOop holder, int offset, JNIid* next) {
2237 _holder = holder;
2238 _offset = offset;
2239 _next = next;
2240 debug_only(_is_static_field_id = false;)
2241 }
2244 JNIid* JNIid::find(int offset) {
2245 JNIid* current = this;
2246 while (current != NULL) {
2247 if (current->offset() == offset) return current;
2248 current = current->next();
2249 }
2250 return NULL;
2251 }
2253 void JNIid::oops_do(OopClosure* f) {
2254 for (JNIid* cur = this; cur != NULL; cur = cur->next()) {
2255 f->do_oop(cur->holder_addr());
2256 }
2257 }
2259 void JNIid::deallocate(JNIid* current) {
2260 while (current != NULL) {
2261 JNIid* next = current->next();
2262 delete current;
2263 current = next;
2264 }
2265 }
2268 void JNIid::verify(klassOop holder) {
2269 int first_field_offset = instanceKlass::cast(holder)->offset_of_static_fields();
2270 int end_field_offset;
2271 end_field_offset = first_field_offset + (instanceKlass::cast(holder)->static_field_size() * wordSize);
2273 JNIid* current = this;
2274 while (current != NULL) {
2275 guarantee(current->holder() == holder, "Invalid klass in JNIid");
2276 #ifdef ASSERT
2277 int o = current->offset();
2278 if (current->is_static_field_id()) {
2279 guarantee(o >= first_field_offset && o < end_field_offset, "Invalid static field offset in JNIid");
2280 }
2281 #endif
2282 current = current->next();
2283 }
2284 }
2287 #ifdef ASSERT
2288 void instanceKlass::set_init_state(ClassState state) {
2289 bool good_state = as_klassOop()->is_shared() ? (_init_state <= state)
2290 : (_init_state < state);
2291 assert(good_state || state == allocated, "illegal state transition");
2292 _init_state = state;
2293 }
2294 #endif
2297 // RedefineClasses() support for previous versions:
2299 // Add an information node that contains weak references to the
2300 // interesting parts of the previous version of the_class.
2301 void instanceKlass::add_previous_version(instanceKlassHandle ikh,
2302 BitMap* emcp_methods, int emcp_method_count) {
2303 assert(Thread::current()->is_VM_thread(),
2304 "only VMThread can add previous versions");
2306 if (_previous_versions == NULL) {
2307 // This is the first previous version so make some space.
2308 // Start with 2 elements under the assumption that the class
2309 // won't be redefined much.
2310 _previous_versions = new (ResourceObj::C_HEAP)
2311 GrowableArray<PreviousVersionNode *>(2, true);
2312 }
2314 // RC_TRACE macro has an embedded ResourceMark
2315 RC_TRACE(0x00000100, ("adding previous version ref for %s @%d, EMCP_cnt=%d",
2316 ikh->external_name(), _previous_versions->length(), emcp_method_count));
2317 constantPoolHandle cp_h(ikh->constants());
2318 jobject cp_ref;
2319 if (cp_h->is_shared()) {
2320 // a shared ConstantPool requires a regular reference; a weak
2321 // reference would be collectible
2322 cp_ref = JNIHandles::make_global(cp_h);
2323 } else {
2324 cp_ref = JNIHandles::make_weak_global(cp_h);
2325 }
2326 PreviousVersionNode * pv_node = NULL;
2327 objArrayOop old_methods = ikh->methods();
2329 if (emcp_method_count == 0) {
2330 // non-shared ConstantPool gets a weak reference
2331 pv_node = new PreviousVersionNode(cp_ref, !cp_h->is_shared(), NULL);
2332 RC_TRACE(0x00000400,
2333 ("add: all methods are obsolete; flushing any EMCP weak refs"));
2334 } else {
2335 int local_count = 0;
2336 GrowableArray<jweak>* method_refs = new (ResourceObj::C_HEAP)
2337 GrowableArray<jweak>(emcp_method_count, true);
2338 for (int i = 0; i < old_methods->length(); i++) {
2339 if (emcp_methods->at(i)) {
2340 // this old method is EMCP so save a weak ref
2341 methodOop old_method = (methodOop) old_methods->obj_at(i);
2342 methodHandle old_method_h(old_method);
2343 jweak method_ref = JNIHandles::make_weak_global(old_method_h);
2344 method_refs->append(method_ref);
2345 if (++local_count >= emcp_method_count) {
2346 // no more EMCP methods so bail out now
2347 break;
2348 }
2349 }
2350 }
2351 // non-shared ConstantPool gets a weak reference
2352 pv_node = new PreviousVersionNode(cp_ref, !cp_h->is_shared(), method_refs);
2353 }
2355 _previous_versions->append(pv_node);
2357 // Using weak references allows the interesting parts of previous
2358 // classes to be GC'ed when they are no longer needed. Since the
2359 // caller is the VMThread and we are at a safepoint, this is a good
2360 // time to clear out unused weak references.
2362 RC_TRACE(0x00000400, ("add: previous version length=%d",
2363 _previous_versions->length()));
2365 // skip the last entry since we just added it
2366 for (int i = _previous_versions->length() - 2; i >= 0; i--) {
2367 // check the previous versions array for a GC'ed weak refs
2368 pv_node = _previous_versions->at(i);
2369 cp_ref = pv_node->prev_constant_pool();
2370 assert(cp_ref != NULL, "cp ref was unexpectedly cleared");
2371 if (cp_ref == NULL) {
2372 delete pv_node;
2373 _previous_versions->remove_at(i);
2374 // Since we are traversing the array backwards, we don't have to
2375 // do anything special with the index.
2376 continue; // robustness
2377 }
2379 constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref);
2380 if (cp == NULL) {
2381 // this entry has been GC'ed so remove it
2382 delete pv_node;
2383 _previous_versions->remove_at(i);
2384 // Since we are traversing the array backwards, we don't have to
2385 // do anything special with the index.
2386 continue;
2387 } else {
2388 RC_TRACE(0x00000400, ("add: previous version @%d is alive", i));
2389 }
2391 GrowableArray<jweak>* method_refs = pv_node->prev_EMCP_methods();
2392 if (method_refs != NULL) {
2393 RC_TRACE(0x00000400, ("add: previous methods length=%d",
2394 method_refs->length()));
2395 for (int j = method_refs->length() - 1; j >= 0; j--) {
2396 jweak method_ref = method_refs->at(j);
2397 assert(method_ref != NULL, "weak method ref was unexpectedly cleared");
2398 if (method_ref == NULL) {
2399 method_refs->remove_at(j);
2400 // Since we are traversing the array backwards, we don't have to
2401 // do anything special with the index.
2402 continue; // robustness
2403 }
2405 methodOop method = (methodOop)JNIHandles::resolve(method_ref);
2406 if (method == NULL || emcp_method_count == 0) {
2407 // This method entry has been GC'ed or the current
2408 // RedefineClasses() call has made all methods obsolete
2409 // so remove it.
2410 JNIHandles::destroy_weak_global(method_ref);
2411 method_refs->remove_at(j);
2412 } else {
2413 // RC_TRACE macro has an embedded ResourceMark
2414 RC_TRACE(0x00000400,
2415 ("add: %s(%s): previous method @%d in version @%d is alive",
2416 method->name()->as_C_string(), method->signature()->as_C_string(),
2417 j, i));
2418 }
2419 }
2420 }
2421 }
2423 int obsolete_method_count = old_methods->length() - emcp_method_count;
2425 if (emcp_method_count != 0 && obsolete_method_count != 0 &&
2426 _previous_versions->length() > 1) {
2427 // We have a mix of obsolete and EMCP methods. If there is more
2428 // than the previous version that we just added, then we have to
2429 // clear out any matching EMCP method entries the hard way.
2430 int local_count = 0;
2431 for (int i = 0; i < old_methods->length(); i++) {
2432 if (!emcp_methods->at(i)) {
2433 // only obsolete methods are interesting
2434 methodOop old_method = (methodOop) old_methods->obj_at(i);
2435 symbolOop m_name = old_method->name();
2436 symbolOop m_signature = old_method->signature();
2438 // skip the last entry since we just added it
2439 for (int j = _previous_versions->length() - 2; j >= 0; j--) {
2440 // check the previous versions array for a GC'ed weak refs
2441 pv_node = _previous_versions->at(j);
2442 cp_ref = pv_node->prev_constant_pool();
2443 assert(cp_ref != NULL, "cp ref was unexpectedly cleared");
2444 if (cp_ref == NULL) {
2445 delete pv_node;
2446 _previous_versions->remove_at(j);
2447 // Since we are traversing the array backwards, we don't have to
2448 // do anything special with the index.
2449 continue; // robustness
2450 }
2452 constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref);
2453 if (cp == NULL) {
2454 // this entry has been GC'ed so remove it
2455 delete pv_node;
2456 _previous_versions->remove_at(j);
2457 // Since we are traversing the array backwards, we don't have to
2458 // do anything special with the index.
2459 continue;
2460 }
2462 GrowableArray<jweak>* method_refs = pv_node->prev_EMCP_methods();
2463 if (method_refs == NULL) {
2464 // We have run into a PreviousVersion generation where
2465 // all methods were made obsolete during that generation's
2466 // RedefineClasses() operation. At the time of that
2467 // operation, all EMCP methods were flushed so we don't
2468 // have to go back any further.
2469 //
2470 // A NULL method_refs is different than an empty method_refs.
2471 // We cannot infer any optimizations about older generations
2472 // from an empty method_refs for the current generation.
2473 break;
2474 }
2476 for (int k = method_refs->length() - 1; k >= 0; k--) {
2477 jweak method_ref = method_refs->at(k);
2478 assert(method_ref != NULL,
2479 "weak method ref was unexpectedly cleared");
2480 if (method_ref == NULL) {
2481 method_refs->remove_at(k);
2482 // Since we are traversing the array backwards, we don't
2483 // have to do anything special with the index.
2484 continue; // robustness
2485 }
2487 methodOop method = (methodOop)JNIHandles::resolve(method_ref);
2488 if (method == NULL) {
2489 // this method entry has been GC'ed so skip it
2490 JNIHandles::destroy_weak_global(method_ref);
2491 method_refs->remove_at(k);
2492 continue;
2493 }
2495 if (method->name() == m_name &&
2496 method->signature() == m_signature) {
2497 // The current RedefineClasses() call has made all EMCP
2498 // versions of this method obsolete so mark it as obsolete
2499 // and remove the weak ref.
2500 RC_TRACE(0x00000400,
2501 ("add: %s(%s): flush obsolete method @%d in version @%d",
2502 m_name->as_C_string(), m_signature->as_C_string(), k, j));
2504 method->set_is_obsolete();
2505 JNIHandles::destroy_weak_global(method_ref);
2506 method_refs->remove_at(k);
2507 break;
2508 }
2509 }
2511 // The previous loop may not find a matching EMCP method, but
2512 // that doesn't mean that we can optimize and not go any
2513 // further back in the PreviousVersion generations. The EMCP
2514 // method for this generation could have already been GC'ed,
2515 // but there still may be an older EMCP method that has not
2516 // been GC'ed.
2517 }
2519 if (++local_count >= obsolete_method_count) {
2520 // no more obsolete methods so bail out now
2521 break;
2522 }
2523 }
2524 }
2525 }
2526 } // end add_previous_version()
2529 // Determine if instanceKlass has a previous version.
2530 bool instanceKlass::has_previous_version() const {
2531 if (_previous_versions == NULL) {
2532 // no previous versions array so answer is easy
2533 return false;
2534 }
2536 for (int i = _previous_versions->length() - 1; i >= 0; i--) {
2537 // Check the previous versions array for an info node that hasn't
2538 // been GC'ed
2539 PreviousVersionNode * pv_node = _previous_versions->at(i);
2541 jobject cp_ref = pv_node->prev_constant_pool();
2542 assert(cp_ref != NULL, "cp reference was unexpectedly cleared");
2543 if (cp_ref == NULL) {
2544 continue; // robustness
2545 }
2547 constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref);
2548 if (cp != NULL) {
2549 // we have at least one previous version
2550 return true;
2551 }
2553 // We don't have to check the method refs. If the constant pool has
2554 // been GC'ed then so have the methods.
2555 }
2557 // all of the underlying nodes' info has been GC'ed
2558 return false;
2559 } // end has_previous_version()
2561 methodOop instanceKlass::method_with_idnum(int idnum) {
2562 methodOop m = NULL;
2563 if (idnum < methods()->length()) {
2564 m = (methodOop) methods()->obj_at(idnum);
2565 }
2566 if (m == NULL || m->method_idnum() != idnum) {
2567 for (int index = 0; index < methods()->length(); ++index) {
2568 m = (methodOop) methods()->obj_at(index);
2569 if (m->method_idnum() == idnum) {
2570 return m;
2571 }
2572 }
2573 }
2574 return m;
2575 }
2578 // Set the annotation at 'idnum' to 'anno'.
2579 // We don't want to create or extend the array if 'anno' is NULL, since that is the
2580 // default value. However, if the array exists and is long enough, we must set NULL values.
2581 void instanceKlass::set_methods_annotations_of(int idnum, typeArrayOop anno, objArrayOop* md_p) {
2582 objArrayOop md = *md_p;
2583 if (md != NULL && md->length() > idnum) {
2584 md->obj_at_put(idnum, anno);
2585 } else if (anno != NULL) {
2586 // create the array
2587 int length = MAX2(idnum+1, (int)_idnum_allocated_count);
2588 md = oopFactory::new_system_objArray(length, Thread::current());
2589 if (*md_p != NULL) {
2590 // copy the existing entries
2591 for (int index = 0; index < (*md_p)->length(); index++) {
2592 md->obj_at_put(index, (*md_p)->obj_at(index));
2593 }
2594 }
2595 set_annotations(md, md_p);
2596 md->obj_at_put(idnum, anno);
2597 } // if no array and idnum isn't included there is nothing to do
2598 }
2600 // Construct a PreviousVersionNode entry for the array hung off
2601 // the instanceKlass.
2602 PreviousVersionNode::PreviousVersionNode(jobject prev_constant_pool,
2603 bool prev_cp_is_weak, GrowableArray<jweak>* prev_EMCP_methods) {
2605 _prev_constant_pool = prev_constant_pool;
2606 _prev_cp_is_weak = prev_cp_is_weak;
2607 _prev_EMCP_methods = prev_EMCP_methods;
2608 }
2611 // Destroy a PreviousVersionNode
2612 PreviousVersionNode::~PreviousVersionNode() {
2613 if (_prev_constant_pool != NULL) {
2614 if (_prev_cp_is_weak) {
2615 JNIHandles::destroy_weak_global(_prev_constant_pool);
2616 } else {
2617 JNIHandles::destroy_global(_prev_constant_pool);
2618 }
2619 }
2621 if (_prev_EMCP_methods != NULL) {
2622 for (int i = _prev_EMCP_methods->length() - 1; i >= 0; i--) {
2623 jweak method_ref = _prev_EMCP_methods->at(i);
2624 if (method_ref != NULL) {
2625 JNIHandles::destroy_weak_global(method_ref);
2626 }
2627 }
2628 delete _prev_EMCP_methods;
2629 }
2630 }
2633 // Construct a PreviousVersionInfo entry
2634 PreviousVersionInfo::PreviousVersionInfo(PreviousVersionNode *pv_node) {
2635 _prev_constant_pool_handle = constantPoolHandle(); // NULL handle
2636 _prev_EMCP_method_handles = NULL;
2638 jobject cp_ref = pv_node->prev_constant_pool();
2639 assert(cp_ref != NULL, "constant pool ref was unexpectedly cleared");
2640 if (cp_ref == NULL) {
2641 return; // robustness
2642 }
2644 constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref);
2645 if (cp == NULL) {
2646 // Weak reference has been GC'ed. Since the constant pool has been
2647 // GC'ed, the methods have also been GC'ed.
2648 return;
2649 }
2651 // make the constantPoolOop safe to return
2652 _prev_constant_pool_handle = constantPoolHandle(cp);
2654 GrowableArray<jweak>* method_refs = pv_node->prev_EMCP_methods();
2655 if (method_refs == NULL) {
2656 // the instanceKlass did not have any EMCP methods
2657 return;
2658 }
2660 _prev_EMCP_method_handles = new GrowableArray<methodHandle>(10);
2662 int n_methods = method_refs->length();
2663 for (int i = 0; i < n_methods; i++) {
2664 jweak method_ref = method_refs->at(i);
2665 assert(method_ref != NULL, "weak method ref was unexpectedly cleared");
2666 if (method_ref == NULL) {
2667 continue; // robustness
2668 }
2670 methodOop method = (methodOop)JNIHandles::resolve(method_ref);
2671 if (method == NULL) {
2672 // this entry has been GC'ed so skip it
2673 continue;
2674 }
2676 // make the methodOop safe to return
2677 _prev_EMCP_method_handles->append(methodHandle(method));
2678 }
2679 }
2682 // Destroy a PreviousVersionInfo
2683 PreviousVersionInfo::~PreviousVersionInfo() {
2684 // Since _prev_EMCP_method_handles is not C-heap allocated, we
2685 // don't have to delete it.
2686 }
2689 // Construct a helper for walking the previous versions array
2690 PreviousVersionWalker::PreviousVersionWalker(instanceKlass *ik) {
2691 _previous_versions = ik->previous_versions();
2692 _current_index = 0;
2693 // _hm needs no initialization
2694 _current_p = NULL;
2695 }
2698 // Destroy a PreviousVersionWalker
2699 PreviousVersionWalker::~PreviousVersionWalker() {
2700 // Delete the current info just in case the caller didn't walk to
2701 // the end of the previous versions list. No harm if _current_p is
2702 // already NULL.
2703 delete _current_p;
2705 // When _hm is destroyed, all the Handles returned in
2706 // PreviousVersionInfo objects will be destroyed.
2707 // Also, after this destructor is finished it will be
2708 // safe to delete the GrowableArray allocated in the
2709 // PreviousVersionInfo objects.
2710 }
2713 // Return the interesting information for the next previous version
2714 // of the klass. Returns NULL if there are no more previous versions.
2715 PreviousVersionInfo* PreviousVersionWalker::next_previous_version() {
2716 if (_previous_versions == NULL) {
2717 // no previous versions so nothing to return
2718 return NULL;
2719 }
2721 delete _current_p; // cleanup the previous info for the caller
2722 _current_p = NULL; // reset to NULL so we don't delete same object twice
2724 int length = _previous_versions->length();
2726 while (_current_index < length) {
2727 PreviousVersionNode * pv_node = _previous_versions->at(_current_index++);
2728 PreviousVersionInfo * pv_info = new (ResourceObj::C_HEAP)
2729 PreviousVersionInfo(pv_node);
2731 constantPoolHandle cp_h = pv_info->prev_constant_pool_handle();
2732 if (cp_h.is_null()) {
2733 delete pv_info;
2735 // The underlying node's info has been GC'ed so try the next one.
2736 // We don't have to check the methods. If the constant pool has
2737 // GC'ed then so have the methods.
2738 continue;
2739 }
2741 // Found a node with non GC'ed info so return it. The caller will
2742 // need to delete pv_info when they are done with it.
2743 _current_p = pv_info;
2744 return pv_info;
2745 }
2747 // all of the underlying nodes' info has been GC'ed
2748 return NULL;
2749 } // end next_previous_version()