interfaceSupport.cpp revision 7426:0f6100dde08e
1/*
2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25#include "precompiled.hpp"
26#include "gc_implementation/shared/markSweep.hpp"
27#include "gc_interface/collectedHeap.hpp"
28#include "gc_interface/collectedHeap.inline.hpp"
29#include "memory/genCollectedHeap.hpp"
30#include "memory/resourceArea.hpp"
31#include "runtime/atomic.inline.hpp"
32#include "runtime/init.hpp"
33#include "runtime/interfaceSupport.hpp"
34#include "runtime/orderAccess.inline.hpp"
35#include "runtime/os.inline.hpp"
36#include "runtime/threadLocalStorage.hpp"
37#include "runtime/vframe.hpp"
38#include "utilities/preserveException.hpp"
39
40PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
41
42// Implementation of InterfaceSupport
43
44#ifdef ASSERT
45
46long InterfaceSupport::_number_of_calls       = 0;
47long InterfaceSupport::_scavenge_alot_counter = 1;
48long InterfaceSupport::_fullgc_alot_counter   = 1;
49long InterfaceSupport::_fullgc_alot_invocation = 0;
50
51Histogram* RuntimeHistogram;
52
53RuntimeHistogramElement::RuntimeHistogramElement(const char* elementName) {
54  static volatile jint RuntimeHistogram_lock = 0;
55  _name = elementName;
56  uintx count = 0;
57
58  while (Atomic::cmpxchg(1, &RuntimeHistogram_lock, 0) != 0) {
59    while (OrderAccess::load_acquire(&RuntimeHistogram_lock) != 0) {
60      count +=1;
61      if ( (WarnOnStalledSpinLock > 0)
62        && (count % WarnOnStalledSpinLock == 0)) {
63        warning("RuntimeHistogram_lock seems to be stalled");
64      }
65    }
66  }
67
68  if (RuntimeHistogram == NULL) {
69    RuntimeHistogram = new Histogram("VM Runtime Call Counts",200);
70  }
71
72  RuntimeHistogram->add_element(this);
73  Atomic::dec(&RuntimeHistogram_lock);
74}
75
76void InterfaceSupport::trace(const char* result_type, const char* header) {
77  tty->print_cr("%6d  %s", _number_of_calls, header);
78}
79
80void InterfaceSupport::gc_alot() {
81  Thread *thread = Thread::current();
82  if (!thread->is_Java_thread()) return; // Avoid concurrent calls
83  // Check for new, not quite initialized thread. A thread in new mode cannot initiate a GC.
84  JavaThread *current_thread = (JavaThread *)thread;
85  if (current_thread->active_handles() == NULL) return;
86
87  // Short-circuit any possible re-entrant gc-a-lot attempt
88  if (thread->skip_gcalot()) return;
89
90  if (Threads::is_vm_complete()) {
91
92    if (++_fullgc_alot_invocation < FullGCALotStart) {
93      return;
94    }
95
96    // Use this line if you want to block at a specific point,
97    // e.g. one number_of_calls/scavenge/gc before you got into problems
98    if (FullGCALot) _fullgc_alot_counter--;
99
100    // Check if we should force a full gc
101    if (_fullgc_alot_counter == 0) {
102      // Release dummy so objects are forced to move
103      if (!Universe::release_fullgc_alot_dummy()) {
104        warning("FullGCALot: Unable to release more dummies at bottom of heap");
105      }
106      HandleMark hm(thread);
107      Universe::heap()->collect(GCCause::_full_gc_alot);
108      unsigned int invocations = Universe::heap()->total_full_collections();
109      // Compute new interval
110      if (FullGCALotInterval > 1) {
111        _fullgc_alot_counter = 1+(long)((double)FullGCALotInterval*os::random()/(max_jint+1.0));
112        if (PrintGCDetails && Verbose) {
113          tty->print_cr("Full gc no: %u\tInterval: %d", invocations,
114                        _fullgc_alot_counter);
115        }
116      } else {
117        _fullgc_alot_counter = 1;
118      }
119      // Print progress message
120      if (invocations % 100 == 0) {
121        if (PrintGCDetails && Verbose) tty->print_cr("Full gc no: %u", invocations);
122      }
123    } else {
124      if (ScavengeALot) _scavenge_alot_counter--;
125      // Check if we should force a scavenge
126      if (_scavenge_alot_counter == 0) {
127        HandleMark hm(thread);
128        Universe::heap()->collect(GCCause::_scavenge_alot);
129        unsigned int invocations = Universe::heap()->total_collections() - Universe::heap()->total_full_collections();
130        // Compute new interval
131        if (ScavengeALotInterval > 1) {
132          _scavenge_alot_counter = 1+(long)((double)ScavengeALotInterval*os::random()/(max_jint+1.0));
133          if (PrintGCDetails && Verbose) {
134            tty->print_cr("Scavenge no: %u\tInterval: %d", invocations,
135                          _scavenge_alot_counter);
136          }
137        } else {
138          _scavenge_alot_counter = 1;
139        }
140        // Print progress message
141        if (invocations % 1000 == 0) {
142          if (PrintGCDetails && Verbose) tty->print_cr("Scavenge no: %u", invocations);
143        }
144      }
145    }
146  }
147}
148
149
150vframe* vframe_array[50];
151int walk_stack_counter = 0;
152
153void InterfaceSupport::walk_stack_from(vframe* start_vf) {
154  // walk
155  int i = 0;
156  for (vframe* f = start_vf; f; f = f->sender() ) {
157    if (i < 50) vframe_array[i++] = f;
158  }
159}
160
161
162void InterfaceSupport::walk_stack() {
163  JavaThread* thread = JavaThread::current();
164  walk_stack_counter++;
165  if (!thread->has_last_Java_frame()) return;
166  ResourceMark rm(thread);
167  RegisterMap reg_map(thread);
168  walk_stack_from(thread->last_java_vframe(&reg_map));
169}
170
171
172# ifdef ENABLE_ZAP_DEAD_LOCALS
173
174static int zap_traversals = 0;
175
176void InterfaceSupport::zap_dead_locals_old() {
177  JavaThread* thread = JavaThread::current();
178  if (zap_traversals == -1) // edit constant for debugging
179    warning("I am here");
180  int zap_frame_count = 0; // count frames to help debugging
181  for (StackFrameStream sfs(thread); !sfs.is_done(); sfs.next()) {
182    sfs.current()->zap_dead_locals(thread, sfs.register_map());
183    ++zap_frame_count;
184  }
185  ++zap_traversals;
186}
187
188# endif
189
190// invocation counter for InterfaceSupport::deoptimizeAll/zombieAll functions
191int deoptimizeAllCounter = 0;
192int zombieAllCounter = 0;
193
194void InterfaceSupport::zombieAll() {
195  // This method is called by all threads when a thread make
196  // transition to VM state (for example, runtime calls).
197  // Divide number of calls by number of threads to avoid
198  // dependence of ZombieAll events frequency on number of threads.
199  int value = zombieAllCounter / Threads::number_of_threads();
200  if (is_init_completed() && value > ZombieALotInterval) {
201    zombieAllCounter = 0;
202    VM_ZombieAll op;
203    VMThread::execute(&op);
204  }
205  zombieAllCounter++;
206}
207
208void InterfaceSupport::unlinkSymbols() {
209  VM_UnlinkSymbols op;
210  VMThread::execute(&op);
211}
212
213void InterfaceSupport::deoptimizeAll() {
214  // This method is called by all threads when a thread make
215  // transition to VM state (for example, runtime calls).
216  // Divide number of calls by number of threads to avoid
217  // dependence of DeoptimizeAll events frequency on number of threads.
218  int value = deoptimizeAllCounter / Threads::number_of_threads();
219  if (is_init_completed()) {
220    if (DeoptimizeALot && value > DeoptimizeALotInterval) {
221      deoptimizeAllCounter = 0;
222      VM_DeoptimizeAll op;
223      VMThread::execute(&op);
224    } else if (DeoptimizeRandom && (value & 0x1F) == (os::random() & 0x1F)) {
225      VM_DeoptimizeAll op;
226      VMThread::execute(&op);
227    }
228  }
229  deoptimizeAllCounter++;
230}
231
232
233void InterfaceSupport::stress_derived_pointers() {
234#ifdef COMPILER2
235  JavaThread *thread = JavaThread::current();
236  if (!is_init_completed()) return;
237  ResourceMark rm(thread);
238  bool found = false;
239  for (StackFrameStream sfs(thread); !sfs.is_done() && !found; sfs.next()) {
240    CodeBlob* cb = sfs.current()->cb();
241    if (cb != NULL && cb->oop_maps() ) {
242      // Find oopmap for current method
243      OopMap* map = cb->oop_map_for_return_address(sfs.current()->pc());
244      assert(map != NULL, "no oopmap found for pc");
245      found = map->has_derived_pointer();
246    }
247  }
248  if (found) {
249    // $$$ Not sure what to do here.
250    /*
251    Scavenge::invoke(0);
252    */
253  }
254#endif
255}
256
257
258void InterfaceSupport::verify_stack() {
259  JavaThread* thread = JavaThread::current();
260  ResourceMark rm(thread);
261  // disabled because it throws warnings that oop maps should only be accessed
262  // in VM thread or during debugging
263
264  if (!thread->has_pending_exception()) {
265    // verification does not work if there are pending exceptions
266    StackFrameStream sfs(thread);
267    CodeBlob* cb = sfs.current()->cb();
268      // In case of exceptions we might not have a runtime_stub on
269      // top of stack, hence, all callee-saved registers are not going
270      // to be setup correctly, hence, we cannot do stack verify
271    if (cb != NULL && !(cb->is_runtime_stub() || cb->is_uncommon_trap_stub())) return;
272
273    for (; !sfs.is_done(); sfs.next()) {
274      sfs.current()->verify(sfs.register_map());
275    }
276  }
277}
278
279
280void InterfaceSupport::verify_last_frame() {
281  JavaThread* thread = JavaThread::current();
282  ResourceMark rm(thread);
283  RegisterMap reg_map(thread);
284  frame fr = thread->last_frame();
285  fr.verify(&reg_map);
286}
287
288
289#endif // ASSERT
290
291
292void InterfaceSupport_init() {
293#ifdef ASSERT
294  if (ScavengeALot || FullGCALot) {
295    srand(ScavengeALotInterval * FullGCALotInterval);
296  }
297#endif
298}
299