annotate src/hotspot/share/opto/parse1.cpp @ 53469:1d953ae4d39f

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