hotspot/src/share/vm/opto/phaseX.cpp
author stefank
Tue, 23 Nov 2010 13:22:55 -0800
changeset 7397 5b173b4ca846
parent 6752 9a3b09fd5745
child 10563 b9b82ff9f0e9
permissions -rw-r--r--
6989984: Use standard include model for Hospot Summary: Replaced MakeDeps and the includeDB files with more standardized solutions. Reviewed-by: coleenp, kvn, kamg
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
     2
 * Copyright (c) 1997, 2010, 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"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    26
#include "memory/allocation.inline.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    27
#include "opto/block.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    28
#include "opto/callnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    29
#include "opto/cfgnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    30
#include "opto/connode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    31
#include "opto/idealGraphPrinter.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    32
#include "opto/loopnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    33
#include "opto/machnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    34
#include "opto/opcodes.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    35
#include "opto/phaseX.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    36
#include "opto/regalloc.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6752
diff changeset
    37
#include "opto/rootnode.hpp"
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
#define NODE_HASH_MINIMUM_SIZE    255
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
//------------------------------NodeHash---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
NodeHash::NodeHash(uint est_max_size) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
  _max( round_up(est_max_size < NODE_HASH_MINIMUM_SIZE ? NODE_HASH_MINIMUM_SIZE : est_max_size) ),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
  _a(Thread::current()->resource_area()),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
  _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ), // (Node**)_a->Amalloc(_max * sizeof(Node*)) ),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
  _inserts(0), _insert_limit( insert_limit() ),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
  _look_probes(0), _lookup_hits(0), _lookup_misses(0),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
  _total_insert_probes(0), _total_inserts(0),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
  _insert_probes(0), _grows(0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
  // _sentinel must be in the current node space
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
  _sentinel = new (Compile::current(), 1) ProjNode(NULL, TypeFunc::Control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
  memset(_table,0,sizeof(Node*)*_max);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
//------------------------------NodeHash---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
NodeHash::NodeHash(Arena *arena, uint est_max_size) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
  _max( round_up(est_max_size < NODE_HASH_MINIMUM_SIZE ? NODE_HASH_MINIMUM_SIZE : est_max_size) ),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
  _a(arena),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
  _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
  _inserts(0), _insert_limit( insert_limit() ),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
  _look_probes(0), _lookup_hits(0), _lookup_misses(0),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
  _delete_probes(0), _delete_hits(0), _delete_misses(0),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
  _total_insert_probes(0), _total_inserts(0),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
  _insert_probes(0), _grows(0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
  // _sentinel must be in the current node space
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
  _sentinel = new (Compile::current(), 1) ProjNode(NULL, TypeFunc::Control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
  memset(_table,0,sizeof(Node*)*_max);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
//------------------------------NodeHash---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
NodeHash::NodeHash(NodeHash *nh) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
  debug_only(_table = (Node**)badAddress);   // interact correctly w/ operator=
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
  // just copy in all the fields
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
  *this = *nh;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
  // nh->_sentinel must be in the current node space
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
//------------------------------hash_find--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
// Find in hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
Node *NodeHash::hash_find( const Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
  // ((Node*)n)->set_hash( n->hash() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
  uint hash = n->hash();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
  if (hash == Node::NO_HASH) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
    debug_only( _lookup_misses++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
  uint key = hash & (_max-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
  uint stride = key | 0x01;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
  debug_only( _look_probes++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
  Node *k = _table[key];        // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
  if( !k ) {                    // ?Miss?
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
    debug_only( _lookup_misses++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
    return NULL;                // Miss!
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
  int op = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
  uint req = n->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
  while( 1 ) {                  // While probing hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
    if( k->req() == req &&      // Same count of inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
        k->Opcode() == op ) {   // Same Opcode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
      for( uint i=0; i<req; i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
        if( n->in(i)!=k->in(i)) // Different inputs?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
          goto collision;       // "goto" is a speed hack...
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
      if( n->cmp(*k) ) {        // Check for any special bits
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
        debug_only( _lookup_hits++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
        return k;               // Hit!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
  collision:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
    debug_only( _look_probes++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
    key = (key + stride/*7*/) & (_max-1); // Stride through table with relative prime
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
    k = _table[key];            // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
    if( !k ) {                  // ?Miss?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
      debug_only( _lookup_misses++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
      return NULL;              // Miss!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
  ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
//------------------------------hash_find_insert-------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
// Find in hash table, insert if not already present
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
// Used to preserve unique entries in hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
Node *NodeHash::hash_find_insert( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
  // n->set_hash( );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
  uint hash = n->hash();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
  if (hash == Node::NO_HASH) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
    debug_only( _lookup_misses++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
  uint key = hash & (_max-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
  uint stride = key | 0x01;     // stride must be relatively prime to table siz
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
  uint first_sentinel = 0;      // replace a sentinel if seen.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
  debug_only( _look_probes++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
  Node *k = _table[key];        // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
  if( !k ) {                    // ?Miss?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
    debug_only( _lookup_misses++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
    _table[key] = n;            // Insert into table!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
    debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
    check_grow();               // Grow table if insert hit limit
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
    return NULL;                // Miss!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
  else if( k == _sentinel ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
    first_sentinel = key;      // Can insert here
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
  int op = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
  uint req = n->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
  while( 1 ) {                  // While probing hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
    if( k->req() == req &&      // Same count of inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
        k->Opcode() == op ) {   // Same Opcode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
      for( uint i=0; i<req; i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
        if( n->in(i)!=k->in(i)) // Different inputs?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
          goto collision;       // "goto" is a speed hack...
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
      if( n->cmp(*k) ) {        // Check for any special bits
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
        debug_only( _lookup_hits++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
        return k;               // Hit!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
  collision:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
    debug_only( _look_probes++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
    key = (key + stride) & (_max-1); // Stride through table w/ relative prime
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
    k = _table[key];            // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
    if( !k ) {                  // ?Miss?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
      debug_only( _lookup_misses++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
      key = (first_sentinel == 0) ? key : first_sentinel; // ?saw sentinel?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
      _table[key] = n;          // Insert into table!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
      debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
      check_grow();             // Grow table if insert hit limit
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
      return NULL;              // Miss!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
    else if( first_sentinel == 0 && k == _sentinel ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
      first_sentinel = key;    // Can insert here
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   178
  ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   179
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
//------------------------------hash_insert------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
// Insert into hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
void NodeHash::hash_insert( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
  // // "conflict" comments -- print nodes that conflict
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
  // bool conflict = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
  // n->set_hash();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
  uint hash = n->hash();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
  if (hash == Node::NO_HASH) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
  check_grow();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
  uint key = hash & (_max-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
  uint stride = key | 0x01;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
  while( 1 ) {                  // While probing hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
    debug_only( _insert_probes++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
    Node *k = _table[key];      // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
    if( !k || (k == _sentinel) ) break;       // Found a slot
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
    assert( k != n, "already inserted" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
    // if( PrintCompilation && PrintOptoStatistics && Verbose ) { tty->print("  conflict: "); k->dump(); conflict = true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
    key = (key + stride) & (_max-1); // Stride through table w/ relative prime
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
  _table[key] = n;              // Insert into table!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
  debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
  // if( conflict ) { n->dump(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
//------------------------------hash_delete------------------------------------
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1067
diff changeset
   210
// Replace in hash table with sentinel
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
bool NodeHash::hash_delete( const Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
  Node *k;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
  uint hash = n->hash();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
  if (hash == Node::NO_HASH) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
    debug_only( _delete_misses++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
  uint key = hash & (_max-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
  uint stride = key | 0x01;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
  debug_only( uint counter = 0; );
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1067
diff changeset
   221
  for( ; /* (k != NULL) && (k != _sentinel) */; ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
    debug_only( counter++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
    debug_only( _delete_probes++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
    k = _table[key];            // Get hashed value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
    if( !k ) {                  // Miss?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   226
      debug_only( _delete_misses++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
      if( VerifyOpto ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
        for( uint i=0; i < _max; i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
          assert( _table[i] != n, "changed edges with rehashing" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   231
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   232
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   233
      return false;             // Miss! Not in chain
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
    else if( n == k ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
      debug_only( _delete_hits++ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   237
      _table[key] = _sentinel;  // Hit! Label as deleted entry
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
      debug_only(((Node*)n)->exit_hash_lock()); // Unlock the node upon removal from table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   239
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   241
    else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   242
      // collision: move through table with prime offset
489c9b5090e2 Initial load
duke
parents:
diff changeset
   243
      key = (key + stride/*7*/) & (_max-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   244
      assert( counter <= _insert_limit, "Cycle in hash-table");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   246
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
  ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   248
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   249
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   250
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
//------------------------------round_up---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   252
// Round up to nearest power of 2
489c9b5090e2 Initial load
duke
parents:
diff changeset
   253
uint NodeHash::round_up( uint x ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   254
  x += (x>>2);                  // Add 25% slop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   255
  if( x <16 ) return 16;        // Small stuff
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
  uint i=16;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
  while( i < x ) i <<= 1;       // Double to fit
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
  return i;                     // Return hash table size
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
//------------------------------grow-------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   262
// Grow _table to next power of 2 and insert old entries
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
void  NodeHash::grow() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   264
  // Record old state
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
  uint   old_max   = _max;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
  Node **old_table = _table;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
  // Construct new table with twice the space
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
  _grows++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
  _total_inserts       += _inserts;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
  _total_insert_probes += _insert_probes;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
  _inserts         = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
  _insert_probes   = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
  _max     = _max << 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
  _table   = NEW_ARENA_ARRAY( _a , Node* , _max ); // (Node**)_a->Amalloc( _max * sizeof(Node*) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
  memset(_table,0,sizeof(Node*)*_max);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
  _insert_limit = insert_limit();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
  // Insert old entries into the new table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
  for( uint i = 0; i < old_max; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
    Node *m = *old_table++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
    if( !m || m == _sentinel ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
    debug_only(m->exit_hash_lock()); // Unlock the node upon removal from old table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
    hash_insert(m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
//------------------------------clear------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
// Clear all entries in _table to NULL but keep storage
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
void  NodeHash::clear() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
  // Unlock all nodes upon removal from table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
  for (uint i = 0; i < _max; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
    Node* n = _table[i];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
    if (!n || n == _sentinel)  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
    n->exit_hash_lock();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
  memset( _table, 0, _max * sizeof(Node*) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
//-----------------------remove_useless_nodes----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
// Remove useless nodes from value table,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   303
// implementation does not depend on hash function
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
void NodeHash::remove_useless_nodes(VectorSet &useful) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
489c9b5090e2 Initial load
duke
parents:
diff changeset
   306
  // Dead nodes in the hash table inherited from GVN should not replace
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
  // existing nodes, remove dead nodes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
  uint max = size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
  Node *sentinel_node = sentinel();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
  for( uint i = 0; i < max; ++i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
    Node *n = at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
    if(n != NULL && n != sentinel_node && !useful.test(n->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   313
      debug_only(n->exit_hash_lock()); // Unlock the node when removed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
      _table[i] = sentinel_node;       // Replace with placeholder
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   316
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
//------------------------------dump-------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
// Dump statistics for the hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
void NodeHash::dump() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
  _total_inserts       += _inserts;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
  _total_insert_probes += _insert_probes;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   325
  if( PrintCompilation && PrintOptoStatistics && Verbose && (_inserts > 0) ) { // PrintOptoGVN
489c9b5090e2 Initial load
duke
parents:
diff changeset
   326
    if( PrintCompilation2 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
      for( uint i=0; i<_max; i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
      if( _table[i] )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
        tty->print("%d/%d/%d ",i,_table[i]->hash()&(_max-1),_table[i]->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
    tty->print("\nGVN Hash stats:  %d grows to %d max_size\n", _grows, _max);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
    tty->print("  %d/%d (%8.1f%% full)\n", _inserts, _max, (double)_inserts/_max*100.0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
    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
   334
    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
   335
    // sentinels increase lookup cost, but not insert cost
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
    assert((_lookup_misses+_lookup_hits)*4+100 >= _look_probes, "bad hash function");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   337
    assert( _inserts+(_inserts>>3) < _max, "table too full" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
    assert( _inserts*3+100 >= _insert_probes, "bad hash function" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   339
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   341
489c9b5090e2 Initial load
duke
parents:
diff changeset
   342
Node *NodeHash::find_index(uint idx) { // For debugging
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
  // Find an entry by its index value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   344
  for( uint i = 0; i < _max; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
    Node *m = _table[i];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
    if( !m || m == _sentinel ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
    if( m->_idx == (uint)idx ) return m;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
NodeHash::~NodeHash() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
  // Unlock all nodes upon destruction of table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
  if (_table != (Node**)badAddress)  clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
void NodeHash::operator=(const NodeHash& nh) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
  // Unlock all nodes upon replacement of table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
  if (&nh == this)  return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
  if (_table != (Node**)badAddress)  clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
  memcpy(this, &nh, sizeof(*this));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   364
  // Do not increment hash_lock counts again.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
  // Instead, be sure we never again use the source table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
  ((NodeHash*)&nh)->_table = (Node**)badAddress;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   374
//------------------------------PhaseRemoveUseless-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
// 1) Use a breadthfirst walk to collect useful nodes reachable from root.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
PhaseRemoveUseless::PhaseRemoveUseless( PhaseGVN *gvn, Unique_Node_List *worklist ) : Phase(Remove_Useless),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
  _useful(Thread::current()->resource_area()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
  // Implementation requires 'UseLoopSafepoints == true' and an edge from root
489c9b5090e2 Initial load
duke
parents:
diff changeset
   380
  // to each SafePointNode at a backward branch.  Inserted in add_safepoint().
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
  if( !UseLoopSafepoints || !OptoRemoveUseless ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
  // Identify nodes that are reachable from below, useful.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
  C->identify_useful_nodes(_useful);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
  // Remove all useless nodes from PhaseValues' recorded types
489c9b5090e2 Initial load
duke
parents:
diff changeset
   387
  // Must be done before disconnecting nodes to preserve hash-table-invariant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
  gvn->remove_useless_nodes(_useful.member_set());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
  // Remove all useless nodes from future worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   391
  worklist->remove_useless_nodes(_useful.member_set());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
  // Disconnect 'useless' nodes that are adjacent to useful nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
  C->remove_useless_nodes(_useful);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   395
489c9b5090e2 Initial load
duke
parents:
diff changeset
   396
  // Remove edges from "root" to each SafePoint at a backward branch.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
  // They were inserted during parsing (see add_safepoint()) to make infinite
489c9b5090e2 Initial load
duke
parents:
diff changeset
   398
  // loops without calls or exceptions visible to root, i.e., useful.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
  Node *root = C->root();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
  if( root != NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
    for( uint i = root->req(); i < root->len(); ++i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
      Node *n = root->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
      if( n != NULL && n->is_SafePoint() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
        root->rm_prec(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
        --i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
      }
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
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
//------------------------------PhaseTransform---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
PhaseTransform::PhaseTransform( PhaseNumber pnum ) : Phase(pnum),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
  _arena(Thread::current()->resource_area()),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
  _nodes(_arena),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
  _types(_arena)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
  init_con_caches();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   420
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   421
  clear_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   422
  clear_transforms();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   423
  set_allow_progress(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   425
  // Force allocation for currently existing nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   426
  _types.map(C->unique(), NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   427
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   428
489c9b5090e2 Initial load
duke
parents:
diff changeset
   429
//------------------------------PhaseTransform---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   430
PhaseTransform::PhaseTransform( Arena *arena, PhaseNumber pnum ) : Phase(pnum),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
  _arena(arena),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   432
  _nodes(arena),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   433
  _types(arena)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
  init_con_caches();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
  clear_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
  clear_transforms();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
  set_allow_progress(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   441
  // Force allocation for currently existing nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   442
  _types.map(C->unique(), NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
//------------------------------PhaseTransform---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
// Initialize with previously generated type information
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
PhaseTransform::PhaseTransform( PhaseTransform *pt, PhaseNumber pnum ) : Phase(pnum),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
  _arena(pt->_arena),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   449
  _nodes(pt->_nodes),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
  _types(pt->_types)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   451
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
  init_con_caches();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
  clear_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
  clear_transforms();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
  set_allow_progress(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   459
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
void PhaseTransform::init_con_caches() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
  memset(_icons,0,sizeof(_icons));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
  memset(_lcons,0,sizeof(_lcons));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
  memset(_zcons,0,sizeof(_zcons));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
//--------------------------------find_int_type--------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
const TypeInt* PhaseTransform::find_int_type(Node* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
  if (n == NULL)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
  // Call type_or_null(n) to determine node's type since we might be in
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
  // parse phase and call n->Value() may return wrong type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
  // (For example, a phi node at the beginning of loop parsing is not ready.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
  const Type* t = type_or_null(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
  if (t == NULL)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
  return t->isa_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
//-------------------------------find_long_type--------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
const TypeLong* PhaseTransform::find_long_type(Node* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
  if (n == NULL)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   482
  // (See comment above on type_or_null.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
  const Type* t = type_or_null(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
  if (t == NULL)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
  return t->isa_long();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
489c9b5090e2 Initial load
duke
parents:
diff changeset
   489
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   490
void PhaseTransform::dump_old2new_map() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
  _nodes.dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
void PhaseTransform::dump_new( uint nidx ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
  for( uint i=0; i<_nodes.Size(); i++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
    if( _nodes[i] && _nodes[i]->_idx == nidx ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
      _nodes[i]->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
      tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
      tty->print_cr("Old index= %d",i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
      return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   502
  tty->print_cr("Node %d not found in the new indices", nidx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   503
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   504
489c9b5090e2 Initial load
duke
parents:
diff changeset
   505
//------------------------------dump_types-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   506
void PhaseTransform::dump_types( ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   507
  _types.dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
489c9b5090e2 Initial load
duke
parents:
diff changeset
   510
//------------------------------dump_nodes_and_types---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   511
void PhaseTransform::dump_nodes_and_types(const Node *root, uint depth, bool only_ctrl) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   512
  VectorSet visited(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   513
  dump_nodes_and_types_recur( root, depth, only_ctrl, visited );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   514
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
489c9b5090e2 Initial load
duke
parents:
diff changeset
   516
//------------------------------dump_nodes_and_types_recur---------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
void PhaseTransform::dump_nodes_and_types_recur( const Node *n, uint depth, bool only_ctrl, VectorSet &visited) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
  if( !n ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
  if( depth == 0 ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
  if( visited.test_set(n->_idx) ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
  for( uint i=0; i<n->len(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
    if( only_ctrl && !(n->is_Region()) && i != TypeFunc::Control ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
    dump_nodes_and_types_recur( n->in(i), depth-1, only_ctrl, visited );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
  n->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   526
  if (type_or_null(n) != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
    tty->print("      "); type(n)->dump(); tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
//------------------------------PhaseValues------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
// Set minimum table size to "255"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
PhaseValues::PhaseValues( Arena *arena, uint est_max_size ) : PhaseTransform(arena, GVN), _table(arena, est_max_size) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
  NOT_PRODUCT( clear_new_values(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
//------------------------------PhaseValues------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
// Set minimum table size to "255"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   543
PhaseValues::PhaseValues( PhaseValues *ptv ) : PhaseTransform( ptv, GVN ),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   544
  _table(&ptv->_table) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
  NOT_PRODUCT( clear_new_values(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
489c9b5090e2 Initial load
duke
parents:
diff changeset
   548
//------------------------------PhaseValues------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
// Used by +VerifyOpto.  Clear out hash table but copy _types array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
PhaseValues::PhaseValues( PhaseValues *ptv, const char *dummy ) : PhaseTransform( ptv, GVN ),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
  _table(ptv->arena(),ptv->_table.size()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
  NOT_PRODUCT( clear_new_values(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   553
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   554
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
//------------------------------~PhaseValues-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   557
PhaseValues::~PhaseValues() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   558
  _table.dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   559
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
  // Statistics for value progress and efficiency
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
  if( PrintCompilation && Verbose && WizardMode ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   562
    tty->print("\n%sValues: %d nodes ---> %d/%d (%d)",
489c9b5090e2 Initial load
duke
parents:
diff changeset
   563
      is_IterGVN() ? "Iter" : "    ", C->unique(), made_progress(), made_transforms(), made_new_values());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   564
    if( made_transforms() != 0 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   565
      tty->print_cr("  ratio %f", made_progress()/(float)made_transforms() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
      tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   569
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
//------------------------------makecon----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   574
ConNode* PhaseTransform::makecon(const Type *t) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   575
  assert(t->singleton(), "must be a constant");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   576
  assert(!t->empty() || t == Type::TOP, "must not be vacuous range");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
  switch (t->base()) {  // fast paths
489c9b5090e2 Initial load
duke
parents:
diff changeset
   578
  case Type::Half:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   579
  case Type::Top:  return (ConNode*) C->top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
  case Type::Int:  return intcon( t->is_int()->get_con() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
  case Type::Long: return longcon( t->is_long()->get_con() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   583
  if (t->is_zero_type())
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
    return zerocon(t->basic_type());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
  return uncached_makecon(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   586
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   587
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
//--------------------------uncached_makecon-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   589
// Make an idealized constant - one of ConINode, ConPNode, etc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   590
ConNode* PhaseValues::uncached_makecon(const Type *t) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   591
  assert(t->singleton(), "must be a constant");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
  ConNode* x = ConNode::make(C, t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
  ConNode* k = (ConNode*)hash_find_insert(x); // Value numbering
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
  if (k == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
    set_type(x, t);             // Missed, provide type mapping
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
    GrowableArray<Node_Notes*>* nna = C->node_note_array();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
    if (nna != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
      Node_Notes* loc = C->locate_node_notes(nna, x->_idx, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
      loc->clear(); // do not put debug info on constants
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
    x->destruct();              // Hit, destroy duplicate constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
    x = k;                      // use existing constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   605
  return x;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
//------------------------------intcon-----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   609
// Fast integer constant.  Same as "transform(new ConINode(TypeInt::make(i)))"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   610
ConINode* PhaseTransform::intcon(int i) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   611
  // Small integer?  Check cache! Check that cached node is not dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   612
  if (i >= _icon_min && i <= _icon_max) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   613
    ConINode* icon = _icons[i-_icon_min];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   614
    if (icon != NULL && icon->in(TypeFunc::Control) != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   615
      return icon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   616
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   617
  ConINode* icon = (ConINode*) uncached_makecon(TypeInt::make(i));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   618
  assert(icon->is_Con(), "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   619
  if (i >= _icon_min && i <= _icon_max)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   620
    _icons[i-_icon_min] = icon;   // Cache small integers
489c9b5090e2 Initial load
duke
parents:
diff changeset
   621
  return icon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   622
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   623
489c9b5090e2 Initial load
duke
parents:
diff changeset
   624
//------------------------------longcon----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   625
// Fast long constant.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   626
ConLNode* PhaseTransform::longcon(jlong l) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   627
  // Small integer?  Check cache! Check that cached node is not dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   628
  if (l >= _lcon_min && l <= _lcon_max) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   629
    ConLNode* lcon = _lcons[l-_lcon_min];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   630
    if (lcon != NULL && lcon->in(TypeFunc::Control) != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   631
      return lcon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   632
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   633
  ConLNode* lcon = (ConLNode*) uncached_makecon(TypeLong::make(l));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   634
  assert(lcon->is_Con(), "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   635
  if (l >= _lcon_min && l <= _lcon_max)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   636
    _lcons[l-_lcon_min] = lcon;      // Cache small integers
489c9b5090e2 Initial load
duke
parents:
diff changeset
   637
  return lcon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   638
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   639
489c9b5090e2 Initial load
duke
parents:
diff changeset
   640
//------------------------------zerocon-----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   641
// Fast zero or null constant. Same as "transform(ConNode::make(Type::get_zero_type(bt)))"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   642
ConNode* PhaseTransform::zerocon(BasicType bt) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   643
  assert((uint)bt <= _zcon_max, "domain check");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   644
  ConNode* zcon = _zcons[bt];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   645
  if (zcon != NULL && zcon->in(TypeFunc::Control) != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   646
    return zcon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   647
  zcon = (ConNode*) uncached_makecon(Type::get_zero_type(bt));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   648
  _zcons[bt] = zcon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   649
  return zcon;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   650
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   651
489c9b5090e2 Initial load
duke
parents:
diff changeset
   652
489c9b5090e2 Initial load
duke
parents:
diff changeset
   653
489c9b5090e2 Initial load
duke
parents:
diff changeset
   654
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   655
//------------------------------transform--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   656
// 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
   657
// faster or cheaper fashion.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   658
Node *PhaseGVN::transform( Node *n ) {
214
c5d9b4456687 6667605: (Escape Analysis) inline java constructors when EA is on
kvn
parents: 1
diff changeset
   659
  return transform_no_reclaim(n);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   660
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   661
489c9b5090e2 Initial load
duke
parents:
diff changeset
   662
//------------------------------transform--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   663
// Return a node which computes the same function as this node, but
489c9b5090e2 Initial load
duke
parents:
diff changeset
   664
// in a faster or cheaper fashion.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   665
Node *PhaseGVN::transform_no_reclaim( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   666
  NOT_PRODUCT( set_transforms(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   667
489c9b5090e2 Initial load
duke
parents:
diff changeset
   668
  // Apply the Ideal call in a loop until it no longer applies
489c9b5090e2 Initial load
duke
parents:
diff changeset
   669
  Node *k = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   670
  NOT_PRODUCT( uint loop_count = 0; )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   671
  while( 1 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   672
    Node *i = k->Ideal(this, /*can_reshape=*/false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   673
    if( !i ) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   674
    assert( i->_idx >= k->_idx, "Idealize should return new nodes, use Identity to return old nodes" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   675
    k = i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   676
    assert(loop_count++ < K, "infinite loop in PhaseGVN::transform");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   677
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   678
  NOT_PRODUCT( if( loop_count != 0 ) { set_progress(); } )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   679
489c9b5090e2 Initial load
duke
parents:
diff changeset
   680
489c9b5090e2 Initial load
duke
parents:
diff changeset
   681
  // If brand new node, make space in type array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   682
  ensure_type_or_null(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   683
489c9b5090e2 Initial load
duke
parents:
diff changeset
   684
  // Since I just called 'Value' to compute the set of run-time values
489c9b5090e2 Initial load
duke
parents:
diff changeset
   685
  // for this Node, and 'Value' is non-local (and therefore expensive) I'll
489c9b5090e2 Initial load
duke
parents:
diff changeset
   686
  // cache Value.  Later requests for the local phase->type of this Node can
489c9b5090e2 Initial load
duke
parents:
diff changeset
   687
  // use the cached Value instead of suffering with 'bottom_type'.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   688
  const Type *t = k->Value(this); // Get runtime Value set
489c9b5090e2 Initial load
duke
parents:
diff changeset
   689
  assert(t != NULL, "value sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   690
  if (type_or_null(k) != t) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   691
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   692
    // Do not count initial visit to node as a transformation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   693
    if (type_or_null(k) == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   694
      inc_new_values();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   695
      set_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   696
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   697
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   698
    set_type(k, t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   699
    // If k is a TypeNode, capture any more-precise type permanently into Node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   700
    k->raise_bottom_type(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   701
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   702
489c9b5090e2 Initial load
duke
parents:
diff changeset
   703
  if( t->singleton() && !k->is_Con() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   704
    NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   705
    return makecon(t);          // Turn into a constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   706
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   707
489c9b5090e2 Initial load
duke
parents:
diff changeset
   708
  // Now check for Identities
489c9b5090e2 Initial load
duke
parents:
diff changeset
   709
  Node *i = k->Identity(this);  // Look for a nearby replacement
489c9b5090e2 Initial load
duke
parents:
diff changeset
   710
  if( i != k ) {                // Found? Return replacement!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   711
    NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   712
    return i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   713
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   714
489c9b5090e2 Initial load
duke
parents:
diff changeset
   715
  // Global Value Numbering
489c9b5090e2 Initial load
duke
parents:
diff changeset
   716
  i = hash_find_insert(k);      // Insert if new
489c9b5090e2 Initial load
duke
parents:
diff changeset
   717
  if( i && (i != k) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   718
    // Return the pre-existing node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   719
    NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   720
    return i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   721
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   722
489c9b5090e2 Initial load
duke
parents:
diff changeset
   723
  // Return Idealized original
489c9b5090e2 Initial load
duke
parents:
diff changeset
   724
  return k;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   725
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   726
489c9b5090e2 Initial load
duke
parents:
diff changeset
   727
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   728
//------------------------------dead_loop_check--------------------------------
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1067
diff changeset
   729
// Check for a simple dead loop when a data node references itself directly
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   730
// or through an other data node excluding cons and phis.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   731
void PhaseGVN::dead_loop_check( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   732
  // Phi may reference itself in a loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   733
  if (n != NULL && !n->is_dead_loop_safe() && !n->is_CFG()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   734
    // Do 2 levels check and only data inputs.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   735
    bool no_dead_loop = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   736
    uint cnt = n->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   737
    for (uint i = 1; i < cnt && no_dead_loop; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   738
      Node *in = n->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   739
      if (in == n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   740
        no_dead_loop = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   741
      } else if (in != NULL && !in->is_dead_loop_safe()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   742
        uint icnt = in->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   743
        for (uint j = 1; j < icnt && no_dead_loop; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   744
          if (in->in(j) == n || in->in(j) == in)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   745
            no_dead_loop = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   746
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   747
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   748
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   749
    if (!no_dead_loop) n->dump(3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   750
    assert(no_dead_loop, "dead loop detected");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   751
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   752
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   753
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   754
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   756
//------------------------------PhaseIterGVN-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   757
// Initialize hash table to fresh and clean for +VerifyOpto
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
   758
PhaseIterGVN::PhaseIterGVN( PhaseIterGVN *igvn, const char *dummy ) : PhaseGVN(igvn,dummy), _worklist( ),
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
   759
                                                                      _delay_transform(false) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
489c9b5090e2 Initial load
duke
parents:
diff changeset
   762
//------------------------------PhaseIterGVN-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   763
// Initialize with previous PhaseIterGVN info; used by PhaseCCP
489c9b5090e2 Initial load
duke
parents:
diff changeset
   764
PhaseIterGVN::PhaseIterGVN( PhaseIterGVN *igvn ) : PhaseGVN(igvn),
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
   765
                                                   _worklist( igvn->_worklist ),
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
   766
                                                   _delay_transform(igvn->_delay_transform)
1
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
//------------------------------PhaseIterGVN-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   771
// Initialize with previous PhaseGVN info from Parser
489c9b5090e2 Initial load
duke
parents:
diff changeset
   772
PhaseIterGVN::PhaseIterGVN( PhaseGVN *gvn ) : PhaseGVN(gvn),
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
   773
                                              _worklist(*C->for_igvn()),
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
   774
                                              _delay_transform(false)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   775
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   776
  uint max;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   777
489c9b5090e2 Initial load
duke
parents:
diff changeset
   778
  // Dead nodes in the hash table inherited from GVN were not treated as
489c9b5090e2 Initial load
duke
parents:
diff changeset
   779
  // roots during def-use info creation; hence they represent an invisible
489c9b5090e2 Initial load
duke
parents:
diff changeset
   780
  // use.  Clear them out.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   781
  max = _table.size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   782
  for( uint i = 0; i < max; ++i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   783
    Node *n = _table.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   784
    if(n != NULL && n != _table.sentinel() && n->outcnt() == 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   785
      if( n->is_top() ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   786
      assert( false, "Parse::remove_useless_nodes missed this node");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   787
      hash_delete(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
  // Any Phis or Regions on the worklist probably had uses that could not
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
  // make more progress because the uses were made while the Phis and Regions
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
  // were in half-built states.  Put all uses of Phis and Regions on worklist.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
  max = _worklist.size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
  for( uint j = 0; j < max; j++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
    Node *n = _worklist.at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
    uint uop = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   798
    if( uop == Op_Phi || uop == Op_Region ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   799
        n->is_Type() ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   800
        n->is_Mem() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   801
      add_users_to_worklist(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   802
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   803
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   804
489c9b5090e2 Initial load
duke
parents:
diff changeset
   805
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   807
void PhaseIterGVN::verify_step(Node* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
  _verify_window[_verify_counter % _verify_window_size] = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   809
  ++_verify_counter;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   810
  ResourceMark rm;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   811
  ResourceArea *area = Thread::current()->resource_area();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   812
  VectorSet old_space(area), new_space(area);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   813
  if (C->unique() < 1000 ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   814
      0 == _verify_counter % (C->unique() < 10000 ? 10 : 100)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
    ++_verify_full_passes;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
    Node::verify_recur(C->root(), -1, old_space, new_space);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
  const int verify_depth = 4;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
  for ( int i = 0; i < _verify_window_size; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
    Node* n = _verify_window[i];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
    if ( n == NULL )  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   822
    if( n->in(0) == NodeSentinel ) {  // xform_idom
489c9b5090e2 Initial load
duke
parents:
diff changeset
   823
      _verify_window[i] = n->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   824
      --i; continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   825
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   826
    // Typical fanout is 1-2, so this call visits about 6 nodes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   827
    Node::verify_recur(n, verify_depth, old_space, new_space);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   828
  }
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
489c9b5090e2 Initial load
duke
parents:
diff changeset
   832
489c9b5090e2 Initial load
duke
parents:
diff changeset
   833
//------------------------------init_worklist----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   834
// Initialize worklist for each node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   835
void PhaseIterGVN::init_worklist( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   836
  if( _worklist.member(n) ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   837
  _worklist.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   838
  uint cnt = n->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   839
  for( uint i =0 ; i < cnt; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   840
    Node *m = n->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   841
    if( m ) init_worklist(m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   842
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   843
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   844
489c9b5090e2 Initial load
duke
parents:
diff changeset
   845
//------------------------------optimize---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   846
void PhaseIterGVN::optimize() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   847
  debug_only(uint num_processed  = 0;);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   848
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   849
  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   850
    _verify_counter = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   851
    _verify_full_passes = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   852
    for ( int i = 0; i < _verify_window_size; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   853
      _verify_window[i] = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   854
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   855
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   856
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   857
6752
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   858
#ifdef ASSERT
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   859
  Node* prev = NULL;
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   860
  uint rep_cnt = 0;
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   861
#endif
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   862
  uint loop_count = 0;
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   863
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   864
  // Pull from worklist; transform node;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   865
  // If node has changed: update edge info and put uses on worklist.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   866
  while( _worklist.size() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   867
    Node *n  = _worklist.pop();
6752
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   868
    if (++loop_count >= K * C->unique()) {
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   869
      debug_only(n->dump(4);)
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   870
      assert(false, "infinite loop in PhaseIterGVN::optimize");
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   871
      C->record_method_not_compilable("infinite loop in PhaseIterGVN::optimize");
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   872
      return;
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   873
    }
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   874
#ifdef ASSERT
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   875
    if (n == prev) {
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   876
      if (++rep_cnt > 3) {
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   877
        n->dump(4);
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   878
        assert(false, "loop in Ideal transformation");
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   879
      }
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   880
    } else {
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   881
      rep_cnt = 0;
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   882
    }
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   883
    prev = n;
9a3b09fd5745 6916062: assert(_inserts <= _insert_limit,"hash table overflow") in NodeHash::hash_insert
kvn
parents: 5901
diff changeset
   884
#endif
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   885
    if (TraceIterativeGVN && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
      tty->print("  Pop ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   887
      NOT_PRODUCT( n->dump(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   888
      debug_only(if( (num_processed++ % 100) == 0 ) _worklist.print_set();)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   889
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   890
489c9b5090e2 Initial load
duke
parents:
diff changeset
   891
    if (n->outcnt() != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   892
489c9b5090e2 Initial load
duke
parents:
diff changeset
   893
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   894
      uint wlsize = _worklist.size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
      const Type* oldtype = type_or_null(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
#endif //PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
489c9b5090e2 Initial load
duke
parents:
diff changeset
   898
      Node *nn = transform_old(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
489c9b5090e2 Initial load
duke
parents:
diff changeset
   900
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   901
      if (TraceIterativeGVN) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   902
        const Type* newtype = type_or_null(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   903
        if (nn != n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   904
          // print old node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   905
          tty->print("< ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   906
          if (oldtype != newtype && oldtype != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   907
            oldtype->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   908
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   909
          do { tty->print("\t"); } while (tty->position() < 16);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   910
          tty->print("<");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   911
          n->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   912
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   913
        if (oldtype != newtype || nn != n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   914
          // print new node and/or new type
489c9b5090e2 Initial load
duke
parents:
diff changeset
   915
          if (oldtype == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   916
            tty->print("* ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   917
          } else if (nn != n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   918
            tty->print("> ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   919
          } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   920
            tty->print("= ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   921
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   922
          if (newtype == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   923
            tty->print("null");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   924
          } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   925
            newtype->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   926
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   927
          do { tty->print("\t"); } while (tty->position() < 16);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   928
          nn->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   929
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   930
        if (Verbose && wlsize < _worklist.size()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   931
          tty->print("  Push {");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   932
          while (wlsize != _worklist.size()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   933
            Node* pushed = _worklist.at(wlsize++);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   934
            tty->print(" %d", pushed->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   935
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   936
          tty->print_cr(" }");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   937
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   938
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   939
      if( VerifyIterativeGVN && nn != n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   940
        verify_step((Node*) NULL);  // ignore n, it might be subsumed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   941
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   942
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   943
    } else if (!n->is_top()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   944
      remove_dead_node(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
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   949
  C->verify_graph_edges();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   950
  if( VerifyOpto && allow_progress() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   951
    // Must turn off allow_progress to enable assert and break recursion
489c9b5090e2 Initial load
duke
parents:
diff changeset
   952
    C->root()->verify();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   953
    { // Check if any progress was missed using IterGVN
489c9b5090e2 Initial load
duke
parents:
diff changeset
   954
      // Def-Use info enables transformations not attempted in wash-pass
489c9b5090e2 Initial load
duke
parents:
diff changeset
   955
      // e.g. Region/Phi cleanup, ...
489c9b5090e2 Initial load
duke
parents:
diff changeset
   956
      // Null-check elision -- may not have reached fixpoint
489c9b5090e2 Initial load
duke
parents:
diff changeset
   957
      //                       do not propagate to dominated nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   958
      ResourceMark rm;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   959
      PhaseIterGVN igvn2(this,"Verify"); // Fresh and clean!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   960
      // Fill worklist completely
489c9b5090e2 Initial load
duke
parents:
diff changeset
   961
      igvn2.init_worklist(C->root());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   962
489c9b5090e2 Initial load
duke
parents:
diff changeset
   963
      igvn2.set_allow_progress(false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   964
      igvn2.optimize();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   965
      igvn2.set_allow_progress(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   966
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   967
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   968
  if ( VerifyIterativeGVN && PrintOpto ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   969
    if ( _verify_counter == _verify_full_passes )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   970
      tty->print_cr("VerifyIterativeGVN: %d transforms and verify passes",
489c9b5090e2 Initial load
duke
parents:
diff changeset
   971
                    _verify_full_passes);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   972
    else
489c9b5090e2 Initial load
duke
parents:
diff changeset
   973
      tty->print_cr("VerifyIterativeGVN: %d transforms, %d full verify passes",
489c9b5090e2 Initial load
duke
parents:
diff changeset
   974
                  _verify_counter, _verify_full_passes);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   975
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   976
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   977
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   978
489c9b5090e2 Initial load
duke
parents:
diff changeset
   979
489c9b5090e2 Initial load
duke
parents:
diff changeset
   980
//------------------register_new_node_with_optimizer---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   981
// Register a new node with the optimizer.  Update the types array, the def-use
489c9b5090e2 Initial load
duke
parents:
diff changeset
   982
// info.  Put on worklist.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   983
Node* PhaseIterGVN::register_new_node_with_optimizer(Node* n, Node* orig) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   984
  set_type_bottom(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   985
  _worklist.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   986
  if (orig != NULL)  C->copy_node_notes_to(n, orig);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   987
  return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   988
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   989
489c9b5090e2 Initial load
duke
parents:
diff changeset
   990
//------------------------------transform--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   991
// Non-recursive: idealize Node 'n' with respect to its inputs and its value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   992
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
   993
  if (_delay_transform) {
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
   994
    // 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
   995
    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
   996
    return n;
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
   997
  }
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 238
diff changeset
   998
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   999
  // If brand new node, make space in type array, and give it a type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1000
  ensure_type_or_null(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1001
  if (type_or_null(n) == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1002
    set_type_bottom(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1003
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1004
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1005
  return transform_old(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1006
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1007
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1008
//------------------------------transform_old----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1009
Node *PhaseIterGVN::transform_old( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1010
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1011
  debug_only(uint loop_count = 0;);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1012
  set_transforms();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1014
  // Remove 'n' from hash table in case it gets modified
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1015
  _table.hash_delete(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1016
  if( VerifyIterativeGVN ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1017
   assert( !_table.find_index(n->_idx), "found duplicate entry in table");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1018
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1019
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1020
  // Apply the Ideal call in a loop until it no longer applies
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1021
  Node *k = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1022
  DEBUG_ONLY(dead_loop_check(k);)
1067
f82e0a8cd438 6736417: Fastdebug C2 crashes in StoreBNode::Ideal
kvn
parents: 670
diff changeset
  1023
  DEBUG_ONLY(bool is_new = (k->outcnt() == 0);)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1024
  Node *i = k->Ideal(this, /*can_reshape=*/true);
1067
f82e0a8cd438 6736417: Fastdebug C2 crashes in StoreBNode::Ideal
kvn
parents: 670
diff changeset
  1025
  assert(i != k || is_new || i->outcnt() > 0, "don't return dead nodes");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1026
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1027
  if( VerifyIterativeGVN )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1028
    verify_step(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1029
  if( i && VerifyOpto ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1030
    if( !allow_progress() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1031
      if (i->is_Add() && i->outcnt() == 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1032
        // Switched input to left side because this is the only use
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1033
      } else if( i->is_If() && (i->in(0) == NULL) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1034
        // This IF is dead because it is dominated by an equivalent IF When
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1035
        // dominating if changed, info is not propagated sparsely to 'this'
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1036
        // Propagating this info further will spuriously identify other
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1037
        // progress.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1038
        return i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1039
      } else
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1040
        set_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1041
    } else
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1042
      set_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1043
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1044
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1045
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1046
  while( i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1047
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1048
    debug_only( if( loop_count >= K ) i->dump(4); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1049
    assert(loop_count < K, "infinite loop in PhaseIterGVN::transform");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1050
    debug_only( loop_count++; )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1051
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1052
    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
  1053
    // Made a change; put users of original Node on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1054
    add_users_to_worklist( k );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1055
    // Replacing root of transform tree?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1056
    if( k != i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1057
      // Make users of old Node now use new.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1058
      subsume_node( k, i );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1059
      k = i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1060
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1061
    DEBUG_ONLY(dead_loop_check(k);)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1062
    // Try idealizing again
1067
f82e0a8cd438 6736417: Fastdebug C2 crashes in StoreBNode::Ideal
kvn
parents: 670
diff changeset
  1063
    DEBUG_ONLY(is_new = (k->outcnt() == 0);)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1064
    i = k->Ideal(this, /*can_reshape=*/true);
1067
f82e0a8cd438 6736417: Fastdebug C2 crashes in StoreBNode::Ideal
kvn
parents: 670
diff changeset
  1065
    assert(i != k || is_new || i->outcnt() > 0, "don't return dead nodes");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1066
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1067
    if( VerifyIterativeGVN )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1068
      verify_step(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1069
    if( i && VerifyOpto ) set_progress();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1070
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1071
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1072
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1073
  // If brand new node, make space in type array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1074
  ensure_type_or_null(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1075
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1076
  // See what kind of values 'k' takes on at runtime
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1077
  const Type *t = k->Value(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1078
  assert(t != NULL, "value sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1079
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1080
  // Since I just called 'Value' to compute the set of run-time values
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1081
  // for this Node, and 'Value' is non-local (and therefore expensive) I'll
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1082
  // cache Value.  Later requests for the local phase->type of this Node can
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1083
  // use the cached Value instead of suffering with 'bottom_type'.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1084
  if (t != type_or_null(k)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1085
    NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1086
    NOT_PRODUCT( inc_new_values();)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1087
    set_type(k, t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1088
    // If k is a TypeNode, capture any more-precise type permanently into Node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1089
    k->raise_bottom_type(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1090
    // Move users of node to worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1091
    add_users_to_worklist( k );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1092
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1093
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1094
  // If 'k' computes a constant, replace it with a constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1095
  if( t->singleton() && !k->is_Con() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1096
    NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1097
    Node *con = makecon(t);     // Make a constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1098
    add_users_to_worklist( k );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1099
    subsume_node( k, con );     // Everybody using k now uses con
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1100
    return con;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1101
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1102
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1103
  // Now check for Identities
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1104
  i = k->Identity(this);        // Look for a nearby replacement
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1105
  if( i != k ) {                // Found? Return replacement!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1106
    NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1107
    add_users_to_worklist( k );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1108
    subsume_node( k, i );       // Everybody using k now uses i
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1109
    return i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1110
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1111
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1112
  // Global Value Numbering
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1113
  i = hash_find_insert(k);      // Check for pre-existing node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1114
  if( i && (i != k) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1115
    // Return the pre-existing node if it isn't dead
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1116
    NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1117
    add_users_to_worklist( k );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1118
    subsume_node( k, i );       // Everybody using k now uses i
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1119
    return i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1120
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1121
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1122
  // Return Idealized original
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1123
  return k;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1124
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1125
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1126
//---------------------------------saturate------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1127
const Type* PhaseIterGVN::saturate(const Type* new_type, const Type* old_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1128
                                   const Type* limit_type) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1129
  return new_type->narrow(old_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1130
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1131
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1132
//------------------------------remove_globally_dead_node----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1133
// Kill a globally dead Node.  All uses are also globally dead and are
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1134
// aggressively trimmed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1135
void PhaseIterGVN::remove_globally_dead_node( Node *dead ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1136
  assert(dead != C->root(), "killing root, eh?");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1137
  if (dead->is_top())  return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1138
  NOT_PRODUCT( set_progress(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1139
  // Remove from iterative worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1140
  _worklist.remove(dead);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1141
  if (!dead->is_Con()) { // Don't kill cons but uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1142
    // Remove from hash table
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1143
    _table.hash_delete( dead );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1144
    // Smash all inputs to 'dead', isolating him completely
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1145
    for( uint i = 0; i < dead->req(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1146
      Node *in = dead->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1147
      if( in ) {                 // Points to something?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1148
        dead->set_req(i,NULL);  // Kill the edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1149
        if (in->outcnt() == 0 && in != C->top()) {// Made input go dead?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1150
          remove_dead_node(in); // Recursively remove
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1151
        } else if (in->outcnt() == 1 &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1152
                   in->has_special_unique_user()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1153
          _worklist.push(in->unique_out());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1154
        } else if (in->outcnt() <= 2 && dead->is_Phi()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1155
          if( in->Opcode() == Op_Region )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1156
            _worklist.push(in);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1157
          else if( in->is_Store() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1158
            DUIterator_Fast imax, i = in->fast_outs(imax);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1159
            _worklist.push(in->fast_out(i));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1160
            i++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1161
            if(in->outcnt() == 2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1162
              _worklist.push(in->fast_out(i));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1163
              i++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1164
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1165
            assert(!(i < imax), "sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1166
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1167
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1168
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1169
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1170
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1171
    if (dead->is_macro()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1172
      C->remove_macro_node(dead);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1173
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1174
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1175
  // Aggressively kill globally dead uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1176
  // (Cannot use DUIterator_Last because of the indefinite number
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1177
  // of edge deletions per loop trip.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1178
  while (dead->outcnt() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1179
    remove_globally_dead_node(dead->raw_out(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1180
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1181
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1182
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1183
//------------------------------subsume_node-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1184
// Remove users from node 'old' and add them to node 'nn'.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1185
void PhaseIterGVN::subsume_node( Node *old, Node *nn ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1186
  assert( old != hash_find(old), "should already been removed" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1187
  assert( old != C->top(), "cannot subsume top node");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1188
  // Copy debug or profile information to the new version:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1189
  C->copy_node_notes_to(nn, old);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1190
  // Move users of node 'old' to node 'nn'
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1191
  for (DUIterator_Last imin, i = old->last_outs(imin); i >= imin; ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1192
    Node* use = old->last_out(i);  // for each use...
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1193
    // use might need re-hashing (but it won't if it's a new node)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1194
    bool is_in_table = _table.hash_delete( use );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1195
    // Update use-def info as well
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1196
    // We remove all occurrences of old within use->in,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1197
    // so as to avoid rehashing any node more than once.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1198
    // The hash table probe swamps any outer loop overhead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1199
    uint num_edges = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1200
    for (uint jmax = use->len(), j = 0; j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1201
      if (use->in(j) == old) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1202
        use->set_req(j, nn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1203
        ++num_edges;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1204
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1205
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1206
    // Insert into GVN hash table if unique
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1207
    // If a duplicate, 'use' will be cleaned up when pulled off worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1208
    if( is_in_table ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1209
      hash_find_insert(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1210
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1211
    i -= num_edges;    // we deleted 1 or more copies of this edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1212
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1213
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1214
  // Smash all inputs to 'old', isolating him completely
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1215
  Node *temp = new (C, 1) Node(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1216
  temp->init_req(0,nn);     // Add a use to nn to prevent him from dying
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1217
  remove_dead_node( old );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1218
  temp->del_req(0);         // Yank bogus edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1219
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1220
  if( VerifyIterativeGVN ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1221
    for ( int i = 0; i < _verify_window_size; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1222
      if ( _verify_window[i] == old )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1223
        _verify_window[i] = nn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1224
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1225
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1226
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1227
  _worklist.remove(temp);   // this can be necessary
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1228
  temp->destruct();         // reuse the _idx of this little guy
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1229
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1230
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1231
//------------------------------add_users_to_worklist--------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1232
void PhaseIterGVN::add_users_to_worklist0( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1233
  for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1234
    _worklist.push(n->fast_out(i));  // Push on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1235
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1236
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1237
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1238
void PhaseIterGVN::add_users_to_worklist( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1239
  add_users_to_worklist0(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1240
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1241
  // Move users of node to worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1242
  for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1243
    Node* use = n->fast_out(i); // Get use
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1244
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1245
    if( use->is_Multi() ||      // Multi-definer?  Push projs on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1246
        use->is_Store() )       // Enable store/load same address
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1247
      add_users_to_worklist0(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1248
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1249
    // If we changed the receiver type to a call, we need to revisit
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1250
    // the Catch following the call.  It's looking for a non-NULL
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1251
    // receiver to know when to enable the regular fall-through path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1252
    // in addition to the NullPtrException path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1253
    if (use->is_CallDynamicJava() && n == use->in(TypeFunc::Parms)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1254
      Node* p = use->as_CallDynamicJava()->proj_out(TypeFunc::Control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1255
      if (p != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1256
        add_users_to_worklist0(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1257
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1258
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1259
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1260
    if( use->is_Cmp() ) {       // Enable CMP/BOOL optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1261
      add_users_to_worklist(use); // Put Bool on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1262
      // Look for the 'is_x2logic' pattern: "x ? : 0 : 1" and put the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1263
      // phi merging either 0 or 1 onto the worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1264
      if (use->outcnt() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1265
        Node* bol = use->raw_out(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1266
        if (bol->outcnt() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1267
          Node* iff = bol->raw_out(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1268
          if (iff->outcnt() == 2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1269
            Node* ifproj0 = iff->raw_out(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1270
            Node* ifproj1 = iff->raw_out(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1271
            if (ifproj0->outcnt() > 0 && ifproj1->outcnt() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1272
              Node* region0 = ifproj0->raw_out(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1273
              Node* region1 = ifproj1->raw_out(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1274
              if( region0 == region1 )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1275
                add_users_to_worklist0(region0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1276
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1277
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1278
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1279
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1280
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1281
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1282
    uint use_op = use->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1283
    // If changed Cast input, check Phi users for simple cycles
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 214
diff changeset
  1284
    if( use->is_ConstraintCast() || use->is_CheckCastPP() ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1285
      for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1286
        Node* u = use->fast_out(i2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1287
        if (u->is_Phi())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1288
          _worklist.push(u);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1289
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1290
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1291
    // If changed LShift inputs, check RShift users for useless sign-ext
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1292
    if( use_op == Op_LShiftI ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1293
      for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1294
        Node* u = use->fast_out(i2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1295
        if (u->Opcode() == Op_RShiftI)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1296
          _worklist.push(u);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1297
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1298
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1299
    // If changed AddP inputs, check Stores for loop invariant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1300
    if( use_op == Op_AddP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1301
      for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1302
        Node* u = use->fast_out(i2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1303
        if (u->is_Mem())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1304
          _worklist.push(u);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1305
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1306
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1307
    // If changed initialization activity, check dependent Stores
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1308
    if (use_op == Op_Allocate || use_op == Op_AllocateArray) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1309
      InitializeNode* init = use->as_Allocate()->initialization();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1310
      if (init != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1311
        Node* imem = init->proj_out(TypeFunc::Memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1312
        if (imem != NULL)  add_users_to_worklist0(imem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1313
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1314
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1315
    if (use_op == Op_Initialize) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1316
      Node* imem = use->as_Initialize()->proj_out(TypeFunc::Memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1317
      if (imem != NULL)  add_users_to_worklist0(imem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1318
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1319
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1320
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1321
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1322
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1323
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1324
uint PhaseCCP::_total_invokes   = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1325
uint PhaseCCP::_total_constants = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1326
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1327
//------------------------------PhaseCCP---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1328
// Conditional Constant Propagation, ala Wegman & Zadeck
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1329
PhaseCCP::PhaseCCP( PhaseIterGVN *igvn ) : PhaseIterGVN(igvn) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1330
  NOT_PRODUCT( clear_constants(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1331
  assert( _worklist.size() == 0, "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1332
  // Clear out _nodes from IterGVN.  Must be clear to transform call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1333
  _nodes.clear();               // Clear out from IterGVN
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1334
  analyze();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1335
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1336
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1337
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1338
//------------------------------~PhaseCCP--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1339
PhaseCCP::~PhaseCCP() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1340
  inc_invokes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1341
  _total_constants += count_constants();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1342
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1343
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1344
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1345
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1346
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1347
static bool ccp_type_widens(const Type* t, const Type* t0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1348
  assert(t->meet(t0) == t, "Not monotonic");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1349
  switch (t->base() == t0->base() ? t->base() : Type::Top) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1350
  case Type::Int:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1351
    assert(t0->isa_int()->_widen <= t->isa_int()->_widen, "widen increases");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1352
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1353
  case Type::Long:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1354
    assert(t0->isa_long()->_widen <= t->isa_long()->_widen, "widen increases");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1355
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1356
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1357
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1358
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1359
#endif //ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1360
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1361
//------------------------------analyze----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1362
void PhaseCCP::analyze() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1363
  // Initialize all types to TOP, optimistic analysis
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1364
  for (int i = C->unique() - 1; i >= 0; i--)  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1365
    _types.map(i,Type::TOP);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1366
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1367
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1368
  // Push root onto worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1369
  Unique_Node_List worklist;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1370
  worklist.push(C->root());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1371
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1372
  // Pull from worklist; compute new value; push changes out.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1373
  // This loop is the meat of CCP.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1374
  while( worklist.size() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1375
    Node *n = worklist.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1376
    const Type *t = n->Value(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1377
    if (t != type(n)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1378
      assert(ccp_type_widens(t, type(n)), "ccp type must widen");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1379
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1380
      if( TracePhaseCCP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1381
        t->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1382
        do { tty->print("\t"); } while (tty->position() < 16);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1383
        n->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1384
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1385
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1386
      set_type(n, t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1387
      for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1388
        Node* m = n->fast_out(i);   // Get user
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1389
        if( m->is_Region() ) {  // New path to Region?  Must recheck Phis too
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1390
          for (DUIterator_Fast i2max, i2 = m->fast_outs(i2max); i2 < i2max; i2++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1391
            Node* p = m->fast_out(i2); // Propagate changes to uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1392
            if( p->bottom_type() != type(p) ) // If not already bottomed out
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1393
              worklist.push(p); // Propagate change to user
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1394
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1395
        }
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1067
diff changeset
  1396
        // If we changed the receiver type to a call, we need to revisit
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1397
        // the Catch following the call.  It's looking for a non-NULL
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1398
        // receiver to know when to enable the regular fall-through path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1399
        // in addition to the NullPtrException path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1400
        if (m->is_Call()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1401
          for (DUIterator_Fast i2max, i2 = m->fast_outs(i2max); i2 < i2max; i2++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1402
            Node* p = m->fast_out(i2);  // Propagate changes to uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1403
            if (p->is_Proj() && p->as_Proj()->_con == TypeFunc::Control && p->outcnt() == 1)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1404
              worklist.push(p->unique_out());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1405
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1406
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1407
        if( m->bottom_type() != type(m) ) // If not already bottomed out
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1408
          worklist.push(m);     // Propagate change to user
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1409
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1410
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1411
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1412
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1413
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1414
//------------------------------do_transform-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1415
// Top level driver for the recursive transformer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1416
void PhaseCCP::do_transform() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1417
  // Correct leaves of new-space Nodes; they point to old-space.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1418
  C->set_root( transform(C->root())->as_Root() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1419
  assert( C->top(),  "missing TOP node" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1420
  assert( C->root(), "missing root" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1421
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1422
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1423
//------------------------------transform--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1424
// Given a Node in old-space, clone him into new-space.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1425
// Convert any of his old-space children into new-space children.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1426
Node *PhaseCCP::transform( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1427
  Node *new_node = _nodes[n->_idx]; // Check for transformed node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1428
  if( new_node != NULL )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1429
    return new_node;                // Been there, done that, return old answer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1430
  new_node = transform_once(n);     // Check for constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1431
  _nodes.map( n->_idx, new_node );  // Flag as having been cloned
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1432
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1433
  // Allocate stack of size _nodes.Size()/2 to avoid frequent realloc
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1434
  GrowableArray <Node *> trstack(C->unique() >> 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1435
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1436
  trstack.push(new_node);           // Process children of cloned node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1437
  while ( trstack.is_nonempty() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1438
    Node *clone = trstack.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1439
    uint cnt = clone->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1440
    for( uint i = 0; i < cnt; i++ ) {          // For all inputs do
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1441
      Node *input = clone->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1442
      if( input != NULL ) {                    // Ignore NULLs
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1443
        Node *new_input = _nodes[input->_idx]; // Check for cloned input node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1444
        if( new_input == NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1445
          new_input = transform_once(input);   // Check for constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1446
          _nodes.map( input->_idx, new_input );// Flag as having been cloned
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1447
          trstack.push(new_input);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1448
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1449
        assert( new_input == clone->in(i), "insanity check");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1450
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1451
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1452
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1453
  return new_node;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1454
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1455
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1456
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1457
//------------------------------transform_once---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1458
// For PhaseCCP, transformation is IDENTITY unless Node computed a constant.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1459
Node *PhaseCCP::transform_once( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1460
  const Type *t = type(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1461
  // Constant?  Use constant Node instead
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1462
  if( t->singleton() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1463
    Node *nn = n;               // Default is to return the original constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1464
    if( t == Type::TOP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1465
      // cache my top node on the Compile instance
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1466
      if( C->cached_top_node() == NULL || C->cached_top_node()->in(0) == NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1467
        C->set_cached_top_node( ConNode::make(C, Type::TOP) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1468
        set_type(C->top(), Type::TOP);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1469
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1470
      nn = C->top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1471
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1472
    if( !n->is_Con() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1473
      if( t != Type::TOP ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1474
        nn = makecon(t);        // ConNode::make(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1475
        NOT_PRODUCT( inc_constants(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1476
      } else if( n->is_Region() ) { // Unreachable region
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1477
        // Note: nn == C->top()
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1478
        n->set_req(0, NULL);        // Cut selfreference
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1479
        // Eagerly remove dead phis to avoid phis copies creation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1480
        for (DUIterator i = n->outs(); n->has_out(i); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1481
          Node* m = n->out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1482
          if( m->is_Phi() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1483
            assert(type(m) == Type::TOP, "Unreachable region should not have live phis.");
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
  1484
            replace_node(m, nn);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1485
            --i; // deleted this phi; rescan starting with next position
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1486
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1487
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1488
      }
5901
c046f8e9c52b 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist()
kvn
parents: 5547
diff changeset
  1489
      replace_node(n,nn);       // Update DefUse edges for new constant
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1490
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1491
    return nn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1492
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1493
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1494
  // If x is a TypeNode, capture any more-precise type permanently into Node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1495
  if (t != n->bottom_type()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1496
    hash_delete(n);             // changing bottom type may force a rehash
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1497
    n->raise_bottom_type(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1498
    _worklist.push(n);          // n re-enters the hash table via the worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1499
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1500
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1501
  // Idealize graph using DU info.  Must clone() into new-space.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1502
  // DU info is generally used to show profitability, progress or safety
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1503
  // (but generally not needed for correctness).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1504
  Node *nn = n->Ideal_DU_postCCP(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1505
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1506
  // TEMPORARY fix to ensure that 2nd GVN pass eliminates NULL checks
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1507
  switch( n->Opcode() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1508
  case Op_FastLock:      // Revisit FastLocks for lock coarsening
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1509
  case Op_If:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1510
  case Op_CountedLoopEnd:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1511
  case Op_Region:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1512
  case Op_Loop:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1513
  case Op_CountedLoop:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1514
  case Op_Conv2B:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1515
  case Op_Opaque1:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1516
  case Op_Opaque2:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1517
    _worklist.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1518
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1519
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1520
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1521
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1522
  if( nn ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1523
    _worklist.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1524
    // Put users of 'n' onto worklist for second igvn transform
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1525
    add_users_to_worklist(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1526
    return nn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1527
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1528
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1529
  return  n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1530
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1531
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1532
//---------------------------------saturate------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1533
const Type* PhaseCCP::saturate(const Type* new_type, const Type* old_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1534
                               const Type* limit_type) const {
4012
579b7bad9983 6885584: A particular class structure causes large allocation spike for jit
never
parents: 3682
diff changeset
  1535
  const Type* wide_type = new_type->widen(old_type, limit_type);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1536
  if (wide_type != new_type) {          // did we widen?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1537
    // If so, we may have widened beyond the limit type.  Clip it back down.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1538
    new_type = wide_type->filter(limit_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1539
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1540
  return new_type;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1541
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1542
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1543
//------------------------------print_statistics-------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1544
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1545
void PhaseCCP::print_statistics() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1546
  tty->print_cr("CCP: %d  constants found: %d", _total_invokes, _total_constants);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1547
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1548
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1549
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1550
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1551
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1552
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1553
uint PhasePeephole::_total_peepholes = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1554
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1555
//------------------------------PhasePeephole----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1556
// Conditional Constant Propagation, ala Wegman & Zadeck
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1557
PhasePeephole::PhasePeephole( PhaseRegAlloc *regalloc, PhaseCFG &cfg )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1558
  : PhaseTransform(Peephole), _regalloc(regalloc), _cfg(cfg) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1559
  NOT_PRODUCT( clear_peepholes(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1560
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1561
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1562
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1563
//------------------------------~PhasePeephole---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1564
PhasePeephole::~PhasePeephole() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1565
  _total_peepholes += count_peepholes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1566
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1567
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1568
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1569
//------------------------------transform--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1570
Node *PhasePeephole::transform( Node *n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1571
  ShouldNotCallThis();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1572
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1573
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1574
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1575
//------------------------------do_transform-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1576
void PhasePeephole::do_transform() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1577
  bool method_name_not_printed = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1578
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1579
  // Examine each basic block
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1580
  for( uint block_number = 1; block_number < _cfg._num_blocks; ++block_number ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1581
    Block *block = _cfg._blocks[block_number];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1582
    bool block_not_printed = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1583
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1584
    // and each instruction within a block
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1585
    uint end_index = block->_nodes.size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1586
    // block->end_idx() not valid after PhaseRegAlloc
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1587
    for( uint instruction_index = 1; instruction_index < end_index; ++instruction_index ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1588
      Node     *n = block->_nodes.at(instruction_index);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1589
      if( n->is_Mach() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1590
        MachNode *m = n->as_Mach();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1591
        int deleted_count = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1592
        // check for peephole opportunities
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1593
        MachNode *m2 = m->peephole( block, instruction_index, _regalloc, deleted_count, C );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1594
        if( m2 != NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1595
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1596
          if( PrintOptoPeephole ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1597
            // Print method, first time only
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1598
            if( C->method() && method_name_not_printed ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1599
              C->method()->print_short_name(); tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1600
              method_name_not_printed = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1601
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1602
            // Print this block
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1603
            if( Verbose && block_not_printed) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1604
              tty->print_cr("in block");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1605
              block->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1606
              block_not_printed = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1607
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1608
            // Print instructions being deleted
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1609
            for( int i = (deleted_count - 1); i >= 0; --i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1610
              block->_nodes.at(instruction_index-i)->as_Mach()->format(_regalloc); tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1611
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1612
            tty->print_cr("replaced with");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1613
            // Print new instruction
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1614
            m2->format(_regalloc);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1615
            tty->print("\n\n");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1616
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1617
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1618
          // Remove old nodes from basic block and update instruction_index
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1619
          // (old nodes still exist and may have edges pointing to them
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1620
          //  as register allocation info is stored in the allocator using
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1621
          //  the node index to live range mappings.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1622
          uint safe_instruction_index = (instruction_index - deleted_count);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1623
          for( ; (instruction_index > safe_instruction_index); --instruction_index ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1624
            block->_nodes.remove( instruction_index );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1625
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1626
          // install new node after safe_instruction_index
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1627
          block->_nodes.insert( safe_instruction_index + 1, m2 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1628
          end_index = block->_nodes.size() - 1; // Recompute new block size
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1629
          NOT_PRODUCT( inc_peepholes(); )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1630
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1631
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1632
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1633
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1634
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1635
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1636
//------------------------------print_statistics-------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1637
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1638
void PhasePeephole::print_statistics() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1639
  tty->print_cr("Peephole: peephole rules applied: %d",  _total_peepholes);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1640
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1641
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1642
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1643
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1644
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1645
//------------------------------set_req_X--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1646
void Node::set_req_X( uint i, Node *n, PhaseIterGVN *igvn ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1647
  assert( is_not_dead(n), "can not use dead node");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1648
  assert( igvn->hash_find(this) != this, "Need to remove from hash before changing edges" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1649
  Node *old = in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1650
  set_req(i, n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1651
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1652
  // old goes dead?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1653
  if( old ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1654
    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
  1655
    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
  1656
      // 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
  1657
      // recursive kill will delete the current node (this) if dead-loop exists
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1658
      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
  1659
        igvn->_worklist.push( old );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1660
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1661
    case 1:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1662
      if( old->is_Store() || old->has_special_unique_user() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1663
        igvn->add_users_to_worklist( old );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1664
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1665
    case 2:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1666
      if( old->is_Store() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1667
        igvn->add_users_to_worklist( old );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1668
      if( old->Opcode() == Op_Region )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1669
        igvn->_worklist.push(old);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1670
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1671
    case 3:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1672
      if( old->Opcode() == Op_Region ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1673
        igvn->_worklist.push(old);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1674
        igvn->add_users_to_worklist( old );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1675
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1676
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1677
    default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1678
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1679
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1680
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1681
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1682
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1683
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1684
//-------------------------------replace_by-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1685
// Using def-use info, replace one node for another.  Follow the def-use info
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1686
// to all users of the OLD node.  Then make all uses point to the NEW node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1687
void Node::replace_by(Node *new_node) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1688
  assert(!is_top(), "top node has no DU info");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1689
  for (DUIterator_Last imin, i = last_outs(imin); i >= imin; ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1690
    Node* use = last_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1691
    uint uses_found = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1692
    for (uint j = 0; j < use->len(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1693
      if (use->in(j) == this) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1694
        if (j < use->req())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1695
              use->set_req(j, new_node);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1696
        else  use->set_prec(j, new_node);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1697
        uses_found++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1698
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1699
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1700
    i -= uses_found;    // we deleted 1 or more copies of this edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1701
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1702
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1703
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1704
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1705
//-----------------------------------------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1706
void Type_Array::grow( uint i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1707
  if( !_max ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1708
    _max = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1709
    _types = (const Type**)_a->Amalloc( _max * sizeof(Type*) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1710
    _types[0] = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1711
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1712
  uint old = _max;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1713
  while( i >= _max ) _max <<= 1;        // Double to fit
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1714
  _types = (const Type**)_a->Arealloc( _types, old*sizeof(Type*),_max*sizeof(Type*));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1715
  memset( &_types[old], 0, (_max-old)*sizeof(Type*) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1716
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1717
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1718
//------------------------------dump-------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1719
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1720
void Type_Array::dump() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1721
  uint max = Size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1722
  for( uint i = 0; i < max; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1723
    if( _types[i] != NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1724
      tty->print("  %d\t== ", i); _types[i]->dump(); tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1725
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1726
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1727
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1728
#endif