1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/share/vm/shark/sharkStateScanner.cpp Wed Apr 27 01:25:04 2016 +0800
1.3 @@ -0,0 +1,100 @@
1.4 +/*
1.5 + * Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved.
1.6 + * Copyright 2008, 2009 Red Hat, Inc.
1.7 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.8 + *
1.9 + * This code is free software; you can redistribute it and/or modify it
1.10 + * under the terms of the GNU General Public License version 2 only, as
1.11 + * published by the Free Software Foundation.
1.12 + *
1.13 + * This code is distributed in the hope that it will be useful, but WITHOUT
1.14 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1.15 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1.16 + * version 2 for more details (a copy is included in the LICENSE file that
1.17 + * accompanied this code).
1.18 + *
1.19 + * You should have received a copy of the GNU General Public License version
1.20 + * 2 along with this work; if not, write to the Free Software Foundation,
1.21 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1.22 + *
1.23 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1.24 + * or visit www.oracle.com if you need additional information or have any
1.25 + * questions.
1.26 + *
1.27 + */
1.28 +
1.29 +#include "precompiled.hpp"
1.30 +#include "shark/sharkState.hpp"
1.31 +#include "shark/sharkStateScanner.hpp"
1.32 +
1.33 +using namespace llvm;
1.34 +
1.35 +void SharkStateScanner::scan(SharkState* state) {
1.36 + start_frame();
1.37 +
1.38 + // Expression stack
1.39 + stack_integrity_checks(state);
1.40 + start_stack(state->stack_depth());
1.41 + for (int i = state->stack_depth() - 1; i >= 0; i--) {
1.42 + process_stack_slot(
1.43 + i,
1.44 + state->stack_addr(i),
1.45 + stack()->stack_slots_offset() +
1.46 + i + max_stack() - state->stack_depth());
1.47 + }
1.48 + end_stack();
1.49 +
1.50 + // Monitors
1.51 + start_monitors(state->num_monitors());
1.52 + for (int i = 0; i < state->num_monitors(); i++) {
1.53 + process_monitor(
1.54 + i,
1.55 + stack()->monitor_offset(i),
1.56 + stack()->monitor_object_offset(i));
1.57 + }
1.58 + end_monitors();
1.59 +
1.60 + // Frame header
1.61 + start_frame_header();
1.62 + process_oop_tmp_slot(
1.63 + state->oop_tmp_addr(), stack()->oop_tmp_slot_offset());
1.64 + process_method_slot(state->method_addr(), stack()->method_slot_offset());
1.65 + process_pc_slot(stack()->pc_slot_offset());
1.66 + end_frame_header();
1.67 +
1.68 + // Local variables
1.69 + locals_integrity_checks(state);
1.70 + start_locals();
1.71 + for (int i = 0; i < max_locals(); i++) {
1.72 + process_local_slot(
1.73 + i,
1.74 + state->local_addr(i),
1.75 + stack()->locals_slots_offset() + max_locals() - 1 - i);
1.76 + }
1.77 + end_locals();
1.78 +
1.79 + end_frame();
1.80 +}
1.81 +
1.82 +#ifndef PRODUCT
1.83 +void SharkStateScanner::stack_integrity_checks(SharkState* state) {
1.84 + for (int i = 0; i < state->stack_depth(); i++) {
1.85 + if (state->stack(i)) {
1.86 + if (state->stack(i)->is_two_word())
1.87 + assert(state->stack(i - 1) == NULL, "should be");
1.88 + }
1.89 + else {
1.90 + assert(state->stack(i + 1)->is_two_word(), "should be");
1.91 + }
1.92 + }
1.93 +}
1.94 +
1.95 +void SharkStateScanner::locals_integrity_checks(SharkState* state) {
1.96 + for (int i = 0; i < max_locals(); i++) {
1.97 + if (state->local(i)) {
1.98 + if (state->local(i)->is_two_word())
1.99 + assert(state->local(i + 1) == NULL, "should be");
1.100 + }
1.101 + }
1.102 +}
1.103 +#endif // !PRODUCT
