src/share/vm/shark/sharkStateScanner.cpp

Print this page


   1 /*
   2  * Copyright (c) 1999, 2007, Oracle and/or its affiliates. All rights reserved.
   3  * Copyright 2008, 2009 Red Hat, Inc.
   4  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   5  *
   6  * This code is free software; you can redistribute it and/or modify it
   7  * under the terms of the GNU General Public License version 2 only, as
   8  * published by the Free Software Foundation.
   9  *
  10  * This code is distributed in the hope that it will be useful, but WITHOUT
  11  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  12  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  13  * version 2 for more details (a copy is included in the LICENSE file that
  14  * accompanied this code).
  15  *
  16  * You should have received a copy of the GNU General Public License version
  17  * 2 along with this work; if not, write to the Free Software Foundation,
  18  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  19  *
  20  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  21  * or visit www.oracle.com if you need additional information or have any
  22  * questions.
  23  *
  24  */
  25 
  26 #include "incls/_precompiled.incl"
  27 #include "incls/_sharkStateScanner.cpp.incl"

  28 
  29 using namespace llvm;
  30 
  31 void SharkStateScanner::scan(SharkState* state) {
  32   start_frame();
  33 
  34   // Expression stack
  35   stack_integrity_checks(state);
  36   start_stack(state->stack_depth());
  37   for (int i = state->stack_depth() - 1; i >= 0; i--) {
  38     process_stack_slot(
  39       i,
  40       state->stack_addr(i),
  41       stack()->stack_slots_offset() +
  42         i + max_stack() - state->stack_depth());
  43   }
  44   end_stack();
  45 
  46   // Monitors
  47   start_monitors(state->num_monitors());


   1 /*
   2  * Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved.
   3  * Copyright 2008, 2009 Red Hat, Inc.
   4  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   5  *
   6  * This code is free software; you can redistribute it and/or modify it
   7  * under the terms of the GNU General Public License version 2 only, as
   8  * published by the Free Software Foundation.
   9  *
  10  * This code is distributed in the hope that it will be useful, but WITHOUT
  11  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  12  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  13  * version 2 for more details (a copy is included in the LICENSE file that
  14  * accompanied this code).
  15  *
  16  * You should have received a copy of the GNU General Public License version
  17  * 2 along with this work; if not, write to the Free Software Foundation,
  18  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  19  *
  20  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  21  * or visit www.oracle.com if you need additional information or have any
  22  * questions.
  23  *
  24  */
  25 
  26 #include "precompiled.hpp"
  27 #include "shark/sharkState.hpp"
  28 #include "shark/sharkStateScanner.hpp"
  29 
  30 using namespace llvm;
  31 
  32 void SharkStateScanner::scan(SharkState* state) {
  33   start_frame();
  34 
  35   // Expression stack
  36   stack_integrity_checks(state);
  37   start_stack(state->stack_depth());
  38   for (int i = state->stack_depth() - 1; i >= 0; i--) {
  39     process_stack_slot(
  40       i,
  41       state->stack_addr(i),
  42       stack()->stack_slots_offset() +
  43         i + max_stack() - state->stack_depth());
  44   }
  45   end_stack();
  46 
  47   // Monitors
  48   start_monitors(state->num_monitors());