hotspot/src/share/vm/opto/lcm.cpp
author kvn
Thu, 19 Mar 2009 09:13:24 -0700
changeset 2259 d3c946e7f127
parent 2105 347008ce7984
parent 2254 f13dda645a4b
child 2348 4e71ed4c2709
permissions -rw-r--r--
Merge
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
2105
347008ce7984 6814575: Update copyright year
xdono
parents: 2022
diff changeset
     2
 * Copyright 1998-2009 Sun Microsystems, Inc.  All Rights Reserved.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     3
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     4
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     5
 * This code is free software; you can redistribute it and/or modify it
489c9b5090e2 Initial load
duke
parents:
diff changeset
     6
 * under the terms of the GNU General Public License version 2 only, as
489c9b5090e2 Initial load
duke
parents:
diff changeset
     7
 * published by the Free Software Foundation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     8
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     9
 * This code is distributed in the hope that it will be useful, but WITHOUT
489c9b5090e2 Initial load
duke
parents:
diff changeset
    10
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    11
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
489c9b5090e2 Initial load
duke
parents:
diff changeset
    12
 * version 2 for more details (a copy is included in the LICENSE file that
489c9b5090e2 Initial load
duke
parents:
diff changeset
    13
 * accompanied this code).
489c9b5090e2 Initial load
duke
parents:
diff changeset
    14
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    15
 * You should have received a copy of the GNU General Public License version
489c9b5090e2 Initial load
duke
parents:
diff changeset
    16
 * 2 along with this work; if not, write to the Free Software Foundation,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    17
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    18
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    19
 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    20
 * CA 95054 USA or visit www.sun.com if you need additional information or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    21
 * have any questions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
489c9b5090e2 Initial load
duke
parents:
diff changeset
    25
// Optimization - Graph Style
489c9b5090e2 Initial load
duke
parents:
diff changeset
    26
489c9b5090e2 Initial load
duke
parents:
diff changeset
    27
#include "incls/_precompiled.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    28
#include "incls/_lcm.cpp.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    29
489c9b5090e2 Initial load
duke
parents:
diff changeset
    30
//------------------------------implicit_null_check----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    31
// Detect implicit-null-check opportunities.  Basically, find NULL checks
489c9b5090e2 Initial load
duke
parents:
diff changeset
    32
