src/share/vm/shark/sharkStateScanner.cpp

Wed, 11 Aug 2010 05:51:21 -0700

author
twisti
date
Wed, 11 Aug 2010 05:51:21 -0700
changeset 2047
d2ede61b7a12
child 2314
f95d63e2154a
permissions
-rw-r--r--

6976186: integrate Shark HotSpot changes
Summary: Shark is a JIT compiler for Zero that uses the LLVM compiler infrastructure.
Reviewed-by: kvn, twisti
Contributed-by: Gary Benson <gbenson@redhat.com>

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

mercurial