src/hotspot/share/opto/phaseX.cpp
author rkennke
Tue, 06 Nov 2018 23:03:05 +0100
changeset 52429 b64514ff68fd
parent 52224 4f2215a00ed1
child 52654 95ce45e0249f
permissions -rw-r--r--
8213381: Hook to allow GC to inject Node::Ideal() calls Reviewed-by: kvn, eosterlund, roland
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
48595
5d699d81c10c 8194988: 8 Null pointer dereference defect groups related to MultiNode::proj_out()
dlong
parents: 47765
diff changeset
     2
 * Copyright (c) 1997, 2018, 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: 4020
diff changeset
    19
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 4020
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: 4020
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: 6752
diff changeset
    25
#include "precompiled.hpp"
50180
ffa644980dff 8202377: Modularize C2 GC barriers
eosterlund
parents: 49816
diff changeset
    26
#include "gc/shared/barrierSet.hpp"
ffa644980dff 8202377: Modularize C2 GC barriers
eosterlund
parents: 49816
diff changeset
    27
#include "gc/shared/c2/barrierSetC2.hpp"
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    28
#include "memory/allocation.inline.hpp"
37248
11a660dbbb8e 8132524: Missing includes to resourceArea.hpp
jprovino
parents: 36309
diff changeset
    29
#include "memory/resourceArea.hpp"
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    30
#include "opto/block.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    31
#include "opto/callnode.hpp"
35574
2b25eb88c8d6 6675699: need comprehensive fix for unconstrained ConvI2L with narrowed type
thartmann
parents: 35545
diff changeset
    32
#include "opto/castnode.hpp"
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    33
#include "opto/cfgnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    34
#include "opto/idealGraphPrinter.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    35
#include "opto/loopnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    36
#include "opto/machnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    37
#include "opto/opcodes.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    38
#include "opto/phaseX.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    39
#include "opto/regalloc.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    40
#include "opto/rootnode.hpp"
50180
ffa644980dff 8202377: Modularize C2 GC barriers
eosterlund
parents: 49816
diff changeset
    41
#include "utilities/macros.hpp"
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
#define NODE_HASH_MINIMUM_SIZE    255
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
//------------------------------NodeHash---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
NodeHash::NodeHash(uint est_max_size) :
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    47
  _a(Thread::current()->resource_area()),
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
  _max( round_up(est_max_size < NODE_HASH_MINIMUM_SIZE ? NODE_HASH_MINIMUM_SIZE : est_max_size) ),
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    49
  _inserts(0), _insert_limit( insert_limit() ),
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    50
  _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ) // (Node**)_a->Amalloc(_max * sizeof(Node*)) ),
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
    51
#ifndef PRODUCT
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    52
  , _grows(0),_look_probes(0), _lookup_hits(0), _lookup_misses(0),
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    53
  _insert_probes(0), _delete_probes(0), _delete_hits(0), _delete_misses(0),
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    54
   _total_inserts(0), _total_insert_probes(0)
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
    55
