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());
  49   for (int i = 0; i < state->num_monitors(); i++) {
  50     process_monitor(
  51       i,
  52       stack()->monitor_offset(i),
  53       stack()->monitor_object_offset(i));
  54   }
  55   end_monitors();
  56 
  57   // Frame header
  58   start_frame_header();
  59   process_oop_tmp_slot(
  60     state->oop_tmp_addr(), stack()->oop_tmp_slot_offset());
  61   process_method_slot(state->method_addr(), stack()->method_slot_offset());
  62   process_pc_slot(stack()->pc_slot_offset());
  63   end_frame_header();
  64 
  65   // Local variables
  66   locals_integrity_checks(state);
  67   start_locals();
  68   for (int i = 0; i < max_locals(); i++) {
  69     process_local_slot(
  70       i,
  71       state->local_addr(i),
  72       stack()->locals_slots_offset() + max_locals() - 1 - i);
  73   }
  74   end_locals();
  75 
  76   end_frame();
  77 }
  78 
  79 #ifndef PRODUCT
  80 void SharkStateScanner::stack_integrity_checks(SharkState* state) {
  81   for (int i = 0; i < state->stack_depth(); i++) {
  82     if (state->stack(i)) {
  83       if (state->stack(i)->is_two_word())
  84         assert(state->stack(i - 1) == NULL, "should be");
  85     }
  86     else {
  87       assert(state->stack(i + 1)->is_two_word(), "should be");
  88     }
  89   }
  90 }
  91 
  92 void SharkStateScanner::locals_integrity_checks(SharkState* state) {
  93   for (int i = 0; i < max_locals(); i++) {
  94     if (state->local(i)) {
  95       if (state->local(i)->is_two_word())
  96         assert(state->local(i + 1) == NULL, "should be");
  97     }
  98   }
  99 }
 100 #endif // !PRODUCT