Mercurial > hg > truffle
diff src/share/vm/interpreter/interpreter.cpp @ 7066:7d815d842ee0
Merge.
author | Christian Haeubl <haeubl@ssw.jku.at> |
---|---|
date | Fri, 23 Nov 2012 11:50:27 +0100 |
parents | 8c5333c80cfd e522a00b91aa |
children | 1baf7f1e3f23 |
line wrap: on
line diff
--- a/src/share/vm/interpreter/interpreter.cpp Fri Nov 23 11:40:17 2012 +0100 +++ b/src/share/vm/interpreter/interpreter.cpp Fri Nov 23 11:50:27 2012 +0100 @@ -1,5 +1,5 @@ /* - * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. + * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it @@ -32,8 +32,8 @@ #include "memory/allocation.inline.hpp" #include "memory/resourceArea.hpp" #include "oops/arrayOop.hpp" -#include "oops/methodDataOop.hpp" -#include "oops/methodOop.hpp" +#include "oops/methodData.hpp" +#include "oops/method.hpp" #include "oops/oop.inline.hpp" #include "prims/forte.hpp" #include "prims/jvmtiExport.hpp" @@ -60,7 +60,9 @@ void InterpreterCodelet::print_on(outputStream* st) const { + ttyLocker ttyl; if (PrintInterpreter || PrintMachineCodeToFile) { + st->print_cr("----------------------------------------------------------------------"); } @@ -70,7 +72,7 @@ code_begin(), code_end(), code_size()); if (PrintInterpreter || PrintMachineCodeToFile) { - Disassembler::decode(code_begin(), code_end(), st); + Disassembler::decode(code_begin(), code_end(), st, DEBUG_ONLY(_comments) NOT_DEBUG(CodeComments())); } } @@ -310,7 +312,7 @@ // Deoptimization support // If deoptimization happens, this function returns the point of next bytecode to continue execution -address AbstractInterpreter::deopt_continue_after_entry(methodOop method, address bcp, int callee_parameters, bool is_top_frame) { +address AbstractInterpreter::deopt_continue_after_entry(Method* method, address bcp, int callee_parameters, bool is_top_frame) { assert(method->contains(bcp), "just checkin'"); Bytecodes::Code code = Bytecodes::java_code_at(method, bcp); assert(!Interpreter::bytecode_should_reexecute(code), "should not reexecute"); @@ -348,7 +350,7 @@ // (NOT needed for the old calling convension) if (!is_top_frame) { int index = Bytes::get_native_u4(bcp+1); - method->constants()->cache()->secondary_entry_at(index)->set_parameter_size(callee_parameters); + method->constants()->invokedynamic_cp_cache_entry_at(index)->set_parameter_size(callee_parameters); } break; } @@ -380,7 +382,7 @@ // the bytecode. // Note: Bytecodes::_athrow is a special case in that it does not return // Interpreter::deopt_entry(vtos, 0) like others -address AbstractInterpreter::deopt_reexecute_entry(methodOop method, address bcp) { +address AbstractInterpreter::deopt_reexecute_entry(Method* method, address bcp) { assert(method->contains(bcp), "just checkin'"); Bytecodes::Code code = Bytecodes::java_code_at(method, bcp); #ifdef COMPILER1 @@ -481,3 +483,11 @@ } } } + +void AbstractInterpreterGenerator::initialize_method_handle_entries() { + // method handle entry kinds are generated later in MethodHandlesAdapterGenerator::generate: + for (int i = Interpreter::method_handle_invoke_FIRST; i <= Interpreter::method_handle_invoke_LAST; i++) { + Interpreter::MethodKind kind = (Interpreter::MethodKind) i; + Interpreter::_entry_table[kind] = Interpreter::_entry_table[Interpreter::abstract]; + } +}