Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/shark/sharkStateScanner.cpp@710a3c8b516e (annotated)
src/share/vm/shark/sharkStateScanner.cpp
Tue, 08 Aug 2017 15:57:29 +0800
- author
- aoqi
- date
- Tue, 08 Aug 2017 15:57:29 +0800
- changeset 6876
- 710a3c8b516e
- parent 2314
- f95d63e2154a
- parent 0
- f90c822e73f8
- permissions
- -rw-r--r--
merge
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved. |
| aoqi@0 | 3 | * Copyright 2008, 2009 Red Hat, Inc. |
| aoqi@0 | 4 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| aoqi@0 | 5 | * |
| aoqi@0 | 6 | * This code is free software; you can redistribute it and/or modify it |
| aoqi@0 | 7 | * under the terms of the GNU General Public License version 2 only, as |
| aoqi@0 | 8 | * published by the Free Software Foundation. |
| aoqi@0 | 9 | * |
| aoqi@0 | 10 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| aoqi@0 | 11 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| aoqi@0 | 12 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| aoqi@0 | 13 | * version 2 for more details (a copy is included in the LICENSE file that |
| aoqi@0 | 14 | * accompanied this code). |
| aoqi@0 | 15 | * |
| aoqi@0 | 16 | * You should have received a copy of the GNU General Public License version |
| aoqi@0 | 17 | * 2 along with this work; if not, write to the Free Software Foundation, |
| aoqi@0 | 18 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| aoqi@0 | 19 | * |
| aoqi@0 | 20 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| aoqi@0 | 21 | * or visit www.oracle.com if you need additional information or have any |
| aoqi@0 | 22 | * questions. |
| aoqi@0 | 23 | * |
| aoqi@0 | 24 | */ |
| aoqi@0 | 25 | |
| aoqi@0 | 26 | #include "precompiled.hpp" |
| aoqi@0 | 27 | #include "shark/sharkState.hpp" |
| aoqi@0 | 28 | #include "shark/sharkStateScanner.hpp" |
| aoqi@0 | 29 | |
| aoqi@0 | 30 | using namespace llvm; |
| aoqi@0 | 31 | |
| aoqi@0 | 32 | void SharkStateScanner::scan(SharkState* state) { |
| aoqi@0 | 33 | start_frame(); |
| aoqi@0 | 34 | |
| aoqi@0 | 35 | // Expression stack |
| aoqi@0 | 36 | stack_integrity_checks(state); |
| aoqi@0 | 37 | start_stack(state->stack_depth()); |
| aoqi@0 | 38 | for (int i = state->stack_depth() - 1; i >= 0; i--) { |
| aoqi@0 | 39 | process_stack_slot( |
| aoqi@0 | 40 | i, |
| aoqi@0 | 41 | state->stack_addr(i), |
| aoqi@0 | 42 | stack()->stack_slots_offset() + |
| aoqi@0 | 43 | i + max_stack() - state->stack_depth()); |
| aoqi@0 | 44 | } |
| aoqi@0 | 45 | end_stack(); |
| aoqi@0 | 46 | |
| aoqi@0 | 47 | // Monitors |
| aoqi@0 | 48 | start_monitors(state->num_monitors()); |
| aoqi@0 | 49 | for (int i = 0; i < state->num_monitors(); i++) { |
| aoqi@0 | 50 | process_monitor( |
| aoqi@0 | 51 | i, |
| aoqi@0 | 52 | stack()->monitor_offset(i), |
| aoqi@0 | 53 | stack()->monitor_object_offset(i)); |
| aoqi@0 | 54 | } |
| aoqi@0 | 55 | end_monitors(); |
| aoqi@0 | 56 | |
| aoqi@0 | 57 | // Frame header |
| aoqi@0 | 58 | start_frame_header(); |
| aoqi@0 | 59 | process_oop_tmp_slot( |
| aoqi@0 | 60 | state->oop_tmp_addr(), stack()->oop_tmp_slot_offset()); |
| aoqi@0 | 61 | process_method_slot(state->method_addr(), stack()->method_slot_offset()); |
| aoqi@0 | 62 | process_pc_slot(stack()->pc_slot_offset()); |
| aoqi@0 | 63 | end_frame_header(); |
| aoqi@0 | 64 | |
| aoqi@0 | 65 | // Local variables |
| aoqi@0 | 66 | locals_integrity_checks(state); |
| aoqi@0 | 67 | start_locals(); |
| aoqi@0 | 68 | for (int i = 0; i < max_locals(); i++) { |
| aoqi@0 | 69 | process_local_slot( |
| aoqi@0 | 70 | i, |
| aoqi@0 | 71 | state->local_addr(i), |
| aoqi@0 | 72 | stack()->locals_slots_offset() + max_locals() - 1 - i); |
| aoqi@0 | 73 | } |
| aoqi@0 | 74 | end_locals(); |
| aoqi@0 | 75 | |
| aoqi@0 | 76 | end_frame(); |
| aoqi@0 | 77 | } |
| aoqi@0 | 78 | |
| aoqi@0 | 79 | #ifndef PRODUCT |
| aoqi@0 | 80 | void SharkStateScanner::stack_integrity_checks(SharkState* state) { |
| aoqi@0 | 81 | for (int i = 0; i < state->stack_depth(); i++) { |
| aoqi@0 | 82 | if (state->stack(i)) { |
| aoqi@0 | 83 | if (state->stack(i)->is_two_word()) |
| aoqi@0 | 84 | assert(state->stack(i - 1) == NULL, "should be"); |
| aoqi@0 | 85 | } |
| aoqi@0 | 86 | else { |
| aoqi@0 | 87 | assert(state->stack(i + 1)->is_two_word(), "should be"); |
| aoqi@0 | 88 | } |
| aoqi@0 | 89 | } |
| aoqi@0 | 90 | } |
| aoqi@0 | 91 | |
| aoqi@0 | 92 | void SharkStateScanner::locals_integrity_checks(SharkState* state) { |
| aoqi@0 | 93 | for (int i = 0; i < max_locals(); i++) { |
| aoqi@0 | 94 | if (state->local(i)) { |
| aoqi@0 | 95 | if (state->local(i)->is_two_word()) |
| aoqi@0 | 96 | assert(state->local(i + 1) == NULL, "should be"); |
| aoqi@0 | 97 | } |
| aoqi@0 | 98 | } |
| aoqi@0 | 99 | } |
| aoqi@0 | 100 | #endif // !PRODUCT |
