twisti@2047: /* stefank@2314: * Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved. twisti@2047: * Copyright 2008, 2009 Red Hat, Inc. twisti@2047: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. twisti@2047: * twisti@2047: * This code is free software; you can redistribute it and/or modify it twisti@2047: * under the terms of the GNU General Public License version 2 only, as twisti@2047: * published by the Free Software Foundation. twisti@2047: * twisti@2047: * This code is distributed in the hope that it will be useful, but WITHOUT twisti@2047: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or twisti@2047: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License twisti@2047: * version 2 for more details (a copy is included in the LICENSE file that twisti@2047: * accompanied this code). twisti@2047: * twisti@2047: * You should have received a copy of the GNU General Public License version twisti@2047: * 2 along with this work; if not, write to the Free Software Foundation, twisti@2047: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. twisti@2047: * twisti@2047: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA twisti@2047: * or visit www.oracle.com if you need additional information or have any twisti@2047: * questions. twisti@2047: * twisti@2047: */ twisti@2047: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "shark/sharkState.hpp" stefank@2314: #include "shark/sharkStateScanner.hpp" twisti@2047: twisti@2047: using namespace llvm; twisti@2047: twisti@2047: void SharkStateScanner::scan(SharkState* state) { twisti@2047: start_frame(); twisti@2047: twisti@2047: // Expression stack twisti@2047: stack_integrity_checks(state); twisti@2047: start_stack(state->stack_depth()); twisti@2047: for (int i = state->stack_depth() - 1; i >= 0; i--) { twisti@2047: process_stack_slot( twisti@2047: i, twisti@2047: state->stack_addr(i), twisti@2047: stack()->stack_slots_offset() + twisti@2047: i + max_stack() - state->stack_depth()); twisti@2047: } twisti@2047: end_stack(); twisti@2047: twisti@2047: // Monitors twisti@2047: start_monitors(state->num_monitors()); twisti@2047: for (int i = 0; i < state->num_monitors(); i++) { twisti@2047: process_monitor( twisti@2047: i, twisti@2047: stack()->monitor_offset(i), twisti@2047: stack()->monitor_object_offset(i)); twisti@2047: } twisti@2047: end_monitors(); twisti@2047: twisti@2047: // Frame header twisti@2047: start_frame_header(); twisti@2047: process_oop_tmp_slot( twisti@2047: state->oop_tmp_addr(), stack()->oop_tmp_slot_offset()); twisti@2047: process_method_slot(state->method_addr(), stack()->method_slot_offset()); twisti@2047: process_pc_slot(stack()->pc_slot_offset()); twisti@2047: end_frame_header(); twisti@2047: twisti@2047: // Local variables twisti@2047: locals_integrity_checks(state); twisti@2047: start_locals(); twisti@2047: for (int i = 0; i < max_locals(); i++) { twisti@2047: process_local_slot( twisti@2047: i, twisti@2047: state->local_addr(i), twisti@2047: stack()->locals_slots_offset() + max_locals() - 1 - i); twisti@2047: } twisti@2047: end_locals(); twisti@2047: twisti@2047: end_frame(); twisti@2047: } twisti@2047: twisti@2047: #ifndef PRODUCT twisti@2047: void SharkStateScanner::stack_integrity_checks(SharkState* state) { twisti@2047: for (int i = 0; i < state->stack_depth(); i++) { twisti@2047: if (state->stack(i)) { twisti@2047: if (state->stack(i)->is_two_word()) twisti@2047: assert(state->stack(i - 1) == NULL, "should be"); twisti@2047: } twisti@2047: else { twisti@2047: assert(state->stack(i + 1)->is_two_word(), "should be"); twisti@2047: } twisti@2047: } twisti@2047: } twisti@2047: twisti@2047: void SharkStateScanner::locals_integrity_checks(SharkState* state) { twisti@2047: for (int i = 0; i < max_locals(); i++) { twisti@2047: if (state->local(i)) { twisti@2047: if (state->local(i)->is_two_word()) twisti@2047: assert(state->local(i + 1) == NULL, "should be"); twisti@2047: } twisti@2047: } twisti@2047: } twisti@2047: #endif // !PRODUCT