duke@435: /* duke@435: * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * duke@435: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, duke@435: * CA 95054 USA or visit www.sun.com if you need additional information or duke@435: * have any questions. duke@435: * duke@435: */ duke@435: duke@435: #include "incls/_precompiled.incl" duke@435: #include "incls/_interfaceSupport.cpp.incl" duke@435: duke@435: duke@435: // Implementation of InterfaceSupport duke@435: duke@435: #ifdef ASSERT duke@435: duke@435: long InterfaceSupport::_number_of_calls = 0; duke@435: long InterfaceSupport::_scavenge_alot_counter = 1; duke@435: long InterfaceSupport::_fullgc_alot_counter = 1; duke@435: long InterfaceSupport::_fullgc_alot_invocation = 0; duke@435: duke@435: Histogram* RuntimeHistogram; duke@435: duke@435: RuntimeHistogramElement::RuntimeHistogramElement(const char* elementName) { duke@435: static volatile jint RuntimeHistogram_lock = 0; duke@435: _name = elementName; duke@435: uintx count = 0; duke@435: duke@435: while (Atomic::cmpxchg(1, &RuntimeHistogram_lock, 0) != 0) { duke@435: while (OrderAccess::load_acquire(&RuntimeHistogram_lock) != 0) { duke@435: count +=1; duke@435: if ( (WarnOnStalledSpinLock > 0) duke@435: && (count % WarnOnStalledSpinLock == 0)) { duke@435: warning("RuntimeHistogram_lock seems to be stalled"); duke@435: } duke@435: } duke@435: } duke@435: duke@435: if (RuntimeHistogram == NULL) { duke@435: RuntimeHistogram = new Histogram("VM Runtime Call Counts",200); duke@435: } duke@435: duke@435: RuntimeHistogram->add_element(this); duke@435: Atomic::dec(&RuntimeHistogram_lock); duke@435: } duke@435: duke@435: void InterfaceSupport::trace(const char* result_type, const char* header) { duke@435: tty->print_cr("%6d %s", _number_of_calls, header); duke@435: } duke@435: duke@435: void InterfaceSupport::gc_alot() { duke@435: Thread *thread = Thread::current(); ysr@1241: if (!thread->is_Java_thread()) return; // Avoid concurrent calls duke@435: // Check for new, not quite initialized thread. A thread in new mode cannot initiate a GC. duke@435: JavaThread *current_thread = (JavaThread *)thread; duke@435: if (current_thread->active_handles() == NULL) return; duke@435: ysr@1241: // Short-circuit any possible re-entrant gc-a-lot attempt ysr@1241: if (thread->skip_gcalot()) return; ysr@1241: duke@435: if (is_init_completed()) { duke@435: duke@435: if (++_fullgc_alot_invocation < FullGCALotStart) { duke@435: return; duke@435: } duke@435: duke@435: // Use this line if you want to block at a specific point, duke@435: // e.g. one number_of_calls/scavenge/gc before you got into problems duke@435: if (FullGCALot) _fullgc_alot_counter--; duke@435: duke@435: // Check if we should force a full gc duke@435: if (_fullgc_alot_counter == 0) { duke@435: // Release dummy so objects are forced to move duke@435: if (!Universe::release_fullgc_alot_dummy()) { duke@435: warning("FullGCALot: Unable to release more dummies at bottom of heap"); duke@435: } duke@435: HandleMark hm(thread); duke@435: Universe::heap()->collect(GCCause::_full_gc_alot); duke@435: unsigned int invocations = Universe::heap()->total_full_collections(); duke@435: // Compute new interval duke@435: if (FullGCALotInterval > 1) { duke@435: _fullgc_alot_counter = 1+(long)((double)FullGCALotInterval*os::random()/(max_jint+1.0)); duke@435: if (PrintGCDetails && Verbose) { duke@435: tty->print_cr("Full gc no: %u\tInterval: %d", invocations, duke@435: _fullgc_alot_counter); duke@435: } duke@435: } else { duke@435: _fullgc_alot_counter = 1; duke@435: } duke@435: // Print progress message duke@435: if (invocations % 100 == 0) { duke@435: if (PrintGCDetails && Verbose) tty->print_cr("Full gc no: %u", invocations); duke@435: } duke@435: } else { duke@435: if (ScavengeALot) _scavenge_alot_counter--; duke@435: // Check if we should force a scavenge duke@435: if (_scavenge_alot_counter == 0) { duke@435: HandleMark hm(thread); duke@435: Universe::heap()->collect(GCCause::_scavenge_alot); duke@435: unsigned int invocations = Universe::heap()->total_collections() - Universe::heap()->total_full_collections(); duke@435: // Compute new interval duke@435: if (ScavengeALotInterval > 1) { duke@435: _scavenge_alot_counter = 1+(long)((double)ScavengeALotInterval*os::random()/(max_jint+1.0)); duke@435: if (PrintGCDetails && Verbose) { duke@435: tty->print_cr("Scavenge no: %u\tInterval: %d", invocations, duke@435: _scavenge_alot_counter); duke@435: } duke@435: } else { duke@435: _scavenge_alot_counter = 1; duke@435: } duke@435: // Print progress message duke@435: if (invocations % 1000 == 0) { duke@435: if (PrintGCDetails && Verbose) tty->print_cr("Scavenge no: %u", invocations); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: vframe* vframe_array[50]; duke@435: int walk_stack_counter = 0; duke@435: duke@435: void InterfaceSupport::walk_stack_from(vframe* start_vf) { duke@435: // walk duke@435: int i = 0; duke@435: for (vframe* f = start_vf; f; f = f->sender() ) { duke@435: if (i < 50) vframe_array[i++] = f; duke@435: } duke@435: } duke@435: duke@435: duke@435: void InterfaceSupport::walk_stack() { duke@435: JavaThread* thread = JavaThread::current(); duke@435: walk_stack_counter++; duke@435: if (!thread->has_last_Java_frame()) return; duke@435: ResourceMark rm(thread); duke@435: RegisterMap reg_map(thread); duke@435: walk_stack_from(thread->last_java_vframe(®_map)); duke@435: } duke@435: duke@435: duke@435: # ifdef ENABLE_ZAP_DEAD_LOCALS duke@435: duke@435: static int zap_traversals = 0; duke@435: duke@435: void InterfaceSupport::zap_dead_locals_old() { duke@435: JavaThread* thread = JavaThread::current(); duke@435: if (zap_traversals == -1) // edit constant for debugging duke@435: warning("I am here"); duke@435: int zap_frame_count = 0; // count frames to help debugging duke@435: for (StackFrameStream sfs(thread); !sfs.is_done(); sfs.next()) { duke@435: sfs.current()->zap_dead_locals(thread, sfs.register_map()); duke@435: ++zap_frame_count; duke@435: } duke@435: ++zap_traversals; duke@435: } duke@435: duke@435: # endif duke@435: duke@435: duke@435: int deoptimizeAllCounter = 0; duke@435: int zombieAllCounter = 0; duke@435: duke@435: duke@435: void InterfaceSupport::zombieAll() { duke@435: if (is_init_completed() && zombieAllCounter > ZombieALotInterval) { duke@435: zombieAllCounter = 0; duke@435: VM_ZombieAll op; duke@435: VMThread::execute(&op); duke@435: } else { duke@435: zombieAllCounter++; duke@435: } duke@435: } duke@435: duke@435: void InterfaceSupport::deoptimizeAll() { duke@435: if (is_init_completed() ) { duke@435: if (DeoptimizeALot && deoptimizeAllCounter > DeoptimizeALotInterval) { duke@435: deoptimizeAllCounter = 0; duke@435: VM_DeoptimizeAll op; duke@435: VMThread::execute(&op); duke@435: } else if (DeoptimizeRandom && (deoptimizeAllCounter & 0x1f) == (os::random() & 0x1f)) { duke@435: VM_DeoptimizeAll op; duke@435: VMThread::execute(&op); duke@435: } duke@435: } duke@435: deoptimizeAllCounter++; duke@435: } duke@435: duke@435: duke@435: void InterfaceSupport::stress_derived_pointers() { duke@435: #ifdef COMPILER2 duke@435: JavaThread *thread = JavaThread::current(); duke@435: if (!is_init_completed()) return; duke@435: ResourceMark rm(thread); duke@435: bool found = false; duke@435: for (StackFrameStream sfs(thread); !sfs.is_done() && !found; sfs.next()) { duke@435: CodeBlob* cb = sfs.current()->cb(); duke@435: if (cb != NULL && cb->oop_maps() ) { duke@435: // Find oopmap for current method duke@435: OopMap* map = cb->oop_map_for_return_address(sfs.current()->pc()); duke@435: assert(map != NULL, "no oopmap found for pc"); duke@435: found = map->has_derived_pointer(); duke@435: } duke@435: } duke@435: if (found) { duke@435: // $$$ Not sure what to do here. duke@435: /* duke@435: Scavenge::invoke(0); duke@435: */ duke@435: } duke@435: #endif duke@435: } duke@435: duke@435: duke@435: void InterfaceSupport::verify_stack() { duke@435: JavaThread* thread = JavaThread::current(); duke@435: ResourceMark rm(thread); duke@435: // disabled because it throws warnings that oop maps should only be accessed duke@435: // in VM thread or during debugging duke@435: duke@435: if (!thread->has_pending_exception()) { duke@435: // verification does not work if there are pending exceptions duke@435: StackFrameStream sfs(thread); duke@435: CodeBlob* cb = sfs.current()->cb(); duke@435: // In case of exceptions we might not have a runtime_stub on duke@435: // top of stack, hence, all callee-saved registers are not going duke@435: // to be setup correctly, hence, we cannot do stack verify duke@435: if (cb != NULL && !(cb->is_runtime_stub() || cb->is_uncommon_trap_stub())) return; duke@435: duke@435: for (; !sfs.is_done(); sfs.next()) { duke@435: sfs.current()->verify(sfs.register_map()); duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: void InterfaceSupport::verify_last_frame() { duke@435: JavaThread* thread = JavaThread::current(); duke@435: ResourceMark rm(thread); duke@435: RegisterMap reg_map(thread); duke@435: frame fr = thread->last_frame(); duke@435: fr.verify(®_map); duke@435: } duke@435: duke@435: duke@435: #endif // ASSERT duke@435: duke@435: duke@435: void InterfaceSupport_init() { duke@435: #ifdef ASSERT duke@435: if (ScavengeALot || FullGCALot) { duke@435: srand(ScavengeALotInterval * FullGCALotInterval); duke@435: } duke@435: #endif duke@435: }