Thu, 20 Sep 2012 16:49:17 +0200
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
Summary: use shorter instruction sequences for atomic add and atomic exchange when possible.
Reviewed-by: kvn, jrose
duke@435 | 1 | /* |
coleenp@4037 | 2 | * Copyright (c) 1997, 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 "compiler/compileLog.hpp" |
stefank@2314 | 27 | #include "interpreter/linkResolver.hpp" |
coleenp@4037 | 28 | #include "oops/method.hpp" |
stefank@2314 | 29 | #include "opto/addnode.hpp" |
stefank@2314 | 30 | #include "opto/idealGraphPrinter.hpp" |
stefank@2314 | 31 | #include "opto/locknode.hpp" |
stefank@2314 | 32 | #include "opto/memnode.hpp" |
stefank@2314 | 33 | #include "opto/parse.hpp" |
stefank@2314 | 34 | #include "opto/rootnode.hpp" |
stefank@2314 | 35 | #include "opto/runtime.hpp" |
stefank@2314 | 36 | #include "runtime/arguments.hpp" |
stefank@2314 | 37 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 38 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 39 | #include "utilities/copy.hpp" |
duke@435 | 40 | |
duke@435 | 41 | // Static array so we can figure out which bytecodes stop us from compiling |
duke@435 | 42 | // the most. Some of the non-static variables are needed in bytecodeInfo.cpp |
duke@435 | 43 | // and eventually should be encapsulated in a proper class (gri 8/18/98). |
duke@435 | 44 | |
never@802 | 45 | int nodes_created = 0; |
never@802 | 46 | int methods_parsed = 0; |
never@802 | 47 | int methods_seen = 0; |
never@802 | 48 | int blocks_parsed = 0; |
never@802 | 49 | int blocks_seen = 0; |
duke@435 | 50 | |
never@802 | 51 | int explicit_null_checks_inserted = 0; |
never@802 | 52 | int explicit_null_checks_elided = 0; |
duke@435 | 53 | int all_null_checks_found = 0, implicit_null_checks = 0; |
duke@435 | 54 | int implicit_null_throws = 0; |
duke@435 | 55 | |
duke@435 | 56 | int reclaim_idx = 0; |
duke@435 | 57 | int reclaim_in = 0; |
duke@435 | 58 | int reclaim_node = 0; |
duke@435 | 59 | |
duke@435 | 60 | #ifndef PRODUCT |
duke@435 | 61 | bool Parse::BytecodeParseHistogram::_initialized = false; |
duke@435 | 62 | uint Parse::BytecodeParseHistogram::_bytecodes_parsed [Bytecodes::number_of_codes]; |
duke@435 | 63 | uint Parse::BytecodeParseHistogram::_nodes_constructed[Bytecodes::number_of_codes]; |
duke@435 | 64 | uint Parse::BytecodeParseHistogram::_nodes_transformed[Bytecodes::number_of_codes]; |
duke@435 | 65 | uint Parse::BytecodeParseHistogram::_new_values [Bytecodes::number_of_codes]; |
duke@435 | 66 | #endif |
duke@435 | 67 | |
duke@435 | 68 | //------------------------------print_statistics------------------------------- |
duke@435 | 69 | #ifndef PRODUCT |
duke@435 | 70 | void Parse::print_statistics() { |
duke@435 | 71 | tty->print_cr("--- Compiler Statistics ---"); |
duke@435 | 72 | tty->print("Methods seen: %d Methods parsed: %d", methods_seen, methods_parsed); |
duke@435 | 73 | tty->print(" Nodes created: %d", nodes_created); |
duke@435 | 74 | tty->cr(); |
duke@435 | 75 | if (methods_seen != methods_parsed) |
duke@435 | 76 | tty->print_cr("Reasons for parse failures (NOT cumulative):"); |
never@802 | 77 | tty->print_cr("Blocks parsed: %d Blocks seen: %d", blocks_parsed, blocks_seen); |
duke@435 | 78 | |
duke@435 | 79 | if( explicit_null_checks_inserted ) |
duke@435 | 80 | tty->print_cr("%d original NULL checks - %d elided (%2d%%); optimizer leaves %d,", explicit_null_checks_inserted, explicit_null_checks_elided, (100*explicit_null_checks_elided)/explicit_null_checks_inserted, all_null_checks_found); |
duke@435 | 81 | if( all_null_checks_found ) |
duke@435 | 82 | tty->print_cr("%d made implicit (%2d%%)", implicit_null_checks, |
duke@435 | 83 | (100*implicit_null_checks)/all_null_checks_found); |
duke@435 | 84 | if( implicit_null_throws ) |
duke@435 | 85 | tty->print_cr("%d implicit null exceptions at runtime", |
duke@435 | 86 | implicit_null_throws); |
duke@435 | 87 | |
duke@435 | 88 | if( PrintParseStatistics && BytecodeParseHistogram::initialized() ) { |
duke@435 | 89 | BytecodeParseHistogram::print(); |
duke@435 | 90 | } |
duke@435 | 91 | } |
duke@435 | 92 | #endif |
duke@435 | 93 | |
duke@435 | 94 | //------------------------------ON STACK REPLACEMENT--------------------------- |
duke@435 | 95 | |
duke@435 | 96 | // Construct a node which can be used to get incoming state for |
duke@435 | 97 | // on stack replacement. |
duke@435 | 98 | Node *Parse::fetch_interpreter_state(int index, |
duke@435 | 99 | BasicType bt, |
duke@435 | 100 | Node *local_addrs, |
duke@435 | 101 | Node *local_addrs_base) { |
duke@435 | 102 | Node *mem = memory(Compile::AliasIdxRaw); |
duke@435 | 103 | Node *adr = basic_plus_adr( local_addrs_base, local_addrs, -index*wordSize ); |
kvn@1964 | 104 | Node *ctl = control(); |
duke@435 | 105 | |
duke@435 | 106 | // Very similar to LoadNode::make, except we handle un-aligned longs and |
duke@435 | 107 | // doubles on Sparc. Intel can handle them just fine directly. |
duke@435 | 108 | Node *l; |
duke@435 | 109 | switch( bt ) { // Signature is flattened |
kvn@1964 | 110 | case T_INT: l = new (C, 3) LoadINode( ctl, mem, adr, TypeRawPtr::BOTTOM ); break; |
kvn@1964 | 111 | case T_FLOAT: l = new (C, 3) LoadFNode( ctl, mem, adr, TypeRawPtr::BOTTOM ); break; |
kvn@1964 | 112 | case T_ADDRESS: l = new (C, 3) LoadPNode( ctl, mem, adr, TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM ); break; |
kvn@1964 | 113 | case T_OBJECT: l = new (C, 3) LoadPNode( ctl, mem, adr, TypeRawPtr::BOTTOM, TypeInstPtr::BOTTOM ); break; |
duke@435 | 114 | case T_LONG: |
duke@435 | 115 | case T_DOUBLE: { |
duke@435 | 116 | // Since arguments are in reverse order, the argument address 'adr' |
duke@435 | 117 | // refers to the back half of the long/double. Recompute adr. |
duke@435 | 118 | adr = basic_plus_adr( local_addrs_base, local_addrs, -(index+1)*wordSize ); |
duke@435 | 119 | if( Matcher::misaligned_doubles_ok ) { |
duke@435 | 120 | l = (bt == T_DOUBLE) |
kvn@1964 | 121 | ? (Node*)new (C, 3) LoadDNode( ctl, mem, adr, TypeRawPtr::BOTTOM ) |
kvn@1964 | 122 | : (Node*)new (C, 3) LoadLNode( ctl, mem, adr, TypeRawPtr::BOTTOM ); |
duke@435 | 123 | } else { |
duke@435 | 124 | l = (bt == T_DOUBLE) |
kvn@1964 | 125 | ? (Node*)new (C, 3) LoadD_unalignedNode( ctl, mem, adr, TypeRawPtr::BOTTOM ) |
kvn@1964 | 126 | : (Node*)new (C, 3) LoadL_unalignedNode( ctl, mem, adr, TypeRawPtr::BOTTOM ); |
duke@435 | 127 | } |
duke@435 | 128 | break; |
duke@435 | 129 | } |
duke@435 | 130 | default: ShouldNotReachHere(); |
duke@435 | 131 | } |
duke@435 | 132 | return _gvn.transform(l); |
duke@435 | 133 | } |
duke@435 | 134 | |
duke@435 | 135 | // Helper routine to prevent the interpreter from handing |
duke@435 | 136 | // unexpected typestate to an OSR method. |
duke@435 | 137 | // The Node l is a value newly dug out of the interpreter frame. |
duke@435 | 138 | // The type is the type predicted by ciTypeFlow. Note that it is |
duke@435 | 139 | // not a general type, but can only come from Type::get_typeflow_type. |
duke@435 | 140 | // The safepoint is a map which will feed an uncommon trap. |
duke@435 | 141 | Node* Parse::check_interpreter_type(Node* l, const Type* type, |
duke@435 | 142 | SafePointNode* &bad_type_exit) { |
duke@435 | 143 | |
duke@435 | 144 | const TypeOopPtr* tp = type->isa_oopptr(); |
duke@435 | 145 | |
duke@435 | 146 | // TypeFlow may assert null-ness if a type appears unloaded. |
duke@435 | 147 | if (type == TypePtr::NULL_PTR || |
duke@435 | 148 | (tp != NULL && !tp->klass()->is_loaded())) { |
duke@435 | 149 | // Value must be null, not a real oop. |
duke@435 | 150 | Node* chk = _gvn.transform( new (C, 3) CmpPNode(l, null()) ); |
duke@435 | 151 | Node* tst = _gvn.transform( new (C, 2) BoolNode(chk, BoolTest::eq) ); |
duke@435 | 152 | IfNode* iff = create_and_map_if(control(), tst, PROB_MAX, COUNT_UNKNOWN); |
duke@435 | 153 | set_control(_gvn.transform( new (C, 1) IfTrueNode(iff) )); |
duke@435 | 154 | Node* bad_type = _gvn.transform( new (C, 1) IfFalseNode(iff) ); |
duke@435 | 155 | bad_type_exit->control()->add_req(bad_type); |
duke@435 | 156 | l = null(); |
duke@435 | 157 | } |
duke@435 | 158 | |
duke@435 | 159 | // Typeflow can also cut off paths from the CFG, based on |
duke@435 | 160 | // types which appear unloaded, or call sites which appear unlinked. |
duke@435 | 161 | // When paths are cut off, values at later merge points can rise |
duke@435 | 162 | // toward more specific classes. Make sure these specific classes |
duke@435 | 163 | // are still in effect. |
duke@435 | 164 | if (tp != NULL && tp->klass() != C->env()->Object_klass()) { |
duke@435 | 165 | // TypeFlow asserted a specific object type. Value must have that type. |
duke@435 | 166 | Node* bad_type_ctrl = NULL; |
duke@435 | 167 | l = gen_checkcast(l, makecon(TypeKlassPtr::make(tp->klass())), &bad_type_ctrl); |
duke@435 | 168 | bad_type_exit->control()->add_req(bad_type_ctrl); |
duke@435 | 169 | } |
duke@435 | 170 | |
duke@435 | 171 | BasicType bt_l = _gvn.type(l)->basic_type(); |
duke@435 | 172 | BasicType bt_t = type->basic_type(); |
duke@435 | 173 | assert(_gvn.type(l)->higher_equal(type), "must constrain OSR typestate"); |
duke@435 | 174 | return l; |
duke@435 | 175 | } |
duke@435 | 176 | |
duke@435 | 177 | // Helper routine which sets up elements of the initial parser map when |
duke@435 | 178 | // performing a parse for on stack replacement. Add values into map. |
duke@435 | 179 | // The only parameter contains the address of a interpreter arguments. |
duke@435 | 180 | void Parse::load_interpreter_state(Node* osr_buf) { |
duke@435 | 181 | int index; |
duke@435 | 182 | int max_locals = jvms()->loc_size(); |
duke@435 | 183 | int max_stack = jvms()->stk_size(); |
duke@435 | 184 | |
duke@435 | 185 | |
duke@435 | 186 | // Mismatch between method and jvms can occur since map briefly held |
duke@435 | 187 | // an OSR entry state (which takes up one RawPtr word). |
duke@435 | 188 | assert(max_locals == method()->max_locals(), "sanity"); |
duke@435 | 189 | assert(max_stack >= method()->max_stack(), "sanity"); |
duke@435 | 190 | assert((int)jvms()->endoff() == TypeFunc::Parms + max_locals + max_stack, "sanity"); |
duke@435 | 191 | assert((int)jvms()->endoff() == (int)map()->req(), "sanity"); |
duke@435 | 192 | |
duke@435 | 193 | // Find the start block. |
duke@435 | 194 | Block* osr_block = start_block(); |
duke@435 | 195 | assert(osr_block->start() == osr_bci(), "sanity"); |
duke@435 | 196 | |
duke@435 | 197 | // Set initial BCI. |
duke@435 | 198 | set_parse_bci(osr_block->start()); |
duke@435 | 199 | |
duke@435 | 200 | // Set initial stack depth. |
duke@435 | 201 | set_sp(osr_block->start_sp()); |
duke@435 | 202 | |
duke@435 | 203 | // Check bailouts. We currently do not perform on stack replacement |
duke@435 | 204 | // of loops in catch blocks or loops which branch with a non-empty stack. |
duke@435 | 205 | if (sp() != 0) { |
duke@435 | 206 | C->record_method_not_compilable("OSR starts with non-empty stack"); |
duke@435 | 207 | return; |
duke@435 | 208 | } |
duke@435 | 209 | // Do not OSR inside finally clauses: |
duke@435 | 210 | if (osr_block->has_trap_at(osr_block->start())) { |
duke@435 | 211 | C->record_method_not_compilable("OSR starts with an immediate trap"); |
duke@435 | 212 | return; |
duke@435 | 213 | } |
duke@435 | 214 | |
duke@435 | 215 | // Commute monitors from interpreter frame to compiler frame. |
duke@435 | 216 | assert(jvms()->monitor_depth() == 0, "should be no active locks at beginning of osr"); |
duke@435 | 217 | int mcnt = osr_block->flow()->monitor_count(); |
duke@435 | 218 | Node *monitors_addr = basic_plus_adr(osr_buf, osr_buf, (max_locals+mcnt*2-1)*wordSize); |
duke@435 | 219 | for (index = 0; index < mcnt; index++) { |
duke@435 | 220 | // Make a BoxLockNode for the monitor. |
duke@435 | 221 | Node *box = _gvn.transform(new (C, 1) BoxLockNode(next_monitor())); |
duke@435 | 222 | |
duke@435 | 223 | |
duke@435 | 224 | // Displaced headers and locked objects are interleaved in the |
duke@435 | 225 | // temp OSR buffer. We only copy the locked objects out here. |
duke@435 | 226 | // Fetch the locked object from the OSR temp buffer and copy to our fastlock node. |
duke@435 | 227 | Node *lock_object = fetch_interpreter_state(index*2, T_OBJECT, monitors_addr, osr_buf); |
duke@435 | 228 | // Try and copy the displaced header to the BoxNode |
duke@435 | 229 | Node *displaced_hdr = fetch_interpreter_state((index*2) + 1, T_ADDRESS, monitors_addr, osr_buf); |
duke@435 | 230 | |
duke@435 | 231 | |
duke@435 | 232 | store_to_memory(control(), box, displaced_hdr, T_ADDRESS, Compile::AliasIdxRaw); |
duke@435 | 233 | |
duke@435 | 234 | // Build a bogus FastLockNode (no code will be generated) and push the |
duke@435 | 235 | // monitor into our debug info. |
duke@435 | 236 | const FastLockNode *flock = _gvn.transform(new (C, 3) FastLockNode( 0, lock_object, box ))->as_FastLock(); |
duke@435 | 237 | map()->push_monitor(flock); |
duke@435 | 238 | |
duke@435 | 239 | // If the lock is our method synchronization lock, tuck it away in |
duke@435 | 240 | // _sync_lock for return and rethrow exit paths. |
duke@435 | 241 | if (index == 0 && method()->is_synchronized()) { |
duke@435 | 242 | _synch_lock = flock; |
duke@435 | 243 | } |
duke@435 | 244 | } |
duke@435 | 245 | |
never@1426 | 246 | // Use the raw liveness computation to make sure that unexpected |
never@1426 | 247 | // values don't propagate into the OSR frame. |
never@1505 | 248 | MethodLivenessResult live_locals = method()->liveness_at_bci(osr_bci()); |
duke@435 | 249 | if (!live_locals.is_valid()) { |
duke@435 | 250 | // Degenerate or breakpointed method. |
duke@435 | 251 | C->record_method_not_compilable("OSR in empty or breakpointed method"); |
duke@435 | 252 | return; |
duke@435 | 253 | } |
duke@435 | 254 | |
duke@435 | 255 | // Extract the needed locals from the interpreter frame. |
duke@435 | 256 | Node *locals_addr = basic_plus_adr(osr_buf, osr_buf, (max_locals-1)*wordSize); |
duke@435 | 257 | |
duke@435 | 258 | // find all the locals that the interpreter thinks contain live oops |
duke@435 | 259 | const BitMap live_oops = method()->live_local_oops_at_bci(osr_bci()); |
duke@435 | 260 | for (index = 0; index < max_locals; index++) { |
duke@435 | 261 | |
duke@435 | 262 | if (!live_locals.at(index)) { |
duke@435 | 263 | continue; |
duke@435 | 264 | } |
duke@435 | 265 | |
duke@435 | 266 | const Type *type = osr_block->local_type_at(index); |
duke@435 | 267 | |
duke@435 | 268 | if (type->isa_oopptr() != NULL) { |
duke@435 | 269 | |
duke@435 | 270 | // 6403625: Verify that the interpreter oopMap thinks that the oop is live |
duke@435 | 271 | // else we might load a stale oop if the MethodLiveness disagrees with the |
duke@435 | 272 | // result of the interpreter. If the interpreter says it is dead we agree |
duke@435 | 273 | // by making the value go to top. |
duke@435 | 274 | // |
duke@435 | 275 | |
duke@435 | 276 | if (!live_oops.at(index)) { |
duke@435 | 277 | if (C->log() != NULL) { |
duke@435 | 278 | C->log()->elem("OSR_mismatch local_index='%d'",index); |
duke@435 | 279 | } |
duke@435 | 280 | set_local(index, null()); |
duke@435 | 281 | // and ignore it for the loads |
duke@435 | 282 | continue; |
duke@435 | 283 | } |
duke@435 | 284 | } |
duke@435 | 285 | |
duke@435 | 286 | // Filter out TOP, HALF, and BOTTOM. (Cf. ensure_phi.) |
duke@435 | 287 | if (type == Type::TOP || type == Type::HALF) { |
duke@435 | 288 | continue; |
duke@435 | 289 | } |
duke@435 | 290 | // If the type falls to bottom, then this must be a local that |
duke@435 | 291 | // is mixing ints and oops or some such. Forcing it to top |
duke@435 | 292 | // makes it go dead. |
duke@435 | 293 | if (type == Type::BOTTOM) { |
duke@435 | 294 | continue; |
duke@435 | 295 | } |
duke@435 | 296 | // Construct code to access the appropriate local. |
never@1812 | 297 | BasicType bt = type->basic_type(); |
never@1812 | 298 | if (type == TypePtr::NULL_PTR) { |
never@1812 | 299 | // Ptr types are mixed together with T_ADDRESS but NULL is |
never@1812 | 300 | // really for T_OBJECT types so correct it. |
never@1812 | 301 | bt = T_OBJECT; |
never@1812 | 302 | } |
never@1812 | 303 | Node *value = fetch_interpreter_state(index, bt, locals_addr, osr_buf); |
duke@435 | 304 | set_local(index, value); |
duke@435 | 305 | } |
duke@435 | 306 | |
duke@435 | 307 | // Extract the needed stack entries from the interpreter frame. |
duke@435 | 308 | for (index = 0; index < sp(); index++) { |
duke@435 | 309 | const Type *type = osr_block->stack_type_at(index); |
duke@435 | 310 | if (type != Type::TOP) { |
duke@435 | 311 | // Currently the compiler bails out when attempting to on stack replace |
duke@435 | 312 | // at a bci with a non-empty stack. We should not reach here. |
duke@435 | 313 | ShouldNotReachHere(); |
duke@435 | 314 | } |
duke@435 | 315 | } |
duke@435 | 316 | |
duke@435 | 317 | // End the OSR migration |
duke@435 | 318 | make_runtime_call(RC_LEAF, OptoRuntime::osr_end_Type(), |
duke@435 | 319 | CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end), |
duke@435 | 320 | "OSR_migration_end", TypeRawPtr::BOTTOM, |
duke@435 | 321 | osr_buf); |
duke@435 | 322 | |
duke@435 | 323 | // Now that the interpreter state is loaded, make sure it will match |
duke@435 | 324 | // at execution time what the compiler is expecting now: |
duke@435 | 325 | SafePointNode* bad_type_exit = clone_map(); |
duke@435 | 326 | bad_type_exit->set_control(new (C, 1) RegionNode(1)); |
duke@435 | 327 | |
never@1713 | 328 | assert(osr_block->flow()->jsrs()->size() == 0, "should be no jsrs live at osr point"); |
duke@435 | 329 | for (index = 0; index < max_locals; index++) { |
duke@435 | 330 | if (stopped()) break; |
duke@435 | 331 | Node* l = local(index); |
duke@435 | 332 | if (l->is_top()) continue; // nothing here |
duke@435 | 333 | const Type *type = osr_block->local_type_at(index); |
duke@435 | 334 | if (type->isa_oopptr() != NULL) { |
duke@435 | 335 | if (!live_oops.at(index)) { |
duke@435 | 336 | // skip type check for dead oops |
duke@435 | 337 | continue; |
duke@435 | 338 | } |
duke@435 | 339 | } |
never@1716 | 340 | if (osr_block->flow()->local_type_at(index)->is_return_address()) { |
never@1713 | 341 | // In our current system it's illegal for jsr addresses to be |
never@1713 | 342 | // live into an OSR entry point because the compiler performs |
never@1713 | 343 | // inlining of jsrs. ciTypeFlow has a bailout that detect this |
never@1713 | 344 | // case and aborts the compile if addresses are live into an OSR |
never@1713 | 345 | // entry point. Because of that we can assume that any address |
never@1713 | 346 | // locals at the OSR entry point are dead. Method liveness |
never@1713 | 347 | // isn't precise enought to figure out that they are dead in all |
never@1713 | 348 | // cases so simply skip checking address locals all |
never@1713 | 349 | // together. Any type check is guaranteed to fail since the |
never@1713 | 350 | // interpreter type is the result of a load which might have any |
never@1713 | 351 | // value and the expected type is a constant. |
never@1505 | 352 | continue; |
never@1505 | 353 | } |
duke@435 | 354 | set_local(index, check_interpreter_type(l, type, bad_type_exit)); |
duke@435 | 355 | } |
duke@435 | 356 | |
duke@435 | 357 | for (index = 0; index < sp(); index++) { |
duke@435 | 358 | if (stopped()) break; |
duke@435 | 359 | Node* l = stack(index); |
duke@435 | 360 | if (l->is_top()) continue; // nothing here |
duke@435 | 361 | const Type *type = osr_block->stack_type_at(index); |
duke@435 | 362 | set_stack(index, check_interpreter_type(l, type, bad_type_exit)); |
duke@435 | 363 | } |
duke@435 | 364 | |
duke@435 | 365 | if (bad_type_exit->control()->req() > 1) { |
duke@435 | 366 | // Build an uncommon trap here, if any inputs can be unexpected. |
duke@435 | 367 | bad_type_exit->set_control(_gvn.transform( bad_type_exit->control() )); |
duke@435 | 368 | record_for_igvn(bad_type_exit->control()); |
duke@435 | 369 | SafePointNode* types_are_good = map(); |
duke@435 | 370 | set_map(bad_type_exit); |
duke@435 | 371 | // The unexpected type happens because a new edge is active |
duke@435 | 372 | // in the CFG, which typeflow had previously ignored. |
duke@435 | 373 | // E.g., Object x = coldAtFirst() && notReached()? "str": new Integer(123). |
duke@435 | 374 | // This x will be typed as Integer if notReached is not yet linked. |
duke@435 | 375 | uncommon_trap(Deoptimization::Reason_unreached, |
duke@435 | 376 | Deoptimization::Action_reinterpret); |
duke@435 | 377 | set_map(types_are_good); |
duke@435 | 378 | } |
duke@435 | 379 | } |
duke@435 | 380 | |
duke@435 | 381 | //------------------------------Parse------------------------------------------ |
duke@435 | 382 | // Main parser constructor. |
duke@435 | 383 | Parse::Parse(JVMState* caller, ciMethod* parse_method, float expected_uses) |
duke@435 | 384 | : _exits(caller) |
duke@435 | 385 | { |
duke@435 | 386 | // Init some variables |
duke@435 | 387 | _caller = caller; |
duke@435 | 388 | _method = parse_method; |
duke@435 | 389 | _expected_uses = expected_uses; |
duke@435 | 390 | _depth = 1 + (caller->has_method() ? caller->depth() : 0); |
duke@435 | 391 | _wrote_final = false; |
duke@435 | 392 | _entry_bci = InvocationEntryBci; |
duke@435 | 393 | _tf = NULL; |
duke@435 | 394 | _block = NULL; |
duke@435 | 395 | debug_only(_block_count = -1); |
duke@435 | 396 | debug_only(_blocks = (Block*)-1); |
duke@435 | 397 | #ifndef PRODUCT |
duke@435 | 398 | if (PrintCompilation || PrintOpto) { |
duke@435 | 399 | // Make sure I have an inline tree, so I can print messages about it. |
duke@435 | 400 | JVMState* ilt_caller = is_osr_parse() ? caller->caller() : caller; |
twisti@3969 | 401 | InlineTree::find_subtree_from_root(C->ilt(), ilt_caller, parse_method); |
duke@435 | 402 | } |
duke@435 | 403 | _max_switch_depth = 0; |
duke@435 | 404 | _est_switch_depth = 0; |
duke@435 | 405 | #endif |
duke@435 | 406 | |
duke@435 | 407 | _tf = TypeFunc::make(method()); |
duke@435 | 408 | _iter.reset_to_method(method()); |
duke@435 | 409 | _flow = method()->get_flow_analysis(); |
duke@435 | 410 | if (_flow->failing()) { |
duke@435 | 411 | C->record_method_not_compilable_all_tiers(_flow->failure_reason()); |
duke@435 | 412 | } |
duke@435 | 413 | |
never@802 | 414 | #ifndef PRODUCT |
never@802 | 415 | if (_flow->has_irreducible_entry()) { |
never@802 | 416 | C->set_parsed_irreducible_loop(true); |
never@802 | 417 | } |
never@802 | 418 | #endif |
never@802 | 419 | |
duke@435 | 420 | if (_expected_uses <= 0) { |
duke@435 | 421 | _prof_factor = 1; |
duke@435 | 422 | } else { |
duke@435 | 423 | float prof_total = parse_method->interpreter_invocation_count(); |
duke@435 | 424 | if (prof_total <= _expected_uses) { |
duke@435 | 425 | _prof_factor = 1; |
duke@435 | 426 | } else { |
duke@435 | 427 | _prof_factor = _expected_uses / prof_total; |
duke@435 | 428 | } |
duke@435 | 429 | } |
duke@435 | 430 | |
duke@435 | 431 | CompileLog* log = C->log(); |
duke@435 | 432 | if (log != NULL) { |
duke@435 | 433 | log->begin_head("parse method='%d' uses='%g'", |
duke@435 | 434 | log->identify(parse_method), expected_uses); |
duke@435 | 435 | if (depth() == 1 && C->is_osr_compilation()) { |
duke@435 | 436 | log->print(" osr_bci='%d'", C->entry_bci()); |
duke@435 | 437 | } |
duke@435 | 438 | log->stamp(); |
duke@435 | 439 | log->end_head(); |
duke@435 | 440 | } |
duke@435 | 441 | |
duke@435 | 442 | // Accumulate deoptimization counts. |
duke@435 | 443 | // (The range_check and store_check counts are checked elsewhere.) |
duke@435 | 444 | ciMethodData* md = method()->method_data(); |
duke@435 | 445 | for (uint reason = 0; reason < md->trap_reason_limit(); reason++) { |
duke@435 | 446 | uint md_count = md->trap_count(reason); |
duke@435 | 447 | if (md_count != 0) { |
duke@435 | 448 | if (md_count == md->trap_count_limit()) |
duke@435 | 449 | md_count += md->overflow_trap_count(); |
duke@435 | 450 | uint total_count = C->trap_count(reason); |
duke@435 | 451 | uint old_count = total_count; |
duke@435 | 452 | total_count += md_count; |
duke@435 | 453 | // Saturate the add if it overflows. |
duke@435 | 454 | if (total_count < old_count || total_count < md_count) |
duke@435 | 455 | total_count = (uint)-1; |
duke@435 | 456 | C->set_trap_count(reason, total_count); |
duke@435 | 457 | if (log != NULL) |
duke@435 | 458 | log->elem("observe trap='%s' count='%d' total='%d'", |
duke@435 | 459 | Deoptimization::trap_reason_name(reason), |
duke@435 | 460 | md_count, total_count); |
duke@435 | 461 | } |
duke@435 | 462 | } |
duke@435 | 463 | // Accumulate total sum of decompilations, also. |
duke@435 | 464 | C->set_decompile_count(C->decompile_count() + md->decompile_count()); |
duke@435 | 465 | |
duke@435 | 466 | _count_invocations = C->do_count_invocations(); |
duke@435 | 467 | _method_data_update = C->do_method_data_update(); |
duke@435 | 468 | |
duke@435 | 469 | if (log != NULL && method()->has_exception_handlers()) { |
duke@435 | 470 | log->elem("observe that='has_exception_handlers'"); |
duke@435 | 471 | } |
duke@435 | 472 | |
duke@435 | 473 | assert(method()->can_be_compiled(), "Can not parse this method, cutout earlier"); |
duke@435 | 474 | assert(method()->has_balanced_monitors(), "Can not parse unbalanced monitors, cutout earlier"); |
duke@435 | 475 | |
duke@435 | 476 | // Always register dependence if JVMTI is enabled, because |
duke@435 | 477 | // either breakpoint setting or hotswapping of methods may |
duke@435 | 478 | // cause deoptimization. |
kvn@1215 | 479 | if (C->env()->jvmti_can_hotswap_or_post_breakpoint()) { |
duke@435 | 480 | C->dependencies()->assert_evol_method(method()); |
duke@435 | 481 | } |
duke@435 | 482 | |
duke@435 | 483 | methods_seen++; |
duke@435 | 484 | |
duke@435 | 485 | // Do some special top-level things. |
duke@435 | 486 | if (depth() == 1 && C->is_osr_compilation()) { |
duke@435 | 487 | _entry_bci = C->entry_bci(); |
duke@435 | 488 | _flow = method()->get_osr_flow_analysis(osr_bci()); |
duke@435 | 489 | if (_flow->failing()) { |
duke@435 | 490 | C->record_method_not_compilable(_flow->failure_reason()); |
duke@435 | 491 | #ifndef PRODUCT |
duke@435 | 492 | if (PrintOpto && (Verbose || WizardMode)) { |
duke@435 | 493 | tty->print_cr("OSR @%d type flow bailout: %s", _entry_bci, _flow->failure_reason()); |
duke@435 | 494 | if (Verbose) { |
coleenp@4037 | 495 | method()->print(); |
duke@435 | 496 | method()->print_codes(); |
duke@435 | 497 | _flow->print(); |
duke@435 | 498 | } |
duke@435 | 499 | } |
duke@435 | 500 | #endif |
duke@435 | 501 | } |
duke@435 | 502 | _tf = C->tf(); // the OSR entry type is different |
duke@435 | 503 | } |
duke@435 | 504 | |
duke@435 | 505 | #ifdef ASSERT |
duke@435 | 506 | if (depth() == 1) { |
duke@435 | 507 | assert(C->is_osr_compilation() == this->is_osr_parse(), "OSR in sync"); |
duke@435 | 508 | if (C->tf() != tf()) { |
duke@435 | 509 | MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 510 | assert(C->env()->system_dictionary_modification_counter_changed(), |
duke@435 | 511 | "Must invalidate if TypeFuncs differ"); |
duke@435 | 512 | } |
duke@435 | 513 | } else { |
duke@435 | 514 | assert(!this->is_osr_parse(), "no recursive OSR"); |
duke@435 | 515 | } |
duke@435 | 516 | #endif |
duke@435 | 517 | |
duke@435 | 518 | methods_parsed++; |
duke@435 | 519 | #ifndef PRODUCT |
duke@435 | 520 | // add method size here to guarantee that inlined methods are added too |
duke@435 | 521 | if (TimeCompiler) |
duke@435 | 522 | _total_bytes_compiled += method()->code_size(); |
duke@435 | 523 | |
duke@435 | 524 | show_parse_info(); |
duke@435 | 525 | #endif |
duke@435 | 526 | |
duke@435 | 527 | if (failing()) { |
duke@435 | 528 | if (log) log->done("parse"); |
duke@435 | 529 | return; |
duke@435 | 530 | } |
duke@435 | 531 | |
duke@435 | 532 | gvn().set_type(root(), root()->bottom_type()); |
duke@435 | 533 | gvn().transform(top()); |
duke@435 | 534 | |
duke@435 | 535 | // Import the results of the ciTypeFlow. |
duke@435 | 536 | init_blocks(); |
duke@435 | 537 | |
duke@435 | 538 | // Merge point for all normal exits |
duke@435 | 539 | build_exits(); |
duke@435 | 540 | |
duke@435 | 541 | // Setup the initial JVM state map. |
duke@435 | 542 | SafePointNode* entry_map = create_entry_map(); |
duke@435 | 543 | |
duke@435 | 544 | // Check for bailouts during map initialization |
duke@435 | 545 | if (failing() || entry_map == NULL) { |
duke@435 | 546 | if (log) log->done("parse"); |
duke@435 | 547 | return; |
duke@435 | 548 | } |
duke@435 | 549 | |
duke@435 | 550 | Node_Notes* caller_nn = C->default_node_notes(); |
duke@435 | 551 | // Collect debug info for inlined calls unless -XX:-DebugInlinedCalls. |
duke@435 | 552 | if (DebugInlinedCalls || depth() == 1) { |
duke@435 | 553 | C->set_default_node_notes(make_node_notes(caller_nn)); |
duke@435 | 554 | } |
duke@435 | 555 | |
duke@435 | 556 | if (is_osr_parse()) { |
duke@435 | 557 | Node* osr_buf = entry_map->in(TypeFunc::Parms+0); |
duke@435 | 558 | entry_map->set_req(TypeFunc::Parms+0, top()); |
duke@435 | 559 | set_map(entry_map); |
duke@435 | 560 | load_interpreter_state(osr_buf); |
duke@435 | 561 | } else { |
duke@435 | 562 | set_map(entry_map); |
duke@435 | 563 | do_method_entry(); |
duke@435 | 564 | } |
duke@435 | 565 | |
duke@435 | 566 | // Check for bailouts during method entry. |
duke@435 | 567 | if (failing()) { |
duke@435 | 568 | if (log) log->done("parse"); |
duke@435 | 569 | C->set_default_node_notes(caller_nn); |
duke@435 | 570 | return; |
duke@435 | 571 | } |
duke@435 | 572 | |
duke@435 | 573 | entry_map = map(); // capture any changes performed by method setup code |
duke@435 | 574 | assert(jvms()->endoff() == map()->req(), "map matches JVMS layout"); |
duke@435 | 575 | |
duke@435 | 576 | // We begin parsing as if we have just encountered a jump to the |
duke@435 | 577 | // method entry. |
duke@435 | 578 | Block* entry_block = start_block(); |
duke@435 | 579 | assert(entry_block->start() == (is_osr_parse() ? osr_bci() : 0), ""); |
duke@435 | 580 | set_map_clone(entry_map); |
duke@435 | 581 | merge_common(entry_block, entry_block->next_path_num()); |
duke@435 | 582 | |
duke@435 | 583 | #ifndef PRODUCT |
duke@435 | 584 | BytecodeParseHistogram *parse_histogram_obj = new (C->env()->arena()) BytecodeParseHistogram(this, C); |
duke@435 | 585 | set_parse_histogram( parse_histogram_obj ); |
duke@435 | 586 | #endif |
duke@435 | 587 | |
duke@435 | 588 | // Parse all the basic blocks. |
duke@435 | 589 | do_all_blocks(); |
duke@435 | 590 | |
duke@435 | 591 | C->set_default_node_notes(caller_nn); |
duke@435 | 592 | |
duke@435 | 593 | // Check for bailouts during conversion to graph |
duke@435 | 594 | if (failing()) { |
duke@435 | 595 | if (log) log->done("parse"); |
duke@435 | 596 | return; |
duke@435 | 597 | } |
duke@435 | 598 | |
duke@435 | 599 | // Fix up all exiting control flow. |
duke@435 | 600 | set_map(entry_map); |
duke@435 | 601 | do_exits(); |
duke@435 | 602 | |
duke@435 | 603 | if (log) log->done("parse nodes='%d' memory='%d'", |
duke@435 | 604 | C->unique(), C->node_arena()->used()); |
duke@435 | 605 | } |
duke@435 | 606 | |
duke@435 | 607 | //---------------------------do_all_blocks------------------------------------- |
duke@435 | 608 | void Parse::do_all_blocks() { |
never@802 | 609 | bool has_irreducible = flow()->has_irreducible_entry(); |
duke@435 | 610 | |
never@802 | 611 | // Walk over all blocks in Reverse Post-Order. |
never@802 | 612 | while (true) { |
never@802 | 613 | bool progress = false; |
never@802 | 614 | for (int rpo = 0; rpo < block_count(); rpo++) { |
never@802 | 615 | Block* block = rpo_at(rpo); |
duke@435 | 616 | |
never@802 | 617 | if (block->is_parsed()) continue; |
duke@435 | 618 | |
never@802 | 619 | if (!block->is_merged()) { |
never@802 | 620 | // Dead block, no state reaches this block |
never@802 | 621 | continue; |
never@802 | 622 | } |
duke@435 | 623 | |
never@802 | 624 | // Prepare to parse this block. |
never@802 | 625 | load_state_from(block); |
duke@435 | 626 | |
never@802 | 627 | if (stopped()) { |
never@802 | 628 | // Block is dead. |
never@802 | 629 | continue; |
duke@435 | 630 | } |
never@802 | 631 | |
never@802 | 632 | blocks_parsed++; |
never@802 | 633 | |
never@802 | 634 | progress = true; |
never@802 | 635 | if (block->is_loop_head() || block->is_handler() || has_irreducible && !block->is_ready()) { |
never@802 | 636 | // Not all preds have been parsed. We must build phis everywhere. |
never@802 | 637 | // (Note that dead locals do not get phis built, ever.) |
never@802 | 638 | ensure_phis_everywhere(); |
never@802 | 639 | |
kvn@2665 | 640 | if (block->is_SEL_head() && |
kvn@2877 | 641 | (UseLoopPredicate || LoopLimitCheck)) { |
kvn@2665 | 642 | // Add predicate to single entry (not irreducible) loop head. |
kvn@2665 | 643 | assert(!block->has_merged_backedge(), "only entry paths should be merged for now"); |
kvn@2665 | 644 | // Need correct bci for predicate. |
kvn@2665 | 645 | // It is fine to set it here since do_one_block() will set it anyway. |
kvn@2665 | 646 | set_parse_bci(block->start()); |
kvn@2665 | 647 | add_predicate(); |
kvn@2665 | 648 | // Add new region for back branches. |
kvn@2665 | 649 | int edges = block->pred_count() - block->preds_parsed() + 1; // +1 for original region |
kvn@2665 | 650 | RegionNode *r = new (C, edges+1) RegionNode(edges+1); |
kvn@2665 | 651 | _gvn.set_type(r, Type::CONTROL); |
kvn@2665 | 652 | record_for_igvn(r); |
kvn@2665 | 653 | r->init_req(edges, control()); |
kvn@2665 | 654 | set_control(r); |
kvn@2665 | 655 | // Add new phis. |
kvn@2665 | 656 | ensure_phis_everywhere(); |
kvn@2665 | 657 | } |
kvn@2665 | 658 | |
never@802 | 659 | // Leave behind an undisturbed copy of the map, for future merges. |
never@802 | 660 | set_map(clone_map()); |
never@802 | 661 | } |
never@802 | 662 | |
never@802 | 663 | if (control()->is_Region() && !block->is_loop_head() && !has_irreducible && !block->is_handler()) { |
never@802 | 664 | // In the absence of irreducible loops, the Region and Phis |
never@802 | 665 | // associated with a merge that doesn't involve a backedge can |
twisti@1040 | 666 | // be simplified now since the RPO parsing order guarantees |
never@802 | 667 | // that any path which was supposed to reach here has already |
never@802 | 668 | // been parsed or must be dead. |
never@802 | 669 | Node* c = control(); |
never@802 | 670 | Node* result = _gvn.transform_no_reclaim(control()); |
never@802 | 671 | if (c != result && TraceOptoParse) { |
never@802 | 672 | tty->print_cr("Block #%d replace %d with %d", block->rpo(), c->_idx, result->_idx); |
never@802 | 673 | } |
never@802 | 674 | if (result != top()) { |
never@802 | 675 | record_for_igvn(result); |
never@802 | 676 | } |
never@802 | 677 | } |
never@802 | 678 | |
never@802 | 679 | // Parse the block. |
never@802 | 680 | do_one_block(); |
never@802 | 681 | |
never@802 | 682 | // Check for bailouts. |
never@802 | 683 | if (failing()) return; |
never@802 | 684 | } |
never@802 | 685 | |
never@802 | 686 | // with irreducible loops multiple passes might be necessary to parse everything |
never@802 | 687 | if (!has_irreducible || !progress) { |
duke@435 | 688 | break; |
duke@435 | 689 | } |
never@802 | 690 | } |
duke@435 | 691 | |
never@802 | 692 | blocks_seen += block_count(); |
duke@435 | 693 | |
duke@435 | 694 | #ifndef PRODUCT |
duke@435 | 695 | // Make sure there are no half-processed blocks remaining. |
duke@435 | 696 | // Every remaining unprocessed block is dead and may be ignored now. |
never@802 | 697 | for (int rpo = 0; rpo < block_count(); rpo++) { |
never@802 | 698 | Block* block = rpo_at(rpo); |
duke@435 | 699 | if (!block->is_parsed()) { |
duke@435 | 700 | if (TraceOptoParse) { |
never@802 | 701 | tty->print_cr("Skipped dead block %d at bci:%d", rpo, block->start()); |
duke@435 | 702 | } |
never@802 | 703 | assert(!block->is_merged(), "no half-processed blocks"); |
duke@435 | 704 | } |
duke@435 | 705 | } |
duke@435 | 706 | #endif |
duke@435 | 707 | } |
duke@435 | 708 | |
duke@435 | 709 | //-------------------------------build_exits---------------------------------- |
duke@435 | 710 | // Build normal and exceptional exit merge points. |
duke@435 | 711 | void Parse::build_exits() { |
duke@435 | 712 | // make a clone of caller to prevent sharing of side-effects |
duke@435 | 713 | _exits.set_map(_exits.clone_map()); |
duke@435 | 714 | _exits.clean_stack(_exits.sp()); |
duke@435 | 715 | _exits.sync_jvms(); |
duke@435 | 716 | |
duke@435 | 717 | RegionNode* region = new (C, 1) RegionNode(1); |
duke@435 | 718 | record_for_igvn(region); |
duke@435 | 719 | gvn().set_type_bottom(region); |
duke@435 | 720 | _exits.set_control(region); |
duke@435 | 721 | |
duke@435 | 722 | // Note: iophi and memphi are not transformed until do_exits. |
duke@435 | 723 | Node* iophi = new (C, region->req()) PhiNode(region, Type::ABIO); |
duke@435 | 724 | Node* memphi = new (C, region->req()) PhiNode(region, Type::MEMORY, TypePtr::BOTTOM); |
duke@435 | 725 | _exits.set_i_o(iophi); |
duke@435 | 726 | _exits.set_all_memory(memphi); |
duke@435 | 727 | |
duke@435 | 728 | // Add a return value to the exit state. (Do not push it yet.) |
duke@435 | 729 | if (tf()->range()->cnt() > TypeFunc::Parms) { |
duke@435 | 730 | const Type* ret_type = tf()->range()->field_at(TypeFunc::Parms); |
duke@435 | 731 | // Don't "bind" an unloaded return klass to the ret_phi. If the klass |
duke@435 | 732 | // becomes loaded during the subsequent parsing, the loaded and unloaded |
duke@435 | 733 | // types will not join when we transform and push in do_exits(). |
duke@435 | 734 | const TypeOopPtr* ret_oop_type = ret_type->isa_oopptr(); |
duke@435 | 735 | if (ret_oop_type && !ret_oop_type->klass()->is_loaded()) { |
duke@435 | 736 | ret_type = TypeOopPtr::BOTTOM; |
duke@435 | 737 | } |
duke@435 | 738 | int ret_size = type2size[ret_type->basic_type()]; |
duke@435 | 739 | Node* ret_phi = new (C, region->req()) PhiNode(region, ret_type); |
duke@435 | 740 | _exits.ensure_stack(ret_size); |
duke@435 | 741 | assert((int)(tf()->range()->cnt() - TypeFunc::Parms) == ret_size, "good tf range"); |
duke@435 | 742 | assert(method()->return_type()->size() == ret_size, "tf agrees w/ method"); |
duke@435 | 743 | _exits.set_argument(0, ret_phi); // here is where the parser finds it |
duke@435 | 744 | // Note: ret_phi is not yet pushed, until do_exits. |
duke@435 | 745 | } |
duke@435 | 746 | } |
duke@435 | 747 | |
duke@435 | 748 | |
duke@435 | 749 | //----------------------------build_start_state------------------------------- |
duke@435 | 750 | // Construct a state which contains only the incoming arguments from an |
duke@435 | 751 | // unknown caller. The method & bci will be NULL & InvocationEntryBci. |
duke@435 | 752 | JVMState* Compile::build_start_state(StartNode* start, const TypeFunc* tf) { |
duke@435 | 753 | int arg_size = tf->domain()->cnt(); |
duke@435 | 754 | int max_size = MAX2(arg_size, (int)tf->range()->cnt()); |
duke@435 | 755 | JVMState* jvms = new (this) JVMState(max_size - TypeFunc::Parms); |
duke@435 | 756 | SafePointNode* map = new (this, max_size) SafePointNode(max_size, NULL); |
duke@435 | 757 | record_for_igvn(map); |
duke@435 | 758 | assert(arg_size == TypeFunc::Parms + (is_osr_compilation() ? 1 : method()->arg_size()), "correct arg_size"); |
duke@435 | 759 | Node_Notes* old_nn = default_node_notes(); |
duke@435 | 760 | if (old_nn != NULL && has_method()) { |
duke@435 | 761 | Node_Notes* entry_nn = old_nn->clone(this); |
duke@435 | 762 | JVMState* entry_jvms = new(this) JVMState(method(), old_nn->jvms()); |
duke@435 | 763 | entry_jvms->set_offsets(0); |
duke@435 | 764 | entry_jvms->set_bci(entry_bci()); |
duke@435 | 765 | entry_nn->set_jvms(entry_jvms); |
duke@435 | 766 | set_default_node_notes(entry_nn); |
duke@435 | 767 | } |
duke@435 | 768 | uint i; |
duke@435 | 769 | for (i = 0; i < (uint)arg_size; i++) { |
duke@435 | 770 | Node* parm = initial_gvn()->transform(new (this, 1) ParmNode(start, i)); |
duke@435 | 771 | map->init_req(i, parm); |
duke@435 | 772 | // Record all these guys for later GVN. |
duke@435 | 773 | record_for_igvn(parm); |
duke@435 | 774 | } |
duke@435 | 775 | for (; i < map->req(); i++) { |
duke@435 | 776 | map->init_req(i, top()); |
duke@435 | 777 | } |
duke@435 | 778 | assert(jvms->argoff() == TypeFunc::Parms, "parser gets arguments here"); |
duke@435 | 779 | set_default_node_notes(old_nn); |
duke@435 | 780 | map->set_jvms(jvms); |
duke@435 | 781 | jvms->set_map(map); |
duke@435 | 782 | return jvms; |
duke@435 | 783 | } |
duke@435 | 784 | |
duke@435 | 785 | //-----------------------------make_node_notes--------------------------------- |
duke@435 | 786 | Node_Notes* Parse::make_node_notes(Node_Notes* caller_nn) { |
duke@435 | 787 | if (caller_nn == NULL) return NULL; |
duke@435 | 788 | Node_Notes* nn = caller_nn->clone(C); |
duke@435 | 789 | JVMState* caller_jvms = nn->jvms(); |
duke@435 | 790 | JVMState* jvms = new (C) JVMState(method(), caller_jvms); |
duke@435 | 791 | jvms->set_offsets(0); |
duke@435 | 792 | jvms->set_bci(_entry_bci); |
duke@435 | 793 | nn->set_jvms(jvms); |
duke@435 | 794 | return nn; |
duke@435 | 795 | } |
duke@435 | 796 | |
duke@435 | 797 | |
duke@435 | 798 | //--------------------------return_values-------------------------------------- |
duke@435 | 799 | void Compile::return_values(JVMState* jvms) { |
duke@435 | 800 | GraphKit kit(jvms); |
duke@435 | 801 | Node* ret = new (this, TypeFunc::Parms) ReturnNode(TypeFunc::Parms, |
duke@435 | 802 | kit.control(), |
duke@435 | 803 | kit.i_o(), |
duke@435 | 804 | kit.reset_memory(), |
duke@435 | 805 | kit.frameptr(), |
duke@435 | 806 | kit.returnadr()); |
duke@435 | 807 | // Add zero or 1 return values |
duke@435 | 808 | int ret_size = tf()->range()->cnt() - TypeFunc::Parms; |
duke@435 | 809 | if (ret_size > 0) { |
duke@435 | 810 | kit.inc_sp(-ret_size); // pop the return value(s) |
duke@435 | 811 | kit.sync_jvms(); |
duke@435 | 812 | ret->add_req(kit.argument(0)); |
duke@435 | 813 | // Note: The second dummy edge is not needed by a ReturnNode. |
duke@435 | 814 | } |
duke@435 | 815 | // bind it to root |
duke@435 | 816 | root()->add_req(ret); |
duke@435 | 817 | record_for_igvn(ret); |
duke@435 | 818 | initial_gvn()->transform_no_reclaim(ret); |
duke@435 | 819 | } |
duke@435 | 820 | |
duke@435 | 821 | //------------------------rethrow_exceptions----------------------------------- |
duke@435 | 822 | // Bind all exception states in the list into a single RethrowNode. |
duke@435 | 823 | void Compile::rethrow_exceptions(JVMState* jvms) { |
duke@435 | 824 | GraphKit kit(jvms); |
duke@435 | 825 | if (!kit.has_exceptions()) return; // nothing to generate |
duke@435 | 826 | // Load my combined exception state into the kit, with all phis transformed: |
duke@435 | 827 | SafePointNode* ex_map = kit.combine_and_pop_all_exception_states(); |
duke@435 | 828 | Node* ex_oop = kit.use_exception_state(ex_map); |
duke@435 | 829 | RethrowNode* exit = new (this, TypeFunc::Parms + 1) RethrowNode(kit.control(), |
duke@435 | 830 | kit.i_o(), kit.reset_memory(), |
duke@435 | 831 | kit.frameptr(), kit.returnadr(), |
duke@435 | 832 | // like a return but with exception input |
duke@435 | 833 | ex_oop); |
duke@435 | 834 | // bind to root |
duke@435 | 835 | root()->add_req(exit); |
duke@435 | 836 | record_for_igvn(exit); |
duke@435 | 837 | initial_gvn()->transform_no_reclaim(exit); |
duke@435 | 838 | } |
duke@435 | 839 | |
duke@435 | 840 | //---------------------------do_exceptions------------------------------------- |
duke@435 | 841 | // Process exceptions arising from the current bytecode. |
duke@435 | 842 | // Send caught exceptions to the proper handler within this method. |
duke@435 | 843 | // Unhandled exceptions feed into _exit. |
duke@435 | 844 | void Parse::do_exceptions() { |
duke@435 | 845 | if (!has_exceptions()) return; |
duke@435 | 846 | |
duke@435 | 847 | if (failing()) { |
duke@435 | 848 | // Pop them all off and throw them away. |
duke@435 | 849 | while (pop_exception_state() != NULL) ; |
duke@435 | 850 | return; |
duke@435 | 851 | } |
duke@435 | 852 | |
duke@435 | 853 | PreserveJVMState pjvms(this, false); |
duke@435 | 854 | |
duke@435 | 855 | SafePointNode* ex_map; |
duke@435 | 856 | while ((ex_map = pop_exception_state()) != NULL) { |
duke@435 | 857 | if (!method()->has_exception_handlers()) { |
duke@435 | 858 | // Common case: Transfer control outward. |
duke@435 | 859 | // Doing it this early allows the exceptions to common up |
duke@435 | 860 | // even between adjacent method calls. |
duke@435 | 861 | throw_to_exit(ex_map); |
duke@435 | 862 | } else { |
duke@435 | 863 | // Have to look at the exception first. |
duke@435 | 864 | assert(stopped(), "catch_inline_exceptions trashes the map"); |
duke@435 | 865 | catch_inline_exceptions(ex_map); |
duke@435 | 866 | stop_and_kill_map(); // we used up this exception state; kill it |
duke@435 | 867 | } |
duke@435 | 868 | } |
duke@435 | 869 | |
duke@435 | 870 | // We now return to our regularly scheduled program: |
duke@435 | 871 | } |
duke@435 | 872 | |
duke@435 | 873 | //---------------------------throw_to_exit------------------------------------- |
duke@435 | 874 | // Merge the given map into an exception exit from this method. |
duke@435 | 875 | // The exception exit will handle any unlocking of receiver. |
duke@435 | 876 | // The ex_oop must be saved within the ex_map, unlike merge_exception. |
duke@435 | 877 | void Parse::throw_to_exit(SafePointNode* ex_map) { |
duke@435 | 878 | // Pop the JVMS to (a copy of) the caller. |
duke@435 | 879 | GraphKit caller; |
duke@435 | 880 | caller.set_map_clone(_caller->map()); |
duke@435 | 881 | caller.set_bci(_caller->bci()); |
duke@435 | 882 | caller.set_sp(_caller->sp()); |
duke@435 | 883 | // Copy out the standard machine state: |
duke@435 | 884 | for (uint i = 0; i < TypeFunc::Parms; i++) { |
duke@435 | 885 | caller.map()->set_req(i, ex_map->in(i)); |
duke@435 | 886 | } |
duke@435 | 887 | // ...and the exception: |
duke@435 | 888 | Node* ex_oop = saved_ex_oop(ex_map); |
duke@435 | 889 | SafePointNode* caller_ex_map = caller.make_exception_state(ex_oop); |
duke@435 | 890 | // Finally, collect the new exception state in my exits: |
duke@435 | 891 | _exits.add_exception_state(caller_ex_map); |
duke@435 | 892 | } |
duke@435 | 893 | |
duke@435 | 894 | //------------------------------do_exits--------------------------------------- |
duke@435 | 895 | void Parse::do_exits() { |
duke@435 | 896 | set_parse_bci(InvocationEntryBci); |
duke@435 | 897 | |
duke@435 | 898 | // Now peephole on the return bits |
duke@435 | 899 | Node* region = _exits.control(); |
duke@435 | 900 | _exits.set_control(gvn().transform(region)); |
duke@435 | 901 | |
duke@435 | 902 | Node* iophi = _exits.i_o(); |
duke@435 | 903 | _exits.set_i_o(gvn().transform(iophi)); |
duke@435 | 904 | |
duke@435 | 905 | if (wrote_final()) { |
duke@435 | 906 | // This method (which must be a constructor by the rules of Java) |
duke@435 | 907 | // wrote a final. The effects of all initializations must be |
duke@435 | 908 | // committed to memory before any code after the constructor |
duke@435 | 909 | // publishes the reference to the newly constructor object. |
duke@435 | 910 | // Rather than wait for the publication, we simply block the |
duke@435 | 911 | // writes here. Rather than put a barrier on only those writes |
duke@435 | 912 | // which are required to complete, we force all writes to complete. |
duke@435 | 913 | // |
duke@435 | 914 | // "All bets are off" unless the first publication occurs after a |
duke@435 | 915 | // normal return from the constructor. We do not attempt to detect |
duke@435 | 916 | // such unusual early publications. But no barrier is needed on |
duke@435 | 917 | // exceptional returns, since they cannot publish normally. |
duke@435 | 918 | // |
duke@435 | 919 | _exits.insert_mem_bar(Op_MemBarRelease); |
duke@435 | 920 | #ifndef PRODUCT |
duke@435 | 921 | if (PrintOpto && (Verbose || WizardMode)) { |
duke@435 | 922 | method()->print_name(); |
duke@435 | 923 | tty->print_cr(" writes finals and needs a memory barrier"); |
duke@435 | 924 | } |
duke@435 | 925 | #endif |
duke@435 | 926 | } |
duke@435 | 927 | |
duke@435 | 928 | for (MergeMemStream mms(_exits.merged_memory()); mms.next_non_empty(); ) { |
duke@435 | 929 | // transform each slice of the original memphi: |
duke@435 | 930 | mms.set_memory(_gvn.transform(mms.memory())); |
duke@435 | 931 | } |
duke@435 | 932 | |
duke@435 | 933 | if (tf()->range()->cnt() > TypeFunc::Parms) { |
duke@435 | 934 | const Type* ret_type = tf()->range()->field_at(TypeFunc::Parms); |
duke@435 | 935 | Node* ret_phi = _gvn.transform( _exits.argument(0) ); |
duke@435 | 936 | assert(_exits.control()->is_top() || !_gvn.type(ret_phi)->empty(), "return value must be well defined"); |
duke@435 | 937 | _exits.push_node(ret_type->basic_type(), ret_phi); |
duke@435 | 938 | } |
duke@435 | 939 | |
duke@435 | 940 | // Note: Logic for creating and optimizing the ReturnNode is in Compile. |
duke@435 | 941 | |
duke@435 | 942 | // Unlock along the exceptional paths. |
duke@435 | 943 | // This is done late so that we can common up equivalent exceptions |
duke@435 | 944 | // (e.g., null checks) arising from multiple points within this method. |
duke@435 | 945 | // See GraphKit::add_exception_state, which performs the commoning. |
duke@435 | 946 | bool do_synch = method()->is_synchronized() && GenerateSynchronizationCode; |
duke@435 | 947 | |
duke@435 | 948 | // record exit from a method if compiled while Dtrace is turned on. |
kvn@1215 | 949 | if (do_synch || C->env()->dtrace_method_probes()) { |
duke@435 | 950 | // First move the exception list out of _exits: |
duke@435 | 951 | GraphKit kit(_exits.transfer_exceptions_into_jvms()); |
duke@435 | 952 | SafePointNode* normal_map = kit.map(); // keep this guy safe |
duke@435 | 953 | // Now re-collect the exceptions into _exits: |
duke@435 | 954 | SafePointNode* ex_map; |
duke@435 | 955 | while ((ex_map = kit.pop_exception_state()) != NULL) { |
duke@435 | 956 | Node* ex_oop = kit.use_exception_state(ex_map); |
duke@435 | 957 | // Force the exiting JVM state to have this method at InvocationEntryBci. |
duke@435 | 958 | // The exiting JVM state is otherwise a copy of the calling JVMS. |
duke@435 | 959 | JVMState* caller = kit.jvms(); |
duke@435 | 960 | JVMState* ex_jvms = caller->clone_shallow(C); |
duke@435 | 961 | ex_jvms->set_map(kit.clone_map()); |
duke@435 | 962 | ex_jvms->map()->set_jvms(ex_jvms); |
duke@435 | 963 | ex_jvms->set_bci( InvocationEntryBci); |
duke@435 | 964 | kit.set_jvms(ex_jvms); |
duke@435 | 965 | if (do_synch) { |
duke@435 | 966 | // Add on the synchronized-method box/object combo |
duke@435 | 967 | kit.map()->push_monitor(_synch_lock); |
duke@435 | 968 | // Unlock! |
duke@435 | 969 | kit.shared_unlock(_synch_lock->box_node(), _synch_lock->obj_node()); |
duke@435 | 970 | } |
kvn@1215 | 971 | if (C->env()->dtrace_method_probes()) { |
duke@435 | 972 | kit.make_dtrace_method_exit(method()); |
duke@435 | 973 | } |
duke@435 | 974 | // Done with exception-path processing. |
duke@435 | 975 | ex_map = kit.make_exception_state(ex_oop); |
duke@435 | 976 | assert(ex_jvms->same_calls_as(ex_map->jvms()), "sanity"); |
duke@435 | 977 | // Pop the last vestige of this method: |
duke@435 | 978 | ex_map->set_jvms(caller->clone_shallow(C)); |
duke@435 | 979 | ex_map->jvms()->set_map(ex_map); |
duke@435 | 980 | _exits.push_exception_state(ex_map); |
duke@435 | 981 | } |
duke@435 | 982 | assert(_exits.map() == normal_map, "keep the same return state"); |
duke@435 | 983 | } |
duke@435 | 984 | |
duke@435 | 985 | { |
duke@435 | 986 | // Capture very early exceptions (receiver null checks) from caller JVMS |
duke@435 | 987 | GraphKit caller(_caller); |
duke@435 | 988 | SafePointNode* ex_map; |
duke@435 | 989 | while ((ex_map = caller.pop_exception_state()) != NULL) { |
duke@435 | 990 | _exits.add_exception_state(ex_map); |
duke@435 | 991 | } |
duke@435 | 992 | } |
duke@435 | 993 | } |
duke@435 | 994 | |
duke@435 | 995 | //-----------------------------create_entry_map------------------------------- |
duke@435 | 996 | // Initialize our parser map to contain the types at method entry. |
duke@435 | 997 | // For OSR, the map contains a single RawPtr parameter. |
duke@435 | 998 | // Initial monitor locking for sync. methods is performed by do_method_entry. |
duke@435 | 999 | SafePointNode* Parse::create_entry_map() { |
duke@435 | 1000 | // Check for really stupid bail-out cases. |
duke@435 | 1001 | uint len = TypeFunc::Parms + method()->max_locals() + method()->max_stack(); |
duke@435 | 1002 | if (len >= 32760) { |
duke@435 | 1003 | C->record_method_not_compilable_all_tiers("too many local variables"); |
duke@435 | 1004 | return NULL; |
duke@435 | 1005 | } |
duke@435 | 1006 | |
duke@435 | 1007 | // If this is an inlined method, we may have to do a receiver null check. |
duke@435 | 1008 | if (_caller->has_method() && is_normal_parse() && !method()->is_static()) { |
duke@435 | 1009 | GraphKit kit(_caller); |
duke@435 | 1010 | kit.null_check_receiver(method()); |
duke@435 | 1011 | _caller = kit.transfer_exceptions_into_jvms(); |
duke@435 | 1012 | if (kit.stopped()) { |
duke@435 | 1013 | _exits.add_exception_states_from(_caller); |
duke@435 | 1014 | _exits.set_jvms(_caller); |
duke@435 | 1015 | return NULL; |
duke@435 | 1016 | } |
duke@435 | 1017 | } |
duke@435 | 1018 | |
duke@435 | 1019 | assert(method() != NULL, "parser must have a method"); |
duke@435 | 1020 | |
duke@435 | 1021 | // Create an initial safepoint to hold JVM state during parsing |
duke@435 | 1022 | JVMState* jvms = new (C) JVMState(method(), _caller->has_method() ? _caller : NULL); |
duke@435 | 1023 | set_map(new (C, len) SafePointNode(len, jvms)); |
duke@435 | 1024 | jvms->set_map(map()); |
duke@435 | 1025 | record_for_igvn(map()); |
duke@435 | 1026 | assert(jvms->endoff() == len, "correct jvms sizing"); |
duke@435 | 1027 | |
duke@435 | 1028 | SafePointNode* inmap = _caller->map(); |
duke@435 | 1029 | assert(inmap != NULL, "must have inmap"); |
duke@435 | 1030 | |
duke@435 | 1031 | uint i; |
duke@435 | 1032 | |
duke@435 | 1033 | // Pass thru the predefined input parameters. |
duke@435 | 1034 | for (i = 0; i < TypeFunc::Parms; i++) { |
duke@435 | 1035 | map()->init_req(i, inmap->in(i)); |
duke@435 | 1036 | } |
duke@435 | 1037 | |
duke@435 | 1038 | if (depth() == 1) { |
duke@435 | 1039 | assert(map()->memory()->Opcode() == Op_Parm, ""); |
duke@435 | 1040 | // Insert the memory aliasing node |
duke@435 | 1041 | set_all_memory(reset_memory()); |
duke@435 | 1042 | } |
duke@435 | 1043 | assert(merged_memory(), ""); |
duke@435 | 1044 | |
duke@435 | 1045 | // Now add the locals which are initially bound to arguments: |
duke@435 | 1046 | uint arg_size = tf()->domain()->cnt(); |
duke@435 | 1047 | ensure_stack(arg_size - TypeFunc::Parms); // OSR methods have funny args |
duke@435 | 1048 | for (i = TypeFunc::Parms; i < arg_size; i++) { |
duke@435 | 1049 | map()->init_req(i, inmap->argument(_caller, i - TypeFunc::Parms)); |
duke@435 | 1050 | } |
duke@435 | 1051 | |
duke@435 | 1052 | // Clear out the rest of the map (locals and stack) |
duke@435 | 1053 | for (i = arg_size; i < len; i++) { |
duke@435 | 1054 | map()->init_req(i, top()); |
duke@435 | 1055 | } |
duke@435 | 1056 | |
duke@435 | 1057 | SafePointNode* entry_map = stop(); |
duke@435 | 1058 | return entry_map; |
duke@435 | 1059 | } |
duke@435 | 1060 | |
duke@435 | 1061 | //-----------------------------do_method_entry-------------------------------- |
duke@435 | 1062 | // Emit any code needed in the pseudo-block before BCI zero. |
duke@435 | 1063 | // The main thing to do is lock the receiver of a synchronized method. |
duke@435 | 1064 | void Parse::do_method_entry() { |
duke@435 | 1065 | set_parse_bci(InvocationEntryBci); // Pseudo-BCP |
duke@435 | 1066 | set_sp(0); // Java Stack Pointer |
duke@435 | 1067 | |
duke@435 | 1068 | NOT_PRODUCT( count_compiled_calls(true/*at_method_entry*/, false/*is_inline*/); ) |
duke@435 | 1069 | |
kvn@1215 | 1070 | if (C->env()->dtrace_method_probes()) { |
duke@435 | 1071 | make_dtrace_method_entry(method()); |
duke@435 | 1072 | } |
duke@435 | 1073 | |
duke@435 | 1074 | // If the method is synchronized, we need to construct a lock node, attach |
duke@435 | 1075 | // it to the Start node, and pin it there. |
duke@435 | 1076 | if (method()->is_synchronized()) { |
duke@435 | 1077 | // Insert a FastLockNode right after the Start which takes as arguments |
duke@435 | 1078 | // the current thread pointer, the "this" pointer & the address of the |
duke@435 | 1079 | // stack slot pair used for the lock. The "this" pointer is a projection |
duke@435 | 1080 | // off the start node, but the locking spot has to be constructed by |
duke@435 | 1081 | // creating a ConLNode of 0, and boxing it with a BoxLockNode. The BoxLockNode |
duke@435 | 1082 | // becomes the second argument to the FastLockNode call. The |
duke@435 | 1083 | // FastLockNode becomes the new control parent to pin it to the start. |
duke@435 | 1084 | |
duke@435 | 1085 | // Setup Object Pointer |
duke@435 | 1086 | Node *lock_obj = NULL; |
duke@435 | 1087 | if(method()->is_static()) { |
duke@435 | 1088 | ciInstance* mirror = _method->holder()->java_mirror(); |
duke@435 | 1089 | const TypeInstPtr *t_lock = TypeInstPtr::make(mirror); |
duke@435 | 1090 | lock_obj = makecon(t_lock); |
duke@435 | 1091 | } else { // Else pass the "this" pointer, |
duke@435 | 1092 | lock_obj = local(0); // which is Parm0 from StartNode |
duke@435 | 1093 | } |
duke@435 | 1094 | // Clear out dead values from the debug info. |
duke@435 | 1095 | kill_dead_locals(); |
duke@435 | 1096 | // Build the FastLockNode |
duke@435 | 1097 | _synch_lock = shared_lock(lock_obj); |
duke@435 | 1098 | } |
duke@435 | 1099 | |
duke@435 | 1100 | if (depth() == 1) { |
duke@435 | 1101 | increment_and_test_invocation_counter(Tier2CompileThreshold); |
duke@435 | 1102 | } |
duke@435 | 1103 | } |
duke@435 | 1104 | |
duke@435 | 1105 | //------------------------------init_blocks------------------------------------ |
duke@435 | 1106 | // Initialize our parser map to contain the types/monitors at method entry. |
duke@435 | 1107 | void Parse::init_blocks() { |
duke@435 | 1108 | // Create the blocks. |
duke@435 | 1109 | _block_count = flow()->block_count(); |
duke@435 | 1110 | _blocks = NEW_RESOURCE_ARRAY(Block, _block_count); |
duke@435 | 1111 | Copy::zero_to_bytes(_blocks, sizeof(Block)*_block_count); |
duke@435 | 1112 | |
never@802 | 1113 | int rpo; |
duke@435 | 1114 | |
duke@435 | 1115 | // Initialize the structs. |
never@802 | 1116 | for (rpo = 0; rpo < block_count(); rpo++) { |
never@802 | 1117 | Block* block = rpo_at(rpo); |
never@802 | 1118 | block->init_node(this, rpo); |
duke@435 | 1119 | } |
duke@435 | 1120 | |
duke@435 | 1121 | // Collect predecessor and successor information. |
never@802 | 1122 | for (rpo = 0; rpo < block_count(); rpo++) { |
never@802 | 1123 | Block* block = rpo_at(rpo); |
duke@435 | 1124 | block->init_graph(this); |
duke@435 | 1125 | } |
duke@435 | 1126 | } |
duke@435 | 1127 | |
duke@435 | 1128 | //-------------------------------init_node------------------------------------- |
never@802 | 1129 | void Parse::Block::init_node(Parse* outer, int rpo) { |
never@802 | 1130 | _flow = outer->flow()->rpo_at(rpo); |
duke@435 | 1131 | _pred_count = 0; |
duke@435 | 1132 | _preds_parsed = 0; |
duke@435 | 1133 | _count = 0; |
duke@435 | 1134 | assert(pred_count() == 0 && preds_parsed() == 0, "sanity"); |
kvn@2665 | 1135 | assert(!(is_merged() || is_parsed() || is_handler() || has_merged_backedge()), "sanity"); |
duke@435 | 1136 | assert(_live_locals.size() == 0, "sanity"); |
duke@435 | 1137 | |
duke@435 | 1138 | // entry point has additional predecessor |
duke@435 | 1139 | if (flow()->is_start()) _pred_count++; |
duke@435 | 1140 | assert(flow()->is_start() == (this == outer->start_block()), ""); |
duke@435 | 1141 | } |
duke@435 | 1142 | |
duke@435 | 1143 | //-------------------------------init_graph------------------------------------ |
duke@435 | 1144 | void Parse::Block::init_graph(Parse* outer) { |
duke@435 | 1145 | // Create the successor list for this parser block. |
duke@435 | 1146 | GrowableArray<ciTypeFlow::Block*>* tfs = flow()->successors(); |
duke@435 | 1147 | GrowableArray<ciTypeFlow::Block*>* tfe = flow()->exceptions(); |
duke@435 | 1148 | int ns = tfs->length(); |
duke@435 | 1149 | int ne = tfe->length(); |
duke@435 | 1150 | _num_successors = ns; |
duke@435 | 1151 | _all_successors = ns+ne; |
duke@435 | 1152 | _successors = (ns+ne == 0) ? NULL : NEW_RESOURCE_ARRAY(Block*, ns+ne); |
duke@435 | 1153 | int p = 0; |
duke@435 | 1154 | for (int i = 0; i < ns+ne; i++) { |
duke@435 | 1155 | ciTypeFlow::Block* tf2 = (i < ns) ? tfs->at(i) : tfe->at(i-ns); |
never@802 | 1156 | Block* block2 = outer->rpo_at(tf2->rpo()); |
duke@435 | 1157 | _successors[i] = block2; |
duke@435 | 1158 | |
duke@435 | 1159 | // Accumulate pred info for the other block, too. |
duke@435 | 1160 | if (i < ns) { |
duke@435 | 1161 | block2->_pred_count++; |
duke@435 | 1162 | } else { |
duke@435 | 1163 | block2->_is_handler = true; |
duke@435 | 1164 | } |
duke@435 | 1165 | |
duke@435 | 1166 | #ifdef ASSERT |
duke@435 | 1167 | // A block's successors must be distinguishable by BCI. |
duke@435 | 1168 | // That is, no bytecode is allowed to branch to two different |
duke@435 | 1169 | // clones of the same code location. |
duke@435 | 1170 | for (int j = 0; j < i; j++) { |
duke@435 | 1171 | Block* block1 = _successors[j]; |
duke@435 | 1172 | if (block1 == block2) continue; // duplicates are OK |
duke@435 | 1173 | assert(block1->start() != block2->start(), "successors have unique bcis"); |
duke@435 | 1174 | } |
duke@435 | 1175 | #endif |
duke@435 | 1176 | } |
duke@435 | 1177 | |
duke@435 | 1178 | // Note: We never call next_path_num along exception paths, so they |
duke@435 | 1179 | // never get processed as "ready". Also, the input phis of exception |
duke@435 | 1180 | // handlers get specially processed, so that |
duke@435 | 1181 | } |
duke@435 | 1182 | |
duke@435 | 1183 | //---------------------------successor_for_bci--------------------------------- |
duke@435 | 1184 | Parse::Block* Parse::Block::successor_for_bci(int bci) { |
duke@435 | 1185 | for (int i = 0; i < all_successors(); i++) { |
duke@435 | 1186 | Block* block2 = successor_at(i); |
duke@435 | 1187 | if (block2->start() == bci) return block2; |
duke@435 | 1188 | } |
duke@435 | 1189 | // We can actually reach here if ciTypeFlow traps out a block |
duke@435 | 1190 | // due to an unloaded class, and concurrently with compilation the |
duke@435 | 1191 | // class is then loaded, so that a later phase of the parser is |
duke@435 | 1192 | // able to see more of the bytecode CFG. Or, the flow pass and |
duke@435 | 1193 | // the parser can have a minor difference of opinion about executability |
duke@435 | 1194 | // of bytecodes. For example, "obj.field = null" is executable even |
duke@435 | 1195 | // if the field's type is an unloaded class; the flow pass used to |
duke@435 | 1196 | // make a trap for such code. |
duke@435 | 1197 | return NULL; |
duke@435 | 1198 | } |
duke@435 | 1199 | |
duke@435 | 1200 | |
duke@435 | 1201 | //-----------------------------stack_type_at----------------------------------- |
duke@435 | 1202 | const Type* Parse::Block::stack_type_at(int i) const { |
duke@435 | 1203 | return get_type(flow()->stack_type_at(i)); |
duke@435 | 1204 | } |
duke@435 | 1205 | |
duke@435 | 1206 | |
duke@435 | 1207 | //-----------------------------local_type_at----------------------------------- |
duke@435 | 1208 | const Type* Parse::Block::local_type_at(int i) const { |
duke@435 | 1209 | // Make dead locals fall to bottom. |
duke@435 | 1210 | if (_live_locals.size() == 0) { |
duke@435 | 1211 | MethodLivenessResult live_locals = flow()->outer()->method()->liveness_at_bci(start()); |
duke@435 | 1212 | // This bitmap can be zero length if we saw a breakpoint. |
duke@435 | 1213 | // In such cases, pretend they are all live. |
duke@435 | 1214 | ((Block*)this)->_live_locals = live_locals; |
duke@435 | 1215 | } |
duke@435 | 1216 | if (_live_locals.size() > 0 && !_live_locals.at(i)) |
duke@435 | 1217 | return Type::BOTTOM; |
duke@435 | 1218 | |
duke@435 | 1219 | return get_type(flow()->local_type_at(i)); |
duke@435 | 1220 | } |
duke@435 | 1221 | |
duke@435 | 1222 | |
duke@435 | 1223 | #ifndef PRODUCT |
duke@435 | 1224 | |
duke@435 | 1225 | //----------------------------name_for_bc-------------------------------------- |
duke@435 | 1226 | // helper method for BytecodeParseHistogram |
duke@435 | 1227 | static const char* name_for_bc(int i) { |
duke@435 | 1228 | return Bytecodes::is_defined(i) ? Bytecodes::name(Bytecodes::cast(i)) : "xxxunusedxxx"; |
duke@435 | 1229 | } |
duke@435 | 1230 | |
duke@435 | 1231 | //----------------------------BytecodeParseHistogram------------------------------------ |
duke@435 | 1232 | Parse::BytecodeParseHistogram::BytecodeParseHistogram(Parse *p, Compile *c) { |
duke@435 | 1233 | _parser = p; |
duke@435 | 1234 | _compiler = c; |
duke@435 | 1235 | if( ! _initialized ) { _initialized = true; reset(); } |
duke@435 | 1236 | } |
duke@435 | 1237 | |
duke@435 | 1238 | //----------------------------current_count------------------------------------ |
duke@435 | 1239 | int Parse::BytecodeParseHistogram::current_count(BPHType bph_type) { |
duke@435 | 1240 | switch( bph_type ) { |
duke@435 | 1241 | case BPH_transforms: { return _parser->gvn().made_progress(); } |
duke@435 | 1242 | case BPH_values: { return _parser->gvn().made_new_values(); } |
duke@435 | 1243 | default: { ShouldNotReachHere(); return 0; } |
duke@435 | 1244 | } |
duke@435 | 1245 | } |
duke@435 | 1246 | |
duke@435 | 1247 | //----------------------------initialized-------------------------------------- |
duke@435 | 1248 | bool Parse::BytecodeParseHistogram::initialized() { return _initialized; } |
duke@435 | 1249 | |
duke@435 | 1250 | //----------------------------reset-------------------------------------------- |
duke@435 | 1251 | void Parse::BytecodeParseHistogram::reset() { |
duke@435 | 1252 | int i = Bytecodes::number_of_codes; |
duke@435 | 1253 | while (i-- > 0) { _bytecodes_parsed[i] = 0; _nodes_constructed[i] = 0; _nodes_transformed[i] = 0; _new_values[i] = 0; } |
duke@435 | 1254 | } |
duke@435 | 1255 | |
duke@435 | 1256 | //----------------------------set_initial_state-------------------------------- |
duke@435 | 1257 | // Record info when starting to parse one bytecode |
duke@435 | 1258 | void Parse::BytecodeParseHistogram::set_initial_state( Bytecodes::Code bc ) { |
duke@435 | 1259 | if( PrintParseStatistics && !_parser->is_osr_parse() ) { |
duke@435 | 1260 | _initial_bytecode = bc; |
duke@435 | 1261 | _initial_node_count = _compiler->unique(); |
duke@435 | 1262 | _initial_transforms = current_count(BPH_transforms); |
duke@435 | 1263 | _initial_values = current_count(BPH_values); |
duke@435 | 1264 | } |
duke@435 | 1265 | } |
duke@435 | 1266 | |
duke@435 | 1267 | //----------------------------record_change-------------------------------- |
duke@435 | 1268 | // Record results of parsing one bytecode |
duke@435 | 1269 | void Parse::BytecodeParseHistogram::record_change() { |
duke@435 | 1270 | if( PrintParseStatistics && !_parser->is_osr_parse() ) { |
duke@435 | 1271 | ++_bytecodes_parsed[_initial_bytecode]; |
duke@435 | 1272 | _nodes_constructed [_initial_bytecode] += (_compiler->unique() - _initial_node_count); |
duke@435 | 1273 | _nodes_transformed [_initial_bytecode] += (current_count(BPH_transforms) - _initial_transforms); |
duke@435 | 1274 | _new_values [_initial_bytecode] += (current_count(BPH_values) - _initial_values); |
duke@435 | 1275 | } |
duke@435 | 1276 | } |
duke@435 | 1277 | |
duke@435 | 1278 | |
duke@435 | 1279 | //----------------------------print-------------------------------------------- |
duke@435 | 1280 | void Parse::BytecodeParseHistogram::print(float cutoff) { |
duke@435 | 1281 | ResourceMark rm; |
duke@435 | 1282 | // print profile |
duke@435 | 1283 | int total = 0; |
duke@435 | 1284 | int i = 0; |
duke@435 | 1285 | for( i = 0; i < Bytecodes::number_of_codes; ++i ) { total += _bytecodes_parsed[i]; } |
duke@435 | 1286 | int abs_sum = 0; |
duke@435 | 1287 | tty->cr(); //0123456789012345678901234567890123456789012345678901234567890123456789 |
duke@435 | 1288 | tty->print_cr("Histogram of %d parsed bytecodes:", total); |
duke@435 | 1289 | if( total == 0 ) { return; } |
duke@435 | 1290 | tty->cr(); |
duke@435 | 1291 | tty->print_cr("absolute: count of compiled bytecodes of this type"); |
duke@435 | 1292 | tty->print_cr("relative: percentage contribution to compiled nodes"); |
duke@435 | 1293 | tty->print_cr("nodes : Average number of nodes constructed per bytecode"); |
duke@435 | 1294 | tty->print_cr("rnodes : Significance towards total nodes constructed, (nodes*relative)"); |
duke@435 | 1295 | tty->print_cr("transforms: Average amount of tranform progress per bytecode compiled"); |
duke@435 | 1296 | tty->print_cr("values : Average number of node values improved per bytecode"); |
duke@435 | 1297 | tty->print_cr("name : Bytecode name"); |
duke@435 | 1298 | tty->cr(); |
duke@435 | 1299 | tty->print_cr(" absolute relative nodes rnodes transforms values name"); |
duke@435 | 1300 | tty->print_cr("----------------------------------------------------------------------"); |
duke@435 | 1301 | while (--i > 0) { |
duke@435 | 1302 | int abs = _bytecodes_parsed[i]; |
duke@435 | 1303 | float rel = abs * 100.0F / total; |
duke@435 | 1304 | float nodes = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _nodes_constructed[i])/_bytecodes_parsed[i]; |
duke@435 | 1305 | float rnodes = _bytecodes_parsed[i] == 0 ? 0 : rel * nodes; |
duke@435 | 1306 | float xforms = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _nodes_transformed[i])/_bytecodes_parsed[i]; |
duke@435 | 1307 | float values = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _new_values [i])/_bytecodes_parsed[i]; |
duke@435 | 1308 | if (cutoff <= rel) { |
duke@435 | 1309 | tty->print_cr("%10d %7.2f%% %6.1f %6.2f %6.1f %6.1f %s", abs, rel, nodes, rnodes, xforms, values, name_for_bc(i)); |
duke@435 | 1310 | abs_sum += abs; |
duke@435 | 1311 | } |
duke@435 | 1312 | } |
duke@435 | 1313 | tty->print_cr("----------------------------------------------------------------------"); |
duke@435 | 1314 | float rel_sum = abs_sum * 100.0F / total; |
duke@435 | 1315 | tty->print_cr("%10d %7.2f%% (cutoff = %.2f%%)", abs_sum, rel_sum, cutoff); |
duke@435 | 1316 | tty->print_cr("----------------------------------------------------------------------"); |
duke@435 | 1317 | tty->cr(); |
duke@435 | 1318 | } |
duke@435 | 1319 | #endif |
duke@435 | 1320 | |
duke@435 | 1321 | //----------------------------load_state_from---------------------------------- |
duke@435 | 1322 | // Load block/map/sp. But not do not touch iter/bci. |
duke@435 | 1323 | void Parse::load_state_from(Block* block) { |
duke@435 | 1324 | set_block(block); |
duke@435 | 1325 | // load the block's JVM state: |
duke@435 | 1326 | set_map(block->start_map()); |
duke@435 | 1327 | set_sp( block->start_sp()); |
duke@435 | 1328 | } |
duke@435 | 1329 | |
duke@435 | 1330 | |
duke@435 | 1331 | //-----------------------------record_state------------------------------------ |
duke@435 | 1332 | void Parse::Block::record_state(Parse* p) { |
duke@435 | 1333 | assert(!is_merged(), "can only record state once, on 1st inflow"); |
duke@435 | 1334 | assert(start_sp() == p->sp(), "stack pointer must agree with ciTypeFlow"); |
duke@435 | 1335 | set_start_map(p->stop()); |
duke@435 | 1336 | } |
duke@435 | 1337 | |
duke@435 | 1338 | |
duke@435 | 1339 | //------------------------------do_one_block----------------------------------- |
duke@435 | 1340 | void Parse::do_one_block() { |
duke@435 | 1341 | if (TraceOptoParse) { |
duke@435 | 1342 | Block *b = block(); |
duke@435 | 1343 | int ns = b->num_successors(); |
duke@435 | 1344 | int nt = b->all_successors(); |
duke@435 | 1345 | |
duke@435 | 1346 | tty->print("Parsing block #%d at bci [%d,%d), successors: ", |
never@802 | 1347 | block()->rpo(), block()->start(), block()->limit()); |
duke@435 | 1348 | for (int i = 0; i < nt; i++) { |
never@802 | 1349 | tty->print((( i < ns) ? " %d" : " %d(e)"), b->successor_at(i)->rpo()); |
duke@435 | 1350 | } |
never@802 | 1351 | if (b->is_loop_head()) tty->print(" lphd"); |
duke@435 | 1352 | tty->print_cr(""); |
duke@435 | 1353 | } |
duke@435 | 1354 | |
duke@435 | 1355 | assert(block()->is_merged(), "must be merged before being parsed"); |
duke@435 | 1356 | block()->mark_parsed(); |
duke@435 | 1357 | ++_blocks_parsed; |
duke@435 | 1358 | |
duke@435 | 1359 | // Set iterator to start of block. |
duke@435 | 1360 | iter().reset_to_bci(block()->start()); |
duke@435 | 1361 | |
duke@435 | 1362 | CompileLog* log = C->log(); |
duke@435 | 1363 | |
duke@435 | 1364 | // Parse bytecodes |
duke@435 | 1365 | while (!stopped() && !failing()) { |
duke@435 | 1366 | iter().next(); |
duke@435 | 1367 | |
duke@435 | 1368 | // Learn the current bci from the iterator: |
duke@435 | 1369 | set_parse_bci(iter().cur_bci()); |
duke@435 | 1370 | |
duke@435 | 1371 | if (bci() == block()->limit()) { |
duke@435 | 1372 | // Do not walk into the next block until directed by do_all_blocks. |
duke@435 | 1373 | merge(bci()); |
duke@435 | 1374 | break; |
duke@435 | 1375 | } |
duke@435 | 1376 | assert(bci() < block()->limit(), "bci still in block"); |
duke@435 | 1377 | |
duke@435 | 1378 | if (log != NULL) { |
duke@435 | 1379 | // Output an optional context marker, to help place actions |
duke@435 | 1380 | // that occur during parsing of this BC. If there is no log |
duke@435 | 1381 | // output until the next context string, this context string |
duke@435 | 1382 | // will be silently ignored. |
duke@435 | 1383 | log->context()->reset(); |
duke@435 | 1384 | log->context()->print_cr("<bc code='%d' bci='%d'/>", (int)bc(), bci()); |
duke@435 | 1385 | } |
duke@435 | 1386 | |
duke@435 | 1387 | if (block()->has_trap_at(bci())) { |
duke@435 | 1388 | // We must respect the flow pass's traps, because it will refuse |
duke@435 | 1389 | // to produce successors for trapping blocks. |
duke@435 | 1390 | int trap_index = block()->flow()->trap_index(); |
duke@435 | 1391 | assert(trap_index != 0, "trap index must be valid"); |
duke@435 | 1392 | uncommon_trap(trap_index); |
duke@435 | 1393 | break; |
duke@435 | 1394 | } |
duke@435 | 1395 | |
duke@435 | 1396 | NOT_PRODUCT( parse_histogram()->set_initial_state(bc()); ); |
duke@435 | 1397 | |
duke@435 | 1398 | #ifdef ASSERT |
duke@435 | 1399 | int pre_bc_sp = sp(); |
duke@435 | 1400 | int inputs, depth; |
twisti@3969 | 1401 | bool have_se = !stopped() && compute_stack_effects(inputs, depth, /*for_parse*/ true); |
kvn@3971 | 1402 | assert(!have_se || pre_bc_sp >= inputs, err_msg_res("have enough stack to execute this BC: pre_bc_sp=%d, inputs=%d", pre_bc_sp, inputs)); |
duke@435 | 1403 | #endif //ASSERT |
duke@435 | 1404 | |
duke@435 | 1405 | do_one_bytecode(); |
duke@435 | 1406 | |
duke@435 | 1407 | assert(!have_se || stopped() || failing() || (sp() - pre_bc_sp) == depth, "correct depth prediction"); |
duke@435 | 1408 | |
duke@435 | 1409 | do_exceptions(); |
duke@435 | 1410 | |
duke@435 | 1411 | NOT_PRODUCT( parse_histogram()->record_change(); ); |
duke@435 | 1412 | |
duke@435 | 1413 | if (log != NULL) log->context()->reset(); // done w/ this one |
duke@435 | 1414 | |
duke@435 | 1415 | // Fall into next bytecode. Each bytecode normally has 1 sequential |
duke@435 | 1416 | // successor which is typically made ready by visiting this bytecode. |
duke@435 | 1417 | // If the successor has several predecessors, then it is a merge |
duke@435 | 1418 | // point, starts a new basic block, and is handled like other basic blocks. |
duke@435 | 1419 | } |
duke@435 | 1420 | } |
duke@435 | 1421 | |
duke@435 | 1422 | |
duke@435 | 1423 | //------------------------------merge------------------------------------------ |
duke@435 | 1424 | void Parse::set_parse_bci(int bci) { |
duke@435 | 1425 | set_bci(bci); |
duke@435 | 1426 | Node_Notes* nn = C->default_node_notes(); |
duke@435 | 1427 | if (nn == NULL) return; |
duke@435 | 1428 | |
duke@435 | 1429 | // Collect debug info for inlined calls unless -XX:-DebugInlinedCalls. |
duke@435 | 1430 | if (!DebugInlinedCalls && depth() > 1) { |
duke@435 | 1431 | return; |
duke@435 | 1432 | } |
duke@435 | 1433 | |
duke@435 | 1434 | // Update the JVMS annotation, if present. |
duke@435 | 1435 | JVMState* jvms = nn->jvms(); |
duke@435 | 1436 | if (jvms != NULL && jvms->bci() != bci) { |
duke@435 | 1437 | // Update the JVMS. |
duke@435 | 1438 | jvms = jvms->clone_shallow(C); |
duke@435 | 1439 | jvms->set_bci(bci); |
duke@435 | 1440 | nn->set_jvms(jvms); |
duke@435 | 1441 | } |
duke@435 | 1442 | } |
duke@435 | 1443 | |
duke@435 | 1444 | //------------------------------merge------------------------------------------ |
duke@435 | 1445 | // Merge the current mapping into the basic block starting at bci |
duke@435 | 1446 | void Parse::merge(int target_bci) { |
duke@435 | 1447 | Block* target = successor_for_bci(target_bci); |
duke@435 | 1448 | if (target == NULL) { handle_missing_successor(target_bci); return; } |
duke@435 | 1449 | assert(!target->is_ready(), "our arrival must be expected"); |
duke@435 | 1450 | int pnum = target->next_path_num(); |
duke@435 | 1451 | merge_common(target, pnum); |
duke@435 | 1452 | } |
duke@435 | 1453 | |
duke@435 | 1454 | //-------------------------merge_new_path-------------------------------------- |
duke@435 | 1455 | // Merge the current mapping into the basic block, using a new path |
duke@435 | 1456 | void Parse::merge_new_path(int target_bci) { |
duke@435 | 1457 | Block* target = successor_for_bci(target_bci); |
duke@435 | 1458 | if (target == NULL) { handle_missing_successor(target_bci); return; } |
duke@435 | 1459 | assert(!target->is_ready(), "new path into frozen graph"); |
duke@435 | 1460 | int pnum = target->add_new_path(); |
duke@435 | 1461 | merge_common(target, pnum); |
duke@435 | 1462 | } |
duke@435 | 1463 | |
duke@435 | 1464 | //-------------------------merge_exception------------------------------------- |
duke@435 | 1465 | // Merge the current mapping into the basic block starting at bci |
duke@435 | 1466 | // The ex_oop must be pushed on the stack, unlike throw_to_exit. |
duke@435 | 1467 | void Parse::merge_exception(int target_bci) { |
duke@435 | 1468 | assert(sp() == 1, "must have only the throw exception on the stack"); |
duke@435 | 1469 | Block* target = successor_for_bci(target_bci); |
duke@435 | 1470 | if (target == NULL) { handle_missing_successor(target_bci); return; } |
duke@435 | 1471 | assert(target->is_handler(), "exceptions are handled by special blocks"); |
duke@435 | 1472 | int pnum = target->add_new_path(); |
duke@435 | 1473 | merge_common(target, pnum); |
duke@435 | 1474 | } |
duke@435 | 1475 | |
duke@435 | 1476 | //--------------------handle_missing_successor--------------------------------- |
duke@435 | 1477 | void Parse::handle_missing_successor(int target_bci) { |
duke@435 | 1478 | #ifndef PRODUCT |
duke@435 | 1479 | Block* b = block(); |
duke@435 | 1480 | int trap_bci = b->flow()->has_trap()? b->flow()->trap_bci(): -1; |
never@802 | 1481 | tty->print_cr("### Missing successor at bci:%d for block #%d (trap_bci:%d)", target_bci, b->rpo(), trap_bci); |
duke@435 | 1482 | #endif |
duke@435 | 1483 | ShouldNotReachHere(); |
duke@435 | 1484 | } |
duke@435 | 1485 | |
duke@435 | 1486 | //--------------------------merge_common--------------------------------------- |
duke@435 | 1487 | void Parse::merge_common(Parse::Block* target, int pnum) { |
duke@435 | 1488 | if (TraceOptoParse) { |
never@802 | 1489 | tty->print("Merging state at block #%d bci:%d", target->rpo(), target->start()); |
duke@435 | 1490 | } |
duke@435 | 1491 | |
duke@435 | 1492 | // Zap extra stack slots to top |
duke@435 | 1493 | assert(sp() == target->start_sp(), ""); |
duke@435 | 1494 | clean_stack(sp()); |
duke@435 | 1495 | |
duke@435 | 1496 | if (!target->is_merged()) { // No prior mapping at this bci |
duke@435 | 1497 | if (TraceOptoParse) { tty->print(" with empty state"); } |
duke@435 | 1498 | |
duke@435 | 1499 | // If this path is dead, do not bother capturing it as a merge. |
duke@435 | 1500 | // It is "as if" we had 1 fewer predecessors from the beginning. |
duke@435 | 1501 | if (stopped()) { |
duke@435 | 1502 | if (TraceOptoParse) tty->print_cr(", but path is dead and doesn't count"); |
duke@435 | 1503 | return; |
duke@435 | 1504 | } |
duke@435 | 1505 | |
duke@435 | 1506 | // Record that a new block has been merged. |
duke@435 | 1507 | ++_blocks_merged; |
duke@435 | 1508 | |
duke@435 | 1509 | // Make a region if we know there are multiple or unpredictable inputs. |
duke@435 | 1510 | // (Also, if this is a plain fall-through, we might see another region, |
duke@435 | 1511 | // which must not be allowed into this block's map.) |
duke@435 | 1512 | if (pnum > PhiNode::Input // Known multiple inputs. |
duke@435 | 1513 | || target->is_handler() // These have unpredictable inputs. |
never@802 | 1514 | || target->is_loop_head() // Known multiple inputs |
duke@435 | 1515 | || control()->is_Region()) { // We must hide this guy. |
kvn@2665 | 1516 | |
kvn@2665 | 1517 | int current_bci = bci(); |
kvn@2665 | 1518 | set_parse_bci(target->start()); // Set target bci |
kvn@2665 | 1519 | if (target->is_SEL_head()) { |
kvn@2665 | 1520 | DEBUG_ONLY( target->mark_merged_backedge(block()); ) |
kvn@2665 | 1521 | if (target->start() == 0) { |
kvn@2665 | 1522 | // Add loop predicate for the special case when |
kvn@2665 | 1523 | // there are backbranches to the method entry. |
kvn@2665 | 1524 | add_predicate(); |
kvn@2665 | 1525 | } |
kvn@2665 | 1526 | } |
duke@435 | 1527 | // Add a Region to start the new basic block. Phis will be added |
duke@435 | 1528 | // later lazily. |
duke@435 | 1529 | int edges = target->pred_count(); |
duke@435 | 1530 | if (edges < pnum) edges = pnum; // might be a new path! |
kvn@2665 | 1531 | RegionNode *r = new (C, edges+1) RegionNode(edges+1); |
duke@435 | 1532 | gvn().set_type(r, Type::CONTROL); |
duke@435 | 1533 | record_for_igvn(r); |
duke@435 | 1534 | // zap all inputs to NULL for debugging (done in Node(uint) constructor) |
duke@435 | 1535 | // for (int j = 1; j < edges+1; j++) { r->init_req(j, NULL); } |
duke@435 | 1536 | r->init_req(pnum, control()); |
duke@435 | 1537 | set_control(r); |
kvn@2665 | 1538 | set_parse_bci(current_bci); // Restore bci |
duke@435 | 1539 | } |
duke@435 | 1540 | |
duke@435 | 1541 | // Convert the existing Parser mapping into a mapping at this bci. |
duke@435 | 1542 | store_state_to(target); |
duke@435 | 1543 | assert(target->is_merged(), "do not come here twice"); |
duke@435 | 1544 | |
duke@435 | 1545 | } else { // Prior mapping at this bci |
duke@435 | 1546 | if (TraceOptoParse) { tty->print(" with previous state"); } |
kvn@2665 | 1547 | #ifdef ASSERT |
kvn@2665 | 1548 | if (target->is_SEL_head()) { |
kvn@2665 | 1549 | target->mark_merged_backedge(block()); |
kvn@2665 | 1550 | } |
kvn@2665 | 1551 | #endif |
duke@435 | 1552 | // We must not manufacture more phis if the target is already parsed. |
duke@435 | 1553 | bool nophi = target->is_parsed(); |
duke@435 | 1554 | |
duke@435 | 1555 | SafePointNode* newin = map();// Hang on to incoming mapping |
duke@435 | 1556 | Block* save_block = block(); // Hang on to incoming block; |
duke@435 | 1557 | load_state_from(target); // Get prior mapping |
duke@435 | 1558 | |
duke@435 | 1559 | assert(newin->jvms()->locoff() == jvms()->locoff(), "JVMS layouts agree"); |
duke@435 | 1560 | assert(newin->jvms()->stkoff() == jvms()->stkoff(), "JVMS layouts agree"); |
duke@435 | 1561 | assert(newin->jvms()->monoff() == jvms()->monoff(), "JVMS layouts agree"); |
duke@435 | 1562 | assert(newin->jvms()->endoff() == jvms()->endoff(), "JVMS layouts agree"); |
duke@435 | 1563 | |
duke@435 | 1564 | // Iterate over my current mapping and the old mapping. |
duke@435 | 1565 | // Where different, insert Phi functions. |
duke@435 | 1566 | // Use any existing Phi functions. |
duke@435 | 1567 | assert(control()->is_Region(), "must be merging to a region"); |
duke@435 | 1568 | RegionNode* r = control()->as_Region(); |
duke@435 | 1569 | |
duke@435 | 1570 | // Compute where to merge into |
duke@435 | 1571 | // Merge incoming control path |
never@802 | 1572 | r->init_req(pnum, newin->control()); |
duke@435 | 1573 | |
duke@435 | 1574 | if (pnum == 1) { // Last merge for this Region? |
never@802 | 1575 | if (!block()->flow()->is_irreducible_entry()) { |
never@802 | 1576 | Node* result = _gvn.transform_no_reclaim(r); |
never@802 | 1577 | if (r != result && TraceOptoParse) { |
never@802 | 1578 | tty->print_cr("Block #%d replace %d with %d", block()->rpo(), r->_idx, result->_idx); |
never@802 | 1579 | } |
never@802 | 1580 | } |
duke@435 | 1581 | record_for_igvn(r); |
duke@435 | 1582 | } |
duke@435 | 1583 | |
duke@435 | 1584 | // Update all the non-control inputs to map: |
duke@435 | 1585 | assert(TypeFunc::Parms == newin->jvms()->locoff(), "parser map should contain only youngest jvms"); |
never@802 | 1586 | bool check_elide_phi = target->is_SEL_backedge(save_block); |
duke@435 | 1587 | for (uint j = 1; j < newin->req(); j++) { |
duke@435 | 1588 | Node* m = map()->in(j); // Current state of target. |
duke@435 | 1589 | Node* n = newin->in(j); // Incoming change to target state. |
duke@435 | 1590 | PhiNode* phi; |
duke@435 | 1591 | if (m->is_Phi() && m->as_Phi()->region() == r) |
duke@435 | 1592 | phi = m->as_Phi(); |
duke@435 | 1593 | else |
duke@435 | 1594 | phi = NULL; |
duke@435 | 1595 | if (m != n) { // Different; must merge |
duke@435 | 1596 | switch (j) { |
duke@435 | 1597 | // Frame pointer and Return Address never changes |
duke@435 | 1598 | case TypeFunc::FramePtr:// Drop m, use the original value |
duke@435 | 1599 | case TypeFunc::ReturnAdr: |
duke@435 | 1600 | break; |
duke@435 | 1601 | case TypeFunc::Memory: // Merge inputs to the MergeMem node |
duke@435 | 1602 | assert(phi == NULL, "the merge contains phis, not vice versa"); |
duke@435 | 1603 | merge_memory_edges(n->as_MergeMem(), pnum, nophi); |
duke@435 | 1604 | continue; |
duke@435 | 1605 | default: // All normal stuff |
never@802 | 1606 | if (phi == NULL) { |
kvn@3419 | 1607 | const JVMState* jvms = map()->jvms(); |
kvn@3419 | 1608 | if (EliminateNestedLocks && |
kvn@3419 | 1609 | jvms->is_mon(j) && jvms->is_monitor_box(j)) { |
kvn@3419 | 1610 | // BoxLock nodes are not commoning. |
kvn@3419 | 1611 | // Use old BoxLock node as merged box. |
kvn@3419 | 1612 | assert(newin->jvms()->is_monitor_box(j), "sanity"); |
kvn@3419 | 1613 | // This assert also tests that nodes are BoxLock. |
kvn@3419 | 1614 | assert(BoxLockNode::same_slot(n, m), "sanity"); |
kvn@3419 | 1615 | C->gvn_replace_by(n, m); |
kvn@3419 | 1616 | } else if (!check_elide_phi || !target->can_elide_SEL_phi(j)) { |
never@802 | 1617 | phi = ensure_phi(j, nophi); |
never@802 | 1618 | } |
never@802 | 1619 | } |
duke@435 | 1620 | break; |
duke@435 | 1621 | } |
duke@435 | 1622 | } |
duke@435 | 1623 | // At this point, n might be top if: |
duke@435 | 1624 | // - there is no phi (because TypeFlow detected a conflict), or |
duke@435 | 1625 | // - the corresponding control edges is top (a dead incoming path) |
duke@435 | 1626 | // It is a bug if we create a phi which sees a garbage value on a live path. |
duke@435 | 1627 | |
duke@435 | 1628 | if (phi != NULL) { |
duke@435 | 1629 | assert(n != top() || r->in(pnum) == top(), "live value must not be garbage"); |
duke@435 | 1630 | assert(phi->region() == r, ""); |
duke@435 | 1631 | phi->set_req(pnum, n); // Then add 'n' to the merge |
duke@435 | 1632 | if (pnum == PhiNode::Input) { |
duke@435 | 1633 | // Last merge for this Phi. |
duke@435 | 1634 | // So far, Phis have had a reasonable type from ciTypeFlow. |
duke@435 | 1635 | // Now _gvn will join that with the meet of current inputs. |
duke@435 | 1636 | // BOTTOM is never permissible here, 'cause pessimistically |
duke@435 | 1637 | // Phis of pointers cannot lose the basic pointer type. |
duke@435 | 1638 | debug_only(const Type* bt1 = phi->bottom_type()); |
duke@435 | 1639 | assert(bt1 != Type::BOTTOM, "should not be building conflict phis"); |
duke@435 | 1640 | map()->set_req(j, _gvn.transform_no_reclaim(phi)); |
duke@435 | 1641 | debug_only(const Type* bt2 = phi->bottom_type()); |
duke@435 | 1642 | assert(bt2->higher_equal(bt1), "must be consistent with type-flow"); |
duke@435 | 1643 | record_for_igvn(phi); |
duke@435 | 1644 | } |
duke@435 | 1645 | } |
duke@435 | 1646 | } // End of for all values to be merged |
duke@435 | 1647 | |
duke@435 | 1648 | if (pnum == PhiNode::Input && |
duke@435 | 1649 | !r->in(0)) { // The occasional useless Region |
duke@435 | 1650 | assert(control() == r, ""); |
duke@435 | 1651 | set_control(r->nonnull_req()); |
duke@435 | 1652 | } |
duke@435 | 1653 | |
duke@435 | 1654 | // newin has been subsumed into the lazy merge, and is now dead. |
duke@435 | 1655 | set_block(save_block); |
duke@435 | 1656 | |
duke@435 | 1657 | stop(); // done with this guy, for now |
duke@435 | 1658 | } |
duke@435 | 1659 | |
duke@435 | 1660 | if (TraceOptoParse) { |
duke@435 | 1661 | tty->print_cr(" on path %d", pnum); |
duke@435 | 1662 | } |
duke@435 | 1663 | |
duke@435 | 1664 | // Done with this parser state. |
duke@435 | 1665 | assert(stopped(), ""); |
duke@435 | 1666 | } |
duke@435 | 1667 | |
duke@435 | 1668 | |
duke@435 | 1669 | //--------------------------merge_memory_edges--------------------------------- |
duke@435 | 1670 | void Parse::merge_memory_edges(MergeMemNode* n, int pnum, bool nophi) { |
duke@435 | 1671 | // (nophi means we must not create phis, because we already parsed here) |
duke@435 | 1672 | assert(n != NULL, ""); |
duke@435 | 1673 | // Merge the inputs to the MergeMems |
duke@435 | 1674 | MergeMemNode* m = merged_memory(); |
duke@435 | 1675 | |
duke@435 | 1676 | assert(control()->is_Region(), "must be merging to a region"); |
duke@435 | 1677 | RegionNode* r = control()->as_Region(); |
duke@435 | 1678 | |
duke@435 | 1679 | PhiNode* base = NULL; |
duke@435 | 1680 | MergeMemNode* remerge = NULL; |
duke@435 | 1681 | for (MergeMemStream mms(m, n); mms.next_non_empty2(); ) { |
duke@435 | 1682 | Node *p = mms.force_memory(); |
duke@435 | 1683 | Node *q = mms.memory2(); |
duke@435 | 1684 | if (mms.is_empty() && nophi) { |
duke@435 | 1685 | // Trouble: No new splits allowed after a loop body is parsed. |
duke@435 | 1686 | // Instead, wire the new split into a MergeMem on the backedge. |
duke@435 | 1687 | // The optimizer will sort it out, slicing the phi. |
duke@435 | 1688 | if (remerge == NULL) { |
duke@435 | 1689 | assert(base != NULL, ""); |
duke@435 | 1690 | assert(base->in(0) != NULL, "should not be xformed away"); |
duke@435 | 1691 | remerge = MergeMemNode::make(C, base->in(pnum)); |
duke@435 | 1692 | gvn().set_type(remerge, Type::MEMORY); |
duke@435 | 1693 | base->set_req(pnum, remerge); |
duke@435 | 1694 | } |
duke@435 | 1695 | remerge->set_memory_at(mms.alias_idx(), q); |
duke@435 | 1696 | continue; |
duke@435 | 1697 | } |
duke@435 | 1698 | assert(!q->is_MergeMem(), ""); |
duke@435 | 1699 | PhiNode* phi; |
duke@435 | 1700 | if (p != q) { |
duke@435 | 1701 | phi = ensure_memory_phi(mms.alias_idx(), nophi); |
duke@435 | 1702 | } else { |
duke@435 | 1703 | if (p->is_Phi() && p->as_Phi()->region() == r) |
duke@435 | 1704 | phi = p->as_Phi(); |
duke@435 | 1705 | else |
duke@435 | 1706 | phi = NULL; |
duke@435 | 1707 | } |
duke@435 | 1708 | // Insert q into local phi |
duke@435 | 1709 | if (phi != NULL) { |
duke@435 | 1710 | assert(phi->region() == r, ""); |
duke@435 | 1711 | p = phi; |
duke@435 | 1712 | phi->set_req(pnum, q); |
duke@435 | 1713 | if (mms.at_base_memory()) { |
duke@435 | 1714 | base = phi; // delay transforming it |
duke@435 | 1715 | } else if (pnum == 1) { |
duke@435 | 1716 | record_for_igvn(phi); |
duke@435 | 1717 | p = _gvn.transform_no_reclaim(phi); |
duke@435 | 1718 | } |
duke@435 | 1719 | mms.set_memory(p);// store back through the iterator |
duke@435 | 1720 | } |
duke@435 | 1721 | } |
duke@435 | 1722 | // Transform base last, in case we must fiddle with remerging. |
duke@435 | 1723 | if (base != NULL && pnum == 1) { |
duke@435 | 1724 | record_for_igvn(base); |
duke@435 | 1725 | m->set_base_memory( _gvn.transform_no_reclaim(base) ); |
duke@435 | 1726 | } |
duke@435 | 1727 | } |
duke@435 | 1728 | |
duke@435 | 1729 | |
duke@435 | 1730 | //------------------------ensure_phis_everywhere------------------------------- |
duke@435 | 1731 | void Parse::ensure_phis_everywhere() { |
duke@435 | 1732 | ensure_phi(TypeFunc::I_O); |
duke@435 | 1733 | |
duke@435 | 1734 | // Ensure a phi on all currently known memories. |
duke@435 | 1735 | for (MergeMemStream mms(merged_memory()); mms.next_non_empty(); ) { |
duke@435 | 1736 | ensure_memory_phi(mms.alias_idx()); |
duke@435 | 1737 | debug_only(mms.set_memory()); // keep the iterator happy |
duke@435 | 1738 | } |
duke@435 | 1739 | |
duke@435 | 1740 | // Note: This is our only chance to create phis for memory slices. |
duke@435 | 1741 | // If we miss a slice that crops up later, it will have to be |
duke@435 | 1742 | // merged into the base-memory phi that we are building here. |
duke@435 | 1743 | // Later, the optimizer will comb out the knot, and build separate |
duke@435 | 1744 | // phi-loops for each memory slice that matters. |
duke@435 | 1745 | |
duke@435 | 1746 | // Monitors must nest nicely and not get confused amongst themselves. |
duke@435 | 1747 | // Phi-ify everything up to the monitors, though. |
duke@435 | 1748 | uint monoff = map()->jvms()->monoff(); |
duke@435 | 1749 | uint nof_monitors = map()->jvms()->nof_monitors(); |
duke@435 | 1750 | |
duke@435 | 1751 | assert(TypeFunc::Parms == map()->jvms()->locoff(), "parser map should contain only youngest jvms"); |
never@802 | 1752 | bool check_elide_phi = block()->is_SEL_head(); |
duke@435 | 1753 | for (uint i = TypeFunc::Parms; i < monoff; i++) { |
never@802 | 1754 | if (!check_elide_phi || !block()->can_elide_SEL_phi(i)) { |
never@802 | 1755 | ensure_phi(i); |
never@802 | 1756 | } |
duke@435 | 1757 | } |
never@802 | 1758 | |
duke@435 | 1759 | // Even monitors need Phis, though they are well-structured. |
duke@435 | 1760 | // This is true for OSR methods, and also for the rare cases where |
duke@435 | 1761 | // a monitor object is the subject of a replace_in_map operation. |
duke@435 | 1762 | // See bugs 4426707 and 5043395. |
duke@435 | 1763 | for (uint m = 0; m < nof_monitors; m++) { |
duke@435 | 1764 | ensure_phi(map()->jvms()->monitor_obj_offset(m)); |
duke@435 | 1765 | } |
duke@435 | 1766 | } |
duke@435 | 1767 | |
duke@435 | 1768 | |
duke@435 | 1769 | //-----------------------------add_new_path------------------------------------ |
duke@435 | 1770 | // Add a previously unaccounted predecessor to this block. |
duke@435 | 1771 | int Parse::Block::add_new_path() { |
duke@435 | 1772 | // If there is no map, return the lowest unused path number. |
duke@435 | 1773 | if (!is_merged()) return pred_count()+1; // there will be a map shortly |
duke@435 | 1774 | |
duke@435 | 1775 | SafePointNode* map = start_map(); |
duke@435 | 1776 | if (!map->control()->is_Region()) |
duke@435 | 1777 | return pred_count()+1; // there may be a region some day |
duke@435 | 1778 | RegionNode* r = map->control()->as_Region(); |
duke@435 | 1779 | |
duke@435 | 1780 | // Add new path to the region. |
duke@435 | 1781 | uint pnum = r->req(); |
duke@435 | 1782 | r->add_req(NULL); |
duke@435 | 1783 | |
duke@435 | 1784 | for (uint i = 1; i < map->req(); i++) { |
duke@435 | 1785 | Node* n = map->in(i); |
duke@435 | 1786 | if (i == TypeFunc::Memory) { |
duke@435 | 1787 | // Ensure a phi on all currently known memories. |
duke@435 | 1788 | for (MergeMemStream mms(n->as_MergeMem()); mms.next_non_empty(); ) { |
duke@435 | 1789 | Node* phi = mms.memory(); |
duke@435 | 1790 | if (phi->is_Phi() && phi->as_Phi()->region() == r) { |
duke@435 | 1791 | assert(phi->req() == pnum, "must be same size as region"); |
duke@435 | 1792 | phi->add_req(NULL); |
duke@435 | 1793 | } |
duke@435 | 1794 | } |
duke@435 | 1795 | } else { |
duke@435 | 1796 | if (n->is_Phi() && n->as_Phi()->region() == r) { |
duke@435 | 1797 | assert(n->req() == pnum, "must be same size as region"); |
duke@435 | 1798 | n->add_req(NULL); |
duke@435 | 1799 | } |
duke@435 | 1800 | } |
duke@435 | 1801 | } |
duke@435 | 1802 | |
duke@435 | 1803 | return pnum; |
duke@435 | 1804 | } |
duke@435 | 1805 | |
duke@435 | 1806 | //------------------------------ensure_phi------------------------------------- |
duke@435 | 1807 | // Turn the idx'th entry of the current map into a Phi |
duke@435 | 1808 | PhiNode *Parse::ensure_phi(int idx, bool nocreate) { |
duke@435 | 1809 | SafePointNode* map = this->map(); |
duke@435 | 1810 | Node* region = map->control(); |
duke@435 | 1811 | assert(region->is_Region(), ""); |
duke@435 | 1812 | |
duke@435 | 1813 | Node* o = map->in(idx); |
duke@435 | 1814 | assert(o != NULL, ""); |
duke@435 | 1815 | |
duke@435 | 1816 | if (o == top()) return NULL; // TOP always merges into TOP |
duke@435 | 1817 | |
duke@435 | 1818 | if (o->is_Phi() && o->as_Phi()->region() == region) { |
duke@435 | 1819 | return o->as_Phi(); |
duke@435 | 1820 | } |
duke@435 | 1821 | |
duke@435 | 1822 | // Now use a Phi here for merging |
duke@435 | 1823 | assert(!nocreate, "Cannot build a phi for a block already parsed."); |
duke@435 | 1824 | const JVMState* jvms = map->jvms(); |
duke@435 | 1825 | const Type* t; |
duke@435 | 1826 | if (jvms->is_loc(idx)) { |
duke@435 | 1827 | t = block()->local_type_at(idx - jvms->locoff()); |
duke@435 | 1828 | } else if (jvms->is_stk(idx)) { |
duke@435 | 1829 | t = block()->stack_type_at(idx - jvms->stkoff()); |
duke@435 | 1830 | } else if (jvms->is_mon(idx)) { |
kvn@3419 | 1831 | assert(!jvms->is_monitor_box(idx), "no phis for boxes"); |
kvn@3419 | 1832 | t = TypeInstPtr::BOTTOM; // this is sufficient for a lock object |
duke@435 | 1833 | } else if ((uint)idx < TypeFunc::Parms) { |
duke@435 | 1834 | t = o->bottom_type(); // Type::RETURN_ADDRESS or such-like. |
duke@435 | 1835 | } else { |
duke@435 | 1836 | assert(false, "no type information for this phi"); |
duke@435 | 1837 | } |
duke@435 | 1838 | |
duke@435 | 1839 | // If the type falls to bottom, then this must be a local that |
duke@435 | 1840 | // is mixing ints and oops or some such. Forcing it to top |
duke@435 | 1841 | // makes it go dead. |
duke@435 | 1842 | if (t == Type::BOTTOM) { |
duke@435 | 1843 | map->set_req(idx, top()); |
duke@435 | 1844 | return NULL; |
duke@435 | 1845 | } |
duke@435 | 1846 | |
duke@435 | 1847 | // Do not create phis for top either. |
duke@435 | 1848 | // A top on a non-null control flow must be an unused even after the.phi. |
duke@435 | 1849 | if (t == Type::TOP || t == Type::HALF) { |
duke@435 | 1850 | map->set_req(idx, top()); |
duke@435 | 1851 | return NULL; |
duke@435 | 1852 | } |
duke@435 | 1853 | |
duke@435 | 1854 | PhiNode* phi = PhiNode::make(region, o, t); |
duke@435 | 1855 | gvn().set_type(phi, t); |
kvn@473 | 1856 | if (C->do_escape_analysis()) record_for_igvn(phi); |
duke@435 | 1857 | map->set_req(idx, phi); |
duke@435 | 1858 | return phi; |
duke@435 | 1859 | } |
duke@435 | 1860 | |
duke@435 | 1861 | //--------------------------ensure_memory_phi---------------------------------- |
duke@435 | 1862 | // Turn the idx'th slice of the current memory into a Phi |
duke@435 | 1863 | PhiNode *Parse::ensure_memory_phi(int idx, bool nocreate) { |
duke@435 | 1864 | MergeMemNode* mem = merged_memory(); |
duke@435 | 1865 | Node* region = control(); |
duke@435 | 1866 | assert(region->is_Region(), ""); |
duke@435 | 1867 | |
duke@435 | 1868 | Node *o = (idx == Compile::AliasIdxBot)? mem->base_memory(): mem->memory_at(idx); |
duke@435 | 1869 | assert(o != NULL && o != top(), ""); |
duke@435 | 1870 | |
duke@435 | 1871 | PhiNode* phi; |
duke@435 | 1872 | if (o->is_Phi() && o->as_Phi()->region() == region) { |
duke@435 | 1873 | phi = o->as_Phi(); |
duke@435 | 1874 | if (phi == mem->base_memory() && idx >= Compile::AliasIdxRaw) { |
duke@435 | 1875 | // clone the shared base memory phi to make a new memory split |
duke@435 | 1876 | assert(!nocreate, "Cannot build a phi for a block already parsed."); |
duke@435 | 1877 | const Type* t = phi->bottom_type(); |
duke@435 | 1878 | const TypePtr* adr_type = C->get_adr_type(idx); |
duke@435 | 1879 | phi = phi->slice_memory(adr_type); |
duke@435 | 1880 | gvn().set_type(phi, t); |
duke@435 | 1881 | } |
duke@435 | 1882 | return phi; |
duke@435 | 1883 | } |
duke@435 | 1884 | |
duke@435 | 1885 | // Now use a Phi here for merging |
duke@435 | 1886 | assert(!nocreate, "Cannot build a phi for a block already parsed."); |
duke@435 | 1887 | const Type* t = o->bottom_type(); |
duke@435 | 1888 | const TypePtr* adr_type = C->get_adr_type(idx); |
duke@435 | 1889 | phi = PhiNode::make(region, o, t, adr_type); |
duke@435 | 1890 | gvn().set_type(phi, t); |
duke@435 | 1891 | if (idx == Compile::AliasIdxBot) |
duke@435 | 1892 | mem->set_base_memory(phi); |
duke@435 | 1893 | else |
duke@435 | 1894 | mem->set_memory_at(idx, phi); |
duke@435 | 1895 | return phi; |
duke@435 | 1896 | } |
duke@435 | 1897 | |
duke@435 | 1898 | //------------------------------call_register_finalizer----------------------- |
duke@435 | 1899 | // Check the klass of the receiver and call register_finalizer if the |
duke@435 | 1900 | // class need finalization. |
duke@435 | 1901 | void Parse::call_register_finalizer() { |
duke@435 | 1902 | Node* receiver = local(0); |
duke@435 | 1903 | assert(receiver != NULL && receiver->bottom_type()->isa_instptr() != NULL, |
duke@435 | 1904 | "must have non-null instance type"); |
duke@435 | 1905 | |
duke@435 | 1906 | const TypeInstPtr *tinst = receiver->bottom_type()->isa_instptr(); |
duke@435 | 1907 | if (tinst != NULL && tinst->klass()->is_loaded() && !tinst->klass_is_exact()) { |
duke@435 | 1908 | // The type isn't known exactly so see if CHA tells us anything. |
duke@435 | 1909 | ciInstanceKlass* ik = tinst->klass()->as_instance_klass(); |
duke@435 | 1910 | if (!Dependencies::has_finalizable_subclass(ik)) { |
duke@435 | 1911 | // No finalizable subclasses so skip the dynamic check. |
duke@435 | 1912 | C->dependencies()->assert_has_no_finalizable_subclasses(ik); |
duke@435 | 1913 | return; |
duke@435 | 1914 | } |
duke@435 | 1915 | } |
duke@435 | 1916 | |
duke@435 | 1917 | // Insert a dynamic test for whether the instance needs |
duke@435 | 1918 | // finalization. In general this will fold up since the concrete |
duke@435 | 1919 | // class is often visible so the access flags are constant. |
duke@435 | 1920 | Node* klass_addr = basic_plus_adr( receiver, receiver, oopDesc::klass_offset_in_bytes() ); |
kvn@599 | 1921 | Node* klass = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), klass_addr, TypeInstPtr::KLASS) ); |
duke@435 | 1922 | |
stefank@3391 | 1923 | Node* access_flags_addr = basic_plus_adr(klass, klass, in_bytes(Klass::access_flags_offset())); |
duke@435 | 1924 | Node* access_flags = make_load(NULL, access_flags_addr, TypeInt::INT, T_INT); |
duke@435 | 1925 | |
duke@435 | 1926 | Node* mask = _gvn.transform(new (C, 3) AndINode(access_flags, intcon(JVM_ACC_HAS_FINALIZER))); |
duke@435 | 1927 | Node* check = _gvn.transform(new (C, 3) CmpINode(mask, intcon(0))); |
duke@435 | 1928 | Node* test = _gvn.transform(new (C, 2) BoolNode(check, BoolTest::ne)); |
duke@435 | 1929 | |
duke@435 | 1930 | IfNode* iff = create_and_map_if(control(), test, PROB_MAX, COUNT_UNKNOWN); |
duke@435 | 1931 | |
duke@435 | 1932 | RegionNode* result_rgn = new (C, 3) RegionNode(3); |
duke@435 | 1933 | record_for_igvn(result_rgn); |
duke@435 | 1934 | |
duke@435 | 1935 | Node *skip_register = _gvn.transform(new (C, 1) IfFalseNode(iff)); |
duke@435 | 1936 | result_rgn->init_req(1, skip_register); |
duke@435 | 1937 | |
duke@435 | 1938 | Node *needs_register = _gvn.transform(new (C, 1) IfTrueNode(iff)); |
duke@435 | 1939 | set_control(needs_register); |
duke@435 | 1940 | if (stopped()) { |
duke@435 | 1941 | // There is no slow path. |
duke@435 | 1942 | result_rgn->init_req(2, top()); |
duke@435 | 1943 | } else { |
duke@435 | 1944 | Node *call = make_runtime_call(RC_NO_LEAF, |
duke@435 | 1945 | OptoRuntime::register_finalizer_Type(), |
duke@435 | 1946 | OptoRuntime::register_finalizer_Java(), |
duke@435 | 1947 | NULL, TypePtr::BOTTOM, |
duke@435 | 1948 | receiver); |
duke@435 | 1949 | make_slow_call_ex(call, env()->Throwable_klass(), true); |
duke@435 | 1950 | |
duke@435 | 1951 | Node* fast_io = call->in(TypeFunc::I_O); |
duke@435 | 1952 | Node* fast_mem = call->in(TypeFunc::Memory); |
duke@435 | 1953 | // These two phis are pre-filled with copies of of the fast IO and Memory |
duke@435 | 1954 | Node* io_phi = PhiNode::make(result_rgn, fast_io, Type::ABIO); |
duke@435 | 1955 | Node* mem_phi = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM); |
duke@435 | 1956 | |
duke@435 | 1957 | result_rgn->init_req(2, control()); |
duke@435 | 1958 | io_phi ->init_req(2, i_o()); |
duke@435 | 1959 | mem_phi ->init_req(2, reset_memory()); |
duke@435 | 1960 | |
duke@435 | 1961 | set_all_memory( _gvn.transform(mem_phi) ); |
duke@435 | 1962 | set_i_o( _gvn.transform(io_phi) ); |
duke@435 | 1963 | } |
duke@435 | 1964 | |
duke@435 | 1965 | set_control( _gvn.transform(result_rgn) ); |
duke@435 | 1966 | } |
duke@435 | 1967 | |
duke@435 | 1968 | //------------------------------return_current--------------------------------- |
duke@435 | 1969 | // Append current _map to _exit_return |
duke@435 | 1970 | void Parse::return_current(Node* value) { |
duke@435 | 1971 | if (RegisterFinalizersAtInit && |
duke@435 | 1972 | method()->intrinsic_id() == vmIntrinsics::_Object_init) { |
duke@435 | 1973 | call_register_finalizer(); |
duke@435 | 1974 | } |
duke@435 | 1975 | |
duke@435 | 1976 | // Do not set_parse_bci, so that return goo is credited to the return insn. |
duke@435 | 1977 | set_bci(InvocationEntryBci); |
duke@435 | 1978 | if (method()->is_synchronized() && GenerateSynchronizationCode) { |
duke@435 | 1979 | shared_unlock(_synch_lock->box_node(), _synch_lock->obj_node()); |
duke@435 | 1980 | } |
kvn@1215 | 1981 | if (C->env()->dtrace_method_probes()) { |
duke@435 | 1982 | make_dtrace_method_exit(method()); |
duke@435 | 1983 | } |
duke@435 | 1984 | SafePointNode* exit_return = _exits.map(); |
duke@435 | 1985 | exit_return->in( TypeFunc::Control )->add_req( control() ); |
duke@435 | 1986 | exit_return->in( TypeFunc::I_O )->add_req( i_o () ); |
duke@435 | 1987 | Node *mem = exit_return->in( TypeFunc::Memory ); |
duke@435 | 1988 | for (MergeMemStream mms(mem->as_MergeMem(), merged_memory()); mms.next_non_empty2(); ) { |
duke@435 | 1989 | if (mms.is_empty()) { |
duke@435 | 1990 | // get a copy of the base memory, and patch just this one input |
duke@435 | 1991 | const TypePtr* adr_type = mms.adr_type(C); |
duke@435 | 1992 | Node* phi = mms.force_memory()->as_Phi()->slice_memory(adr_type); |
duke@435 | 1993 | assert(phi->as_Phi()->region() == mms.base_memory()->in(0), ""); |
duke@435 | 1994 | gvn().set_type_bottom(phi); |
duke@435 | 1995 | phi->del_req(phi->req()-1); // prepare to re-patch |
duke@435 | 1996 | mms.set_memory(phi); |
duke@435 | 1997 | } |
duke@435 | 1998 | mms.memory()->add_req(mms.memory2()); |
duke@435 | 1999 | } |
duke@435 | 2000 | |
duke@435 | 2001 | // frame pointer is always same, already captured |
duke@435 | 2002 | if (value != NULL) { |
duke@435 | 2003 | // If returning oops to an interface-return, there is a silent free |
duke@435 | 2004 | // cast from oop to interface allowed by the Verifier. Make it explicit |
duke@435 | 2005 | // here. |
duke@435 | 2006 | Node* phi = _exits.argument(0); |
duke@435 | 2007 | const TypeInstPtr *tr = phi->bottom_type()->isa_instptr(); |
duke@435 | 2008 | if( tr && tr->klass()->is_loaded() && |
duke@435 | 2009 | tr->klass()->is_interface() ) { |
duke@435 | 2010 | const TypeInstPtr *tp = value->bottom_type()->isa_instptr(); |
duke@435 | 2011 | if (tp && tp->klass()->is_loaded() && |
duke@435 | 2012 | !tp->klass()->is_interface()) { |
duke@435 | 2013 | // sharpen the type eagerly; this eases certain assert checking |
duke@435 | 2014 | if (tp->higher_equal(TypeInstPtr::NOTNULL)) |
duke@435 | 2015 | tr = tr->join(TypeInstPtr::NOTNULL)->is_instptr(); |
duke@435 | 2016 | value = _gvn.transform(new (C, 2) CheckCastPPNode(0,value,tr)); |
duke@435 | 2017 | } |
duke@435 | 2018 | } |
duke@435 | 2019 | phi->add_req(value); |
duke@435 | 2020 | } |
duke@435 | 2021 | |
duke@435 | 2022 | stop_and_kill_map(); // This CFG path dies here |
duke@435 | 2023 | } |
duke@435 | 2024 | |
duke@435 | 2025 | |
duke@435 | 2026 | //------------------------------add_safepoint---------------------------------- |
duke@435 | 2027 | void Parse::add_safepoint() { |
duke@435 | 2028 | // See if we can avoid this safepoint. No need for a SafePoint immediately |
duke@435 | 2029 | // after a Call (except Leaf Call) or another SafePoint. |
duke@435 | 2030 | Node *proj = control(); |
duke@435 | 2031 | bool add_poll_param = SafePointNode::needs_polling_address_input(); |
duke@435 | 2032 | uint parms = add_poll_param ? TypeFunc::Parms+1 : TypeFunc::Parms; |
duke@435 | 2033 | if( proj->is_Proj() ) { |
duke@435 | 2034 | Node *n0 = proj->in(0); |
duke@435 | 2035 | if( n0->is_Catch() ) { |
duke@435 | 2036 | n0 = n0->in(0)->in(0); |
duke@435 | 2037 | assert( n0->is_Call(), "expect a call here" ); |
duke@435 | 2038 | } |
duke@435 | 2039 | if( n0->is_Call() ) { |
duke@435 | 2040 | if( n0->as_Call()->guaranteed_safepoint() ) |
duke@435 | 2041 | return; |
duke@435 | 2042 | } else if( n0->is_SafePoint() && n0->req() >= parms ) { |
duke@435 | 2043 | return; |
duke@435 | 2044 | } |
duke@435 | 2045 | } |
duke@435 | 2046 | |
duke@435 | 2047 | // Clear out dead values from the debug info. |
duke@435 | 2048 | kill_dead_locals(); |
duke@435 | 2049 | |
duke@435 | 2050 | // Clone the JVM State |
duke@435 | 2051 | SafePointNode *sfpnt = new (C, parms) SafePointNode(parms, NULL); |
duke@435 | 2052 | |
duke@435 | 2053 | // Capture memory state BEFORE a SafePoint. Since we can block at a |
duke@435 | 2054 | // SafePoint we need our GC state to be safe; i.e. we need all our current |
duke@435 | 2055 | // write barriers (card marks) to not float down after the SafePoint so we |
duke@435 | 2056 | // must read raw memory. Likewise we need all oop stores to match the card |
duke@435 | 2057 | // marks. If deopt can happen, we need ALL stores (we need the correct JVM |
duke@435 | 2058 | // state on a deopt). |
duke@435 | 2059 | |
duke@435 | 2060 | // We do not need to WRITE the memory state after a SafePoint. The control |
duke@435 | 2061 | // edge will keep card-marks and oop-stores from floating up from below a |
duke@435 | 2062 | // SafePoint and our true dependency added here will keep them from floating |
duke@435 | 2063 | // down below a SafePoint. |
duke@435 | 2064 | |
duke@435 | 2065 | // Clone the current memory state |
duke@435 | 2066 | Node* mem = MergeMemNode::make(C, map()->memory()); |
duke@435 | 2067 | |
duke@435 | 2068 | mem = _gvn.transform(mem); |
duke@435 | 2069 | |
duke@435 | 2070 | // Pass control through the safepoint |
duke@435 | 2071 | sfpnt->init_req(TypeFunc::Control , control()); |
duke@435 | 2072 | // Fix edges normally used by a call |
duke@435 | 2073 | sfpnt->init_req(TypeFunc::I_O , top() ); |
duke@435 | 2074 | sfpnt->init_req(TypeFunc::Memory , mem ); |
duke@435 | 2075 | sfpnt->init_req(TypeFunc::ReturnAdr, top() ); |
duke@435 | 2076 | sfpnt->init_req(TypeFunc::FramePtr , top() ); |
duke@435 | 2077 | |
duke@435 | 2078 | // Create a node for the polling address |
duke@435 | 2079 | if( add_poll_param ) { |
duke@435 | 2080 | Node *polladr = ConPNode::make(C, (address)os::get_polling_page()); |
duke@435 | 2081 | sfpnt->init_req(TypeFunc::Parms+0, _gvn.transform(polladr)); |
duke@435 | 2082 | } |
duke@435 | 2083 | |
duke@435 | 2084 | // Fix up the JVM State edges |
duke@435 | 2085 | add_safepoint_edges(sfpnt); |
duke@435 | 2086 | Node *transformed_sfpnt = _gvn.transform(sfpnt); |
duke@435 | 2087 | set_control(transformed_sfpnt); |
duke@435 | 2088 | |
duke@435 | 2089 | // Provide an edge from root to safepoint. This makes the safepoint |
duke@435 | 2090 | // appear useful until the parse has completed. |
duke@435 | 2091 | if( OptoRemoveUseless && transformed_sfpnt->is_SafePoint() ) { |
duke@435 | 2092 | assert(C->root() != NULL, "Expect parse is still valid"); |
duke@435 | 2093 | C->root()->add_prec(transformed_sfpnt); |
duke@435 | 2094 | } |
duke@435 | 2095 | } |
duke@435 | 2096 | |
duke@435 | 2097 | #ifndef PRODUCT |
duke@435 | 2098 | //------------------------show_parse_info-------------------------------------- |
duke@435 | 2099 | void Parse::show_parse_info() { |
duke@435 | 2100 | InlineTree* ilt = NULL; |
duke@435 | 2101 | if (C->ilt() != NULL) { |
duke@435 | 2102 | JVMState* caller_jvms = is_osr_parse() ? caller()->caller() : caller(); |
duke@435 | 2103 | ilt = InlineTree::find_subtree_from_root(C->ilt(), caller_jvms, method()); |
duke@435 | 2104 | } |
duke@435 | 2105 | if (PrintCompilation && Verbose) { |
duke@435 | 2106 | if (depth() == 1) { |
duke@435 | 2107 | if( ilt->count_inlines() ) { |
duke@435 | 2108 | tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(), |
duke@435 | 2109 | ilt->count_inline_bcs()); |
duke@435 | 2110 | tty->cr(); |
duke@435 | 2111 | } |
duke@435 | 2112 | } else { |
duke@435 | 2113 | if (method()->is_synchronized()) tty->print("s"); |
duke@435 | 2114 | if (method()->has_exception_handlers()) tty->print("!"); |
duke@435 | 2115 | // Check this is not the final compiled version |
duke@435 | 2116 | if (C->trap_can_recompile()) { |
duke@435 | 2117 | tty->print("-"); |
duke@435 | 2118 | } else { |
duke@435 | 2119 | tty->print(" "); |
duke@435 | 2120 | } |
duke@435 | 2121 | method()->print_short_name(); |
duke@435 | 2122 | if (is_osr_parse()) { |
duke@435 | 2123 | tty->print(" @ %d", osr_bci()); |
duke@435 | 2124 | } |
duke@435 | 2125 | tty->print(" (%d bytes)",method()->code_size()); |
duke@435 | 2126 | if (ilt->count_inlines()) { |
duke@435 | 2127 | tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(), |
duke@435 | 2128 | ilt->count_inline_bcs()); |
duke@435 | 2129 | } |
duke@435 | 2130 | tty->cr(); |
duke@435 | 2131 | } |
duke@435 | 2132 | } |
duke@435 | 2133 | if (PrintOpto && (depth() == 1 || PrintOptoInlining)) { |
duke@435 | 2134 | // Print that we succeeded; suppress this message on the first osr parse. |
duke@435 | 2135 | |
duke@435 | 2136 | if (method()->is_synchronized()) tty->print("s"); |
duke@435 | 2137 | if (method()->has_exception_handlers()) tty->print("!"); |
duke@435 | 2138 | // Check this is not the final compiled version |
duke@435 | 2139 | if (C->trap_can_recompile() && depth() == 1) { |
duke@435 | 2140 | tty->print("-"); |
duke@435 | 2141 | } else { |
duke@435 | 2142 | tty->print(" "); |
duke@435 | 2143 | } |
duke@435 | 2144 | if( depth() != 1 ) { tty->print(" "); } // missing compile count |
duke@435 | 2145 | for (int i = 1; i < depth(); ++i) { tty->print(" "); } |
duke@435 | 2146 | method()->print_short_name(); |
duke@435 | 2147 | if (is_osr_parse()) { |
duke@435 | 2148 | tty->print(" @ %d", osr_bci()); |
duke@435 | 2149 | } |
duke@435 | 2150 | if (ilt->caller_bci() != -1) { |
duke@435 | 2151 | tty->print(" @ %d", ilt->caller_bci()); |
duke@435 | 2152 | } |
duke@435 | 2153 | tty->print(" (%d bytes)",method()->code_size()); |
duke@435 | 2154 | if (ilt->count_inlines()) { |
duke@435 | 2155 | tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(), |
duke@435 | 2156 | ilt->count_inline_bcs()); |
duke@435 | 2157 | } |
duke@435 | 2158 | tty->cr(); |
duke@435 | 2159 | } |
duke@435 | 2160 | } |
duke@435 | 2161 | |
duke@435 | 2162 | |
duke@435 | 2163 | //------------------------------dump------------------------------------------- |
duke@435 | 2164 | // Dump information associated with the bytecodes of current _method |
duke@435 | 2165 | void Parse::dump() { |
duke@435 | 2166 | if( method() != NULL ) { |
duke@435 | 2167 | // Iterate over bytecodes |
duke@435 | 2168 | ciBytecodeStream iter(method()); |
duke@435 | 2169 | for( Bytecodes::Code bc = iter.next(); bc != ciBytecodeStream::EOBC() ; bc = iter.next() ) { |
duke@435 | 2170 | dump_bci( iter.cur_bci() ); |
duke@435 | 2171 | tty->cr(); |
duke@435 | 2172 | } |
duke@435 | 2173 | } |
duke@435 | 2174 | } |
duke@435 | 2175 | |
duke@435 | 2176 | // Dump information associated with a byte code index, 'bci' |
duke@435 | 2177 | void Parse::dump_bci(int bci) { |
duke@435 | 2178 | // Output info on merge-points, cloning, and within _jsr..._ret |
duke@435 | 2179 | // NYI |
duke@435 | 2180 | tty->print(" bci:%d", bci); |
duke@435 | 2181 | } |
duke@435 | 2182 | |
duke@435 | 2183 | #endif |