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