hotspot/src/share/vm/opto/ifnode.cpp
author roland
Wed, 29 Apr 2015 14:43:12 -0700
changeset 30309 da3efc8ed2cb
parent 30183 a6588c0a3259
child 30629 b6e5ad2f18d5
permissions -rw-r--r--
8078426: mb/jvm/compiler/InterfaceCalls/testAC2 - assert(predicate_proj == 0L) failed: only one predicate entry expected Summary: split if finds predicates on several incoming paths when unswitched's loops are optimized out Reviewed-by: kvn
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
22234
da823d78ad65 8029233: Update copyright year to match last edit in jdk8 hotspot repository for 2013
mikael
parents: 21089
diff changeset
     2
 * Copyright (c) 2000, 2013, 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: 4582
diff changeset
    19
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 4582
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: 4582
diff changeset
    21
 * questions.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    25
#include "precompiled.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    26
#include "memory/allocation.inline.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    27
#include "opto/addnode.hpp"
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
    28
#include "opto/castnode.hpp"
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    29
#include "opto/cfgnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    30
#include "opto/connode.hpp"
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
    31
#include "opto/loopnode.hpp"
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    32
#include "opto/phaseX.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    33
#include "opto/runtime.hpp"
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
    34
#include "opto/rootnode.hpp"
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    35
#include "opto/subnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    36
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
// Portions of code courtesy of Clifford Click
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
// Optimization - Graph Style
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
extern int explicit_null_checks_elided;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
//------------------------------Value------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
// Return a tuple for whichever arm of the IF is reachable
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
const Type *IfNode::Value( PhaseTransform *phase ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
  if( !in(0) ) return Type::TOP;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
  if( phase->type(in(0)) == Type::TOP )
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
    return Type::TOP;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
  const Type *t = phase->type(in(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
  if( t == Type::TOP )          // data is undefined
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
    return TypeTuple::IFNEITHER; // unreachable altogether
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
  if( t == TypeInt::ZERO )      // zero, or false
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
    return TypeTuple::IFFALSE;  // only false branch is reachable
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
  if( t == TypeInt::ONE )       // 1, or true
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
    return TypeTuple::IFTRUE;   // only true branch is reachable
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
  assert( t == TypeInt::BOOL, "expected boolean type" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
  return TypeTuple::IFBOTH;     // No progress
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
const RegMask &IfNode::out_RegMask() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
  return RegMask::Empty;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
//------------------------------split_if---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
// Look for places where we merge constants, then test on the merged value.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
// If the IF test will be constant folded on the path with the constant, we
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
// win by splitting the IF to before the merge point.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
static Node* split_if(IfNode *iff, PhaseIterGVN *igvn) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
  // I could be a lot more general here, but I'm trying to squeeze this
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
  // in before the Christmas '98 break so I'm gonna be kinda restrictive
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
  // on the patterns I accept.  CNC
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
  // Look for a compare of a constant and a merged value
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
  Node *i1 = iff->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
  if( !i1->is_Bool() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
  BoolNode *b = i1->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
  Node *cmp = b->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
  if( !cmp->is_Cmp() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
  i1 = cmp->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
  if( i1 == NULL || !i1->is_Phi() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
  PhiNode *phi = i1->as_Phi();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
  if( phi->is_copy() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
  Node *con2 = cmp->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
  if( !con2->is_Con() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
  // See that the merge point contains some constants
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
  Node *con1=NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
  uint i4;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
  for( i4 = 1; i4 < phi->req(); i4++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
    con1 = phi->in(i4);
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1217
diff changeset
    93
    if( !con1 ) return NULL;    // Do not optimize partially collapsed merges
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
    if( con1->is_Con() ) break; // Found a constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
    // Also allow null-vs-not-null checks
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
    const TypePtr *tp = igvn->type(con1)->isa_ptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
    if( tp && tp->_ptr == TypePtr::NotNull )
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
  if( i4 >= phi->req() ) return NULL; // Found no constants
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
  igvn->C->set_has_split_ifs(true); // Has chance for split-if
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
  // Make sure that the compare can be constant folded away
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
  Node *cmp2 = cmp->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
  cmp2->set_req(1,con1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
  cmp2->set_req(2,con2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
  const Type *t = cmp2->Value(igvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
  // This compare is dead, so whack it!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
  igvn->remove_dead_node(cmp2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
  if( !t->singleton() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
  // No intervening control, like a simple Call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
  Node *r = iff->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
  if( !r->is_Region() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
  if( phi->region() != r ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
  // No other users of the cmp/bool
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
  if (b->outcnt() != 1 || cmp->outcnt() != 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
    //tty->print_cr("many users of cmp/bool");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
  // Make sure we can determine where all the uses of merged values go
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
  for (DUIterator_Fast jmax, j = r->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
    Node* u = r->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
    if( u == r ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
    if( u == iff ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
    if( u->outcnt() == 0 ) continue; // use is dead & ignorable
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
    if( !u->is_Phi() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
      /*
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
      if( u->is_Start() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
        tty->print_cr("Region has inlined start use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
        tty->print_cr("Region has odd use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
        u->dump(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
      }*/
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
    if( u != phi ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
      // CNC - do not allow any other merged value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
      //tty->print_cr("Merging another value");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
      //u->dump(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
    // Make sure we can account for all Phi uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
    for (DUIterator_Fast kmax, k = u->fast_outs(kmax); k < kmax; k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
      Node* v = u->fast_out(k); // User of the phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
      // CNC - Allow only really simple patterns.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
      // In particular I disallow AddP of the Phi, a fairly common pattern
28927
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   150
      if (v == cmp) continue;  // The compare is OK
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   151
      if (v->is_ConstraintCast()) {
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   152
        // If the cast is derived from data flow edges, it may not have a control edge.
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   153
        // If so, it should be safe to split. But follow-up code can not deal with
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   154
        // this (l. 359). So skip.
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   155
        if (v->in(0) == NULL) {
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   156
          return NULL;
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   157
        }
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   158
        if (v->in(0)->in(0) == iff) {
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   159
          continue;               // CastPP/II of the IfNode is OK
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   160
        }
48e4a707e777 8071996: split_if accesses NULL region of ConstraintCast
goetz
parents: 28486
diff changeset
   161
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
      // Disabled following code because I cannot tell if exactly one
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
      // path dominates without a real dominator check. CNC 9/9/1999
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
      //uint vop = v->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
      //if( vop == Op_Phi ) {     // Phi from another merge point might be OK
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
      //  Node *r = v->in(0);     // Get controlling point
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
      //  if( !r ) return NULL;   // Degraded to a copy
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
      //  // Find exactly one path in (either True or False doms, but not IFF)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
      //  int cnt = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
      //  for( uint i = 1; i < r->req(); i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
      //    if( r->in(i) && r->in(i)->in(0) == iff )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
      //      cnt++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
      //  if( cnt == 1 ) continue; // Exactly one of True or False guards Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
      //}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
      if( !v->is_Call() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
        /*
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
        if( v->Opcode() == Op_AddP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   178
          tty->print_cr("Phi has AddP use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   179
        } else if( v->Opcode() == Op_CastPP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
          tty->print_cr("Phi has CastPP use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
        } else if( v->Opcode() == Op_CastII ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
          tty->print_cr("Phi has CastII use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
        } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
          tty->print_cr("Phi has use I cant be bothered with");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
        */
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
      /* CNC - Cut out all the fancy acceptance tests
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
      // Can we clone this use when doing the transformation?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
      // If all uses are from Phis at this merge or constants, then YES.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
      if( !v->in(0) && v != cmp ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
        tty->print_cr("Phi has free-floating use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
        v->dump(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
        return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
      for( uint l = 1; l < v->req(); l++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
        if( (!v->in(l)->is_Phi() || v->in(l)->in(0) != r) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
            !v->in(l)->is_Con() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
          tty->print_cr("Phi has use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
          v->dump(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
          return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
        } // End of if Phi-use input is neither Phi nor Constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
      } // End of for all inputs to Phi-use
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
      */
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
    } // End of for all uses of Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
  } // End of for all uses of Region
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
  // Only do this if the IF node is in a sane state
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
  if (iff->outcnt() != 2)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
  // Got a hit!  Do the Mondo Hack!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
  //ABC  a1c   def   ghi            B     1     e     h   A C   a c   d f   g i
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
  // R - Phi - Phi - Phi            Rc - Phi - Phi - Phi   Rx - Phi - Phi - Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
  //     cmp - 2                         cmp - 2               cmp - 2
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
  //       bool                            bool_c                bool_x
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
  //       if                               if_c                  if_x
489c9b5090e2 Initial load
duke
parents:
diff changeset
   221
  //      T  F                              T  F                  T  F
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
  // ..s..    ..t ..                   ..s..    ..t..        ..s..    ..t..
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
  //
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1217
diff changeset
   224
  // Split the paths coming into the merge point into 2 separate groups of
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
  // merges.  On the left will be all the paths feeding constants into the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   226
  // Cmp's Phi.  On the right will be the remaining paths.  The Cmp's Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
  // will fold up into a constant; this will let the Cmp fold up as well as
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
  // all the control flow.  Below the original IF we have 2 control
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
  // dependent regions, 's' and 't'.  Now we will merge the two paths
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
  // just prior to 's' and 't' from the two IFs.  At least 1 path (and quite
489c9b5090e2 Initial load
duke
parents:
diff changeset
   231
  // likely 2 or more) will promptly constant fold away.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   232
  PhaseGVN *phase = igvn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   233
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
  // Make a region merging constants and a region merging the rest
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
  uint req_c = 0;
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   236
  Node* predicate_proj = NULL;
30309
da3efc8ed2cb 8078426: mb/jvm/compiler/InterfaceCalls/testAC2 - assert(predicate_proj == 0L) failed: only one predicate entry expected
roland
parents: 30183
diff changeset
   237
  int nb_predicate_proj = 0;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
  for (uint ii = 1; ii < r->req(); ii++) {
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   239
    if (phi->in(ii) == con1) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
      req_c++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   241
    }
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   242
    Node* proj = PhaseIdealLoop::find_predicate(r->in(ii));
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   243
    if (proj != NULL) {
30309
da3efc8ed2cb 8078426: mb/jvm/compiler/InterfaceCalls/testAC2 - assert(predicate_proj == 0L) failed: only one predicate entry expected
roland
parents: 30183
diff changeset
   244
      nb_predicate_proj++;
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   245
      predicate_proj = proj;
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   246
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
  }
30309
da3efc8ed2cb 8078426: mb/jvm/compiler/InterfaceCalls/testAC2 - assert(predicate_proj == 0L) failed: only one predicate entry expected
roland
parents: 30183
diff changeset
   248
  if (nb_predicate_proj > 1) {
da3efc8ed2cb 8078426: mb/jvm/compiler/InterfaceCalls/testAC2 - assert(predicate_proj == 0L) failed: only one predicate entry expected
roland
parents: 30183
diff changeset
   249
    // Can happen in case of loop unswitching and when the loop is
da3efc8ed2cb 8078426: mb/jvm/compiler/InterfaceCalls/testAC2 - assert(predicate_proj == 0L) failed: only one predicate entry expected
roland
parents: 30183
diff changeset
   250
    // optimized out: it's not a loop anymore so we don't care about
da3efc8ed2cb 8078426: mb/jvm/compiler/InterfaceCalls/testAC2 - assert(predicate_proj == 0L) failed: only one predicate entry expected
roland
parents: 30183
diff changeset
   251
    // predicates.
da3efc8ed2cb 8078426: mb/jvm/compiler/InterfaceCalls/testAC2 - assert(predicate_proj == 0L) failed: only one predicate entry expected
roland
parents: 30183
diff changeset
   252
    assert(!r->is_Loop(), "this must not be a loop anymore");
da3efc8ed2cb 8078426: mb/jvm/compiler/InterfaceCalls/testAC2 - assert(predicate_proj == 0L) failed: only one predicate entry expected
roland
parents: 30183
diff changeset
   253
    predicate_proj = NULL;
da3efc8ed2cb 8078426: mb/jvm/compiler/InterfaceCalls/testAC2 - assert(predicate_proj == 0L) failed: only one predicate entry expected
roland
parents: 30183
diff changeset
   254
  }
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   255
  Node* predicate_c = NULL;
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   256
  Node* predicate_x = NULL;
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9101
diff changeset
   257
  bool counted_loop = r->is_CountedLoop();
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   258
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   259
  Node *region_c = new RegionNode(req_c + 1);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
  Node *phi_c    = con1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
  uint  len      = r->req();
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   262
  Node *region_x = new RegionNode(len - req_c);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
  Node *phi_x    = PhiNode::make_blank(region_x, phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   264
  for (uint i = 1, i_c = 1, i_x = 1; i < len; i++) {
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   265
    if (phi->in(i) == con1) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
      region_c->init_req( i_c++, r  ->in(i) );
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   267
      if (r->in(i) == predicate_proj)
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   268
        predicate_c = predicate_proj;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
      region_x->init_req( i_x,   r  ->in(i) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
      phi_x   ->init_req( i_x++, phi->in(i) );
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   272
      if (r->in(i) == predicate_proj)
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   273
        predicate_x = predicate_proj;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
  }
10258
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   276
  if (predicate_c != NULL && (req_c > 1)) {
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   277
    assert(predicate_x == NULL, "only one predicate entry expected");
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   278
    predicate_c = NULL; // Do not clone predicate below merge point
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   279
  }
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   280
  if (predicate_x != NULL && ((len - req_c) > 2)) {
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   281
    assert(predicate_c == NULL, "only one predicate entry expected");
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   282
    predicate_x = NULL; // Do not clone predicate below merge point
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   283
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
  // Register the new RegionNodes but do not transform them.  Cannot
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1217
diff changeset
   286
  // transform until the entire Region/Phi conglomerate has been hacked
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
  // as a single huge transform.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
  igvn->register_new_node_with_optimizer( region_c );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
  igvn->register_new_node_with_optimizer( region_x );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
  // Prevent the untimely death of phi_x.  Currently he has no uses.  He is
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
  // about to get one.  If this only use goes away, then phi_x will look dead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
  // However, he will be picking up some more uses down below.
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   293
  Node *hook = new Node(4);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
  hook->init_req(0, phi_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
  hook->init_req(1, phi_c);
4016
9c11d6d519f7 6889300: assert(i != k || is_new || i->outcnt() > 0, "don't return dead nodes")
kvn
parents: 3268
diff changeset
   296
  phi_x = phase->transform( phi_x );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
  // Make the compare
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
  Node *cmp_c = phase->makecon(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
  Node *cmp_x = cmp->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
  cmp_x->set_req(1,phi_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
  cmp_x->set_req(2,con2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   303
  cmp_x = phase->transform(cmp_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
  // Make the bool
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   305
  Node *b_c = phase->transform(new BoolNode(cmp_c,b->_test._test));
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   306
  Node *b_x = phase->transform(new BoolNode(cmp_x,b->_test._test));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
  // Make the IfNode
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   308
  IfNode *iff_c = new IfNode(region_c,b_c,iff->_prob,iff->_fcnt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
  igvn->set_type_bottom(iff_c);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
  igvn->_worklist.push(iff_c);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
  hook->init_req(2, iff_c);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   313
  IfNode *iff_x = new IfNode(region_x,b_x,iff->_prob, iff->_fcnt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
  igvn->set_type_bottom(iff_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
  igvn->_worklist.push(iff_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   316
  hook->init_req(3, iff_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
  // Make the true/false arms
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   319
  Node *iff_c_t = phase->transform(new IfTrueNode (iff_c));
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   320
  Node *iff_c_f = phase->transform(new IfFalseNode(iff_c));
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   321
  if (predicate_c != NULL) {
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   322
    assert(predicate_x == NULL, "only one predicate entry expected");
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   323
    // Clone loop predicates to each path
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9101
diff changeset
   324
    iff_c_t = igvn->clone_loop_predicates(predicate_c, iff_c_t, !counted_loop);
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9101
diff changeset
   325
    iff_c_f = igvn->clone_loop_predicates(predicate_c, iff_c_f, !counted_loop);
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   326
  }
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   327
  Node *iff_x_t = phase->transform(new IfTrueNode (iff_x));
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   328
  Node *iff_x_f = phase->transform(new IfFalseNode(iff_x));
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   329
  if (predicate_x != NULL) {
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   330
    assert(predicate_c == NULL, "only one predicate entry expected");
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   331
    // Clone loop predicates to each path
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9101
diff changeset
   332
    iff_x_t = igvn->clone_loop_predicates(predicate_x, iff_x_t, !counted_loop);
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9101
diff changeset
   333
    iff_x_f = igvn->clone_loop_predicates(predicate_x, iff_x_f, !counted_loop);
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   334
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
  // Merge the TRUE paths
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   337
  Node *region_s = new RegionNode(3);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
  igvn->_worklist.push(region_s);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   339
  region_s->init_req(1, iff_c_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
  region_s->init_req(2, iff_x_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   341
  igvn->register_new_node_with_optimizer( region_s );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   342
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
  // Merge the FALSE paths
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   344
  Node *region_f = new RegionNode(3);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
  igvn->_worklist.push(region_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
  region_f->init_req(1, iff_c_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
  region_f->init_req(2, iff_x_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
  igvn->register_new_node_with_optimizer( region_f );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
  igvn->hash_delete(cmp);// Remove soon-to-be-dead node from hash table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
  cmp->set_req(1,NULL);  // Whack the inputs to cmp because it will be dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
  cmp->set_req(2,NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
  // Check for all uses of the Phi and give them a new home.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
  // The 'cmp' got cloned, but CastPP/IIs need to be moved.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
  Node *phi_s = NULL;     // do not construct unless needed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
  Node *phi_f = NULL;     // do not construct unless needed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
  for (DUIterator_Last i2min, i2 = phi->last_outs(i2min); i2 >= i2min; --i2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
    Node* v = phi->last_out(i2);// User of the phi
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 10258
diff changeset
   359
    igvn->rehash_node_delayed(v); // Have to fixup other Phi users
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
    uint vop = v->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
    Node *proj = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
    if( vop == Op_Phi ) {       // Remote merge point
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
      Node *r = v->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   364
      for (uint i3 = 1; i3 < r->req(); i3++)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
        if (r->in(i3) && r->in(i3)->in(0) == iff) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
          proj = r->in(i3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
    } else if( v->is_ConstraintCast() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
      proj = v->in(0);          // Controlling projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
      assert( 0, "do not know how to handle this guy" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   374
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
    Node *proj_path_data, *proj_path_ctrl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
    if( proj->Opcode() == Op_IfTrue ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
      if( phi_s == NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
        // Only construct phi_s if needed, otherwise provides
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
        // interfering use.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   380
        phi_s = PhiNode::make_blank(region_s,phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
        phi_s->init_req( 1, phi_c );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
        phi_s->init_req( 2, phi_x );
4016
9c11d6d519f7 6889300: assert(i != k || is_new || i->outcnt() > 0, "don't return dead nodes")
kvn
parents: 3268
diff changeset
   383
        hook->add_req(phi_s);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
        phi_s = phase->transform(phi_s);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
      proj_path_data = phi_s;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   387
      proj_path_ctrl = region_s;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
      if( phi_f == NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
        // Only construct phi_f if needed, otherwise provides
489c9b5090e2 Initial load
duke
parents:
diff changeset
   391
        // interfering use.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
        phi_f = PhiNode::make_blank(region_f,phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
        phi_f->init_req( 1, phi_c );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
        phi_f->init_req( 2, phi_x );
4016
9c11d6d519f7 6889300: assert(i != k || is_new || i->outcnt() > 0, "don't return dead nodes")
kvn
parents: 3268
diff changeset
   395
        hook->add_req(phi_f);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   396
        phi_f = phase->transform(phi_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   398
      proj_path_data = phi_f;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
      proj_path_ctrl = region_f;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
    // Fixup 'v' for for the split
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
    if( vop == Op_Phi ) {       // Remote merge point
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
      uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
      for( i = 1; i < v->req(); i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
        if( v->in(i) == phi )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
      v->set_req(i, proj_path_data );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
    } else if( v->is_ConstraintCast() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
      v->set_req(0, proj_path_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
      v->set_req(1, proj_path_data );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
    } else
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
      ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
  // Now replace the original iff's True/False with region_s/region_t.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
  // This makes the original iff go dead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
  for (DUIterator_Last i3min, i3 = iff->last_outs(i3min); i3 >= i3min; --i3) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
    Node* p = iff->last_out(i3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   420
    assert( p->Opcode() == Op_IfTrue || p->Opcode() == Op_IfFalse, "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   421
    Node *u = (p->Opcode() == Op_IfTrue) ? region_s : region_f;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   422
    // Replace p with u
489c9b5090e2 Initial load
duke
parents:
diff changeset
   423
    igvn->add_users_to_worklist(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
    for (DUIterator_Last lmin, l = p->last_outs(lmin); l >= lmin;) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   425
      Node* x = p->last_out(l);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   426
      igvn->hash_delete(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   427
      uint uses_found = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   428
      for( uint j = 0; j < x->req(); j++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   429
        if( x->in(j) == p ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   430
          x->set_req(j, u);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
          uses_found++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   432
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   433
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
      l -= uses_found;    // we deleted 1 or more copies of this edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
    igvn->remove_dead_node(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
  // Force the original merge dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
  igvn->hash_delete(r);
3268
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   441
  // First, remove region's dead users.
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   442
  for (DUIterator_Last lmin, l = r->last_outs(lmin); l >= lmin;) {
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   443
    Node* u = r->last_out(l);
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   444
    if( u == r ) {
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   445
      r->set_req(0, NULL);
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   446
    } else {
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   447
      assert(u->outcnt() == 0, "only dead users");
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   448
      igvn->remove_dead_node(u);
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   449
    }
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   450
    l -= 1;
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   451
  }
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   452
  igvn->remove_dead_node(r);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
  // Now remove the bogus extra edges used to keep things alive
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
  igvn->remove_dead_node( hook );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
  // Must return either the original node (now dead) or a new node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
  // (Do not return a top here, since that would break the uniqueness of top.)
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   459
  return new ConINode(TypeInt::ZERO);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   462
// if this IfNode follows a range check pattern return the projection
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   463
// for the failed path
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   464
ProjNode* IfNode::range_check_trap_proj(int& flip_test, Node*& l, Node*& r) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
  Node* b = in(1);
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   466
  if (b == NULL || !b->is_Bool())  return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
  BoolNode* bn = b->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
  Node* cmp = bn->in(1);
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   469
  if (cmp == NULL)  return NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   470
  if (cmp->Opcode() != Op_CmpU)  return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   472
  l = cmp->in(1);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   473
  r = cmp->in(2);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   474
  flip_test = 1;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
  if (bn->_test._test == BoolTest::le) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
    l = cmp->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
    r = cmp->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
    flip_test = 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
  } else if (bn->_test._test != BoolTest::lt) {
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   480
    return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
  }
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   482
  if (l->is_top())  return NULL;   // Top input means dead test
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   483
  if (r->Opcode() != Op_LoadRange)  return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
  // We have recognized one of these forms:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
  //  Flip 1:  If (Bool[<] CmpU(l, LoadRange)) ...
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
  //  Flip 2:  If (Bool[<=] CmpU(LoadRange, l)) ...
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   489
  ProjNode* iftrap = proj_out(flip_test == 2 ? true : false);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   490
  return iftrap;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   491
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   492
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   493
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   494
//------------------------------is_range_check---------------------------------
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   495
// Return 0 if not a range check.  Return 1 if a range check and set index and
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   496
// offset.  Return 2 if we had to negate the test.  Index is NULL if the check
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   497
// is versus a constant.
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   498
int IfNode::is_range_check(Node* &range, Node* &index, jint &offset) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   499
  int flip_test = 0;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   500
  Node* l = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   501
  Node* r = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   502
  ProjNode* iftrap = range_check_trap_proj(flip_test, l, r);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   503
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   504
  if (iftrap == NULL) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   505
    return 0;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   506
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   507
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
  // Make sure it's a real range check by requiring an uncommon trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
  // along the OOB path.  Otherwise, it's possible that the user wrote
489c9b5090e2 Initial load
duke
parents:
diff changeset
   510
  // something which optimized to look like a range check but behaves
489c9b5090e2 Initial load
duke
parents:
diff changeset
   511
  // in some other way.
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   512
  if (iftrap->is_uncommon_trap_proj(Deoptimization::Reason_range_check) == NULL) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   513
    return 0;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   514
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
489c9b5090e2 Initial load
duke
parents:
diff changeset
   516
  // Look for index+offset form
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
  Node* ind = l;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
  jint  off = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
  if (l->is_top()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
    return 0;
26173
4275dfc46177 8054883: Segmentation error while running program
iveresov
parents: 24923
diff changeset
   521
  } else if (l->Opcode() == Op_AddI) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
    if ((off = l->in(1)->find_int_con(0)) != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
      ind = l->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
    } else if ((off = l->in(2)->find_int_con(0)) != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
      ind = l->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   526
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
  } else if ((off = l->find_int_con(-1)) >= 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
    // constant offset with no variable index
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
    ind = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
    // variable index with no constant offset (or dead negative index)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
    off = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
  // Return all the values:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
  index  = ind;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  offset = off;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
  range  = r;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
  return flip_test;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
//------------------------------adjust_check-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   543
// Adjust (widen) a prior range check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   544
static void adjust_check(Node* proj, Node* range, Node* index,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
                         int flip, jint off_lo, PhaseIterGVN* igvn) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
  PhaseGVN *gvn = igvn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
  // Break apart the old check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   548
  Node *iff = proj->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
  Node *bol = iff->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
  if( bol->is_top() ) return;   // In case a partially dead range check appears
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
  // bail (or bomb[ASSERT/DEBUG]) if NOT projection-->IfNode-->BoolNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
  DEBUG_ONLY( if( !bol->is_Bool() ) { proj->dump(3); fatal("Expect projection-->IfNode-->BoolNode"); } )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   553
  if( !bol->is_Bool() ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   554
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
  Node *cmp = bol->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
  // Compute a new check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   557
  Node *new_add = gvn->intcon(off_lo);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   558
  if( index ) {
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   559
    new_add = off_lo ? gvn->transform(new AddINode( index, new_add )) : index;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
  Node *new_cmp = (flip == 1)
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   562
    ? new CmpUNode( new_add, range )
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   563
    : new CmpUNode( range, new_add );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   564
  new_cmp = gvn->transform(new_cmp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   565
  // See if no need to adjust the existing check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
  if( new_cmp == cmp ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
  // Else, adjust existing check
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
   568
  Node *new_bol = gvn->transform( new BoolNode( new_cmp, bol->as_Bool()->_test._test ) );
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 10258
diff changeset
   569
  igvn->rehash_node_delayed( iff );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
  iff->set_req_X( 1, new_bol, igvn );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
//------------------------------up_one_dom-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   574
// Walk up the dominator tree one step.  Return NULL at root or true
489c9b5090e2 Initial load
duke
parents:
diff changeset
   575
// complex merges.  Skips through small diamonds.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   576
Node* IfNode::up_one_dom(Node *curr, bool linear_only) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
  Node *dom = curr->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   578
  if( !dom )                    // Found a Region degraded to a copy?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   579
    return curr->nonnull_req(); // Skip thru it
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
  if( curr != dom )             // Normal walk up one step?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
    return dom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   583
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
  // Use linear_only if we are still parsing, since we cannot
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
  // trust the regions to be fully filled in.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   586
  if (linear_only)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   587
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
4582
1a6662d11385 6915110: IfNode::up_one_dom moves beyond RootNode bug in src/share/vm/opto/ifnode.cpp
kvn
parents: 4020
diff changeset
   589
  if( dom->is_Root() )
1a6662d11385 6915110: IfNode::up_one_dom moves beyond RootNode bug in src/share/vm/opto/ifnode.cpp
kvn
parents: 4020
diff changeset
   590
    return NULL;
1a6662d11385 6915110: IfNode::up_one_dom moves beyond RootNode bug in src/share/vm/opto/ifnode.cpp
kvn
parents: 4020
diff changeset
   591
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
  // Else hit a Region.  Check for a loop header
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
  if( dom->is_Loop() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
    return dom->in(1);          // Skip up thru loops
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
  // Check for small diamonds
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
  Node *din1, *din2, *din3, *din4;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
  if( dom->req() == 3 &&        // 2-path merge point
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
      (din1 = dom ->in(1)) &&   // Left  path exists
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
      (din2 = dom ->in(2)) &&   // Right path exists
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
      (din3 = din1->in(0)) &&   // Left  path up one
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
      (din4 = din2->in(0)) ) {  // Right path up one
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
    if( din3->is_Call() &&      // Handle a slow-path call on either arm
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
        (din3 = din3->in(0)) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   605
      din3 = din3->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
    if( din4->is_Call() &&      // Handle a slow-path call on either arm
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
        (din4 = din4->in(0)) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
      din4 = din4->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   609
    if( din3 == din4 && din3->is_If() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   610
      return din3;              // Skip around diamonds
489c9b5090e2 Initial load
duke
parents:
diff changeset
   611
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   612
489c9b5090e2 Initial load
duke
parents:
diff changeset
   613
  // Give up the search at true merges
489c9b5090e2 Initial load
duke
parents:
diff changeset
   614
  return NULL;                  // Dead loop?  Or hit root?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   615
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   616
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   617
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   618
//------------------------------filtered_int_type--------------------------------
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   619
// Return a possibly more restrictive type for val based on condition control flow for an if
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   620
const TypeInt* IfNode::filtered_int_type(PhaseGVN* gvn, Node *val, Node* if_proj) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   621
  assert(if_proj &&
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   622
         (if_proj->Opcode() == Op_IfTrue || if_proj->Opcode() == Op_IfFalse), "expecting an if projection");
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   623
  if (if_proj->in(0) && if_proj->in(0)->is_If()) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   624
    IfNode* iff = if_proj->in(0)->as_If();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   625
    if (iff->in(1) && iff->in(1)->is_Bool()) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   626
      BoolNode* bol = iff->in(1)->as_Bool();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   627
      if (bol->in(1) && bol->in(1)->is_Cmp()) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   628
        const CmpNode* cmp  = bol->in(1)->as_Cmp();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   629
        if (cmp->in(1) == val) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   630
          const TypeInt* cmp2_t = gvn->type(cmp->in(2))->isa_int();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   631
          if (cmp2_t != NULL) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   632
            jint lo = cmp2_t->_lo;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   633
            jint hi = cmp2_t->_hi;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   634
            BoolTest::mask msk = if_proj->Opcode() == Op_IfTrue ? bol->_test._test : bol->_test.negate();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   635
            switch (msk) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   636
            case BoolTest::ne:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   637
              // Can't refine type
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   638
              return NULL;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   639
            case BoolTest::eq:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   640
              return cmp2_t;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   641
            case BoolTest::lt:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   642
              lo = TypeInt::INT->_lo;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   643
              if (hi - 1 < hi) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   644
                hi = hi - 1;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   645
              }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   646
              break;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   647
            case BoolTest::le:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   648
              lo = TypeInt::INT->_lo;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   649
              break;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   650
            case BoolTest::gt:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   651
              if (lo + 1 > lo) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   652
                lo = lo + 1;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   653
              }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   654
              hi = TypeInt::INT->_hi;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   655
              break;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   656
            case BoolTest::ge:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   657
              // lo unchanged
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   658
              hi = TypeInt::INT->_hi;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   659
              break;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   660
            }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   661
            const TypeInt* rtn_t = TypeInt::make(lo, hi, cmp2_t->_widen);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   662
            return rtn_t;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   663
          }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   664
        }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   665
      }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   666
    }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   667
  }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   668
  return NULL;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   669
}
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   670
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   671
//------------------------------fold_compares----------------------------
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   672
// See if a pair of CmpIs can be converted into a CmpU.  In some cases
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1217
diff changeset
   673
// the direction of this if is determined by the preceding if so it
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   674
// can be eliminate entirely.
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   675
//
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   676
// Given an if testing (CmpI n v) check for an immediately control
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   677
// dependent if that is testing (CmpI n v2) and has one projection
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   678
// leading to this if and the other projection leading to a region
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   679
// that merges one of this ifs control projections.
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   680
//
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   681
//                   If
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   682
//                  / |
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   683
//                 /  |
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   684
//                /   |
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   685
//              If    |
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   686
//              /\    |
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   687
//             /  \   |
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   688
//            /    \  |
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   689
//           /    Region
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   690
//
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   691
// Or given an if testing (CmpI n v) check for a dominating if that is
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   692
// testing (CmpI n v2), both having one projection leading to an
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   693
// uncommon trap. Allow Another independent guard in between to cover
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   694
// an explicit range check:
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   695
// if (index < 0 || index >= array.length) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   696
// which may need a null check to guard the LoadRange
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   697
//
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   698
//                   If
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   699
//                  / \
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   700
//                 /   \
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   701
//                /     \
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   702
//              If      unc
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   703
//              /\
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   704
//             /  \
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   705
//            /    \
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   706
//           /      unc
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   707
//
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   708
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   709
// Is the comparison for this If suitable for folding?
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   710
bool IfNode::cmpi_folds(PhaseIterGVN* igvn) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   711
  return in(1) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   712
    in(1)->is_Bool() &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   713
    in(1)->in(1) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   714
    in(1)->in(1)->Opcode() == Op_CmpI &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   715
    in(1)->in(1)->in(2) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   716
    in(1)->in(1)->in(2) != igvn->C->top() &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   717
    (in(1)->as_Bool()->_test.is_less() ||
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   718
     in(1)->as_Bool()->_test.is_greater());
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   719
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   720
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   721
// Is a dominating control suitable for folding with this if?
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   722
bool IfNode::is_ctrl_folds(Node* ctrl, PhaseIterGVN* igvn) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   723
  return ctrl != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   724
    ctrl->is_Proj() &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   725
    ctrl->in(0) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   726
    ctrl->in(0)->is_If() &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   727
    ctrl->in(0)->outcnt() == 2 &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   728
    ctrl->in(0)->as_If()->cmpi_folds(igvn) &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   729
    // Must compare same value
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   730
    ctrl->in(0)->in(1)->in(1)->in(1) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   731
    ctrl->in(0)->in(1)->in(1)->in(1) == in(1)->in(1)->in(1);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   732
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   733
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   734
// Do this If and the dominating If share a region?
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   735
bool IfNode::has_shared_region(ProjNode* proj, ProjNode*& success, ProjNode*& fail) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   736
  ProjNode* otherproj = proj->other_if_proj();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   737
  Node* otherproj_ctrl_use = otherproj->unique_ctrl_out();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   738
  RegionNode* region = (otherproj_ctrl_use != NULL && otherproj_ctrl_use->is_Region()) ? otherproj_ctrl_use->as_Region() : NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   739
  success = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   740
  fail = NULL;
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   741
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   742
  if (otherproj->outcnt() == 1 && region != NULL && !region->has_phi()) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   743
    for (int i = 0; i < 2; i++) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   744
      ProjNode* proj = proj_out(i);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   745
      if (success == NULL && proj->outcnt() == 1 && proj->unique_out() == region) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   746
        success = proj;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   747
      } else if (fail == NULL) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   748
        fail = proj;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   749
      } else {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   750
        success = fail = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   751
      }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   752
    }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   753
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   754
  return success != NULL && fail != NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   755
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   756
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   757
// Return projection that leads to an uncommon trap if any
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   758
ProjNode* IfNode::uncommon_trap_proj(CallStaticJavaNode*& call) const {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   759
  for (int i = 0; i < 2; i++) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   760
    call = proj_out(i)->is_uncommon_trap_proj(Deoptimization::Reason_none);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   761
    if (call != NULL) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   762
      return proj_out(i);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   763
    }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   764
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   765
  return NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   766
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   767
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   768
// Do this If and the dominating If both branch out to an uncommon trap
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   769
bool IfNode::has_only_uncommon_traps(ProjNode* proj, ProjNode*& success, ProjNode*& fail, PhaseIterGVN* igvn) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   770
  ProjNode* otherproj = proj->other_if_proj();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   771
  CallStaticJavaNode* dom_unc = otherproj->is_uncommon_trap_proj(Deoptimization::Reason_none);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   772
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   773
  if (otherproj->outcnt() == 1 && dom_unc != NULL) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   774
    CallStaticJavaNode* unc = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   775
    ProjNode* unc_proj = uncommon_trap_proj(unc);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   776
    if (unc_proj != NULL && unc_proj->outcnt() == 1) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   777
      if (dom_unc == unc) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   778
        // Allow the uncommon trap to be shared through a region
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   779
        RegionNode* r = unc->in(0)->as_Region();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   780
        if (r->outcnt() != 2 || r->req() != 3 || r->find_edge(otherproj) == -1 || r->find_edge(unc_proj) == -1) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   781
          return false;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   782
        }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   783
        assert(r->has_phi() == NULL, "simple region shouldn't have a phi");
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   784
      } else if (dom_unc->in(0) != otherproj || unc->in(0) != unc_proj) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   785
        return false;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   786
      }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   787
      // See merge_uncommon_traps: the reason of the uncommon trap
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   788
      // will be changed and the state of the dominating If will be
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   789
      // used. Checked that we didn't apply this transformation in a
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   790
      // previous compilation and it didn't cause too many traps
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   791
      if (!igvn->C->too_many_traps(dom_unc->jvms()->method(), dom_unc->jvms()->bci(), Deoptimization::Reason_unstable_fused_if) &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   792
          !igvn->C->too_many_traps(dom_unc->jvms()->method(), dom_unc->jvms()->bci(), Deoptimization::Reason_range_check)) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   793
        success = unc_proj;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   794
        fail = unc_proj->other_if_proj();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   795
        return true;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   796
      }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   797
    }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   798
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   799
  return false;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   800
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   801
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   802
// Check that the 2 CmpI can be folded into as single CmpU and proceed with the folding
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   803
bool IfNode::fold_compares_helper(ProjNode* proj, ProjNode* success, ProjNode* fail, PhaseIterGVN* igvn) {
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   804
  Node* this_cmp = in(1)->in(1);
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   805
  BoolNode* this_bool = in(1)->as_Bool();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   806
  IfNode* dom_iff = proj->in(0)->as_If();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   807
  BoolNode* dom_bool = dom_iff->in(1)->as_Bool();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   808
  Node* lo = dom_iff->in(1)->in(1)->in(2);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   809
  Node* hi = this_cmp->in(2);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   810
  Node* n = this_cmp->in(1);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   811
  ProjNode* otherproj = proj->other_if_proj();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   812
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   813
  const TypeInt* lo_type = IfNode::filtered_int_type(igvn, n, otherproj);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   814
  const TypeInt* hi_type = IfNode::filtered_int_type(igvn, n, success);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   815
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   816
  BoolTest::mask lo_test = dom_bool->_test._test;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   817
  BoolTest::mask hi_test = this_bool->_test._test;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   818
  BoolTest::mask cond = hi_test;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   819
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   820
  // Figure out which of the two tests sets the upper bound and which
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   821
  // sets the lower bound if any.
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   822
  if (hi_type->_lo > lo_type->_hi && hi_type->_hi == max_jint && lo_type->_lo == min_jint) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   823
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   824
    assert((dom_bool->_test.is_less() && !proj->_con) ||
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   825
           (dom_bool->_test.is_greater() && proj->_con), "incorrect test");
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   826
    // this test was canonicalized
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   827
    assert(this_bool->_test.is_less() && fail->_con, "incorrect test");
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   828
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   829
    if (lo_test == BoolTest::gt || lo_test == BoolTest::le) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   830
      lo = igvn->transform(new AddINode(lo, igvn->intcon(1)));
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   831
    }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   832
  } else if (lo_type->_lo > hi_type->_hi && lo_type->_hi == max_jint && hi_type->_lo == min_jint) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   833
    swap(lo, hi);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   834
    swap(lo_type, hi_type);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   835
    swap(lo_test, hi_test);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   836
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   837
    assert((this_bool->_test.is_less() && proj->_con) ||
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   838
           (this_bool->_test.is_greater() && !proj->_con), "incorrect test");
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   839
    // this test was canonicalized
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   840
    assert(dom_bool->_test.is_less() && !fail->_con, "incorrect test");
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   841
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   842
    cond = (hi_test == BoolTest::le || hi_test == BoolTest::gt) ? BoolTest::gt : BoolTest::ge;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   843
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   844
    if (lo_test == BoolTest::le) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   845
      lo = igvn->transform(new AddINode(lo, igvn->intcon(1)));
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   846
    }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   847
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   848
  } else {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   849
    const TypeInt* failtype  = filtered_int_type(igvn, n, proj);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   850
    if (failtype != NULL) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   851
      const TypeInt* type2 = filtered_int_type(igvn, n, fail);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   852
      if (type2 != NULL) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   853
        failtype = failtype->join(type2)->is_int();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   854
        if (failtype->_lo > failtype->_hi) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   855
          // previous if determines the result of this if so
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   856
          // replace Bool with constant
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   857
          igvn->hash_delete(this);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   858
          set_req(1, igvn->intcon(success->_con));
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   859
          return true;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   860
        }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   861
      }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   862
    }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   863
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   864
    lo = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   865
    hi = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   866
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   867
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   868
  if (lo && hi) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   869
    // Merge the two compares into a single unsigned compare by building (CmpU (n - lo) (hi - lo))
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   870
    Node* adjusted_val = igvn->transform(new SubINode(n,  lo));
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   871
    Node* adjusted_lim = igvn->transform(new SubINode(hi, lo));
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   872
    Node* newcmp = igvn->transform(new CmpUNode(adjusted_val, adjusted_lim));
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   873
    Node* newbool = igvn->transform(new BoolNode(newcmp, cond));
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   874
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   875
    igvn->is_IterGVN()->replace_input_of(dom_iff, 1, igvn->intcon(proj->_con));
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   876
    igvn->hash_delete(this);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   877
    set_req(1, newbool);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   878
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   879
    return true;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   880
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   881
  return false;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   882
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   883
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   884
// Merge the branches that trap for this If and the dominating If into
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   885
// a single region that branches to the uncommon trap for the
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   886
// dominating If
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   887
void IfNode::merge_uncommon_traps(ProjNode* proj, ProjNode* success, ProjNode* fail, PhaseIterGVN* igvn) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   888
  ProjNode* otherproj = proj->other_if_proj();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   889
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   890
  CallStaticJavaNode* unc = success->is_uncommon_trap_proj(Deoptimization::Reason_none);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   891
  CallStaticJavaNode* dom_unc = otherproj->is_uncommon_trap_proj(Deoptimization::Reason_none);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   892
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   893
  if (unc != dom_unc) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   894
    Node* r = new RegionNode(3);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   895
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   896
    r->set_req(1, otherproj);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   897
    r->set_req(2, success);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   898
    r = igvn->transform(r);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   899
    assert(r->is_Region(), "can't go away");
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   900
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   901
    // Make both If trap at the state of the first If: once the CmpI
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   902
    // nodes are merged, if we trap we don't know which of the CmpI
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   903
    // nodes would have caused the trap so we have to restart
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   904
    // execution at the first one
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   905
    igvn->replace_input_of(dom_unc, 0, r);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   906
    igvn->replace_input_of(unc, 0, igvn->C->top());
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   907
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   908
  int trap_request = dom_unc->uncommon_trap_request();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   909
  Deoptimization::DeoptReason reason = Deoptimization::trap_request_reason(trap_request);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   910
  Deoptimization::DeoptAction action = Deoptimization::trap_request_action(trap_request);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   911
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   912
  int flip_test = 0;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   913
  Node* l = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   914
  Node* r = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   915
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   916
  if (success->in(0)->as_If()->range_check_trap_proj(flip_test, l, r) != NULL) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   917
    // If this looks like a range check, change the trap to
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   918
    // Reason_range_check so the compiler recognizes it as a range
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   919
    // check and applies the corresponding optimizations
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   920
    trap_request = Deoptimization::make_trap_request(Deoptimization::Reason_range_check, action);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   921
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   922
    improve_address_types(l, r, fail, igvn);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   923
  } else if (unc != dom_unc) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   924
    // If we trap we won't know what CmpI would have caused the trap
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   925
    // so use a special trap reason to mark this pair of CmpI nodes as
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   926
    // bad candidate for folding. On recompilation we won't fold them
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   927
    // and we may trap again but this time we'll know what branch
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   928
    // traps
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   929
    trap_request = Deoptimization::make_trap_request(Deoptimization::Reason_unstable_fused_if, action);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   930
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   931
  igvn->replace_input_of(dom_unc, TypeFunc::Parms, igvn->intcon(trap_request));
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   932
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   933
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   934
// If we are turning 2 CmpI nodes into a CmpU that follows the pattern
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   935
// of a rangecheck on index i, on 64 bit the compares may be followed
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   936
// by memory accesses using i as index. In that case, the CmpU tells
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   937
// us something about the values taken by i that can help the compiler
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   938
// (see Compile::conv_I2X_index())
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   939
void IfNode::improve_address_types(Node* l, Node* r, ProjNode* fail, PhaseIterGVN* igvn) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   940
#ifdef _LP64
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   941
  ResourceMark rm;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   942
  Node_Stack stack(2);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   943
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   944
  assert(r->Opcode() == Op_LoadRange, "unexpected range check");
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   945
  const TypeInt* array_size = igvn->type(r)->is_int();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   946
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   947
  stack.push(l, 0);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   948
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   949
  while(stack.size() > 0) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   950
    Node* n = stack.node();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   951
    uint start = stack.index();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   952
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   953
    uint i = start;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   954
    for (; i < n->outcnt(); i++) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   955
      Node* use = n->raw_out(i);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   956
      if (stack.size() == 1) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   957
        if (use->Opcode() == Op_ConvI2L) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   958
          const TypeLong* bounds = use->as_Type()->type()->is_long();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   959
          if (bounds->_lo <= array_size->_lo && bounds->_hi >= array_size->_hi &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   960
              (bounds->_lo != array_size->_lo || bounds->_hi != array_size->_hi)) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   961
            stack.set_index(i+1);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   962
            stack.push(use, 0);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   963
            break;
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   964
          }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   965
        }
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   966
      } else if (use->is_Mem()) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   967
        Node* ctrl = use->in(0);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   968
        for (int i = 0; i < 10 && ctrl != NULL && ctrl != fail; i++) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   969
          ctrl = up_one_dom(ctrl);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   970
        }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   971
        if (ctrl == fail) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   972
          Node* init_n = stack.node_at(1);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   973
          assert(init_n->Opcode() == Op_ConvI2L, "unexpected first node");
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   974
          Node* new_n = igvn->C->conv_I2X_index(igvn, l, array_size);
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   975
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   976
          for (uint j = 2; j < stack.size(); j++) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   977
            Node* n = stack.node_at(j);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   978
            Node* clone = n->clone();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   979
            int rep = clone->replace_edge(init_n, new_n);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   980
            assert(rep > 0, "can't find expected node?");
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   981
            clone = igvn->transform(clone);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   982
            init_n = n;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   983
            new_n = clone;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   984
          }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   985
          igvn->hash_delete(use);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   986
          int rep = use->replace_edge(init_n, new_n);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   987
          assert(rep > 0, "can't find expected node?");
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   988
          igvn->transform(use);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   989
          if (init_n->outcnt() == 0) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   990
            igvn->_worklist.push(init_n);
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   991
          }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   992
        }
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   993
      } else if (use->in(0) == NULL && (igvn->type(use)->isa_long() ||
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   994
                                        igvn->type(use)->isa_ptr())) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   995
        stack.set_index(i+1);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   996
        stack.push(use, 0);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   997
        break;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   998
      }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
   999
    }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1000
    if (i == n->outcnt()) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1001
      stack.pop();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1002
    }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1003
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1004
#endif
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1005
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1006
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1007
bool IfNode::is_cmp_with_loadrange(ProjNode* proj) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1008
  if (in(1) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1009
      in(1)->in(1) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1010
      in(1)->in(1)->in(2) != NULL) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1011
    Node* other = in(1)->in(1)->in(2);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1012
    if (other->Opcode() == Op_LoadRange &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1013
        ((other->in(0) != NULL && other->in(0) == proj) ||
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1014
         (other->in(0) == NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1015
          other->in(2) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1016
          other->in(2)->is_AddP() &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1017
          other->in(2)->in(1) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1018
          other->in(2)->in(1)->Opcode() == Op_CastPP &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1019
          other->in(2)->in(1)->in(0) == proj))) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1020
      return true;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1021
    }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1022
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1023
  return false;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1024
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1025
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1026
bool IfNode::is_null_check(ProjNode* proj, PhaseIterGVN* igvn) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1027
  Node* other = in(1)->in(1)->in(2);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1028
  if (other->in(MemNode::Address) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1029
      proj->in(0)->in(1) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1030
      proj->in(0)->in(1)->is_Bool() &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1031
      proj->in(0)->in(1)->in(1) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1032
      proj->in(0)->in(1)->in(1)->Opcode() == Op_CmpP &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1033
      proj->in(0)->in(1)->in(1)->in(2) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1034
      proj->in(0)->in(1)->in(1)->in(1) == other->in(MemNode::Address)->in(AddPNode::Address)->uncast() &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1035
      igvn->type(proj->in(0)->in(1)->in(1)->in(2)) == TypePtr::NULL_PTR) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1036
    return true;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1037
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1038
  return false;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1039
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1040
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1041
// Check that the If that is in between the 2 integer comparisons has
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1042
// no side effect
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1043
bool IfNode::is_side_effect_free_test(ProjNode* proj, PhaseIterGVN* igvn) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1044
  if (proj != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1045
      proj->is_uncommon_trap_if_pattern(Deoptimization::Reason_none) &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1046
      proj->outcnt() <= 2) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1047
    if (proj->outcnt() == 1 ||
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1048
        // Allow simple null check from LoadRange
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1049
        (is_cmp_with_loadrange(proj) && is_null_check(proj, igvn))) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1050
      CallStaticJavaNode* unc = proj->is_uncommon_trap_if_pattern(Deoptimization::Reason_none);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1051
      CallStaticJavaNode* dom_unc = proj->in(0)->in(0)->as_Proj()->is_uncommon_trap_if_pattern(Deoptimization::Reason_none);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1052
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1053
      // reroute_side_effect_free_unc changes the state of this
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1054
      // uncommon trap to restart execution at the previous
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1055
      // CmpI. Check that this change in a previous compilation didn't
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1056
      // cause too many traps.
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1057
      int trap_request = unc->uncommon_trap_request();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1058
      Deoptimization::DeoptReason reason = Deoptimization::trap_request_reason(trap_request);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1059
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1060
      if (igvn->C->too_many_traps(dom_unc->jvms()->method(), dom_unc->jvms()->bci(), reason)) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1061
        return false;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1062
      }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1063
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1064
      return true;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1065
    }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1066
  }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1067
  return false;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1068
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1069
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1070
// Make the If between the 2 integer comparisons trap at the state of
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1071
// the first If: the last CmpI is the one replaced by a CmpU and the
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1072
// first CmpI is eliminated, so the test between the 2 CmpI nodes
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1073
// won't be guarded by the first CmpI anymore. It can trap in cases
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1074
// where the first CmpI would have prevented it from executing: on a
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1075
// trap, we need to restart execution at the state of the first CmpI
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1076
void IfNode::reroute_side_effect_free_unc(ProjNode* proj, ProjNode* dom_proj, PhaseIterGVN* igvn) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1077
  CallStaticJavaNode* dom_unc = dom_proj->is_uncommon_trap_if_pattern(Deoptimization::Reason_none);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1078
  ProjNode* otherproj = proj->other_if_proj();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1079
  CallStaticJavaNode* unc = proj->is_uncommon_trap_if_pattern(Deoptimization::Reason_none);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1080
  Node* call_proj = dom_unc->unique_ctrl_out();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1081
  Node* halt = call_proj->unique_ctrl_out();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1082
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1083
  Node* new_unc = dom_unc->clone();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1084
  call_proj = call_proj->clone();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1085
  halt = halt->clone();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1086
  Node* c = otherproj->clone();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1087
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1088
  c = igvn->transform(c);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1089
  new_unc->set_req(TypeFunc::Parms, unc->in(TypeFunc::Parms));
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1090
  new_unc->set_req(0, c);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1091
  new_unc = igvn->transform(new_unc);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1092
  call_proj->set_req(0, new_unc);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1093
  call_proj = igvn->transform(call_proj);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1094
  halt->set_req(0, call_proj);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1095
  halt = igvn->transform(halt);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1096
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1097
  igvn->replace_node(otherproj, igvn->C->top());
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1098
  igvn->C->root()->add_req(halt);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1099
}
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1100
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1101
Node* IfNode::fold_compares(PhaseIterGVN* igvn) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1102
  if (Opcode() != Op_If) return NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1103
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1104
  if (cmpi_folds(igvn)) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1105
    Node* ctrl = in(0);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1106
    if (is_ctrl_folds(ctrl, igvn) &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1107
        ctrl->outcnt() == 1) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1108
      // A integer comparison immediately dominated by another integer
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1109
      // comparison
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1110
      ProjNode* success = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1111
      ProjNode* fail = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1112
      ProjNode* dom_cmp = ctrl->as_Proj();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1113
      if (has_shared_region(dom_cmp, success, fail) &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1114
          // Next call modifies graph so must be last
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1115
          fold_compares_helper(dom_cmp, success, fail, igvn)) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1116
        return this;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1117
      }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1118
      if (has_only_uncommon_traps(dom_cmp, success, fail, igvn) &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1119
          // Next call modifies graph so must be last
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1120
          fold_compares_helper(dom_cmp, success, fail, igvn)) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1121
        merge_uncommon_traps(dom_cmp, success, fail, igvn);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1122
        return this;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1123
      }
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1124
      return NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1125
    } else if (ctrl->in(0) != NULL &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1126
               ctrl->in(0)->in(0) != NULL) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1127
      ProjNode* success = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1128
      ProjNode* fail = NULL;
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1129
      Node* dom = ctrl->in(0)->in(0);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1130
      ProjNode* dom_cmp = dom->isa_Proj();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1131
      ProjNode* other_cmp = ctrl->isa_Proj();
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1132
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1133
      // Check if it's an integer comparison dominated by another
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1134
      // integer comparison with another test in between
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1135
      if (is_ctrl_folds(dom, igvn) &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1136
          has_only_uncommon_traps(dom_cmp, success, fail, igvn) &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1137
          is_side_effect_free_test(other_cmp, igvn) &&
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1138
          // Next call modifies graph so must be last
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1139
          fold_compares_helper(dom_cmp, success, fail, igvn)) {
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1140
        reroute_side_effect_free_unc(other_cmp, dom_cmp, igvn);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1141
        merge_uncommon_traps(dom_cmp, success, fail, igvn);
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1142
        return this;
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
  1143
      }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
  1144
    }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
  1145
  }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
  1146
  return NULL;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
  1147
}
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
  1148
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1149
//------------------------------remove_useless_bool----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1150
// Check for people making a useless boolean: things like
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1151
// if( (x < y ? true : false) ) { ... }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1152
// Replace with if( x < y ) { ... }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1153
static Node *remove_useless_bool(IfNode *iff, PhaseGVN *phase) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1154
  Node *i1 = iff->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1155
  if( !i1->is_Bool() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1156
  BoolNode *bol = i1->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1157
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1158
  Node *cmp = bol->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1159
  if( cmp->Opcode() != Op_CmpI ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1160
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1161
  // Must be comparing against a bool
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1162
  const Type *cmp2_t = phase->type( cmp->in(2) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1163
  if( cmp2_t != TypeInt::ZERO &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1164
      cmp2_t != TypeInt::ONE )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1165
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1166
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1167
  // Find a prior merge point merging the boolean
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1168
  i1 = cmp->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1169
  if( !i1->is_Phi() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1170
  PhiNode *phi = i1->as_Phi();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1171
  if( phase->type( phi ) != TypeInt::BOOL )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1172
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1173
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1174
  // Check for diamond pattern
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1175
  int true_path = phi->is_diamond_phi();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1176
  if( true_path == 0 ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1177
958
4c4709e8b7ee 6712835: Server compiler fails with assertion (loop_count < K,"infinite loop in PhaseIterGVN::transform")
never
parents: 190
diff changeset
  1178
  // Make sure that iff and the control of the phi are different. This
4c4709e8b7ee 6712835: Server compiler fails with assertion (loop_count < K,"infinite loop in PhaseIterGVN::transform")
never
parents: 190
diff changeset
  1179
  // should really only happen for dead control flow since it requires
4c4709e8b7ee 6712835: Server compiler fails with assertion (loop_count < K,"infinite loop in PhaseIterGVN::transform")
never
parents: 190
diff changeset
  1180
  // an illegal cycle.
4c4709e8b7ee 6712835: Server compiler fails with assertion (loop_count < K,"infinite loop in PhaseIterGVN::transform")
never
parents: 190
diff changeset
  1181
  if (phi->in(0)->in(1)->in(0) == iff) return NULL;
4c4709e8b7ee 6712835: Server compiler fails with assertion (loop_count < K,"infinite loop in PhaseIterGVN::transform")
never
parents: 190
diff changeset
  1182
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1183
  // phi->region->if_proj->ifnode->bool->cmp
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1184
  BoolNode *bol2 = phi->in(0)->in(1)->in(0)->in(1)->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1185
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1186
  // Now get the 'sense' of the test correct so we can plug in
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1187
  // either iff2->in(1) or its complement.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1188
  int flip = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1189
  if( bol->_test._test == BoolTest::ne ) flip = 1-flip;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1190
  else if( bol->_test._test != BoolTest::eq ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1191
  if( cmp2_t == TypeInt::ZERO ) flip = 1-flip;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1192
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1193
  const Type *phi1_t = phase->type( phi->in(1) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1194
  const Type *phi2_t = phase->type( phi->in(2) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1195
  // Check for Phi(0,1) and flip
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1196
  if( phi1_t == TypeInt::ZERO ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1197
    if( phi2_t != TypeInt::ONE ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1198
    flip = 1-flip;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1199
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1200
    // Check for Phi(1,0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1201
    if( phi1_t != TypeInt::ONE  ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1202
    if( phi2_t != TypeInt::ZERO ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1203
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1204
  if( true_path == 2 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1205
    flip = 1-flip;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1206
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1207
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1208
  Node* new_bol = (flip ? phase->transform( bol2->negate(phase) ) : bol2);
958
4c4709e8b7ee 6712835: Server compiler fails with assertion (loop_count < K,"infinite loop in PhaseIterGVN::transform")
never
parents: 190
diff changeset
  1209
  assert(new_bol != iff->in(1), "must make progress");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1210
  iff->set_req(1, new_bol);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1211
  // Intervening diamond probably goes dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1212
  phase->C->set_major_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1213
  return iff;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1214
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1215
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1216
static IfNode* idealize_test(PhaseGVN* phase, IfNode* iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1217
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1218
struct RangeCheck {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1219
  Node* ctl;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1220
  jint off;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1221
};
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1222
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1223
//------------------------------Ideal------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1224
// Return a node which is more "ideal" than the current node.  Strip out
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1225
// control copies
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1226
Node *IfNode::Ideal(PhaseGVN *phase, bool can_reshape) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1227
  if (remove_dead_region(phase, can_reshape))  return this;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1228
  // No Def-Use info?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1229
  if (!can_reshape)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1230
  PhaseIterGVN *igvn = phase->is_IterGVN();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1231
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1232
  // Don't bother trying to transform a dead if
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1233
  if (in(0)->is_top())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1234
  // Don't bother trying to transform an if with a dead test
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1235
  if (in(1)->is_top())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1236
  // Another variation of a dead test
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1237
  if (in(1)->is_Con())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1238
  // Another variation of a dead if
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1239
  if (outcnt() < 2)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1240
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1241
  // Canonicalize the test.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1242
  Node* idt_if = idealize_test(phase, this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1243
  if (idt_if != NULL)  return idt_if;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1244
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1245
  // Try to split the IF
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1246
  Node *s = split_if(this, igvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1247
  if (s != NULL)  return s;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1248
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1249
  // Check for people making a useless boolean: things like
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1250
  // if( (x < y ? true : false) ) { ... }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1251
  // Replace with if( x < y ) { ... }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1252
  Node *bol2 = remove_useless_bool(this, phase);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1253
  if( bol2 ) return bol2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1254
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1255
  // Setup to scan up the CFG looking for a dominating test
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1256
  Node *dom = in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1257
  Node *prev_dom = this;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1258
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1259
  // Check for range-check vs other kinds of tests
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1260
  Node *index1, *range1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1261
  jint offset1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1262
  int flip1 = is_range_check(range1, index1, offset1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1263
  if( flip1 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1264
    // Try to remove extra range checks.  All 'up_one_dom' gives up at merges
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1265
    // so all checks we inspect post-dominate the top-most check we find.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1266
    // If we are going to fail the current check and we reach the top check
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1217
diff changeset
  1267
    // then we are guaranteed to fail, so just start interpreting there.
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1268
    // We 'expand' the top 3 range checks to include all post-dominating
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1269
    // checks.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1270
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1271
    // The top 3 range checks seen
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1272
    const int NRC =3;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1273
    RangeCheck prev_checks[NRC];
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1274
    int nb_checks = 0;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1275
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1276
    // Low and high offsets seen so far
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1277
    jint off_lo = offset1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1278
    jint off_hi = offset1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1279
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1280
    bool found_immediate_dominator = false;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1281
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1282
    // Scan for the top checks and collect range of offsets
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1283
    for (int dist = 0; dist < 999; dist++) { // Range-Check scan limit
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1284
      if (dom->Opcode() == Op_If &&  // Not same opcode?
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1285
          prev_dom->in(0) == dom) { // One path of test does dominate?
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1286
        if (dom == this) return NULL; // dead loop
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1287
        // See if this is a range check
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1288
        Node *index2, *range2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1289
        jint offset2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1290
        int flip2 = dom->as_If()->is_range_check(range2, index2, offset2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1291
        // See if this is a _matching_ range check, checking against
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1292
        // the same array bounds.
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1293
        if (flip2 == flip1 && range2 == range1 && index2 == index1 &&
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1294
            dom->outcnt() == 2) {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1295
          if (nb_checks == 0 && dom->in(1) == in(1)) {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1296
            // Found an immediately dominating test at the same offset.
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1297
            // This kind of back-to-back test can be eliminated locally,
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1298
            // and there is no need to search further for dominating tests.
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1299
            assert(offset2 == offset1, "Same test but different offsets");
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1300
            found_immediate_dominator = true;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1301
            break;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1302
          }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1303
          // Gather expanded bounds
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1304
          off_lo = MIN2(off_lo,offset2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1305
          off_hi = MAX2(off_hi,offset2);
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1306
          // Record top NRC range checks
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1307
          prev_checks[nb_checks%NRC].ctl = prev_dom;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1308
          prev_checks[nb_checks%NRC].off = offset2;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1309
          nb_checks++;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1310
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1311
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1312
      prev_dom = dom;
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1313
      dom = up_one_dom(dom);
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1314
      if (!dom) break;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1315
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1316
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1317
    if (!found_immediate_dominator) {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1318
      // Attempt to widen the dominating range check to cover some later
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1319
      // ones.  Since range checks "fail" by uncommon-trapping to the
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1320
      // interpreter, widening a check can make us speculatively enter
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1321
      // the interpreter.  If we see range-check deopt's, do not widen!
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1322
      if (!phase->C->allow_range_check_smearing())  return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1323
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1324
      // Didn't find prior covering check, so cannot remove anything.
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1325
      if (nb_checks == 0) {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1326
        return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1327
      }
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1328
      // Constant indices only need to check the upper bound.
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1329
      // Non-constant indices must check both low and high.
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1330
      int chk0 = (nb_checks - 1) % NRC;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1331
      if (index1) {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1332
        if (nb_checks == 1) {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1333
          return NULL;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1334
        } else {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1335
          // If the top range check's constant is the min or max of
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1336
          // all constants we widen the next one to cover the whole
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1337
          // range of constants.
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1338
          RangeCheck rc0 = prev_checks[chk0];
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1339
          int chk1 = (nb_checks - 2) % NRC;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1340
          RangeCheck rc1 = prev_checks[chk1];
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1341
          if (rc0.off == off_lo) {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1342
            adjust_check(rc1.ctl, range1, index1, flip1, off_hi, igvn);
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1343
            prev_dom = rc1.ctl;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1344
          } else if (rc0.off == off_hi) {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1345
            adjust_check(rc1.ctl, range1, index1, flip1, off_lo, igvn);
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1346
            prev_dom = rc1.ctl;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1347
          } else {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1348
            // If the top test's constant is not the min or max of all
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1349
            // constants, we need 3 range checks. We must leave the
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1350
            // top test unchanged because widening it would allow the
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1351
            // accesses it protects to successfully read/write out of
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1352
            // bounds.
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1353
            if (nb_checks == 2) {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1354
              return NULL;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1355
            }
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1356
            int chk2 = (nb_checks - 3) % NRC;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1357
            RangeCheck rc2 = prev_checks[chk2];
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1358
            // The top range check a+i covers interval: -a <= i < length-a
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1359
            // The second range check b+i covers interval: -b <= i < length-b
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1360
            if (rc1.off <= rc0.off) {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1361
              // if b <= a, we change the second range check to:
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1362
              // -min_of_all_constants <= i < length-min_of_all_constants
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1363
              // Together top and second range checks now cover:
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1364
              // -min_of_all_constants <= i < length-a
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1365
              // which is more restrictive than -b <= i < length-b:
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1366
              // -b <= -min_of_all_constants <= i < length-a <= length-b
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1367
              // The third check is then changed to:
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1368
              // -max_of_all_constants <= i < length-max_of_all_constants
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1369
              // so 2nd and 3rd checks restrict allowed values of i to:
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1370
              // -min_of_all_constants <= i < length-max_of_all_constants
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1371
              adjust_check(rc1.ctl, range1, index1, flip1, off_lo, igvn);
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1372
              adjust_check(rc2.ctl, range1, index1, flip1, off_hi, igvn);
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1373
            } else {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1374
              // if b > a, we change the second range check to:
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1375
              // -max_of_all_constants <= i < length-max_of_all_constants
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1376
              // Together top and second range checks now cover:
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1377
              // -a <= i < length-max_of_all_constants
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1378
              // which is more restrictive than -b <= i < length-b:
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1379
              // -b < -a <= i < length-max_of_all_constants <= length-b
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1380
              // The third check is then changed to:
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1381
              // -max_of_all_constants <= i < length-max_of_all_constants
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1382
              // so 2nd and 3rd checks restrict allowed values of i to:
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1383
              // -min_of_all_constants <= i < length-max_of_all_constants
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1384
              adjust_check(rc1.ctl, range1, index1, flip1, off_hi, igvn);
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1385
              adjust_check(rc2.ctl, range1, index1, flip1, off_lo, igvn);
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1386
            }
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1387
            prev_dom = rc2.ctl;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1388
          }
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1389
        }
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1390
      } else {
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1391
        RangeCheck rc0 = prev_checks[chk0];
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1392
        // 'Widen' the offset of the 1st and only covering check
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1393
        adjust_check(rc0.ctl, range1, index1, flip1, off_hi, igvn);
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1394
        // Test is now covered by prior checks, dominate it out
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1395
        prev_dom = rc0.ctl;
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1396
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1397
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1398
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1399
  } else {                      // Scan for an equivalent test
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1400
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1401
    Node *cmp;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1402
    int dist = 0;               // Cutoff limit for search
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1403
    int op = Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1404
    if( op == Op_If &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1405
        (cmp=in(1)->in(1))->Opcode() == Op_CmpP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1406
      if( cmp->in(2) != NULL && // make sure cmp is not already dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1407
          cmp->in(2)->bottom_type() == TypePtr::NULL_PTR ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1408
        dist = 64;              // Limit for null-pointer scans
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1409
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1410
        dist = 4;               // Do not bother for random pointer tests
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1411
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1412
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1413
      dist = 4;                 // Limit for random junky scans
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1414
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1415
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1416
    // Normal equivalent-test check.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1417
    if( !dom ) return NULL;     // Dead loop?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1418
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1419
    Node* result = fold_compares(igvn);
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
  1420
    if (result != NULL) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
  1421
      return result;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
  1422
    }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
  1423
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1424
    // Search up the dominator tree for an If with an identical test
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1425
    while( dom->Opcode() != op    ||  // Not same opcode?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1426
           dom->in(1)    != in(1) ||  // Not same input 1?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1427
           (req() == 3 && dom->in(2) != in(2)) || // Not same input 2?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1428
           prev_dom->in(0) != dom ) { // One path of test does not dominate?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1429
      if( dist < 0 ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1430
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1431
      dist--;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1432
      prev_dom = dom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1433
      dom = up_one_dom( dom );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1434
      if( !dom ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1435
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1436
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1437
    // Check that we did not follow a loop back to ourselves
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1438
    if( this == dom )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1439
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1440
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1441
    if( dist > 2 )              // Add to count of NULL checks elided
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1442
      explicit_null_checks_elided++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1443
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1444
  } // End of Else scan for an equivalent test
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1445
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1446
  // Hit!  Remove this IF
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1447
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1448
  if( TraceIterativeGVN ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1449
    tty->print("   Removing IfNode: "); this->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1450
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1451
  if( VerifyOpto && !phase->allow_progress() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1452
    // Found an equivalent dominating test,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1453
    // we can not guarantee reaching a fix-point for these during iterativeGVN
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1454
    // since intervening nodes may not change.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1455
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1456
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1457
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1458
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1459
  // Replace dominated IfNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1460
  dominated_by( prev_dom, igvn );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1461
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1462
  // Must return either the original node (now dead) or a new node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1463
  // (Do not return a top here, since that would break the uniqueness of top.)
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
  1464
  return new ConINode(TypeInt::ZERO);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1465
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1466
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1467
//------------------------------dominated_by-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1468
void IfNode::dominated_by( Node *prev_dom, PhaseIterGVN *igvn ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1469
  igvn->hash_delete(this);      // Remove self to prevent spurious V-N
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1470
  Node *idom = in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1471
  // Need opcode to decide which way 'this' test goes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1472
  int prev_op = prev_dom->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1473
  Node *top = igvn->C->top(); // Shortcut to top
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1474
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1475
  // Loop predicates may have depending checks which should not
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1476
  // be skipped. For example, range check predicate has two checks
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1477
  // for lower and upper bounds.
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1478
  ProjNode* unc_proj = proj_out(1 - prev_dom->as_Proj()->_con)->as_Proj();
30183
a6588c0a3259 8073480: C2 should optimize explicit range checks
roland
parents: 28927
diff changeset
  1479
  if (unc_proj->is_uncommon_trap_proj(Deoptimization::Reason_predicate) != NULL)
28044
ede40159fd3b 8066103: C2's range check smearing allows out of bound array accesses
roland
parents: 26173
diff changeset
  1480
   prev_dom = idom;
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1481
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1482
  // Now walk the current IfNode's projections.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1483
  // Loop ends when 'this' has no more uses.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1484
  for (DUIterator_Last imin, i = last_outs(imin); i >= imin; --i) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1485
    Node *ifp = last_out(i);     // Get IfTrue/IfFalse
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1486
    igvn->add_users_to_worklist(ifp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1487
    // Check which projection it is and set target.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1488
    // Data-target is either the dominating projection of the same type
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1489
    // or TOP if the dominating projection is of opposite type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1490
    // Data-target will be used as the new control edge for the non-CFG
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1491
    // nodes like Casts and Loads.
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1492
    Node *data_target = (ifp->Opcode() == prev_op) ? prev_dom : top;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1493
    // Control-target is just the If's immediate dominator or TOP.
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1494
    Node *ctrl_target = (ifp->Opcode() == prev_op) ?     idom : top;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1495
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1496
    // For each child of an IfTrue/IfFalse projection, reroute.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1497
    // Loop ends when projection has no more uses.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1498
    for (DUIterator_Last jmin, j = ifp->last_outs(jmin); j >= jmin; --j) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1499
      Node* s = ifp->last_out(j);   // Get child of IfTrue/IfFalse
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1500
      if( !s->depends_only_on_test() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1501
        // Find the control input matching this def-use edge.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1502
        // For Regions it may not be in slot 0.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1503
        uint l;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1504
        for( l = 0; s->in(l) != ifp; l++ ) { }
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 10258
diff changeset
  1505
        igvn->replace_input_of(s, l, ctrl_target);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1506
      } else {                      // Else, for control producers,
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 10258
diff changeset
  1507
        igvn->replace_input_of(s, 0, data_target); // Move child to data-target
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1508
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1509
    } // End for each child of a projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1510
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1511
    igvn->remove_dead_node(ifp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1512
  } // End for each IfTrue/IfFalse child of If
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1513
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1514
  // Kill the IfNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1515
  igvn->remove_dead_node(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1516
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1517
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1518
//------------------------------Identity---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1519
// If the test is constant & we match, then we are the input Control
28486
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1520
Node *IfProjNode::Identity(PhaseTransform *phase) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1521
  // Can only optimize if cannot go the other way
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1522
  const TypeTuple *t = phase->type(in(0))->is_tuple();
28486
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1523
  if (t == TypeTuple::IFNEITHER ||
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1524
      // kill dead branch first otherwise the IfNode's control will
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1525
      // have 2 control uses (the IfNode that doesn't go away because
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1526
      // it still has uses and this branch of the
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1527
      // If). Node::has_special_unique_user() will cause this node to
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1528
      // be reprocessed once the dead branch is killed.
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1529
      (always_taken(t) && in(0)->outcnt() == 1)) {
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1530
    // IfNode control
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1531
    return in(0)->in(0);
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1532
  }
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1533
  // no progress
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 28044
diff changeset
  1534
  return this;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1535
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1536
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1537
//------------------------------dump_spec--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1538
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1539
void IfNode::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1540
  st->print("P=%f, C=%f",_prob,_fcnt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1541
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1542
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1543
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1544
//------------------------------idealize_test----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1545
// Try to canonicalize tests better.  Peek at the Cmp/Bool/If sequence and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1546
// come up with a canonical sequence.  Bools getting 'eq', 'gt' and 'ge' forms
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1547
// converted to 'ne', 'le' and 'lt' forms.  IfTrue/IfFalse get swapped as
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1548
// needed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1549
static IfNode* idealize_test(PhaseGVN* phase, IfNode* iff) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1550
  assert(iff->in(0) != NULL, "If must be live");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1551
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1552
  if (iff->outcnt() != 2)  return NULL; // Malformed projections.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1553
  Node* old_if_f = iff->proj_out(false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1554
  Node* old_if_t = iff->proj_out(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1555
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1556
  // CountedLoopEnds want the back-control test to be TRUE, irregardless of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1557
  // whether they are testing a 'gt' or 'lt' condition.  The 'gt' condition
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1558
  // happens in count-down loops
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1559
  if (iff->is_CountedLoopEnd())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1560
  if (!iff->in(1)->is_Bool())  return NULL; // Happens for partially optimized IF tests
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1561
  BoolNode *b = iff->in(1)->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1562
  BoolTest bt = b->_test;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1563
  // Test already in good order?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1564
  if( bt.is_canonical() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1565
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1566
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1567
  // Flip test to be canonical.  Requires flipping the IfFalse/IfTrue and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1568
  // cloning the IfNode.
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
  1569
  Node* new_b = phase->transform( new BoolNode(b->in(1), bt.negate()) );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1570
  if( !new_b->is_Bool() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1571
  b = new_b->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1572
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1573
  PhaseIterGVN *igvn = phase->is_IterGVN();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1574
  assert( igvn, "Test is not canonical in parser?" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1575
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1576
  // The IF node never really changes, but it needs to be cloned
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
  1577
  iff = new IfNode( iff->in(0), b, 1.0-iff->_prob, iff->_fcnt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1578
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1579
  Node *prior = igvn->hash_find_insert(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1580
  if( prior ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1581
    igvn->remove_dead_node(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1582
    iff = (IfNode*)prior;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1583
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1584
    // Cannot call transform on it just yet
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1585
    igvn->set_type_bottom(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1586
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1587
  igvn->_worklist.push(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1588
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1589
  // Now handle projections.  Cloning not required.
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
  1590
  Node* new_if_f = (Node*)(new IfFalseNode( iff ));
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
  1591
  Node* new_if_t = (Node*)(new IfTrueNode ( iff ));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1592
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1593
  igvn->register_new_node_with_optimizer(new_if_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1594
  igvn->register_new_node_with_optimizer(new_if_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1595
  // Flip test, so flip trailing control
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
  1596
  igvn->replace_node(old_if_f, new_if_t);
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
  1597
  igvn->replace_node(old_if_t, new_if_f);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1598
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1599
  // Progress
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1600
  return iff;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1601
}