Mon, 29 Aug 2011 05:07:35 -0700
7083184: JSR 292: don't store context class argument with call site dependencies
Reviewed-by: jrose, never
duke@435 | 1 | /* |
jrose@2639 | 2 | * Copyright (c) 2000, 2011, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "ci/bcEscapeAnalyzer.hpp" |
twisti@3050 | 27 | #include "ci/ciCallSite.hpp" |
stefank@2314 | 28 | #include "ci/ciCPCache.hpp" |
stefank@2314 | 29 | #include "ci/ciMethodHandle.hpp" |
stefank@2314 | 30 | #include "classfile/javaClasses.hpp" |
stefank@2314 | 31 | #include "compiler/compileLog.hpp" |
stefank@2314 | 32 | #include "opto/addnode.hpp" |
stefank@2314 | 33 | #include "opto/callGenerator.hpp" |
stefank@2314 | 34 | #include "opto/callnode.hpp" |
stefank@2314 | 35 | #include "opto/cfgnode.hpp" |
stefank@2314 | 36 | #include "opto/connode.hpp" |
stefank@2314 | 37 | #include "opto/parse.hpp" |
stefank@2314 | 38 | #include "opto/rootnode.hpp" |
stefank@2314 | 39 | #include "opto/runtime.hpp" |
stefank@2314 | 40 | #include "opto/subnode.hpp" |
duke@435 | 41 | |
duke@435 | 42 | CallGenerator::CallGenerator(ciMethod* method) { |
duke@435 | 43 | _method = method; |
duke@435 | 44 | } |
duke@435 | 45 | |
duke@435 | 46 | // Utility function. |
duke@435 | 47 | const TypeFunc* CallGenerator::tf() const { |
duke@435 | 48 | return TypeFunc::make(method()); |
duke@435 | 49 | } |
duke@435 | 50 | |
duke@435 | 51 | //-----------------------------ParseGenerator--------------------------------- |
duke@435 | 52 | // Internal class which handles all direct bytecode traversal. |
duke@435 | 53 | class ParseGenerator : public InlineCallGenerator { |
duke@435 | 54 | private: |
duke@435 | 55 | bool _is_osr; |
duke@435 | 56 | float _expected_uses; |
duke@435 | 57 | |
duke@435 | 58 | public: |
duke@435 | 59 | ParseGenerator(ciMethod* method, float expected_uses, bool is_osr = false) |
duke@435 | 60 | : InlineCallGenerator(method) |
duke@435 | 61 | { |
duke@435 | 62 | _is_osr = is_osr; |
duke@435 | 63 | _expected_uses = expected_uses; |
duke@435 | 64 | assert(can_parse(method, is_osr), "parse must be possible"); |
duke@435 | 65 | } |
duke@435 | 66 | |
duke@435 | 67 | // Can we build either an OSR or a regular parser for this method? |
duke@435 | 68 | static bool can_parse(ciMethod* method, int is_osr = false); |
duke@435 | 69 | |
duke@435 | 70 | virtual bool is_parse() const { return true; } |
duke@435 | 71 | virtual JVMState* generate(JVMState* jvms); |
duke@435 | 72 | int is_osr() { return _is_osr; } |
duke@435 | 73 | |
duke@435 | 74 | }; |
duke@435 | 75 | |
duke@435 | 76 | JVMState* ParseGenerator::generate(JVMState* jvms) { |
duke@435 | 77 | Compile* C = Compile::current(); |
duke@435 | 78 | |
duke@435 | 79 | if (is_osr()) { |
duke@435 | 80 | // The JVMS for a OSR has a single argument (see its TypeFunc). |
duke@435 | 81 | assert(jvms->depth() == 1, "no inline OSR"); |
duke@435 | 82 | } |
duke@435 | 83 | |
duke@435 | 84 | if (C->failing()) { |
duke@435 | 85 | return NULL; // bailing out of the compile; do not try to parse |
duke@435 | 86 | } |
duke@435 | 87 | |
duke@435 | 88 | Parse parser(jvms, method(), _expected_uses); |
duke@435 | 89 | // Grab signature for matching/allocation |
duke@435 | 90 | #ifdef ASSERT |
duke@435 | 91 | if (parser.tf() != (parser.depth() == 1 ? C->tf() : tf())) { |
duke@435 | 92 | MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 93 | assert(C->env()->system_dictionary_modification_counter_changed(), |
duke@435 | 94 | "Must invalidate if TypeFuncs differ"); |
duke@435 | 95 | } |
duke@435 | 96 | #endif |
duke@435 | 97 | |
duke@435 | 98 | GraphKit& exits = parser.exits(); |
duke@435 | 99 | |
duke@435 | 100 | if (C->failing()) { |
duke@435 | 101 | while (exits.pop_exception_state() != NULL) ; |
duke@435 | 102 | return NULL; |
duke@435 | 103 | } |
duke@435 | 104 | |
duke@435 | 105 | assert(exits.jvms()->same_calls_as(jvms), "sanity"); |
duke@435 | 106 | |
duke@435 | 107 | // Simply return the exit state of the parser, |
duke@435 | 108 | // augmented by any exceptional states. |
duke@435 | 109 | return exits.transfer_exceptions_into_jvms(); |
duke@435 | 110 | } |
duke@435 | 111 | |
duke@435 | 112 | //---------------------------DirectCallGenerator------------------------------ |
duke@435 | 113 | // Internal class which handles all out-of-line calls w/o receiver type checks. |
duke@435 | 114 | class DirectCallGenerator : public CallGenerator { |
never@1515 | 115 | private: |
never@1515 | 116 | CallStaticJavaNode* _call_node; |
never@1515 | 117 | // Force separate memory and I/O projections for the exceptional |
never@1515 | 118 | // paths to facilitate late inlinig. |
never@1515 | 119 | bool _separate_io_proj; |
never@1515 | 120 | |
never@1515 | 121 | public: |
never@1515 | 122 | DirectCallGenerator(ciMethod* method, bool separate_io_proj) |
never@1515 | 123 | : CallGenerator(method), |
never@1515 | 124 | _separate_io_proj(separate_io_proj) |
duke@435 | 125 | { |
duke@435 | 126 | } |
duke@435 | 127 | virtual JVMState* generate(JVMState* jvms); |
never@1515 | 128 | |
never@1515 | 129 | CallStaticJavaNode* call_node() const { return _call_node; } |
duke@435 | 130 | }; |
duke@435 | 131 | |
duke@435 | 132 | JVMState* DirectCallGenerator::generate(JVMState* jvms) { |
duke@435 | 133 | GraphKit kit(jvms); |
duke@435 | 134 | bool is_static = method()->is_static(); |
duke@435 | 135 | address target = is_static ? SharedRuntime::get_resolve_static_call_stub() |
duke@435 | 136 | : SharedRuntime::get_resolve_opt_virtual_call_stub(); |
duke@435 | 137 | |
duke@435 | 138 | if (kit.C->log() != NULL) { |
duke@435 | 139 | kit.C->log()->elem("direct_call bci='%d'", jvms->bci()); |
duke@435 | 140 | } |
duke@435 | 141 | |
duke@435 | 142 | CallStaticJavaNode *call = new (kit.C, tf()->domain()->cnt()) CallStaticJavaNode(tf(), target, method(), kit.bci()); |
duke@435 | 143 | if (!is_static) { |
duke@435 | 144 | // Make an explicit receiver null_check as part of this call. |
duke@435 | 145 | // Since we share a map with the caller, his JVMS gets adjusted. |
duke@435 | 146 | kit.null_check_receiver(method()); |
duke@435 | 147 | if (kit.stopped()) { |
duke@435 | 148 | // And dump it back to the caller, decorated with any exceptions: |
duke@435 | 149 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 150 | } |
duke@435 | 151 | // Mark the call node as virtual, sort of: |
duke@435 | 152 | call->set_optimized_virtual(true); |
twisti@1700 | 153 | if (method()->is_method_handle_invoke()) { |
twisti@1572 | 154 | call->set_method_handle_invoke(true); |
twisti@1700 | 155 | kit.C->set_has_method_handle_invokes(true); |
twisti@1700 | 156 | } |
duke@435 | 157 | } |
duke@435 | 158 | kit.set_arguments_for_java_call(call); |
never@1515 | 159 | kit.set_edges_for_java_call(call, false, _separate_io_proj); |
never@1515 | 160 | Node* ret = kit.set_results_for_java_call(call, _separate_io_proj); |
duke@435 | 161 | kit.push_node(method()->return_type()->basic_type(), ret); |
never@1515 | 162 | _call_node = call; // Save the call node in case we need it later |
duke@435 | 163 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 164 | } |
duke@435 | 165 | |
twisti@1572 | 166 | //---------------------------DynamicCallGenerator----------------------------- |
twisti@1573 | 167 | // Internal class which handles all out-of-line invokedynamic calls. |
twisti@1572 | 168 | class DynamicCallGenerator : public CallGenerator { |
twisti@1572 | 169 | public: |
twisti@1572 | 170 | DynamicCallGenerator(ciMethod* method) |
twisti@1572 | 171 | : CallGenerator(method) |
twisti@1572 | 172 | { |
twisti@1572 | 173 | } |
twisti@1572 | 174 | virtual JVMState* generate(JVMState* jvms); |
twisti@1572 | 175 | }; |
twisti@1572 | 176 | |
twisti@1572 | 177 | JVMState* DynamicCallGenerator::generate(JVMState* jvms) { |
twisti@1572 | 178 | GraphKit kit(jvms); |
twisti@1572 | 179 | |
twisti@1572 | 180 | if (kit.C->log() != NULL) { |
twisti@1572 | 181 | kit.C->log()->elem("dynamic_call bci='%d'", jvms->bci()); |
twisti@1572 | 182 | } |
twisti@1572 | 183 | |
twisti@1572 | 184 | // Get the constant pool cache from the caller class. |
twisti@1572 | 185 | ciMethod* caller_method = jvms->method(); |
twisti@1572 | 186 | ciBytecodeStream str(caller_method); |
twisti@1572 | 187 | str.force_bci(jvms->bci()); // Set the stream to the invokedynamic bci. |
twisti@1572 | 188 | assert(str.cur_bc() == Bytecodes::_invokedynamic, "wrong place to issue a dynamic call!"); |
twisti@1572 | 189 | ciCPCache* cpcache = str.get_cpcache(); |
twisti@1572 | 190 | |
twisti@1572 | 191 | // Get the offset of the CallSite from the constant pool cache |
twisti@1572 | 192 | // pointer. |
twisti@1572 | 193 | int index = str.get_method_index(); |
twisti@1572 | 194 | size_t call_site_offset = cpcache->get_f1_offset(index); |
twisti@1572 | 195 | |
twisti@1572 | 196 | // Load the CallSite object from the constant pool cache. |
twisti@1572 | 197 | const TypeOopPtr* cpcache_ptr = TypeOopPtr::make_from_constant(cpcache); |
twisti@1573 | 198 | Node* cpcache_adr = kit.makecon(cpcache_ptr); |
twisti@1573 | 199 | Node* call_site_adr = kit.basic_plus_adr(cpcache_adr, cpcache_adr, call_site_offset); |
twisti@1573 | 200 | Node* call_site = kit.make_load(kit.control(), call_site_adr, TypeInstPtr::BOTTOM, T_OBJECT, Compile::AliasIdxRaw); |
twisti@1572 | 201 | |
twisti@1573 | 202 | // Load the target MethodHandle from the CallSite object. |
jrose@2639 | 203 | Node* target_mh_adr = kit.basic_plus_adr(call_site, call_site, java_lang_invoke_CallSite::target_offset_in_bytes()); |
twisti@1573 | 204 | Node* target_mh = kit.make_load(kit.control(), target_mh_adr, TypeInstPtr::BOTTOM, T_OBJECT); |
twisti@1572 | 205 | |
twisti@1573 | 206 | address resolve_stub = SharedRuntime::get_resolve_opt_virtual_call_stub(); |
twisti@1572 | 207 | |
twisti@1573 | 208 | CallStaticJavaNode *call = new (kit.C, tf()->domain()->cnt()) CallStaticJavaNode(tf(), resolve_stub, method(), kit.bci()); |
twisti@1572 | 209 | // invokedynamic is treated as an optimized invokevirtual. |
twisti@1572 | 210 | call->set_optimized_virtual(true); |
twisti@1572 | 211 | // Take extra care (in the presence of argument motion) not to trash the SP: |
twisti@1572 | 212 | call->set_method_handle_invoke(true); |
twisti@1700 | 213 | kit.C->set_has_method_handle_invokes(true); |
twisti@1572 | 214 | |
twisti@1573 | 215 | // Pass the target MethodHandle as first argument and shift the |
twisti@1573 | 216 | // other arguments. |
twisti@1573 | 217 | call->init_req(0 + TypeFunc::Parms, target_mh); |
twisti@1572 | 218 | uint nargs = call->method()->arg_size(); |
twisti@1572 | 219 | for (uint i = 1; i < nargs; i++) { |
twisti@1572 | 220 | Node* arg = kit.argument(i - 1); |
twisti@1572 | 221 | call->init_req(i + TypeFunc::Parms, arg); |
twisti@1572 | 222 | } |
twisti@1572 | 223 | |
twisti@1572 | 224 | kit.set_edges_for_java_call(call); |
twisti@1572 | 225 | Node* ret = kit.set_results_for_java_call(call); |
twisti@1572 | 226 | kit.push_node(method()->return_type()->basic_type(), ret); |
twisti@1572 | 227 | return kit.transfer_exceptions_into_jvms(); |
twisti@1572 | 228 | } |
twisti@1572 | 229 | |
twisti@1572 | 230 | //--------------------------VirtualCallGenerator------------------------------ |
twisti@1572 | 231 | // Internal class which handles all out-of-line calls checking receiver type. |
duke@435 | 232 | class VirtualCallGenerator : public CallGenerator { |
duke@435 | 233 | private: |
duke@435 | 234 | int _vtable_index; |
duke@435 | 235 | public: |
duke@435 | 236 | VirtualCallGenerator(ciMethod* method, int vtable_index) |
duke@435 | 237 | : CallGenerator(method), _vtable_index(vtable_index) |
duke@435 | 238 | { |
duke@435 | 239 | assert(vtable_index == methodOopDesc::invalid_vtable_index || |
duke@435 | 240 | vtable_index >= 0, "either invalid or usable"); |
duke@435 | 241 | } |
duke@435 | 242 | virtual bool is_virtual() const { return true; } |
duke@435 | 243 | virtual JVMState* generate(JVMState* jvms); |
duke@435 | 244 | }; |
duke@435 | 245 | |
duke@435 | 246 | JVMState* VirtualCallGenerator::generate(JVMState* jvms) { |
duke@435 | 247 | GraphKit kit(jvms); |
duke@435 | 248 | Node* receiver = kit.argument(0); |
duke@435 | 249 | |
duke@435 | 250 | if (kit.C->log() != NULL) { |
duke@435 | 251 | kit.C->log()->elem("virtual_call bci='%d'", jvms->bci()); |
duke@435 | 252 | } |
duke@435 | 253 | |
duke@435 | 254 | // If the receiver is a constant null, do not torture the system |
duke@435 | 255 | // by attempting to call through it. The compile will proceed |
duke@435 | 256 | // correctly, but may bail out in final_graph_reshaping, because |
duke@435 | 257 | // the call instruction will have a seemingly deficient out-count. |
duke@435 | 258 | // (The bailout says something misleading about an "infinite loop".) |
duke@435 | 259 | if (kit.gvn().type(receiver)->higher_equal(TypePtr::NULL_PTR)) { |
duke@435 | 260 | kit.inc_sp(method()->arg_size()); // restore arguments |
duke@435 | 261 | kit.uncommon_trap(Deoptimization::Reason_null_check, |
duke@435 | 262 | Deoptimization::Action_none, |
duke@435 | 263 | NULL, "null receiver"); |
duke@435 | 264 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 265 | } |
duke@435 | 266 | |
duke@435 | 267 | // Ideally we would unconditionally do a null check here and let it |
duke@435 | 268 | // be converted to an implicit check based on profile information. |
duke@435 | 269 | // However currently the conversion to implicit null checks in |
duke@435 | 270 | // Block::implicit_null_check() only looks for loads and stores, not calls. |
duke@435 | 271 | ciMethod *caller = kit.method(); |
duke@435 | 272 | ciMethodData *caller_md = (caller == NULL) ? NULL : caller->method_data(); |
duke@435 | 273 | if (!UseInlineCaches || !ImplicitNullChecks || |
duke@435 | 274 | ((ImplicitNullCheckThreshold > 0) && caller_md && |
duke@435 | 275 | (caller_md->trap_count(Deoptimization::Reason_null_check) |
duke@435 | 276 | >= (uint)ImplicitNullCheckThreshold))) { |
duke@435 | 277 | // Make an explicit receiver null_check as part of this call. |
duke@435 | 278 | // Since we share a map with the caller, his JVMS gets adjusted. |
duke@435 | 279 | receiver = kit.null_check_receiver(method()); |
duke@435 | 280 | if (kit.stopped()) { |
duke@435 | 281 | // And dump it back to the caller, decorated with any exceptions: |
duke@435 | 282 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 283 | } |
duke@435 | 284 | } |
duke@435 | 285 | |
duke@435 | 286 | assert(!method()->is_static(), "virtual call must not be to static"); |
duke@435 | 287 | assert(!method()->is_final(), "virtual call should not be to final"); |
duke@435 | 288 | assert(!method()->is_private(), "virtual call should not be to private"); |
duke@435 | 289 | assert(_vtable_index == methodOopDesc::invalid_vtable_index || !UseInlineCaches, |
duke@435 | 290 | "no vtable calls if +UseInlineCaches "); |
duke@435 | 291 | address target = SharedRuntime::get_resolve_virtual_call_stub(); |
duke@435 | 292 | // Normal inline cache used for call |
duke@435 | 293 | CallDynamicJavaNode *call = new (kit.C, tf()->domain()->cnt()) CallDynamicJavaNode(tf(), target, method(), _vtable_index, kit.bci()); |
duke@435 | 294 | kit.set_arguments_for_java_call(call); |
duke@435 | 295 | kit.set_edges_for_java_call(call); |
duke@435 | 296 | Node* ret = kit.set_results_for_java_call(call); |
duke@435 | 297 | kit.push_node(method()->return_type()->basic_type(), ret); |
duke@435 | 298 | |
duke@435 | 299 | // Represent the effect of an implicit receiver null_check |
duke@435 | 300 | // as part of this call. Since we share a map with the caller, |
duke@435 | 301 | // his JVMS gets adjusted. |
duke@435 | 302 | kit.cast_not_null(receiver); |
duke@435 | 303 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 304 | } |
duke@435 | 305 | |
duke@435 | 306 | bool ParseGenerator::can_parse(ciMethod* m, int entry_bci) { |
duke@435 | 307 | // Certain methods cannot be parsed at all: |
duke@435 | 308 | if (!m->can_be_compiled()) return false; |
duke@435 | 309 | if (!m->has_balanced_monitors()) return false; |
duke@435 | 310 | if (m->get_flow_analysis()->failing()) return false; |
duke@435 | 311 | |
duke@435 | 312 | // (Methods may bail out for other reasons, after the parser is run. |
duke@435 | 313 | // We try to avoid this, but if forced, we must return (Node*)NULL. |
duke@435 | 314 | // The user of the CallGenerator must check for this condition.) |
duke@435 | 315 | return true; |
duke@435 | 316 | } |
duke@435 | 317 | |
duke@435 | 318 | CallGenerator* CallGenerator::for_inline(ciMethod* m, float expected_uses) { |
duke@435 | 319 | if (!ParseGenerator::can_parse(m)) return NULL; |
duke@435 | 320 | return new ParseGenerator(m, expected_uses); |
duke@435 | 321 | } |
duke@435 | 322 | |
duke@435 | 323 | // As a special case, the JVMS passed to this CallGenerator is |
duke@435 | 324 | // for the method execution already in progress, not just the JVMS |
duke@435 | 325 | // of the caller. Thus, this CallGenerator cannot be mixed with others! |
duke@435 | 326 | CallGenerator* CallGenerator::for_osr(ciMethod* m, int osr_bci) { |
duke@435 | 327 | if (!ParseGenerator::can_parse(m, true)) return NULL; |
duke@435 | 328 | float past_uses = m->interpreter_invocation_count(); |
duke@435 | 329 | float expected_uses = past_uses; |
duke@435 | 330 | return new ParseGenerator(m, expected_uses, true); |
duke@435 | 331 | } |
duke@435 | 332 | |
never@1515 | 333 | CallGenerator* CallGenerator::for_direct_call(ciMethod* m, bool separate_io_proj) { |
duke@435 | 334 | assert(!m->is_abstract(), "for_direct_call mismatch"); |
never@1515 | 335 | return new DirectCallGenerator(m, separate_io_proj); |
duke@435 | 336 | } |
duke@435 | 337 | |
twisti@1572 | 338 | CallGenerator* CallGenerator::for_dynamic_call(ciMethod* m) { |
twisti@3094 | 339 | assert(m->is_method_handle_invoke() || m->is_method_handle_adapter(), "for_dynamic_call mismatch"); |
twisti@1572 | 340 | return new DynamicCallGenerator(m); |
twisti@1572 | 341 | } |
twisti@1572 | 342 | |
duke@435 | 343 | CallGenerator* CallGenerator::for_virtual_call(ciMethod* m, int vtable_index) { |
duke@435 | 344 | assert(!m->is_static(), "for_virtual_call mismatch"); |
twisti@1572 | 345 | assert(!m->is_method_handle_invoke(), "should be a direct call"); |
duke@435 | 346 | return new VirtualCallGenerator(m, vtable_index); |
duke@435 | 347 | } |
duke@435 | 348 | |
never@1515 | 349 | // Allow inlining decisions to be delayed |
never@1515 | 350 | class LateInlineCallGenerator : public DirectCallGenerator { |
never@1515 | 351 | CallGenerator* _inline_cg; |
never@1515 | 352 | |
never@1515 | 353 | public: |
never@1515 | 354 | LateInlineCallGenerator(ciMethod* method, CallGenerator* inline_cg) : |
never@1515 | 355 | DirectCallGenerator(method, true), _inline_cg(inline_cg) {} |
never@1515 | 356 | |
never@1515 | 357 | virtual bool is_late_inline() const { return true; } |
never@1515 | 358 | |
never@1515 | 359 | // Convert the CallStaticJava into an inline |
never@1515 | 360 | virtual void do_late_inline(); |
never@1515 | 361 | |
never@1515 | 362 | JVMState* generate(JVMState* jvms) { |
never@1515 | 363 | // Record that this call site should be revisited once the main |
never@1515 | 364 | // parse is finished. |
never@1515 | 365 | Compile::current()->add_late_inline(this); |
never@1515 | 366 | |
never@1515 | 367 | // Emit the CallStaticJava and request separate projections so |
never@1515 | 368 | // that the late inlining logic can distinguish between fall |
never@1515 | 369 | // through and exceptional uses of the memory and io projections |
never@1515 | 370 | // as is done for allocations and macro expansion. |
never@1515 | 371 | return DirectCallGenerator::generate(jvms); |
never@1515 | 372 | } |
never@1515 | 373 | |
never@1515 | 374 | }; |
never@1515 | 375 | |
never@1515 | 376 | |
never@1515 | 377 | void LateInlineCallGenerator::do_late_inline() { |
never@1515 | 378 | // Can't inline it |
never@1515 | 379 | if (call_node() == NULL || call_node()->outcnt() == 0 || |
never@1515 | 380 | call_node()->in(0) == NULL || call_node()->in(0)->is_top()) |
never@1515 | 381 | return; |
never@1515 | 382 | |
never@1515 | 383 | CallStaticJavaNode* call = call_node(); |
never@1515 | 384 | |
never@1515 | 385 | // Make a clone of the JVMState that appropriate to use for driving a parse |
never@1515 | 386 | Compile* C = Compile::current(); |
never@1515 | 387 | JVMState* jvms = call->jvms()->clone_shallow(C); |
never@1515 | 388 | uint size = call->req(); |
never@1515 | 389 | SafePointNode* map = new (C, size) SafePointNode(size, jvms); |
never@1515 | 390 | for (uint i1 = 0; i1 < size; i1++) { |
never@1515 | 391 | map->init_req(i1, call->in(i1)); |
never@1515 | 392 | } |
never@1515 | 393 | |
never@1515 | 394 | // Make sure the state is a MergeMem for parsing. |
never@1515 | 395 | if (!map->in(TypeFunc::Memory)->is_MergeMem()) { |
never@1515 | 396 | map->set_req(TypeFunc::Memory, MergeMemNode::make(C, map->in(TypeFunc::Memory))); |
never@1515 | 397 | } |
never@1515 | 398 | |
never@1515 | 399 | // Make enough space for the expression stack and transfer the incoming arguments |
never@1515 | 400 | int nargs = method()->arg_size(); |
never@1515 | 401 | jvms->set_map(map); |
never@1515 | 402 | map->ensure_stack(jvms, jvms->method()->max_stack()); |
never@1515 | 403 | if (nargs > 0) { |
never@1515 | 404 | for (int i1 = 0; i1 < nargs; i1++) { |
never@1515 | 405 | map->set_req(i1 + jvms->argoff(), call->in(TypeFunc::Parms + i1)); |
never@1515 | 406 | } |
never@1515 | 407 | } |
never@1515 | 408 | |
never@1515 | 409 | CompileLog* log = C->log(); |
never@1515 | 410 | if (log != NULL) { |
never@1515 | 411 | log->head("late_inline method='%d'", log->identify(method())); |
never@1515 | 412 | JVMState* p = jvms; |
never@1515 | 413 | while (p != NULL) { |
never@1515 | 414 | log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method())); |
never@1515 | 415 | p = p->caller(); |
never@1515 | 416 | } |
never@1515 | 417 | log->tail("late_inline"); |
never@1515 | 418 | } |
never@1515 | 419 | |
never@1515 | 420 | // Setup default node notes to be picked up by the inlining |
never@1515 | 421 | Node_Notes* old_nn = C->default_node_notes(); |
never@1515 | 422 | if (old_nn != NULL) { |
never@1515 | 423 | Node_Notes* entry_nn = old_nn->clone(C); |
never@1515 | 424 | entry_nn->set_jvms(jvms); |
never@1515 | 425 | C->set_default_node_notes(entry_nn); |
never@1515 | 426 | } |
never@1515 | 427 | |
never@1515 | 428 | // Now perform the inling using the synthesized JVMState |
never@1515 | 429 | JVMState* new_jvms = _inline_cg->generate(jvms); |
never@1515 | 430 | if (new_jvms == NULL) return; // no change |
never@1515 | 431 | if (C->failing()) return; |
never@1515 | 432 | |
never@1515 | 433 | // Capture any exceptional control flow |
never@1515 | 434 | GraphKit kit(new_jvms); |
never@1515 | 435 | |
never@1515 | 436 | // Find the result object |
never@1515 | 437 | Node* result = C->top(); |
never@1515 | 438 | int result_size = method()->return_type()->size(); |
never@1515 | 439 | if (result_size != 0 && !kit.stopped()) { |
never@1515 | 440 | result = (result_size == 1) ? kit.pop() : kit.pop_pair(); |
never@1515 | 441 | } |
never@1515 | 442 | |
never@1515 | 443 | kit.replace_call(call, result); |
never@1515 | 444 | } |
never@1515 | 445 | |
never@1515 | 446 | |
never@1515 | 447 | CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) { |
never@1515 | 448 | return new LateInlineCallGenerator(method, inline_cg); |
never@1515 | 449 | } |
never@1515 | 450 | |
duke@435 | 451 | |
duke@435 | 452 | //---------------------------WarmCallGenerator-------------------------------- |
duke@435 | 453 | // Internal class which handles initial deferral of inlining decisions. |
duke@435 | 454 | class WarmCallGenerator : public CallGenerator { |
duke@435 | 455 | WarmCallInfo* _call_info; |
duke@435 | 456 | CallGenerator* _if_cold; |
duke@435 | 457 | CallGenerator* _if_hot; |
duke@435 | 458 | bool _is_virtual; // caches virtuality of if_cold |
duke@435 | 459 | bool _is_inline; // caches inline-ness of if_hot |
duke@435 | 460 | |
duke@435 | 461 | public: |
duke@435 | 462 | WarmCallGenerator(WarmCallInfo* ci, |
duke@435 | 463 | CallGenerator* if_cold, |
duke@435 | 464 | CallGenerator* if_hot) |
duke@435 | 465 | : CallGenerator(if_cold->method()) |
duke@435 | 466 | { |
duke@435 | 467 | assert(method() == if_hot->method(), "consistent choices"); |
duke@435 | 468 | _call_info = ci; |
duke@435 | 469 | _if_cold = if_cold; |
duke@435 | 470 | _if_hot = if_hot; |
duke@435 | 471 | _is_virtual = if_cold->is_virtual(); |
duke@435 | 472 | _is_inline = if_hot->is_inline(); |
duke@435 | 473 | } |
duke@435 | 474 | |
duke@435 | 475 | virtual bool is_inline() const { return _is_inline; } |
duke@435 | 476 | virtual bool is_virtual() const { return _is_virtual; } |
duke@435 | 477 | virtual bool is_deferred() const { return true; } |
duke@435 | 478 | |
duke@435 | 479 | virtual JVMState* generate(JVMState* jvms); |
duke@435 | 480 | }; |
duke@435 | 481 | |
duke@435 | 482 | |
duke@435 | 483 | CallGenerator* CallGenerator::for_warm_call(WarmCallInfo* ci, |
duke@435 | 484 | CallGenerator* if_cold, |
duke@435 | 485 | CallGenerator* if_hot) { |
duke@435 | 486 | return new WarmCallGenerator(ci, if_cold, if_hot); |
duke@435 | 487 | } |
duke@435 | 488 | |
duke@435 | 489 | JVMState* WarmCallGenerator::generate(JVMState* jvms) { |
duke@435 | 490 | Compile* C = Compile::current(); |
duke@435 | 491 | if (C->log() != NULL) { |
duke@435 | 492 | C->log()->elem("warm_call bci='%d'", jvms->bci()); |
duke@435 | 493 | } |
duke@435 | 494 | jvms = _if_cold->generate(jvms); |
duke@435 | 495 | if (jvms != NULL) { |
duke@435 | 496 | Node* m = jvms->map()->control(); |
duke@435 | 497 | if (m->is_CatchProj()) m = m->in(0); else m = C->top(); |
duke@435 | 498 | if (m->is_Catch()) m = m->in(0); else m = C->top(); |
duke@435 | 499 | if (m->is_Proj()) m = m->in(0); else m = C->top(); |
duke@435 | 500 | if (m->is_CallJava()) { |
duke@435 | 501 | _call_info->set_call(m->as_Call()); |
duke@435 | 502 | _call_info->set_hot_cg(_if_hot); |
duke@435 | 503 | #ifndef PRODUCT |
duke@435 | 504 | if (PrintOpto || PrintOptoInlining) { |
duke@435 | 505 | tty->print_cr("Queueing for warm inlining at bci %d:", jvms->bci()); |
duke@435 | 506 | tty->print("WCI: "); |
duke@435 | 507 | _call_info->print(); |
duke@435 | 508 | } |
duke@435 | 509 | #endif |
duke@435 | 510 | _call_info->set_heat(_call_info->compute_heat()); |
duke@435 | 511 | C->set_warm_calls(_call_info->insert_into(C->warm_calls())); |
duke@435 | 512 | } |
duke@435 | 513 | } |
duke@435 | 514 | return jvms; |
duke@435 | 515 | } |
duke@435 | 516 | |
duke@435 | 517 | void WarmCallInfo::make_hot() { |
never@1515 | 518 | Unimplemented(); |
duke@435 | 519 | } |
duke@435 | 520 | |
duke@435 | 521 | void WarmCallInfo::make_cold() { |
duke@435 | 522 | // No action: Just dequeue. |
duke@435 | 523 | } |
duke@435 | 524 | |
duke@435 | 525 | |
duke@435 | 526 | //------------------------PredictedCallGenerator------------------------------ |
duke@435 | 527 | // Internal class which handles all out-of-line calls checking receiver type. |
duke@435 | 528 | class PredictedCallGenerator : public CallGenerator { |
duke@435 | 529 | ciKlass* _predicted_receiver; |
duke@435 | 530 | CallGenerator* _if_missed; |
duke@435 | 531 | CallGenerator* _if_hit; |
duke@435 | 532 | float _hit_prob; |
duke@435 | 533 | |
duke@435 | 534 | public: |
duke@435 | 535 | PredictedCallGenerator(ciKlass* predicted_receiver, |
duke@435 | 536 | CallGenerator* if_missed, |
duke@435 | 537 | CallGenerator* if_hit, float hit_prob) |
duke@435 | 538 | : CallGenerator(if_missed->method()) |
duke@435 | 539 | { |
duke@435 | 540 | // The call profile data may predict the hit_prob as extreme as 0 or 1. |
duke@435 | 541 | // Remove the extremes values from the range. |
duke@435 | 542 | if (hit_prob > PROB_MAX) hit_prob = PROB_MAX; |
duke@435 | 543 | if (hit_prob < PROB_MIN) hit_prob = PROB_MIN; |
duke@435 | 544 | |
duke@435 | 545 | _predicted_receiver = predicted_receiver; |
duke@435 | 546 | _if_missed = if_missed; |
duke@435 | 547 | _if_hit = if_hit; |
duke@435 | 548 | _hit_prob = hit_prob; |
duke@435 | 549 | } |
duke@435 | 550 | |
duke@435 | 551 | virtual bool is_virtual() const { return true; } |
duke@435 | 552 | virtual bool is_inline() const { return _if_hit->is_inline(); } |
duke@435 | 553 | virtual bool is_deferred() const { return _if_hit->is_deferred(); } |
duke@435 | 554 | |
duke@435 | 555 | virtual JVMState* generate(JVMState* jvms); |
duke@435 | 556 | }; |
duke@435 | 557 | |
duke@435 | 558 | |
duke@435 | 559 | CallGenerator* CallGenerator::for_predicted_call(ciKlass* predicted_receiver, |
duke@435 | 560 | CallGenerator* if_missed, |
duke@435 | 561 | CallGenerator* if_hit, |
duke@435 | 562 | float hit_prob) { |
duke@435 | 563 | return new PredictedCallGenerator(predicted_receiver, if_missed, if_hit, hit_prob); |
duke@435 | 564 | } |
duke@435 | 565 | |
duke@435 | 566 | |
duke@435 | 567 | JVMState* PredictedCallGenerator::generate(JVMState* jvms) { |
duke@435 | 568 | GraphKit kit(jvms); |
duke@435 | 569 | PhaseGVN& gvn = kit.gvn(); |
duke@435 | 570 | // We need an explicit receiver null_check before checking its type. |
duke@435 | 571 | // We share a map with the caller, so his JVMS gets adjusted. |
duke@435 | 572 | Node* receiver = kit.argument(0); |
duke@435 | 573 | |
duke@435 | 574 | CompileLog* log = kit.C->log(); |
duke@435 | 575 | if (log != NULL) { |
duke@435 | 576 | log->elem("predicted_call bci='%d' klass='%d'", |
duke@435 | 577 | jvms->bci(), log->identify(_predicted_receiver)); |
duke@435 | 578 | } |
duke@435 | 579 | |
duke@435 | 580 | receiver = kit.null_check_receiver(method()); |
duke@435 | 581 | if (kit.stopped()) { |
duke@435 | 582 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 583 | } |
duke@435 | 584 | |
duke@435 | 585 | Node* exact_receiver = receiver; // will get updated in place... |
duke@435 | 586 | Node* slow_ctl = kit.type_check_receiver(receiver, |
duke@435 | 587 | _predicted_receiver, _hit_prob, |
duke@435 | 588 | &exact_receiver); |
duke@435 | 589 | |
duke@435 | 590 | SafePointNode* slow_map = NULL; |
duke@435 | 591 | JVMState* slow_jvms; |
duke@435 | 592 | { PreserveJVMState pjvms(&kit); |
duke@435 | 593 | kit.set_control(slow_ctl); |
duke@435 | 594 | if (!kit.stopped()) { |
duke@435 | 595 | slow_jvms = _if_missed->generate(kit.sync_jvms()); |
duke@435 | 596 | assert(slow_jvms != NULL, "miss path must not fail to generate"); |
duke@435 | 597 | kit.add_exception_states_from(slow_jvms); |
duke@435 | 598 | kit.set_map(slow_jvms->map()); |
duke@435 | 599 | if (!kit.stopped()) |
duke@435 | 600 | slow_map = kit.stop(); |
duke@435 | 601 | } |
duke@435 | 602 | } |
duke@435 | 603 | |
kvn@728 | 604 | if (kit.stopped()) { |
kvn@728 | 605 | // Instance exactly does not matches the desired type. |
kvn@728 | 606 | kit.set_jvms(slow_jvms); |
kvn@728 | 607 | return kit.transfer_exceptions_into_jvms(); |
kvn@728 | 608 | } |
kvn@728 | 609 | |
duke@435 | 610 | // fall through if the instance exactly matches the desired type |
duke@435 | 611 | kit.replace_in_map(receiver, exact_receiver); |
duke@435 | 612 | |
duke@435 | 613 | // Make the hot call: |
duke@435 | 614 | JVMState* new_jvms = _if_hit->generate(kit.sync_jvms()); |
duke@435 | 615 | if (new_jvms == NULL) { |
duke@435 | 616 | // Inline failed, so make a direct call. |
duke@435 | 617 | assert(_if_hit->is_inline(), "must have been a failed inline"); |
duke@435 | 618 | CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method()); |
duke@435 | 619 | new_jvms = cg->generate(kit.sync_jvms()); |
duke@435 | 620 | } |
duke@435 | 621 | kit.add_exception_states_from(new_jvms); |
duke@435 | 622 | kit.set_jvms(new_jvms); |
duke@435 | 623 | |
duke@435 | 624 | // Need to merge slow and fast? |
duke@435 | 625 | if (slow_map == NULL) { |
duke@435 | 626 | // The fast path is the only path remaining. |
duke@435 | 627 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 628 | } |
duke@435 | 629 | |
duke@435 | 630 | if (kit.stopped()) { |
duke@435 | 631 | // Inlined method threw an exception, so it's just the slow path after all. |
duke@435 | 632 | kit.set_jvms(slow_jvms); |
duke@435 | 633 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 634 | } |
duke@435 | 635 | |
duke@435 | 636 | // Finish the diamond. |
duke@435 | 637 | kit.C->set_has_split_ifs(true); // Has chance for split-if optimization |
duke@435 | 638 | RegionNode* region = new (kit.C, 3) RegionNode(3); |
duke@435 | 639 | region->init_req(1, kit.control()); |
duke@435 | 640 | region->init_req(2, slow_map->control()); |
duke@435 | 641 | kit.set_control(gvn.transform(region)); |
duke@435 | 642 | Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO); |
duke@435 | 643 | iophi->set_req(2, slow_map->i_o()); |
duke@435 | 644 | kit.set_i_o(gvn.transform(iophi)); |
duke@435 | 645 | kit.merge_memory(slow_map->merged_memory(), region, 2); |
duke@435 | 646 | uint tos = kit.jvms()->stkoff() + kit.sp(); |
duke@435 | 647 | uint limit = slow_map->req(); |
duke@435 | 648 | for (uint i = TypeFunc::Parms; i < limit; i++) { |
duke@435 | 649 | // Skip unused stack slots; fast forward to monoff(); |
duke@435 | 650 | if (i == tos) { |
duke@435 | 651 | i = kit.jvms()->monoff(); |
duke@435 | 652 | if( i >= limit ) break; |
duke@435 | 653 | } |
duke@435 | 654 | Node* m = kit.map()->in(i); |
duke@435 | 655 | Node* n = slow_map->in(i); |
duke@435 | 656 | if (m != n) { |
duke@435 | 657 | const Type* t = gvn.type(m)->meet(gvn.type(n)); |
duke@435 | 658 | Node* phi = PhiNode::make(region, m, t); |
duke@435 | 659 | phi->set_req(2, n); |
duke@435 | 660 | kit.map()->set_req(i, gvn.transform(phi)); |
duke@435 | 661 | } |
duke@435 | 662 | } |
duke@435 | 663 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 664 | } |
duke@435 | 665 | |
duke@435 | 666 | |
twisti@1573 | 667 | //------------------------PredictedDynamicCallGenerator----------------------- |
twisti@1573 | 668 | // Internal class which handles all out-of-line calls checking receiver type. |
twisti@1573 | 669 | class PredictedDynamicCallGenerator : public CallGenerator { |
twisti@1573 | 670 | ciMethodHandle* _predicted_method_handle; |
twisti@1573 | 671 | CallGenerator* _if_missed; |
twisti@1573 | 672 | CallGenerator* _if_hit; |
twisti@1573 | 673 | float _hit_prob; |
twisti@1573 | 674 | |
twisti@1573 | 675 | public: |
twisti@1573 | 676 | PredictedDynamicCallGenerator(ciMethodHandle* predicted_method_handle, |
twisti@1573 | 677 | CallGenerator* if_missed, |
twisti@1573 | 678 | CallGenerator* if_hit, |
twisti@1573 | 679 | float hit_prob) |
twisti@1573 | 680 | : CallGenerator(if_missed->method()), |
twisti@1573 | 681 | _predicted_method_handle(predicted_method_handle), |
twisti@1573 | 682 | _if_missed(if_missed), |
twisti@1573 | 683 | _if_hit(if_hit), |
twisti@1573 | 684 | _hit_prob(hit_prob) |
twisti@1573 | 685 | {} |
twisti@1573 | 686 | |
twisti@1573 | 687 | virtual bool is_inline() const { return _if_hit->is_inline(); } |
twisti@1573 | 688 | virtual bool is_deferred() const { return _if_hit->is_deferred(); } |
twisti@1573 | 689 | |
twisti@1573 | 690 | virtual JVMState* generate(JVMState* jvms); |
twisti@1573 | 691 | }; |
twisti@1573 | 692 | |
twisti@1573 | 693 | |
twisti@1573 | 694 | CallGenerator* CallGenerator::for_predicted_dynamic_call(ciMethodHandle* predicted_method_handle, |
twisti@1573 | 695 | CallGenerator* if_missed, |
twisti@1573 | 696 | CallGenerator* if_hit, |
twisti@1573 | 697 | float hit_prob) { |
twisti@1573 | 698 | return new PredictedDynamicCallGenerator(predicted_method_handle, if_missed, if_hit, hit_prob); |
twisti@1573 | 699 | } |
twisti@1573 | 700 | |
twisti@1573 | 701 | |
never@2949 | 702 | CallGenerator* CallGenerator::for_method_handle_inline(Node* method_handle, JVMState* jvms, |
never@2949 | 703 | ciMethod* caller, ciMethod* callee, ciCallProfile profile) { |
never@2949 | 704 | if (method_handle->Opcode() == Op_ConP) { |
never@2949 | 705 | const TypeOopPtr* oop_ptr = method_handle->bottom_type()->is_oopptr(); |
never@2949 | 706 | ciObject* const_oop = oop_ptr->const_oop(); |
never@2949 | 707 | ciMethodHandle* method_handle = const_oop->as_method_handle(); |
never@2949 | 708 | |
never@2949 | 709 | // Set the callee to have access to the class and signature in |
never@2949 | 710 | // the MethodHandleCompiler. |
never@2949 | 711 | method_handle->set_callee(callee); |
never@2949 | 712 | method_handle->set_caller(caller); |
never@2949 | 713 | method_handle->set_call_profile(profile); |
never@2949 | 714 | |
never@2949 | 715 | // Get an adapter for the MethodHandle. |
never@2949 | 716 | ciMethod* target_method = method_handle->get_method_handle_adapter(); |
never@2949 | 717 | if (target_method != NULL) { |
twisti@3094 | 718 | CallGenerator* cg = Compile::current()->call_generator(target_method, -1, false, jvms, true, PROB_ALWAYS); |
twisti@3094 | 719 | if (cg != NULL && cg->is_inline()) |
twisti@3094 | 720 | return cg; |
never@2949 | 721 | } |
never@2949 | 722 | } else if (method_handle->Opcode() == Op_Phi && method_handle->req() == 3 && |
never@2949 | 723 | method_handle->in(1)->Opcode() == Op_ConP && method_handle->in(2)->Opcode() == Op_ConP) { |
never@2949 | 724 | // selectAlternative idiom merging two constant MethodHandles. |
never@2949 | 725 | // Generate a guard so that each can be inlined. We might want to |
never@2949 | 726 | // do more inputs at later point but this gets the most common |
never@2949 | 727 | // case. |
never@2949 | 728 | const TypeOopPtr* oop_ptr = method_handle->in(1)->bottom_type()->is_oopptr(); |
never@2949 | 729 | ciObject* const_oop = oop_ptr->const_oop(); |
never@2949 | 730 | ciMethodHandle* mh = const_oop->as_method_handle(); |
never@2949 | 731 | |
never@2949 | 732 | CallGenerator* cg1 = for_method_handle_inline(method_handle->in(1), jvms, caller, callee, profile); |
never@2949 | 733 | CallGenerator* cg2 = for_method_handle_inline(method_handle->in(2), jvms, caller, callee, profile); |
never@2949 | 734 | if (cg1 != NULL && cg2 != NULL) { |
never@2949 | 735 | return new PredictedDynamicCallGenerator(mh, cg2, cg1, PROB_FAIR); |
never@2949 | 736 | } |
never@2949 | 737 | } |
never@2949 | 738 | return NULL; |
never@2949 | 739 | } |
never@2949 | 740 | |
never@2949 | 741 | |
twisti@3050 | 742 | CallGenerator* CallGenerator::for_invokedynamic_inline(ciCallSite* call_site, JVMState* jvms, |
twisti@3050 | 743 | ciMethod* caller, ciMethod* callee, ciCallProfile profile) { |
twisti@3050 | 744 | assert(call_site->is_constant_call_site() || call_site->is_mutable_call_site(), "must be"); |
twisti@3050 | 745 | ciMethodHandle* method_handle = call_site->get_target(); |
twisti@3050 | 746 | |
twisti@3050 | 747 | // Set the callee to have access to the class and signature in the |
twisti@3050 | 748 | // MethodHandleCompiler. |
twisti@3050 | 749 | method_handle->set_callee(callee); |
twisti@3050 | 750 | method_handle->set_caller(caller); |
twisti@3050 | 751 | method_handle->set_call_profile(profile); |
twisti@3050 | 752 | |
twisti@3050 | 753 | // Get an adapter for the MethodHandle. |
twisti@3050 | 754 | ciMethod* target_method = method_handle->get_invokedynamic_adapter(); |
twisti@3050 | 755 | if (target_method != NULL) { |
twisti@3050 | 756 | Compile *C = Compile::current(); |
twisti@3094 | 757 | CallGenerator* cg = C->call_generator(target_method, -1, false, jvms, true, PROB_ALWAYS); |
twisti@3094 | 758 | if (cg != NULL && cg->is_inline()) { |
twisti@3050 | 759 | // Add a dependence for invalidation of the optimization. |
twisti@3050 | 760 | if (call_site->is_mutable_call_site()) { |
twisti@3094 | 761 | C->dependencies()->assert_call_site_target_value(call_site, method_handle); |
twisti@3050 | 762 | } |
twisti@3094 | 763 | return cg; |
twisti@3050 | 764 | } |
twisti@3050 | 765 | } |
twisti@3050 | 766 | return NULL; |
twisti@3050 | 767 | } |
twisti@3050 | 768 | |
twisti@3050 | 769 | |
twisti@1573 | 770 | JVMState* PredictedDynamicCallGenerator::generate(JVMState* jvms) { |
twisti@1573 | 771 | GraphKit kit(jvms); |
twisti@1573 | 772 | PhaseGVN& gvn = kit.gvn(); |
twisti@1573 | 773 | |
twisti@1573 | 774 | CompileLog* log = kit.C->log(); |
twisti@1573 | 775 | if (log != NULL) { |
twisti@1573 | 776 | log->elem("predicted_dynamic_call bci='%d'", jvms->bci()); |
twisti@1573 | 777 | } |
twisti@1573 | 778 | |
twisti@1573 | 779 | const TypeOopPtr* predicted_mh_ptr = TypeOopPtr::make_from_constant(_predicted_method_handle, true); |
twisti@1573 | 780 | Node* predicted_mh = kit.makecon(predicted_mh_ptr); |
twisti@1573 | 781 | |
never@2949 | 782 | Node* bol = NULL; |
never@2949 | 783 | int bc = jvms->method()->java_code_at_bci(jvms->bci()); |
never@2949 | 784 | if (bc == Bytecodes::_invokespecial) { |
never@2949 | 785 | // This is the selectAlternative idiom for guardWithTest |
never@2949 | 786 | Node* receiver = kit.argument(0); |
never@2949 | 787 | |
never@2949 | 788 | // Check if the MethodHandle is the expected one |
never@2949 | 789 | Node* cmp = gvn.transform(new(kit.C, 3) CmpPNode(receiver, predicted_mh)); |
never@2949 | 790 | bol = gvn.transform(new(kit.C, 2) BoolNode(cmp, BoolTest::eq) ); |
never@2949 | 791 | } else { |
never@2949 | 792 | assert(bc == Bytecodes::_invokedynamic, "must be"); |
never@2949 | 793 | // Get the constant pool cache from the caller class. |
never@2949 | 794 | ciMethod* caller_method = jvms->method(); |
never@2949 | 795 | ciBytecodeStream str(caller_method); |
never@2949 | 796 | str.force_bci(jvms->bci()); // Set the stream to the invokedynamic bci. |
never@2949 | 797 | ciCPCache* cpcache = str.get_cpcache(); |
never@2949 | 798 | |
never@2949 | 799 | // Get the offset of the CallSite from the constant pool cache |
never@2949 | 800 | // pointer. |
never@2949 | 801 | int index = str.get_method_index(); |
never@2949 | 802 | size_t call_site_offset = cpcache->get_f1_offset(index); |
never@2949 | 803 | |
never@2949 | 804 | // Load the CallSite object from the constant pool cache. |
never@2949 | 805 | const TypeOopPtr* cpcache_ptr = TypeOopPtr::make_from_constant(cpcache); |
never@2949 | 806 | Node* cpcache_adr = kit.makecon(cpcache_ptr); |
never@2949 | 807 | Node* call_site_adr = kit.basic_plus_adr(cpcache_adr, cpcache_adr, call_site_offset); |
never@2949 | 808 | Node* call_site = kit.make_load(kit.control(), call_site_adr, TypeInstPtr::BOTTOM, T_OBJECT, Compile::AliasIdxRaw); |
never@2949 | 809 | |
never@2949 | 810 | // Load the target MethodHandle from the CallSite object. |
never@2949 | 811 | Node* target_adr = kit.basic_plus_adr(call_site, call_site, java_lang_invoke_CallSite::target_offset_in_bytes()); |
never@2949 | 812 | Node* target_mh = kit.make_load(kit.control(), target_adr, TypeInstPtr::BOTTOM, T_OBJECT); |
never@2949 | 813 | |
never@2949 | 814 | // Check if the MethodHandle is still the same. |
never@2949 | 815 | Node* cmp = gvn.transform(new(kit.C, 3) CmpPNode(target_mh, predicted_mh)); |
never@2949 | 816 | bol = gvn.transform(new(kit.C, 2) BoolNode(cmp, BoolTest::eq) ); |
never@2949 | 817 | } |
twisti@1573 | 818 | IfNode* iff = kit.create_and_xform_if(kit.control(), bol, _hit_prob, COUNT_UNKNOWN); |
twisti@1573 | 819 | kit.set_control( gvn.transform(new(kit.C, 1) IfTrueNode (iff))); |
twisti@1573 | 820 | Node* slow_ctl = gvn.transform(new(kit.C, 1) IfFalseNode(iff)); |
twisti@1573 | 821 | |
twisti@1573 | 822 | SafePointNode* slow_map = NULL; |
twisti@1573 | 823 | JVMState* slow_jvms; |
twisti@1573 | 824 | { PreserveJVMState pjvms(&kit); |
twisti@1573 | 825 | kit.set_control(slow_ctl); |
twisti@1573 | 826 | if (!kit.stopped()) { |
twisti@1573 | 827 | slow_jvms = _if_missed->generate(kit.sync_jvms()); |
twisti@1573 | 828 | assert(slow_jvms != NULL, "miss path must not fail to generate"); |
twisti@1573 | 829 | kit.add_exception_states_from(slow_jvms); |
twisti@1573 | 830 | kit.set_map(slow_jvms->map()); |
twisti@1573 | 831 | if (!kit.stopped()) |
twisti@1573 | 832 | slow_map = kit.stop(); |
twisti@1573 | 833 | } |
twisti@1573 | 834 | } |
twisti@1573 | 835 | |
twisti@1573 | 836 | if (kit.stopped()) { |
twisti@1573 | 837 | // Instance exactly does not matches the desired type. |
twisti@1573 | 838 | kit.set_jvms(slow_jvms); |
twisti@1573 | 839 | return kit.transfer_exceptions_into_jvms(); |
twisti@1573 | 840 | } |
twisti@1573 | 841 | |
twisti@1573 | 842 | // Make the hot call: |
twisti@1573 | 843 | JVMState* new_jvms = _if_hit->generate(kit.sync_jvms()); |
twisti@1573 | 844 | if (new_jvms == NULL) { |
twisti@1573 | 845 | // Inline failed, so make a direct call. |
twisti@1573 | 846 | assert(_if_hit->is_inline(), "must have been a failed inline"); |
twisti@1573 | 847 | CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method()); |
twisti@1573 | 848 | new_jvms = cg->generate(kit.sync_jvms()); |
twisti@1573 | 849 | } |
twisti@1573 | 850 | kit.add_exception_states_from(new_jvms); |
twisti@1573 | 851 | kit.set_jvms(new_jvms); |
twisti@1573 | 852 | |
twisti@1573 | 853 | // Need to merge slow and fast? |
twisti@1573 | 854 | if (slow_map == NULL) { |
twisti@1573 | 855 | // The fast path is the only path remaining. |
twisti@1573 | 856 | return kit.transfer_exceptions_into_jvms(); |
twisti@1573 | 857 | } |
twisti@1573 | 858 | |
twisti@1573 | 859 | if (kit.stopped()) { |
twisti@1573 | 860 | // Inlined method threw an exception, so it's just the slow path after all. |
twisti@1573 | 861 | kit.set_jvms(slow_jvms); |
twisti@1573 | 862 | return kit.transfer_exceptions_into_jvms(); |
twisti@1573 | 863 | } |
twisti@1573 | 864 | |
twisti@1573 | 865 | // Finish the diamond. |
twisti@1573 | 866 | kit.C->set_has_split_ifs(true); // Has chance for split-if optimization |
twisti@1573 | 867 | RegionNode* region = new (kit.C, 3) RegionNode(3); |
twisti@1573 | 868 | region->init_req(1, kit.control()); |
twisti@1573 | 869 | region->init_req(2, slow_map->control()); |
twisti@1573 | 870 | kit.set_control(gvn.transform(region)); |
twisti@1573 | 871 | Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO); |
twisti@1573 | 872 | iophi->set_req(2, slow_map->i_o()); |
twisti@1573 | 873 | kit.set_i_o(gvn.transform(iophi)); |
twisti@1573 | 874 | kit.merge_memory(slow_map->merged_memory(), region, 2); |
twisti@1573 | 875 | uint tos = kit.jvms()->stkoff() + kit.sp(); |
twisti@1573 | 876 | uint limit = slow_map->req(); |
twisti@1573 | 877 | for (uint i = TypeFunc::Parms; i < limit; i++) { |
twisti@1573 | 878 | // Skip unused stack slots; fast forward to monoff(); |
twisti@1573 | 879 | if (i == tos) { |
twisti@1573 | 880 | i = kit.jvms()->monoff(); |
twisti@1573 | 881 | if( i >= limit ) break; |
twisti@1573 | 882 | } |
twisti@1573 | 883 | Node* m = kit.map()->in(i); |
twisti@1573 | 884 | Node* n = slow_map->in(i); |
twisti@1573 | 885 | if (m != n) { |
twisti@1573 | 886 | const Type* t = gvn.type(m)->meet(gvn.type(n)); |
twisti@1573 | 887 | Node* phi = PhiNode::make(region, m, t); |
twisti@1573 | 888 | phi->set_req(2, n); |
twisti@1573 | 889 | kit.map()->set_req(i, gvn.transform(phi)); |
twisti@1573 | 890 | } |
twisti@1573 | 891 | } |
twisti@1573 | 892 | return kit.transfer_exceptions_into_jvms(); |
twisti@1573 | 893 | } |
twisti@1573 | 894 | |
twisti@1573 | 895 | |
duke@435 | 896 | //-------------------------UncommonTrapCallGenerator----------------------------- |
duke@435 | 897 | // Internal class which handles all out-of-line calls checking receiver type. |
duke@435 | 898 | class UncommonTrapCallGenerator : public CallGenerator { |
duke@435 | 899 | Deoptimization::DeoptReason _reason; |
duke@435 | 900 | Deoptimization::DeoptAction _action; |
duke@435 | 901 | |
duke@435 | 902 | public: |
duke@435 | 903 | UncommonTrapCallGenerator(ciMethod* m, |
duke@435 | 904 | Deoptimization::DeoptReason reason, |
duke@435 | 905 | Deoptimization::DeoptAction action) |
duke@435 | 906 | : CallGenerator(m) |
duke@435 | 907 | { |
duke@435 | 908 | _reason = reason; |
duke@435 | 909 | _action = action; |
duke@435 | 910 | } |
duke@435 | 911 | |
duke@435 | 912 | virtual bool is_virtual() const { ShouldNotReachHere(); return false; } |
duke@435 | 913 | virtual bool is_trap() const { return true; } |
duke@435 | 914 | |
duke@435 | 915 | virtual JVMState* generate(JVMState* jvms); |
duke@435 | 916 | }; |
duke@435 | 917 | |
duke@435 | 918 | |
duke@435 | 919 | CallGenerator* |
duke@435 | 920 | CallGenerator::for_uncommon_trap(ciMethod* m, |
duke@435 | 921 | Deoptimization::DeoptReason reason, |
duke@435 | 922 | Deoptimization::DeoptAction action) { |
duke@435 | 923 | return new UncommonTrapCallGenerator(m, reason, action); |
duke@435 | 924 | } |
duke@435 | 925 | |
duke@435 | 926 | |
duke@435 | 927 | JVMState* UncommonTrapCallGenerator::generate(JVMState* jvms) { |
duke@435 | 928 | GraphKit kit(jvms); |
duke@435 | 929 | // Take the trap with arguments pushed on the stack. (Cf. null_check_receiver). |
duke@435 | 930 | int nargs = method()->arg_size(); |
duke@435 | 931 | kit.inc_sp(nargs); |
duke@435 | 932 | assert(nargs <= kit.sp() && kit.sp() <= jvms->stk_size(), "sane sp w/ args pushed"); |
duke@435 | 933 | if (_reason == Deoptimization::Reason_class_check && |
duke@435 | 934 | _action == Deoptimization::Action_maybe_recompile) { |
duke@435 | 935 | // Temp fix for 6529811 |
duke@435 | 936 | // Don't allow uncommon_trap to override our decision to recompile in the event |
duke@435 | 937 | // of a class cast failure for a monomorphic call as it will never let us convert |
duke@435 | 938 | // the call to either bi-morphic or megamorphic and can lead to unc-trap loops |
duke@435 | 939 | bool keep_exact_action = true; |
duke@435 | 940 | kit.uncommon_trap(_reason, _action, NULL, "monomorphic vcall checkcast", false, keep_exact_action); |
duke@435 | 941 | } else { |
duke@435 | 942 | kit.uncommon_trap(_reason, _action); |
duke@435 | 943 | } |
duke@435 | 944 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 945 | } |
duke@435 | 946 | |
duke@435 | 947 | // (Note: Moved hook_up_call to GraphKit::set_edges_for_java_call.) |
duke@435 | 948 | |
duke@435 | 949 | // (Node: Merged hook_up_exits into ParseGenerator::generate.) |
duke@435 | 950 | |
duke@435 | 951 | #define NODES_OVERHEAD_PER_METHOD (30.0) |
duke@435 | 952 | #define NODES_PER_BYTECODE (9.5) |
duke@435 | 953 | |
duke@435 | 954 | void WarmCallInfo::init(JVMState* call_site, ciMethod* call_method, ciCallProfile& profile, float prof_factor) { |
duke@435 | 955 | int call_count = profile.count(); |
duke@435 | 956 | int code_size = call_method->code_size(); |
duke@435 | 957 | |
duke@435 | 958 | // Expected execution count is based on the historical count: |
duke@435 | 959 | _count = call_count < 0 ? 1 : call_site->method()->scale_count(call_count, prof_factor); |
duke@435 | 960 | |
duke@435 | 961 | // Expected profit from inlining, in units of simple call-overheads. |
duke@435 | 962 | _profit = 1.0; |
duke@435 | 963 | |
duke@435 | 964 | // Expected work performed by the call in units of call-overheads. |
duke@435 | 965 | // %%% need an empirical curve fit for "work" (time in call) |
duke@435 | 966 | float bytecodes_per_call = 3; |
duke@435 | 967 | _work = 1.0 + code_size / bytecodes_per_call; |
duke@435 | 968 | |
duke@435 | 969 | // Expected size of compilation graph: |
duke@435 | 970 | // -XX:+PrintParseStatistics once reported: |
duke@435 | 971 | // Methods seen: 9184 Methods parsed: 9184 Nodes created: 1582391 |
duke@435 | 972 | // Histogram of 144298 parsed bytecodes: |
duke@435 | 973 | // %%% Need an better predictor for graph size. |
duke@435 | 974 | _size = NODES_OVERHEAD_PER_METHOD + (NODES_PER_BYTECODE * code_size); |
duke@435 | 975 | } |
duke@435 | 976 | |
duke@435 | 977 | // is_cold: Return true if the node should never be inlined. |
duke@435 | 978 | // This is true if any of the key metrics are extreme. |
duke@435 | 979 | bool WarmCallInfo::is_cold() const { |
duke@435 | 980 | if (count() < WarmCallMinCount) return true; |
duke@435 | 981 | if (profit() < WarmCallMinProfit) return true; |
duke@435 | 982 | if (work() > WarmCallMaxWork) return true; |
duke@435 | 983 | if (size() > WarmCallMaxSize) return true; |
duke@435 | 984 | return false; |
duke@435 | 985 | } |
duke@435 | 986 | |
duke@435 | 987 | // is_hot: Return true if the node should be inlined immediately. |
duke@435 | 988 | // This is true if any of the key metrics are extreme. |
duke@435 | 989 | bool WarmCallInfo::is_hot() const { |
duke@435 | 990 | assert(!is_cold(), "eliminate is_cold cases before testing is_hot"); |
duke@435 | 991 | if (count() >= HotCallCountThreshold) return true; |
duke@435 | 992 | if (profit() >= HotCallProfitThreshold) return true; |
duke@435 | 993 | if (work() <= HotCallTrivialWork) return true; |
duke@435 | 994 | if (size() <= HotCallTrivialSize) return true; |
duke@435 | 995 | return false; |
duke@435 | 996 | } |
duke@435 | 997 | |
duke@435 | 998 | // compute_heat: |
duke@435 | 999 | float WarmCallInfo::compute_heat() const { |
duke@435 | 1000 | assert(!is_cold(), "compute heat only on warm nodes"); |
duke@435 | 1001 | assert(!is_hot(), "compute heat only on warm nodes"); |
duke@435 | 1002 | int min_size = MAX2(0, (int)HotCallTrivialSize); |
duke@435 | 1003 | int max_size = MIN2(500, (int)WarmCallMaxSize); |
duke@435 | 1004 | float method_size = (size() - min_size) / MAX2(1, max_size - min_size); |
duke@435 | 1005 | float size_factor; |
duke@435 | 1006 | if (method_size < 0.05) size_factor = 4; // 2 sigmas better than avg. |
duke@435 | 1007 | else if (method_size < 0.15) size_factor = 2; // 1 sigma better than avg. |
duke@435 | 1008 | else if (method_size < 0.5) size_factor = 1; // better than avg. |
duke@435 | 1009 | else size_factor = 0.5; // worse than avg. |
duke@435 | 1010 | return (count() * profit() * size_factor); |
duke@435 | 1011 | } |
duke@435 | 1012 | |
duke@435 | 1013 | bool WarmCallInfo::warmer_than(WarmCallInfo* that) { |
duke@435 | 1014 | assert(this != that, "compare only different WCIs"); |
duke@435 | 1015 | assert(this->heat() != 0 && that->heat() != 0, "call compute_heat 1st"); |
duke@435 | 1016 | if (this->heat() > that->heat()) return true; |
duke@435 | 1017 | if (this->heat() < that->heat()) return false; |
duke@435 | 1018 | assert(this->heat() == that->heat(), "no NaN heat allowed"); |
duke@435 | 1019 | // Equal heat. Break the tie some other way. |
duke@435 | 1020 | if (!this->call() || !that->call()) return (address)this > (address)that; |
duke@435 | 1021 | return this->call()->_idx > that->call()->_idx; |
duke@435 | 1022 | } |
duke@435 | 1023 | |
duke@435 | 1024 | //#define UNINIT_NEXT ((WarmCallInfo*)badAddress) |
duke@435 | 1025 | #define UNINIT_NEXT ((WarmCallInfo*)NULL) |
duke@435 | 1026 | |
duke@435 | 1027 | WarmCallInfo* WarmCallInfo::insert_into(WarmCallInfo* head) { |
duke@435 | 1028 | assert(next() == UNINIT_NEXT, "not yet on any list"); |
duke@435 | 1029 | WarmCallInfo* prev_p = NULL; |
duke@435 | 1030 | WarmCallInfo* next_p = head; |
duke@435 | 1031 | while (next_p != NULL && next_p->warmer_than(this)) { |
duke@435 | 1032 | prev_p = next_p; |
duke@435 | 1033 | next_p = prev_p->next(); |
duke@435 | 1034 | } |
duke@435 | 1035 | // Install this between prev_p and next_p. |
duke@435 | 1036 | this->set_next(next_p); |
duke@435 | 1037 | if (prev_p == NULL) |
duke@435 | 1038 | head = this; |
duke@435 | 1039 | else |
duke@435 | 1040 | prev_p->set_next(this); |
duke@435 | 1041 | return head; |
duke@435 | 1042 | } |
duke@435 | 1043 | |
duke@435 | 1044 | WarmCallInfo* WarmCallInfo::remove_from(WarmCallInfo* head) { |
duke@435 | 1045 | WarmCallInfo* prev_p = NULL; |
duke@435 | 1046 | WarmCallInfo* next_p = head; |
duke@435 | 1047 | while (next_p != this) { |
duke@435 | 1048 | assert(next_p != NULL, "this must be in the list somewhere"); |
duke@435 | 1049 | prev_p = next_p; |
duke@435 | 1050 | next_p = prev_p->next(); |
duke@435 | 1051 | } |
duke@435 | 1052 | next_p = this->next(); |
duke@435 | 1053 | debug_only(this->set_next(UNINIT_NEXT)); |
duke@435 | 1054 | // Remove this from between prev_p and next_p. |
duke@435 | 1055 | if (prev_p == NULL) |
duke@435 | 1056 | head = next_p; |
duke@435 | 1057 | else |
duke@435 | 1058 | prev_p->set_next(next_p); |
duke@435 | 1059 | return head; |
duke@435 | 1060 | } |
duke@435 | 1061 | |
never@2725 | 1062 | WarmCallInfo WarmCallInfo::_always_hot(WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE(), |
never@2725 | 1063 | WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE()); |
never@2725 | 1064 | WarmCallInfo WarmCallInfo::_always_cold(WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE(), |
never@2725 | 1065 | WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE()); |
duke@435 | 1066 | |
duke@435 | 1067 | WarmCallInfo* WarmCallInfo::always_hot() { |
never@2725 | 1068 | assert(_always_hot.is_hot(), "must always be hot"); |
never@2725 | 1069 | return &_always_hot; |
duke@435 | 1070 | } |
duke@435 | 1071 | |
duke@435 | 1072 | WarmCallInfo* WarmCallInfo::always_cold() { |
never@2725 | 1073 | assert(_always_cold.is_cold(), "must always be cold"); |
never@2725 | 1074 | return &_always_cold; |
duke@435 | 1075 | } |
duke@435 | 1076 | |
duke@435 | 1077 | |
duke@435 | 1078 | #ifndef PRODUCT |
duke@435 | 1079 | |
duke@435 | 1080 | void WarmCallInfo::print() const { |
duke@435 | 1081 | tty->print("%s : C=%6.1f P=%6.1f W=%6.1f S=%6.1f H=%6.1f -> %p", |
duke@435 | 1082 | is_cold() ? "cold" : is_hot() ? "hot " : "warm", |
duke@435 | 1083 | count(), profit(), work(), size(), compute_heat(), next()); |
duke@435 | 1084 | tty->cr(); |
duke@435 | 1085 | if (call() != NULL) call()->dump(); |
duke@435 | 1086 | } |
duke@435 | 1087 | |
duke@435 | 1088 | void print_wci(WarmCallInfo* ci) { |
duke@435 | 1089 | ci->print(); |
duke@435 | 1090 | } |
duke@435 | 1091 | |
duke@435 | 1092 | void WarmCallInfo::print_all() const { |
duke@435 | 1093 | for (const WarmCallInfo* p = this; p != NULL; p = p->next()) |
duke@435 | 1094 | p->print(); |
duke@435 | 1095 | } |
duke@435 | 1096 | |
duke@435 | 1097 | int WarmCallInfo::count_all() const { |
duke@435 | 1098 | int cnt = 0; |
duke@435 | 1099 | for (const WarmCallInfo* p = this; p != NULL; p = p->next()) |
duke@435 | 1100 | cnt++; |
duke@435 | 1101 | return cnt; |
duke@435 | 1102 | } |
duke@435 | 1103 | |
duke@435 | 1104 | #endif //PRODUCT |