annotate hotspot/src/share/vm/opto/parse1.cpp @ 37480:291ee208fb72

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