annotate src/share/vm/opto/parse1.cpp @ 9596:825cee2cd7a6

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