hotspot/src/share/vm/opto/loopopts.cpp
author roland
Sat, 19 Oct 2013 12:16:43 +0200
changeset 21089 e1986ff6fe2e
parent 20289 35d78de0c547
child 21577 471d08cfc988
permissions -rw-r--r--
8024069: replace_in_map() should operate on parent maps Summary: type information gets lost because replace_in_map() doesn't update parent maps Reviewed-by: kvn, twisti
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
13963
e5b53c306fb5 7197424: update copyright year to match last edit in jdk8 hotspot repository
mikael
parents: 13895
diff changeset
     2
 * Copyright (c) 1999, 2012, Oracle and/or its affiliates. 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
 *
5547
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 4895
diff changeset
    19
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 4895
diff changeset
    20
 * or visit www.oracle.com if you need additional information or have any
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 4895
diff changeset
    21
 * questions.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    25
#include "precompiled.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    26
#include "memory/allocation.inline.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    27
#include "opto/addnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    28
#include "opto/connode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    29
#include "opto/divnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    30
#include "opto/loopnode.hpp"
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
    31
#include "opto/matcher.hpp"
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    32
#include "opto/mulnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    33
#include "opto/rootnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    34
#include "opto/subnode.hpp"
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
//------------------------------split_thru_phi---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
// Split Node 'n' through merge point if there is enough win.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
Node *PhaseIdealLoop::split_thru_phi( Node *n, Node *region, int policy ) {
242
f4a8c30a53b0 6659207: access violation in CompilerThread0
never
parents: 237
diff changeset
    40
  if (n->Opcode() == Op_ConvI2L && n->bottom_type() != TypeLong::LONG) {
f4a8c30a53b0 6659207: access violation in CompilerThread0
never
parents: 237
diff changeset
    41
    // ConvI2L may have type information on it which is unsafe to push up
f4a8c30a53b0 6659207: access violation in CompilerThread0
never
parents: 237
diff changeset
    42
    // so disable this for now
f4a8c30a53b0 6659207: access violation in CompilerThread0
never
parents: 237
diff changeset
    43
    return NULL;
f4a8c30a53b0 6659207: access violation in CompilerThread0
never
parents: 237
diff changeset
    44
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
  int wins = 0;
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
    46
  assert(!n->is_CFG(), "");
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
    47
  assert(region->is_Region(), "");
237
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 208
diff changeset
    48
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 208
diff changeset
    49
  const Type* type = n->bottom_type();
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 208
diff changeset
    50
  const TypeOopPtr *t_oop = _igvn.type(n)->isa_oopptr();
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 208
diff changeset
    51
  Node *phi;
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
    52
  if (t_oop != NULL && t_oop->is_known_instance_field()) {
237
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 208
diff changeset
    53
    int iid    = t_oop->instance_id();
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 208
diff changeset
    54
    int index  = C->get_alias_index(t_oop);
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 208
diff changeset
    55
    int offset = t_oop->offset();
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
    56
    phi = new (C) PhiNode(region, type, NULL, iid, index, offset);
237
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 208
diff changeset
    57
  } else {
4895
6102d1a32ce8 6924097: assert((_type == Type::MEMORY) == (_adr_type != 0),"adr_type for memory phis only")
kvn
parents: 3283
diff changeset
    58
    phi = PhiNode::make_blank(region, n);
237
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 208
diff changeset
    59
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
  uint old_unique = C->unique();
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
    61
  for (uint i = 1; i < region->req(); i++) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
    Node *x;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
    Node* the_clone = NULL;
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
    64
    if (region->in(i) == C->top()) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
      x = C->top();             // Dead path?  Use a dead data op
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
      x = n->clone();           // Else clone up the data op
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
      the_clone = x;            // Remember for possible deletion.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
      // Alter data node to use pre-phi inputs
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
    70
      if (n->in(0) == region)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
        x->set_req( 0, region->in(i) );
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
    72
      for (uint j = 1; j < n->req(); j++) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
        Node *in = n->in(j);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
    74
        if (in->is_Phi() && in->in(0) == region)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
          x->set_req( j, in->in(i) ); // Use pre-Phi input for the clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
    // Check for a 'win' on some paths
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
    const Type *t = x->Value(&_igvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
    bool singleton = t->singleton();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
    // A TOP singleton indicates that there are no possible values incoming
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
    // along a particular edge. In most cases, this is OK, and the Phi will
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
    // be eliminated later in an Ideal call. However, we can't allow this to
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
    // happen if the singleton occurs on loop entry, as the elimination of
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
    // the PhiNode may cause the resulting node to migrate back to a previous
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
    // loop iteration.
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
    89
    if (singleton && t == Type::TOP) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
      // Is_Loop() == false does not confirm the absence of a loop (e.g., an
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
      // irreducible loop may not be indicated by an affirmative is_Loop());
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
      // therefore, the only top we can split thru a phi is on a backedge of
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
      // a loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
      singleton &= region->is_Loop() && (i != LoopNode::EntryControl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
    97
    if (singleton) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
      wins++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
      x = ((PhaseGVN&)_igvn).makecon(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
      // We now call Identity to try to simplify the cloned node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
      // Note that some Identity methods call phase->type(this).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
      // Make sure that the type array is big enough for
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
      // our new node, even though we may throw the node away.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
      // (Note: This tweaking with igvn only works because x is a new node.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
      _igvn.set_type(x, t);
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   107
      // If x is a TypeNode, capture any more-precise type permanently into Node
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1433
diff changeset
   108
      // otherwise it will be not updated during igvn->transform since
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   109
      // igvn->type(x) is set to x->Value() already.
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   110
      x->raise_bottom_type(t);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
      Node *y = x->Identity(&_igvn);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   112
      if (y != x) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
        wins++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
        x = y;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
        y = _igvn.hash_find(x);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   117
        if (y) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
          wins++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
          x = y;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
        } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
          // Else x is a new node we are keeping
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
          // We do not need register_new_node_with_optimizer
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
          // because set_type has already been called.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
          _igvn._worklist.push(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
    if (x != the_clone && the_clone != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
      _igvn.remove_dead_node(the_clone);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
    phi->set_req( i, x );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
  // Too few wins?
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   133
  if (wins <= policy) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
    _igvn.remove_dead_node(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
  // Record Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
  register_new_node( phi, region );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   141
  for (uint i2 = 1; i2 < phi->req(); i2++) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
    Node *x = phi->in(i2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
    // If we commoned up the cloned 'x' with another existing Node,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
    // the existing Node picks up a new use.  We need to make the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
    // existing Node occur higher up so it dominates its uses.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
    Node *old_ctrl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
    IdealLoopTree *old_loop;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   149
    if (x->is_Con()) {
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   150
      // Constant's control is always root.
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   151
      set_ctrl(x, C->root());
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   152
      continue;
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   153
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
    // The occasional new node
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   155
    if (x->_idx >= old_unique) {     // Found a new, unplaced node?
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   156
      old_ctrl = NULL;
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   157
      old_loop = NULL;               // Not in any prior loop
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
    } else {
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   159
      old_ctrl = get_ctrl(x);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
      old_loop = get_loop(old_ctrl); // Get prior loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
    // New late point must dominate new use
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   163
    Node *new_ctrl = dom_lca(old_ctrl, region->in(i2));
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   164
    if (new_ctrl == old_ctrl) // Nothing is changed
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   165
      continue;
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   166
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   167
    IdealLoopTree *new_loop = get_loop(new_ctrl);
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   168
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   169
    // Don't move x into a loop if its uses are
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   170
    // outside of loop. Otherwise x will be cloned
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   171
    // for each use outside of this loop.
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   172
    IdealLoopTree *use_loop = get_loop(region);
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   173
    if (!new_loop->is_member(use_loop) &&
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   174
        (old_loop == NULL || !new_loop->is_member(old_loop))) {
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   175
      // Take early control, later control will be recalculated
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   176
      // during next iteration of loop optimizations.
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   177
      new_ctrl = get_early_ctrl(x);
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   178
      new_loop = get_loop(new_ctrl);
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   179
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
    // Set new location
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
    set_ctrl(x, new_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
    // If changing loop bodies, see if we need to collect into new body
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   183
    if (old_loop != new_loop) {
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   184
      if (old_loop && !old_loop->_child)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
        old_loop->_body.yank(x);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   186
      if (!new_loop->_child)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
        new_loop->_body.push(x);  // Collect body info
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
  return phi;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
//------------------------------dominated_by------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
// Replace the dominated test with an obvious true or false.  Place it on the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
// IGVN worklist for later cleanup.  Move control-dependent data Nodes on the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
// live path up to the dominating control.
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9330
diff changeset
   198
void PhaseIdealLoop::dominated_by( Node *prevdom, Node *iff, bool flip, bool exclude_loop_predicate ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
#ifndef PRODUCT
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   200
  if (VerifyLoopOptimizations && PrintOpto) tty->print_cr("dominating test");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
  // prevdom is the dominating projection of the dominating test.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
  assert( iff->is_If(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
  assert( iff->Opcode() == Op_If || iff->Opcode() == Op_CountedLoopEnd, "Check this code when new subtype is added");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
  int pop = prevdom->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
  assert( pop == Op_IfFalse || pop == Op_IfTrue, "" );
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   209
  if (flip) {
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   210
    if (pop == Op_IfTrue)
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   211
      pop = Op_IfFalse;
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   212
    else
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   213
      pop = Op_IfTrue;
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   214
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
  // 'con' is set to true or false to kill the dominated test.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
  Node *con = _igvn.makecon(pop == Op_IfTrue ? TypeInt::ONE : TypeInt::ZERO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
  set_ctrl(con, C->root()); // Constant gets a new use
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
  // Hack the dominated test
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
   219
  _igvn.replace_input_of(iff, 1, con);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
489c9b5090e2 Initial load
duke
parents:
diff changeset
   221
  // If I dont have a reachable TRUE and FALSE path following the IfNode then
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
  // I can assume this path reaches an infinite loop.  In this case it's not
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
  // important to optimize the data Nodes - either the whole compilation will
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
  // be tossed or this path (and all data Nodes) will go dead.
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   225
  if (iff->outcnt() != 2) return;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   226
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
  // Make control-dependent data Nodes on the live path (path that will remain
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
  // once the dominated IF is removed) become control-dependent on the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
  // dominating projection.
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9330
diff changeset
   230
  Node* dp = iff->as_If()->proj_out(pop == Op_IfTrue);
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9330
diff changeset
   231
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9330
diff changeset
   232
  // Loop predicates may have depending checks which should not
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9330
diff changeset
   233
  // be skipped. For example, range check predicate has two checks
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9330
diff changeset
   234
  // for lower and upper bounds.
16375
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
   235
  if (dp == NULL)
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
   236
    return;
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
   237
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
   238
  ProjNode* dp_proj  = dp->as_Proj();
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
   239
  ProjNode* unc_proj = iff->as_If()->proj_out(1 - dp_proj->_con)->as_Proj();
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9330
diff changeset
   240
  if (exclude_loop_predicate &&
21089
e1986ff6fe2e 8024069: replace_in_map() should operate on parent maps
roland
parents: 20289
diff changeset
   241
      unc_proj->is_uncommon_trap_proj(Deoptimization::Reason_predicate))
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9330
diff changeset
   242
    return; // Let IGVN transformation change control dependence.
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9330
diff changeset
   243
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   244
  IdealLoopTree *old_loop = get_loop(dp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
489c9b5090e2 Initial load
duke
parents:
diff changeset
   246
  for (DUIterator_Fast imax, i = dp->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
    Node* cd = dp->fast_out(i); // Control-dependent node
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   248
    if (cd->depends_only_on_test()) {
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   249
      assert(cd->in(0) == dp, "");
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
   250
      _igvn.replace_input_of(cd, 0, prevdom);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   251
      set_early_ctrl(cd);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   252
      IdealLoopTree *new_loop = get_loop(get_ctrl(cd));
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   253
      if (old_loop != new_loop) {
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   254
        if (!old_loop->_child) old_loop->_body.yank(cd);
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
   255
        if (!new_loop->_child) new_loop->_body.push(cd);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
      --i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
      --imax;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   262
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
//------------------------------has_local_phi_input----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   264
// Return TRUE if 'n' has Phi inputs from its local block and no other
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
// block-local inputs (all non-local-phi inputs come from earlier blocks)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
Node *PhaseIdealLoop::has_local_phi_input( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
  Node *n_ctrl = get_ctrl(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
  // See if some inputs come from a Phi in this block, or from before
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
  // this block.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
  uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
  for( i = 1; i < n->req(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
    Node *phi = n->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
    if( phi->is_Phi() && phi->in(0) == n_ctrl )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
  if( i >= n->req() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
    return NULL;                // No Phi inputs; nowhere to clone thru
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
  // Check for inputs created between 'n' and the Phi input.  These
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
  // must split as well; they have already been given the chance
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
  // (courtesy of a post-order visit) and since they did not we must
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
  // recover the 'cost' of splitting them by being very profitable
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
  // when splitting 'n'.  Since this is unlikely we simply give up.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
  for( i = 1; i < n->req(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
    Node *m = n->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
    if( get_ctrl(m) == n_ctrl && !m->is_Phi() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
      // We allow the special case of AddP's with no local inputs.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
      // This allows us to split-up address expressions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
      if (m->is_AddP() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
          get_ctrl(m->in(2)) != n_ctrl &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
          get_ctrl(m->in(3)) != n_ctrl) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
        // Move the AddP up to dominating point
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
        set_ctrl_and_loop(m, find_non_split_ctrl(idom(n_ctrl)));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
  return n_ctrl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
489c9b5090e2 Initial load
duke
parents:
diff changeset
   303
//------------------------------remix_address_expressions----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
// Rework addressing expressions to get the most loop-invariant stuff
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
// moved out.  We'd like to do all associative operators, but it's especially
489c9b5090e2 Initial load
duke
parents:
diff changeset
   306
// important (common) to do address expressions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
Node *PhaseIdealLoop::remix_address_expressions( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
  if (!has_ctrl(n))  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
  Node *n_ctrl = get_ctrl(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
  IdealLoopTree *n_loop = get_loop(n_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
  // See if 'n' mixes loop-varying and loop-invariant inputs and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   313
  // itself is loop-varying.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
  // Only interested in binary ops (and AddP)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   316
  if( n->req() < 3 || n->req() > 4 ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
  Node *n1_ctrl = get_ctrl(n->in(                    1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
  Node *n2_ctrl = get_ctrl(n->in(                    2));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
  Node *n3_ctrl = get_ctrl(n->in(n->req() == 3 ? 2 : 3));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
  IdealLoopTree *n1_loop = get_loop( n1_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
  IdealLoopTree *n2_loop = get_loop( n2_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
  IdealLoopTree *n3_loop = get_loop( n3_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
489c9b5090e2 Initial load
duke
parents:
diff changeset
   325
  // Does one of my inputs spin in a tighter loop than self?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   326
  if( (n_loop->is_member( n1_loop ) && n_loop != n1_loop) ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
      (n_loop->is_member( n2_loop ) && n_loop != n2_loop) ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
      (n_loop->is_member( n3_loop ) && n_loop != n3_loop) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
    return NULL;                // Leave well enough alone
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
  // Is at least one of my inputs loop-invariant?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
  if( n1_loop == n_loop &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
      n2_loop == n_loop &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
      n3_loop == n_loop )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
    return NULL;                // No loop-invariant inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
489c9b5090e2 Initial load
duke
parents:
diff changeset
   337
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
  int n_op = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   339
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
  // Replace expressions like ((V+I) << 2) with (V<<2 + I<<2).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   341
  if( n_op == Op_LShiftI ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   342
    // Scale is loop invariant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
    Node *scale = n->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   344
    Node *scale_ctrl = get_ctrl(scale);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
    IdealLoopTree *scale_loop = get_loop(scale_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
    if( n_loop == scale_loop || !scale_loop->is_member( n_loop ) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
    const TypeInt *scale_t = scale->bottom_type()->isa_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
    if( scale_t && scale_t->is_con() && scale_t->get_con() >= 16 )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
      return NULL;              // Dont bother with byte/short masking
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
    // Add must vary with loop (else shift would be loop-invariant)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
    Node *add = n->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
    Node *add_ctrl = get_ctrl(add);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
    IdealLoopTree *add_loop = get_loop(add_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
    //assert( n_loop == add_loop, "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
    if( n_loop != add_loop ) return NULL;  // happens w/ evil ZKM loops
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
    // Convert I-V into I+ (0-V); same for V-I
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
    if( add->Opcode() == Op_SubI &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
        _igvn.type( add->in(1) ) != TypeInt::ZERO ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
      Node *zero = _igvn.intcon(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
      set_ctrl(zero, C->root());
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   363
      Node *neg = new (C) SubINode( _igvn.intcon(0), add->in(2) );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   364
      register_new_node( neg, get_ctrl(add->in(2) ) );
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   365
      add = new (C) AddINode( add->in(1), neg );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
      register_new_node( add, add_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
    if( add->Opcode() != Op_AddI ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
    // See if one add input is loop invariant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
    Node *add_var = add->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
    Node *add_var_ctrl = get_ctrl(add_var);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
    IdealLoopTree *add_var_loop = get_loop(add_var_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
    Node *add_invar = add->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   374
    Node *add_invar_ctrl = get_ctrl(add_invar);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
    IdealLoopTree *add_invar_loop = get_loop(add_invar_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
    if( add_var_loop == n_loop ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
    } else if( add_invar_loop == n_loop ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
      // Swap to find the invariant part
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
      add_invar = add_var;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   380
      add_invar_ctrl = add_var_ctrl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
      add_invar_loop = add_var_loop;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
      add_var = add->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
      Node *add_var_ctrl = get_ctrl(add_var);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
      IdealLoopTree *add_var_loop = get_loop(add_var_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
    } else                      // Else neither input is loop invariant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   387
    if( n_loop == add_invar_loop || !add_invar_loop->is_member( n_loop ) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
      return NULL;              // No invariant part of the add?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
    // Yes!  Reshape address expression!
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   391
    Node *inv_scale = new (C) LShiftINode( add_invar, scale );
3267
519fbe71f995 6860469: remix_address_expressions sets incorrect control causing crash in split_if_with_block_post
never
parents: 3187
diff changeset
   392
    Node *inv_scale_ctrl =
519fbe71f995 6860469: remix_address_expressions sets incorrect control causing crash in split_if_with_block_post
never
parents: 3187
diff changeset
   393
      dom_depth(add_invar_ctrl) > dom_depth(scale_ctrl) ?
519fbe71f995 6860469: remix_address_expressions sets incorrect control causing crash in split_if_with_block_post
never
parents: 3187
diff changeset
   394
      add_invar_ctrl : scale_ctrl;
519fbe71f995 6860469: remix_address_expressions sets incorrect control causing crash in split_if_with_block_post
never
parents: 3187
diff changeset
   395
    register_new_node( inv_scale, inv_scale_ctrl );
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   396
    Node *var_scale = new (C) LShiftINode( add_var, scale );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
    register_new_node( var_scale, n_ctrl );
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   398
    Node *var_add = new (C) AddINode( var_scale, inv_scale );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
    register_new_node( var_add, n_ctrl );
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
   400
    _igvn.replace_node( n, var_add );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
    return var_add;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
  // Replace (I+V) with (V+I)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
  if( n_op == Op_AddI ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
      n_op == Op_AddL ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
      n_op == Op_AddF ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
      n_op == Op_AddD ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
      n_op == Op_MulI ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
      n_op == Op_MulL ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
      n_op == Op_MulF ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
      n_op == Op_MulD ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
    if( n2_loop == n_loop ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
      assert( n1_loop != n_loop, "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
      n->swap_edges(1, 2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
  // Replace ((I1 +p V) +p I2) with ((I1 +p I2) +p V),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   420
  // but not if I2 is a constant.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   421
  if( n_op == Op_AddP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   422
    if( n2_loop == n_loop && n3_loop != n_loop ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   423
      if( n->in(2)->Opcode() == Op_AddP && !n->in(3)->is_Con() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
        Node *n22_ctrl = get_ctrl(n->in(2)->in(2));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   425
        Node *n23_ctrl = get_ctrl(n->in(2)->in(3));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   426
        IdealLoopTree *n22loop = get_loop( n22_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   427
        IdealLoopTree *n23_loop = get_loop( n23_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   428
        if( n22loop != n_loop && n22loop->is_member(n_loop) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   429
            n23_loop == n_loop ) {
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   430
          Node *add1 = new (C) AddPNode( n->in(1), n->in(2)->in(2), n->in(3) );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
          // Stuff new AddP in the loop preheader
489c9b5090e2 Initial load
duke
parents:
diff changeset
   432
          register_new_node( add1, n_loop->_head->in(LoopNode::EntryControl) );
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   433
          Node *add2 = new (C) AddPNode( n->in(1), add1, n->in(2)->in(3) );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
          register_new_node( add2, n_ctrl );
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
   435
          _igvn.replace_node( n, add2 );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
          return add2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
489c9b5090e2 Initial load
duke
parents:
diff changeset
   441
    // Replace (I1 +p (I2 + V)) with ((I1 +p I2) +p V)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   442
    if( n2_loop != n_loop && n3_loop == n_loop ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
      if( n->in(3)->Opcode() == Op_AddI ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
        Node *V = n->in(3)->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
        Node *I = n->in(3)->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
        if( is_member(n_loop,get_ctrl(V)) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
        } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
          Node *tmp = V; V = I; I = tmp;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   449
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
        if( !is_member(n_loop,get_ctrl(I)) ) {
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   451
          Node *add1 = new (C) AddPNode( n->in(1), n->in(2), I );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
          // Stuff new AddP in the loop preheader
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
          register_new_node( add1, n_loop->_head->in(LoopNode::EntryControl) );
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   454
          Node *add2 = new (C) AddPNode( n->in(1), add1, V );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
          register_new_node( add2, n_ctrl );
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
   456
          _igvn.replace_node( n, add2 );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
          return add2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   459
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
//------------------------------conditional_move-------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
// Attempt to replace a Phi with a conditional move.  We have some pretty
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
// strict profitability requirements.  All Phis at the merge point must
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
// be converted, so we can remove the control flow.  We need to limit the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
// number of c-moves to a small handful.  All code that was in the side-arms
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
// of the CFG diamond is now speculatively executed.  This code has to be
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
// "cheap enough".  We are pretty much limited to CFG diamonds that merge
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
// 1 or 2 items with a total of 1 or 2 ops executed speculatively.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
Node *PhaseIdealLoop::conditional_move( Node *region ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   476
  assert(region->is_Region(), "sanity check");
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   477
  if (region->req() != 3) return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
  // Check for CFG diamond
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
  Node *lp = region->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
  Node *rp = region->in(2);
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   482
  if (!lp || !rp) return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
  Node *lp_c = lp->in(0);
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   484
  if (lp_c == NULL || lp_c != rp->in(0) || !lp_c->is_If()) return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
  IfNode *iff = lp_c->as_If();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
  // Check for ops pinned in an arm of the diamond.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
  // Can't remove the control flow in this case
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   489
  if (lp->outcnt() > 1) return NULL;
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   490
  if (rp->outcnt() > 1) return NULL;
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   491
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   492
  IdealLoopTree* r_loop = get_loop(region);
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   493
  assert(r_loop == get_loop(iff), "sanity");
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   494
  // Always convert to CMOVE if all results are used only outside this loop.
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   495
  bool used_inside_loop = (r_loop == _ltree_root);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
  // Check profitability
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
  int cost = 0;
208
40859a3e0db9 6667588: Don't generate duplicated CMP for float/double values
kvn
parents: 1
diff changeset
   499
  int phis = 0;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
  for (DUIterator_Fast imax, i = region->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
    Node *out = region->fast_out(i);
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   502
    if (!out->is_Phi()) continue; // Ignore other control edges, etc
208
40859a3e0db9 6667588: Don't generate duplicated CMP for float/double values
kvn
parents: 1
diff changeset
   503
    phis++;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   504
    PhiNode* phi = out->as_Phi();
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   505
    BasicType bt = phi->type()->basic_type();
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   506
    switch (bt) {
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   507
    case T_FLOAT:
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   508
    case T_DOUBLE: {
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   509
      cost += Matcher::float_cmove_cost(); // Could be very expensive
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   510
      break;
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   511
    }
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   512
    case T_LONG: {
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   513
      cost += Matcher::long_cmove_cost(); // May encodes as 2 CMOV's
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   514
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
    case T_INT:                 // These all CMOV fine
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   516
    case T_ADDRESS: {           // (RawPtr)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
      cost++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
      break;
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   519
    }
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   520
    case T_NARROWOOP: // Fall through
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
    case T_OBJECT: {            // Base oops are OK, but not derived oops
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   522
      const TypeOopPtr *tp = phi->type()->make_ptr()->isa_oopptr();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
      // Derived pointers are Bad (tm): what's the Base (for GC purposes) of a
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
      // CMOVE'd derived pointer?  It's a CMOVE'd derived base.  Thus
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
      // CMOVE'ing a derived pointer requires we also CMOVE the base.  If we
489c9b5090e2 Initial load
duke
parents:
diff changeset
   526
      // have a Phi for the base here that we convert to a CMOVE all is well
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
      // and good.  But if the base is dead, we'll not make a CMOVE.  Later
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
      // the allocator will have to produce a base by creating a CMOVE of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
      // relevant bases.  This puts the allocator in the business of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
      // manufacturing expensive instructions, generally a bad plan.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
      // Just Say No to Conditionally-Moved Derived Pointers.
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   532
      if (tp && tp->offset() != 0)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
        return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
      cost++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
    default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
      return NULL;              // In particular, can't do memory or I/O
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
    // Add in cost any speculative ops
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   541
    for (uint j = 1; j < region->req(); j++) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
      Node *proj = region->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   543
      Node *inp = phi->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   544
      if (get_ctrl(inp) == proj) { // Found local op
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
        cost++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
        // Check for a chain of dependent ops; these will all become
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
        // speculative in a CMOV.
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   548
        for (uint k = 1; k < inp->req(); k++)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
          if (get_ctrl(inp->in(k)) == proj)
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   550
            cost += ConditionalMoveLimit; // Too much speculative goo
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
    }
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   553
    // See if the Phi is used by a Cmp or Narrow oop Decode/Encode.
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   554
    // This will likely Split-If, a higher-payoff operation.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
    for (DUIterator_Fast kmax, k = phi->fast_outs(kmax); k < kmax; k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
      Node* use = phi->fast_out(k);
13969
d2a189b83b87 7054512: Compress class pointers after perm gen removal
roland
parents: 13895
diff changeset
   557
      if (use->is_Cmp() || use->is_DecodeNarrowPtr() || use->is_EncodeNarrowPtr())
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   558
        cost += ConditionalMoveLimit;
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   559
      // Is there a use inside the loop?
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   560
      // Note: check only basic types since CMoveP is pinned.
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   561
      if (!used_inside_loop && is_java_primitive(bt)) {
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   562
        IdealLoopTree* u_loop = get_loop(has_ctrl(use) ? get_ctrl(use) : use);
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   563
        if (r_loop == u_loop || r_loop->is_member(u_loop)) {
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   564
          used_inside_loop = true;
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   565
        }
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   566
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
  }
208
40859a3e0db9 6667588: Don't generate duplicated CMP for float/double values
kvn
parents: 1
diff changeset
   569
  Node* bol = iff->in(1);
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   570
  assert(bol->Opcode() == Op_Bool, "");
208
40859a3e0db9 6667588: Don't generate duplicated CMP for float/double values
kvn
parents: 1
diff changeset
   571
  int cmp_op = bol->in(1)->Opcode();
40859a3e0db9 6667588: Don't generate duplicated CMP for float/double values
kvn
parents: 1
diff changeset
   572
  // It is expensive to generate flags from a float compare.
40859a3e0db9 6667588: Don't generate duplicated CMP for float/double values
kvn
parents: 1
diff changeset
   573
  // Avoid duplicated float compare.
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   574
  if (phis > 1 && (cmp_op == Op_CmpF || cmp_op == Op_CmpD)) return NULL;
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   575
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   576
  float infrequent_prob = PROB_UNLIKELY_MAG(3);
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   577
  // Ignore cost and blocks frequency if CMOVE can be moved outside the loop.
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   578
  if (used_inside_loop) {
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   579
    if (cost >= ConditionalMoveLimit) return NULL; // Too much goo
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   580
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   581
    // BlockLayoutByFrequency optimization moves infrequent branch
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   582
    // from hot path. No point in CMOV'ing in such case (110 is used
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   583
    // instead of 100 to take into account not exactness of float value).
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   584
    if (BlockLayoutByFrequency) {
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   585
      infrequent_prob = MAX2(infrequent_prob, (float)BlockLayoutMinDiamondPercentage/110.0f);
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   586
    }
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   587
  }
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   588
  // Check for highly predictable branch.  No point in CMOV'ing if
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   589
  // we are going to predict accurately all the time.
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   590
  if (iff->_prob < infrequent_prob ||
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   591
      iff->_prob > (1.0f - infrequent_prob))
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   592
    return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
  // --------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
  // Now replace all Phis with CMOV's
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
  Node *cmov_ctrl = iff->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
  uint flip = (lp->Opcode() == Op_IfTrue);
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   598
  while (1) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
    PhiNode* phi = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
    for (DUIterator_Fast imax, i = region->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
      Node *out = region->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
      if (out->is_Phi()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
        phi = out->as_Phi();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   605
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
    if (phi == NULL)  break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
#ifndef PRODUCT
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   609
    if (PrintOpto && VerifyLoopOptimizations) tty->print_cr("CMOV");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   610
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   611
    // Move speculative ops
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   612
    for (uint j = 1; j < region->req(); j++) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   613
      Node *proj = region->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   614
      Node *inp = phi->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   615
      if (get_ctrl(inp) == proj) { // Found local op
489c9b5090e2 Initial load
duke
parents:
diff changeset
   616
#ifndef PRODUCT
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   617
        if (PrintOpto && VerifyLoopOptimizations) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   618
          tty->print("  speculate: ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   619
          inp->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   620
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   621
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   622
        set_ctrl(inp, cmov_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   623
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   624
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   625
    Node *cmov = CMoveNode::make( C, cmov_ctrl, iff->in(1), phi->in(1+flip), phi->in(2-flip), _igvn.type(phi) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   626
    register_new_node( cmov, cmov_ctrl );
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
   627
    _igvn.replace_node( phi, cmov );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   628
#ifndef PRODUCT
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   629
    if (TraceLoopOpts) {
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   630
      tty->print("CMOV  ");
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   631
      r_loop->dump_head();
10988
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10971
diff changeset
   632
      if (Verbose) {
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   633
        bol->in(1)->dump(1);
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   634
        cmov->dump(1);
10988
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10971
diff changeset
   635
      }
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   636
    }
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   637
    if (VerifyLoopOptimizations) verify();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   638
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   639
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   640
489c9b5090e2 Initial load
duke
parents:
diff changeset
   641
  // The useless CFG diamond will fold up later; see the optimization in
489c9b5090e2 Initial load
duke
parents:
diff changeset
   642
  // RegionNode::Ideal.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   643
  _igvn._worklist.push(region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   644
489c9b5090e2 Initial load
duke
parents:
diff changeset
   645
  return iff->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   646
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   647
489c9b5090e2 Initial load
duke
parents:
diff changeset
   648
//------------------------------split_if_with_blocks_pre-----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   649
// Do the real work in a non-recursive function.  Data nodes want to be
489c9b5090e2 Initial load
duke
parents:
diff changeset
   650
// cloned in the pre-order so they can feed each other nicely.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   651
Node *PhaseIdealLoop::split_if_with_blocks_pre( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   652
  // Cloning these guys is unlikely to win
489c9b5090e2 Initial load
duke
parents:
diff changeset
   653
  int n_op = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   654
  if( n_op == Op_MergeMem ) return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   655
  if( n->is_Proj() ) return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   656
  // Do not clone-up CmpFXXX variations, as these are always
489c9b5090e2 Initial load
duke
parents:
diff changeset
   657
  // followed by a CmpI
489c9b5090e2 Initial load
duke
parents:
diff changeset
   658
  if( n->is_Cmp() ) return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   659
  // Attempt to use a conditional move instead of a phi/branch
489c9b5090e2 Initial load
duke
parents:
diff changeset
   660
  if( ConditionalMoveLimit > 0 && n_op == Op_Region ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   661
    Node *cmov = conditional_move( n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   662
    if( cmov ) return cmov;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   663
  }
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 959
diff changeset
   664
  if( n->is_CFG() || n->is_LoadStore() )
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 959
diff changeset
   665
    return n;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   666
  if( n_op == Op_Opaque1 ||     // Opaque nodes cannot be mod'd
489c9b5090e2 Initial load
duke
parents:
diff changeset
   667
      n_op == Op_Opaque2 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   668
    if( !C->major_progress() )   // If chance of no more loop opts...
489c9b5090e2 Initial load
duke
parents:
diff changeset
   669
      _igvn._worklist.push(n);  // maybe we'll remove them
489c9b5090e2 Initial load
duke
parents:
diff changeset
   670
    return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   671
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   672
489c9b5090e2 Initial load
duke
parents:
diff changeset
   673
  if( n->is_Con() ) return n;   // No cloning for Con nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   674
489c9b5090e2 Initial load
duke
parents:
diff changeset
   675
  Node *n_ctrl = get_ctrl(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   676
  if( !n_ctrl ) return n;       // Dead node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   677
489c9b5090e2 Initial load
duke
parents:
diff changeset
   678
  // Attempt to remix address expressions for loop invariants
489c9b5090e2 Initial load
duke
parents:
diff changeset
   679
  Node *m = remix_address_expressions( n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   680
  if( m ) return m;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   681
489c9b5090e2 Initial load
duke
parents:
diff changeset
   682
  // Determine if the Node has inputs from some local Phi.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   683
  // Returns the block to clone thru.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   684
  Node *n_blk = has_local_phi_input( n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   685
  if( !n_blk ) return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   686
  // Do not clone the trip counter through on a CountedLoop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   687
  // (messes up the canonical shape).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   688
  if( n_blk->is_CountedLoop() && n->Opcode() == Op_AddI ) return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   689
489c9b5090e2 Initial load
duke
parents:
diff changeset
   690
  // Check for having no control input; not pinned.  Allow
489c9b5090e2 Initial load
duke
parents:
diff changeset
   691
  // dominating control.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   692
  if( n->in(0) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   693
    Node *dom = idom(n_blk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   694
    if( dom_lca( n->in(0), dom ) != n->in(0) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   695
      return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   696
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   697
  // Policy: when is it profitable.  You must get more wins than
489c9b5090e2 Initial load
duke
parents:
diff changeset
   698
  // policy before it is considered profitable.  Policy is usually 0,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   699
  // so 1 win is considered profitable.  Big merges will require big
489c9b5090e2 Initial load
duke
parents:
diff changeset
   700
  // cloning, so get a larger policy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   701
  int policy = n_blk->req() >> 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   702
489c9b5090e2 Initial load
duke
parents:
diff changeset
   703
  // If the loop is a candidate for range check elimination,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   704
  // delay splitting through it's phi until a later loop optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
   705
  if (n_blk->is_CountedLoop()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   706
    IdealLoopTree *lp = get_loop(n_blk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   707
    if (lp && lp->_rce_candidate) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   708
      return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   709
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   710
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   711
489c9b5090e2 Initial load
duke
parents:
diff changeset
   712
  // Use same limit as split_if_with_blocks_post
489c9b5090e2 Initial load
duke
parents:
diff changeset
   713
  if( C->unique() > 35000 ) return n; // Method too big
489c9b5090e2 Initial load
duke
parents:
diff changeset
   714
489c9b5090e2 Initial load
duke
parents:
diff changeset
   715
  // Split 'n' through the merge point if it is profitable
489c9b5090e2 Initial load
duke
parents:
diff changeset
   716
  Node *phi = split_thru_phi( n, n_blk, policy );
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   717
  if (!phi) return n;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   718
489c9b5090e2 Initial load
duke
parents:
diff changeset
   719
  // Found a Phi to split thru!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   720
  // Replace 'n' with the new phi
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
   721
  _igvn.replace_node( n, phi );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   722
  // Moved a load around the loop, 'en-registering' something.
10971
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   723
  if (n_blk->is_Loop() && n->is_Load() &&
db45f6ab9a75 7097546: Optimize use of CMOVE instructions
kvn
parents: 10253
diff changeset
   724
      !phi->in(LoopNode::LoopBackControl)->is_Load())
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   725
    C->set_major_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   726
489c9b5090e2 Initial load
duke
parents:
diff changeset
   727
  return phi;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   728
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   729
489c9b5090e2 Initial load
duke
parents:
diff changeset
   730
static bool merge_point_too_heavy(Compile* C, Node* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   731
  // Bail out if the region and its phis have too many users.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   732
  int weight = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   733
  for (DUIterator_Fast imax, i = region->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   734
    weight += region->fast_out(i)->outcnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   735
  }
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 13974
diff changeset
   736
  int nodes_left = MaxNodeLimit - C->live_nodes();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   737
  if (weight * 8 > nodes_left) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   738
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   739
    if (PrintOpto)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   740
      tty->print_cr("*** Split-if bails out:  %d nodes, region weight %d", C->unique(), weight);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   741
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   742
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   743
  } else {
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
489c9b5090e2 Initial load
duke
parents:
diff changeset
   748
static bool merge_point_safe(Node* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   749
  // 4799512: Stop split_if_with_blocks from splitting a block with a ConvI2LNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   750
  // having a PhiNode input. This sidesteps the dangerous case where the split
489c9b5090e2 Initial load
duke
parents:
diff changeset
   751
  // ConvI2LNode may become TOP if the input Value() does not
489c9b5090e2 Initial load
duke
parents:
diff changeset
   752
  // overlap the ConvI2L range, leaving a node which may not dominate its
489c9b5090e2 Initial load
duke
parents:
diff changeset
   753
  // uses.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   754
  // A better fix for this problem can be found in the BugTraq entry, but
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
  // expediency for Mantis demands this hack.
3187
f1471947cdf8 6855164: SIGSEGV during compilation of method involving loop over CharSequence.
cfang
parents: 2131
diff changeset
   756
  // 6855164: If the merge point has a FastLockNode with a PhiNode input, we stop
f1471947cdf8 6855164: SIGSEGV during compilation of method involving loop over CharSequence.
cfang
parents: 2131
diff changeset
   757
  // split_if_with_blocks from splitting a block because we could not move around
f1471947cdf8 6855164: SIGSEGV during compilation of method involving loop over CharSequence.
cfang
parents: 2131
diff changeset
   758
  // the FastLockNode.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   759
  for (DUIterator_Fast imax, i = region->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
    Node* n = region->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
    if (n->is_Phi()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   762
      for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   763
        Node* m = n->fast_out(j);
3187
f1471947cdf8 6855164: SIGSEGV during compilation of method involving loop over CharSequence.
cfang
parents: 2131
diff changeset
   764
        if (m->is_FastLock())
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   765
          return false;
3187
f1471947cdf8 6855164: SIGSEGV during compilation of method involving loop over CharSequence.
cfang
parents: 2131
diff changeset
   766
#ifdef _LP64
f1471947cdf8 6855164: SIGSEGV during compilation of method involving loop over CharSequence.
cfang
parents: 2131
diff changeset
   767
        if (m->Opcode() == Op_ConvI2L)
f1471947cdf8 6855164: SIGSEGV during compilation of method involving loop over CharSequence.
cfang
parents: 2131
diff changeset
   768
          return false;
f1471947cdf8 6855164: SIGSEGV during compilation of method involving loop over CharSequence.
cfang
parents: 2131
diff changeset
   769
#endif
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   770
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   771
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   772
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   773
  return true;
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
//------------------------------place_near_use---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   778
// Place some computation next to use but not inside inner loops.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   779
// For inner loop uses move it to the preheader area.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   780
Node *PhaseIdealLoop::place_near_use( Node *useblock ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   781
  IdealLoopTree *u_loop = get_loop( useblock );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   782
  return (u_loop->_irreducible || u_loop->_child)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   783
    ? useblock
489c9b5090e2 Initial load
duke
parents:
diff changeset
   784
    : u_loop->_head->in(LoopNode::EntryControl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   785
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   786
489c9b5090e2 Initial load
duke
parents:
diff changeset
   787
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
//------------------------------split_if_with_blocks_post----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
// Do the real work in a non-recursive function.  CFG hackery wants to be
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
// in the post-order, so it can dirty the I-DOM info and not use the dirtied
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
// info.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
void PhaseIdealLoop::split_if_with_blocks_post( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
  // Cloning Cmp through Phi's involves the split-if transform.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
  // FastLock is not used by an If
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
  if( n->is_Cmp() && !n->is_FastLock() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
    if( C->unique() > 35000 ) return; // Method too big
489c9b5090e2 Initial load
duke
parents:
diff changeset
   798
489c9b5090e2 Initial load
duke
parents:
diff changeset
   799
    // Do not do 'split-if' if irreducible loops are present.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   800
    if( _has_irreducible_loops )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   801
      return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   802
489c9b5090e2 Initial load
duke
parents:
diff changeset
   803
    Node *n_ctrl = get_ctrl(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   804
    // Determine if the Node has inputs from some local Phi.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   805
    // Returns the block to clone thru.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
    Node *n_blk = has_local_phi_input( n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   807
    if( n_blk != n_ctrl ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
489c9b5090e2 Initial load
duke
parents:
diff changeset
   809
    if( merge_point_too_heavy(C, n_ctrl) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   810
      return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   811
489c9b5090e2 Initial load
duke
parents:
diff changeset
   812
    if( n->outcnt() != 1 ) return; // Multiple bool's from 1 compare?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   813
    Node *bol = n->unique_out();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   814
    assert( bol->is_Bool(), "expect a bool here" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
    if( bol->outcnt() != 1 ) return;// Multiple branches from 1 compare?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
    Node *iff = bol->unique_out();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
    // Check some safety conditions
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
    if( iff->is_If() ) {        // Classic split-if?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
      if( iff->in(0) != n_ctrl ) return; // Compare must be in same blk as if
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
    } else if (iff->is_CMove()) { // Trying to split-up a CMOVE
11447
84ff3ddd7679 7064302: JDK7 build 147 crashed after testing my java 6-compiled web app
kvn
parents: 10988
diff changeset
   822
      // Can't split CMove with different control edge.
84ff3ddd7679 7064302: JDK7 build 147 crashed after testing my java 6-compiled web app
kvn
parents: 10988
diff changeset
   823
      if (iff->in(0) != NULL && iff->in(0) != n_ctrl ) return;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   824
      if( get_ctrl(iff->in(2)) == n_ctrl ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   825
          get_ctrl(iff->in(3)) == n_ctrl )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   826
        return;                 // Inputs not yet split-up
489c9b5090e2 Initial load
duke
parents:
diff changeset
   827
      if ( get_loop(n_ctrl) != get_loop(get_ctrl(iff)) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   828
        return;                 // Loop-invar test gates loop-varying CMOVE
489c9b5090e2 Initial load
duke
parents:
diff changeset
   829
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   830
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   831
      return;  // some other kind of node, such as an Allocate
489c9b5090e2 Initial load
duke
parents:
diff changeset
   832
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   833
489c9b5090e2 Initial load
duke
parents:
diff changeset
   834
    // Do not do 'split-if' if some paths are dead.  First do dead code
489c9b5090e2 Initial load
duke
parents:
diff changeset
   835
    // elimination and then see if its still profitable.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   836
    for( uint i = 1; i < n_ctrl->req(); i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   837
      if( n_ctrl->in(i) == C->top() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   838
        return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   839
489c9b5090e2 Initial load
duke
parents:
diff changeset
   840
    // When is split-if profitable?  Every 'win' on means some control flow
489c9b5090e2 Initial load
duke
parents:
diff changeset
   841
    // goes dead, so it's almost always a win.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   842
    int policy = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   843
    // If trying to do a 'Split-If' at the loop head, it is only
489c9b5090e2 Initial load
duke
parents:
diff changeset
   844
    // profitable if the cmp folds up on BOTH paths.  Otherwise we
489c9b5090e2 Initial load
duke
parents:
diff changeset
   845
    // risk peeling a loop forever.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   846
489c9b5090e2 Initial load
duke
parents:
diff changeset
   847
    // CNC - Disabled for now.  Requires careful handling of loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   848
    // body selection for the cloned code.  Also, make sure we check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   849
    // for any input path not being in the same loop as n_ctrl.  For
489c9b5090e2 Initial load
duke
parents:
diff changeset
   850
    // irreducible loops we cannot check for 'n_ctrl->is_Loop()'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   851
    // because the alternative loop entry points won't be converted
489c9b5090e2 Initial load
duke
parents:
diff changeset
   852
    // into LoopNodes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   853
    IdealLoopTree *n_loop = get_loop(n_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   854
    for( uint j = 1; j < n_ctrl->req(); j++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   855
      if( get_loop(n_ctrl->in(j)) != n_loop )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   856
        return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   857
489c9b5090e2 Initial load
duke
parents:
diff changeset
   858
    // Check for safety of the merge point.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   859
    if( !merge_point_safe(n_ctrl) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   860
      return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   861
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   862
489c9b5090e2 Initial load
duke
parents:
diff changeset
   863
    // Split compare 'n' through the merge point if it is profitable
489c9b5090e2 Initial load
duke
parents:
diff changeset
   864
    Node *phi = split_thru_phi( n, n_ctrl, policy );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   865
    if( !phi ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   866
489c9b5090e2 Initial load
duke
parents:
diff changeset
   867
    // Found a Phi to split thru!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   868
    // Replace 'n' with the new phi
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
   869
    _igvn.replace_node( n, phi );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   870
489c9b5090e2 Initial load
duke
parents:
diff changeset
   871
    // Now split the bool up thru the phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   872
    Node *bolphi = split_thru_phi( bol, n_ctrl, -1 );
16375
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
   873
    guarantee(bolphi != NULL, "null boolean phi node");
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
   874
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
   875
    _igvn.replace_node( bol, bolphi );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   876
    assert( iff->in(1) == bolphi, "" );
16375
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
   877
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   878
    if( bolphi->Value(&_igvn)->singleton() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   879
      return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   880
489c9b5090e2 Initial load
duke
parents:
diff changeset
   881
    // Conditional-move?  Must split up now
489c9b5090e2 Initial load
duke
parents:
diff changeset
   882
    if( !iff->is_If() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   883
      Node *cmovphi = split_thru_phi( iff, n_ctrl, -1 );
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
   884
      _igvn.replace_node( iff, cmovphi );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   885
      return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   887
489c9b5090e2 Initial load
duke
parents:
diff changeset
   888
    // Now split the IF
489c9b5090e2 Initial load
duke
parents:
diff changeset
   889
    do_split_if( iff );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   890
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   891
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   892
489c9b5090e2 Initial load
duke
parents:
diff changeset
   893
  // Check for an IF ready to split; one that has its
489c9b5090e2 Initial load
duke
parents:
diff changeset
   894
  // condition codes input coming from a Phi at the block start.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
  int n_op = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
  // Check for an IF being dominated by another IF same test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   898
  if( n_op == Op_If ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
    Node *bol = n->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   900
    uint max = bol->outcnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   901
    // Check for same test used more than once?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   902
    if( n_op == Op_If && max > 1 && bol->is_Bool() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   903
      // Search up IDOMs to see if this IF is dominated.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   904
      Node *cutoff = get_ctrl(bol);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   905
489c9b5090e2 Initial load
duke
parents:
diff changeset
   906
      // Now search up IDOMs till cutoff, looking for a dominating test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   907
      Node *prevdom = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   908
      Node *dom = idom(prevdom);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   909
      while( dom != cutoff ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   910
        if( dom->req() > 1 && dom->in(1) == bol && prevdom->in(0) == dom ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   911
          // Replace the dominated test with an obvious true or false.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   912
          // Place it on the IGVN worklist for later cleanup.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   913
          C->set_major_progress();
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9330
diff changeset
   914
          dominated_by( prevdom, n, false, true );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   915
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   916
          if( VerifyLoopOptimizations ) verify();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   917
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   918
          return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   919
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   920
        prevdom = dom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   921
        dom = idom(prevdom);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   922
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   923
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   924
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   925
489c9b5090e2 Initial load
duke
parents:
diff changeset
   926
  // See if a shared loop-varying computation has no loop-varying uses.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   927
  // Happens if something is only used for JVM state in uncommon trap exits,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   928
  // like various versions of induction variable+offset.  Clone the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   929
  // computation per usage to allow it to sink out of the loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   930
  if (has_ctrl(n) && !n->in(0)) {// n not dead and has no control edge (can float about)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   931
    Node *n_ctrl = get_ctrl(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   932
    IdealLoopTree *n_loop = get_loop(n_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   933
    if( n_loop != _ltree_root ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   934
      DUIterator_Fast imax, i = n->fast_outs(imax);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   935
      for (; i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   936
        Node* u = n->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   937
        if( !has_ctrl(u) )     break; // Found control user
489c9b5090e2 Initial load
duke
parents:
diff changeset
   938
        IdealLoopTree *u_loop = get_loop(get_ctrl(u));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   939
        if( u_loop == n_loop ) break; // Found loop-varying use
489c9b5090e2 Initial load
duke
parents:
diff changeset
   940
        if( n_loop->is_member( u_loop ) ) break; // Found use in inner loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   941
        if( u->Opcode() == Op_Opaque1 ) break; // Found loop limit, bugfix for 4677003
489c9b5090e2 Initial load
duke
parents:
diff changeset
   942
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   943
      bool did_break = (i < imax);  // Did we break out of the previous loop?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   944
      if (!did_break && n->outcnt() > 1) { // All uses in outer loops!
11447
84ff3ddd7679 7064302: JDK7 build 147 crashed after testing my java 6-compiled web app
kvn
parents: 10988
diff changeset
   945
        Node *late_load_ctrl = NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   946
        if (n->is_Load()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   947
          // If n is a load, get and save the result from get_late_ctrl(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   948
          // to be later used in calculating the control for n's clones.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   949
          clear_dom_lca_tags();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   950
          late_load_ctrl = get_late_ctrl(n, n_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   951
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   952
        // If n is a load, and the late control is the same as the current
489c9b5090e2 Initial load
duke
parents:
diff changeset
   953
        // control, then the cloning of n is a pointless exercise, because
489c9b5090e2 Initial load
duke
parents:
diff changeset
   954
        // GVN will ensure that we end up where we started.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   955
        if (!n->is_Load() || late_load_ctrl != n_ctrl) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   956
          for (DUIterator_Last jmin, j = n->last_outs(jmin); j >= jmin; ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   957
            Node *u = n->last_out(j); // Clone private computation per use
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
   958
            _igvn.rehash_node_delayed(u);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   959
            Node *x = n->clone(); // Clone computation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   960
            Node *x_ctrl = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   961
            if( u->is_Phi() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   962
              // Replace all uses of normal nodes.  Replace Phi uses
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1433
diff changeset
   963
              // individually, so the separate Nodes can sink down
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   964
              // different paths.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   965
              uint k = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   966
              while( u->in(k) != n ) k++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   967
              u->set_req( k, x );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   968
              // x goes next to Phi input path
489c9b5090e2 Initial load
duke
parents:
diff changeset
   969
              x_ctrl = u->in(0)->in(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   970
              --j;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   971
            } else {              // Normal use
489c9b5090e2 Initial load
duke
parents:
diff changeset
   972
              // Replace all uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
   973
              for( uint k = 0; k < u->req(); k++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   974
                if( u->in(k) == n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   975
                  u->set_req( k, x );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   976
                  --j;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   977
                }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   978
              }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   979
              x_ctrl = get_ctrl(u);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   980
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   981
489c9b5090e2 Initial load
duke
parents:
diff changeset
   982
            // Find control for 'x' next to use but not inside inner loops.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   983
            // For inner loop uses get the preheader area.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   984
            x_ctrl = place_near_use(x_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   985
489c9b5090e2 Initial load
duke
parents:
diff changeset
   986
            if (n->is_Load()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   987
              // For loads, add a control edge to a CFG node outside of the loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   988
              // to force them to not combine and return back inside the loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   989
              // during GVN optimization (4641526).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   990
              //
489c9b5090e2 Initial load
duke
parents:
diff changeset
   991
              // Because we are setting the actual control input, factor in
489c9b5090e2 Initial load
duke
parents:
diff changeset
   992
              // the result from get_late_ctrl() so we respect any
489c9b5090e2 Initial load
duke
parents:
diff changeset
   993
              // anti-dependences. (6233005).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   994
              x_ctrl = dom_lca(late_load_ctrl, x_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   995
489c9b5090e2 Initial load
duke
parents:
diff changeset
   996
              // Don't allow the control input to be a CFG splitting node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   997
              // Such nodes should only have ProjNodes as outs, e.g. IfNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   998
              // should only have IfTrueNode and IfFalseNode (4985384).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   999
              x_ctrl = find_non_split_ctrl(x_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1000
              assert(dom_depth(n_ctrl) <= dom_depth(x_ctrl), "n is later than its clone");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1001
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1002
              x->set_req(0, x_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1003
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1004
            register_new_node(x, x_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1005
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1006
            // Some institutional knowledge is needed here: 'x' is
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1007
            // yanked because if the optimizer runs GVN on it all the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1008
            // cloned x's will common up and undo this optimization and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1009
            // be forced back in the loop.  This is annoying because it
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1010
            // makes +VerifyOpto report false-positives on progress.  I
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1011
            // tried setting control edges on the x's to force them to
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1012
            // not combine, but the matching gets worried when it tries
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
            // to fold a StoreP and an AddP together (as part of an
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1014
            // address expression) and the AddP and StoreP have
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1015
            // different controls.
13969
d2a189b83b87 7054512: Compress class pointers after perm gen removal
roland
parents: 13895
diff changeset
  1016
            if (!x->is_Load() && !x->is_DecodeNarrowPtr()) _igvn._worklist.yank(x);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1017
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1018
          _igvn.remove_dead_node(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1019
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1020
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1021
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1022
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1023
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1024
  // Check for Opaque2's who's loop has disappeared - who's input is in the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1025
  // same loop nest as their output.  Remove 'em, they are no longer useful.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1026
  if( n_op == Op_Opaque2 &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1027
      n->in(1) != NULL &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1028
      get_loop(get_ctrl(n)) == get_loop(get_ctrl(n->in(1))) ) {
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
  1029
    _igvn.replace_node( n, n->in(1) );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1030
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1031
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1032
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1033
//------------------------------split_if_with_blocks---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1034
// Check for aggressive application of 'split-if' optimization,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1035
// using basic block level info.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1036
void PhaseIdealLoop::split_if_with_blocks( VectorSet &visited, Node_Stack &nstack ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1037
  Node *n = C->root();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1038
  visited.set(n->_idx); // first, mark node as visited
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1039
  // Do pre-visit work for root
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1040
  n = split_if_with_blocks_pre( n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1041
  uint cnt = n->outcnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1042
  uint i   = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1043
  while (true) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1044
    // Visit all children
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1045
    if (i < cnt) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1046
      Node* use = n->raw_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1047
      ++i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1048
      if (use->outcnt() != 0 && !visited.test_set(use->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1049
        // Now do pre-visit work for this use
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1050
        use = split_if_with_blocks_pre( use );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1051
        nstack.push(n, i); // Save parent and next use's index.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1052
        n   = use;         // Process all children of current use.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1053
        cnt = use->outcnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1054
        i   = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1055
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1056
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1057
    else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1058
      // All of n's children have been processed, complete post-processing.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1059
      if (cnt != 0 && !n->is_Con()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1060
        assert(has_node(n), "no dead nodes");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1061
        split_if_with_blocks_post( n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1062
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1063
      if (nstack.is_empty()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1064
        // Finished all nodes on stack.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1065
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1066
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1067
      // Get saved parent node and next use's index. Visit the rest of uses.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1068
      n   = nstack.node();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1069
      cnt = n->outcnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1070
      i   = nstack.index();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1071
      nstack.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1072
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1073
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1074
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1075
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1076
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1077
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1078
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1079
//                   C L O N E   A   L O O P   B O D Y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1080
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1081
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1082
//------------------------------clone_iff--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1083
// Passed in a Phi merging (recursively) some nearly equivalent Bool/Cmps.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1084
// "Nearly" because all Nodes have been cloned from the original in the loop,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1085
// but the fall-in edges to the Cmp are different.  Clone bool/Cmp pairs
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1086
// through the Phi recursively, and return a Bool.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1087
BoolNode *PhaseIdealLoop::clone_iff( PhiNode *phi, IdealLoopTree *loop ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1088
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1089
  // Convert this Phi into a Phi merging Bools
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1090
  uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1091
  for( i = 1; i < phi->req(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1092
    Node *b = phi->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1093
    if( b->is_Phi() ) {
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1094
      _igvn.replace_input_of(phi, i, clone_iff( b->as_Phi(), loop ));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1095
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1096
      assert( b->is_Bool(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1097
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1098
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1099
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1100
  Node *sample_bool = phi->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1101
  Node *sample_cmp  = sample_bool->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1102
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1103
  // Make Phis to merge the Cmp's inputs.
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1104
  PhiNode *phi1 = new (C) PhiNode( phi->in(0), Type::TOP );
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1105
  PhiNode *phi2 = new (C) PhiNode( phi->in(0), Type::TOP );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1106
  for( i = 1; i < phi->req(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1107
    Node *n1 = phi->in(i)->in(1)->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1108
    Node *n2 = phi->in(i)->in(1)->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1109
    phi1->set_req( i, n1 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1110
    phi2->set_req( i, n2 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1111
    phi1->set_type( phi1->type()->meet(n1->bottom_type()) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1112
    phi2->set_type( phi2->type()->meet(n2->bottom_type()) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1113
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1114
  // See if these Phis have been made before.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1115
  // Register with optimizer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1116
  Node *hit1 = _igvn.hash_find_insert(phi1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1117
  if( hit1 ) {                  // Hit, toss just made Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1118
    _igvn.remove_dead_node(phi1); // Remove new phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1119
    assert( hit1->is_Phi(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1120
    phi1 = (PhiNode*)hit1;      // Use existing phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1121
  } else {                      // Miss
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1122
    _igvn.register_new_node_with_optimizer(phi1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1123
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1124
  Node *hit2 = _igvn.hash_find_insert(phi2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1125
  if( hit2 ) {                  // Hit, toss just made Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1126
    _igvn.remove_dead_node(phi2); // Remove new phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1127
    assert( hit2->is_Phi(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1128
    phi2 = (PhiNode*)hit2;      // Use existing phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1129
  } else {                      // Miss
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1130
    _igvn.register_new_node_with_optimizer(phi2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1131
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1132
  // Register Phis with loop/block info
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1133
  set_ctrl(phi1, phi->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1134
  set_ctrl(phi2, phi->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1135
  // Make a new Cmp
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1136
  Node *cmp = sample_cmp->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1137
  cmp->set_req( 1, phi1 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1138
  cmp->set_req( 2, phi2 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1139
  _igvn.register_new_node_with_optimizer(cmp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1140
  set_ctrl(cmp, phi->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1141
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1142
  // Make a new Bool
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1143
  Node *b = sample_bool->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1144
  b->set_req(1,cmp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1145
  _igvn.register_new_node_with_optimizer(b);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1146
  set_ctrl(b, phi->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1147
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1148
  assert( b->is_Bool(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1149
  return (BoolNode*)b;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1150
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1151
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1152
//------------------------------clone_bool-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1153
// Passed in a Phi merging (recursively) some nearly equivalent Bool/Cmps.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1154
// "Nearly" because all Nodes have been cloned from the original in the loop,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1155
// but the fall-in edges to the Cmp are different.  Clone bool/Cmp pairs
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1156
// through the Phi recursively, and return a Bool.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1157
CmpNode *PhaseIdealLoop::clone_bool( PhiNode *phi, IdealLoopTree *loop ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1158
  uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1159
  // Convert this Phi into a Phi merging Bools
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1160
  for( i = 1; i < phi->req(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1161
    Node *b = phi->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1162
    if( b->is_Phi() ) {
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1163
      _igvn.replace_input_of(phi, i, clone_bool( b->as_Phi(), loop ));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1164
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1165
      assert( b->is_Cmp() || b->is_top(), "inputs are all Cmp or TOP" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1166
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1167
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1168
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1169
  Node *sample_cmp = phi->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1170
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1171
  // Make Phis to merge the Cmp's inputs.
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1172
  PhiNode *phi1 = new (C) PhiNode( phi->in(0), Type::TOP );
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1173
  PhiNode *phi2 = new (C) PhiNode( phi->in(0), Type::TOP );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1174
  for( uint j = 1; j < phi->req(); j++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1175
    Node *cmp_top = phi->in(j); // Inputs are all Cmp or TOP
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1176
    Node *n1, *n2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1177
    if( cmp_top->is_Cmp() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1178
      n1 = cmp_top->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1179
      n2 = cmp_top->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1180
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1181
      n1 = n2 = cmp_top;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1182
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1183
    phi1->set_req( j, n1 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1184
    phi2->set_req( j, n2 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1185
    phi1->set_type( phi1->type()->meet(n1->bottom_type()) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1186
    phi2->set_type( phi2->type()->meet(n2->bottom_type()) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1187
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1188
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1189
  // See if these Phis have been made before.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1190
  // Register with optimizer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1191
  Node *hit1 = _igvn.hash_find_insert(phi1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1192
  if( hit1 ) {                  // Hit, toss just made Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1193
    _igvn.remove_dead_node(phi1); // Remove new phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1194
    assert( hit1->is_Phi(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1195
    phi1 = (PhiNode*)hit1;      // Use existing phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1196
  } else {                      // Miss
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1197
    _igvn.register_new_node_with_optimizer(phi1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1198
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1199
  Node *hit2 = _igvn.hash_find_insert(phi2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1200
  if( hit2 ) {                  // Hit, toss just made Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1201
    _igvn.remove_dead_node(phi2); // Remove new phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1202
    assert( hit2->is_Phi(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1203
    phi2 = (PhiNode*)hit2;      // Use existing phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1204
  } else {                      // Miss
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1205
    _igvn.register_new_node_with_optimizer(phi2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1206
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1207
  // Register Phis with loop/block info
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1208
  set_ctrl(phi1, phi->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1209
  set_ctrl(phi2, phi->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1210
  // Make a new Cmp
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1211
  Node *cmp = sample_cmp->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1212
  cmp->set_req( 1, phi1 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1213
  cmp->set_req( 2, phi2 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1214
  _igvn.register_new_node_with_optimizer(cmp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1215
  set_ctrl(cmp, phi->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1216
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1217
  assert( cmp->is_Cmp(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1218
  return (CmpNode*)cmp;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1219
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1220
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1221
//------------------------------sink_use---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1222
// If 'use' was in the loop-exit block, it now needs to be sunk
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1223
// below the post-loop merge point.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1224
void PhaseIdealLoop::sink_use( Node *use, Node *post_loop ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1225
  if (!use->is_CFG() && get_ctrl(use) == post_loop->in(2)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1226
    set_ctrl(use, post_loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1227
    for (DUIterator j = use->outs(); use->has_out(j); j++)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1228
      sink_use(use->out(j), post_loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1229
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1230
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1231
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1232
//------------------------------clone_loop-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1233
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1234
//                   C L O N E   A   L O O P   B O D Y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1235
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1236
// This is the basic building block of the loop optimizations.  It clones an
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1237
// entire loop body.  It makes an old_new loop body mapping; with this mapping
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1238
// you can find the new-loop equivalent to an old-loop node.  All new-loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1239
// nodes are exactly equal to their old-loop counterparts, all edges are the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1240
// same.  All exits from the old-loop now have a RegionNode that merges the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1241
// equivalent new-loop path.  This is true even for the normal "loop-exit"
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1242
// condition.  All uses of loop-invariant old-loop values now come from (one
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1243
// or more) Phis that merge their new-loop equivalents.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1244
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1245
// This operation leaves the graph in an illegal state: there are two valid
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1246
// control edges coming from the loop pre-header to both loop bodies.  I'll
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1247
// definitely have to hack the graph after running this transform.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1248
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1249
// From this building block I will further edit edges to perform loop peeling
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1250
// or loop unrolling or iteration splitting (Range-Check-Elimination), etc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1251
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1252
// Parameter side_by_size_idom:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1253
//   When side_by_size_idom is NULL, the dominator tree is constructed for
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1254
//      the clone loop to dominate the original.  Used in construction of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1255
//      pre-main-post loop sequence.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1256
//   When nonnull, the clone and original are side-by-side, both are
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1257
//      dominated by the side_by_side_idom node.  Used in construction of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1258
//      unswitched loops.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1259
void PhaseIdealLoop::clone_loop( IdealLoopTree *loop, Node_List &old_new, int dd,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1260
                                 Node* side_by_side_idom) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1261
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1262
  // Step 1: Clone the loop body.  Make the old->new mapping.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1263
  uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1264
  for( i = 0; i < loop->_body.size(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1265
    Node *old = loop->_body.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1266
    Node *nnn = old->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1267
    old_new.map( old->_idx, nnn );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1268
    _igvn.register_new_node_with_optimizer(nnn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1269
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1270
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1271
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1272
  // Step 2: Fix the edges in the new body.  If the old input is outside the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1273
  // loop use it.  If the old input is INside the loop, use the corresponding
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1274
  // new node instead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1275
  for( i = 0; i < loop->_body.size(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1276
    Node *old = loop->_body.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1277
    Node *nnn = old_new[old->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1278
    // Fix CFG/Loop controlling the new node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1279
    if (has_ctrl(old)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1280
      set_ctrl(nnn, old_new[get_ctrl(old)->_idx]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1281
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1282
      set_loop(nnn, loop->_parent);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1283
      if (old->outcnt() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1284
        set_idom( nnn, old_new[idom(old)->_idx], dd );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1285
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1286
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1287
    // Correct edges to the new node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1288
    for( uint j = 0; j < nnn->req(); j++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1289
        Node *n = nnn->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1290
        if( n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1291
          IdealLoopTree *old_in_loop = get_loop( has_ctrl(n) ? get_ctrl(n) : n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1292
          if( loop->is_member( old_in_loop ) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1293
            nnn->set_req(j, old_new[n->_idx]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1294
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1295
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1296
    _igvn.hash_find_insert(nnn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1297
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1298
  Node *newhead = old_new[loop->_head->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1299
  set_idom(newhead, newhead->in(LoopNode::EntryControl), dd);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1300
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1301
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1302
  // Step 3: Now fix control uses.  Loop varying control uses have already
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1303
  // been fixed up (as part of all input edges in Step 2).  Loop invariant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1304
  // control uses must be either an IfFalse or an IfTrue.  Make a merge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1305
  // point to merge the old and new IfFalse/IfTrue nodes; make the use
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1306
  // refer to this.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1307
  ResourceArea *area = Thread::current()->resource_area();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1308
  Node_List worklist(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1309
  uint new_counter = C->unique();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1310
  for( i = 0; i < loop->_body.size(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1311
    Node* old = loop->_body.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1312
    if( !old->is_CFG() ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1313
    Node* nnn = old_new[old->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1314
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1315
    // Copy uses to a worklist, so I can munge the def-use info
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1316
    // with impunity.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1317
    for (DUIterator_Fast jmax, j = old->fast_outs(jmax); j < jmax; j++)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1318
      worklist.push(old->fast_out(j));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1319
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1320
    while( worklist.size() ) {  // Visit all uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1321
      Node *use = worklist.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1322
      if (!has_node(use))  continue; // Ignore dead nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1323
      IdealLoopTree *use_loop = get_loop( has_ctrl(use) ? get_ctrl(use) : use );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1324
      if( !loop->is_member( use_loop ) && use->is_CFG() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1325
        // Both OLD and USE are CFG nodes here.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1326
        assert( use->is_Proj(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1327
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1328
        // Clone the loop exit control projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1329
        Node *newuse = use->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1330
        newuse->set_req(0,nnn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1331
        _igvn.register_new_node_with_optimizer(newuse);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1332
        set_loop(newuse, use_loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1333
        set_idom(newuse, nnn, dom_depth(nnn) + 1 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1334
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1335
        // We need a Region to merge the exit from the peeled body and the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1336
        // exit from the old loop body.
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1337
        RegionNode *r = new (C) RegionNode(3);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1338
        // Map the old use to the new merge point
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1339
        old_new.map( use->_idx, r );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1340
        uint dd_r = MIN2(dom_depth(newuse),dom_depth(use));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1341
        assert( dd_r >= dom_depth(dom_lca(newuse,use)), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1342
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1343
        // The original user of 'use' uses 'r' instead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1344
        for (DUIterator_Last lmin, l = use->last_outs(lmin); l >= lmin;) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1345
          Node* useuse = use->last_out(l);
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1346
          _igvn.rehash_node_delayed(useuse);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1347
          uint uses_found = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1348
          if( useuse->in(0) == use ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1349
            useuse->set_req(0, r);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1350
            uses_found++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1351
            if( useuse->is_CFG() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1352
              assert( dom_depth(useuse) > dd_r, "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1353
              set_idom(useuse, r, dom_depth(useuse));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1354
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1355
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1356
          for( uint k = 1; k < useuse->req(); k++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1357
            if( useuse->in(k) == use ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1358
              useuse->set_req(k, r);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1359
              uses_found++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1360
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1361
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1362
          l -= uses_found;    // we deleted 1 or more copies of this edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1363
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1364
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1365
        // Now finish up 'r'
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1366
        r->set_req( 1, newuse );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1367
        r->set_req( 2,    use );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1368
        _igvn.register_new_node_with_optimizer(r);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1369
        set_loop(r, use_loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1370
        set_idom(r, !side_by_side_idom ? newuse->in(0) : side_by_side_idom, dd_r);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1371
      } // End of if a loop-exit test
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1372
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1373
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1374
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1375
  // Step 4: If loop-invariant use is not control, it must be dominated by a
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1376
  // loop exit IfFalse/IfTrue.  Find "proper" loop exit.  Make a Region
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1377
  // there if needed.  Make a Phi there merging old and new used values.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1378
  Node_List *split_if_set = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1379
  Node_List *split_bool_set = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1380
  Node_List *split_cex_set = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1381
  for( i = 0; i < loop->_body.size(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1382
    Node* old = loop->_body.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1383
    Node* nnn = old_new[old->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1384
    // Copy uses to a worklist, so I can munge the def-use info
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1385
    // with impunity.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1386
    for (DUIterator_Fast jmax, j = old->fast_outs(jmax); j < jmax; j++)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1387
      worklist.push(old->fast_out(j));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1388
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1389
    while( worklist.size() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1390
      Node *use = worklist.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1391
      if (!has_node(use))  continue; // Ignore dead nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1392
      if (use->in(0) == C->top())  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1393
      IdealLoopTree *use_loop = get_loop( has_ctrl(use) ? get_ctrl(use) : use );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1394
      // Check for data-use outside of loop - at least one of OLD or USE
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1395
      // must not be a CFG node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1396
      if( !loop->is_member( use_loop ) && (!old->is_CFG() || !use->is_CFG())) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1397
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1398
        // If the Data use is an IF, that means we have an IF outside of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1399
        // loop that is switching on a condition that is set inside of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1400
        // loop.  Happens if people set a loop-exit flag; then test the flag
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1401
        // in the loop to break the loop, then test is again outside of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1402
        // loop to determine which way the loop exited.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1403
        if( use->is_If() || use->is_CMove() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1404
          // Since this code is highly unlikely, we lazily build the worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1405
          // of such Nodes to go split.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1406
          if( !split_if_set )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1407
            split_if_set = new Node_List(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1408
          split_if_set->push(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1409
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1410
        if( use->is_Bool() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1411
          if( !split_bool_set )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1412
            split_bool_set = new Node_List(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1413
          split_bool_set->push(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1414
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1415
        if( use->Opcode() == Op_CreateEx ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1416
          if( !split_cex_set )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1417
            split_cex_set = new Node_List(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1418
          split_cex_set->push(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1419
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1420
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1421
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1422
        // Get "block" use is in
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1423
        uint idx = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1424
        while( use->in(idx) != old ) idx++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1425
        Node *prev = use->is_CFG() ? use : get_ctrl(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1426
        assert( !loop->is_member( get_loop( prev ) ), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1427
        Node *cfg = prev->_idx >= new_counter
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1428
          ? prev->in(2)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1429
          : idom(prev);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1430
        if( use->is_Phi() )     // Phi use is in prior block
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1431
          cfg = prev->in(idx);  // NOT in block of Phi itself
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1432
        if (cfg->is_top()) {    // Use is dead?
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1433
          _igvn.replace_input_of(use, idx, C->top());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1434
          continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1435
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1436
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1437
        while( !loop->is_member( get_loop( cfg ) ) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1438
          prev = cfg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1439
          cfg = cfg->_idx >= new_counter ? cfg->in(2) : idom(cfg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1440
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1441
        // If the use occurs after merging several exits from the loop, then
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1442
        // old value must have dominated all those exits.  Since the same old
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1443
        // value was used on all those exits we did not need a Phi at this
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1444
        // merge point.  NOW we do need a Phi here.  Each loop exit value
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1445
        // is now merged with the peeled body exit; each exit gets its own
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1446
        // private Phi and those Phis need to be merged here.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1447
        Node *phi;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1448
        if( prev->is_Region() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1449
          if( idx == 0 ) {      // Updating control edge?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1450
            phi = prev;         // Just use existing control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1451
          } else {              // Else need a new Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1452
            phi = PhiNode::make( prev, old );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1453
            // Now recursively fix up the new uses of old!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1454
            for( uint i = 1; i < prev->req(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1455
              worklist.push(phi); // Onto worklist once for each 'old' input
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1456
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1457
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1458
        } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1459
          // Get new RegionNode merging old and new loop exits
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1460
          prev = old_new[prev->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1461
          assert( prev, "just made this in step 7" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1462
          if( idx == 0 ) {      // Updating control edge?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1463
            phi = prev;         // Just use existing control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1464
          } else {              // Else need a new Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1465
            // Make a new Phi merging data values properly
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1466
            phi = PhiNode::make( prev, old );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1467
            phi->set_req( 1, nnn );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1468
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1469
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1470
        // If inserting a new Phi, check for prior hits
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1471
        if( idx != 0 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1472
          Node *hit = _igvn.hash_find_insert(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1473
          if( hit == NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1474
           _igvn.register_new_node_with_optimizer(phi); // Register new phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1475
          } else {                                      // or
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1476
            // Remove the new phi from the graph and use the hit
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1477
            _igvn.remove_dead_node(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1478
            phi = hit;                                  // Use existing phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1479
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1480
          set_ctrl(phi, prev);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1481
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1482
        // Make 'use' use the Phi instead of the old loop body exit value
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1483
        _igvn.replace_input_of(use, idx, phi);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1484
        if( use->_idx >= new_counter ) { // If updating new phis
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1485
          // Not needed for correctness, but prevents a weak assert
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1486
          // in AddPNode from tripping (when we end up with different
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1487
          // base & derived Phis that will become the same after
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1488
          // IGVN does CSE).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1489
          Node *hit = _igvn.hash_find_insert(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1490
          if( hit )             // Go ahead and re-hash for hits.
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
  1491
            _igvn.replace_node( use, hit );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1492
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1493
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1494
        // If 'use' was in the loop-exit block, it now needs to be sunk
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1495
        // below the post-loop merge point.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1496
        sink_use( use, prev );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1497
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1498
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1499
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1500
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1501
  // Check for IFs that need splitting/cloning.  Happens if an IF outside of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1502
  // the loop uses a condition set in the loop.  The original IF probably
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1503
  // takes control from one or more OLD Regions (which in turn get from NEW
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1504
  // Regions).  In any case, there will be a set of Phis for each merge point
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1505
  // from the IF up to where the original BOOL def exists the loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1506
  if( split_if_set ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1507
    while( split_if_set->size() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1508
      Node *iff = split_if_set->pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1509
      if( iff->in(1)->is_Phi() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1510
        BoolNode *b = clone_iff( iff->in(1)->as_Phi(), loop );
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1511
        _igvn.replace_input_of(iff, 1, b);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1512
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1513
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1514
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1515
  if( split_bool_set ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1516
    while( split_bool_set->size() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1517
      Node *b = split_bool_set->pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1518
      Node *phi = b->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1519
      assert( phi->is_Phi(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1520
      CmpNode *cmp = clone_bool( (PhiNode*)phi, loop );
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1521
      _igvn.replace_input_of(b, 1, cmp);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1522
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1523
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1524
  if( split_cex_set ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1525
    while( split_cex_set->size() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1526
      Node *b = split_cex_set->pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1527
      assert( b->in(0)->is_Region(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1528
      assert( b->in(1)->is_Phi(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1529
      assert( b->in(0)->in(0) == b->in(1)->in(0), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1530
      split_up( b, b->in(0), NULL );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1531
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1532
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1533
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1534
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1535
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1536
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1537
//---------------------- stride_of_possible_iv -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1538
// Looks for an iff/bool/comp with one operand of the compare
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1539
// being a cycle involving an add and a phi,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1540
// with an optional truncation (left-shift followed by a right-shift)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1541
// of the add. Returns zero if not an iv.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1542
int PhaseIdealLoop::stride_of_possible_iv(Node* iff) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1543
  Node* trunc1 = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1544
  Node* trunc2 = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1545
  const TypeInt* ttype = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1546
  if (!iff->is_If() || iff->in(1) == NULL || !iff->in(1)->is_Bool()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1547
    return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1548
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1549
  BoolNode* bl = iff->in(1)->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1550
  Node* cmp = bl->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1551
  if (!cmp || cmp->Opcode() != Op_CmpI && cmp->Opcode() != Op_CmpU) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1552
    return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1553
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1554
  // Must have an invariant operand
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1555
  if (is_member(get_loop(iff), get_ctrl(cmp->in(2)))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1556
    return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1557
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1558
  Node* add2 = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1559
  Node* cmp1 = cmp->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1560
  if (cmp1->is_Phi()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1561
    // (If (Bool (CmpX phi:(Phi ...(Optional-trunc(AddI phi add2))) )))
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1562
    Node* phi = cmp1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1563
    for (uint i = 1; i < phi->req(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1564
      Node* in = phi->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1565
      Node* add = CountedLoopNode::match_incr_with_optional_truncation(in,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1566
                                &trunc1, &trunc2, &ttype);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1567
      if (add && add->in(1) == phi) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1568
        add2 = add->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1569
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1570
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1571
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1572
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1573
    // (If (Bool (CmpX addtrunc:(Optional-trunc((AddI (Phi ...addtrunc...) add2)) )))
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1574
    Node* addtrunc = cmp1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1575
    Node* add = CountedLoopNode::match_incr_with_optional_truncation(addtrunc,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1576
                                &trunc1, &trunc2, &ttype);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1577
    if (add && add->in(1)->is_Phi()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1578
      Node* phi = add->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1579
      for (uint i = 1; i < phi->req(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1580
        if (phi->in(i) == addtrunc) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1581
          add2 = add->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1582
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1583
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1584
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1585
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1586
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1587
  if (add2 != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1588
    const TypeInt* add2t = _igvn.type(add2)->is_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1589
    if (add2t->is_con()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1590
      return add2t->get_con();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1591
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1592
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1593
  return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1594
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1595
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1596
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1597
//---------------------- stay_in_loop -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1598
// Return the (unique) control output node that's in the loop (if it exists.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1599
Node* PhaseIdealLoop::stay_in_loop( Node* n, IdealLoopTree *loop) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1600
  Node* unique = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1601
  if (!n) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1602
  for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1603
    Node* use = n->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1604
    if (!has_ctrl(use) && loop->is_member(get_loop(use))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1605
      if (unique != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1606
        return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1607
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1608
      unique = use;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1609
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1610
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1611
  return unique;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1612
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1613
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1614
//------------------------------ register_node -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1615
// Utility to register node "n" with PhaseIdealLoop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1616
void PhaseIdealLoop::register_node(Node* n, IdealLoopTree *loop, Node* pred, int ddepth) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1617
  _igvn.register_new_node_with_optimizer(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1618
  loop->_body.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1619
  if (n->is_CFG()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1620
    set_loop(n, loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1621
    set_idom(n, pred, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1622
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1623
    set_ctrl(n, pred);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1624
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1625
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1626
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1627
//------------------------------ proj_clone -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1628
// Utility to create an if-projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1629
ProjNode* PhaseIdealLoop::proj_clone(ProjNode* p, IfNode* iff) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1630
  ProjNode* c = p->clone()->as_Proj();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1631
  c->set_req(0, iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1632
  return c;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1633
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1634
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1635
//------------------------------ short_circuit_if -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1636
// Force the iff control output to be the live_proj
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1637
Node* PhaseIdealLoop::short_circuit_if(IfNode* iff, ProjNode* live_proj) {
16375
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
  1638
  guarantee(live_proj != NULL, "null projection");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1639
  int proj_con = live_proj->_con;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1640
  assert(proj_con == 0 || proj_con == 1, "false or true projection");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1641
  Node *con = _igvn.intcon(proj_con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1642
  set_ctrl(con, C->root());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1643
  if (iff) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1644
    iff->set_req(1, con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1645
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1646
  return con;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1647
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1648
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1649
//------------------------------ insert_if_before_proj -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1650
// Insert a new if before an if projection (* - new node)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1651
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1652
// before
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1653
//           if(test)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1654
//           /     \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1655
//          v       v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1656
//    other-proj   proj (arg)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1657
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1658
// after
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1659
//           if(test)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1660
//           /     \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1661
//          /       v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1662
//         |      * proj-clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1663
//         v          |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1664
//    other-proj      v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1665
//                * new_if(relop(cmp[IU](left,right)))
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1666
//                  /  \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1667
//                 v    v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1668
//         * new-proj  proj
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1669
//         (returned)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1670
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1671
ProjNode* PhaseIdealLoop::insert_if_before_proj(Node* left, bool Signed, BoolTest::mask relop, Node* right, ProjNode* proj) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1672
  IfNode* iff = proj->in(0)->as_If();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1673
  IdealLoopTree *loop = get_loop(proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1674
  ProjNode *other_proj = iff->proj_out(!proj->is_IfTrue())->as_Proj();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1675
  int ddepth = dom_depth(proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1676
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1677
  _igvn.rehash_node_delayed(iff);
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1678
  _igvn.rehash_node_delayed(proj);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1679
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1680
  proj->set_req(0, NULL);  // temporary disconnect
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1681
  ProjNode* proj2 = proj_clone(proj, iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1682
  register_node(proj2, loop, iff, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1683
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1684
  Node* cmp = Signed ? (Node*) new (C)CmpINode(left, right) : (Node*) new (C)CmpUNode(left, right);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1685
  register_node(cmp, loop, proj2, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1686
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1687
  BoolNode* bol = new (C)BoolNode(cmp, relop);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1688
  register_node(bol, loop, proj2, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1689
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1690
  IfNode* new_if = new (C)IfNode(proj2, bol, iff->_prob, iff->_fcnt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1691
  register_node(new_if, loop, proj2, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1692
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1693
  proj->set_req(0, new_if); // reattach
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1694
  set_idom(proj, new_if, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1695
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1696
  ProjNode* new_exit = proj_clone(other_proj, new_if)->as_Proj();
16375
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
  1697
  guarantee(new_exit != NULL, "null exit node");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1698
  register_node(new_exit, get_loop(other_proj), new_if, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1699
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1700
  return new_exit;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1701
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1702
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1703
//------------------------------ insert_region_before_proj -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1704
// Insert a region before an if projection (* - new node)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1705
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1706
// before
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1707
//           if(test)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1708
//          /      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1709
//         v       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1710
//       proj      v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1711
//               other-proj
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1712
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1713
// after
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1714
//           if(test)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1715
//          /      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1716
//         v       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1717
// * proj-clone    v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1718
//         |     other-proj
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1719
//         v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1720
// * new-region
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1721
//         |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1722
//         v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1723
// *      dum_if
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1724
//       /     \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1725
//      v       \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1726
// * dum-proj    v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1727
//              proj
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1728
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1729
RegionNode* PhaseIdealLoop::insert_region_before_proj(ProjNode* proj) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1730
  IfNode* iff = proj->in(0)->as_If();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1731
  IdealLoopTree *loop = get_loop(proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1732
  ProjNode *other_proj = iff->proj_out(!proj->is_IfTrue())->as_Proj();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1733
  int ddepth = dom_depth(proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1734
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1735
  _igvn.rehash_node_delayed(iff);
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1736
  _igvn.rehash_node_delayed(proj);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1737
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1738
  proj->set_req(0, NULL);  // temporary disconnect
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1739
  ProjNode* proj2 = proj_clone(proj, iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1740
  register_node(proj2, loop, iff, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1741
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1742
  RegionNode* reg = new (C)RegionNode(2);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1743
  reg->set_req(1, proj2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1744
  register_node(reg, loop, iff, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1745
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1746
  IfNode* dum_if = new (C)IfNode(reg, short_circuit_if(NULL, proj), iff->_prob, iff->_fcnt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1747
  register_node(dum_if, loop, reg, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1748
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1749
  proj->set_req(0, dum_if); // reattach
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1750
  set_idom(proj, dum_if, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1751
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1752
  ProjNode* dum_proj = proj_clone(other_proj, dum_if);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1753
  register_node(dum_proj, loop, dum_if, ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1754
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1755
  return reg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1756
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1757
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1758
//------------------------------ insert_cmpi_loop_exit -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1759
// Clone a signed compare loop exit from an unsigned compare and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1760
// insert it before the unsigned cmp on the stay-in-loop path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1761
// All new nodes inserted in the dominator tree between the original
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1762
// if and it's projections.  The original if test is replaced with
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1763
// a constant to force the stay-in-loop path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1764
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1765
// This is done to make sure that the original if and it's projections
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1766
// still dominate the same set of control nodes, that the ctrl() relation
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1767
// from data nodes to them is preserved, and that their loop nesting is
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1768
// preserved.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1769
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1770
// before
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1771
//          if(i <u limit)    unsigned compare loop exit
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1772
//         /       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1773
//        v        v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1774
//   exit-proj   stay-in-loop-proj
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1775
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1776
// after
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1777
//          if(stay-in-loop-const)  original if
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1778
//         /       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1779
//        /        v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1780
//       /  if(i <  limit)    new signed test
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1781
//      /  /       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1782
//     /  /        v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1783
//    /  /  if(i <u limit)    new cloned unsigned test
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1784
//   /  /   /      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1785
//   v  v  v       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1786
//    region       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1787
//        |        |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1788
//      dum-if     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1789
//     /  |        |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1790
// ether  |        |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1791
//        v        v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1792
//   exit-proj   stay-in-loop-proj
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1793
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1794
IfNode* PhaseIdealLoop::insert_cmpi_loop_exit(IfNode* if_cmpu, IdealLoopTree *loop) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1795
  const bool Signed   = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1796
  const bool Unsigned = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1797
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1798
  BoolNode* bol = if_cmpu->in(1)->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1799
  if (bol->_test._test != BoolTest::lt) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1800
  CmpNode* cmpu = bol->in(1)->as_Cmp();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1801
  if (cmpu->Opcode() != Op_CmpU) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1802
  int stride = stride_of_possible_iv(if_cmpu);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1803
  if (stride == 0) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1804
16375
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
  1805
  Node* lp_proj = stay_in_loop(if_cmpu, loop);
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
  1806
  guarantee(lp_proj != NULL, "null loop node");
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
  1807
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
  1808
  ProjNode* lp_continue = lp_proj->as_Proj();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1809
  ProjNode* lp_exit     = if_cmpu->proj_out(!lp_continue->is_IfTrue())->as_Proj();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1810
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1811
  Node* limit = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1812
  if (stride > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1813
    limit = cmpu->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1814
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1815
    limit = _igvn.makecon(TypeInt::ZERO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1816
    set_ctrl(limit, C->root());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1817
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1818
  // Create a new region on the exit path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1819
  RegionNode* reg = insert_region_before_proj(lp_exit);
16375
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 14623
diff changeset
  1820
  guarantee(reg != NULL, "null region node");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1821
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1822
  // Clone the if-cmpu-true-false using a signed compare
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1823
  BoolTest::mask rel_i = stride > 0 ? bol->_test._test : BoolTest::ge;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1824
  ProjNode* cmpi_exit = insert_if_before_proj(cmpu->in(1), Signed, rel_i, limit, lp_continue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1825
  reg->add_req(cmpi_exit);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1826
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1827
  // Clone the if-cmpu-true-false
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1828
  BoolTest::mask rel_u = bol->_test._test;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1829
  ProjNode* cmpu_exit = insert_if_before_proj(cmpu->in(1), Unsigned, rel_u, cmpu->in(2), lp_continue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1830
  reg->add_req(cmpu_exit);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1831
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1832
  // Force original if to stay in loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1833
  short_circuit_if(if_cmpu, lp_continue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1834
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1835
  return cmpi_exit->in(0)->as_If();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1836
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1837
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1838
//------------------------------ remove_cmpi_loop_exit -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1839
// Remove a previously inserted signed compare loop exit.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1840
void PhaseIdealLoop::remove_cmpi_loop_exit(IfNode* if_cmp, IdealLoopTree *loop) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1841
  Node* lp_proj = stay_in_loop(if_cmp, loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1842
  assert(if_cmp->in(1)->in(1)->Opcode() == Op_CmpI &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1843
         stay_in_loop(lp_proj, loop)->is_If() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1844
         stay_in_loop(lp_proj, loop)->in(1)->in(1)->Opcode() == Op_CmpU, "inserted cmpi before cmpu");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1845
  Node *con = _igvn.makecon(lp_proj->is_IfTrue() ? TypeInt::ONE : TypeInt::ZERO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1846
  set_ctrl(con, C->root());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1847
  if_cmp->set_req(1, con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1848
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1849
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1850
//------------------------------ scheduled_nodelist -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1851
// Create a post order schedule of nodes that are in the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1852
// "member" set.  The list is returned in "sched".
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1853
// The first node in "sched" is the loop head, followed by
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1854
// nodes which have no inputs in the "member" set, and then
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1855
// followed by the nodes that have an immediate input dependence
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1856
// on a node in "sched".
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1857
void PhaseIdealLoop::scheduled_nodelist( IdealLoopTree *loop, VectorSet& member, Node_List &sched ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1858
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1859
  assert(member.test(loop->_head->_idx), "loop head must be in member set");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1860
  Arena *a = Thread::current()->resource_area();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1861
  VectorSet visited(a);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1862
  Node_Stack nstack(a, loop->_body.size());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1863
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1864
  Node* n  = loop->_head;  // top of stack is cached in "n"
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1865
  uint idx = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1866
  visited.set(n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1867
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1868
  // Initially push all with no inputs from within member set
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1869
  for(uint i = 0; i < loop->_body.size(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1870
    Node *elt = loop->_body.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1871
    if (member.test(elt->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1872
      bool found = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1873
      for (uint j = 0; j < elt->req(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1874
        Node* def = elt->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1875
        if (def && member.test(def->_idx) && def != elt) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1876
          found = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1877
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1878
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1879
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1880
      if (!found && elt != loop->_head) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1881
        nstack.push(n, idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1882
        n = elt;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1883
        assert(!visited.test(n->_idx), "not seen yet");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1884
        visited.set(n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1885
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1886
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1887
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1888
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1889
  // traverse out's that are in the member set
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1890
  while (true) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1891
    if (idx < n->outcnt()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1892
      Node* use = n->raw_out(idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1893
      idx++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1894
      if (!visited.test_set(use->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1895
        if (member.test(use->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1896
          nstack.push(n, idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1897
          n = use;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1898
          idx = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1899
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1900
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1901
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1902
      // All outputs processed
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1903
      sched.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1904
      if (nstack.is_empty()) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1905
      n   = nstack.node();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1906
      idx = nstack.index();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1907
      nstack.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1908
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1909
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1910
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1911
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1912
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1913
//------------------------------ has_use_in_set -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1914
// Has a use in the vector set
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1915
bool PhaseIdealLoop::has_use_in_set( Node* n, VectorSet& vset ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1916
  for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1917
    Node* use = n->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1918
    if (vset.test(use->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1919
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1920
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1921
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1922
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1923
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1924
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1925
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1926
//------------------------------ has_use_internal_to_set -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1927
// Has use internal to the vector set (ie. not in a phi at the loop head)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1928
bool PhaseIdealLoop::has_use_internal_to_set( Node* n, VectorSet& vset, IdealLoopTree *loop ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1929
  Node* head  = loop->_head;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1930
  for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1931
    Node* use = n->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1932
    if (vset.test(use->_idx) && !(use->is_Phi() && use->in(0) == head)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1933
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1934
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1935
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1936
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1937
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1938
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1939
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1940
//------------------------------ clone_for_use_outside_loop -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1941
// clone "n" for uses that are outside of loop
17620
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  1942
int PhaseIdealLoop::clone_for_use_outside_loop( IdealLoopTree *loop, Node* n, Node_List& worklist ) {
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  1943
  int cloned = 0;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1944
  assert(worklist.size() == 0, "should be empty");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1945
  for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1946
    Node* use = n->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1947
    if( !loop->is_member(get_loop(has_ctrl(use) ? get_ctrl(use) : use)) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1948
      worklist.push(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1949
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1950
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1951
  while( worklist.size() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1952
    Node *use = worklist.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1953
    if (!has_node(use) || use->in(0) == C->top()) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1954
    uint j;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1955
    for (j = 0; j < use->req(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1956
      if (use->in(j) == n) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1957
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1958
    assert(j < use->req(), "must be there");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1959
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1960
    // clone "n" and insert it between the inputs of "n" and the use outside the loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1961
    Node* n_clone = n->clone();
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  1962
    _igvn.replace_input_of(use, j, n_clone);
17620
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  1963
    cloned++;
959
43abdbe76ae5 6700047: C2 failed in idom_no_update
never
parents: 781
diff changeset
  1964
    Node* use_c;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1965
    if (!use->is_Phi()) {
959
43abdbe76ae5 6700047: C2 failed in idom_no_update
never
parents: 781
diff changeset
  1966
      use_c = has_ctrl(use) ? get_ctrl(use) : use->in(0);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1967
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1968
      // Use in a phi is considered a use in the associated predecessor block
959
43abdbe76ae5 6700047: C2 failed in idom_no_update
never
parents: 781
diff changeset
  1969
      use_c = use->in(0)->in(j);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1970
    }
959
43abdbe76ae5 6700047: C2 failed in idom_no_update
never
parents: 781
diff changeset
  1971
    set_ctrl(n_clone, use_c);
43abdbe76ae5 6700047: C2 failed in idom_no_update
never
parents: 781
diff changeset
  1972
    assert(!loop->is_member(get_loop(use_c)), "should be outside loop");
43abdbe76ae5 6700047: C2 failed in idom_no_update
never
parents: 781
diff changeset
  1973
    get_loop(use_c)->_body.push(n_clone);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1974
    _igvn.register_new_node_with_optimizer(n_clone);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1975
#if !defined(PRODUCT)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1976
    if (TracePartialPeeling) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1977
      tty->print_cr("loop exit cloning old: %d new: %d newbb: %d", n->_idx, n_clone->_idx, get_ctrl(n_clone)->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1978
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1979
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1980
  }
17620
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  1981
  return cloned;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1982
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1983
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1984
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1985
//------------------------------ clone_for_special_use_inside_loop -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1986
// clone "n" for special uses that are in the not_peeled region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1987
// If these def-uses occur in separate blocks, the code generator
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1988
// marks the method as not compilable.  For example, if a "BoolNode"
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1989
// is in a different basic block than the "IfNode" that uses it, then
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1990
// the compilation is aborted in the code generator.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1991
void PhaseIdealLoop::clone_for_special_use_inside_loop( IdealLoopTree *loop, Node* n,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1992
                                                        VectorSet& not_peel, Node_List& sink_list, Node_List& worklist ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1993
  if (n->is_Phi() || n->is_Load()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1994
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1995
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1996
  assert(worklist.size() == 0, "should be empty");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1997
  for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1998
    Node* use = n->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1999
    if ( not_peel.test(use->_idx) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2000
         (use->is_If() || use->is_CMove() || use->is_Bool()) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2001
         use->in(1) == n)  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2002
      worklist.push(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2003
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2004
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2005
  if (worklist.size() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2006
    // clone "n" and insert it between inputs of "n" and the use
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2007
    Node* n_clone = n->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2008
    loop->_body.push(n_clone);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2009
    _igvn.register_new_node_with_optimizer(n_clone);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2010
    set_ctrl(n_clone, get_ctrl(n));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2011
    sink_list.push(n_clone);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2012
    not_peel <<= n_clone->_idx;  // add n_clone to not_peel set.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2013
#if !defined(PRODUCT)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2014
    if (TracePartialPeeling) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2015
      tty->print_cr("special not_peeled cloning old: %d new: %d", n->_idx, n_clone->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2016
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2017
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2018
    while( worklist.size() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2019
      Node *use = worklist.pop();
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2020
      _igvn.rehash_node_delayed(use);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2021
      for (uint j = 1; j < use->req(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2022
        if (use->in(j) == n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2023
          use->set_req(j, n_clone);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2024
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2025
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2026
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2027
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2028
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2029
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2030
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2031
//------------------------------ insert_phi_for_loop -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2032
// Insert phi(lp_entry_val, back_edge_val) at use->in(idx) for loop lp if phi does not already exist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2033
void PhaseIdealLoop::insert_phi_for_loop( Node* use, uint idx, Node* lp_entry_val, Node* back_edge_val, LoopNode* lp ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2034
  Node *phi = PhiNode::make(lp, back_edge_val);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2035
  phi->set_req(LoopNode::EntryControl, lp_entry_val);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2036
  // Use existing phi if it already exists
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2037
  Node *hit = _igvn.hash_find_insert(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2038
  if( hit == NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2039
    _igvn.register_new_node_with_optimizer(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2040
    set_ctrl(phi, lp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2041
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2042
    // Remove the new phi from the graph and use the hit
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2043
    _igvn.remove_dead_node(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2044
    phi = hit;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2045
  }
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2046
  _igvn.replace_input_of(use, idx, phi);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2047
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2048
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2049
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2050
//------------------------------ is_valid_loop_partition -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2051
// Validate the loop partition sets: peel and not_peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2052
bool PhaseIdealLoop::is_valid_loop_partition( IdealLoopTree *loop, VectorSet& peel, Node_List& peel_list,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2053
                                              VectorSet& not_peel ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2054
  uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2055
  // Check that peel_list entries are in the peel set
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2056
  for (i = 0; i < peel_list.size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2057
    if (!peel.test(peel_list.at(i)->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2058
      return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2059
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2060
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2061
  // Check at loop members are in one of peel set or not_peel set
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2062
  for (i = 0; i < loop->_body.size(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2063
    Node *def  = loop->_body.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2064
    uint di = def->_idx;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2065
    // Check that peel set elements are in peel_list
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2066
    if (peel.test(di)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2067
      if (not_peel.test(di)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2068
        return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2069
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2070
      // Must be in peel_list also
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2071
      bool found = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2072
      for (uint j = 0; j < peel_list.size(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2073
        if (peel_list.at(j)->_idx == di) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2074
          found = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2075
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2076
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2077
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2078
      if (!found) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2079
        return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2080
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2081
    } else if (not_peel.test(di)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2082
      if (peel.test(di)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2083
        return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2084
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2085
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2086
      return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2087
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2088
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2089
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2090
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2091
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2092
//------------------------------ is_valid_clone_loop_exit_use -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2093
// Ensure a use outside of loop is of the right form
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2094
bool PhaseIdealLoop::is_valid_clone_loop_exit_use( IdealLoopTree *loop, Node* use, uint exit_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2095
  Node *use_c = has_ctrl(use) ? get_ctrl(use) : use;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2096
  return (use->is_Phi() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2097
          use_c->is_Region() && use_c->req() == 3 &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2098
          (use_c->in(exit_idx)->Opcode() == Op_IfTrue ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2099
           use_c->in(exit_idx)->Opcode() == Op_IfFalse ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2100
           use_c->in(exit_idx)->Opcode() == Op_JumpProj) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2101
          loop->is_member( get_loop( use_c->in(exit_idx)->in(0) ) ) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2102
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2103
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2104
//------------------------------ is_valid_clone_loop_form -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2105
// Ensure that all uses outside of loop are of the right form
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2106
bool PhaseIdealLoop::is_valid_clone_loop_form( IdealLoopTree *loop, Node_List& peel_list,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2107
                                               uint orig_exit_idx, uint clone_exit_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2108
  uint len = peel_list.size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2109
  for (uint i = 0; i < len; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2110
    Node *def = peel_list.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2111
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2112
    for (DUIterator_Fast jmax, j = def->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2113
      Node *use = def->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2114
      Node *use_c = has_ctrl(use) ? get_ctrl(use) : use;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2115
      if (!loop->is_member(get_loop(use_c))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2116
        // use is not in the loop, check for correct structure
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2117
        if (use->in(0) == def) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2118
          // Okay
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2119
        } else if (!is_valid_clone_loop_exit_use(loop, use, orig_exit_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2120
          return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2121
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2122
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2123
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2124
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2125
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2126
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2127
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2128
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2129
//------------------------------ partial_peel -------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2130
// Partially peel (aka loop rotation) the top portion of a loop (called
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2131
// the peel section below) by cloning it and placing one copy just before
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2132
// the new loop head and the other copy at the bottom of the new loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2133
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2134
//    before                       after                where it came from
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2135
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2136
//    stmt1                        stmt1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2137
//  loop:                          stmt2                     clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2138
//    stmt2                        if condA goto exitA       clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2139
//    if condA goto exitA        new_loop:                   new
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2140
//    stmt3                        stmt3                     clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2141
//    if !condB goto loop          if condB goto exitB       clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2142
//  exitB:                         stmt2                     orig
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2143
//    stmt4                        if !condA goto new_loop   orig
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2144
//  exitA:                         goto exitA
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2145
//                               exitB:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2146
//                                 stmt4
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2147
//                               exitA:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2148
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2149
// Step 1: find the cut point: an exit test on probable
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2150
//         induction variable.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2151
// Step 2: schedule (with cloning) operations in the peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2152
//         section that can be executed after the cut into
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2153
//         the section that is not peeled.  This may need
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2154
//         to clone operations into exit blocks.  For
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2155
//         instance, a reference to A[i] in the not-peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2156
//         section and a reference to B[i] in an exit block
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2157
//         may cause a left-shift of i by 2 to be placed
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2158
//         in the peel block.  This step will clone the left
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2159
//         shift into the exit block and sink the left shift
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2160
//         from the peel to the not-peel section.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2161
// Step 3: clone the loop, retarget the control, and insert
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2162
//         phis for values that are live across the new loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2163
//         head.  This is very dependent on the graph structure
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2164
//         from clone_loop.  It creates region nodes for
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2165
//         exit control and associated phi nodes for values
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2166
//         flow out of the loop through that exit.  The region
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2167
//         node is dominated by the clone's control projection.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2168
//         So the clone's peel section is placed before the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2169
//         new loop head, and the clone's not-peel section is
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2170
//         forms the top part of the new loop.  The original
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2171
//         peel section forms the tail of the new loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2172
// Step 4: update the dominator tree and recompute the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2173
//         dominator depth.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2174
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2175
//                   orig
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2176
//
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2177
//                   stmt1
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2178
//                     |
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2179
//                     v
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2180
//               loop predicate
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2181
//                     |
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2182
//                     v
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2183
//                   loop<----+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2184
//                     |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2185
//                   stmt2    |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2186
//                     |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2187
//                     v      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2188
//                    ifA     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2189
//                   / |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2190
//                  v  v      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2191
//               false true   ^  <-- last_peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2192
//               /     |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2193
//              /   ===|==cut |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2194
//             /     stmt3    |  <-- first_not_peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2195
//            /        |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2196
//            |        v      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2197
//            v       ifB     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2198
//          exitA:   / \      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2199
//                  /   \     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2200
//                 v     v    |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2201
//               false true   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2202
//               /       \    |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2203
//              /         ----+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2204
//             |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2205
//             v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2206
//           exitB:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2207
//           stmt4
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2208
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2209
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2210
//            after clone loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2211
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2212
//                   stmt1
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2213
//                     |
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2214
//                     v
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2215
//               loop predicate
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2216
//                 /       \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2217
//        clone   /         \   orig
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2218
//               /           \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2219
//              /             \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2220
//             v               v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2221
//   +---->loop                loop<----+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2222
//   |      |                    |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2223
//   |    stmt2                stmt2    |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2224
//   |      |                    |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2225
//   |      v                    v      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2226
//   |      ifA                 ifA     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2227
//   |      | \                / |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2228
//   |      v  v              v  v      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2229
//   ^    true  false      false true   ^  <-- last_peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2230
//   |      |   ^   \       /    |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2231
//   | cut==|==  \   \     /  ===|==cut |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2232
//   |    stmt3   \   \   /    stmt3    |  <-- first_not_peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2233
//   |      |    dom   | |       |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2234
//   |      v      \  1v v2      v      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2235
//   |      ifB     regionA     ifB     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2236
//   |      / \        |       / \      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2237
//   |     /   \       v      /   \     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2238
//   |    v     v    exitA:  v     v    |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2239
//   |    true  false      false true   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2240
//   |    /     ^   \      /       \    |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2241
//   +----       \   \    /         ----+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2242
//               dom  \  /
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2243
//                 \  1v v2
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2244
//                  regionB
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2245
//                     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2246
//                     v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2247
//                   exitB:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2248
//                   stmt4
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2249
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2250
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2251
//           after partial peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2252
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2253
//                  stmt1
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2254
//                     |
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2255
//                     v
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2256
//               loop predicate
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2257
//                 /
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2258
//        clone   /             orig
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2259
//               /          TOP
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2260
//              /             \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2261
//             v               v
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2262
//    TOP->loop                loop----+
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2263
//          |                    |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2264
//        stmt2                stmt2    |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2265
//          |                    |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2266
//          v                    v      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2267
//          ifA                 ifA     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2268
//          | \                / |      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2269
//          v  v              v  v      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2270
//        true  false      false true   |     <-- last_peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2271
//          |   ^   \       /    +------|---+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2272
//  +->newloop   \   \     /  === ==cut |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2273
//  |     stmt3   \   \   /     TOP     |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2274
//  |       |    dom   | |      stmt3   |   | <-- first_not_peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2275
//  |       v      \  1v v2      v      |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2276
//  |       ifB     regionA     ifB     ^   v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2277
//  |       / \        |       / \      |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2278
//  |      /   \       v      /   \     |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2279
//  |     v     v    exitA:  v     v    |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2280
//  |     true  false      false true   |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2281
//  |     /     ^   \      /       \    |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2282
//  |    |       \   \    /         v   |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2283
//  |    |       dom  \  /         TOP  |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2284
//  |    |         \  1v v2             |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2285
//  ^    v          regionB             |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2286
//  |    |             |                |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2287
//  |    |             v                ^   v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2288
//  |    |           exitB:             |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2289
//  |    |           stmt4              |   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2290
//  |    +------------>-----------------+   |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2291
//  |                                       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2292
//  +-----------------<---------------------+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2293
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2294
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2295
//              final graph
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2296
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2297
//                  stmt1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2298
//                    |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2299
//                    v
9330
b55150173fc9 7039586: test/java/util/Collections/Rotate.java failing with hs21-b09
kvn
parents: 9124
diff changeset
  2300
//               loop predicate
b55150173fc9 7039586: test/java/util/Collections/Rotate.java failing with hs21-b09
kvn
parents: 9124
diff changeset
  2301
//                    |
b55150173fc9 7039586: test/java/util/Collections/Rotate.java failing with hs21-b09
kvn
parents: 9124
diff changeset
  2302
//                    v
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2303
//                  stmt2 clone
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2304
//                    |
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2305
//                    v
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2306
//         ........> ifA clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2307
//         :        / |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2308
//        dom      /  |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2309
//         :      v   v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2310
//         :  false   true
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2311
//         :  |       |
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2312
//         :  |       v
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2313
//         :  |    newloop<-----+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2314
//         :  |        |        |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2315
//         :  |     stmt3 clone |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2316
//         :  |        |        |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2317
//         :  |        v        |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2318
//         :  |       ifB       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2319
//         :  |      / \        |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2320
//         :  |     v   v       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2321
//         :  |  false true     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2322
//         :  |   |     |       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2323
//         :  |   v    stmt2    |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2324
//         :  | exitB:  |       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2325
//         :  | stmt4   v       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2326
//         :  |       ifA orig  |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2327
//         :  |      /  \       |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2328
//         :  |     /    \      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2329
//         :  |    v     v      |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2330
//         :  |  false  true    |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2331
//         :  |  /        \     |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2332
//         :  v  v         -----+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2333
//          RegionA
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2334
//             |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2335
//             v
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2336
//           exitA
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2337
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2338
bool PhaseIdealLoop::partial_peel( IdealLoopTree *loop, Node_List &old_new ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2339
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
  2340
  assert(!loop->_head->is_CountedLoop(), "Non-counted loop only");
355
22d39d357cca 6684385: Loop unswitching crashes without LoopNode
rasbold
parents: 242
diff changeset
  2341
  if (!loop->_head->is_Loop()) {
22d39d357cca 6684385: Loop unswitching crashes without LoopNode
rasbold
parents: 242
diff changeset
  2342
    return false;  }
22d39d357cca 6684385: Loop unswitching crashes without LoopNode
rasbold
parents: 242
diff changeset
  2343
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2344
  LoopNode *head  = loop->_head->as_Loop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2345
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2346
  if (head->is_partial_peel_loop() || head->partial_peel_has_failed()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2347
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2348
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2349
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2350
  // Check for complex exit control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2351
  for(uint ii = 0; ii < loop->_body.size(); ii++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2352
    Node *n = loop->_body.at(ii);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2353
    int opc = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2354
    if (n->is_Call()        ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2355
        opc == Op_Catch     ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2356
        opc == Op_CatchProj ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2357
        opc == Op_Jump      ||
20289
35d78de0c547 8024924: Intrinsify java.lang.Math.addExact
rbackman
parents: 17620
diff changeset
  2358
        opc == Op_JumpProj  ||
35d78de0c547 8024924: Intrinsify java.lang.Math.addExact
rbackman
parents: 17620
diff changeset
  2359
        opc == Op_FlagsProj) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2360
#if !defined(PRODUCT)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2361
      if (TracePartialPeeling) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2362
        tty->print_cr("\nExit control too complex: lp: %d", head->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2363
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2364
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2365
      return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2366
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2367
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2368
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2369
  int dd = dom_depth(head);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2370
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2371
  // Step 1: find cut point
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2372
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2373
  // Walk up dominators to loop head looking for first loop exit
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2374
  // which is executed on every path thru loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2375
  IfNode *peel_if = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2376
  IfNode *peel_if_cmpu = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2377
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2378
  Node *iff = loop->tail();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2379
  while( iff != head ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2380
    if( iff->is_If() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2381
      Node *ctrl = get_ctrl(iff->in(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2382
      if (ctrl->is_top()) return false; // Dead test on live IF.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2383
      // If loop-varying exit-test, check for induction variable
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2384
      if( loop->is_member(get_loop(ctrl)) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2385
          loop->is_loop_exit(iff) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2386
          is_possible_iv_test(iff)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2387
        Node* cmp = iff->in(1)->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2388
        if (cmp->Opcode() == Op_CmpI) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2389
          peel_if = iff->as_If();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2390
        } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2391
          assert(cmp->Opcode() == Op_CmpU, "must be CmpI or CmpU");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2392
          peel_if_cmpu = iff->as_If();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2393
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2394
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2395
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2396
    iff = idom(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2397
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2398
  // Prefer signed compare over unsigned compare.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2399
  IfNode* new_peel_if = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2400
  if (peel_if == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2401
    if (!PartialPeelAtUnsignedTests || peel_if_cmpu == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2402
      return false;   // No peel point found
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2403
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2404
    new_peel_if = insert_cmpi_loop_exit(peel_if_cmpu, loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2405
    if (new_peel_if == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2406
      return false;   // No peel point found
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2407
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2408
    peel_if = new_peel_if;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2409
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2410
  Node* last_peel        = stay_in_loop(peel_if, loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2411
  Node* first_not_peeled = stay_in_loop(last_peel, loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2412
  if (first_not_peeled == NULL || first_not_peeled == head) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2413
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2414
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2415
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2416
#if !defined(PRODUCT)
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2417
  if (TraceLoopOpts) {
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2418
    tty->print("PartialPeel  ");
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2419
    loop->dump_head();
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2420
  }
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2421
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2422
  if (TracePartialPeeling) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2423
    tty->print_cr("before partial peel one iteration");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2424
    Node_List wl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2425
    Node* t = head->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2426
    while (true) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2427
      wl.push(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2428
      if (t == head) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2429
      t = idom(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2430
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2431
    while (wl.size() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2432
      Node* tt = wl.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2433
      tt->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2434
      if (tt == last_peel) tty->print_cr("-- cut --");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2435
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2436
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2437
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2438
  ResourceArea *area = Thread::current()->resource_area();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2439
  VectorSet peel(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2440
  VectorSet not_peel(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2441
  Node_List peel_list(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2442
  Node_List worklist(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2443
  Node_List sink_list(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2444
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2445
  // Set of cfg nodes to peel are those that are executable from
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2446
  // the head through last_peel.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2447
  assert(worklist.size() == 0, "should be empty");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2448
  worklist.push(head);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2449
  peel.set(head->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2450
  while (worklist.size() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2451
    Node *n = worklist.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2452
    if (n != last_peel) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2453
      for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2454
        Node* use = n->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2455
        if (use->is_CFG() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2456
            loop->is_member(get_loop(use)) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2457
            !peel.test_set(use->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2458
          worklist.push(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2459
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2460
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2461
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2462
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2463
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2464
  // Set of non-cfg nodes to peel are those that are control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2465
  // dependent on the cfg nodes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2466
  uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2467
  for(i = 0; i < loop->_body.size(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2468
    Node *n = loop->_body.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2469
    Node *n_c = has_ctrl(n) ? get_ctrl(n) : n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2470
    if (peel.test(n_c->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2471
      peel.set(n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2472
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2473
      not_peel.set(n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2474
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2475
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2476
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2477
  // Step 2: move operations from the peeled section down into the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2478
  //         not-peeled section
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2479
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2480
  // Get a post order schedule of nodes in the peel region
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2481
  // Result in right-most operand.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2482
  scheduled_nodelist(loop, peel, peel_list );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2483
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2484
  assert(is_valid_loop_partition(loop, peel, peel_list, not_peel), "bad partition");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2485
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2486
  // For future check for too many new phis
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2487
  uint old_phi_cnt = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2488
  for (DUIterator_Fast jmax, j = head->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2489
    Node* use = head->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2490
    if (use->is_Phi()) old_phi_cnt++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2491
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2492
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2493
#if !defined(PRODUCT)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2494
  if (TracePartialPeeling) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2495
    tty->print_cr("\npeeled list");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2496
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2497
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2498
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2499
  // Evacuate nodes in peel region into the not_peeled region if possible
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2500
  uint new_phi_cnt = 0;
17620
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  2501
  uint cloned_for_outside_use = 0;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2502
  for (i = 0; i < peel_list.size();) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2503
    Node* n = peel_list.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2504
#if !defined(PRODUCT)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2505
  if (TracePartialPeeling) n->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2506
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2507
    bool incr = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2508
    if ( !n->is_CFG() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2509
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2510
      if ( has_use_in_set(n, not_peel) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2511
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2512
        // If not used internal to the peeled region,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2513
        // move "n" from peeled to not_peeled region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2514
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2515
        if ( !has_use_internal_to_set(n, peel, loop) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2516
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2517
          // if not pinned and not a load (which maybe anti-dependent on a store)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2518
          // and not a CMove (Matcher expects only bool->cmove).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2519
          if ( n->in(0) == NULL && !n->is_Load() && !n->is_CMove() ) {
17620
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  2520
            cloned_for_outside_use += clone_for_use_outside_loop( loop, n, worklist );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2521
            sink_list.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2522
            peel     >>= n->_idx; // delete n from peel set.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2523
            not_peel <<= n->_idx; // add n to not_peel set.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2524
            peel_list.remove(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2525
            incr = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2526
#if !defined(PRODUCT)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2527
            if (TracePartialPeeling) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2528
              tty->print_cr("sink to not_peeled region: %d newbb: %d",
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2529
                            n->_idx, get_ctrl(n)->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2530
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2531
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2532
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2533
        } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2534
          // Otherwise check for special def-use cases that span
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2535
          // the peel/not_peel boundary such as bool->if
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2536
          clone_for_special_use_inside_loop( loop, n, not_peel, sink_list, worklist );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2537
          new_phi_cnt++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2538
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2539
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2540
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2541
    if (incr) i++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2542
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2543
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2544
  if (new_phi_cnt > old_phi_cnt + PartialPeelNewPhiDelta) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2545
#if !defined(PRODUCT)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2546
    if (TracePartialPeeling) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2547
      tty->print_cr("\nToo many new phis: %d  old %d new cmpi: %c",
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2548
                    new_phi_cnt, old_phi_cnt, new_peel_if != NULL?'T':'F');
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2549
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2550
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2551
    if (new_peel_if != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2552
      remove_cmpi_loop_exit(new_peel_if, loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2553
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2554
    // Inhibit more partial peeling on this loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2555
    assert(!head->is_partial_peel_loop(), "not partial peeled");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2556
    head->mark_partial_peel_failed();
17620
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  2557
    if (cloned_for_outside_use > 0) {
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  2558
      // Terminate this round of loop opts because
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  2559
      // the graph outside this loop was changed.
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  2560
      C->set_major_progress();
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  2561
      return true;
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  2562
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2563
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2564
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2565
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2566
  // Step 3: clone loop, retarget control, and insert new phis
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2567
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2568
  // Create new loop head for new phis and to hang
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2569
  // the nodes being moved (sinked) from the peel region.
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  2570
  LoopNode* new_head = new (C) LoopNode(last_peel, last_peel);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2571
  new_head->set_unswitch_count(head->unswitch_count()); // Preserve
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2572
  _igvn.register_new_node_with_optimizer(new_head);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2573
  assert(first_not_peeled->in(0) == last_peel, "last_peel <- first_not_peeled");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2574
  first_not_peeled->set_req(0, new_head);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2575
  set_loop(new_head, loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2576
  loop->_body.push(new_head);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2577
  not_peel.set(new_head->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2578
  set_idom(new_head, last_peel, dom_depth(first_not_peeled));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2579
  set_idom(first_not_peeled, new_head, dom_depth(first_not_peeled));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2580
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2581
  while (sink_list.size() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2582
    Node* n = sink_list.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2583
    set_ctrl(n, new_head);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2584
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2585
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2586
  assert(is_valid_loop_partition(loop, peel, peel_list, not_peel), "bad partition");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2587
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2588
  clone_loop( loop, old_new, dd );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2589
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2590
  const uint clone_exit_idx = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2591
  const uint orig_exit_idx  = 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2592
  assert(is_valid_clone_loop_form( loop, peel_list, orig_exit_idx, clone_exit_idx ), "bad clone loop");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2593
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2594
  Node* head_clone             = old_new[head->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2595
  LoopNode* new_head_clone     = old_new[new_head->_idx]->as_Loop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2596
  Node* orig_tail_clone        = head_clone->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2597
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2598
  // Add phi if "def" node is in peel set and "use" is not
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2599
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2600
  for(i = 0; i < peel_list.size(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2601
    Node *def  = peel_list.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2602
    if (!def->is_CFG()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2603
      for (DUIterator_Fast jmax, j = def->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2604
        Node *use = def->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2605
        if (has_node(use) && use->in(0) != C->top() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2606
            (!peel.test(use->_idx) ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2607
             (use->is_Phi() && use->in(0) == head)) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2608
          worklist.push(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2609
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2610
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2611
      while( worklist.size() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2612
        Node *use = worklist.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2613
        for (uint j = 1; j < use->req(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2614
          Node* n = use->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2615
          if (n == def) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2616
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2617
            // "def" is in peel set, "use" is not in peel set
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2618
            // or "use" is in the entry boundary (a phi) of the peel set
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2619
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2620
            Node* use_c = has_ctrl(use) ? get_ctrl(use) : use;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2621
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2622
            if ( loop->is_member(get_loop( use_c )) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2623
              // use is in loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2624
              if (old_new[use->_idx] != NULL) { // null for dead code
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2625
                Node* use_clone = old_new[use->_idx];
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2626
                _igvn.replace_input_of(use, j, C->top());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2627
                insert_phi_for_loop( use_clone, j, old_new[def->_idx], def, new_head_clone );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2628
              }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2629
            } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2630
              assert(is_valid_clone_loop_exit_use(loop, use, orig_exit_idx), "clone loop format");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2631
              // use is not in the loop, check if the live range includes the cut
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2632
              Node* lp_if = use_c->in(orig_exit_idx)->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2633
              if (not_peel.test(lp_if->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2634
                assert(j == orig_exit_idx, "use from original loop");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2635
                insert_phi_for_loop( use, clone_exit_idx, old_new[def->_idx], def, new_head_clone );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2636
              }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2637
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2638
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2639
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2640
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2641
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2642
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2643
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2644
  // Step 3b: retarget control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2645
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2646
  // Redirect control to the new loop head if a cloned node in
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2647
  // the not_peeled region has control that points into the peeled region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2648
  // This necessary because the cloned peeled region will be outside
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2649
  // the loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2650
  //                            from    to
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2651
  //          cloned-peeled    <---+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2652
  //    new_head_clone:            |    <--+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2653
  //          cloned-not_peeled  in(0)    in(0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2654
  //          orig-peeled
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2655
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2656
  for(i = 0; i < loop->_body.size(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2657
    Node *n = loop->_body.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2658
    if (!n->is_CFG()           && n->in(0) != NULL        &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2659
        not_peel.test(n->_idx) && peel.test(n->in(0)->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2660
      Node* n_clone = old_new[n->_idx];
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2661
      _igvn.replace_input_of(n_clone, 0, new_head_clone);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2662
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2663
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2664
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2665
  // Backedge of the surviving new_head (the clone) is original last_peel
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2666
  _igvn.replace_input_of(new_head_clone, LoopNode::LoopBackControl, last_peel);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2667
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2668
  // Cut first node in original not_peel set
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2669
  _igvn.rehash_node_delayed(new_head);                     // Multiple edge updates:
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2670
  new_head->set_req(LoopNode::EntryControl,    C->top());  //   use rehash_node_delayed / set_req instead of
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2671
  new_head->set_req(LoopNode::LoopBackControl, C->top());  //   multiple replace_input_of calls
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2672
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2673
  // Copy head_clone back-branch info to original head
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2674
  // and remove original head's loop entry and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2675
  // clone head's back-branch
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2676
  _igvn.rehash_node_delayed(head); // Multiple edge updates
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2677
  head->set_req(LoopNode::EntryControl,    head_clone->in(LoopNode::LoopBackControl));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2678
  head->set_req(LoopNode::LoopBackControl, C->top());
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2679
  _igvn.replace_input_of(head_clone, LoopNode::LoopBackControl, C->top());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2680
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2681
  // Similarly modify the phis
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2682
  for (DUIterator_Fast kmax, k = head->fast_outs(kmax); k < kmax; k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2683
    Node* use = head->fast_out(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2684
    if (use->is_Phi() && use->outcnt() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2685
      Node* use_clone = old_new[use->_idx];
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2686
      _igvn.rehash_node_delayed(use); // Multiple edge updates
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2687
      use->set_req(LoopNode::EntryControl,    use_clone->in(LoopNode::LoopBackControl));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2688
      use->set_req(LoopNode::LoopBackControl, C->top());
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2689
      _igvn.replace_input_of(use_clone, LoopNode::LoopBackControl, C->top());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2690
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2691
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2692
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2693
  // Step 4: update dominator tree and dominator depth
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2694
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2695
  set_idom(head, orig_tail_clone, dd);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2696
  recompute_dom_depth();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2697
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2698
  // Inhibit more partial peeling on this loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2699
  new_head_clone->set_partial_peel_loop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2700
  C->set_major_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2701
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2702
#if !defined(PRODUCT)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2703
  if (TracePartialPeeling) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2704
    tty->print_cr("\nafter partial peel one iteration");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2705
    Node_List wl(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2706
    Node* t = last_peel;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2707
    while (true) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2708
      wl.push(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2709
      if (t == head_clone) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2710
      t = idom(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2711
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2712
    while (wl.size() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2713
      Node* tt = wl.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2714
      if (tt == head) tty->print_cr("orig head");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2715
      else if (tt == new_head_clone) tty->print_cr("new head");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2716
      else if (tt == head_clone) tty->print_cr("clone head");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2717
      tt->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2718
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2719
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2720
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2721
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2722
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2723
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2724
//------------------------------reorg_offsets----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2725
// Reorganize offset computations to lower register pressure.  Mostly
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2726
// prevent loop-fallout uses of the pre-incremented trip counter (which are
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2727
// then alive with the post-incremented trip counter forcing an extra
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2728
// register move)
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2729
void PhaseIdealLoop::reorg_offsets(IdealLoopTree *loop) {
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2730
  // Perform it only for canonical counted loops.
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2731
  // Loop's shape could be messed up by iteration_split_impl.
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2732
  if (!loop->_head->is_CountedLoop())
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2733
    return;
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2734
  if (!loop->_head->as_Loop()->is_valid_counted_loop())
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2735
    return;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2736
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2737
  CountedLoopNode *cl = loop->_head->as_CountedLoop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2738
  CountedLoopEndNode *cle = cl->loopexit();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2739
  Node *exit = cle->proj_out(false);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2740
  Node *phi = cl->phi();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2741
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2742
  // Check for the special case of folks using the pre-incremented
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2743
  // trip-counter on the fall-out path (forces the pre-incremented
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2744
  // and post-incremented trip counter to be live at the same time).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2745
  // Fix this by adjusting to use the post-increment trip counter.
1399
9648dfd4ce09 6384206: Phis which are later unneeded are impairing our ability to inline based on static types
never
parents: 1122
diff changeset
  2746
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2747
  bool progress = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2748
  while (progress) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2749
    progress = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2750
    for (DUIterator_Fast imax, i = phi->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2751
      Node* use = phi->fast_out(i);   // User of trip-counter
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2752
      if (!has_ctrl(use))  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2753
      Node *u_ctrl = get_ctrl(use);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2754
      if (use->is_Phi()) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2755
        u_ctrl = NULL;
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2756
        for (uint j = 1; j < use->req(); j++)
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2757
          if (use->in(j) == phi)
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2758
            u_ctrl = dom_lca(u_ctrl, use->in(0)->in(j));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2759
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2760
      IdealLoopTree *u_loop = get_loop(u_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2761
      // Look for loop-invariant use
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2762
      if (u_loop == loop) continue;
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2763
      if (loop->is_member(u_loop)) continue;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2764
      // Check that use is live out the bottom.  Assuming the trip-counter
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2765
      // update is right at the bottom, uses of of the loop middle are ok.
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2766
      if (dom_lca(exit, u_ctrl) != exit) continue;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2767
      // Hit!  Refactor use to use the post-incremented tripcounter.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2768
      // Compute a post-increment tripcounter.
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  2769
      Node *opaq = new (C) Opaque2Node( C, cle->incr() );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2770
      register_new_node( opaq, u_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2771
      Node *neg_stride = _igvn.intcon(-cle->stride_con());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2772
      set_ctrl(neg_stride, C->root());
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  2773
      Node *post = new (C) AddINode( opaq, neg_stride);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2774
      register_new_node( post, u_ctrl );
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 11447
diff changeset
  2775
      _igvn.rehash_node_delayed(use);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2776
      for (uint j = 1; j < use->req(); j++) {
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2777
        if (use->in(j) == phi)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2778
          use->set_req(j, post);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 7397
diff changeset
  2779
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2780
      // Since DU info changed, rerun loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2781
      progress = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2782
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2783
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2784
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2785
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2786
}