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