#endif
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
    56
{
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
  // _sentinel must be in the current node space
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
    58
  _sentinel = new ProjNode(NULL, TypeFunc::Control);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
  memset(_table,0,sizeof(Node*)*_max);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
//------------------------------NodeHash---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
NodeHash::NodeHash(Arena *arena, uint est_max_size) :
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    64
  _a(arena),
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
  _max( round_up(est_max_size < NODE_HASH_MINIMUM_SIZE ? NODE_HASH_MINIMUM_SIZE : est_max_size) ),
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    66
  _inserts(0), _insert_limit( insert_limit() ),
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    67
  _table( NEW_ARENA_ARRAY( _a , Node* , _max ) )
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
    68
#ifndef PRODUCT
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    69
  , _grows(0),_look_probes(0), _lookup_hits(0), _lookup_misses(0),
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    70
  _insert_probes(0), _delete_probes(0), _delete_hits(0), _delete_misses(0),
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
    71
   _total_inserts(0), _total_insert_probes(0)
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
    72
#endif
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
    73
{
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
  // _sentinel must be in the current node space
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
    75
  _sentinel = new ProjNode(NULL, TypeFunc::Control);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
  memset(_table,0,sizeof(Node*)*_max);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
//------------------------------NodeHash---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
NodeHash::NodeHash(NodeHash *nh) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
  debug_only(_table = (Node**)badAddress);   // interact correctly w/ operator=
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
  // just copy in all the fields
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
  *this = *nh;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
  // nh->_sentinel must be in the current node space
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
15113
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14623
diff changeset
    87
void NodeHash::replace_with(NodeHash *nh) {
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14623
diff changeset
    88
  debug_only(_table = (Node**)badAddress);   // interact correctly w/ operator=
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14623
diff changeset
    89
  // just copy in all the fields
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14623
diff changeset
    90
  *this = *nh;
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14623
diff changeset
    91
  // nh->_sentinel must be in the current node space
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14623
diff changeset
    92
}
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14623
diff changeset
    93
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
//------------------------------hash_find--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
// Find in hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
Node *NodeHash::hash_find( const Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
  // ((Node*)n)->set_hash( n->hash() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
  uint hash = n->hash();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
  if (hash == Node::NO_HASH) {
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   100
    NOT_PRODUCT( _lookup_misses++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
  uint key = hash & (_max-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
  uint stride = key | 0x01;
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   105
  NOT_PRODUCT( _look_probes++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
  Node *k = _table[key];        // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
  if( !k ) {                    // ?Miss?
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   108
    NOT_PRODUCT( _lookup_misses++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
    return NULL;                // Miss!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
  int op = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
  uint req = n->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
  while( 1 ) {                  // While probing hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
    if( k->req() == req &&      // Same count of inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
        k->Opcode() == op ) {   // Same Opcode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
      for( uint i=0; i<req; i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
        if( n->in(i)!=k->in(i)) // Different inputs?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
          goto collision;       // "goto" is a speed hack...
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
      if( n->cmp(*k) ) {        // Check for any special bits
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   121
        NOT_PRODUCT( _lookup_hits++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
        return k;               // Hit!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
  collision:
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   126
    NOT_PRODUCT( _look_probes++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
    key = (key + stride/*7*/) & (_max-1); // Stride through table with relative prime
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
    k = _table[key];            // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
    if( !k ) {                  // ?Miss?
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   130
      NOT_PRODUCT( _lookup_misses++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
      return NULL;              // Miss!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
  ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
//------------------------------hash_find_insert-------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
// Find in hash table, insert if not already present
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
// Used to preserve unique entries in hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
Node *NodeHash::hash_find_insert( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
  // n->set_hash( );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
  uint hash = n->hash();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
  if (hash == Node::NO_HASH) {
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   145
    NOT_PRODUCT( _lookup_misses++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
  uint key = hash & (_max-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
  uint stride = key | 0x01;     // stride must be relatively prime to table siz
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
  uint first_sentinel = 0;      // replace a sentinel if seen.
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   151
  NOT_PRODUCT( _look_probes++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
  Node *k = _table[key];        // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
  if( !k ) {                    // ?Miss?
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   154
    NOT_PRODUCT( _lookup_misses++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
    _table[key] = n;            // Insert into table!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
    debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
    check_grow();               // Grow table if insert hit limit
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
    return NULL;                // Miss!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
  else if( k == _sentinel ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
    first_sentinel = key;      // Can insert here
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
  int op = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
  uint req = n->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
  while( 1 ) {                  // While probing hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
    if( k->req() == req &&      // Same count of inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
        k->Opcode() == op ) {   // Same Opcode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
      for( uint i=0; i<req; i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
        if( n->in(i)!=k->in(i)) // Different inputs?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
          goto collision;       // "goto" is a speed hack...
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
      if( n->cmp(*k) ) {        // Check for any special bits
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   173
        NOT_PRODUCT( _lookup_hits++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
        return k;               // Hit!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
  collision:
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   178
    NOT_PRODUCT( _look_probes++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   179
    key = (key + stride) & (_max-1); // Stride through table w/ relative prime
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
    k = _table[key];            // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
    if( !k ) {                  // ?Miss?
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   182
      NOT_PRODUCT( _lookup_misses++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
      key = (first_sentinel == 0) ? key : first_sentinel; // ?saw sentinel?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
      _table[key] = n;          // Insert into table!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
      debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
      check_grow();             // Grow table if insert hit limit
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
      return NULL;              // Miss!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
    else if( first_sentinel == 0 && k == _sentinel ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
      first_sentinel = key;    // Can insert here
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
  ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
//------------------------------hash_insert------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
// Insert into hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
void NodeHash::hash_insert( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
  // // "conflict" comments -- print nodes that conflict
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
  // bool conflict = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
  // n->set_hash();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
  uint hash = n->hash();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
  if (hash == Node::NO_HASH) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
  check_grow();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
  uint key = hash & (_max-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
  uint stride = key | 0x01;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
  while( 1 ) {                  // While probing hash table
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   213
    NOT_PRODUCT( _insert_probes++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
    Node *k = _table[key];      // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
    if( !k || (k == _sentinel) ) break;       // Found a slot
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
    assert( k != n, "already inserted" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
    // if( PrintCompilation && PrintOptoStatistics && Verbose ) { tty->print("  conflict: "); k->dump(); conflict = true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
    key = (key + stride) & (_max-1); // Stride through table w/ relative prime
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
  _table[key] = n;              // Insert into table!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   221
  debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
  // if( conflict ) { n->dump(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
//------------------------------hash_delete------------------------------------
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1067
diff changeset
   226
// Replace in hash table with sentinel
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
bool NodeHash::hash_delete( const Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
  Node *k;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
  uint hash = n->hash();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
  if (hash == Node::NO_HASH) {
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   231
    NOT_PRODUCT( _delete_misses++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   232
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   233
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
  uint key = hash & (_max-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
  uint stride = key | 0x01;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
  debug_only( uint counter = 0; );
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1067
diff changeset
   237
  for( ; /* (k != NULL) && (k != _sentinel) */; ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
    debug_only( counter++ );
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   239
    NOT_PRODUCT( _delete_probes++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
    k = _table[key];            // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   241
    if( !k ) {                  // Miss?
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   242
      NOT_PRODUCT( _delete_misses++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   243
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   244
      if( VerifyOpto ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
        for( uint i=0; i < _max; i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   246
          assert( _table[i] != n, "changed edges with rehashing" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   248
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   249
      return false;             // Miss! Not in chain
489c9b5090e2 Initial load
duke
parents:
diff changeset
   250
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
    else if( n == k ) {
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   252
      NOT_PRODUCT( _delete_hits++ );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   253
      _table[key] = _sentinel;  // Hit! Label as deleted entry
489c9b5090e2 Initial load
duke
parents:
diff changeset
   254
      debug_only(((Node*)n)->exit_hash_lock()); // Unlock the node upon removal from table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   255
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
    else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
      // collision: move through table with prime offset
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
      key = (key + stride/*7*/) & (_max-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
      assert( counter <= _insert_limit, "Cycle in hash-table");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   262
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
  ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   264
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
//------------------------------round_up---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
// Round up to nearest power of 2
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
uint NodeHash::round_up( uint x ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
  x += (x>>2);                  // Add 25% slop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
  if( x <16 ) return 16;        // Small stuff
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
  uint i=16;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
  while( i < x ) i <<= 1;       // Double to fit
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
  return i;                     // Return hash table size
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
//------------------------------grow-------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
// Grow _table to next power of 2 and insert old entries
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
void  NodeHash::grow() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
  // Record old state
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
  uint   old_max   = _max;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
  Node **old_table = _table;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
  // Construct new table with twice the space
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   284
#ifndef PRODUCT
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
  _grows++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
  _total_inserts       += _inserts;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
  _total_insert_probes += _insert_probes;
26429
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   288
  _insert_probes   = 0;
c5ca44ee3ce2 8056067: NodeHash debug variables are available in product build
thartmann
parents: 25930
diff changeset
   289
#endif
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
  _inserts         = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
  _max     = _max << 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
  _table   = NEW_ARENA_ARRAY( _a , Node* , _max ); // (Node**)_a->Amalloc( _max * sizeof(Node*) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
  memset(_table,0,sizeof(Node*)*_max);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
  _insert_limit = insert_limit();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
  // Insert old entries into the new table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
  for( uint i = 0; i < old_max; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
    Node *m = *old_table++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
    if( !m || m == _sentinel ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
    debug_only(m->exit_hash_lock()); // Unlock the node upon removal from old table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
    hash_insert(m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   303
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
//------------------------------clear------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
// Clear all entries in _table to NULL but keep storage
489c9b5090e2 Initial load
duke
parents:
diff changeset
   306
void  NodeHash::clear() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
  // Unlock all nodes upon removal from table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
  for (uint i = 0; i < _max; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
    Node* n = _table[i];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
    if (!n || n == _sentinel)  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
    n->exit_hash_lock();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   313
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
489c9b5090e2 Initial load
duke
parents:
diff changeset
   316
  memset( _table, 0, _max * sizeof(Node*) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
//-----------------------remove_useless_nodes----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
// Remove useless nodes from value table,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
// implementation does not depend on hash function
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
void NodeHash::remove_useless_nodes(VectorSet &useful) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
  // Dead nodes in the hash table inherited from GVN should not replace
489c9b5090e2 Initial load
duke
parents:
diff changeset
   325
  // existing nodes, remove dead nodes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   326
  uint max = size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
  Node *sentinel_node = sentinel();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
  for( uint i = 0; i < max; ++i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
    Node *n = at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
    if(n != NULL && n != sentinel_node && !useful.test(n->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
      debug_only(n->exit_hash_lock()); // Unlock the node when removed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
      _table[i] = sentinel_node;       // Replace with placeholder
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
22799
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   337
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   338
void NodeHash::check_no_speculative_types() {
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   339
#ifdef ASSERT
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   340
  uint max = size();
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   341
  Node *sentinel_node = sentinel();
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   342
  for (uint i = 0; i < max; ++i) {
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   343
    Node *n = at(i);
23525
e3eb08ead679 8031755: Type speculation should be used to optimize explicit null checks
roland
parents: 22799
diff changeset
   344
    if(n != NULL && n != sentinel_node && n->is_Type() && n->outcnt() > 0) {
22799
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   345
      TypeNode* tn = n->as_Type();
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   346
      const Type* t = tn->type();
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   347
      const Type* t_no_spec = t->remove_speculative();
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   348
      assert(t == t_no_spec, "dead node in hash table or missed node during speculative cleanup");
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   349
    }
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   350
  }
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   351
#endif
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   352
}
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
   353
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
//------------------------------dump-------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
// Dump statistics for the hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
void NodeHash::dump() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
  _total_inserts       += _inserts;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
  _total_insert_probes += _insert_probes;
10988
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10563
diff changeset
   360
  if (PrintCompilation && PrintOptoStatistics && Verbose && (_inserts > 0)) {
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10563
diff changeset
   361
    if (WizardMode) {
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10563
diff changeset
   362
      for (uint i=0; i<_max; i++) {
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10563
diff changeset
   363
        if (_table[i])
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10563
diff changeset
   364
          tty->print("%d/%d/%d ",i,_table[i]->hash()&(_max-1),_table[i]->_idx);
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10563
diff changeset
   365
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
    tty->print("\nGVN Hash stats:  %d grows to %d max_size\n", _grows, _max);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
    tty->print("  %d/%d (%8.1f%% full)\n", _inserts, _max, (double)_inserts/_max*100.0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
    tty->print("  %dp/(%dh+%dm) (%8.2f probes/lookup)\n", _look_probes, _lookup_hits, _lookup_misses, (double)_look_probes/(_lookup_hits+_lookup_misses));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
    tty->print("  %dp/%di (%8.2f probes/insert)\n", _total_insert_probes, _total_inserts, (double)_total_insert_probes/_total_inserts);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
    // sentinels increase lookup cost, but not insert cost
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
    assert((_lookup_misses+_lookup_hits)*4+100 >= _look_probes, "bad hash function");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
    assert( _inserts+(_inserts>>3) < _max, "table too full" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   374
    assert( _inserts*3+100 >= _insert_probes, "bad hash function" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
Node *NodeHash::find_index(uint idx) { // For debugging
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
  // Find an entry by its index value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   380
  for( uint i = 0; i < _max; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
    Node *m = _table[i];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
    if( !m || m == _sentinel ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
    if( m->_idx == (uint)idx ) return m;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   387
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
NodeHash::~NodeHash() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   391
  // Unlock all nodes upon destruction of table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
  if (_table != (Node**)badAddress)  clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
489c9b5090e2 Initial load
duke
parents:
diff changeset
   395
void NodeHash::operator=(const NodeHash& nh) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   396
  // Unlock all nodes upon replacement of table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
  if (&nh == this)  return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   398
  if (_table != (Node**)badAddress)  clear();
46630
75aa3e39d02c 8182299: Enable disabled clang warnings, build on OSX 10 + Xcode 8
jwilhelm
parents: 40871
diff changeset
   399
  memcpy((void*)this, (void*)&nh, sizeof(*this));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
  // Do not increment hash_lock counts again.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
  // Instead, be sure we never again use the source table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
  ((NodeHash*)&nh)->_table = (Node**)badAddress;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
//------------------------------PhaseRemoveUseless-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
// 1) Use a breadthfirst walk to collect useful nodes reachable from root.
34503
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   412
PhaseRemoveUseless::PhaseRemoveUseless(PhaseGVN *gvn, Unique_Node_List *worklist, PhaseNumber phase_num) : Phase(phase_num),
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
  _useful(Thread::current()->resource_area()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
  // Implementation requires 'UseLoopSafepoints == true' and an edge from root
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
  // to each SafePointNode at a backward branch.  Inserted in add_safepoint().
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
  if( !UseLoopSafepoints || !OptoRemoveUseless ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
  // Identify nodes that are reachable from below, useful.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   420
  C->identify_useful_nodes(_useful);
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 13963
diff changeset
   421
  // Update dead node list
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 13963
diff changeset
   422
  C->update_dead_node_list(_useful);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   423
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
  // Remove all useless nodes from PhaseValues' recorded types
489c9b5090e2 Initial load
duke
parents:
diff changeset
   425
  // Must be done before disconnecting nodes to preserve hash-table-invariant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   426
  gvn->remove_useless_nodes(_useful.member_set());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   427
489c9b5090e2 Initial load
duke
parents:
diff changeset
   428
  // Remove all useless nodes from future worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   429
  worklist->remove_useless_nodes(_useful.member_set());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   430
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
  // Disconnect 'useless' nodes that are adjacent to useful nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   432
  C->remove_useless_nodes(_useful);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   433
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
  // Remove edges from "root" to each SafePoint at a backward branch.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
  // They were inserted during parsing (see add_safepoint()) to make infinite
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
  // loops without calls or exceptions visible to root, i.e., useful.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
  Node *root = C->root();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
  if( root != NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
    for( uint i = root->req(); i < root->len(); ++i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
      Node *n = root->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   441
      if( n != NULL && n->is_SafePoint() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   442
        root->rm_prec(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
        --i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
34503
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   449
//=============================================================================
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   450
//------------------------------PhaseRenumberLive------------------------------
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   451
// First, remove useless nodes (equivalent to identifying live nodes).
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   452
// Then, renumber live nodes.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   453
//
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   454
// The set of live nodes is returned by PhaseRemoveUseless in the _useful structure.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   455
// If the number of live nodes is 'x' (where 'x' == _useful.size()), then the
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   456
// PhaseRenumberLive updates the node ID of each node (the _idx field) with a unique
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   457
// value in the range [0, x).
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   458
//
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   459
// At the end of the PhaseRenumberLive phase, the compiler's count of unique nodes is
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   460
// updated to 'x' and the list of dead nodes is reset (as there are no dead nodes).
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   461
//
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   462
// The PhaseRenumberLive phase updates two data structures with the new node IDs.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   463
// (1) The worklist is used by the PhaseIterGVN phase to identify nodes that must be
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   464
// processed. A new worklist (with the updated node IDs) is returned in 'new_worklist'.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   465
// (2) Type information (the field PhaseGVN::_types) maps type information to each
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   466
// node ID. The mapping is updated to use the new node IDs as well. Updated type
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   467
// information is returned in PhaseGVN::_types.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   468
//
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   469
// The PhaseRenumberLive phase does not preserve the order of elements in the worklist.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   470
//
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   471
// Other data structures used by the compiler are not updated. The hash table for value
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   472
// numbering (the field PhaseGVN::_table) is not updated because computing the hash
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   473
// values is not based on node IDs. The field PhaseGVN::_nodes is not updated either
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   474
// because it is empty wherever PhaseRenumberLive is used.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   475
PhaseRenumberLive::PhaseRenumberLive(PhaseGVN* gvn,
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   476
                                     Unique_Node_List* worklist, Unique_Node_List* new_worklist,
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   477
                                     PhaseNumber phase_num) :
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   478
  PhaseRemoveUseless(gvn, worklist, Remove_Useless_And_Renumber_Live) {
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   479
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   480
  assert(RenumberLiveNodes, "RenumberLiveNodes must be set to true for node renumbering to take place");
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   481
  assert(C->live_nodes() == _useful.size(), "the number of live nodes must match the number of useful nodes");
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   482
  assert(gvn->nodes_size() == 0, "GVN must not contain any nodes at this point");
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   483
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   484
  uint old_unique_count = C->unique();
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   485
  uint live_node_count = C->live_nodes();
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   486
  uint worklist_size = worklist->size();
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   487
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   488
  // Storage for the updated type information.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   489
  Type_Array new_type_array(C->comp_arena());
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   490
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   491
  // Iterate over the set of live nodes.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   492
  uint current_idx = 0; // The current new node ID. Incremented after every assignment.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   493
  for (uint i = 0; i < _useful.size(); i++) {
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   494
    Node* n = _useful.at(i);
40871
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
   495
    // Sanity check that fails if we ever decide to execute this phase after EA
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
   496
    assert(!n->is_Phi() || n->as_Phi()->inst_mem_id() == -1, "should not be linked to data Phi");
34503
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   497
    const Type* type = gvn->type_or_null(n);
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   498
    new_type_array.map(current_idx, type);
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   499
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   500
    bool in_worklist = false;
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   501
    if (worklist->member(n)) {
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   502
      in_worklist = true;
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   503
    }
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   504
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   505
    n->set_idx(current_idx); // Update node ID.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   506
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   507
    if (in_worklist) {
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   508
      new_worklist->push(n);
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   509
    }
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   510
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   511
    current_idx++;
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   512
  }
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   513
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   514
  assert(worklist_size == new_worklist->size(), "the new worklist must have the same size as the original worklist");
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   515
  assert(live_node_count == current_idx, "all live nodes must be processed");
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   516
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   517
  // Replace the compiler's type information with the updated type information.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   518
  gvn->replace_types(new_type_array);
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   519
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   520
  // Update the unique node count of the compilation to the number of currently live nodes.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   521
  C->set_unique(live_node_count);
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   522
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   523
  // Set the dead node count to 0 and reset dead node list.
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   524
  C->reset_dead_node_list();
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   525
}
57d1a0e76091 8129847: Compiling methods generated by Nashorn triggers high memory usage in C2
zmajo
parents: 32202
diff changeset
   526
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
//------------------------------PhaseTransform---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
PhaseTransform::PhaseTransform( PhaseNumber pnum ) : Phase(pnum),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
  _arena(Thread::current()->resource_area()),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
  _nodes(_arena),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
  _types(_arena)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
  init_con_caches();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  clear_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
  clear_transforms();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
  set_allow_progress(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
  // Force allocation for currently existing nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
  _types.map(C->unique(), NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   543
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   544
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
//------------------------------PhaseTransform---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
PhaseTransform::PhaseTransform( Arena *arena, PhaseNumber pnum ) : Phase(pnum),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
  _arena(arena),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   548
  _nodes(arena),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
  _types(arena)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
  init_con_caches();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   553
  clear_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   554
  clear_transforms();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
  set_allow_progress(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   557
  // Force allocation for currently existing nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   558
  _types.map(C->unique(), NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   559
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
//------------------------------PhaseTransform---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   562
// Initialize with previously generated type information
489c9b5090e2 Initial load
duke
parents:
diff changeset
   563
PhaseTransform::PhaseTransform( PhaseTransform *pt, PhaseNumber pnum ) : Phase(pnum),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   564
  _arena(pt->_arena),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   565
  _nodes(pt->_nodes),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
  _types(pt->_types)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
  init_con_caches();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   569
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
  clear_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
  clear_transforms();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
  set_allow_progress(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   574
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   575
489c9b5090e2 Initial load
duke
parents:
diff changeset
   576
void PhaseTransform::init_con_caches() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
  memset(_icons,0,sizeof(_icons));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   578
  memset(_lcons,0,sizeof(_lcons));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   579
  memset(_zcons,0,sizeof(_zcons));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
489c9b5090e2 Initial load
duke
parents:
diff changeset
   583
//--------------------------------find_int_type--------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
const TypeInt* PhaseTransform::find_int_type(Node* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
  if (n == NULL)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   586
  // Call type_or_null(n) to determine node's type since we might be in
489c9b5090e2 Initial load
duke
parents:
diff changeset
   587
  // parse phase and call n->Value() may return wrong type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
  // (For example, a phi node at the beginning of loop parsing is not ready.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   589
  const Type* t = type_or_null(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   590
  if (t == NULL)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   591
  return t->isa_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
//-------------------------------find_long_type--------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
const TypeLong* PhaseTransform::find_long_type(Node* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
  if (n == NULL)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
  // (See comment above on type_or_null.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
  const Type* t = type_or_null(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
  if (t == NULL)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
  return t->isa_long();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
489c9b5090e2 Initial load
duke
parents:
diff changeset
   605
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
void PhaseTransform::dump_old2new_map() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
  _nodes.dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   609
489c9b5090e2 Initial load
duke
parents:
diff changeset
   610
void PhaseTransform::dump_new( uint nidx ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   611
  for( uint i=0; i<_nodes.Size(); i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   612
    if( _nodes[i] && _nodes[i]->_idx == nidx ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   613
      _nodes[i]->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   614
      tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   615
      tty->print_cr("Old index= %d",i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   616
      return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   617
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   618
  tty->print_cr("Node %d not found in the new indices", nidx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   619
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   620
489c9b5090e2 Initial load
duke
parents:
diff changeset
   621
//------------------------------dump_types-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   622
void PhaseTransform::dump_types( ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   623
  _types.dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   624
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   625
489c9b5090e2 Initial load
duke
parents:
diff changeset
   626
//------------------------------dump_nodes_and_types---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   627
void PhaseTransform::dump_nodes_and_types(const Node *root, uint depth, bool only_ctrl) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   628
  VectorSet visited(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   629
  dump_nodes_and_types_recur( root, depth, only_ctrl, visited );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   630
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   631
489c9b5090e2 Initial load
duke
parents:
diff changeset
   632
//------------------------------dump_nodes_and_types_recur---------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   633
void PhaseTransform::dump_nodes_and_types_recur( const Node *n, uint depth, bool only_ctrl, VectorSet &visited) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   634
  if( !n ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   635
  if( depth == 0 ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   636
  if( visited.test_set(n->_idx) ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   637
  for( uint i=0; i<n->len(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   638
    if( only_ctrl && !(n->is_Region()) && i != TypeFunc::Control ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   639
    dump_nodes_and_types_recur( n->in(i), depth-1, only_ctrl, visited );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   640
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   641
  n->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   642
  if (type_or_null(n) != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   643
    tty->print("      "); type(n)->dump(); tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   644
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   645
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   646
489c9b5090e2 Initial load
duke
parents:
diff changeset
   647
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   648
489c9b5090e2 Initial load
duke
parents:
diff changeset
   649
489c9b5090e2 Initial load
duke
parents:
diff changeset
   650
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   651
//------------------------------PhaseValues------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   652
// Set minimum table size to "255"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   653
PhaseValues::PhaseValues( Arena *arena, uint est_max_size ) : PhaseTransform(arena, GVN), _table(arena, est_max_size) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   654
  NOT_PRODUCT( clear_new_values(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   655
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   656
489c9b5090e2 Initial load
duke
parents:
diff changeset
   657
//------------------------------PhaseValues------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   658
// Set minimum table size to "255"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   659
PhaseValues::PhaseValues( PhaseValues *ptv ) : PhaseTransform( ptv, GVN ),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   660
  _table(&ptv->_table) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   661
  NOT_PRODUCT( clear_new_values(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   662
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   663
489c9b5090e2 Initial load
duke
parents:
diff changeset
   664
//------------------------------PhaseValues------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   665
// Used by +VerifyOpto.  Clear out hash table but copy _types array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   666
PhaseValues::PhaseValues( PhaseValues *ptv, const char *dummy ) : PhaseTransform( ptv, GVN ),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   667
  _table(ptv->arena(),ptv->_table.size()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   668
  NOT_PRODUCT( clear_new_values(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   669
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   670
489c9b5090e2 Initial load
duke
parents:
diff changeset
   671
//------------------------------~PhaseValues-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   672
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   673
PhaseValues::~PhaseValues() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   674
  _table.dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   675
489c9b5090e2 Initial load
duke
parents:
diff changeset
   676
  // Statistics for value progress and efficiency
489c9b5090e2 Initial load
duke
parents:
diff changeset
   677
  if( PrintCompilation && Verbose && WizardMode ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   678
    tty->print("\n%sValues: %d nodes ---> %d/%d (%d)",
489c9b5090e2 Initial load
duke
parents:
diff changeset
   679
      is_IterGVN() ? "Iter" : "    ", C->unique(), made_progress(), made_transforms(), made_new_values());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   680
    if( made_transforms() != 0 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   681
      tty->print_cr("  ratio %f", made_progress()/(float)made_transforms() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   682
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   683
      tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   684
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   685
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   686
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   687
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   688
489c9b5090e2 Initial load
duke
parents:
diff changeset
   689
//------------------------------makecon----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   690
ConNode* PhaseTransform::makecon(const Type *t) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   691
  assert(t->singleton(), "must be a constant");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   692
  assert(!t->empty() || t == Type::TOP, "must not be vacuous range");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   693
  switch (t->base()) {  // fast paths
489c9b5090e2 Initial load
duke
parents:
diff changeset
   694
  case Type::Half:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   695
  case Type::Top:  return (ConNode*) C->top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   696
  case Type::Int:  return intcon( t->is_int()->get_con() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   697
  case Type::Long: return longcon( t->is_long()->get_con() );
46630
75aa3e39d02c 8182299: Enable disabled clang warnings, build on OSX 10 + Xcode 8
jwilhelm
parents: 40871
diff changeset
   698
  default:         break;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   699
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   700
  if (t->is_zero_type())
489c9b5090e2 Initial load
duke
parents:
diff changeset
   701
    return zerocon(t->basic_type());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   702
  return uncached_makecon(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   703
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   704
489c9b5090e2 Initial load
duke
parents:
diff changeset
   705
//--------------------------uncached_makecon-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   706
// Make an idealized constant - one of ConINode, ConPNode, etc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   707
ConNode* PhaseValues::uncached_makecon(const Type *t) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   708
  assert(t->singleton(), "must be a constant");
25930
eae8b7490d2c 8054033: Remove unused references to Compile*
thartmann
parents: 25913
diff changeset
   709
  ConNode* x = ConNode::make(t);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   710
  ConNode* k = (ConNode*)hash_find_insert(x); // Value numbering
489c9b5090e2 Initial load
duke
parents:
diff changeset
   711
  if (k == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   712
    set_type(x, t);             // Missed, provide type mapping
489c9b5090e2 Initial load
duke
parents:
diff changeset
   713
    GrowableArray<Node_Notes*>* nna = C->node_note_array();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   714
    if (nna != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   715
      Node_Notes* loc = C->locate_node_notes(nna, x->_idx, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   716
      loc->clear(); // do not put debug info on constants
489c9b5090e2 Initial load
duke
parents:
diff changeset
   717
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   718
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   719
    x->destruct();              // Hit, destroy duplicate constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   720
    x = k;                      // use existing constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   721
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   722
  return x;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   723
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   724
489c9b5090e2 Initial load
duke
parents:
diff changeset
   725
//------------------------------intcon-----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   726
// Fast integer constant.  Same as "transform(new ConINode(TypeInt::make(i)))"
47765
b7c7428eaab9 8189610: Reconcile jvm.h and all jvm_md.h between java.base and hotspot
coleenp
parents: 47693
diff changeset
   727
ConINode* PhaseTransform::intcon(jint i) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   728
  // Small integer?  Check cache! Check that cached node is not dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   729
  if (i >= _icon_min && i <= _icon_max) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   730
    ConINode* icon = _icons[i-_icon_min];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   731
    if (icon != NULL && icon->in(TypeFunc::Control) != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   732
      return icon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   733
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   734
  ConINode* icon = (ConINode*) uncached_makecon(TypeInt::make(i));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   735
  assert(icon->is_Con(), "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   736
  if (i >= _icon_min && i <= _icon_max)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   737
    _icons[i-_icon_min] = icon;   // Cache small integers
489c9b5090e2 Initial load
duke
parents:
diff changeset
   738
  return icon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   739
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   740
489c9b5090e2 Initial load
duke
parents:
diff changeset
   741
//------------------------------longcon----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   742
// Fast long constant.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   743
ConLNode* PhaseTransform::longcon(jlong l) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   744
  // Small integer?  Check cache! Check that cached node is not dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   745
  if (l >= _lcon_min && l <= _lcon_max) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   746
    ConLNode* lcon = _lcons[l-_lcon_min];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   747
    if (lcon != NULL && lcon->in(TypeFunc::Control) != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   748
      return lcon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   749
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   750
  ConLNode* lcon = (ConLNode*) uncached_makecon(TypeLong::make(l));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   751
  assert(lcon->is_Con(), "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   752
  if (l >= _lcon_min && l <= _lcon_max)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   753
    _lcons[l-_lcon_min] = lcon;      // Cache small integers
489c9b5090e2 Initial load
duke
parents:
diff changeset
   754
  return lcon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   756
489c9b5090e2 Initial load
duke
parents:
diff changeset
   757
//------------------------------zerocon-----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   758
// Fast zero or null constant. Same as "transform(ConNode::make(Type::get_zero_type(bt)))"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   759
ConNode* PhaseTransform::zerocon(BasicType bt) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
  assert((uint)bt <= _zcon_max, "domain check");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
  ConNode* zcon = _zcons[bt];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   762
  if (zcon != NULL && zcon->in(TypeFunc::Control) != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   763
    return zcon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   764
  zcon = (ConNode*) uncached_makecon(Type::get_zero_type(bt));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   765
  _zcons[bt] = zcon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   766
  return zcon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   767
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   768
489c9b5090e2 Initial load
duke
parents:
diff changeset
   769
489c9b5090e2 Initial load
duke
parents:
diff changeset
   770
489c9b5090e2 Initial load
duke
parents:
diff changeset
   771
//=============================================================================
52429
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   772
Node* PhaseGVN::apply_ideal(Node* k, bool can_reshape) {
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   773
  Node* i = BarrierSet::barrier_set()->barrier_set_c2()->ideal_node(this, k, can_reshape);
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   774
  if (i == NULL) {
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   775
    i = k->Ideal(this, can_reshape);
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   776
  }
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   777
  return i;
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   778
}
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   779
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   780
Node* PhaseGVN::apply_identity(Node* k) {
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   781
  Node* i = BarrierSet::barrier_set()->barrier_set_c2()->identity_node(this, k);
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   782
  if (i == k) {
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   783
    i = k->Identity(this);
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   784
  }
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   785
  return i;
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   786
}
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   787
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
//------------------------------transform--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
// Return a node which computes the same function as this node, but in a
214
c5d9b4456687 6667605: (Escape Analysis) inline java constructors when EA is on
kvn
parents: 1
diff changeset
   790
// faster or cheaper fashion.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
Node *PhaseGVN::transform( Node *n ) {
214
c5d9b4456687 6667605: (Escape Analysis) inline java constructors when EA is on
kvn
parents: 1
diff changeset
   792
  return transform_no_reclaim(n);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
//------------------------------transform--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
// Return a node which computes the same function as this node, but
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
// in a faster or cheaper fashion.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   798
Node *PhaseGVN::transform_no_reclaim( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   799
  NOT_PRODUCT( set_transforms(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   800
489c9b5090e2 Initial load
duke
parents:
diff changeset
   801
  // Apply the Ideal call in a loop until it no longer applies
489c9b5090e2 Initial load
duke
parents:
diff changeset
   802
  Node *k = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   803
  NOT_PRODUCT( uint loop_count = 0; )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   804
  while( 1 ) {
52429
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   805
    Node *i = apply_ideal(k, /*can_reshape=*/false);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
    if( !i ) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   807
    assert( i->_idx >= k->_idx, "Idealize should return new nodes, use Identity to return old nodes" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
    k = i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   809
    assert(loop_count++ < K, "infinite loop in PhaseGVN::transform");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   810
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   811
  NOT_PRODUCT( if( loop_count != 0 ) { set_progress(); } )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   812
489c9b5090e2 Initial load
duke
parents:
diff changeset
   813
489c9b5090e2 Initial load
duke
parents:
diff changeset
   814
  // If brand new node, make space in type array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
  ensure_type_or_null(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
  // Since I just called 'Value' to compute the set of run-time values
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
  // for this Node, and 'Value' is non-local (and therefore expensive) I'll
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
  // cache Value.  Later requests for the local phase->type of this Node can
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
  // use the cached Value instead of suffering with 'bottom_type'.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
  const Type *t = k->Value(this); // Get runtime Value set
489c9b5090e2 Initial load
duke
parents:
diff changeset
   822
  assert(t != NULL, "value sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   823
  if (type_or_null(k) != t) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   824
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   825
    // Do not count initial visit to node as a transformation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   826
    if (type_or_null(k) == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   827
      inc_new_values();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   828
      set_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   829
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   830
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   831
    set_type(k, t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   832
    // If k is a TypeNode, capture any more-precise type permanently into Node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   833
    k->raise_bottom_type(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   834
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   835
489c9b5090e2 Initial load
duke
parents:
diff changeset
   836
  if( t->singleton() && !k->is_Con() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   837
    NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   838
    return makecon(t);          // Turn into a constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   839
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   840
489c9b5090e2 Initial load
duke
parents:
diff changeset
   841
  // Now check for Identities
52429
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
   842
  Node *i = apply_identity(k);  // Look for a nearby replacement
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   843
  if( i != k ) {                // Found? Return replacement!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   844
    NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   845
    return i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   846
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   847
489c9b5090e2 Initial load
duke
parents:
diff changeset
   848
  // Global Value Numbering
489c9b5090e2 Initial load
duke
parents:
diff changeset
   849
  i = hash_find_insert(k);      // Insert if new
489c9b5090e2 Initial load
duke
parents:
diff changeset
   850
  if( i && (i != k) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   851
    // Return the pre-existing node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   852
    NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   853
    return i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   854
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   855
489c9b5090e2 Initial load
duke
parents:
diff changeset
   856
  // Return Idealized original
489c9b5090e2 Initial load
duke
parents:
diff changeset
   857
  return k;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   858
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   859
35545
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   860
bool PhaseGVN::is_dominator_helper(Node *d, Node *n, bool linear_only) {
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   861
  if (d->is_top() || n->is_top()) {
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   862
    return false;
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   863
  }
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   864
  assert(d->is_CFG() && n->is_CFG(), "must have CFG nodes");
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   865
  int i = 0;
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   866
  while (d != n) {
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   867
    n = IfNode::up_one_dom(n, linear_only);
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   868
    i++;
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   869
    if (n == NULL || i >= 10) {
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   870
      return false;
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   871
    }
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   872
  }
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   873
  return true;
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   874
}
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
   875
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   876
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   877
//------------------------------dead_loop_check--------------------------------
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1067
diff changeset
   878
// Check for a simple dead loop when a data node references itself directly
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   879
// or through an other data node excluding cons and phis.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   880
void PhaseGVN::dead_loop_check( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   881
  // Phi may reference itself in a loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   882
  if (n != NULL && !n->is_dead_loop_safe() && !n->is_CFG()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   883
    // Do 2 levels check and only data inputs.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   884
    bool no_dead_loop = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   885
    uint cnt = n->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
    for (uint i = 1; i < cnt && no_dead_loop; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   887
      Node *in = n->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   888
      if (in == n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   889
        no_dead_loop = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   890
      } else if (in != NULL && !in->is_dead_loop_safe()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   891
        uint icnt = in->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   892
        for (uint j = 1; j < icnt && no_dead_loop; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   893
          if (in->in(j) == n || in->in(j) == in)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   894
            no_dead_loop = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   898
    if (!no_dead_loop) n->dump(3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
    assert(no_dead_loop, "dead loop detected");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   900
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   901
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   902
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   903
489c9b5090e2 Initial load
duke
parents:
diff changeset
   904
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   905
//------------------------------PhaseIterGVN-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   906
// Initialize hash table to fresh and clean for +VerifyOpto
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
   907
PhaseIterGVN::PhaseIterGVN( PhaseIterGVN *igvn, const char *dummy ) : PhaseGVN(igvn,dummy),
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
   908
                                                                      _delay_transform(false),
32202
7e7ad8b06f5b 8011858: Use Compile::live_nodes() instead of Compile::unique() in appropriate places
kvn
parents: 31039
diff changeset
   909
                                                                      _stack(C->live_nodes() >> 1),
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
   910
                                                                      _worklist( ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   911
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   912
489c9b5090e2 Initial load
duke
parents:
diff changeset
   913
//------------------------------PhaseIterGVN-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   914
// Initialize with previous PhaseIterGVN info; used by PhaseCCP
489c9b5090e2 Initial load
duke
parents:
diff changeset
   915
PhaseIterGVN::PhaseIterGVN( PhaseIterGVN *igvn ) : PhaseGVN(igvn),
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
   916
                                                   _delay_transform(igvn->_delay_transform),
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
   917
                                                   _stack( igvn->_stack ),
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
   918
                                                   _worklist( igvn->_worklist )
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   919
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   920
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   921
489c9b5090e2 Initial load
duke
parents:
diff changeset
   922
//------------------------------PhaseIterGVN-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   923
// Initialize with previous PhaseGVN info from Parser
489c9b5090e2 Initial load
duke
parents:
diff changeset
   924
PhaseIterGVN::PhaseIterGVN( PhaseGVN *gvn ) : PhaseGVN(gvn),
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
   925
                                              _delay_transform(false),
32202
7e7ad8b06f5b 8011858: Use Compile::live_nodes() instead of Compile::unique() in appropriate places
kvn
parents: 31039
diff changeset
   926
// TODO: Before incremental inlining it was allocated only once and it was fine. Now that
7e7ad8b06f5b 8011858: Use Compile::live_nodes() instead of Compile::unique() in appropriate places
kvn
parents: 31039
diff changeset
   927
//       the constructor is used in incremental inlining, this consumes too much memory:
7e7ad8b06f5b 8011858: Use Compile::live_nodes() instead of Compile::unique() in appropriate places
kvn
parents: 31039
diff changeset
   928
//                                            _stack(C->live_nodes() >> 1),
7e7ad8b06f5b 8011858: Use Compile::live_nodes() instead of Compile::unique() in appropriate places
kvn
parents: 31039
diff changeset
   929
//       So, as a band-aid, we replace this by:
7e7ad8b06f5b 8011858: Use Compile::live_nodes() instead of Compile::unique() in appropriate places
kvn
parents: 31039
diff changeset
   930
                                              _stack(C->comp_arena(), 32),
51333
f6641fcf7b7e 8208670: Compiler changes to allow enabling -Wreorder
tschatzl
parents: 50180
diff changeset
   931
                                              _worklist(*C->for_igvn())
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   932
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   933
  uint max;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   934
489c9b5090e2 Initial load
duke
parents:
diff changeset
   935
  // Dead nodes in the hash table inherited from GVN were not treated as
489c9b5090e2 Initial load
duke
parents:
diff changeset
   936
  // roots during def-use info creation; hence they represent an invisible
489c9b5090e2 Initial load
duke
parents:
diff changeset
   937
  // use.  Clear them out.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   938
  max = _table.size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   939
  for( uint i = 0; i < max; ++i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   940
    Node *n = _table.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   941
    if(n != NULL && n != _table.sentinel() && n->outcnt() == 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   942
      if( n->is_top() ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   943
      assert( false, "Parse::remove_useless_nodes missed this node");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   944
      hash_delete(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   945
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   946
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   947
489c9b5090e2 Initial load
duke
parents:
diff changeset
   948
  // Any Phis or Regions on the worklist probably had uses that could not
489c9b5090e2 Initial load
duke
parents:
diff changeset
   949
  // make more progress because the uses were made while the Phis and Regions
489c9b5090e2 Initial load
duke
parents:
diff changeset
   950
  // were in half-built states.  Put all uses of Phis and Regions on worklist.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   951
  max = _worklist.size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   952
  for( uint j = 0; j < max; j++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   953
    Node *n = _worklist.at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   954
    uint uop = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   955
    if( uop == Op_Phi || uop == Op_Region ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   956
        n->is_Type() ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   957
        n->is_Mem() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   958
      add_users_to_worklist(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   959
  }
50180
ffa644980dff 8202377: Modularize C2 GC barriers
eosterlund
parents: 49816
diff changeset
   960
ffa644980dff 8202377: Modularize C2 GC barriers
eosterlund
parents: 49816
diff changeset
   961
  BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
ffa644980dff 8202377: Modularize C2 GC barriers
eosterlund
parents: 49816
diff changeset
   962
  bs->add_users_to_worklist(&_worklist);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   963
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   964
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   965
/**
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   966
 * Initialize worklist for each node.
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   967
 */
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   968
void PhaseIterGVN::init_worklist(Node* first) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   969
  Unique_Node_List to_process;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   970
  to_process.push(first);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   971
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   972
  while (to_process.size() > 0) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   973
    Node* n = to_process.pop();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   974
    if (!_worklist.member(n)) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   975
      _worklist.push(n);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   976
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   977
      uint cnt = n->req();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   978
      for(uint i = 0; i < cnt; i++) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   979
        Node* m = n->in(i);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   980
        if (m != NULL) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   981
          to_process.push(m);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   982
        }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   983
      }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   984
    }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   985
  }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   986
}
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   987
489c9b5090e2 Initial load
duke
parents:
diff changeset
   988
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   989
void PhaseIterGVN::verify_step(Node* n) {
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   990
  if (VerifyIterativeGVN) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   991
    _verify_window[_verify_counter % _verify_window_size] = n;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   992
    ++_verify_counter;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   993
    ResourceMark rm;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   994
    ResourceArea* area = Thread::current()->resource_area();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   995
    VectorSet old_space(area), new_space(area);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   996
    if (C->unique() < 1000 ||
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   997
        0 == _verify_counter % (C->unique() < 10000 ? 10 : 100)) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   998
      ++_verify_full_passes;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
   999
      Node::verify_recur(C->root(), -1, old_space, new_space);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1000
    }
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1001
    const int verify_depth = 4;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1002
    for ( int i = 0; i < _verify_window_size; i++ ) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1003
      Node* n = _verify_window[i];
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1004
      if ( n == NULL )  continue;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1005
      if( n->in(0) == NodeSentinel ) {  // xform_idom
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1006
        _verify_window[i] = n->in(1);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1007
        --i; continue;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1008
      }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1009
      // Typical fanout is 1-2, so this call visits about 6 nodes.
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1010
      Node::verify_recur(n, verify_depth, old_space, new_space);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1011
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1012
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1014
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1015
void PhaseIterGVN::trace_PhaseIterGVN(Node* n, Node* nn, const Type* oldtype) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1016
  if (TraceIterativeGVN) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1017
    uint wlsize = _worklist.size();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1018
    const Type* newtype = type_or_null(n);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1019
    if (nn != n) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1020
      // print old node
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1021
      tty->print("< ");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1022
      if (oldtype != newtype && oldtype != NULL) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1023
        oldtype->dump();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1024
      }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1025
      do { tty->print("\t"); } while (tty->position() < 16);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1026
      tty->print("<");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1027
      n->dump();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1028
    }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1029
    if (oldtype != newtype || nn != n) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1030
      // print new node and/or new type
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1031
      if (oldtype == NULL) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1032
        tty->print("* ");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1033
      } else if (nn != n) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1034
        tty->print("> ");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1035
      } else {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1036
        tty->print("= ");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1037
      }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1038
      if (newtype == NULL) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1039
        tty->print("null");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1040
      } else {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1041
        newtype->dump();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1042
      }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1043
      do { tty->print("\t"); } while (tty->position() < 16);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1044
      nn->dump();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1045
    }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1046
    if (Verbose && wlsize < _worklist.size()) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1047
      tty->print("  Push {");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1048
      while (wlsize != _worklist.size()) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1049
        Node* pushed = _worklist.at(wlsize++);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1050
        tty->print(" %d", pushed->_idx);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1051
      }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1052
      tty->print_cr(" }");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1053
    }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1054
    if (nn != n) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1055
      // ignore n, it might be subsumed
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1056
      verify_step((Node*) NULL);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1057
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1058
  }
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1059
}
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1060
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1061
void PhaseIterGVN::init_verifyPhaseIterGVN() {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1062
  _verify_counter = 0;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1063
  _verify_full_passes = 0;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1064
  for (int i = 0; i < _verify_window_size; i++) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1065
    _verify_window[i] = NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1066
  }
25913
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1067
#ifdef ASSERT
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1068
  // Verify that all modified nodes are on _worklist
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1069
  Unique_Node_List* modified_list = C->modified_nodes();
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1070
  while (modified_list != NULL && modified_list->size()) {
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1071
    Node* n = modified_list->pop();
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1072
    if (n->outcnt() != 0 && !n->is_Con() && !_worklist.member(n)) {
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1073
      n->dump();
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1074
      assert(false, "modified node is not on IGVN._worklist");
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1075
    }
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1076
  }
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1077
#endif
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1078
}
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1079
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1080
void PhaseIterGVN::verify_PhaseIterGVN() {
25913
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1081
#ifdef ASSERT
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1082
  // Verify nodes with changed inputs.
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1083
  Unique_Node_List* modified_list = C->modified_nodes();
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1084
  while (modified_list != NULL && modified_list->size()) {
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1085
    Node* n = modified_list->pop();
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1086
    if (n->outcnt() != 0 && !n->is_Con()) { // skip dead and Con nodes
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1087
      n->dump();
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1088
      assert(false, "modified node was not processed by IGVN.transform_old()");
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1089
    }
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1090
  }
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1091
#endif
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1092
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1093
  C->verify_graph_edges();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1094
  if( VerifyOpto && allow_progress() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1095
    // Must turn off allow_progress to enable assert and break recursion
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1096
    C->root()->verify();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1097
    { // Check if any progress was missed using IterGVN
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1098
      // Def-Use info enables transformations not attempted in wash-pass
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1099
      // e.g. Region/Phi cleanup, ...
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1100
      // Null-check elision -- may not have reached fixpoint
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1101
      //                       do not propagate to dominated nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1102
      ResourceMark rm;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1103
      PhaseIterGVN igvn2(this,"Verify"); // Fresh and clean!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1104
      // Fill worklist completely
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1105
      igvn2.init_worklist(C->root());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1106
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1107
      igvn2.set_allow_progress(false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1108
      igvn2.optimize();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1109
      igvn2.set_allow_progress(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1110
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1111
  }
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1112
  if (VerifyIterativeGVN && PrintOpto) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1113
    if (_verify_counter == _verify_full_passes) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1114
      tty->print_cr("VerifyIterativeGVN: %d transforms and verify passes",
24424
2658d7834c6e 8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents: 24016
diff changeset
  1115
                    (int) _verify_full_passes);
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1116
    } else {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1117
      tty->print_cr("VerifyIterativeGVN: %d transforms, %d full verify passes",
24424
2658d7834c6e 8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents: 24016
diff changeset
  1118
                  (int) _verify_counter, (int) _verify_full_passes);
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1119
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1120
  }
25913
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1121
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1122
#ifdef ASSERT
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1123
  while (modified_list->size()) {
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1124
    Node* n = modified_list->pop();
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1125
    n->dump();
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1126
    assert(false, "VerifyIterativeGVN: new modified node was added");
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1127
  }
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1128
#endif
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1129
}
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1130
#endif /* PRODUCT */
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1131
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1132
#ifdef ASSERT
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1133
/**
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1134
 * Dumps information that can help to debug the problem. A debug
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1135
 * build fails with an assert.
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1136
 */
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1137
void PhaseIterGVN::dump_infinite_loop_info(Node* n) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1138
  n->dump(4);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1139
  _worklist.dump();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1140
  assert(false, "infinite loop in PhaseIterGVN::optimize");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1141
}
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1142
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1143
/**
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1144
 * Prints out information about IGVN if the 'verbose' option is used.
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1145
 */
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1146
void PhaseIterGVN::trace_PhaseIterGVN_verbose(Node* n, int num_processed) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1147
  if (TraceIterativeGVN && Verbose) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1148
    tty->print("  Pop ");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1149
    n->dump();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1150
    if ((num_processed % 100) == 0) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1151
      _worklist.print_set();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1152
    }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1153
  }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1154
}
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1155
#endif /* ASSERT */
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1156
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1157
void PhaseIterGVN::optimize() {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1158
  DEBUG_ONLY(uint num_processed  = 0;)
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1159
  NOT_PRODUCT(init_verifyPhaseIterGVN();)
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1160
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1161
  uint loop_count = 0;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1162
  // Pull from worklist and transform the node. If the node has changed,
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1163
  // update edge info and put uses on worklist.
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1164
  while(_worklist.size()) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1165
    if (C->check_node_count(NodeLimitFudgeFactor * 2, "Out of nodes")) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1166
      return;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1167
    }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1168
    Node* n  = _worklist.pop();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1169
    if (++loop_count >= K * C->live_nodes()) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1170
      DEBUG_ONLY(dump_infinite_loop_info(n);)
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1171
      C->record_method_not_compilable("infinite loop in PhaseIterGVN::optimize");
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1172
      return;
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1173
    }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1174
    DEBUG_ONLY(trace_PhaseIterGVN_verbose(n, num_processed++);)
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1175
    if (n->outcnt() != 0) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1176
      NOT_PRODUCT(const Type* oldtype = type_or_null(n));
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1177
      // Do the transformation
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1178
      Node* nn = transform_old(n);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1179
      NOT_PRODUCT(trace_PhaseIterGVN(n, nn, oldtype);)
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1180
    } else if (!n->is_top()) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1181
      remove_dead_node(n);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1182
    }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1183
  }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1184
  NOT_PRODUCT(verify_PhaseIterGVN();)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1185
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1186
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1187
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1188
/**
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1189
 * Register a new node with the optimizer.  Update the types array, the def-use
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1190
 * info.  Put on worklist.
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1191
 */
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1192
Node* PhaseIterGVN::register_new_node_with_optimizer(Node* n, Node* orig) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1193
  set_type_bottom(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1194
  _worklist.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1195
  if (orig != NULL)  C->copy_node_notes_to(n, orig);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1196
  return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1197
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1198
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1199
//------------------------------transform--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1200
// Non-recursive: idealize Node 'n' with respect to its inputs and its value
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1201
Node *PhaseIterGVN::transform( Node *n ) {
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
  1202
  if (_delay_transform) {
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
  1203
    // Register the node but don't optimize for now
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
  1204
    register_new_node_with_optimizer(n);
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
  1205
    return n;
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
  1206
  }
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
  1207
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1208
  // If brand new node, make space in type array, and give it a type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1209
  ensure_type_or_null(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1210
  if (type_or_null(n) == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1211
    set_type_bottom(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1212
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1213
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1214
  return transform_old(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1215
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1216
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1217
Node *PhaseIterGVN::transform_old(Node* n) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1218
  DEBUG_ONLY(uint loop_count = 0;);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1219
  NOT_PRODUCT(set_transforms());
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1220
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1221
  // Remove 'n' from hash table in case it gets modified
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1222
  _table.hash_delete(n);
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1223
  if (VerifyIterativeGVN) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1224
   assert(!_table.find_index(n->_idx), "found duplicate entry in table");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1225
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1226
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1227
  // Apply the Ideal call in a loop until it no longer applies
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1228
  Node* k = n;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1229
  DEBUG_ONLY(dead_loop_check(k);)
1067
f82e0a8cd438 6736417: Fastdebug C2 crashes in StoreBNode::Ideal
kvn
parents: 670
diff changeset
  1230
  DEBUG_ONLY(bool is_new = (k->outcnt() == 0);)
25913
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1231
  C->remove_modified_node(k);
52429
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
  1232
  Node* i = apply_ideal(k, /*can_reshape=*/true);
1067
f82e0a8cd438 6736417: Fastdebug C2 crashes in StoreBNode::Ideal
kvn
parents: 670
diff changeset
  1233
  assert(i != k || is_new || i->outcnt() > 0, "don't return dead nodes");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1234
#ifndef PRODUCT
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1235
  verify_step(k);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1236
  if (i && VerifyOpto ) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1237
    if (!allow_progress()) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1238
      if (i->is_Add() && (i->outcnt() == 1)) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1239
        // Switched input to left side because this is the only use
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1240
      } else if (i->is_If() && (i->in(0) == NULL)) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1241
        // This IF is dead because it is dominated by an equivalent IF When
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1242
        // dominating if changed, info is not propagated sparsely to 'this'
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1243
        // Propagating this info further will spuriously identify other
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1244
        // progress.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1245
        return i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1246
      } else
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1247
        set_progress();
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1248
    } else {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1249
      set_progress();
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1250
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1251
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1252
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1253
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1254
  while (i != NULL) {
25739
0d9a6751cb1d 8051303: 'optimized' build broken by JDK-8039425
anoll
parents: 24923
diff changeset
  1255
#ifdef ASSERT
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1256
    if (loop_count >= K) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1257
      dump_infinite_loop_info(i);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1258
    }
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1259
    loop_count++;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1260
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1261
    assert((i->_idx >= k->_idx) || i->is_top(), "Idealize should return new nodes, use Identity to return old nodes");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1262
    // Made a change; put users of original Node on worklist
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1263
    add_users_to_worklist(k);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1264
    // Replacing root of transform tree?
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1265
    if (k != i) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1266
      // Make users of old Node now use new.
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1267
      subsume_node(k, i);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1268
      k = i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1269
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1270
    DEBUG_ONLY(dead_loop_check(k);)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1271
    // Try idealizing again
1067
f82e0a8cd438 6736417: Fastdebug C2 crashes in StoreBNode::Ideal
kvn
parents: 670
diff changeset
  1272
    DEBUG_ONLY(is_new = (k->outcnt() == 0);)
25913
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1273
    C->remove_modified_node(k);
52429
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
  1274
    i = apply_ideal(k, /*can_reshape=*/true);
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1275
    assert(i != k || is_new || (i->outcnt() > 0), "don't return dead nodes");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1276
#ifndef PRODUCT
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1277
    verify_step(k);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1278
    if (i && VerifyOpto) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1279
      set_progress();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1280
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1281
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1282
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1283
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1284
  // If brand new node, make space in type array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1285
  ensure_type_or_null(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1286
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1287
  // See what kind of values 'k' takes on at runtime
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1288
  const Type* t = k->Value(this);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1289
  assert(t != NULL, "value sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1290
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1291
  // Since I just called 'Value' to compute the set of run-time values
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1292
  // for this Node, and 'Value' is non-local (and therefore expensive) I'll
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1293
  // cache Value.  Later requests for the local phase->type of this Node can
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1294
  // use the cached Value instead of suffering with 'bottom_type'.
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1295
  if (type_or_null(k) != t) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1296
#ifndef PRODUCT
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1297
    inc_new_values();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1298
    set_progress();
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1299
#endif
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1300
    set_type(k, t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1301
    // If k is a TypeNode, capture any more-precise type permanently into Node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1302
    k->raise_bottom_type(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1303
    // Move users of node to worklist
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1304
    add_users_to_worklist(k);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1305
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1306
  // If 'k' computes a constant, replace it with a constant
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1307
  if (t->singleton() && !k->is_Con()) {
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1308
    NOT_PRODUCT(set_progress();)
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1309
    Node* con = makecon(t);     // Make a constant
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1310
    add_users_to_worklist(k);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1311
    subsume_node(k, con);       // Everybody using k now uses con
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1312
    return con;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1313
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1314
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1315
  // Now check for Identities
52429
b64514ff68fd 8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents: 52224
diff changeset
  1316
  i = apply_identity(k);      // Look for a nearby replacement
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1317
  if (i != k) {                // Found? Return replacement!
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1318
    NOT_PRODUCT(set_progress();)
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1319
    add_users_to_worklist(k);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1320
    subsume_node(k, i);       // Everybody using k now uses i
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1321
    return i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1322
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1323
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1324
  // Global Value Numbering
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1325
  i = hash_find_insert(k);      // Check for pre-existing node
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1326
  if (i && (i != k)) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1327
    // Return the pre-existing node if it isn't dead
24015
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1328
    NOT_PRODUCT(set_progress();)
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1329
    add_users_to_worklist(k);
e54063b2eb53 8039425: Code cleanup: PhaseIterGVN::optimize()
anoll
parents: 23528
diff changeset
  1330
    subsume_node(k, i);       // Everybody using k now uses i
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1331
    return i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1332
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1333
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1334
  // Return Idealized original
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1335
  return k;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1336
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1337
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1338
//---------------------------------saturate------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1339
const Type* PhaseIterGVN::saturate(const Type* new_type, const Type* old_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1340
                                   const Type* limit_type) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1341
  return new_type->narrow(old_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1342
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1343
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1344
//------------------------------remove_globally_dead_node----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1345
// Kill a globally dead Node.  All uses are also globally dead and are
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1346
// aggressively trimmed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1347
void PhaseIterGVN::remove_globally_dead_node( Node *dead ) {
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1348
  enum DeleteProgress {
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1349
    PROCESS_INPUTS,
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1350
    PROCESS_OUTPUTS
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1351
  };
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1352
  assert(_stack.is_empty(), "not empty");
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1353
  _stack.push(dead, PROCESS_INPUTS);
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1354
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1355
  while (_stack.is_nonempty()) {
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1356
    dead = _stack.node();
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1357
    uint progress_state = _stack.index();
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1358
    assert(dead != C->root(), "killing root, eh?");
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1359
    assert(!dead->is_top(), "add check for top when pushing");
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1360
    NOT_PRODUCT( set_progress(); )
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1361
    if (progress_state == PROCESS_INPUTS) {
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1362
      // After following inputs, continue to outputs
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1363
      _stack.set_index(PROCESS_OUTPUTS);
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1364
      if (!dead->is_Con()) { // Don't kill cons but uses
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1365
        bool recurse = false;
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1366
        // Remove from hash table
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1367
        _table.hash_delete( dead );
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1368
        // Smash all inputs to 'dead', isolating him completely
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1369
        for (uint i = 0; i < dead->req(); i++) {
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1370
          Node *in = dead->in(i);
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1371
          if (in != NULL && in != C->top()) {  // Points to something?
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1372
            int nrep = dead->replace_edge(in, NULL);  // Kill edges
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1373
            assert((nrep > 0), "sanity");
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1374
            if (in->outcnt() == 0) { // Made input go dead?
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1375
              _stack.push(in, PROCESS_INPUTS); // Recursively remove
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1376
              recurse = true;
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1377
            } else if (in->outcnt() == 1 &&
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1378
                       in->has_special_unique_user()) {
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1379
              _worklist.push(in->unique_out());
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1380
            } else if (in->outcnt() <= 2 && dead->is_Phi()) {
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1381
              if (in->Opcode() == Op_Region) {
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1382
                _worklist.push(in);
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1383
              } else if (in->is_Store()) {
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1384
                DUIterator_Fast imax, i = in->fast_outs(imax);
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1385
                _worklist.push(in->fast_out(i));
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1386
                i++;
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1387
                if (in->outcnt() == 2) {
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1388
                  _worklist.push(in->fast_out(i));
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1389
                  i++;
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1390
                }
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1391
                assert(!(i < imax), "sanity");
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1392
              }
50180
ffa644980dff 8202377: Modularize C2 GC barriers
eosterlund
parents: 49816
diff changeset
  1393
            } else {
52224
4f2215a00ed1 8212611: Small collection of simple changes from shenandoah
roland
parents: 51706
diff changeset
  1394
              BarrierSet::barrier_set()->barrier_set_c2()->enqueue_useful_gc_barrier(this, in);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1395
            }
15813
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1396
            if (ReduceFieldZeroing && dead->is_Load() && i == MemNode::Memory &&
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1397
                in->is_Proj() && in->in(0) != NULL && in->in(0)->is_Initialize()) {
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1398
              // A Load that directly follows an InitializeNode is
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1399
              // going away. The Stores that follow are candidates
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1400
              // again to be captured by the InitializeNode.
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1401
              for (DUIterator_Fast jmax, j = in->fast_outs(jmax); j < jmax; j++) {
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1402
                Node *n = in->fast_out(j);
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1403
                if (n->is_Store()) {
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1404
                  _worklist.push(n);
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1405
                }
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1406
              }
6efd4c793e47 8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents: 15618
diff changeset
  1407
            }
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1408
          } // if (in != NULL && in != C->top())
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1409
        } // for (uint i = 0; i < dead->req(); i++)
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1410
        if (recurse) {
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1411
          continue;
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1412
        }
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1413
      } // if (!dead->is_Con())
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1414
    } // if (progress_state == PROCESS_INPUTS)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1415
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1416
    // Aggressively kill globally dead uses
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1417
    // (Rather than pushing all the outs at once, we push one at a time,
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1418
    // plus the parent to resume later, because of the indefinite number
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1419
    // of edge deletions per loop trip.)
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1420
    if (dead->outcnt() > 0) {
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1421
      // Recursively remove output edges
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1422
      _stack.push(dead->raw_out(0), PROCESS_INPUTS);
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1423
    } else {
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1424
      // Finished disconnecting all input and output edges.
13312
a8e45429e01e 7147464: Java crashed while executing method with over 8k of dneg operations
dlong
parents: 10988
diff changeset
  1425
      _stack.pop();
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1426
      // Remove dead node from iterative worklist
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1427
      _worklist.remove(dead);
25913
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1428
      C->remove_modified_node(dead);
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1429
      // Constant node that has no out-edges and has only one in-edge from
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1430
      // root is usually dead. However, sometimes reshaping walk makes
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1431
      // it reachable by adding use edges. So, we will NOT count Con nodes
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1432
      // as dead to be conservative about the dead node count at any
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1433
      // given time.
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1434
      if (!dead->is_Con()) {
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1435
        C->record_dead_node(dead->_idx);
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1436
      }
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1437
      if (dead->is_macro()) {
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1438
        C->remove_macro_node(dead);
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1439
      }
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1440
      if (dead->is_expensive()) {
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1441
        C->remove_expensive_node(dead);
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1442
      }
35574
2b25eb88c8d6 6675699: need comprehensive fix for unconstrained ConvI2L with narrowed type
thartmann
parents: 35545
diff changeset
  1443
      CastIINode* cast = dead->isa_CastII();
2b25eb88c8d6 6675699: need comprehensive fix for unconstrained ConvI2L with narrowed type
thartmann
parents: 35545
diff changeset
  1444
      if (cast != NULL && cast->has_range_check()) {
2b25eb88c8d6 6675699: need comprehensive fix for unconstrained ConvI2L with narrowed type
thartmann
parents: 35545
diff changeset
  1445
        C->remove_range_check_cast(cast);
2b25eb88c8d6 6675699: need comprehensive fix for unconstrained ConvI2L with narrowed type
thartmann
parents: 35545
diff changeset
  1446
      }
49487
bde392011cd8 8193130: Bad graph when unrolled loop bounds conflicts with range checks
roland
parents: 48595
diff changeset
  1447
      if (dead->Opcode() == Op_Opaque4) {
bde392011cd8 8193130: Bad graph when unrolled loop bounds conflicts with range checks
roland
parents: 48595
diff changeset
  1448
        C->remove_opaque4_node(dead);
bde392011cd8 8193130: Bad graph when unrolled loop bounds conflicts with range checks
roland
parents: 48595
diff changeset
  1449
      }
50180
ffa644980dff 8202377: Modularize C2 GC barriers
eosterlund
parents: 49816
diff changeset
  1450
      BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
ffa644980dff 8202377: Modularize C2 GC barriers
eosterlund
parents: 49816
diff changeset
  1451
      bs->unregister_potential_barrier_node(dead);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1452
    }
16619
a0e531dcc9e9 8004640: C2 assert failure in memnode.cpp: NULL+offs not RAW address
kvn
parents: 15813
diff changeset
  1453
  } // while (_stack.is_nonempty())
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1454
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1455
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1456
//------------------------------subsume_node-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1457
// Remove users from node 'old' and add them to node 'nn'.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1458
void PhaseIterGVN::subsume_node( Node *old, Node *nn ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1459
  assert( old != hash_find(old), "should already been removed" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1460
  assert( old != C->top(), "cannot subsume top node");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1461
  // Copy debug or profile information to the new version:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1462
  C->copy_node_notes_to(nn, old);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1463
  // Move users of node 'old' to node 'nn'
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1464
  for (DUIterator_Last imin, i = old->last_outs(imin); i >= imin; ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1465
    Node* use = old->last_out(i);  // for each use...
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1466
    // use might need re-hashing (but it won't if it's a new node)
25913
81dbc151e91c 8040213: C2 does not put all modified nodes on IGVN worklist
thartmann
parents: 25739
diff changeset
  1467
    rehash_node_delayed(use);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1468
    // Update use-def info as well
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1469
    // We remove all occurrences of old within use->in,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1470
    // so as to avoid rehashing any node more than once.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1471
    // The hash table probe swamps any outer loop overhead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1472
    uint num_edges = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1473
    for (uint jmax = use->len(), j = 0; j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1474
      if (use->in(j) == old) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1475
        use->set_req(j, nn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1476
        ++num_edges;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1477
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1478
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1479
    i -= num_edges;    // we deleted 1 or more copies of this edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1480
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1481
40871
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1482
  // Search for instance field data PhiNodes in the same region pointing to the old
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1483
  // memory PhiNode and update their instance memory ids to point to the new node.
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1484
  if (old->is_Phi() && old->as_Phi()->type()->has_memory() && old->in(0) != NULL) {
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1485
    Node* region = old->in(0);
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1486
    for (DUIterator_Fast imax, i = region->fast_outs(imax); i < imax; i++) {
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1487
      PhiNode* phi = region->fast_out(i)->isa_Phi();
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1488
      if (phi != NULL && phi->inst_mem_id() == (int)old->_idx) {
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1489
        phi->set_inst_mem_id((int)nn->_idx);
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1490
      }
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1491
    }
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1492
  }
82848b0654f8 8038348: Instance field load is replaced by wrong data Phi
thartmann
parents: 37248
diff changeset
  1493
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1494
  // Smash all inputs to 'old', isolating him completely
24923
9631f7d691dc 8034812: remove IDX_INIT macro hack in Node class
thartmann
parents: 24479
diff changeset
  1495
  Node *temp = new Node(1);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1496
  temp->init_req(0,nn);     // Add a use to nn to prevent him from dying
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1497
  remove_dead_node( old );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1498
  temp->del_req(0);         // Yank bogus edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1499
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1500
  if( VerifyIterativeGVN ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1501
    for ( int i = 0; i < _verify_window_size; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1502
      if ( _verify_window[i] == old )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1503
        _verify_window[i] = nn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1504
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1505
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1506
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1507
  _worklist.remove(temp);   // this can be necessary
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1508
  temp->destruct();         // reuse the _idx of this little guy
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1509
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1510
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1511
//------------------------------add_users_to_worklist--------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1512
void PhaseIterGVN::add_users_to_worklist0( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1513
  for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1514
    _worklist.push(n->fast_out(i));  // Push on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1515
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1516
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1517
36309
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1518
// Return counted loop Phi if as a counted loop exit condition, cmp
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1519
// compares the the induction variable with n
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1520
static PhiNode* countedloop_phi_from_cmp(CmpINode* cmp, Node* n) {
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1521
  for (DUIterator_Fast imax, i = cmp->fast_outs(imax); i < imax; i++) {
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1522
    Node* bol = cmp->fast_out(i);
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1523
    for (DUIterator_Fast i2max, i2 = bol->fast_outs(i2max); i2 < i2max; i2++) {
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1524
      Node* iff = bol->fast_out(i2);
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1525
      if (iff->is_CountedLoopEnd()) {
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1526
        CountedLoopEndNode* cle = iff->as_CountedLoopEnd();
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1527
        if (cle->limit() == n) {
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1528
          PhiNode* phi = cle->phi();
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1529
          if (phi != NULL) {
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1530
            return phi;
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1531
          }
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1532
        }
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1533
      }
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1534
    }
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1535
  }
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1536
  return NULL;
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1537
}
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1538
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1539
void PhaseIterGVN::add_users_to_worklist( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1540
  add_users_to_worklist0(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1541
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1542
  // Move users of node to worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1543
  for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1544
    Node* use = n->fast_out(i); // Get use
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1545
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1546
    if( use->is_Multi() ||      // Multi-definer?  Push projs on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1547
        use->is_Store() )       // Enable store/load same address
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1548
      add_users_to_worklist0(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1549
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1550
    // If we changed the receiver type to a call, we need to revisit
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1551
    // the Catch following the call.  It's looking for a non-NULL
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1552
    // receiver to know when to enable the regular fall-through path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1553
    // in addition to the NullPtrException path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1554
    if (use->is_CallDynamicJava() && n == use->in(TypeFunc::Parms)) {
48595
5d699d81c10c 8194988: 8 Null pointer dereference defect groups related to MultiNode::proj_out()
dlong
parents: 47765
diff changeset
  1555
      Node* p = use->as_CallDynamicJava()->proj_out_or_null(TypeFunc::Control);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1556
      if (p != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1557
        add_users_to_worklist0(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1558
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1559
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1560
27708
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1561
    uint use_op = use->Opcode();
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1562
    if(use->is_Cmp()) {       // Enable CMP/BOOL optimization
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1563
      add_users_to_worklist(use); // Put Bool on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1564
      if (use->outcnt() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1565
        Node* bol = use->raw_out(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1566
        if (bol->outcnt() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1567
          Node* iff = bol->raw_out(0);
36309
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1568
          if (iff->outcnt() == 2) {
27708
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1569
            // Look for the 'is_x2logic' pattern: "x ? : 0 : 1" and put the
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1570
            // phi merging either 0 or 1 onto the worklist
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1571
            Node* ifproj0 = iff->raw_out(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1572
            Node* ifproj1 = iff->raw_out(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1573
            if (ifproj0->outcnt() > 0 && ifproj1->outcnt() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1574
              Node* region0 = ifproj0->raw_out(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1575
              Node* region1 = ifproj1->raw_out(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1576
              if( region0 == region1 )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1577
                add_users_to_worklist0(region0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1578
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1579
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1580
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1581
      }
27708
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1582
      if (use_op == Op_CmpI) {
36309
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1583
        Node* phi = countedloop_phi_from_cmp((CmpINode*)use, n);
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1584
        if (phi != NULL) {
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1585
          // If an opaque node feeds into the limit condition of a
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1586
          // CountedLoop, we need to process the Phi node for the
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1587
          // induction variable when the opaque node is removed:
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1588
          // the range of values taken by the Phi is now known and
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1589
          // so its type is also known.
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1590
          _worklist.push(phi);
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1591
        }
27708
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1592
        Node* in1 = use->in(1);
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1593
        for (uint i = 0; i < in1->outcnt(); i++) {
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1594
          if (in1->raw_out(i)->Opcode() == Op_CastII) {
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1595
            Node* castii = in1->raw_out(i);
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1596
            if (castii->in(0) != NULL && castii->in(0)->in(0) != NULL && castii->in(0)->in(0)->is_If()) {
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1597
              Node* ifnode = castii->in(0)->in(0);
27910
8653c71aea40 8066045: opto/node.hpp:355, assert(i < _max) failed: oob: i=1, _max=1
roland
parents: 27708
diff changeset
  1598
              if (ifnode->in(1) != NULL && ifnode->in(1)->is_Bool() && ifnode->in(1)->in(1) == use) {
27708
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1599
                // Reprocess a CastII node that may depend on an
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1600
                // opaque node value when the opaque node is
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1601
                // removed. In case it carries a dependency we can do
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1602
                // a better job of computing its type.
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1603
                _worklist.push(castii);
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1604
              }
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1605
            }
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1606
          }
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1607
        }
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 26429
diff changeset
  1608
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1609
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1610
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1611
    // If changed Cast input, check Phi users for simple cycles
35545
a8f29dfd62b2 8139771: Eliminating CastPP nodes at Phis when they all come from a unique input may cause crash
roland
parents: 34503
diff changeset
  1612
    if (use->is_ConstraintCast()) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1613
      for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1614
        Node* u = use->fast_out(i2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1615
        if (u->is_Phi())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1616
          _worklist.push(u);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1617
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1618
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1619
    // If changed LShift inputs, check RShift users for useless sign-ext
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1620
    if( use_op == Op_LShiftI ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1621
      for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1622
        Node* u = use->fast_out(i2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1623
        if (u->Opcode() == Op_RShiftI)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1624
          _worklist.push(u);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1625
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1626
    }
24479
20eb4c752fb5 8042786: Proper fix for 8032566
kvn
parents: 24424
diff changeset
  1627
    // If changed AddI/SubI inputs, check CmpU for range check optimization.
20eb4c752fb5 8042786: Proper fix for 8032566
kvn
parents: 24424
diff changeset
  1628
    if (use_op == Op_AddI || use_op == Op_SubI) {
20eb4c752fb5 8042786: Proper fix for 8032566
kvn
parents: 24424
diff changeset
  1629
      for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
20eb4c752fb5 8042786: Proper fix for 8032566
kvn
parents: 24424
diff changeset
  1630
        Node* u = use->fast_out(i2);
20eb4c752fb5 8042786: Proper fix for 8032566
kvn
parents: 24424
diff changeset
  1631
        if (u->is_Cmp() && (u->Opcode() == Op_CmpU)) {
20eb4c752fb5 8042786: Proper fix for 8032566
kvn
parents: 24424
diff changeset
  1632
          _worklist.push(u);
20eb4c752fb5 8042786: Proper fix for 8032566
kvn
parents: 24424
diff changeset
  1633
        }
20eb4c752fb5 8042786: Proper fix for 8032566
kvn
parents: 24424
diff changeset
  1634
      }
20eb4c752fb5 8042786: Proper fix for 8032566
kvn
parents: 24424
diff changeset
  1635
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1636
    // If changed AddP inputs, check Stores for loop invariant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1637
    if( use_op == Op_AddP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1638
      for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1639
        Node* u = use->fast_out(i2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1640
        if (u->is_Mem())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1641
          _worklist.push(u);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1642
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1643
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1644
    // If changed initialization activity, check dependent Stores
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1645
    if (use_op == Op_Allocate || use_op == Op_AllocateArray) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1646
      InitializeNode* init = use->as_Allocate()->initialization();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1647
      if (init != NULL) {
48595
5d699d81c10c 8194988: 8 Null pointer dereference defect groups related to MultiNode::proj_out()
dlong
parents: 47765
diff changeset
  1648
        Node* imem = init->proj_out_or_null(TypeFunc::Memory);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1649
        if (imem != NULL)  add_users_to_worklist0(imem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1650
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1651
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1652
    if (use_op == Op_Initialize) {
48595
5d699d81c10c 8194988: 8 Null pointer dereference defect groups related to MultiNode::proj_out()
dlong
parents: 47765
diff changeset
  1653
      Node* imem = use->as_Initialize()->proj_out_or_null(TypeFunc::Memory);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1654
      if (imem != NULL)  add_users_to_worklist0(imem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1655
    }
49816
a3e79f97e86b 8200555: OopHandle should use Access API
coleenp
parents: 49487
diff changeset
  1656
    // Loading the java mirror from a Klass requires two loads and the type
47693
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1657
    // of the mirror load depends on the type of 'n'. See LoadNode::Value().
51485
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1658
    //   LoadBarrier?(LoadP(LoadP(AddP(foo:Klass, #java_mirror))))
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1659
    BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1660
    bool has_load_barriers = bs->has_load_barriers();
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1661
47693
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1662
    if (use_op == Op_LoadP && use->bottom_type()->isa_rawptr()) {
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1663
      for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1664
        Node* u = use->fast_out(i2);
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1665
        const Type* ut = u->bottom_type();
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1666
        if (u->Opcode() == Op_LoadP && ut->isa_instptr()) {
51485
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1667
          if (has_load_barriers) {
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1668
            // Search for load barriers behind the load
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1669
            for (DUIterator_Fast i3max, i3 = u->fast_outs(i3max); i3 < i3max; i3++) {
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1670
              Node* b = u->fast_out(i3);
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1671
              if (bs->is_gc_barrier_node(b)) {
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1672
                _worklist.push(b);
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1673
              }
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1674
            }
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1675
          }
47693
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1676
          _worklist.push(u);
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1677
        }
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1678
      }
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1679
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1680
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1681
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1682
21099
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1683
/**
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1684
 * Remove the speculative part of all types that we know of
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1685
 */
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1686
void PhaseIterGVN::remove_speculative_types()  {
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1687
  assert(UseTypeSpeculation, "speculation is off");
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1688
  for (uint i = 0; i < _types.Size(); i++)  {
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1689
    const Type* t = _types.fast_lookup(i);
22799
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
  1690
    if (t != NULL) {
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
  1691
      _types.map(i, t->remove_speculative());
21099
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1692
    }
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1693
  }
22799
83e58bac7980 8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents: 22234
diff changeset
  1694
  _table.check_no_speculative_types();
21099
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1695
}
46e6bbecd9e5 8024070: C2 needs some form of type speculation
roland
parents: 19717
diff changeset
  1696
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1697
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1698
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1699
uint PhaseCCP::_total_invokes   = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1700
uint PhaseCCP::_total_constants = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1701
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1702
//------------------------------PhaseCCP---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1703
// Conditional Constant Propagation, ala Wegman & Zadeck
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1704
PhaseCCP::PhaseCCP( PhaseIterGVN *igvn ) : PhaseIterGVN(igvn) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1705
  NOT_PRODUCT( clear_constants(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1706
  assert( _worklist.size() == 0, "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1707
  // Clear out _nodes from IterGVN.  Must be clear to transform call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1708
  _nodes.clear();               // Clear out from IterGVN
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1709
  analyze();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1710
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1711
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1712
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1713
//------------------------------~PhaseCCP--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1714
PhaseCCP::~PhaseCCP() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1715
  inc_invokes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1716
  _total_constants += count_constants();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1717
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1718
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1719
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1720
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1721
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1722
static bool ccp_type_widens(const Type* t, const Type* t0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1723
  assert(t->meet(t0) == t, "Not monotonic");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1724
  switch (t->base() == t0->base() ? t->base() : Type::Top) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1725
  case Type::Int:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1726
    assert(t0->isa_int()->_widen <= t->isa_int()->_widen, "widen increases");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1727
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1728
  case Type::Long:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1729
    assert(t0->isa_long()->_widen <= t->isa_long()->_widen, "widen increases");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1730
    break;
46630
75aa3e39d02c 8182299: Enable disabled clang warnings, build on OSX 10 + Xcode 8
jwilhelm
parents: 40871
diff changeset
  1731
  default:
75aa3e39d02c 8182299: Enable disabled clang warnings, build on OSX 10 + Xcode 8
jwilhelm
parents: 40871
diff changeset
  1732
    break;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1733
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1734
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1735
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1736
#endif //ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1737
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1738
//------------------------------analyze----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1739
void PhaseCCP::analyze() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1740
  // Initialize all types to TOP, optimistic analysis
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1741
  for (int i = C->unique() - 1; i >= 0; i--)  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1742
    _types.map(i,Type::TOP);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1743
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1744
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1745
  // Push root onto worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1746
  Unique_Node_List worklist;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1747
  worklist.push(C->root());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1748
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1749
  // Pull from worklist; compute new value; push changes out.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1750
  // This loop is the meat of CCP.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1751
  while( worklist.size() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1752
    Node *n = worklist.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1753
    const Type *t = n->Value(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1754
    if (t != type(n)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1755
      assert(ccp_type_widens(t, type(n)), "ccp type must widen");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1756
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1757
      if( TracePhaseCCP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1758
        t->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1759
        do { tty->print("\t"); } while (tty->position() < 16);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1760
        n->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1761
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1762
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1763
      set_type(n, t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1764
      for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1765
        Node* m = n->fast_out(i);   // Get user
31039
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1766
        if (m->is_Region()) {  // New path to Region?  Must recheck Phis too
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1767
          for (DUIterator_Fast i2max, i2 = m->fast_outs(i2max); i2 < i2max; i2++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1768
            Node* p = m->fast_out(i2); // Propagate changes to uses
31039
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1769
            if (p->bottom_type() != type(p)) { // If not already bottomed out
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1770
              worklist.push(p); // Propagate change to user
31039
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1771
            }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1772
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1773
        }
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1067
diff changeset
  1774
        // If we changed the receiver type to a call, we need to revisit
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1775
        // the Catch following the call.  It's looking for a non-NULL
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1776
        // receiver to know when to enable the regular fall-through path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1777
        // in addition to the NullPtrException path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1778
        if (m->is_Call()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1779
          for (DUIterator_Fast i2max, i2 = m->fast_outs(i2max); i2 < i2max; i2++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1780
            Node* p = m->fast_out(i2);  // Propagate changes to uses
31039
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1781
            if (p->is_Proj() && p->as_Proj()->_con == TypeFunc::Control && p->outcnt() == 1) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1782
              worklist.push(p->unique_out());
31039
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1783
            }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1784
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1785
        }
31039
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1786
        if (m->bottom_type() != type(m)) { // If not already bottomed out
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1787
          worklist.push(m);     // Propagate change to user
31039
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1788
        }
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1789
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1790
        // CmpU nodes can get their type information from two nodes up in the
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1791
        // graph (instead of from the nodes immediately above). Make sure they
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1792
        // are added to the worklist if nodes they depend on are updated, since
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1793
        // they could be missed and get wrong types otherwise.
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1794
        uint m_op = m->Opcode();
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1795
        if (m_op == Op_AddI || m_op == Op_SubI) {
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1796
          for (DUIterator_Fast i2max, i2 = m->fast_outs(i2max); i2 < i2max; i2++) {
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1797
            Node* p = m->fast_out(i2); // Propagate changes to uses
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1798
            if (p->Opcode() == Op_CmpU) {
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1799
              // Got a CmpU which might need the new type information from node n.
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1800
              if(p->bottom_type() != type(p)) { // If not already bottomed out
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1801
                worklist.push(p); // Propagate change to user
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1802
              }
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1803
            }
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1804
          }
459354ae142a 8060036: C2: CmpU nodes can end up with wrong type information
aeriksso
parents: 30300
diff changeset
  1805
        }
36309
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1806
        // If n is used in a counted loop exit condition then the type
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1807
        // of the counted loop's Phi depends on the type of n. See
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1808
        // PhiNode::Value().
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1809
        if (m_op == Op_CmpI) {
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1810
          PhiNode* phi = countedloop_phi_from_cmp((CmpINode*)m, n);
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1811
          if (phi != NULL) {
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1812
            worklist.push(phi);
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1813
          }
61fbc15c4d23 8148786: xml.tranform fails on x86-64
roland
parents: 35574
diff changeset
  1814
        }
49816
a3e79f97e86b 8200555: OopHandle should use Access API
coleenp
parents: 49487
diff changeset
  1815
        // Loading the java mirror from a Klass requires two loads and the type
47693
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1816
        // of the mirror load depends on the type of 'n'. See LoadNode::Value().
51485
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1817
        BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1818
        bool has_load_barriers = bs->has_load_barriers();
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1819
47693
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1820
        if (m_op == Op_LoadP && m->bottom_type()->isa_rawptr()) {
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1821
          for (DUIterator_Fast i2max, i2 = m->fast_outs(i2max); i2 < i2max; i2++) {
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1822
            Node* u = m->fast_out(i2);
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1823
            const Type* ut = u->bottom_type();
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1824
            if (u->Opcode() == Op_LoadP && ut->isa_instptr() && ut != type(u)) {
51485
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1825
              if (has_load_barriers) {
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1826
                // Search for load barriers behind the load
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1827
                for (DUIterator_Fast i3max, i3 = u->fast_outs(i3max); i3 < i3max; i3++) {
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1828
                  Node* b = u->fast_out(i3);
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1829
                  if (bs->is_gc_barrier_node(b)) {
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1830
                    _worklist.push(b);
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1831
                  }
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1832
                }
0c7040d1d1ca 8208601: Introduce native oop barriers in C2 for OopHandle
eosterlund
parents: 51333
diff changeset
  1833
              }
47693
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1834
              worklist.push(u);
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1835
            }
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1836
          }
1630ba56759d 8188785: CCP sets invalid type for java mirror load
thartmann
parents: 47216
diff changeset
  1837
        }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1838
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1839
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1840
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1841
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1842
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1843
//------------------------------do_transform-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1844
// Top level driver for the recursive transformer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1845
void PhaseCCP::do_transform() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1846
  // Correct leaves of new-space Nodes; they point to old-space.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1847
  C->set_root( transform(C->root())->as_Root() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1848
  assert( C->top(),  "missing TOP node" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1849
  assert( C->root(), "missing root" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1850
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1851
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1852
//------------------------------transform--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1853
// Given a Node in old-space, clone him into new-space.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1854
// Convert any of his old-space children into new-space children.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1855
Node *PhaseCCP::transform( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1856
  Node *new_node = _nodes[n->_idx]; // Check for transformed node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1857
  if( new_node != NULL )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1858
    return new_node;                // Been there, done that, return old answer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1859
  new_node = transform_once(n);     // Check for constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1860
  _nodes.map( n->_idx, new_node );  // Flag as having been cloned
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1861
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1862
  // Allocate stack of size _nodes.Size()/2 to avoid frequent realloc
32202
7e7ad8b06f5b 8011858: Use Compile::live_nodes() instead of Compile::unique() in appropriate places
kvn
parents: 31039
diff changeset
  1863
  GrowableArray <Node *> trstack(C->live_nodes() >> 1);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1864
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1865
  trstack.push(new_node);           // Process children of cloned node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1866
  while ( trstack.is_nonempty() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1867
    Node *clone = trstack.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1868
    uint cnt = clone->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1869
    for( uint i = 0; i < cnt; i++ ) {          // For all inputs do
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1870
      Node *input = clone->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1871
      if( input != NULL ) {                    // Ignore NULLs
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1872
        Node *new_input = _nodes[input->_idx]; // Check for cloned input node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1873
        if( new_input == NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1874
          new_input = transform_once(input);   // Check for constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1875
          _nodes.map( input->_idx, new_input );// Flag as having been cloned
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1876
          trstack.push(new_input);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1877
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1878
        assert( new_input == clone->in(i), "insanity check");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1879
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1880
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1881
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1882
  return new_node;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1883
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1884
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1885
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1886
//------------------------------transform_once---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1887
// For PhaseCCP, transformation is IDENTITY unless Node computed a constant.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1888
Node *PhaseCCP::transform_once( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1889
  const Type *t = type(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1890
  // Constant?  Use constant Node instead
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1891
  if( t->singleton() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1892
    Node *nn = n;               // Default is to return the original constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1893
    if( t == Type::TOP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1894
      // cache my top node on the Compile instance
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1895
      if( C->cached_top_node() == NULL || C->cached_top_node()->in(0) == NULL ) {
25930
eae8b7490d2c 8054033: Remove unused references to Compile*
thartmann
parents: 25913
diff changeset
  1896
        C->set_cached_top_node(ConNode::make(Type::TOP));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1897
        set_type(C->top(), Type::TOP);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1898
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1899
      nn = C->top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1900
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1901
    if( !n->is_Con() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1902
      if( t != Type::TOP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1903
        nn = makecon(t);        // ConNode::make(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1904
        NOT_PRODUCT( inc_constants(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1905
      } else if( n->is_Region() ) { // Unreachable region
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1906
        // Note: nn == C->top()
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1907
        n->set_req(0, NULL);        // Cut selfreference
51706
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1908
        bool progress = true;
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1909
        uint max = n->outcnt();
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1910
        DUIterator i;
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1911
        while (progress) {
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1912
          progress = false;
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1913
          // Eagerly remove dead phis to avoid phis copies creation.
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1914
          for (i = n->outs(); n->has_out(i); i++) {
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1915
            Node* m = n->out(i);
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1916
            if (m->is_Phi()) {
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1917
              assert(type(m) == Type::TOP, "Unreachable region should not have live phis.");
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1918
              replace_node(m, nn);
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1919
              if (max != n->outcnt()) {
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1920
                progress = true;
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1921
                i = n->refresh_out_pos(i);
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1922
                max = n->outcnt();
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1923
              }
be8fe2a352be 8210387: C2 compilation fails with "assert(node->_last_del == _last) failed: must have deleted the edge just produced"
thartmann
parents: 51485
diff changeset
  1924
            }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1925
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1926
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1927
      }
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
  1928
      replace_node(n,nn);       // Update DefUse edges for new constant
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1929
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1930
    return nn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1931
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1932
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1933
  // If x is a TypeNode, capture any more-precise type permanently into Node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1934
  if (t != n->bottom_type()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1935
    hash_delete(n);             // changing bottom type may force a rehash
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1936
    n->raise_bottom_type(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1937
    _worklist.push(n);          // n re-enters the hash table via the worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1938
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1939
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1940
  // TEMPORARY fix to ensure that 2nd GVN pass eliminates NULL checks
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1941
  switch( n->Opcode() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1942
  case Op_FastLock:      // Revisit FastLocks for lock coarsening
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1943
  case Op_If:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1944
  case Op_CountedLoopEnd:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1945
  case Op_Region:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1946
  case Op_Loop:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1947
  case Op_CountedLoop:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1948
  case Op_Conv2B:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1949
  case Op_Opaque1:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1950
  case Op_Opaque2:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1951
    _worklist.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1952
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1953
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1954
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1955
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1956
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1957
  return  n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1958
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1959
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1960
//---------------------------------saturate------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1961
const Type* PhaseCCP::saturate(const Type* new_type, const Type* old_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1962
                               const Type* limit_type) const {
4012
579b7bad9983 6885584: A particular class structure causes large allocation spike for jit
never
parents: 3682
diff changeset
  1963
  const Type* wide_type = new_type->widen(old_type, limit_type);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1964
  if (wide_type != new_type) {          // did we widen?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1965
    // If so, we may have widened beyond the limit type.  Clip it back down.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1966
    new_type = wide_type->filter(limit_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1967
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1968
  return new_type;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1969
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1970
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1971
//------------------------------print_statistics-------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1972
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1973
void PhaseCCP::print_statistics() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1974
  tty->print_cr("CCP: %d  constants found: %d", _total_invokes, _total_constants);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1975
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1976
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1977
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1978
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1979
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1980
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1981
uint PhasePeephole::_total_peepholes = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1982
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1983
//------------------------------PhasePeephole----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1984
// Conditional Constant Propagation, ala Wegman & Zadeck
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1985
PhasePeephole::PhasePeephole( PhaseRegAlloc *regalloc, PhaseCFG &cfg )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1986
  : PhaseTransform(Peephole), _regalloc(regalloc), _cfg(cfg) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1987
  NOT_PRODUCT( clear_peepholes(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1988
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1989
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1990
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1991
//------------------------------~PhasePeephole---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1992
PhasePeephole::~PhasePeephole() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1993
  _total_peepholes += count_peepholes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1994
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1995
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1996
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1997
//------------------------------transform--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1998
Node *PhasePeephole::transform( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1999
  ShouldNotCallThis();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2000
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2001
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2002
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2003
//------------------------------do_transform-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2004
void PhasePeephole::do_transform() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2005
  bool method_name_not_printed = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2006
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2007
  // Examine each basic block
19330
49d6711171e6 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 17383
diff changeset
  2008
  for (uint block_number = 1; block_number < _cfg.number_of_blocks(); ++block_number) {
49d6711171e6 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 17383
diff changeset
  2009
    Block* block = _cfg.get_block(block_number);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2010
    bool block_not_printed = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2011
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2012
    // and each instruction within a block
19717
7819ffdaf0ff 8023691: Create interface for nodes in class Block
adlertz
parents: 19330
diff changeset
  2013
    uint end_index = block->number_of_nodes();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2014
    // block->end_idx() not valid after PhaseRegAlloc
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2015
    for( uint instruction_index = 1; instruction_index < end_index; ++instruction_index ) {
19717
7819ffdaf0ff 8023691: Create interface for nodes in class Block
adlertz
parents: 19330
diff changeset
  2016
      Node     *n = block->get_node(instruction_index);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2017
      if( n->is_Mach() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2018
        MachNode *m = n->as_Mach();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2019
        int deleted_count = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2020
        // check for peephole opportunities
25930
eae8b7490d2c 8054033: Remove unused references to Compile*
thartmann
parents: 25913
diff changeset
  2021
        MachNode *m2 = m->peephole(block, instruction_index, _regalloc, deleted_count);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2022
        if( m2 != NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2023
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2024
          if( PrintOptoPeephole ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2025
            // Print method, first time only
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2026
            if( C->method() && method_name_not_printed ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2027
              C->method()->print_short_name(); tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2028
              method_name_not_printed = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2029
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2030
            // Print this block
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2031
            if( Verbose && block_not_printed) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2032
              tty->print_cr("in block");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2033
              block->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2034
              block_not_printed = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2035
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2036
            // Print instructions being deleted
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2037
            for( int i = (deleted_count - 1); i >= 0; --i ) {
19717
7819ffdaf0ff 8023691: Create interface for nodes in class Block
adlertz
parents: 19330
diff changeset
  2038
              block->get_node(instruction_index-i)->as_Mach()->format(_regalloc); tty->cr();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2039
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2040
            tty->print_cr("replaced with");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2041
            // Print new instruction
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2042
            m2->format(_regalloc);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2043
            tty->print("\n\n");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2044
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2045
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2046
          // Remove old nodes from basic block and update instruction_index
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2047
          // (old nodes still exist and may have edges pointing to them
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2048
          //  as register allocation info is stored in the allocator using
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2049
          //  the node index to live range mappings.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2050
          uint safe_instruction_index = (instruction_index - deleted_count);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2051
          for( ; (instruction_index > safe_instruction_index); --instruction_index ) {
19717
7819ffdaf0ff 8023691: Create interface for nodes in class Block
adlertz
parents: 19330
diff changeset
  2052
            block->remove_node( instruction_index );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2053
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2054
          // install new node after safe_instruction_index
19717
7819ffdaf0ff 8023691: Create interface for nodes in class Block
adlertz
parents: 19330
diff changeset
  2055
          block->insert_node(m2, safe_instruction_index + 1);
7819ffdaf0ff 8023691: Create interface for nodes in class Block
adlertz
parents: 19330
diff changeset
  2056
          end_index = block->number_of_nodes() - 1; // Recompute new block size
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2057
          NOT_PRODUCT( inc_peepholes(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2058
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2059
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2060
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2061
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2062
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2063
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2064
//------------------------------print_statistics-------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2065
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2066
void PhasePeephole::print_statistics() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2067
  tty->print_cr("Peephole: peephole rules applied: %d",  _total_peepholes);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2068
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2069
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2070
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2071
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2072
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2073
//------------------------------set_req_X--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2074
void Node::set_req_X( uint i, Node *n, PhaseIterGVN *igvn ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2075
  assert( is_not_dead(n), "can not use dead node");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2076
  assert( igvn->hash_find(this) != this, "Need to remove from hash before changing edges" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2077
  Node *old = in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2078
  set_req(i, n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2079
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2080
  // old goes dead?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2081
  if( old ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2082
    switch (old->outcnt()) {
3682
42de755d7d6e 6866651: Regression: simple int sum crashes jvm (build 1.6.0_14-b08 and 1.7.0-ea-b59)
cfang
parents: 2131
diff changeset
  2083
    case 0:
42de755d7d6e 6866651: Regression: simple int sum crashes jvm (build 1.6.0_14-b08 and 1.7.0-ea-b59)
cfang
parents: 2131
diff changeset
  2084
      // Put into the worklist to kill later. We do not kill it now because the
42de755d7d6e 6866651: Regression: simple int sum crashes jvm (build 1.6.0_14-b08 and 1.7.0-ea-b59)
cfang
parents: 2131
diff changeset
  2085
      // recursive kill will delete the current node (this) if dead-loop exists
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2086
      if (!old->is_top())
3682
42de755d7d6e 6866651: Regression: simple int sum crashes jvm (build 1.6.0_14-b08 and 1.7.0-ea-b59)
cfang
parents: 2131
diff changeset
  2087
        igvn->_worklist.push( old );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2088
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2089
    case 1:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2090
      if( old->is_Store() || old->has_special_unique_user() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2091
        igvn->add_users_to_worklist( old );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2092
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2093
    case 2:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2094
      if( old->is_Store() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2095
        igvn->add_users_to_worklist( old );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2096
      if( old->Opcode() == Op_Region )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2097
        igvn->_worklist.push(old);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2098
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2099
    case 3:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2100
      if( old->Opcode() == Op_Region ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2101
        igvn->_worklist.push(old);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2102
        igvn->add_users_to_worklist( old );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2103
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2104
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2105
    default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2106
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2107
    }
52224
4f2215a00ed1 8212611: Small collection of simple changes from shenandoah
roland
parents: 51706
diff changeset
  2108
4f2215a00ed1 8212611: Small collection of simple changes from shenandoah
roland
parents: 51706
diff changeset
  2109
    BarrierSet::barrier_set()->barrier_set_c2()->enqueue_useful_gc_barrier(igvn, old);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2110
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2111
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2112
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2113
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2114
//-------------------------------replace_by-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2115
// Using def-use info, replace one node for another.  Follow the def-use info
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2116
// to all users of the OLD node.  Then make all uses point to the NEW node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2117
void Node::replace_by(Node *new_node) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2118
  assert(!is_top(), "top node has no DU info");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2119
  for (DUIterator_Last imin, i = last_outs(imin); i >= imin; ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2120
    Node* use = last_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2121
    uint uses_found = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2122
    for (uint j = 0; j < use->len(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2123
      if (use->in(j) == this) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2124
        if (j < use->req())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2125
              use->set_req(j, new_node);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2126
        else  use->set_prec(j, new_node);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2127
        uses_found++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2128
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2129
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2130
    i -= uses_found;    // we deleted 1 or more copies of this edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2131
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2132
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2133
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2134
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2135
//-----------------------------------------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2136
void Type_Array::grow( uint i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2137
  if( !_max ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2138
    _max = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2139
    _types = (const Type**)_a->Amalloc( _max * sizeof(Type*) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2140
    _types[0] = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2141
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2142
  uint old = _max;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2143
  while( i >= _max ) _max <<= 1;        // Double to fit
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2144
  _types = (const Type**)_a->Arealloc( _types, old*sizeof(Type*),_max*sizeof(Type*));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2145
  memset( &_types[old], 0, (_max-old)*sizeof(Type*) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2146
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2147
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2148
//------------------------------dump-------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2149
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2150
void Type_Array::dump() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2151
  uint max = Size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2152
  for( uint i = 0; i < max; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2153
    if( _types[i] != NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2154
      tty->print("  %d\t== ", i); _types[i]->dump(); tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2155
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2156
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2157
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2158
#endif