// with suitable memory ops nearby.  Use the memory op to do the NULL check.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    33
// I can generate a memory op if there is not one nearby.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    34
// The proj is the control projection for the not-null case.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
// The val is the pointer being checked for nullness.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
void Block::implicit_null_check(PhaseCFG *cfg, Node *proj, Node *val, int allowed_reasons) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
  // Assume if null check need for 0 offset then always needed
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
  // Intel solaris doesn't support any null checks yet and no
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
  // mechanism exists (yet) to set the switches at an os_cpu level
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
  if( !ImplicitNullChecks || MacroAssembler::needs_explicit_null_check(0)) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
  // Make sure the ptr-is-null path appears to be uncommon!
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
  float f = end()->as_MachIf()->_prob;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
  if( proj->Opcode() == Op_IfTrue ) f = 1.0f - f;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
  if( f > PROB_UNLIKELY_MAG(4) ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
  uint bidx = 0;                // Capture index of value into memop
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
  bool was_store;               // Memory op is a store op
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
  // Get the successor block for if the test ptr is non-null
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
  Block* not_null_block;  // this one goes with the proj
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
  Block* null_block;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
  if (_nodes[_nodes.size()-1] == proj) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
    null_block     = _succs[0];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
    not_null_block = _succs[1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
    assert(_nodes[_nodes.size()-2] == proj, "proj is one or the other");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
    not_null_block = _succs[0];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
    null_block     = _succs[1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
  }
1136
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
    61
  while (null_block->is_Empty() == Block::empty_with_goto) {
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
    62
    null_block     = null_block->_succs[0];
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
    63
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
  // Search the exception block for an uncommon trap.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
  // (See Parse::do_if and Parse::do_ifnull for the reason
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
  // we need an uncommon trap.  Briefly, we need a way to
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
  // detect failure of this optimization, as in 6366351.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
    bool found_trap = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
    for (uint i1 = 0; i1 < null_block->_nodes.size(); i1++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
      Node* nn = null_block->_nodes[i1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
      if (nn->is_MachCall() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
          nn->as_MachCall()->entry_point() ==
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
          SharedRuntime::uncommon_trap_blob()->instructions_begin()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
        const Type* trtype = nn->in(TypeFunc::Parms)->bottom_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
        if (trtype->isa_int() && trtype->is_int()->is_con()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
          jint tr_con = trtype->is_int()->get_con();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
          Deoptimization::DeoptReason reason = Deoptimization::trap_request_reason(tr_con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
          Deoptimization::DeoptAction action = Deoptimization::trap_request_action(tr_con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
          assert((int)reason < (int)BitsPerInt, "recode bit map");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
          if (is_set_nth_bit(allowed_reasons, (int) reason)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
              && action != Deoptimization::Action_none) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
            // This uncommon trap is sure to recompile, eventually.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
            // When that happens, C->too_many_traps will prevent
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
            // this transformation from happening again.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
            found_trap = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
    if (!found_trap) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
      // We did not find an uncommon trap.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
      return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
  // Search the successor block for a load or store who's base value is also
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
  // the tested value.  There may be several.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
  Node_List *out = new Node_List(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
  MachNode *best = NULL;        // Best found so far
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
  for (DUIterator i = val->outs(); val->has_out(i); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
    Node *m = val->out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
    if( !m->is_Mach() ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
    MachNode *mach = m->as_Mach();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
    was_store = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
    switch( mach->ideal_Opcode() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
    case Op_LoadB:
2022
28ce8115a91d 6796746: rename LoadC (char) opcode class to LoadUS (unsigned short)
twisti
parents: 1397
diff changeset
   110
    case Op_LoadUS:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
    case Op_LoadD:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
    case Op_LoadF:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
    case Op_LoadI:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
    case Op_LoadL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
    case Op_LoadP:
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 1
diff changeset
   116
    case Op_LoadN:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
    case Op_LoadS:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
    case Op_LoadKlass:
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 372
diff changeset
   119
    case Op_LoadNKlass:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
    case Op_LoadRange:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
    case Op_LoadD_unaligned:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
    case Op_LoadL_unaligned:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
    case Op_StoreB:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
    case Op_StoreC:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
    case Op_StoreCM:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
    case Op_StoreD:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
    case Op_StoreF:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
    case Op_StoreI:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
    case Op_StoreL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
    case Op_StoreP:
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 1
diff changeset
   132
    case Op_StoreN:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
      was_store = true;         // Memory op is a store op
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
      // Stores will have their address in slot 2 (memory in slot 1).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
      // If the value being nul-checked is in another slot, it means we
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
      // are storing the checked value, which does NOT check the value!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
      if( mach->in(2) != val ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
      break;                    // Found a memory op?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
    case Op_StrComp:
595
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   140
    case Op_AryEq:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
      // Not a legit memory op for implicit null check regardless of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
      // embedded loads
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
    default:                    // Also check for embedded loads
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
      if( !mach->needs_anti_dependence_check() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
        continue;               // Not an memory op; skip it
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
    // check if the offset is not too high for implicit exception
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
    {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
      intptr_t offset = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
      const TypePtr *adr_type = NULL;  // Do not need this return value here
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
      const Node* base = mach->get_base_and_disp(offset, adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
      if (base == NULL || base == NodeSentinel) {
1136
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
   155
        // Narrow oop address doesn't have base, only index
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
   156
        if( val->bottom_type()->isa_narrowoop() &&
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
   157
            MacroAssembler::needs_explicit_null_check(offset) )
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
   158
          continue;             // Give up if offset is beyond page size
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
        // cannot reason about it; is probably not implicit null exception
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
      } else {
2254
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   161
        const TypePtr* tptr;
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   162
        if (UseCompressedOops && Universe::narrow_oop_shift() == 0) {
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   163
          // 32-bits narrow oop can be the base of address expressions
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   164
          tptr = base->bottom_type()->make_ptr();
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   165
        } else {
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   166
          // only regular oops are expected here
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   167
          tptr = base->bottom_type()->is_ptr();
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   168
        }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
        // Give up if offset is not a compile-time constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
        if( offset == Type::OffsetBot || tptr->_offset == Type::OffsetBot )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
          continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
        offset += tptr->_offset; // correct if base is offseted
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
        if( MacroAssembler::needs_explicit_null_check(offset) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
          continue;             // Give up is reference is beyond 4K page size
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
489c9b5090e2 Initial load
duke
parents:
diff changeset
   178
    // Check ctrl input to see if the null-check dominates the memory op
489c9b5090e2 Initial load
duke
parents:
diff changeset
   179
    Block *cb = cfg->_bbs[mach->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
    cb = cb->_idom;             // Always hoist at least 1 block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
    if( !was_store ) {          // Stores can be hoisted only one block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
      while( cb->_dom_depth > (_dom_depth + 1))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
        cb = cb->_idom;         // Hoist loads as far as we want
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
      // The non-null-block should dominate the memory op, too. Live
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
      // range spilling will insert a spill in the non-null-block if it is
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
      // needs to spill the memory op for an implicit null check.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
      if (cb->_dom_depth == (_dom_depth + 1)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
        if (cb != not_null_block) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
        cb = cb->_idom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
    if( cb != this ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
    // Found a memory user; see if it can be hoisted to check-block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
    uint vidx = 0;              // Capture index of value into memop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
    uint j;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
    for( j = mach->req()-1; j > 0; j-- ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
      if( mach->in(j) == val ) vidx = j;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
      // Block of memory-op input
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
      Block *inb = cfg->_bbs[mach->in(j)->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
      Block *b = this;          // Start from nul check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
      while( b != inb && b->_dom_depth > inb->_dom_depth )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
        b = b->_idom;           // search upwards for input
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
      // See if input dominates null check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
      if( b != inb )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
    if( j > 0 )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
    Block *mb = cfg->_bbs[mach->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
    // Hoisting stores requires more checks for the anti-dependence case.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
    // Give up hoisting if we have to move the store past any load.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
    if( was_store ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
      Block *b = mb;            // Start searching here for a local load
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
      // mach use (faulting) trying to hoist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
      // n might be blocker to hoisting
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
      while( b != this ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
        uint k;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
        for( k = 1; k < b->_nodes.size(); k++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
          Node *n = b->_nodes[k];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   221
          if( n->needs_anti_dependence_check() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
              n->in(LoadNode::Memory) == mach->in(StoreNode::Memory) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
            break;              // Found anti-dependent load
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
        if( k < b->_nodes.size() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   226
          break;                // Found anti-dependent load
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
        // Make sure control does not do a merge (would have to check allpaths)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
        if( b->num_preds() != 2 ) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
        b = cfg->_bbs[b->pred(1)->_idx]; // Move up to predecessor block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   231
      if( b != this ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   232
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   233
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
    // Make sure this memory op is not already being used for a NullCheck
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
    Node *e = mb->end();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
    if( e->is_MachNullCheck() && e->in(1) == mach )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   237
      continue;                 // Already being used as a NULL check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
489c9b5090e2 Initial load
duke
parents:
diff changeset
   239
    // Found a candidate!  Pick one with least dom depth - the highest
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
    // in the dom tree should be closest to the null check.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   241
    if( !best ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   242
        cfg->_bbs[mach->_idx]->_dom_depth < cfg->_bbs[best->_idx]->_dom_depth ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   243
      best = mach;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   244
      bidx = vidx;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
489c9b5090e2 Initial load
duke
parents:
diff changeset
   246
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   248
  // No candidate!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   249
  if( !best ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   250
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
  // ---- Found an implicit null check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   252
  extern int implicit_null_checks;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   253
  implicit_null_checks++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   254
489c9b5090e2 Initial load
duke
parents:
diff changeset
   255
  // Hoist the memory candidate up to the end of the test block.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
  Block *old_block = cfg->_bbs[best->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
  old_block->find_remove(best);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
  add_inst(best);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
  cfg->_bbs.map(best->_idx,this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
  // Move the control dependence
489c9b5090e2 Initial load
duke
parents:
diff changeset
   262
  if (best->in(0) && best->in(0) == old_block->_nodes[0])
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
    best->set_req(0, _nodes[0]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   264
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
  // Check for flag-killing projections that also need to be hoisted
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
  // Should be DU safe because no edge updates.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
  for (DUIterator_Fast jmax, j = best->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
    Node* n = best->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
    if( n->Opcode() == Op_MachProj ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
      cfg->_bbs[n->_idx]->find_remove(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
      add_inst(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
      cfg->_bbs.map(n->_idx,this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
  Compile *C = cfg->C;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
  // proj==Op_True --> ne test; proj==Op_False --> eq test.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
  // One of two graph shapes got matched:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
  //   (IfTrue  (If (Bool NE (CmpP ptr NULL))))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
  //   (IfFalse (If (Bool EQ (CmpP ptr NULL))))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
  // NULL checks are always branch-if-eq.  If we see a IfTrue projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
  // then we are replacing a 'ne' test with a 'eq' NULL check test.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
  // We need to flip the projections to keep the same semantics.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
  if( proj->Opcode() == Op_IfTrue ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
    // Swap order of projections in basic block to swap branch targets
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
    Node *tmp1 = _nodes[end_idx()+1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
    Node *tmp2 = _nodes[end_idx()+2];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
    _nodes.map(end_idx()+1, tmp2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
    _nodes.map(end_idx()+2, tmp1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
    Node *tmp = new (C, 1) Node(C->top()); // Use not NULL input
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
    tmp1->replace_by(tmp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
    tmp2->replace_by(tmp1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
    tmp->replace_by(tmp2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
    tmp->destruct();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
  // Remove the existing null check; use a new implicit null check instead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
  // Since schedule-local needs precise def-use info, we need to correct
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
  // it as well.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
  Node *old_tst = proj->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
  MachNode *nul_chk = new (C) MachNullCheckNode(old_tst->in(0),best,bidx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
  _nodes.map(end_idx(),nul_chk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   303
  cfg->_bbs.map(nul_chk->_idx,this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
  // Redirect users of old_test to nul_chk
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
  for (DUIterator_Last i2min, i2 = old_tst->last_outs(i2min); i2 >= i2min; --i2)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   306
    old_tst->last_out(i2)->set_req(0, nul_chk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
  // Clean-up any dead code
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
  for (uint i3 = 0; i3 < old_tst->req(); i3++)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
    old_tst->set_req(i3, NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
  cfg->latency_from_uses(nul_chk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
  cfg->latency_from_uses(best);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   313
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
489c9b5090e2 Initial load
duke
parents:
diff changeset
   316
//------------------------------select-----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
// Select a nice fellow from the worklist to schedule next. If there is only
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
// one choice, then use it. Projections take top priority for correctness
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
// reasons - if I see a projection, then it is next.  There are a number of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
// other special cases, for instructions that consume condition codes, et al.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
// These are chosen immediately. Some instructions are required to immediately
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
// precede the last instruction in the block, and these are taken last. Of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
// remaining cases (most), choose the instruction with the greatest latency
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
// (that is, the most number of pseudo-cycles required to the end of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   325
// routine). If there is a tie, choose the instruction with the most inputs.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   326
Node *Block::select(PhaseCFG *cfg, Node_List &worklist, int *ready_cnt, VectorSet &next_call, uint sched_slot) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
  // If only a single entry on the stack, use it
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
  uint cnt = worklist.size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
  if (cnt == 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
    Node *n = worklist[0];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
    worklist.map(0,worklist.pop());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
    return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
  uint choice  = 0; // Bigger is most important
489c9b5090e2 Initial load
duke
parents:
diff changeset
   337
  uint latency = 0; // Bigger is scheduled first
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
  uint score   = 0; // Bigger is better
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   339
  int idx = -1;     // Index in worklist
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
489c9b5090e2 Initial load
duke
parents:
diff changeset
   341
  for( uint i=0; i<cnt; i++ ) { // Inspect entire worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   342
    // Order in worklist is used to break ties.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
    // See caller for how this is used to delay scheduling
489c9b5090e2 Initial load
duke
parents:
diff changeset
   344
    // of induction variable increments to after the other
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
    // uses of the phi are scheduled.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
    Node *n = worklist[i];      // Get Node on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
    int iop = n->is_Mach() ? n->as_Mach()->ideal_Opcode() : 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
    if( n->is_Proj() ||         // Projections always win
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
        n->Opcode()== Op_Con || // So does constant 'Top'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
        iop == Op_CreateEx ||   // Create-exception must start block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
        iop == Op_CheckCastPP
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
        ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
      worklist.map(i,worklist.pop());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
      return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
    // Final call in a block must be adjacent to 'catch'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
    Node *e = end();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
    if( e->is_Catch() && e->in(0)->in(0) == n )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
    // Memory op for an implicit null check has to be at the end of the block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   364
    if( e->is_MachNullCheck() && e->in(1) == n )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
    uint n_choice  = 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
    // See if this instruction is consumed by a branch. If so, then (as the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
    // branch is the last instruction in the basic block) force it to the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
    // end of the basic block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
    if ( must_clone[iop] ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
      // See if any use is a branch
489c9b5090e2 Initial load
duke
parents:
diff changeset
   374
      bool found_machif = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
      for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
        Node* use = n->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
        // The use is a conditional branch, make them adjacent
489c9b5090e2 Initial load
duke
parents:
diff changeset
   380
        if (use->is_MachIf() && cfg->_bbs[use->_idx]==this ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
          found_machif = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
        // More than this instruction pending for successor to be ready,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
        // don't choose this if other opportunities are ready
489c9b5090e2 Initial load
duke
parents:
diff changeset
   387
        if (ready_cnt[use->_idx] > 1)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
          n_choice = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
489c9b5090e2 Initial load
duke
parents:
diff changeset
   391
      // loop terminated, prefer not to use this instruction
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
      if (found_machif)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   395
489c9b5090e2 Initial load
duke
parents:
diff changeset
   396
    // See if this has a predecessor that is "must_clone", i.e. sets the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
    // condition code. If so, choose this first
489c9b5090e2 Initial load
duke
parents:
diff changeset
   398
    for (uint j = 0; j < n->req() ; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
      Node *inn = n->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
      if (inn) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
        if (inn->is_Mach() && must_clone[inn->as_Mach()->ideal_Opcode()] ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
          n_choice = 3;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
    // MachTemps should be scheduled last so they are near their uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
    if (n->is_MachTemp()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
      n_choice = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
    uint n_latency = cfg->_node_latency.at_grow(n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
    uint n_score   = n->req();   // Many inputs get high score to break ties
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
    // Keep best latency found
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
    if( choice < n_choice ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
        ( choice == n_choice &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
          ( latency < n_latency ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   420
            ( latency == n_latency &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   421
              ( score < n_score ))))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   422
      choice  = n_choice;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   423
      latency = n_latency;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
      score   = n_score;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   425
      idx     = i;               // Also keep index in worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   426
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   427
  } // End of for all ready nodes in worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   428
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   429
  assert(idx >= 0, "index should be set");
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   430
  Node *n = worklist[(uint)idx];      // Get the winner
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   432
  worklist.map((uint)idx, worklist.pop());     // Compress worklist
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   433
  return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
//------------------------------set_next_call----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
void Block::set_next_call( Node *n, VectorSet &next_call, Block_Array &bbs ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
  if( next_call.test_set(n->_idx) ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
  for( uint i=0; i<n->len(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   441
    Node *m = n->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   442
    if( !m ) continue;  // must see all nodes in block that precede call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
    if( bbs[m->_idx] == this )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
      set_next_call( m, next_call, bbs );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
//------------------------------needed_for_next_call---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   449
// Set the flag 'next_call' for each Node that is needed for the next call to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
// be scheduled.  This flag lets me bias scheduling so Nodes needed for the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   451
// next subroutine call get priority - basically it moves things NOT needed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
// for the next call till after the call.  This prevents me from trying to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
// carry lots of stuff live across a call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
void Block::needed_for_next_call(Node *this_call, VectorSet &next_call, Block_Array &bbs) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
  // Find the next control-defining Node in this block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
  Node* call = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
  for (DUIterator_Fast imax, i = this_call->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
    Node* m = this_call->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   459
    if( bbs[m->_idx] == this && // Local-block user
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
        m != this_call &&       // Not self-start node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
        m->is_Call() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
      call = m;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
  if (call == NULL)  return;    // No next call (e.g., block end is near)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
  // Set next-call for all inputs to this call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
  set_next_call(call, next_call, bbs);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
//------------------------------sched_call-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
uint Block::sched_call( Matcher &matcher, Block_Array &bbs, uint node_cnt, Node_List &worklist, int *ready_cnt, MachCallNode *mcall, VectorSet &next_call ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
  RegMask regs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
  // Schedule all the users of the call right now.  All the users are
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
  // projection Nodes, so they must be scheduled next to the call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
  // Collect all the defined registers.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
  for (DUIterator_Fast imax, i = mcall->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
    Node* n = mcall->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
    assert( n->Opcode()==Op_MachProj, "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
    --ready_cnt[n->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
    assert( !ready_cnt[n->_idx], "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   482
    // Schedule next to call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
    _nodes.map(node_cnt++, n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
    // Collect defined registers
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
    regs.OR(n->out_RegMask());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
    // Check for scheduling the next control-definer
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
    if( n->bottom_type() == Type::CONTROL )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
      // Warm up next pile of heuristic bits
489c9b5090e2 Initial load
duke
parents:
diff changeset
   489
      needed_for_next_call(n, next_call, bbs);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   490
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
    // Children of projections are now all ready
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
    for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
      Node* m = n->fast_out(j); // Get user
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
      if( bbs[m->_idx] != this ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
      if( m->is_Phi() ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
      if( !--ready_cnt[m->_idx] )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
        worklist.push(m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
489c9b5090e2 Initial load
duke
parents:
diff changeset
   502
  // Act as if the call defines the Frame Pointer.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   503
  // Certainly the FP is alive and well after the call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   504
  regs.Insert(matcher.c_frame_pointer());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   505
489c9b5090e2 Initial load
duke
parents:
diff changeset
   506
  // Set all registers killed and not already defined by the call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   507
  uint r_cnt = mcall->tf()->range()->cnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
  int op = mcall->ideal_Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
  MachProjNode *proj = new (matcher.C, 1) MachProjNode( mcall, r_cnt+1, RegMask::Empty, MachProjNode::fat_proj );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   510
  bbs.map(proj->_idx,this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   511
  _nodes.insert(node_cnt++, proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   512
489c9b5090e2 Initial load
duke
parents:
diff changeset
   513
  // Select the right register save policy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   514
  const char * save_policy;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
  switch (op) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   516
    case Op_CallRuntime:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
    case Op_CallLeaf:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
    case Op_CallLeafNoFP:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
      // Calling C code so use C calling convention
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
      save_policy = matcher._c_reg_save_policy;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
    case Op_CallStaticJava:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
    case Op_CallDynamicJava:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
      // Calling Java code so use Java calling convention
489c9b5090e2 Initial load
duke
parents:
diff changeset
   526
      save_policy = matcher._register_save_policy;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
    default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
      ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
  // When using CallRuntime mark SOE registers as killed by the call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
  // so values that could show up in the RegisterMap aren't live in a
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
  // callee saved register since the register wouldn't know where to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
  // find them.  CallLeaf and CallLeafNoFP are ok because they can't
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  // have debug info on them.  Strictly speaking this only needs to be
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
  // done for oops since idealreg2debugmask takes care of debug info
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
  // references but there no way to handle oops differently than other
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
  // pointers as far as the kill mask goes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
  bool exclude_soe = op == Op_CallRuntime;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
489c9b5090e2 Initial load
duke
parents:
diff changeset
   543
  // Fill in the kill mask for the call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   544
  for( OptoReg::Name r = OptoReg::Name(0); r < _last_Mach_Reg; r=OptoReg::add(r,1) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
    if( !regs.Member(r) ) {     // Not already defined by the call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
      // Save-on-call register?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
      if ((save_policy[r] == 'C') ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   548
          (save_policy[r] == 'A') ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
          ((save_policy[r] == 'E') && exclude_soe)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
        proj->_rout.Insert(r);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   553
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   554
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
  return node_cnt;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   557
489c9b5090e2 Initial load
duke
parents:
diff changeset
   558
489c9b5090e2 Initial load
duke
parents:
diff changeset
   559
//------------------------------schedule_local---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
// Topological sort within a block.  Someday become a real scheduler.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
bool Block::schedule_local(PhaseCFG *cfg, Matcher &matcher, int *ready_cnt, VectorSet &next_call) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   562
  // Already "sorted" are the block start Node (as the first entry), and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   563
  // the block-ending Node and any trailing control projections.  We leave
489c9b5090e2 Initial load
duke
parents:
diff changeset
   564
  // these alone.  PhiNodes and ParmNodes are made to follow the block start
489c9b5090e2 Initial load
duke
parents:
diff changeset
   565
  // Node.  Everything else gets topo-sorted.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
    if (cfg->trace_opto_pipelining()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   569
      tty->print_cr("# --- schedule_local B%d, before: ---", _pre_order);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
      for (uint i = 0;i < _nodes.size();i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
        tty->print("# ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
        _nodes[i]->fast_dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   574
      tty->print_cr("#");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   575
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   576
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
489c9b5090e2 Initial load
duke
parents:
diff changeset
   578
  // RootNode is already sorted
489c9b5090e2 Initial load
duke
parents:
diff changeset
   579
  if( _nodes.size() == 1 ) return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
  // Move PhiNodes and ParmNodes from 1 to cnt up to the start
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
  uint node_cnt = end_idx();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   583
  uint phi_cnt = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
  uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
  for( i = 1; i<node_cnt; i++ ) { // Scan for Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   586
    Node *n = _nodes[i];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   587
    if( n->is_Phi() ||          // Found a PhiNode or ParmNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
        (n->is_Proj()  && n->in(0) == head()) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   589
      // Move guy at 'phi_cnt' to the end; makes a hole at phi_cnt
489c9b5090e2 Initial load
duke
parents:
diff changeset
   590
      _nodes.map(i,_nodes[phi_cnt]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   591
      _nodes.map(phi_cnt++,n);  // swap Phi/Parm up front
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
    } else {                    // All others
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
      // Count block-local inputs to 'n'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
      uint cnt = n->len();      // Input count
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
      uint local = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
      for( uint j=0; j<cnt; j++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
        Node *m = n->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
        if( m && cfg->_bbs[m->_idx] == this && !m->is_top() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
          local++;              // One more block-local input
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
      ready_cnt[n->_idx] = local; // Count em up
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
      // A few node types require changing a required edge to a precedence edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
      // before allocation.
1374
4c24294029a9 6711316: Open source the Garbage-First garbage collector
ysr
parents: 372
diff changeset
   605
      if( UseConcMarkSweepGC || UseG1GC ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
        if( n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_StoreCM ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
          // Note: Required edges with an index greater than oper_input_base
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
          // are not supported by the allocator.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   609
          // Note2: Can only depend on unmatched edge being last,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   610
          // can not depend on its absolute position.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   611
          Node *oop_store = n->in(n->req() - 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   612
          n->del_req(n->req() - 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   613
          n->add_prec(oop_store);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   614
          assert(cfg->_bbs[oop_store->_idx]->_dom_depth <= this->_dom_depth, "oop_store must dominate card-mark");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   615
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   616
      }
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   617
      if( n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_MemBarAcquire &&
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   618
          n->req() > TypeFunc::Parms ) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   619
        // MemBarAcquire could be created without Precedent edge.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   620
        // del_req() replaces the specified edge with the last input edge
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   621
        // and then removes the last edge. If the specified edge > number of
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   622
        // edges the last edge will be moved outside of the input edges array
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   623
        // and the edge will be lost. This is why this code should be
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   624
        // executed only when Precedent (== TypeFunc::Parms) edge is present.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   625
        Node *x = n->in(TypeFunc::Parms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   626
        n->del_req(TypeFunc::Parms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   627
        n->add_prec(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   628
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   629
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   630
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   631
  for(uint i2=i; i2<_nodes.size(); i2++ ) // Trailing guys get zapped count
489c9b5090e2 Initial load
duke
parents:
diff changeset
   632
    ready_cnt[_nodes[i2]->_idx] = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   633
489c9b5090e2 Initial load
duke
parents:
diff changeset
   634
  // All the prescheduled guys do not hold back internal nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   635
  uint i3;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   636
  for(i3 = 0; i3<phi_cnt; i3++ ) {  // For all pre-scheduled
489c9b5090e2 Initial load
duke
parents:
diff changeset
   637
    Node *n = _nodes[i3];       // Get pre-scheduled
489c9b5090e2 Initial load
duke
parents:
diff changeset
   638
    for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   639
      Node* m = n->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   640
      if( cfg->_bbs[m->_idx] ==this ) // Local-block user
489c9b5090e2 Initial load
duke
parents:
diff changeset
   641
        ready_cnt[m->_idx]--;   // Fix ready count
489c9b5090e2 Initial load
duke
parents:
diff changeset
   642
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   643
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   644
489c9b5090e2 Initial load
duke
parents:
diff changeset
   645
  Node_List delay;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   646
  // Make a worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   647
  Node_List worklist;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   648
  for(uint i4=i3; i4<node_cnt; i4++ ) {    // Put ready guys on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   649
    Node *m = _nodes[i4];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   650
    if( !ready_cnt[m->_idx] ) {   // Zero ready count?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   651
      if (m->is_iteratively_computed()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   652
        // Push induction variable increments last to allow other uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
   653
        // of the phi to be scheduled first. The select() method breaks
489c9b5090e2 Initial load
duke
parents:
diff changeset
   654
        // ties in scheduling by worklist order.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   655
        delay.push(m);
372
b0d8a9fd3646 6601321: Assert(j == 1 || b->_nodes[j-1]->is_Phi(),"CreateEx must be first instruction in block")
never
parents: 360
diff changeset
   656
      } else if (m->is_Mach() && m->as_Mach()->ideal_Opcode() == Op_CreateEx) {
b0d8a9fd3646 6601321: Assert(j == 1 || b->_nodes[j-1]->is_Phi(),"CreateEx must be first instruction in block")
never
parents: 360
diff changeset
   657
        // Force the CreateEx to the top of the list so it's processed
b0d8a9fd3646 6601321: Assert(j == 1 || b->_nodes[j-1]->is_Phi(),"CreateEx must be first instruction in block")
never
parents: 360
diff changeset
   658
        // first and ends up at the start of the block.
b0d8a9fd3646 6601321: Assert(j == 1 || b->_nodes[j-1]->is_Phi(),"CreateEx must be first instruction in block")
never
parents: 360
diff changeset
   659
        worklist.insert(0, m);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   660
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   661
        worklist.push(m);         // Then on to worklist!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   662
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   663
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   664
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   665
  while (delay.size()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   666
    Node* d = delay.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   667
    worklist.push(d);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   668
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   669
489c9b5090e2 Initial load
duke
parents:
diff changeset
   670
  // Warm up the 'next_call' heuristic bits
489c9b5090e2 Initial load
duke
parents:
diff changeset
   671
  needed_for_next_call(_nodes[0], next_call, cfg->_bbs);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   672
489c9b5090e2 Initial load
duke
parents:
diff changeset
   673
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   674
    if (cfg->trace_opto_pipelining()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   675
      for (uint j=0; j<_nodes.size(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   676
        Node     *n = _nodes[j];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   677
        int     idx = n->_idx;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   678
        tty->print("#   ready cnt:%3d  ", ready_cnt[idx]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   679
        tty->print("latency:%3d  ", cfg->_node_latency.at_grow(idx));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   680
        tty->print("%4d: %s\n", idx, n->Name());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   681
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   682
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   683
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   684
489c9b5090e2 Initial load
duke
parents:
diff changeset
   685
  // Pull from worklist and schedule
489c9b5090e2 Initial load
duke
parents:
diff changeset
   686
  while( worklist.size() ) {    // Worklist is not ready
489c9b5090e2 Initial load
duke
parents:
diff changeset
   687
489c9b5090e2 Initial load
duke
parents:
diff changeset
   688
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   689
    if (cfg->trace_opto_pipelining()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   690
      tty->print("#   ready list:");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   691
      for( uint i=0; i<worklist.size(); i++ ) { // Inspect entire worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   692
        Node *n = worklist[i];      // Get Node on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   693
        tty->print(" %d", n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   694
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   695
      tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   696
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   697
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   698
489c9b5090e2 Initial load
duke
parents:
diff changeset
   699
    // Select and pop a ready guy from worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   700
    Node* n = select(cfg, worklist, ready_cnt, next_call, phi_cnt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   701
    _nodes.map(phi_cnt++,n);    // Schedule him next
489c9b5090e2 Initial load
duke
parents:
diff changeset
   702
489c9b5090e2 Initial load
duke
parents:
diff changeset
   703
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   704
    if (cfg->trace_opto_pipelining()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   705
      tty->print("#    select %d: %s", n->_idx, n->Name());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   706
      tty->print(", latency:%d", cfg->_node_latency.at_grow(n->_idx));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   707
      n->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   708
      if (Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   709
        tty->print("#   ready list:");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   710
        for( uint i=0; i<worklist.size(); i++ ) { // Inspect entire worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   711
          Node *n = worklist[i];      // Get Node on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   712
          tty->print(" %d", n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   713
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   714
        tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   715
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   716
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   717
489c9b5090e2 Initial load
duke
parents:
diff changeset
   718
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   719
    if( n->is_MachCall() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   720
      MachCallNode *mcall = n->as_MachCall();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   721
      phi_cnt = sched_call(matcher, cfg->_bbs, phi_cnt, worklist, ready_cnt, mcall, next_call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   722
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   723
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   724
    // Children are now all ready
489c9b5090e2 Initial load
duke
parents:
diff changeset
   725
    for (DUIterator_Fast i5max, i5 = n->fast_outs(i5max); i5 < i5max; i5++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   726
      Node* m = n->fast_out(i5); // Get user
489c9b5090e2 Initial load
duke
parents:
diff changeset
   727
      if( cfg->_bbs[m->_idx] != this ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   728
      if( m->is_Phi() ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   729
      if( !--ready_cnt[m->_idx] )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   730
        worklist.push(m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   731
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   732
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   733
489c9b5090e2 Initial load
duke
parents:
diff changeset
   734
  if( phi_cnt != end_idx() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   735
    // did not schedule all.  Retry, Bailout, or Die
489c9b5090e2 Initial load
duke
parents:
diff changeset
   736
    Compile* C = matcher.C;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   737
    if (C->subsume_loads() == true && !C->failing()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   738
      // Retry with subsume_loads == false
489c9b5090e2 Initial load
duke
parents:
diff changeset
   739
      // If this is the first failure, the sentinel string will "stick"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   740
      // to the Compile object, and the C2Compiler will see it and retry.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   741
      C->record_failure(C2Compiler::retry_no_subsuming_loads());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   742
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   743
    // assert( phi_cnt == end_idx(), "did not schedule all" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   744
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   745
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   746
489c9b5090e2 Initial load
duke
parents:
diff changeset
   747
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   748
  if (cfg->trace_opto_pipelining()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   749
    tty->print_cr("#");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   750
    tty->print_cr("# after schedule_local");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   751
    for (uint i = 0;i < _nodes.size();i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   752
      tty->print("# ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   753
      _nodes[i]->fast_dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   754
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
    tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   756
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   757
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   758
489c9b5090e2 Initial load
duke
parents:
diff changeset
   759
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   762
489c9b5090e2 Initial load
duke
parents:
diff changeset
   763
//--------------------------catch_cleanup_fix_all_inputs-----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   764
static void catch_cleanup_fix_all_inputs(Node *use, Node *old_def, Node *new_def) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   765
  for (uint l = 0; l < use->len(); l++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   766
    if (use->in(l) == old_def) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   767
      if (l < use->req()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   768
        use->set_req(l, new_def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   769
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   770
        use->rm_prec(l);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   771
        use->add_prec(new_def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   772
        l--;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   773
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   774
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   775
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   776
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   777
489c9b5090e2 Initial load
duke
parents:
diff changeset
   778
//------------------------------catch_cleanup_find_cloned_def------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   779
static Node *catch_cleanup_find_cloned_def(Block *use_blk, Node *def, Block *def_blk, Block_Array &bbs, int n_clone_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   780
  assert( use_blk != def_blk, "Inter-block cleanup only");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   781
489c9b5090e2 Initial load
duke
parents:
diff changeset
   782
  // The use is some block below the Catch.  Find and return the clone of the def
489c9b5090e2 Initial load
duke
parents:
diff changeset
   783
  // that dominates the use. If there is no clone in a dominating block, then
489c9b5090e2 Initial load
duke
parents:
diff changeset
   784
  // create a phi for the def in a dominating block.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   785
489c9b5090e2 Initial load
duke
parents:
diff changeset
   786
  // Find which successor block dominates this use.  The successor
489c9b5090e2 Initial load
duke
parents:
diff changeset
   787
  // blocks must all be single-entry (from the Catch only; I will have
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
  // split blocks to make this so), hence they all dominate.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
  while( use_blk->_dom_depth > def_blk->_dom_depth+1 )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
    use_blk = use_blk->_idom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
  // Find the successor
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
  Node *fixup = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
  uint j;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
  for( j = 0; j < def_blk->_num_succs; j++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
    if( use_blk == def_blk->_succs[j] )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   798
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   799
489c9b5090e2 Initial load
duke
parents:
diff changeset
   800
  if( j == def_blk->_num_succs ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   801
    // Block at same level in dom-tree is not a successor.  It needs a
489c9b5090e2 Initial load
duke
parents:
diff changeset
   802
    // PhiNode, the PhiNode uses from the def and IT's uses need fixup.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   803
    Node_Array inputs = new Node_List(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   804
    for(uint k = 1; k < use_blk->num_preds(); k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   805
      inputs.map(k, catch_cleanup_find_cloned_def(bbs[use_blk->pred(k)->_idx], def, def_blk, bbs, n_clone_idx));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   807
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
    // Check to see if the use_blk already has an identical phi inserted.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   809
    // If it exists, it will be at the first position since all uses of a
489c9b5090e2 Initial load
duke
parents:
diff changeset
   810
    // def are processed together.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   811
    Node *phi = use_blk->_nodes[1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   812
    if( phi->is_Phi() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   813
      fixup = phi;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   814
      for (uint k = 1; k < use_blk->num_preds(); k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
        if (phi->in(k) != inputs[k]) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
          // Not a match
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
          fixup = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   822
489c9b5090e2 Initial load
duke
parents:
diff changeset
   823
    // If an existing PhiNode was not found, make a new one.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   824
    if (fixup == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   825
      Node *new_phi = PhiNode::make(use_blk->head(), def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   826
      use_blk->_nodes.insert(1, new_phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   827
      bbs.map(new_phi->_idx, use_blk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   828
      for (uint k = 1; k < use_blk->num_preds(); k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   829
        new_phi->set_req(k, inputs[k]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   830
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   831
      fixup = new_phi;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   832
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   833
489c9b5090e2 Initial load
duke
parents:
diff changeset
   834
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   835
    // Found the use just below the Catch.  Make it use the clone.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   836
    fixup = use_blk->_nodes[n_clone_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   837
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   838
489c9b5090e2 Initial load
duke
parents:
diff changeset
   839
  return fixup;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   840
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   841
489c9b5090e2 Initial load
duke
parents:
diff changeset
   842
//--------------------------catch_cleanup_intra_block--------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   843
// Fix all input edges in use that reference "def".  The use is in the same
489c9b5090e2 Initial load
duke
parents:
diff changeset
   844
// block as the def and both have been cloned in each successor block.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   845
static void catch_cleanup_intra_block(Node *use, Node *def, Block *blk, int beg, int n_clone_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   846
489c9b5090e2 Initial load
duke
parents:
diff changeset
   847
  // Both the use and def have been cloned. For each successor block,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   848
  // get the clone of the use, and make its input the clone of the def
489c9b5090e2 Initial load
duke
parents:
diff changeset
   849
  // found in that block.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   850
489c9b5090e2 Initial load
duke
parents:
diff changeset
   851
  uint use_idx = blk->find_node(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   852
  uint offset_idx = use_idx - beg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   853
  for( uint k = 0; k < blk->_num_succs; k++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   854
    // Get clone in each successor block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   855
    Block *sb = blk->_succs[k];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   856
    Node *clone = sb->_nodes[offset_idx+1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   857
    assert( clone->Opcode() == use->Opcode(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   858
489c9b5090e2 Initial load
duke
parents:
diff changeset
   859
    // Make use-clone reference the def-clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
   860
    catch_cleanup_fix_all_inputs(clone, def, sb->_nodes[n_clone_idx]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   861
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   862
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   863
489c9b5090e2 Initial load
duke
parents:
diff changeset
   864
//------------------------------catch_cleanup_inter_block---------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   865
// Fix all input edges in use that reference "def".  The use is in a different
489c9b5090e2 Initial load
duke
parents:
diff changeset
   866
// block than the def.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   867
static void catch_cleanup_inter_block(Node *use, Block *use_blk, Node *def, Block *def_blk, Block_Array &bbs, int n_clone_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   868
  if( !use_blk ) return;        // Can happen if the use is a precedence edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
   869
489c9b5090e2 Initial load
duke
parents:
diff changeset
   870
  Node *new_def = catch_cleanup_find_cloned_def(use_blk, def, def_blk, bbs, n_clone_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   871
  catch_cleanup_fix_all_inputs(use, def, new_def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   872
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   873
489c9b5090e2 Initial load
duke
parents:
diff changeset
   874
//------------------------------call_catch_cleanup-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   875
// If we inserted any instructions between a Call and his CatchNode,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   876
// clone the instructions on all paths below the Catch.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   877
void Block::call_catch_cleanup(Block_Array &bbs) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   878
489c9b5090e2 Initial load
duke
parents:
diff changeset
   879
  // End of region to clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
   880
  uint end = end_idx();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   881
  if( !_nodes[end]->is_Catch() ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   882
  // Start of region to clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
   883
  uint beg = end;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   884
  while( _nodes[beg-1]->Opcode() != Op_MachProj ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   885
        !_nodes[beg-1]->in(0)->is_Call() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
    beg--;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   887
    assert(beg > 0,"Catch cleanup walking beyond block boundary");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   888
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   889
  // Range of inserted instructions is [beg, end)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   890
  if( beg == end ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   891
489c9b5090e2 Initial load
duke
parents:
diff changeset
   892
  // Clone along all Catch output paths.  Clone area between the 'beg' and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   893
  // 'end' indices.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   894
  for( uint i = 0; i < _num_succs; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
    Block *sb = _succs[i];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
    // Clone the entire area; ignoring the edge fixup for now.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
    for( uint j = end; j > beg; j-- ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   898
      Node *clone = _nodes[j-1]->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
      sb->_nodes.insert( 1, clone );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   900
      bbs.map(clone->_idx,sb);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   901
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   902
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   903
489c9b5090e2 Initial load
duke
parents:
diff changeset
   904
489c9b5090e2 Initial load
duke
parents:
diff changeset
   905
  // Fixup edges.  Check the def-use info per cloned Node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   906
  for(uint i2 = beg; i2 < end; i2++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   907
    uint n_clone_idx = i2-beg+1; // Index of clone of n in each successor block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   908
    Node *n = _nodes[i2];        // Node that got cloned
489c9b5090e2 Initial load
duke
parents:
diff changeset
   909
    // Need DU safe iterator because of edge manipulation in calls.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   910
    Unique_Node_List *out = new Unique_Node_List(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   911
    for (DUIterator_Fast j1max, j1 = n->fast_outs(j1max); j1 < j1max; j1++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   912
      out->push(n->fast_out(j1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   913
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   914
    uint max = out->size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   915
    for (uint j = 0; j < max; j++) {// For all users
489c9b5090e2 Initial load
duke
parents:
diff changeset
   916
      Node *use = out->pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   917
      Block *buse = bbs[use->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   918
      if( use->is_Phi() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   919
        for( uint k = 1; k < use->req(); k++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   920
          if( use->in(k) == n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   921
            Node *fixup = catch_cleanup_find_cloned_def(bbs[buse->pred(k)->_idx], n, this, bbs, n_clone_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   922
            use->set_req(k, fixup);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   923
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   924
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   925
        if (this == buse) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   926
          catch_cleanup_intra_block(use, n, this, beg, n_clone_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   927
        } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   928
          catch_cleanup_inter_block(use, buse, n, this, bbs, n_clone_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   929
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   930
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   931
    } // End for all users
489c9b5090e2 Initial load
duke
parents:
diff changeset
   932
489c9b5090e2 Initial load
duke
parents:
diff changeset
   933
  } // End of for all Nodes in cloned area
489c9b5090e2 Initial load
duke
parents:
diff changeset
   934
489c9b5090e2 Initial load
duke
parents:
diff changeset
   935
  // Remove the now-dead cloned ops
489c9b5090e2 Initial load
duke
parents:
diff changeset
   936
  for(uint i3 = beg; i3 < end; i3++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   937
    _nodes[beg]->disconnect_inputs(NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   938
    _nodes.remove(beg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   939
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   940
489c9b5090e2 Initial load
duke
parents:
diff changeset
   941
  // If the successor blocks have a CreateEx node, move it back to the top
489c9b5090e2 Initial load
duke
parents:
diff changeset
   942
  for(uint i4 = 0; i4 < _num_succs; i4++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   943
    Block *sb = _succs[i4];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   944
    uint new_cnt = end - beg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   945
    // Remove any newly created, but dead, nodes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   946
    for( uint j = new_cnt; j > 0; j-- ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   947
      Node *n = sb->_nodes[j];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   948
      if (n->outcnt() == 0 &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   949
          (!n->is_Proj() || n->as_Proj()->in(0)->outcnt() == 1) ){
489c9b5090e2 Initial load
duke
parents:
diff changeset
   950
        n->disconnect_inputs(NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   951
        sb->_nodes.remove(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   952
        new_cnt--;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   953
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   954
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   955
    // If any newly created nodes remain, move the CreateEx node to the top
489c9b5090e2 Initial load
duke
parents:
diff changeset
   956
    if (new_cnt > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   957
      Node *cex = sb->_nodes[1+new_cnt];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   958
      if( cex->is_Mach() && cex->as_Mach()->ideal_Opcode() == Op_CreateEx ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   959
        sb->_nodes.remove(1+new_cnt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   960
        sb->_nodes.insert(1,cex);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   961
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   962
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   963
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   964
}