hotspot/src/share/vm/opto/ifnode.cpp
author kvn
Fri, 16 May 2014 12:05:14 -0700
changeset 24479 20eb4c752fb5
parent 22911 ff49c48c887d
child 24923 9631f7d691dc
permissions -rw-r--r--
8042786: Proper fix for 8032566 Summary: Check for overflow cases in range checks and collapse it if we can. Reviewed-by: jrose, iveresov
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"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    28
#include "opto/cfgnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    29
#include "opto/connode.hpp"
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
    30
#include "opto/loopnode.hpp"
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    31
#include "opto/phaseX.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    32
#include "opto/runtime.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    33
#include "opto/subnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5901
diff changeset
    34
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
// Portions of code courtesy of Clifford Click
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
// Optimization - Graph Style
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
extern int explicit_null_checks_elided;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
//------------------------------Value------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
// Return a tuple for whichever arm of the IF is reachable
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
const Type *IfNode::Value( PhaseTransform *phase ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
  if( !in(0) ) return Type::TOP;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
  if( phase->type(in(0)) == Type::TOP )
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
    return Type::TOP;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
  const Type *t = phase->type(in(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
  if( t == Type::TOP )          // data is undefined
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
    return TypeTuple::IFNEITHER; // unreachable altogether
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
  if( t == TypeInt::ZERO )      // zero, or false
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
    return TypeTuple::IFFALSE;  // only false branch is reachable
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
  if( t == TypeInt::ONE )       // 1, or true
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
    return TypeTuple::IFTRUE;   // only true branch is reachable
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
  assert( t == TypeInt::BOOL, "expected boolean type" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
  return TypeTuple::IFBOTH;     // No progress
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
const RegMask &IfNode::out_RegMask() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
  return RegMask::Empty;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
//------------------------------split_if---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
// Look for places where we merge constants, then test on the merged value.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
// If the IF test will be constant folded on the path with the constant, we
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
// win by splitting the IF to before the merge point.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
static Node* split_if(IfNode *iff, PhaseIterGVN *igvn) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
  // I could be a lot more general here, but I'm trying to squeeze this
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
  // in before the Christmas '98 break so I'm gonna be kinda restrictive
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
  // on the patterns I accept.  CNC
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
  // Look for a compare of a constant and a merged value
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
  Node *i1 = iff->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
  if( !i1->is_Bool() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
  BoolNode *b = i1->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
  Node *cmp = b->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
  if( !cmp->is_Cmp() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
  i1 = cmp->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
  if( i1 == NULL || !i1->is_Phi() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
  PhiNode *phi = i1->as_Phi();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
  if( phi->is_copy() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
  Node *con2 = cmp->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
  if( !con2->is_Con() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
  // See that the merge point contains some constants
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
  Node *con1=NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
  uint i4;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
  for( i4 = 1; i4 < phi->req(); i4++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
    con1 = phi->in(i4);
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1217
diff changeset
    91
    if( !con1 ) return NULL;    // Do not optimize partially collapsed merges
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
    if( con1->is_Con() ) break; // Found a constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
    // Also allow null-vs-not-null checks
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
    const TypePtr *tp = igvn->type(con1)->isa_ptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
    if( tp && tp->_ptr == TypePtr::NotNull )
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
  if( i4 >= phi->req() ) return NULL; // Found no constants
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
  igvn->C->set_has_split_ifs(true); // Has chance for split-if
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
  // Make sure that the compare can be constant folded away
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
  Node *cmp2 = cmp->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
  cmp2->set_req(1,con1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
  cmp2->set_req(2,con2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
  const Type *t = cmp2->Value(igvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
  // This compare is dead, so whack it!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
  igvn->remove_dead_node(cmp2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
  if( !t->singleton() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
  // No intervening control, like a simple Call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
  Node *r = iff->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
  if( !r->is_Region() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
  if( phi->region() != r ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
  // No other users of the cmp/bool
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
  if (b->outcnt() != 1 || cmp->outcnt() != 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
    //tty->print_cr("many users of cmp/bool");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
  // Make sure we can determine where all the uses of merged values go
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
  for (DUIterator_Fast jmax, j = r->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
    Node* u = r->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
    if( u == r ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
    if( u == iff ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
    if( u->outcnt() == 0 ) continue; // use is dead & ignorable
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
    if( !u->is_Phi() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
      /*
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
      if( u->is_Start() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
        tty->print_cr("Region has inlined start use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
        tty->print_cr("Region has odd use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
        u->dump(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
      }*/
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
    if( u != phi ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
      // CNC - do not allow any other merged value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
      //tty->print_cr("Merging another value");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
      //u->dump(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
    // Make sure we can account for all Phi uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
    for (DUIterator_Fast kmax, k = u->fast_outs(kmax); k < kmax; k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
      Node* v = u->fast_out(k); // User of the phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
      // CNC - Allow only really simple patterns.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
      // In particular I disallow AddP of the Phi, a fairly common pattern
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
      if( v == cmp ) continue;  // The compare is OK
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
      if( (v->is_ConstraintCast()) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
          v->in(0)->in(0) == iff )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
        continue;               // CastPP/II of the IfNode is OK
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
      // Disabled following code because I cannot tell if exactly one
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
      // path dominates without a real dominator check. CNC 9/9/1999
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
      //uint vop = v->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
      //if( vop == Op_Phi ) {     // Phi from another merge point might be OK
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
      //  Node *r = v->in(0);     // Get controlling point
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
      //  if( !r ) return NULL;   // Degraded to a copy
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
      //  // Find exactly one path in (either True or False doms, but not IFF)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
      //  int cnt = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
      //  for( uint i = 1; i < r->req(); i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
      //    if( r->in(i) && r->in(i)->in(0) == iff )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
      //      cnt++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
      //  if( cnt == 1 ) continue; // Exactly one of True or False guards Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
      //}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
      if( !v->is_Call() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
        /*
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
        if( v->Opcode() == Op_AddP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
          tty->print_cr("Phi has AddP use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
        } else if( v->Opcode() == Op_CastPP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
          tty->print_cr("Phi has CastPP use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
        } else if( v->Opcode() == Op_CastII ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
          tty->print_cr("Phi has CastII use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
        } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
          tty->print_cr("Phi has use I cant be bothered with");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
        */
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   178
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   179
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
      /* CNC - Cut out all the fancy acceptance tests
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
      // Can we clone this use when doing the transformation?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
      // If all uses are from Phis at this merge or constants, then YES.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
      if( !v->in(0) && v != cmp ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
        tty->print_cr("Phi has free-floating use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
        v->dump(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
        return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
      for( uint l = 1; l < v->req(); l++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
        if( (!v->in(l)->is_Phi() || v->in(l)->in(0) != r) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
            !v->in(l)->is_Con() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
          tty->print_cr("Phi has use");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
          v->dump(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
          return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
        } // End of if Phi-use input is neither Phi nor Constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
      } // End of for all inputs to Phi-use
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
      */
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
    } // End of for all uses of Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
  } // End of for all uses of Region
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
  // Only do this if the IF node is in a sane state
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
  if (iff->outcnt() != 2)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
  // Got a hit!  Do the Mondo Hack!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
  //ABC  a1c   def   ghi            B     1     e     h   A C   a c   d f   g i
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
  // R - Phi - Phi - Phi            Rc - Phi - Phi - Phi   Rx - Phi - Phi - Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
  //     cmp - 2                         cmp - 2               cmp - 2
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
  //       bool                            bool_c                bool_x
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
  //       if                               if_c                  if_x
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
  //      T  F                              T  F                  T  F
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
  // ..s..    ..t ..                   ..s..    ..t..        ..s..    ..t..
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
  //
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1217
diff changeset
   214
  // Split the paths coming into the merge point into 2 separate groups of
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
  // merges.  On the left will be all the paths feeding constants into the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
  // Cmp's Phi.  On the right will be the remaining paths.  The Cmp's Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
  // will fold up into a constant; this will let the Cmp fold up as well as
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
  // all the control flow.  Below the original IF we have 2 control
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
  // dependent regions, 's' and 't'.  Now we will merge the two paths
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
  // just prior to 's' and 't' from the two IFs.  At least 1 path (and quite
489c9b5090e2 Initial load
duke
parents:
diff changeset
   221
  // likely 2 or more) will promptly constant fold away.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
  PhaseGVN *phase = igvn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
  // Make a region merging constants and a region merging the rest
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
  uint req_c = 0;
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   226
  Node* predicate_proj = NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
  for (uint ii = 1; ii < r->req(); ii++) {
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   228
    if (phi->in(ii) == con1) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
      req_c++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
    }
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   231
    Node* proj = PhaseIdealLoop::find_predicate(r->in(ii));
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   232
    if (proj != NULL) {
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   233
      assert(predicate_proj == NULL, "only one predicate entry expected");
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   234
      predicate_proj = proj;
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   235
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
  }
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   237
  Node* predicate_c = NULL;
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   238
  Node* predicate_x = NULL;
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9101
diff changeset
   239
  bool counted_loop = r->is_CountedLoop();
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   240
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   241
  Node *region_c = new (igvn->C) RegionNode(req_c + 1);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   242
  Node *phi_c    = con1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   243
  uint  len      = r->req();
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   244
  Node *region_x = new (igvn->C) RegionNode(len - req_c);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
  Node *phi_x    = PhiNode::make_blank(region_x, phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   246
  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
   247
    if (phi->in(i) == con1) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   248
      region_c->init_req( i_c++, r  ->in(i) );
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   249
      if (r->in(i) == predicate_proj)
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   250
        predicate_c = predicate_proj;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   252
      region_x->init_req( i_x,   r  ->in(i) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   253
      phi_x   ->init_req( i_x++, phi->in(i) );
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   254
      if (r->in(i) == predicate_proj)
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   255
        predicate_x = predicate_proj;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
  }
10258
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   258
  if (predicate_c != NULL && (req_c > 1)) {
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   259
    assert(predicate_x == NULL, "only one predicate entry expected");
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   260
    predicate_c = NULL; // Do not clone predicate below merge point
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   261
  }
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   262
  if (predicate_x != NULL && ((len - req_c) > 2)) {
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   263
    assert(predicate_c == NULL, "only one predicate entry expected");
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   264
    predicate_x = NULL; // Do not clone predicate below merge point
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   265
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
  // Register the new RegionNodes but do not transform them.  Cannot
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1217
diff changeset
   268
  // transform until the entire Region/Phi conglomerate has been hacked
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
  // as a single huge transform.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
  igvn->register_new_node_with_optimizer( region_c );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
  igvn->register_new_node_with_optimizer( region_x );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
  // Prevent the untimely death of phi_x.  Currently he has no uses.  He is
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
  // about to get one.  If this only use goes away, then phi_x will look dead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
  // However, he will be picking up some more uses down below.
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   275
  Node *hook = new (igvn->C) Node(4);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
  hook->init_req(0, phi_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
  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
   278
  phi_x = phase->transform( phi_x );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
  // Make the compare
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
  Node *cmp_c = phase->makecon(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
  Node *cmp_x = cmp->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
  cmp_x->set_req(1,phi_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
  cmp_x->set_req(2,con2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
  cmp_x = phase->transform(cmp_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
  // Make the bool
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   287
  Node *b_c = phase->transform(new (igvn->C) BoolNode(cmp_c,b->_test._test));
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   288
  Node *b_x = phase->transform(new (igvn->C) BoolNode(cmp_x,b->_test._test));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
  // Make the IfNode
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   290
  IfNode *iff_c = new (igvn->C) IfNode(region_c,b_c,iff->_prob,iff->_fcnt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
  igvn->set_type_bottom(iff_c);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
  igvn->_worklist.push(iff_c);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
  hook->init_req(2, iff_c);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   295
  IfNode *iff_x = new (igvn->C) IfNode(region_x,b_x,iff->_prob, iff->_fcnt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
  igvn->set_type_bottom(iff_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
  igvn->_worklist.push(iff_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
  hook->init_req(3, iff_x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
  // Make the true/false arms
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   301
  Node *iff_c_t = phase->transform(new (igvn->C) IfTrueNode (iff_c));
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   302
  Node *iff_c_f = phase->transform(new (igvn->C) IfFalseNode(iff_c));
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   303
  if (predicate_c != NULL) {
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   304
    assert(predicate_x == NULL, "only one predicate entry expected");
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   305
    // Clone loop predicates to each path
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9101
diff changeset
   306
    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
   307
    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
   308
  }
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   309
  Node *iff_x_t = phase->transform(new (igvn->C) IfTrueNode (iff_x));
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   310
  Node *iff_x_f = phase->transform(new (igvn->C) IfFalseNode(iff_x));
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   311
  if (predicate_x != NULL) {
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   312
    assert(predicate_c == NULL, "only one predicate entry expected");
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 7397
diff changeset
   313
    // Clone loop predicates to each path
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9101
diff changeset
   314
    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
   315
    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
   316
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
  // Merge the TRUE paths
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   319
  Node *region_s = new (igvn->C) RegionNode(3);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
  igvn->_worklist.push(region_s);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
  region_s->init_req(1, iff_c_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
  region_s->init_req(2, iff_x_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
  igvn->register_new_node_with_optimizer( region_s );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
489c9b5090e2 Initial load
duke
parents:
diff changeset
   325
  // Merge the FALSE paths
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   326
  Node *region_f = new (igvn->C) RegionNode(3);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
  igvn->_worklist.push(region_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
  region_f->init_req(1, iff_c_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
  region_f->init_req(2, iff_x_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
  igvn->register_new_node_with_optimizer( region_f );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
  igvn->hash_delete(cmp);// Remove soon-to-be-dead node from hash table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
  cmp->set_req(1,NULL);  // Whack the inputs to cmp because it will be dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
  cmp->set_req(2,NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
  // Check for all uses of the Phi and give them a new home.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
  // The 'cmp' got cloned, but CastPP/IIs need to be moved.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   337
  Node *phi_s = NULL;     // do not construct unless needed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
  Node *phi_f = NULL;     // do not construct unless needed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   339
  for (DUIterator_Last i2min, i2 = phi->last_outs(i2min); i2 >= i2min; --i2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
    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
   341
    igvn->rehash_node_delayed(v); // Have to fixup other Phi users
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   342
    uint vop = v->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
    Node *proj = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   344
    if( vop == Op_Phi ) {       // Remote merge point
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
      Node *r = v->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
      for (uint i3 = 1; i3 < r->req(); i3++)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
        if (r->in(i3) && r->in(i3)->in(0) == iff) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
          proj = r->in(i3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
    } else if( v->is_ConstraintCast() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
      proj = v->in(0);          // Controlling projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
      assert( 0, "do not know how to handle this guy" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
    Node *proj_path_data, *proj_path_ctrl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
    if( proj->Opcode() == Op_IfTrue ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
      if( phi_s == NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
        // Only construct phi_s if needed, otherwise provides
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
        // interfering use.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
        phi_s = PhiNode::make_blank(region_s,phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
        phi_s->init_req( 1, phi_c );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   364
        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
   365
        hook->add_req(phi_s);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
        phi_s = phase->transform(phi_s);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
      proj_path_data = phi_s;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
      proj_path_ctrl = region_s;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
      if( phi_f == NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
        // Only construct phi_f if needed, otherwise provides
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
        // interfering use.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   374
        phi_f = PhiNode::make_blank(region_f,phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
        phi_f->init_req( 1, phi_c );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
        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
   377
        hook->add_req(phi_f);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
        phi_f = phase->transform(phi_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   380
      proj_path_data = phi_f;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
      proj_path_ctrl = region_f;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
    // Fixup 'v' for for the split
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
    if( vop == Op_Phi ) {       // Remote merge point
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
      uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   387
      for( i = 1; i < v->req(); i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
        if( v->in(i) == phi )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
      v->set_req(i, proj_path_data );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   391
    } else if( v->is_ConstraintCast() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
      v->set_req(0, proj_path_ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
      v->set_req(1, proj_path_data );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
    } else
489c9b5090e2 Initial load
duke
parents:
diff changeset
   395
      ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   396
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
489c9b5090e2 Initial load
duke
parents:
diff changeset
   398
  // Now replace the original iff's True/False with region_s/region_t.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
  // This makes the original iff go dead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
  for (DUIterator_Last i3min, i3 = iff->last_outs(i3min); i3 >= i3min; --i3) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
    Node* p = iff->last_out(i3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
    assert( p->Opcode() == Op_IfTrue || p->Opcode() == Op_IfFalse, "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
    Node *u = (p->Opcode() == Op_IfTrue) ? region_s : region_f;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
    // Replace p with u
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
    igvn->add_users_to_worklist(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
    for (DUIterator_Last lmin, l = p->last_outs(lmin); l >= lmin;) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
      Node* x = p->last_out(l);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
      igvn->hash_delete(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
      uint uses_found = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
      for( uint j = 0; j < x->req(); j++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
        if( x->in(j) == p ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
          x->set_req(j, u);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
          uses_found++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
      l -= uses_found;    // we deleted 1 or more copies of this edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
    igvn->remove_dead_node(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   420
489c9b5090e2 Initial load
duke
parents:
diff changeset
   421
  // Force the original merge dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   422
  igvn->hash_delete(r);
3268
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   423
  // First, remove region's dead users.
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   424
  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
   425
    Node* u = r->last_out(l);
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   426
    if( u == r ) {
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   427
      r->set_req(0, NULL);
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   428
    } else {
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   429
      assert(u->outcnt() == 0, "only dead users");
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   430
      igvn->remove_dead_node(u);
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   431
    }
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   432
    l -= 1;
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   433
  }
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 2131
diff changeset
   434
  igvn->remove_dead_node(r);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
  // Now remove the bogus extra edges used to keep things alive
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
  igvn->remove_dead_node( hook );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
  // Must return either the original node (now dead) or a new node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
  // (Do not return a top here, since that would break the uniqueness of top.)
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   441
  return new (igvn->C) ConINode(TypeInt::ZERO);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   442
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
//------------------------------is_range_check---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
// Return 0 if not a range check.  Return 1 if a range check and set index and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
// offset.  Return 2 if we had to negate the test.  Index is NULL if the check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
// is versus a constant.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
int IfNode::is_range_check(Node* &range, Node* &index, jint &offset) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   449
  Node* b = in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
  if (b == NULL || !b->is_Bool())  return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   451
  BoolNode* bn = b->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
  Node* cmp = bn->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
  if (cmp == NULL)  return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
  if (cmp->Opcode() != Op_CmpU)  return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
  Node* l = cmp->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
  Node* r = cmp->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
  int flip_test = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   459
  if (bn->_test._test == BoolTest::le) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
    l = cmp->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
    r = cmp->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
    flip_test = 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
  } else if (bn->_test._test != BoolTest::lt) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
    return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
  if (l->is_top())  return 0;   // Top input means dead test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
  if (r->Opcode() != Op_LoadRange)  return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
  // We have recognized one of these forms:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
  //  Flip 1:  If (Bool[<] CmpU(l, LoadRange)) ...
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
  //  Flip 2:  If (Bool[<=] CmpU(LoadRange, l)) ...
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
  // Make sure it's a real range check by requiring an uncommon trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
  // along the OOB path.  Otherwise, it's possible that the user wrote
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
  // something which optimized to look like a range check but behaves
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
  // in some other way.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
  Node* iftrap = proj_out(flip_test == 2 ? true : false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
  bool found_trap = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
  if (iftrap != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
    Node* u = iftrap->unique_ctrl_out();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
    if (u != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   482
      // It could be a merge point (Region) for uncommon trap.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
      if (u->is_Region()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
        Node* c = u->unique_ctrl_out();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
        if (c != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
          iftrap = u;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
          u = c;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   489
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   490
      if (u->in(0) == iftrap && u->is_CallStaticJava()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
        int req = u->as_CallStaticJava()->uncommon_trap_request();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
        if (Deoptimization::trap_request_reason(req) ==
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
            Deoptimization::Reason_range_check) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
          found_trap = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
  if (!found_trap)  return 0;   // sorry, no cigar
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
  // Look for index+offset form
489c9b5090e2 Initial load
duke
parents:
diff changeset
   502
  Node* ind = l;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   503
  jint  off = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   504
  if (l->is_top()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   505
    return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   506
  } else if (l->is_Add()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   507
    if ((off = l->in(1)->find_int_con(0)) != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
      ind = l->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
    } else if ((off = l->in(2)->find_int_con(0)) != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   510
      ind = l->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   511
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   512
  } else if ((off = l->find_int_con(-1)) >= 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   513
    // constant offset with no variable index
489c9b5090e2 Initial load
duke
parents:
diff changeset
   514
    ind = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   516
    // variable index with no constant offset (or dead negative index)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
    off = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
  // Return all the values:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
  index  = ind;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
  offset = off;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
  range  = r;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
  return flip_test;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   526
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
//------------------------------adjust_check-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
// Adjust (widen) a prior range check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
static void adjust_check(Node* proj, Node* range, Node* index,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
                         int flip, jint off_lo, PhaseIterGVN* igvn) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
  PhaseGVN *gvn = igvn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
  // Break apart the old check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
  Node *iff = proj->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
  Node *bol = iff->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
  if( bol->is_top() ) return;   // In case a partially dead range check appears
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
  // bail (or bomb[ASSERT/DEBUG]) if NOT projection-->IfNode-->BoolNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  DEBUG_ONLY( if( !bol->is_Bool() ) { proj->dump(3); fatal("Expect projection-->IfNode-->BoolNode"); } )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
  if( !bol->is_Bool() ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
  Node *cmp = bol->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
  // Compute a new check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
  Node *new_add = gvn->intcon(off_lo);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   543
  if( index ) {
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   544
    new_add = off_lo ? gvn->transform(new (gvn->C) AddINode( index, new_add )) : index;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
  Node *new_cmp = (flip == 1)
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   547
    ? new (gvn->C) CmpUNode( new_add, range )
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   548
    : new (gvn->C) CmpUNode( range, new_add );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
  new_cmp = gvn->transform(new_cmp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
  // See if no need to adjust the existing check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
  if( new_cmp == cmp ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
  // Else, adjust existing check
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   553
  Node *new_bol = gvn->transform( new (gvn->C) 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
   554
  igvn->rehash_node_delayed( iff );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
  iff->set_req_X( 1, new_bol, igvn );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   557
489c9b5090e2 Initial load
duke
parents:
diff changeset
   558
//------------------------------up_one_dom-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   559
// Walk up the dominator tree one step.  Return NULL at root or true
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
// complex merges.  Skips through small diamonds.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
Node* IfNode::up_one_dom(Node *curr, bool linear_only) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   562
  Node *dom = curr->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   563
  if( !dom )                    // Found a Region degraded to a copy?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   564
    return curr->nonnull_req(); // Skip thru it
489c9b5090e2 Initial load
duke
parents:
diff changeset
   565
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
  if( curr != dom )             // Normal walk up one step?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
    return dom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
489c9b5090e2 Initial load
duke
parents:
diff changeset
   569
  // Use linear_only if we are still parsing, since we cannot
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
  // trust the regions to be fully filled in.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
  if (linear_only)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
4582
1a6662d11385 6915110: IfNode::up_one_dom moves beyond RootNode bug in src/share/vm/opto/ifnode.cpp
kvn
parents: 4020
diff changeset
   574
  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
   575
    return NULL;
1a6662d11385 6915110: IfNode::up_one_dom moves beyond RootNode bug in src/share/vm/opto/ifnode.cpp
kvn
parents: 4020
diff changeset
   576
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
  // Else hit a Region.  Check for a loop header
489c9b5090e2 Initial load
duke
parents:
diff changeset
   578
  if( dom->is_Loop() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   579
    return dom->in(1);          // Skip up thru loops
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
  // Check for small diamonds
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
  Node *din1, *din2, *din3, *din4;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   583
  if( dom->req() == 3 &&        // 2-path merge point
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
      (din1 = dom ->in(1)) &&   // Left  path exists
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
      (din2 = dom ->in(2)) &&   // Right path exists
489c9b5090e2 Initial load
duke
parents:
diff changeset
   586
      (din3 = din1->in(0)) &&   // Left  path up one
489c9b5090e2 Initial load
duke
parents:
diff changeset
   587
      (din4 = din2->in(0)) ) {  // Right path up one
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
    if( din3->is_Call() &&      // Handle a slow-path call on either arm
489c9b5090e2 Initial load
duke
parents:
diff changeset
   589
        (din3 = din3->in(0)) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   590
      din3 = din3->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   591
    if( din4->is_Call() &&      // Handle a slow-path call on either arm
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
        (din4 = din4->in(0)) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
      din4 = din4->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
    if( din3 == din4 && din3->is_If() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
      return din3;              // Skip around diamonds
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
  // Give up the search at true merges
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
  return NULL;                  // Dead loop?  Or hit root?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   602
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   603
//------------------------------filtered_int_type--------------------------------
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   604
// 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
   605
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
   606
  assert(if_proj &&
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   607
         (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
   608
  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
   609
    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
   610
    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
   611
      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
   612
      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
   613
        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
   614
        if (cmp->in(1) == val) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   615
          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
   616
          if (cmp2_t != NULL) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   617
            jint lo = cmp2_t->_lo;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   618
            jint hi = cmp2_t->_hi;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   619
            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
   620
            switch (msk) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   621
            case BoolTest::ne:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   622
              // Can't refine type
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   623
              return NULL;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   624
            case BoolTest::eq:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   625
              return cmp2_t;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   626
            case BoolTest::lt:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   627
              lo = TypeInt::INT->_lo;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   628
              if (hi - 1 < hi) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   629
                hi = hi - 1;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   630
              }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   631
              break;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   632
            case BoolTest::le:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   633
              lo = TypeInt::INT->_lo;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   634
              break;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   635
            case BoolTest::gt:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   636
              if (lo + 1 > lo) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   637
                lo = lo + 1;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   638
              }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   639
              hi = TypeInt::INT->_hi;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   640
              break;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   641
            case BoolTest::ge:
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   642
              // lo unchanged
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   643
              hi = TypeInt::INT->_hi;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   644
              break;
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
            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
   647
            return rtn_t;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   648
          }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   649
        }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   650
      }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   651
    }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   652
  }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   653
  return NULL;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   654
}
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   655
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   656
//------------------------------fold_compares----------------------------
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   657
// 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
   658
// the direction of this if is determined by the preceding if so it
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   659
// can be eliminate entirely.  Given an if testing (CmpI n c) check
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   660
// for an immediately control dependent if that is testing (CmpI n c2)
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   661
// and has one projection leading to this if and the other projection
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   662
// leading to a region that merges one of this ifs control
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   663
// projections.
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
//                   If
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
//                /   |
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   669
//              If    |
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
//             /  \   |
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   672
//            /    \  |
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   673
//           /    Region
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   674
//
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   675
Node* IfNode::fold_compares(PhaseGVN* phase) {
24479
20eb4c752fb5 8042786: Proper fix for 8032566
kvn
parents: 22911
diff changeset
   676
  if (Opcode() != Op_If) return NULL;
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   677
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   678
  Node* this_cmp = in(1)->in(1);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   679
  if (this_cmp != NULL && this_cmp->Opcode() == Op_CmpI &&
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   680
      this_cmp->in(2)->is_Con() && this_cmp->in(2) != phase->C->top()) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   681
    Node* ctrl = in(0);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   682
    BoolNode* this_bool = in(1)->as_Bool();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   683
    Node* n = this_cmp->in(1);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   684
    int hi = this_cmp->in(2)->get_int();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   685
    if (ctrl != NULL && ctrl->is_Proj() && ctrl->outcnt() == 1 &&
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   686
        ctrl->in(0)->is_If() &&
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   687
        ctrl->in(0)->outcnt() == 2 &&
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   688
        ctrl->in(0)->in(1)->is_Bool() &&
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   689
        ctrl->in(0)->in(1)->in(1)->Opcode() == Op_CmpI &&
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   690
        ctrl->in(0)->in(1)->in(1)->in(2)->is_Con() &&
20701
ef9996662fd5 8020750: Node::get_int: guarantee(t != NULL) failed: must be con
twisti
parents: 20289
diff changeset
   691
        ctrl->in(0)->in(1)->in(1)->in(2) != phase->C->top() &&
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   692
        ctrl->in(0)->in(1)->in(1)->in(1) == n) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   693
      IfNode* dom_iff = ctrl->in(0)->as_If();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   694
      Node* otherproj = dom_iff->proj_out(!ctrl->as_Proj()->_con);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   695
      if (otherproj->outcnt() == 1 && otherproj->unique_out()->is_Region() &&
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   696
          this_bool->_test._test != BoolTest::ne && this_bool->_test._test != BoolTest::eq) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   697
        // Identify which proj goes to the region and which continues on
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   698
        RegionNode* region = otherproj->unique_out()->as_Region();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   699
        Node* success = NULL;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   700
        Node* fail = NULL;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   701
        for (int i = 0; i < 2; i++) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   702
          Node* proj = proj_out(i);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   703
          if (success == NULL && proj->outcnt() == 1 && proj->unique_out() == region) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   704
            success = proj;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   705
          } else if (fail == NULL) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   706
            fail = proj;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   707
          } else {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   708
            success = fail = NULL;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   709
          }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   710
        }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   711
        if (success != NULL && fail != NULL && !region->has_phi()) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   712
          int lo = dom_iff->in(1)->in(1)->in(2)->get_int();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   713
          BoolNode* dom_bool = dom_iff->in(1)->as_Bool();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   714
          Node* dom_cmp =  dom_bool->in(1);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   715
          const TypeInt* failtype  = filtered_int_type(phase, n, ctrl);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   716
          if (failtype != NULL) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   717
            const TypeInt* type2 = filtered_int_type(phase, n, fail);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   718
            if (type2 != NULL) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   719
              failtype = failtype->join(type2)->is_int();
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   720
            } else {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   721
              failtype = NULL;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   722
            }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   723
          }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   724
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   725
          if (failtype != NULL &&
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   726
              dom_bool->_test._test != BoolTest::ne && dom_bool->_test._test != BoolTest::eq) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   727
            int bound = failtype->_hi - failtype->_lo + 1;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   728
            if (failtype->_hi != max_jint && failtype->_lo != min_jint && bound > 1) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   729
              // Merge the two compares into a single unsigned compare by building  (CmpU (n - lo) hi)
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   730
              BoolTest::mask cond = fail->as_Proj()->_con ? BoolTest::lt : BoolTest::ge;
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   731
              Node* adjusted = phase->transform(new (phase->C) SubINode(n, phase->intcon(failtype->_lo)));
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   732
              Node* newcmp = phase->transform(new (phase->C) CmpUNode(adjusted, phase->intcon(bound)));
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
   733
              Node* newbool = phase->transform(new (phase->C) BoolNode(newcmp, cond));
12958
009b6c9586d8 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node*, int, Node*) where applicable
kvn
parents: 10258
diff changeset
   734
              phase->is_IterGVN()->replace_input_of(dom_iff, 1, phase->intcon(ctrl->as_Proj()->_con));
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   735
              phase->hash_delete(this);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   736
              set_req(1, newbool);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   737
              return this;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   738
            }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   739
            if (failtype->_lo > failtype->_hi) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   740
              // previous if determines the result of this if so
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   741
              // replace Bool with constant
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   742
              phase->hash_delete(this);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   743
              set_req(1, phase->intcon(success->as_Proj()->_con));
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   744
              return this;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   745
            }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   746
          }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   747
        }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   748
      }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   749
    }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   750
  }
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   751
  return NULL;
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   752
}
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   753
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   754
//------------------------------remove_useless_bool----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
// Check for people making a useless boolean: things like
489c9b5090e2 Initial load
duke
parents:
diff changeset
   756
// if( (x < y ? true : false) ) { ... }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   757
// Replace with if( x < y ) { ... }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   758
static Node *remove_useless_bool(IfNode *iff, PhaseGVN *phase) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   759
  Node *i1 = iff->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
  if( !i1->is_Bool() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
  BoolNode *bol = i1->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   762
489c9b5090e2 Initial load
duke
parents:
diff changeset
   763
  Node *cmp = bol->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   764
  if( cmp->Opcode() != Op_CmpI ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   765
489c9b5090e2 Initial load
duke
parents:
diff changeset
   766
  // Must be comparing against a bool
489c9b5090e2 Initial load
duke
parents:
diff changeset
   767
  const Type *cmp2_t = phase->type( cmp->in(2) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   768
  if( cmp2_t != TypeInt::ZERO &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   769
      cmp2_t != TypeInt::ONE )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   770
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   771
489c9b5090e2 Initial load
duke
parents:
diff changeset
   772
  // Find a prior merge point merging the boolean
489c9b5090e2 Initial load
duke
parents:
diff changeset
   773
  i1 = cmp->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   774
  if( !i1->is_Phi() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   775
  PhiNode *phi = i1->as_Phi();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   776
  if( phase->type( phi ) != TypeInt::BOOL )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   777
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   778
489c9b5090e2 Initial load
duke
parents:
diff changeset
   779
  // Check for diamond pattern
489c9b5090e2 Initial load
duke
parents:
diff changeset
   780
  int true_path = phi->is_diamond_phi();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   781
  if( true_path == 0 ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   782
958
4c4709e8b7ee 6712835: Server compiler fails with assertion (loop_count < K,"infinite loop in PhaseIterGVN::transform")
never
parents: 190
diff changeset
   783
  // 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
   784
  // 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
   785
  // an illegal cycle.
4c4709e8b7ee 6712835: Server compiler fails with assertion (loop_count < K,"infinite loop in PhaseIterGVN::transform")
never
parents: 190
diff changeset
   786
  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
   787
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
  // phi->region->if_proj->ifnode->bool->cmp
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
  BoolNode *bol2 = phi->in(0)->in(1)->in(0)->in(1)->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
  // Now get the 'sense' of the test correct so we can plug in
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
  // either iff2->in(1) or its complement.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
  int flip = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
  if( bol->_test._test == BoolTest::ne ) flip = 1-flip;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
  else if( bol->_test._test != BoolTest::eq ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
  if( cmp2_t == TypeInt::ZERO ) flip = 1-flip;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
489c9b5090e2 Initial load
duke
parents:
diff changeset
   798
  const Type *phi1_t = phase->type( phi->in(1) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   799
  const Type *phi2_t = phase->type( phi->in(2) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   800
  // Check for Phi(0,1) and flip
489c9b5090e2 Initial load
duke
parents:
diff changeset
   801
  if( phi1_t == TypeInt::ZERO ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   802
    if( phi2_t != TypeInt::ONE ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   803
    flip = 1-flip;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   804
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   805
    // Check for Phi(1,0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
    if( phi1_t != TypeInt::ONE  ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   807
    if( phi2_t != TypeInt::ZERO ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   809
  if( true_path == 2 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   810
    flip = 1-flip;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   811
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   812
489c9b5090e2 Initial load
duke
parents:
diff changeset
   813
  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
   814
  assert(new_bol != iff->in(1), "must make progress");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
  iff->set_req(1, new_bol);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
  // Intervening diamond probably goes dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
  phase->C->set_major_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
  return iff;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
static IfNode* idealize_test(PhaseGVN* phase, IfNode* iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   822
489c9b5090e2 Initial load
duke
parents:
diff changeset
   823
//------------------------------Ideal------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   824
// Return a node which is more "ideal" than the current node.  Strip out
489c9b5090e2 Initial load
duke
parents:
diff changeset
   825
// control copies
489c9b5090e2 Initial load
duke
parents:
diff changeset
   826
Node *IfNode::Ideal(PhaseGVN *phase, bool can_reshape) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   827
  if (remove_dead_region(phase, can_reshape))  return this;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   828
  // No Def-Use info?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   829
  if (!can_reshape)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   830
  PhaseIterGVN *igvn = phase->is_IterGVN();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   831
489c9b5090e2 Initial load
duke
parents:
diff changeset
   832
  // Don't bother trying to transform a dead if
489c9b5090e2 Initial load
duke
parents:
diff changeset
   833
  if (in(0)->is_top())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   834
  // Don't bother trying to transform an if with a dead test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   835
  if (in(1)->is_top())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   836
  // Another variation of a dead test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   837
  if (in(1)->is_Con())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   838
  // Another variation of a dead if
489c9b5090e2 Initial load
duke
parents:
diff changeset
   839
  if (outcnt() < 2)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   840
489c9b5090e2 Initial load
duke
parents:
diff changeset
   841
  // Canonicalize the test.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   842
  Node* idt_if = idealize_test(phase, this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   843
  if (idt_if != NULL)  return idt_if;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   844
489c9b5090e2 Initial load
duke
parents:
diff changeset
   845
  // Try to split the IF
489c9b5090e2 Initial load
duke
parents:
diff changeset
   846
  Node *s = split_if(this, igvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   847
  if (s != NULL)  return s;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   848
489c9b5090e2 Initial load
duke
parents:
diff changeset
   849
  // Check for people making a useless boolean: things like
489c9b5090e2 Initial load
duke
parents:
diff changeset
   850
  // if( (x < y ? true : false) ) { ... }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   851
  // Replace with if( x < y ) { ... }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   852
  Node *bol2 = remove_useless_bool(this, phase);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   853
  if( bol2 ) return bol2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   854
489c9b5090e2 Initial load
duke
parents:
diff changeset
   855
  // Setup to scan up the CFG looking for a dominating test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   856
  Node *dom = in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   857
  Node *prev_dom = this;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   858
489c9b5090e2 Initial load
duke
parents:
diff changeset
   859
  // Check for range-check vs other kinds of tests
489c9b5090e2 Initial load
duke
parents:
diff changeset
   860
  Node *index1, *range1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   861
  jint offset1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   862
  int flip1 = is_range_check(range1, index1, offset1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   863
  if( flip1 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   864
    Node *first_prev_dom = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   865
489c9b5090e2 Initial load
duke
parents:
diff changeset
   866
    // Try to remove extra range checks.  All 'up_one_dom' gives up at merges
489c9b5090e2 Initial load
duke
parents:
diff changeset
   867
    // so all checks we inspect post-dominate the top-most check we find.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   868
    // 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
   869
    // then we are guaranteed to fail, so just start interpreting there.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   870
    // We 'expand' the top 2 range checks to include all post-dominating
489c9b5090e2 Initial load
duke
parents:
diff changeset
   871
    // checks.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   872
489c9b5090e2 Initial load
duke
parents:
diff changeset
   873
    // The top 2 range checks seen
489c9b5090e2 Initial load
duke
parents:
diff changeset
   874
    Node *prev_chk1 = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   875
    Node *prev_chk2 = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   876
    // Low and high offsets seen so far
489c9b5090e2 Initial load
duke
parents:
diff changeset
   877
    jint off_lo = offset1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   878
    jint off_hi = offset1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   879
489c9b5090e2 Initial load
duke
parents:
diff changeset
   880
    // Scan for the top 2 checks and collect range of offsets
489c9b5090e2 Initial load
duke
parents:
diff changeset
   881
    for( int dist = 0; dist < 999; dist++ ) { // Range-Check scan limit
489c9b5090e2 Initial load
duke
parents:
diff changeset
   882
      if( dom->Opcode() == Op_If &&  // Not same opcode?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   883
          prev_dom->in(0) == dom ) { // One path of test does dominate?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   884
        if( dom == this ) return NULL; // dead loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   885
        // See if this is a range check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
        Node *index2, *range2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   887
        jint offset2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   888
        int flip2 = dom->as_If()->is_range_check(range2, index2, offset2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   889
        // See if this is a _matching_ range check, checking against
489c9b5090e2 Initial load
duke
parents:
diff changeset
   890
        // the same array bounds.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   891
        if( flip2 == flip1 && range2 == range1 && index2 == index1 &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   892
            dom->outcnt() == 2 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   893
          // Gather expanded bounds
489c9b5090e2 Initial load
duke
parents:
diff changeset
   894
          off_lo = MIN2(off_lo,offset2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
          off_hi = MAX2(off_hi,offset2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
          // Record top 2 range checks
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
          prev_chk2 = prev_chk1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   898
          prev_chk1 = prev_dom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
          // If we match the test exactly, then the top test covers
489c9b5090e2 Initial load
duke
parents:
diff changeset
   900
          // both our lower and upper bounds.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   901
          if( dom->in(1) == in(1) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   902
            prev_chk2 = prev_chk1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   903
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   904
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   905
      prev_dom = dom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   906
      dom = up_one_dom( dom );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   907
      if( !dom ) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   908
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   909
489c9b5090e2 Initial load
duke
parents:
diff changeset
   910
489c9b5090e2 Initial load
duke
parents:
diff changeset
   911
    // Attempt to widen the dominating range check to cover some later
489c9b5090e2 Initial load
duke
parents:
diff changeset
   912
    // ones.  Since range checks "fail" by uncommon-trapping to the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   913
    // interpreter, widening a check can make us speculative enter the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   914
    // interpreter.  If we see range-check deopt's, do not widen!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   915
    if (!phase->C->allow_range_check_smearing())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   916
489c9b5090e2 Initial load
duke
parents:
diff changeset
   917
    // Constant indices only need to check the upper bound.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   918
    // Non-constance indices must check both low and high.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   919
    if( index1 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   920
      // Didn't find 2 prior covering checks, so cannot remove anything.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   921
      if( !prev_chk2 ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   922
      // 'Widen' the offsets of the 1st and 2nd covering check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   923
      adjust_check( prev_chk1, range1, index1, flip1, off_lo, igvn );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   924
      // Do not call adjust_check twice on the same projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
   925
      // as the first call may have transformed the BoolNode to a ConI
489c9b5090e2 Initial load
duke
parents:
diff changeset
   926
      if( prev_chk1 != prev_chk2 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   927
        adjust_check( prev_chk2, range1, index1, flip1, off_hi, igvn );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   928
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   929
      // Test is now covered by prior checks, dominate it out
489c9b5090e2 Initial load
duke
parents:
diff changeset
   930
      prev_dom = prev_chk2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   931
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   932
      // Didn't find prior covering check, so cannot remove anything.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   933
      if( !prev_chk1 ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   934
      // 'Widen' the offset of the 1st and only covering check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   935
      adjust_check( prev_chk1, range1, index1, flip1, off_hi, igvn );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   936
      // Test is now covered by prior checks, dominate it out
489c9b5090e2 Initial load
duke
parents:
diff changeset
   937
      prev_dom = prev_chk1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   938
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   939
489c9b5090e2 Initial load
duke
parents:
diff changeset
   940
489c9b5090e2 Initial load
duke
parents:
diff changeset
   941
  } else {                      // Scan for an equivalent test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   942
489c9b5090e2 Initial load
duke
parents:
diff changeset
   943
    Node *cmp;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   944
    int dist = 0;               // Cutoff limit for search
489c9b5090e2 Initial load
duke
parents:
diff changeset
   945
    int op = Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   946
    if( op == Op_If &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   947
        (cmp=in(1)->in(1))->Opcode() == Op_CmpP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   948
      if( cmp->in(2) != NULL && // make sure cmp is not already dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   949
          cmp->in(2)->bottom_type() == TypePtr::NULL_PTR ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   950
        dist = 64;              // Limit for null-pointer scans
489c9b5090e2 Initial load
duke
parents:
diff changeset
   951
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   952
        dist = 4;               // Do not bother for random pointer tests
489c9b5090e2 Initial load
duke
parents:
diff changeset
   953
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   954
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   955
      dist = 4;                 // Limit for random junky scans
489c9b5090e2 Initial load
duke
parents:
diff changeset
   956
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   957
489c9b5090e2 Initial load
duke
parents:
diff changeset
   958
    // Normal equivalent-test check.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   959
    if( !dom ) return NULL;     // Dead loop?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   960
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   961
    Node* result = fold_compares(phase);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   962
    if (result != NULL) {
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   963
      return result;
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
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   966
    // Search up the dominator tree for an If with an identical test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   967
    while( dom->Opcode() != op    ||  // Not same opcode?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   968
           dom->in(1)    != in(1) ||  // Not same input 1?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   969
           (req() == 3 && dom->in(2) != in(2)) || // Not same input 2?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   970
           prev_dom->in(0) != dom ) { // One path of test does not dominate?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   971
      if( dist < 0 ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   972
489c9b5090e2 Initial load
duke
parents:
diff changeset
   973
      dist--;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   974
      prev_dom = dom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   975
      dom = up_one_dom( dom );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   976
      if( !dom ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   977
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   978
489c9b5090e2 Initial load
duke
parents:
diff changeset
   979
    // Check that we did not follow a loop back to ourselves
489c9b5090e2 Initial load
duke
parents:
diff changeset
   980
    if( this == dom )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   981
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   982
489c9b5090e2 Initial load
duke
parents:
diff changeset
   983
    if( dist > 2 )              // Add to count of NULL checks elided
489c9b5090e2 Initial load
duke
parents:
diff changeset
   984
      explicit_null_checks_elided++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   985
489c9b5090e2 Initial load
duke
parents:
diff changeset
   986
  } // End of Else scan for an equivalent test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   987
489c9b5090e2 Initial load
duke
parents:
diff changeset
   988
  // Hit!  Remove this IF
489c9b5090e2 Initial load
duke
parents:
diff changeset
   989
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   990
  if( TraceIterativeGVN ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   991
    tty->print("   Removing IfNode: "); this->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   992
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   993
  if( VerifyOpto && !phase->allow_progress() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   994
    // Found an equivalent dominating test,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   995
    // we can not guarantee reaching a fix-point for these during iterativeGVN
489c9b5090e2 Initial load
duke
parents:
diff changeset
   996
    // since intervening nodes may not change.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   997
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   998
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   999
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1000
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1001
  // Replace dominated IfNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1002
  dominated_by( prev_dom, igvn );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1003
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1004
  // Must return either the original node (now dead) or a new node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1005
  // (Do not return a top here, since that would break the uniqueness of top.)
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1006
  return new (phase->C) ConINode(TypeInt::ZERO);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1007
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1008
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1009
//------------------------------dominated_by-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1010
void IfNode::dominated_by( Node *prev_dom, PhaseIterGVN *igvn ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1011
  igvn->hash_delete(this);      // Remove self to prevent spurious V-N
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1012
  Node *idom = in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
  // Need opcode to decide which way 'this' test goes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1014
  int prev_op = prev_dom->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1015
  Node *top = igvn->C->top(); // Shortcut to top
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1016
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1017
  // Loop predicates may have depending checks which should not
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1018
  // be skipped. For example, range check predicate has two checks
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1019
  // for lower and upper bounds.
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1020
  ProjNode* unc_proj = proj_out(1 - prev_dom->as_Proj()->_con)->as_Proj();
21089
e1986ff6fe2e 8024069: replace_in_map() should operate on parent maps
roland
parents: 20701
diff changeset
  1021
  if (unc_proj->is_uncommon_trap_proj(Deoptimization::Reason_predicate))
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1022
    prev_dom = idom;
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1023
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1024
  // Now walk the current IfNode's projections.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1025
  // Loop ends when 'this' has no more uses.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1026
  for (DUIterator_Last imin, i = last_outs(imin); i >= imin; --i) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1027
    Node *ifp = last_out(i);     // Get IfTrue/IfFalse
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1028
    igvn->add_users_to_worklist(ifp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1029
    // Check which projection it is and set target.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1030
    // Data-target is either the dominating projection of the same type
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1031
    // or TOP if the dominating projection is of opposite type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1032
    // Data-target will be used as the new control edge for the non-CFG
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1033
    // nodes like Casts and Loads.
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 9449
diff changeset
  1034
    Node *data_target = (ifp->Opcode() == prev_op) ? prev_dom : top;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1035
    // 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
  1036
    Node *ctrl_target = (ifp->Opcode() == prev_op) ?     idom : top;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1037
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1038
    // For each child of an IfTrue/IfFalse projection, reroute.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1039
    // Loop ends when projection has no more uses.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1040
    for (DUIterator_Last jmin, j = ifp->last_outs(jmin); j >= jmin; --j) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1041
      Node* s = ifp->last_out(j);   // Get child of IfTrue/IfFalse
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1042
      if( !s->depends_only_on_test() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1043
        // Find the control input matching this def-use edge.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1044
        // For Regions it may not be in slot 0.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1045
        uint l;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1046
        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
  1047
        igvn->replace_input_of(s, l, ctrl_target);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1048
      } 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
  1049
        igvn->replace_input_of(s, 0, data_target); // Move child to data-target
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1050
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1051
    } // End for each child of a projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1052
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1053
    igvn->remove_dead_node(ifp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1054
  } // End for each IfTrue/IfFalse child of If
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1055
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1056
  // Kill the IfNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1057
  igvn->remove_dead_node(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1058
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1059
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1060
//------------------------------Identity---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1061
// If the test is constant & we match, then we are the input Control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1062
Node *IfTrueNode::Identity( PhaseTransform *phase ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1063
  // Can only optimize if cannot go the other way
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1064
  const TypeTuple *t = phase->type(in(0))->is_tuple();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1065
  return ( t == TypeTuple::IFNEITHER || t == TypeTuple::IFTRUE )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1066
    ? in(0)->in(0)              // IfNode control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1067
    : this;                     // no progress
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1068
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1069
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1070
//------------------------------dump_spec--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1071
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1072
void IfNode::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1073
  st->print("P=%f, C=%f",_prob,_fcnt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1074
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1075
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1076
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1077
//------------------------------idealize_test----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1078
// Try to canonicalize tests better.  Peek at the Cmp/Bool/If sequence and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1079
// come up with a canonical sequence.  Bools getting 'eq', 'gt' and 'ge' forms
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1080
// converted to 'ne', 'le' and 'lt' forms.  IfTrue/IfFalse get swapped as
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1081
// needed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1082
static IfNode* idealize_test(PhaseGVN* phase, IfNode* iff) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1083
  assert(iff->in(0) != NULL, "If must be live");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1084
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1085
  if (iff->outcnt() != 2)  return NULL; // Malformed projections.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1086
  Node* old_if_f = iff->proj_out(false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1087
  Node* old_if_t = iff->proj_out(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1088
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1089
  // CountedLoopEnds want the back-control test to be TRUE, irregardless of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1090
  // whether they are testing a 'gt' or 'lt' condition.  The 'gt' condition
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1091
  // happens in count-down loops
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1092
  if (iff->is_CountedLoopEnd())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1093
  if (!iff->in(1)->is_Bool())  return NULL; // Happens for partially optimized IF tests
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1094
  BoolNode *b = iff->in(1)->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1095
  BoolTest bt = b->_test;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1096
  // Test already in good order?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1097
  if( bt.is_canonical() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1098
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1099
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1100
  // Flip test to be canonical.  Requires flipping the IfFalse/IfTrue and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1101
  // cloning the IfNode.
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1102
  Node* new_b = phase->transform( new (phase->C) BoolNode(b->in(1), bt.negate()) );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1103
  if( !new_b->is_Bool() ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1104
  b = new_b->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1105
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1106
  PhaseIterGVN *igvn = phase->is_IterGVN();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1107
  assert( igvn, "Test is not canonical in parser?" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1108
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1109
  // The IF node never really changes, but it needs to be cloned
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1110
  iff = new (phase->C) IfNode( iff->in(0), b, 1.0-iff->_prob, iff->_fcnt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1111
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1112
  Node *prior = igvn->hash_find_insert(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1113
  if( prior ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1114
    igvn->remove_dead_node(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1115
    iff = (IfNode*)prior;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1116
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1117
    // Cannot call transform on it just yet
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1118
    igvn->set_type_bottom(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1119
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1120
  igvn->_worklist.push(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1121
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1122
  // Now handle projections.  Cloning not required.
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1123
  Node* new_if_f = (Node*)(new (phase->C) IfFalseNode( iff ));
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 12958
diff changeset
  1124
  Node* new_if_t = (Node*)(new (phase->C) IfTrueNode ( iff ));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1125
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1126
  igvn->register_new_node_with_optimizer(new_if_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1127
  igvn->register_new_node_with_optimizer(new_if_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1128
  // 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
  1129
  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
  1130
  igvn->replace_node(old_if_t, new_if_f);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1131
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1132
  // Progress
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1133
  return iff;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1134
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1135
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1136
//------------------------------Identity---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1137
// If the test is constant & we match, then we are the input Control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1138
Node *IfFalseNode::Identity( PhaseTransform *phase ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1139
  // Can only optimize if cannot go the other way
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1140
  const TypeTuple *t = phase->type(in(0))->is_tuple();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1141
  return ( t == TypeTuple::IFNEITHER || t == TypeTuple::IFFALSE )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1142
    ? in(0)->in(0)              // IfNode control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1143
    : this;                     // no progress
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1144
}