Tue, 11 Sep 2012 16:20:57 +0200
7195816: NPG: Crash in c1_ValueType - ShouldNotReachHere
Summary: C1 needs knowledge of T_METADATA at the LIR level.
Reviewed-by: kvn, coleenp
duke@435 | 1 | /* |
twisti@3969 | 2 | * Copyright (c) 2000, 2012, 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" |
coleenp@4037 | 28 | #include "ci/ciObjArray.hpp" |
twisti@3969 | 29 | #include "ci/ciMemberName.hpp" |
stefank@2314 | 30 | #include "ci/ciMethodHandle.hpp" |
stefank@2314 | 31 | #include "classfile/javaClasses.hpp" |
stefank@2314 | 32 | #include "compiler/compileLog.hpp" |
stefank@2314 | 33 | #include "opto/addnode.hpp" |
stefank@2314 | 34 | #include "opto/callGenerator.hpp" |
stefank@2314 | 35 | #include "opto/callnode.hpp" |
stefank@2314 | 36 | #include "opto/cfgnode.hpp" |
stefank@2314 | 37 | #include "opto/connode.hpp" |
stefank@2314 | 38 | #include "opto/parse.hpp" |
stefank@2314 | 39 | #include "opto/rootnode.hpp" |
stefank@2314 | 40 | #include "opto/runtime.hpp" |
stefank@2314 | 41 | #include "opto/subnode.hpp" |
duke@435 | 42 | |
duke@435 | 43 | |
duke@435 | 44 | // Utility function. |
duke@435 | 45 | const TypeFunc* CallGenerator::tf() const { |
duke@435 | 46 | return TypeFunc::make(method()); |
duke@435 | 47 | } |
duke@435 | 48 | |
duke@435 | 49 | //-----------------------------ParseGenerator--------------------------------- |
duke@435 | 50 | // Internal class which handles all direct bytecode traversal. |
duke@435 | 51 | class ParseGenerator : public InlineCallGenerator { |
duke@435 | 52 | private: |
duke@435 | 53 | bool _is_osr; |
duke@435 | 54 | float _expected_uses; |
duke@435 | 55 | |
duke@435 | 56 | public: |
duke@435 | 57 | ParseGenerator(ciMethod* method, float expected_uses, bool is_osr = false) |
duke@435 | 58 | : InlineCallGenerator(method) |
duke@435 | 59 | { |
duke@435 | 60 | _is_osr = is_osr; |
duke@435 | 61 | _expected_uses = expected_uses; |
twisti@3100 | 62 | assert(InlineTree::check_can_parse(method) == NULL, "parse must be possible"); |
duke@435 | 63 | } |
duke@435 | 64 | |
duke@435 | 65 | virtual bool is_parse() const { return true; } |
duke@435 | 66 | virtual JVMState* generate(JVMState* jvms); |
duke@435 | 67 | int is_osr() { return _is_osr; } |
duke@435 | 68 | |
duke@435 | 69 | }; |
duke@435 | 70 | |
duke@435 | 71 | JVMState* ParseGenerator::generate(JVMState* jvms) { |
duke@435 | 72 | Compile* C = Compile::current(); |
duke@435 | 73 | |
duke@435 | 74 | if (is_osr()) { |
duke@435 | 75 | // The JVMS for a OSR has a single argument (see its TypeFunc). |
duke@435 | 76 | assert(jvms->depth() == 1, "no inline OSR"); |
duke@435 | 77 | } |
duke@435 | 78 | |
duke@435 | 79 | if (C->failing()) { |
duke@435 | 80 | return NULL; // bailing out of the compile; do not try to parse |
duke@435 | 81 | } |
duke@435 | 82 | |
duke@435 | 83 | Parse parser(jvms, method(), _expected_uses); |
duke@435 | 84 | // Grab signature for matching/allocation |
duke@435 | 85 | #ifdef ASSERT |
duke@435 | 86 | if (parser.tf() != (parser.depth() == 1 ? C->tf() : tf())) { |
duke@435 | 87 | MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 88 | assert(C->env()->system_dictionary_modification_counter_changed(), |
duke@435 | 89 | "Must invalidate if TypeFuncs differ"); |
duke@435 | 90 | } |
duke@435 | 91 | #endif |
duke@435 | 92 | |
duke@435 | 93 | GraphKit& exits = parser.exits(); |
duke@435 | 94 | |
duke@435 | 95 | if (C->failing()) { |
duke@435 | 96 | while (exits.pop_exception_state() != NULL) ; |
duke@435 | 97 | return NULL; |
duke@435 | 98 | } |
duke@435 | 99 | |
duke@435 | 100 | assert(exits.jvms()->same_calls_as(jvms), "sanity"); |
duke@435 | 101 | |
duke@435 | 102 | // Simply return the exit state of the parser, |
duke@435 | 103 | // augmented by any exceptional states. |
duke@435 | 104 | return exits.transfer_exceptions_into_jvms(); |
duke@435 | 105 | } |
duke@435 | 106 | |
duke@435 | 107 | //---------------------------DirectCallGenerator------------------------------ |
duke@435 | 108 | // Internal class which handles all out-of-line calls w/o receiver type checks. |
duke@435 | 109 | class DirectCallGenerator : public CallGenerator { |
never@1515 | 110 | private: |
never@1515 | 111 | CallStaticJavaNode* _call_node; |
never@1515 | 112 | // Force separate memory and I/O projections for the exceptional |
never@1515 | 113 | // paths to facilitate late inlinig. |
never@1515 | 114 | bool _separate_io_proj; |
never@1515 | 115 | |
never@1515 | 116 | public: |
never@1515 | 117 | DirectCallGenerator(ciMethod* method, bool separate_io_proj) |
never@1515 | 118 | : CallGenerator(method), |
never@1515 | 119 | _separate_io_proj(separate_io_proj) |
duke@435 | 120 | { |
duke@435 | 121 | } |
duke@435 | 122 | virtual JVMState* generate(JVMState* jvms); |
never@1515 | 123 | |
never@1515 | 124 | CallStaticJavaNode* call_node() const { return _call_node; } |
duke@435 | 125 | }; |
duke@435 | 126 | |
duke@435 | 127 | JVMState* DirectCallGenerator::generate(JVMState* jvms) { |
duke@435 | 128 | GraphKit kit(jvms); |
duke@435 | 129 | bool is_static = method()->is_static(); |
duke@435 | 130 | address target = is_static ? SharedRuntime::get_resolve_static_call_stub() |
duke@435 | 131 | : SharedRuntime::get_resolve_opt_virtual_call_stub(); |
duke@435 | 132 | |
duke@435 | 133 | if (kit.C->log() != NULL) { |
duke@435 | 134 | kit.C->log()->elem("direct_call bci='%d'", jvms->bci()); |
duke@435 | 135 | } |
duke@435 | 136 | |
duke@435 | 137 | CallStaticJavaNode *call = new (kit.C, tf()->domain()->cnt()) CallStaticJavaNode(tf(), target, method(), kit.bci()); |
never@3745 | 138 | _call_node = call; // Save the call node in case we need it later |
duke@435 | 139 | if (!is_static) { |
duke@435 | 140 | // Make an explicit receiver null_check as part of this call. |
duke@435 | 141 | // Since we share a map with the caller, his JVMS gets adjusted. |
duke@435 | 142 | kit.null_check_receiver(method()); |
duke@435 | 143 | if (kit.stopped()) { |
duke@435 | 144 | // And dump it back to the caller, decorated with any exceptions: |
duke@435 | 145 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 146 | } |
duke@435 | 147 | // Mark the call node as virtual, sort of: |
duke@435 | 148 | call->set_optimized_virtual(true); |
twisti@3969 | 149 | if (method()->is_method_handle_intrinsic() || |
twisti@3969 | 150 | method()->is_compiled_lambda_form()) { |
twisti@1572 | 151 | call->set_method_handle_invoke(true); |
twisti@1700 | 152 | } |
duke@435 | 153 | } |
duke@435 | 154 | kit.set_arguments_for_java_call(call); |
never@1515 | 155 | kit.set_edges_for_java_call(call, false, _separate_io_proj); |
never@1515 | 156 | Node* ret = kit.set_results_for_java_call(call, _separate_io_proj); |
duke@435 | 157 | kit.push_node(method()->return_type()->basic_type(), ret); |
duke@435 | 158 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 159 | } |
duke@435 | 160 | |
twisti@1572 | 161 | //--------------------------VirtualCallGenerator------------------------------ |
twisti@1572 | 162 | // Internal class which handles all out-of-line calls checking receiver type. |
duke@435 | 163 | class VirtualCallGenerator : public CallGenerator { |
duke@435 | 164 | private: |
duke@435 | 165 | int _vtable_index; |
duke@435 | 166 | public: |
duke@435 | 167 | VirtualCallGenerator(ciMethod* method, int vtable_index) |
duke@435 | 168 | : CallGenerator(method), _vtable_index(vtable_index) |
duke@435 | 169 | { |
coleenp@4037 | 170 | assert(vtable_index == Method::invalid_vtable_index || |
duke@435 | 171 | vtable_index >= 0, "either invalid or usable"); |
duke@435 | 172 | } |
duke@435 | 173 | virtual bool is_virtual() const { return true; } |
duke@435 | 174 | virtual JVMState* generate(JVMState* jvms); |
duke@435 | 175 | }; |
duke@435 | 176 | |
duke@435 | 177 | JVMState* VirtualCallGenerator::generate(JVMState* jvms) { |
duke@435 | 178 | GraphKit kit(jvms); |
duke@435 | 179 | Node* receiver = kit.argument(0); |
duke@435 | 180 | |
duke@435 | 181 | if (kit.C->log() != NULL) { |
duke@435 | 182 | kit.C->log()->elem("virtual_call bci='%d'", jvms->bci()); |
duke@435 | 183 | } |
duke@435 | 184 | |
duke@435 | 185 | // If the receiver is a constant null, do not torture the system |
duke@435 | 186 | // by attempting to call through it. The compile will proceed |
duke@435 | 187 | // correctly, but may bail out in final_graph_reshaping, because |
duke@435 | 188 | // the call instruction will have a seemingly deficient out-count. |
duke@435 | 189 | // (The bailout says something misleading about an "infinite loop".) |
duke@435 | 190 | if (kit.gvn().type(receiver)->higher_equal(TypePtr::NULL_PTR)) { |
duke@435 | 191 | kit.inc_sp(method()->arg_size()); // restore arguments |
duke@435 | 192 | kit.uncommon_trap(Deoptimization::Reason_null_check, |
duke@435 | 193 | Deoptimization::Action_none, |
duke@435 | 194 | NULL, "null receiver"); |
duke@435 | 195 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 196 | } |
duke@435 | 197 | |
duke@435 | 198 | // Ideally we would unconditionally do a null check here and let it |
duke@435 | 199 | // be converted to an implicit check based on profile information. |
duke@435 | 200 | // However currently the conversion to implicit null checks in |
duke@435 | 201 | // Block::implicit_null_check() only looks for loads and stores, not calls. |
duke@435 | 202 | ciMethod *caller = kit.method(); |
duke@435 | 203 | ciMethodData *caller_md = (caller == NULL) ? NULL : caller->method_data(); |
duke@435 | 204 | if (!UseInlineCaches || !ImplicitNullChecks || |
duke@435 | 205 | ((ImplicitNullCheckThreshold > 0) && caller_md && |
duke@435 | 206 | (caller_md->trap_count(Deoptimization::Reason_null_check) |
duke@435 | 207 | >= (uint)ImplicitNullCheckThreshold))) { |
duke@435 | 208 | // Make an explicit receiver null_check as part of this call. |
duke@435 | 209 | // Since we share a map with the caller, his JVMS gets adjusted. |
duke@435 | 210 | receiver = kit.null_check_receiver(method()); |
duke@435 | 211 | if (kit.stopped()) { |
duke@435 | 212 | // And dump it back to the caller, decorated with any exceptions: |
duke@435 | 213 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 214 | } |
duke@435 | 215 | } |
duke@435 | 216 | |
duke@435 | 217 | assert(!method()->is_static(), "virtual call must not be to static"); |
duke@435 | 218 | assert(!method()->is_final(), "virtual call should not be to final"); |
duke@435 | 219 | assert(!method()->is_private(), "virtual call should not be to private"); |
coleenp@4037 | 220 | assert(_vtable_index == Method::invalid_vtable_index || !UseInlineCaches, |
duke@435 | 221 | "no vtable calls if +UseInlineCaches "); |
duke@435 | 222 | address target = SharedRuntime::get_resolve_virtual_call_stub(); |
duke@435 | 223 | // Normal inline cache used for call |
duke@435 | 224 | CallDynamicJavaNode *call = new (kit.C, tf()->domain()->cnt()) CallDynamicJavaNode(tf(), target, method(), _vtable_index, kit.bci()); |
duke@435 | 225 | kit.set_arguments_for_java_call(call); |
duke@435 | 226 | kit.set_edges_for_java_call(call); |
duke@435 | 227 | Node* ret = kit.set_results_for_java_call(call); |
duke@435 | 228 | kit.push_node(method()->return_type()->basic_type(), ret); |
duke@435 | 229 | |
duke@435 | 230 | // Represent the effect of an implicit receiver null_check |
duke@435 | 231 | // as part of this call. Since we share a map with the caller, |
duke@435 | 232 | // his JVMS gets adjusted. |
duke@435 | 233 | kit.cast_not_null(receiver); |
duke@435 | 234 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 235 | } |
duke@435 | 236 | |
duke@435 | 237 | CallGenerator* CallGenerator::for_inline(ciMethod* m, float expected_uses) { |
twisti@3100 | 238 | if (InlineTree::check_can_parse(m) != NULL) return NULL; |
duke@435 | 239 | return new ParseGenerator(m, expected_uses); |
duke@435 | 240 | } |
duke@435 | 241 | |
duke@435 | 242 | // As a special case, the JVMS passed to this CallGenerator is |
duke@435 | 243 | // for the method execution already in progress, not just the JVMS |
duke@435 | 244 | // of the caller. Thus, this CallGenerator cannot be mixed with others! |
duke@435 | 245 | CallGenerator* CallGenerator::for_osr(ciMethod* m, int osr_bci) { |
twisti@3100 | 246 | if (InlineTree::check_can_parse(m) != NULL) return NULL; |
duke@435 | 247 | float past_uses = m->interpreter_invocation_count(); |
duke@435 | 248 | float expected_uses = past_uses; |
duke@435 | 249 | return new ParseGenerator(m, expected_uses, true); |
duke@435 | 250 | } |
duke@435 | 251 | |
never@1515 | 252 | CallGenerator* CallGenerator::for_direct_call(ciMethod* m, bool separate_io_proj) { |
duke@435 | 253 | assert(!m->is_abstract(), "for_direct_call mismatch"); |
never@1515 | 254 | return new DirectCallGenerator(m, separate_io_proj); |
duke@435 | 255 | } |
duke@435 | 256 | |
duke@435 | 257 | CallGenerator* CallGenerator::for_virtual_call(ciMethod* m, int vtable_index) { |
duke@435 | 258 | assert(!m->is_static(), "for_virtual_call mismatch"); |
twisti@3969 | 259 | assert(!m->is_method_handle_intrinsic(), "should be a direct call"); |
duke@435 | 260 | return new VirtualCallGenerator(m, vtable_index); |
duke@435 | 261 | } |
duke@435 | 262 | |
never@1515 | 263 | // Allow inlining decisions to be delayed |
never@1515 | 264 | class LateInlineCallGenerator : public DirectCallGenerator { |
never@1515 | 265 | CallGenerator* _inline_cg; |
never@1515 | 266 | |
never@1515 | 267 | public: |
never@1515 | 268 | LateInlineCallGenerator(ciMethod* method, CallGenerator* inline_cg) : |
never@1515 | 269 | DirectCallGenerator(method, true), _inline_cg(inline_cg) {} |
never@1515 | 270 | |
never@1515 | 271 | virtual bool is_late_inline() const { return true; } |
never@1515 | 272 | |
never@1515 | 273 | // Convert the CallStaticJava into an inline |
never@1515 | 274 | virtual void do_late_inline(); |
never@1515 | 275 | |
twisti@4003 | 276 | virtual JVMState* generate(JVMState* jvms) { |
never@1515 | 277 | // Record that this call site should be revisited once the main |
never@1515 | 278 | // parse is finished. |
never@1515 | 279 | Compile::current()->add_late_inline(this); |
never@1515 | 280 | |
never@1515 | 281 | // Emit the CallStaticJava and request separate projections so |
never@1515 | 282 | // that the late inlining logic can distinguish between fall |
never@1515 | 283 | // through and exceptional uses of the memory and io projections |
never@1515 | 284 | // as is done for allocations and macro expansion. |
never@1515 | 285 | return DirectCallGenerator::generate(jvms); |
never@1515 | 286 | } |
never@1515 | 287 | |
never@1515 | 288 | }; |
never@1515 | 289 | |
never@1515 | 290 | |
never@1515 | 291 | void LateInlineCallGenerator::do_late_inline() { |
never@1515 | 292 | // Can't inline it |
never@1515 | 293 | if (call_node() == NULL || call_node()->outcnt() == 0 || |
never@1515 | 294 | call_node()->in(0) == NULL || call_node()->in(0)->is_top()) |
never@1515 | 295 | return; |
never@1515 | 296 | |
never@1515 | 297 | CallStaticJavaNode* call = call_node(); |
never@1515 | 298 | |
never@1515 | 299 | // Make a clone of the JVMState that appropriate to use for driving a parse |
never@1515 | 300 | Compile* C = Compile::current(); |
never@1515 | 301 | JVMState* jvms = call->jvms()->clone_shallow(C); |
never@1515 | 302 | uint size = call->req(); |
never@1515 | 303 | SafePointNode* map = new (C, size) SafePointNode(size, jvms); |
never@1515 | 304 | for (uint i1 = 0; i1 < size; i1++) { |
never@1515 | 305 | map->init_req(i1, call->in(i1)); |
never@1515 | 306 | } |
never@1515 | 307 | |
never@1515 | 308 | // Make sure the state is a MergeMem for parsing. |
never@1515 | 309 | if (!map->in(TypeFunc::Memory)->is_MergeMem()) { |
never@1515 | 310 | map->set_req(TypeFunc::Memory, MergeMemNode::make(C, map->in(TypeFunc::Memory))); |
never@1515 | 311 | } |
never@1515 | 312 | |
never@1515 | 313 | // Make enough space for the expression stack and transfer the incoming arguments |
never@1515 | 314 | int nargs = method()->arg_size(); |
never@1515 | 315 | jvms->set_map(map); |
never@1515 | 316 | map->ensure_stack(jvms, jvms->method()->max_stack()); |
never@1515 | 317 | if (nargs > 0) { |
never@1515 | 318 | for (int i1 = 0; i1 < nargs; i1++) { |
never@1515 | 319 | map->set_req(i1 + jvms->argoff(), call->in(TypeFunc::Parms + i1)); |
never@1515 | 320 | } |
never@1515 | 321 | } |
never@1515 | 322 | |
never@1515 | 323 | CompileLog* log = C->log(); |
never@1515 | 324 | if (log != NULL) { |
never@1515 | 325 | log->head("late_inline method='%d'", log->identify(method())); |
never@1515 | 326 | JVMState* p = jvms; |
never@1515 | 327 | while (p != NULL) { |
never@1515 | 328 | log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method())); |
never@1515 | 329 | p = p->caller(); |
never@1515 | 330 | } |
never@1515 | 331 | log->tail("late_inline"); |
never@1515 | 332 | } |
never@1515 | 333 | |
never@1515 | 334 | // Setup default node notes to be picked up by the inlining |
never@1515 | 335 | Node_Notes* old_nn = C->default_node_notes(); |
never@1515 | 336 | if (old_nn != NULL) { |
never@1515 | 337 | Node_Notes* entry_nn = old_nn->clone(C); |
never@1515 | 338 | entry_nn->set_jvms(jvms); |
never@1515 | 339 | C->set_default_node_notes(entry_nn); |
never@1515 | 340 | } |
never@1515 | 341 | |
never@1515 | 342 | // Now perform the inling using the synthesized JVMState |
never@1515 | 343 | JVMState* new_jvms = _inline_cg->generate(jvms); |
never@1515 | 344 | if (new_jvms == NULL) return; // no change |
never@1515 | 345 | if (C->failing()) return; |
never@1515 | 346 | |
never@1515 | 347 | // Capture any exceptional control flow |
never@1515 | 348 | GraphKit kit(new_jvms); |
never@1515 | 349 | |
never@1515 | 350 | // Find the result object |
never@1515 | 351 | Node* result = C->top(); |
never@1515 | 352 | int result_size = method()->return_type()->size(); |
never@1515 | 353 | if (result_size != 0 && !kit.stopped()) { |
never@1515 | 354 | result = (result_size == 1) ? kit.pop() : kit.pop_pair(); |
never@1515 | 355 | } |
never@1515 | 356 | |
never@1515 | 357 | kit.replace_call(call, result); |
never@1515 | 358 | } |
never@1515 | 359 | |
never@1515 | 360 | |
never@1515 | 361 | CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) { |
never@1515 | 362 | return new LateInlineCallGenerator(method, inline_cg); |
never@1515 | 363 | } |
never@1515 | 364 | |
duke@435 | 365 | |
duke@435 | 366 | //---------------------------WarmCallGenerator-------------------------------- |
duke@435 | 367 | // Internal class which handles initial deferral of inlining decisions. |
duke@435 | 368 | class WarmCallGenerator : public CallGenerator { |
duke@435 | 369 | WarmCallInfo* _call_info; |
duke@435 | 370 | CallGenerator* _if_cold; |
duke@435 | 371 | CallGenerator* _if_hot; |
duke@435 | 372 | bool _is_virtual; // caches virtuality of if_cold |
duke@435 | 373 | bool _is_inline; // caches inline-ness of if_hot |
duke@435 | 374 | |
duke@435 | 375 | public: |
duke@435 | 376 | WarmCallGenerator(WarmCallInfo* ci, |
duke@435 | 377 | CallGenerator* if_cold, |
duke@435 | 378 | CallGenerator* if_hot) |
duke@435 | 379 | : CallGenerator(if_cold->method()) |
duke@435 | 380 | { |
duke@435 | 381 | assert(method() == if_hot->method(), "consistent choices"); |
duke@435 | 382 | _call_info = ci; |
duke@435 | 383 | _if_cold = if_cold; |
duke@435 | 384 | _if_hot = if_hot; |
duke@435 | 385 | _is_virtual = if_cold->is_virtual(); |
duke@435 | 386 | _is_inline = if_hot->is_inline(); |
duke@435 | 387 | } |
duke@435 | 388 | |
duke@435 | 389 | virtual bool is_inline() const { return _is_inline; } |
duke@435 | 390 | virtual bool is_virtual() const { return _is_virtual; } |
duke@435 | 391 | virtual bool is_deferred() const { return true; } |
duke@435 | 392 | |
duke@435 | 393 | virtual JVMState* generate(JVMState* jvms); |
duke@435 | 394 | }; |
duke@435 | 395 | |
duke@435 | 396 | |
duke@435 | 397 | CallGenerator* CallGenerator::for_warm_call(WarmCallInfo* ci, |
duke@435 | 398 | CallGenerator* if_cold, |
duke@435 | 399 | CallGenerator* if_hot) { |
duke@435 | 400 | return new WarmCallGenerator(ci, if_cold, if_hot); |
duke@435 | 401 | } |
duke@435 | 402 | |
duke@435 | 403 | JVMState* WarmCallGenerator::generate(JVMState* jvms) { |
duke@435 | 404 | Compile* C = Compile::current(); |
duke@435 | 405 | if (C->log() != NULL) { |
duke@435 | 406 | C->log()->elem("warm_call bci='%d'", jvms->bci()); |
duke@435 | 407 | } |
duke@435 | 408 | jvms = _if_cold->generate(jvms); |
duke@435 | 409 | if (jvms != NULL) { |
duke@435 | 410 | Node* m = jvms->map()->control(); |
duke@435 | 411 | if (m->is_CatchProj()) m = m->in(0); else m = C->top(); |
duke@435 | 412 | if (m->is_Catch()) m = m->in(0); else m = C->top(); |
duke@435 | 413 | if (m->is_Proj()) m = m->in(0); else m = C->top(); |
duke@435 | 414 | if (m->is_CallJava()) { |
duke@435 | 415 | _call_info->set_call(m->as_Call()); |
duke@435 | 416 | _call_info->set_hot_cg(_if_hot); |
duke@435 | 417 | #ifndef PRODUCT |
duke@435 | 418 | if (PrintOpto || PrintOptoInlining) { |
duke@435 | 419 | tty->print_cr("Queueing for warm inlining at bci %d:", jvms->bci()); |
duke@435 | 420 | tty->print("WCI: "); |
duke@435 | 421 | _call_info->print(); |
duke@435 | 422 | } |
duke@435 | 423 | #endif |
duke@435 | 424 | _call_info->set_heat(_call_info->compute_heat()); |
duke@435 | 425 | C->set_warm_calls(_call_info->insert_into(C->warm_calls())); |
duke@435 | 426 | } |
duke@435 | 427 | } |
duke@435 | 428 | return jvms; |
duke@435 | 429 | } |
duke@435 | 430 | |
duke@435 | 431 | void WarmCallInfo::make_hot() { |
never@1515 | 432 | Unimplemented(); |
duke@435 | 433 | } |
duke@435 | 434 | |
duke@435 | 435 | void WarmCallInfo::make_cold() { |
duke@435 | 436 | // No action: Just dequeue. |
duke@435 | 437 | } |
duke@435 | 438 | |
duke@435 | 439 | |
duke@435 | 440 | //------------------------PredictedCallGenerator------------------------------ |
duke@435 | 441 | // Internal class which handles all out-of-line calls checking receiver type. |
duke@435 | 442 | class PredictedCallGenerator : public CallGenerator { |
duke@435 | 443 | ciKlass* _predicted_receiver; |
duke@435 | 444 | CallGenerator* _if_missed; |
duke@435 | 445 | CallGenerator* _if_hit; |
duke@435 | 446 | float _hit_prob; |
duke@435 | 447 | |
duke@435 | 448 | public: |
duke@435 | 449 | PredictedCallGenerator(ciKlass* predicted_receiver, |
duke@435 | 450 | CallGenerator* if_missed, |
duke@435 | 451 | CallGenerator* if_hit, float hit_prob) |
duke@435 | 452 | : CallGenerator(if_missed->method()) |
duke@435 | 453 | { |
duke@435 | 454 | // The call profile data may predict the hit_prob as extreme as 0 or 1. |
duke@435 | 455 | // Remove the extremes values from the range. |
duke@435 | 456 | if (hit_prob > PROB_MAX) hit_prob = PROB_MAX; |
duke@435 | 457 | if (hit_prob < PROB_MIN) hit_prob = PROB_MIN; |
duke@435 | 458 | |
duke@435 | 459 | _predicted_receiver = predicted_receiver; |
duke@435 | 460 | _if_missed = if_missed; |
duke@435 | 461 | _if_hit = if_hit; |
duke@435 | 462 | _hit_prob = hit_prob; |
duke@435 | 463 | } |
duke@435 | 464 | |
duke@435 | 465 | virtual bool is_virtual() const { return true; } |
duke@435 | 466 | virtual bool is_inline() const { return _if_hit->is_inline(); } |
duke@435 | 467 | virtual bool is_deferred() const { return _if_hit->is_deferred(); } |
duke@435 | 468 | |
duke@435 | 469 | virtual JVMState* generate(JVMState* jvms); |
duke@435 | 470 | }; |
duke@435 | 471 | |
duke@435 | 472 | |
duke@435 | 473 | CallGenerator* CallGenerator::for_predicted_call(ciKlass* predicted_receiver, |
duke@435 | 474 | CallGenerator* if_missed, |
duke@435 | 475 | CallGenerator* if_hit, |
duke@435 | 476 | float hit_prob) { |
duke@435 | 477 | return new PredictedCallGenerator(predicted_receiver, if_missed, if_hit, hit_prob); |
duke@435 | 478 | } |
duke@435 | 479 | |
duke@435 | 480 | |
duke@435 | 481 | JVMState* PredictedCallGenerator::generate(JVMState* jvms) { |
duke@435 | 482 | GraphKit kit(jvms); |
duke@435 | 483 | PhaseGVN& gvn = kit.gvn(); |
duke@435 | 484 | // We need an explicit receiver null_check before checking its type. |
duke@435 | 485 | // We share a map with the caller, so his JVMS gets adjusted. |
duke@435 | 486 | Node* receiver = kit.argument(0); |
duke@435 | 487 | |
duke@435 | 488 | CompileLog* log = kit.C->log(); |
duke@435 | 489 | if (log != NULL) { |
duke@435 | 490 | log->elem("predicted_call bci='%d' klass='%d'", |
duke@435 | 491 | jvms->bci(), log->identify(_predicted_receiver)); |
duke@435 | 492 | } |
duke@435 | 493 | |
duke@435 | 494 | receiver = kit.null_check_receiver(method()); |
duke@435 | 495 | if (kit.stopped()) { |
duke@435 | 496 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 497 | } |
duke@435 | 498 | |
duke@435 | 499 | Node* exact_receiver = receiver; // will get updated in place... |
duke@435 | 500 | Node* slow_ctl = kit.type_check_receiver(receiver, |
duke@435 | 501 | _predicted_receiver, _hit_prob, |
duke@435 | 502 | &exact_receiver); |
duke@435 | 503 | |
duke@435 | 504 | SafePointNode* slow_map = NULL; |
duke@435 | 505 | JVMState* slow_jvms; |
duke@435 | 506 | { PreserveJVMState pjvms(&kit); |
duke@435 | 507 | kit.set_control(slow_ctl); |
duke@435 | 508 | if (!kit.stopped()) { |
duke@435 | 509 | slow_jvms = _if_missed->generate(kit.sync_jvms()); |
twisti@3313 | 510 | if (kit.failing()) |
twisti@3313 | 511 | return NULL; // might happen because of NodeCountInliningCutoff |
twisti@3313 | 512 | assert(slow_jvms != NULL, "must be"); |
duke@435 | 513 | kit.add_exception_states_from(slow_jvms); |
duke@435 | 514 | kit.set_map(slow_jvms->map()); |
duke@435 | 515 | if (!kit.stopped()) |
duke@435 | 516 | slow_map = kit.stop(); |
duke@435 | 517 | } |
duke@435 | 518 | } |
duke@435 | 519 | |
kvn@728 | 520 | if (kit.stopped()) { |
kvn@728 | 521 | // Instance exactly does not matches the desired type. |
kvn@728 | 522 | kit.set_jvms(slow_jvms); |
kvn@728 | 523 | return kit.transfer_exceptions_into_jvms(); |
kvn@728 | 524 | } |
kvn@728 | 525 | |
duke@435 | 526 | // fall through if the instance exactly matches the desired type |
duke@435 | 527 | kit.replace_in_map(receiver, exact_receiver); |
duke@435 | 528 | |
duke@435 | 529 | // Make the hot call: |
duke@435 | 530 | JVMState* new_jvms = _if_hit->generate(kit.sync_jvms()); |
duke@435 | 531 | if (new_jvms == NULL) { |
duke@435 | 532 | // Inline failed, so make a direct call. |
duke@435 | 533 | assert(_if_hit->is_inline(), "must have been a failed inline"); |
duke@435 | 534 | CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method()); |
duke@435 | 535 | new_jvms = cg->generate(kit.sync_jvms()); |
duke@435 | 536 | } |
duke@435 | 537 | kit.add_exception_states_from(new_jvms); |
duke@435 | 538 | kit.set_jvms(new_jvms); |
duke@435 | 539 | |
duke@435 | 540 | // Need to merge slow and fast? |
duke@435 | 541 | if (slow_map == NULL) { |
duke@435 | 542 | // The fast path is the only path remaining. |
duke@435 | 543 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 544 | } |
duke@435 | 545 | |
duke@435 | 546 | if (kit.stopped()) { |
duke@435 | 547 | // Inlined method threw an exception, so it's just the slow path after all. |
duke@435 | 548 | kit.set_jvms(slow_jvms); |
duke@435 | 549 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 550 | } |
duke@435 | 551 | |
duke@435 | 552 | // Finish the diamond. |
duke@435 | 553 | kit.C->set_has_split_ifs(true); // Has chance for split-if optimization |
duke@435 | 554 | RegionNode* region = new (kit.C, 3) RegionNode(3); |
duke@435 | 555 | region->init_req(1, kit.control()); |
duke@435 | 556 | region->init_req(2, slow_map->control()); |
duke@435 | 557 | kit.set_control(gvn.transform(region)); |
duke@435 | 558 | Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO); |
duke@435 | 559 | iophi->set_req(2, slow_map->i_o()); |
duke@435 | 560 | kit.set_i_o(gvn.transform(iophi)); |
duke@435 | 561 | kit.merge_memory(slow_map->merged_memory(), region, 2); |
duke@435 | 562 | uint tos = kit.jvms()->stkoff() + kit.sp(); |
duke@435 | 563 | uint limit = slow_map->req(); |
duke@435 | 564 | for (uint i = TypeFunc::Parms; i < limit; i++) { |
duke@435 | 565 | // Skip unused stack slots; fast forward to monoff(); |
duke@435 | 566 | if (i == tos) { |
duke@435 | 567 | i = kit.jvms()->monoff(); |
duke@435 | 568 | if( i >= limit ) break; |
duke@435 | 569 | } |
duke@435 | 570 | Node* m = kit.map()->in(i); |
duke@435 | 571 | Node* n = slow_map->in(i); |
duke@435 | 572 | if (m != n) { |
duke@435 | 573 | const Type* t = gvn.type(m)->meet(gvn.type(n)); |
duke@435 | 574 | Node* phi = PhiNode::make(region, m, t); |
duke@435 | 575 | phi->set_req(2, n); |
duke@435 | 576 | kit.map()->set_req(i, gvn.transform(phi)); |
duke@435 | 577 | } |
duke@435 | 578 | } |
duke@435 | 579 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 580 | } |
duke@435 | 581 | |
duke@435 | 582 | |
twisti@3969 | 583 | CallGenerator* CallGenerator::for_method_handle_call(JVMState* jvms, ciMethod* caller, ciMethod* callee) { |
twisti@3969 | 584 | assert(callee->is_method_handle_intrinsic() || |
twisti@3969 | 585 | callee->is_compiled_lambda_form(), "for_method_handle_call mismatch"); |
twisti@3969 | 586 | CallGenerator* cg = CallGenerator::for_method_handle_inline(jvms, caller, callee); |
twisti@3313 | 587 | if (cg != NULL) |
twisti@3313 | 588 | return cg; |
twisti@3313 | 589 | return CallGenerator::for_direct_call(callee); |
twisti@3313 | 590 | } |
twisti@3313 | 591 | |
twisti@3969 | 592 | CallGenerator* CallGenerator::for_method_handle_inline(JVMState* jvms, ciMethod* caller, ciMethod* callee) { |
twisti@3969 | 593 | GraphKit kit(jvms); |
twisti@3969 | 594 | PhaseGVN& gvn = kit.gvn(); |
twisti@3969 | 595 | Compile* C = kit.C; |
twisti@3969 | 596 | vmIntrinsics::ID iid = callee->intrinsic_id(); |
twisti@3969 | 597 | switch (iid) { |
twisti@3969 | 598 | case vmIntrinsics::_invokeBasic: |
twisti@3969 | 599 | { |
twisti@3969 | 600 | // get MethodHandle receiver |
twisti@3969 | 601 | Node* receiver = kit.argument(0); |
twisti@3969 | 602 | if (receiver->Opcode() == Op_ConP) { |
twisti@3969 | 603 | const TypeOopPtr* oop_ptr = receiver->bottom_type()->is_oopptr(); |
twisti@3969 | 604 | ciMethod* target = oop_ptr->const_oop()->as_method_handle()->get_vmtarget(); |
twisti@3969 | 605 | guarantee(!target->is_method_handle_intrinsic(), "should not happen"); // XXX remove |
coleenp@4037 | 606 | const int vtable_index = Method::invalid_vtable_index; |
twisti@3969 | 607 | CallGenerator* cg = C->call_generator(target, vtable_index, false, jvms, true, PROB_ALWAYS); |
twisti@3969 | 608 | if (cg != NULL && cg->is_inline()) |
twisti@3969 | 609 | return cg; |
twisti@3969 | 610 | } else { |
twisti@3969 | 611 | if (PrintInlining) CompileTask::print_inlining(callee, jvms->depth() - 1, jvms->bci(), "receiver not constant"); |
never@3105 | 612 | } |
never@3105 | 613 | } |
twisti@3969 | 614 | break; |
never@3105 | 615 | |
twisti@3969 | 616 | case vmIntrinsics::_linkToVirtual: |
twisti@3969 | 617 | case vmIntrinsics::_linkToStatic: |
twisti@3969 | 618 | case vmIntrinsics::_linkToSpecial: |
twisti@3969 | 619 | case vmIntrinsics::_linkToInterface: |
twisti@3969 | 620 | { |
twisti@3969 | 621 | // pop MemberName argument |
twisti@3969 | 622 | Node* member_name = kit.argument(callee->arg_size() - 1); |
twisti@3969 | 623 | if (member_name->Opcode() == Op_ConP) { |
twisti@3969 | 624 | const TypeOopPtr* oop_ptr = member_name->bottom_type()->is_oopptr(); |
twisti@3969 | 625 | ciMethod* target = oop_ptr->const_oop()->as_member_name()->get_vmtarget(); |
twisti@3969 | 626 | |
twisti@3969 | 627 | // In lamda forms we erase signature types to avoid resolving issues |
twisti@3969 | 628 | // involving class loaders. When we optimize a method handle invoke |
twisti@3969 | 629 | // to a direct call we must cast the receiver and arguments to its |
twisti@3969 | 630 | // actual types. |
twisti@3969 | 631 | ciSignature* signature = target->signature(); |
twisti@3969 | 632 | const int receiver_skip = target->is_static() ? 0 : 1; |
twisti@3969 | 633 | // Cast receiver to its type. |
twisti@3969 | 634 | if (!target->is_static()) { |
twisti@3969 | 635 | Node* arg = kit.argument(0); |
twisti@3969 | 636 | const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr(); |
twisti@3969 | 637 | const Type* sig_type = TypeOopPtr::make_from_klass(signature->accessing_klass()); |
twisti@3969 | 638 | if (arg_type != NULL && !arg_type->higher_equal(sig_type)) { |
twisti@3969 | 639 | Node* cast_obj = gvn.transform(new (C, 2) CheckCastPPNode(kit.control(), arg, sig_type)); |
twisti@3969 | 640 | kit.set_argument(0, cast_obj); |
twisti@3969 | 641 | } |
twisti@3969 | 642 | } |
twisti@3969 | 643 | // Cast reference arguments to its type. |
twisti@3969 | 644 | for (int i = 0; i < signature->count(); i++) { |
twisti@3969 | 645 | ciType* t = signature->type_at(i); |
twisti@3969 | 646 | if (t->is_klass()) { |
twisti@3969 | 647 | Node* arg = kit.argument(receiver_skip + i); |
twisti@3969 | 648 | const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr(); |
twisti@3969 | 649 | const Type* sig_type = TypeOopPtr::make_from_klass(t->as_klass()); |
twisti@3969 | 650 | if (arg_type != NULL && !arg_type->higher_equal(sig_type)) { |
twisti@3969 | 651 | Node* cast_obj = gvn.transform(new (C, 2) CheckCastPPNode(kit.control(), arg, sig_type)); |
twisti@3969 | 652 | kit.set_argument(receiver_skip + i, cast_obj); |
twisti@3969 | 653 | } |
twisti@3969 | 654 | } |
twisti@3969 | 655 | } |
coleenp@4037 | 656 | const int vtable_index = Method::invalid_vtable_index; |
twisti@3969 | 657 | const bool call_is_virtual = target->is_abstract(); // FIXME workaround |
twisti@3969 | 658 | CallGenerator* cg = C->call_generator(target, vtable_index, call_is_virtual, jvms, true, PROB_ALWAYS); |
twisti@3969 | 659 | if (cg != NULL && cg->is_inline()) |
twisti@3969 | 660 | return cg; |
twisti@3969 | 661 | } |
never@2949 | 662 | } |
twisti@3969 | 663 | break; |
twisti@3969 | 664 | |
twisti@3969 | 665 | default: |
kvn@3971 | 666 | fatal(err_msg_res("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid))); |
twisti@3969 | 667 | break; |
never@2949 | 668 | } |
never@2949 | 669 | return NULL; |
never@2949 | 670 | } |
never@2949 | 671 | |
twisti@1573 | 672 | |
duke@435 | 673 | //-------------------------UncommonTrapCallGenerator----------------------------- |
duke@435 | 674 | // Internal class which handles all out-of-line calls checking receiver type. |
duke@435 | 675 | class UncommonTrapCallGenerator : public CallGenerator { |
duke@435 | 676 | Deoptimization::DeoptReason _reason; |
duke@435 | 677 | Deoptimization::DeoptAction _action; |
duke@435 | 678 | |
duke@435 | 679 | public: |
duke@435 | 680 | UncommonTrapCallGenerator(ciMethod* m, |
duke@435 | 681 | Deoptimization::DeoptReason reason, |
duke@435 | 682 | Deoptimization::DeoptAction action) |
duke@435 | 683 | : CallGenerator(m) |
duke@435 | 684 | { |
duke@435 | 685 | _reason = reason; |
duke@435 | 686 | _action = action; |
duke@435 | 687 | } |
duke@435 | 688 | |
duke@435 | 689 | virtual bool is_virtual() const { ShouldNotReachHere(); return false; } |
duke@435 | 690 | virtual bool is_trap() const { return true; } |
duke@435 | 691 | |
duke@435 | 692 | virtual JVMState* generate(JVMState* jvms); |
duke@435 | 693 | }; |
duke@435 | 694 | |
duke@435 | 695 | |
duke@435 | 696 | CallGenerator* |
duke@435 | 697 | CallGenerator::for_uncommon_trap(ciMethod* m, |
duke@435 | 698 | Deoptimization::DeoptReason reason, |
duke@435 | 699 | Deoptimization::DeoptAction action) { |
duke@435 | 700 | return new UncommonTrapCallGenerator(m, reason, action); |
duke@435 | 701 | } |
duke@435 | 702 | |
duke@435 | 703 | |
duke@435 | 704 | JVMState* UncommonTrapCallGenerator::generate(JVMState* jvms) { |
duke@435 | 705 | GraphKit kit(jvms); |
duke@435 | 706 | // Take the trap with arguments pushed on the stack. (Cf. null_check_receiver). |
duke@435 | 707 | int nargs = method()->arg_size(); |
duke@435 | 708 | kit.inc_sp(nargs); |
duke@435 | 709 | assert(nargs <= kit.sp() && kit.sp() <= jvms->stk_size(), "sane sp w/ args pushed"); |
duke@435 | 710 | if (_reason == Deoptimization::Reason_class_check && |
duke@435 | 711 | _action == Deoptimization::Action_maybe_recompile) { |
duke@435 | 712 | // Temp fix for 6529811 |
duke@435 | 713 | // Don't allow uncommon_trap to override our decision to recompile in the event |
duke@435 | 714 | // of a class cast failure for a monomorphic call as it will never let us convert |
duke@435 | 715 | // the call to either bi-morphic or megamorphic and can lead to unc-trap loops |
duke@435 | 716 | bool keep_exact_action = true; |
duke@435 | 717 | kit.uncommon_trap(_reason, _action, NULL, "monomorphic vcall checkcast", false, keep_exact_action); |
duke@435 | 718 | } else { |
duke@435 | 719 | kit.uncommon_trap(_reason, _action); |
duke@435 | 720 | } |
duke@435 | 721 | return kit.transfer_exceptions_into_jvms(); |
duke@435 | 722 | } |
duke@435 | 723 | |
duke@435 | 724 | // (Note: Moved hook_up_call to GraphKit::set_edges_for_java_call.) |
duke@435 | 725 | |
duke@435 | 726 | // (Node: Merged hook_up_exits into ParseGenerator::generate.) |
duke@435 | 727 | |
duke@435 | 728 | #define NODES_OVERHEAD_PER_METHOD (30.0) |
duke@435 | 729 | #define NODES_PER_BYTECODE (9.5) |
duke@435 | 730 | |
duke@435 | 731 | void WarmCallInfo::init(JVMState* call_site, ciMethod* call_method, ciCallProfile& profile, float prof_factor) { |
duke@435 | 732 | int call_count = profile.count(); |
duke@435 | 733 | int code_size = call_method->code_size(); |
duke@435 | 734 | |
duke@435 | 735 | // Expected execution count is based on the historical count: |
duke@435 | 736 | _count = call_count < 0 ? 1 : call_site->method()->scale_count(call_count, prof_factor); |
duke@435 | 737 | |
duke@435 | 738 | // Expected profit from inlining, in units of simple call-overheads. |
duke@435 | 739 | _profit = 1.0; |
duke@435 | 740 | |
duke@435 | 741 | // Expected work performed by the call in units of call-overheads. |
duke@435 | 742 | // %%% need an empirical curve fit for "work" (time in call) |
duke@435 | 743 | float bytecodes_per_call = 3; |
duke@435 | 744 | _work = 1.0 + code_size / bytecodes_per_call; |
duke@435 | 745 | |
duke@435 | 746 | // Expected size of compilation graph: |
duke@435 | 747 | // -XX:+PrintParseStatistics once reported: |
duke@435 | 748 | // Methods seen: 9184 Methods parsed: 9184 Nodes created: 1582391 |
duke@435 | 749 | // Histogram of 144298 parsed bytecodes: |
duke@435 | 750 | // %%% Need an better predictor for graph size. |
duke@435 | 751 | _size = NODES_OVERHEAD_PER_METHOD + (NODES_PER_BYTECODE * code_size); |
duke@435 | 752 | } |
duke@435 | 753 | |
duke@435 | 754 | // is_cold: Return true if the node should never be inlined. |
duke@435 | 755 | // This is true if any of the key metrics are extreme. |
duke@435 | 756 | bool WarmCallInfo::is_cold() const { |
duke@435 | 757 | if (count() < WarmCallMinCount) return true; |
duke@435 | 758 | if (profit() < WarmCallMinProfit) return true; |
duke@435 | 759 | if (work() > WarmCallMaxWork) return true; |
duke@435 | 760 | if (size() > WarmCallMaxSize) return true; |
duke@435 | 761 | return false; |
duke@435 | 762 | } |
duke@435 | 763 | |
duke@435 | 764 | // is_hot: Return true if the node should be inlined immediately. |
duke@435 | 765 | // This is true if any of the key metrics are extreme. |
duke@435 | 766 | bool WarmCallInfo::is_hot() const { |
duke@435 | 767 | assert(!is_cold(), "eliminate is_cold cases before testing is_hot"); |
duke@435 | 768 | if (count() >= HotCallCountThreshold) return true; |
duke@435 | 769 | if (profit() >= HotCallProfitThreshold) return true; |
duke@435 | 770 | if (work() <= HotCallTrivialWork) return true; |
duke@435 | 771 | if (size() <= HotCallTrivialSize) return true; |
duke@435 | 772 | return false; |
duke@435 | 773 | } |
duke@435 | 774 | |
duke@435 | 775 | // compute_heat: |
duke@435 | 776 | float WarmCallInfo::compute_heat() const { |
duke@435 | 777 | assert(!is_cold(), "compute heat only on warm nodes"); |
duke@435 | 778 | assert(!is_hot(), "compute heat only on warm nodes"); |
duke@435 | 779 | int min_size = MAX2(0, (int)HotCallTrivialSize); |
duke@435 | 780 | int max_size = MIN2(500, (int)WarmCallMaxSize); |
duke@435 | 781 | float method_size = (size() - min_size) / MAX2(1, max_size - min_size); |
duke@435 | 782 | float size_factor; |
duke@435 | 783 | if (method_size < 0.05) size_factor = 4; // 2 sigmas better than avg. |
duke@435 | 784 | else if (method_size < 0.15) size_factor = 2; // 1 sigma better than avg. |
duke@435 | 785 | else if (method_size < 0.5) size_factor = 1; // better than avg. |
duke@435 | 786 | else size_factor = 0.5; // worse than avg. |
duke@435 | 787 | return (count() * profit() * size_factor); |
duke@435 | 788 | } |
duke@435 | 789 | |
duke@435 | 790 | bool WarmCallInfo::warmer_than(WarmCallInfo* that) { |
duke@435 | 791 | assert(this != that, "compare only different WCIs"); |
duke@435 | 792 | assert(this->heat() != 0 && that->heat() != 0, "call compute_heat 1st"); |
duke@435 | 793 | if (this->heat() > that->heat()) return true; |
duke@435 | 794 | if (this->heat() < that->heat()) return false; |
duke@435 | 795 | assert(this->heat() == that->heat(), "no NaN heat allowed"); |
duke@435 | 796 | // Equal heat. Break the tie some other way. |
duke@435 | 797 | if (!this->call() || !that->call()) return (address)this > (address)that; |
duke@435 | 798 | return this->call()->_idx > that->call()->_idx; |
duke@435 | 799 | } |
duke@435 | 800 | |
duke@435 | 801 | //#define UNINIT_NEXT ((WarmCallInfo*)badAddress) |
duke@435 | 802 | #define UNINIT_NEXT ((WarmCallInfo*)NULL) |
duke@435 | 803 | |
duke@435 | 804 | WarmCallInfo* WarmCallInfo::insert_into(WarmCallInfo* head) { |
duke@435 | 805 | assert(next() == UNINIT_NEXT, "not yet on any list"); |
duke@435 | 806 | WarmCallInfo* prev_p = NULL; |
duke@435 | 807 | WarmCallInfo* next_p = head; |
duke@435 | 808 | while (next_p != NULL && next_p->warmer_than(this)) { |
duke@435 | 809 | prev_p = next_p; |
duke@435 | 810 | next_p = prev_p->next(); |
duke@435 | 811 | } |
duke@435 | 812 | // Install this between prev_p and next_p. |
duke@435 | 813 | this->set_next(next_p); |
duke@435 | 814 | if (prev_p == NULL) |
duke@435 | 815 | head = this; |
duke@435 | 816 | else |
duke@435 | 817 | prev_p->set_next(this); |
duke@435 | 818 | return head; |
duke@435 | 819 | } |
duke@435 | 820 | |
duke@435 | 821 | WarmCallInfo* WarmCallInfo::remove_from(WarmCallInfo* head) { |
duke@435 | 822 | WarmCallInfo* prev_p = NULL; |
duke@435 | 823 | WarmCallInfo* next_p = head; |
duke@435 | 824 | while (next_p != this) { |
duke@435 | 825 | assert(next_p != NULL, "this must be in the list somewhere"); |
duke@435 | 826 | prev_p = next_p; |
duke@435 | 827 | next_p = prev_p->next(); |
duke@435 | 828 | } |
duke@435 | 829 | next_p = this->next(); |
duke@435 | 830 | debug_only(this->set_next(UNINIT_NEXT)); |
duke@435 | 831 | // Remove this from between prev_p and next_p. |
duke@435 | 832 | if (prev_p == NULL) |
duke@435 | 833 | head = next_p; |
duke@435 | 834 | else |
duke@435 | 835 | prev_p->set_next(next_p); |
duke@435 | 836 | return head; |
duke@435 | 837 | } |
duke@435 | 838 | |
never@2725 | 839 | WarmCallInfo WarmCallInfo::_always_hot(WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE(), |
never@2725 | 840 | WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE()); |
never@2725 | 841 | WarmCallInfo WarmCallInfo::_always_cold(WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE(), |
never@2725 | 842 | WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE()); |
duke@435 | 843 | |
duke@435 | 844 | WarmCallInfo* WarmCallInfo::always_hot() { |
never@2725 | 845 | assert(_always_hot.is_hot(), "must always be hot"); |
never@2725 | 846 | return &_always_hot; |
duke@435 | 847 | } |
duke@435 | 848 | |
duke@435 | 849 | WarmCallInfo* WarmCallInfo::always_cold() { |
never@2725 | 850 | assert(_always_cold.is_cold(), "must always be cold"); |
never@2725 | 851 | return &_always_cold; |
duke@435 | 852 | } |
duke@435 | 853 | |
duke@435 | 854 | |
duke@435 | 855 | #ifndef PRODUCT |
duke@435 | 856 | |
duke@435 | 857 | void WarmCallInfo::print() const { |
duke@435 | 858 | tty->print("%s : C=%6.1f P=%6.1f W=%6.1f S=%6.1f H=%6.1f -> %p", |
duke@435 | 859 | is_cold() ? "cold" : is_hot() ? "hot " : "warm", |
duke@435 | 860 | count(), profit(), work(), size(), compute_heat(), next()); |
duke@435 | 861 | tty->cr(); |
duke@435 | 862 | if (call() != NULL) call()->dump(); |
duke@435 | 863 | } |
duke@435 | 864 | |
duke@435 | 865 | void print_wci(WarmCallInfo* ci) { |
duke@435 | 866 | ci->print(); |
duke@435 | 867 | } |
duke@435 | 868 | |
duke@435 | 869 | void WarmCallInfo::print_all() const { |
duke@435 | 870 | for (const WarmCallInfo* p = this; p != NULL; p = p->next()) |
duke@435 | 871 | p->print(); |
duke@435 | 872 | } |
duke@435 | 873 | |
duke@435 | 874 | int WarmCallInfo::count_all() const { |
duke@435 | 875 | int cnt = 0; |
duke@435 | 876 | for (const WarmCallInfo* p = this; p != NULL; p = p->next()) |
duke@435 | 877 | cnt++; |
duke@435 | 878 | return cnt; |
duke@435 | 879 | } |
duke@435 | 880 | |
duke@435 | 881 | #endif //PRODUCT |