hotspot/src/share/vm/opto/escape.cpp
author xdono
Tue, 28 Jul 2009 12:12:40 -0700
changeset 3261 c7d5aae8d3f7
parent 2871 519e22b6900d
child 3283 c8b1b0aecdfe
permissions -rw-r--r--
6862919: Update copyright year Summary: Update copyright for files that have been modified in 2009, up to 07/09 Reviewed-by: tbell, ohair
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
3261
c7d5aae8d3f7 6862919: Update copyright year
xdono
parents: 2871
diff changeset
     2
 * Copyright 2005-2009 Sun Microsystems, Inc.  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
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    19
 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    20
 * CA 95054 USA or visit www.sun.com if you need additional information or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    21
 * have any questions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
489c9b5090e2 Initial load
duke
parents:
diff changeset
    25
#include "incls/_precompiled.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    26
#include "incls/_escape.cpp.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    27
489c9b5090e2 Initial load
duke
parents:
diff changeset
    28
void PointsToNode::add_edge(uint targIdx, PointsToNode::EdgeType et) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    29
  uint v = (targIdx << EdgeShift) + ((uint) et);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    30
  if (_edges == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    31
     Arena *a = Compile::current()->comp_arena();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    32
    _edges = new(a) GrowableArray<uint>(a, INITIAL_EDGE_COUNT, 0, 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    33
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    34
  _edges->append_if_missing(v);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
void PointsToNode::remove_edge(uint targIdx, PointsToNode::EdgeType et) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
  uint v = (targIdx << EdgeShift) + ((uint) et);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
  _edges->remove(v);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
#ifndef PRODUCT
250
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
    44
static const char *node_type_names[] = {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
  "UnknownType",
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
  "JavaObject",
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
  "LocalVar",
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
  "Field"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
250
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
    51
static const char *esc_names[] = {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
  "UnknownEscape",
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
    53
  "NoEscape",
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
    54
  "ArgEscape",
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
    55
  "GlobalEscape"
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
250
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
    58
static const char *edge_type_suffix[] = {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
 "?", // UnknownEdge
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
 "P", // PointsToEdge
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
 "D", // DeferredEdge
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
 "F"  // FieldEdge
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    65
void PointsToNode::dump(bool print_state) const {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
  NodeType nt = node_type();
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    67
  tty->print("%s ", node_type_names[(int) nt]);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    68
  if (print_state) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    69
    EscapeState es = escape_state();
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    70
    tty->print("%s %s ", esc_names[(int) es], _scalar_replaceable ? "":"NSR");
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    71
  }
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    72
  tty->print("[[");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
  for (uint i = 0; i < edge_count(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
    tty->print(" %d%s", edge_target(i), edge_type_suffix[(int) edge_type(i)]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
  tty->print("]]  ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
  if (_node == NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
    tty->print_cr("<null>");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
  else
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
    _node->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
    84
ConnectionGraph::ConnectionGraph(Compile * C) :
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
    85
  _nodes(C->comp_arena(), C->unique(), C->unique(), PointsToNode()),
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
    86
  _processed(C->comp_arena()),
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
    87
  _collecting(true),
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
    88
  _compile(C),
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
    89
  _node_map(C->comp_arena()) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
    90
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    91
  _phantom_object = C->top()->_idx,
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    92
  add_node(C->top(), PointsToNode::JavaObject, PointsToNode::GlobalEscape,true);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    93
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    94
  // Add ConP(#NULL) and ConN(#NULL) nodes.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    95
  PhaseGVN* igvn = C->initial_gvn();
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    96
  Node* oop_null = igvn->zerocon(T_OBJECT);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    97
  _oop_null = oop_null->_idx;
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    98
  assert(_oop_null < C->unique(), "should be created already");
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
    99
  add_node(oop_null, PointsToNode::JavaObject, PointsToNode::NoEscape, true);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   100
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   101
  if (UseCompressedOops) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   102
    Node* noop_null = igvn->zerocon(T_NARROWOOP);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   103
    _noop_null = noop_null->_idx;
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   104
    assert(_noop_null < C->unique(), "should be created already");
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   105
    add_node(noop_null, PointsToNode::JavaObject, PointsToNode::NoEscape, true);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   106
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
void ConnectionGraph::add_pointsto_edge(uint from_i, uint to_i) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
  PointsToNode *f = ptnode_adr(from_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
  PointsToNode *t = ptnode_adr(to_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
  assert(f->node_type() != PointsToNode::UnknownType && t->node_type() != PointsToNode::UnknownType, "node types must be set");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
  assert(f->node_type() == PointsToNode::LocalVar || f->node_type() == PointsToNode::Field, "invalid source of PointsTo edge");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
  assert(t->node_type() == PointsToNode::JavaObject, "invalid destination of PointsTo edge");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
  f->add_edge(to_i, PointsToNode::PointsToEdge);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
void ConnectionGraph::add_deferred_edge(uint from_i, uint to_i) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
  PointsToNode *f = ptnode_adr(from_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
  PointsToNode *t = ptnode_adr(to_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
  assert(f->node_type() != PointsToNode::UnknownType && t->node_type() != PointsToNode::UnknownType, "node types must be set");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
  assert(f->node_type() == PointsToNode::LocalVar || f->node_type() == PointsToNode::Field, "invalid source of Deferred edge");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
  assert(t->node_type() == PointsToNode::LocalVar || t->node_type() == PointsToNode::Field, "invalid destination of Deferred edge");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
  // don't add a self-referential edge, this can occur during removal of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
  // deferred edges
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
  if (from_i != to_i)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
    f->add_edge(to_i, PointsToNode::DeferredEdge);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   132
int ConnectionGraph::address_offset(Node* adr, PhaseTransform *phase) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   133
  const Type *adr_type = phase->type(adr);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   134
  if (adr->is_AddP() && adr_type->isa_oopptr() == NULL &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   135
      adr->in(AddPNode::Address)->is_Proj() &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   136
      adr->in(AddPNode::Address)->in(0)->is_Allocate()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   137
    // We are computing a raw address for a store captured by an Initialize
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   138
    // compute an appropriate address type. AddP cases #3 and #5 (see below).
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   139
    int offs = (int)phase->find_intptr_t_con(adr->in(AddPNode::Offset), Type::OffsetBot);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   140
    assert(offs != Type::OffsetBot ||
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   141
           adr->in(AddPNode::Address)->in(0)->is_AllocateArray(),
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   142
           "offset must be a constant or it is initialization of array");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   143
    return offs;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   144
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   145
  const TypePtr *t_ptr = adr_type->isa_ptr();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
  assert(t_ptr != NULL, "must be a pointer type");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
  return t_ptr->offset();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
void ConnectionGraph::add_field_edge(uint from_i, uint to_i, int offset) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
  PointsToNode *f = ptnode_adr(from_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
  PointsToNode *t = ptnode_adr(to_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
  assert(f->node_type() != PointsToNode::UnknownType && t->node_type() != PointsToNode::UnknownType, "node types must be set");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
  assert(f->node_type() == PointsToNode::JavaObject, "invalid destination of Field edge");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
  assert(t->node_type() == PointsToNode::Field, "invalid destination of Field edge");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
  assert (t->offset() == -1 || t->offset() == offset, "conflicting field offsets");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
  t->set_offset(offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
  f->add_edge(to_i, PointsToNode::FieldEdge);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
void ConnectionGraph::set_escape_state(uint ni, PointsToNode::EscapeState es) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
  PointsToNode *npt = ptnode_adr(ni);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
  PointsToNode::EscapeState old_es = npt->escape_state();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
  if (es > old_es)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
    npt->set_escape_state(es);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   170
void ConnectionGraph::add_node(Node *n, PointsToNode::NodeType nt,
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   171
                               PointsToNode::EscapeState es, bool done) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   172
  PointsToNode* ptadr = ptnode_adr(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   173
  ptadr->_node = n;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   174
  ptadr->set_node_type(nt);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   175
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   176
  // inline set_escape_state(idx, es);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   177
  PointsToNode::EscapeState old_es = ptadr->escape_state();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   178
  if (es > old_es)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   179
    ptadr->set_escape_state(es);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   180
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   181
  if (done)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   182
    _processed.set(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   183
}
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   184
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
PointsToNode::EscapeState ConnectionGraph::escape_state(Node *n, PhaseTransform *phase) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
  uint idx = n->_idx;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
  PointsToNode::EscapeState es;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   189
  // If we are still collecting or there were no non-escaping allocations
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   190
  // we don't know the answer yet
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   191
  if (_collecting)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
    return PointsToNode::UnknownEscape;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
  // if the node was created after the escape computation, return
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
  // UnknownEscape
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   196
  if (idx >= nodes_size())
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
    return PointsToNode::UnknownEscape;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   199
  es = ptnode_adr(idx)->escape_state();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
  // if we have already computed a value, return it
1613
be097ec639a2 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 1069
diff changeset
   202
  if (es != PointsToNode::UnknownEscape &&
be097ec639a2 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 1069
diff changeset
   203
      ptnode_adr(idx)->node_type() == PointsToNode::JavaObject)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
    return es;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   206
  // PointsTo() calls n->uncast() which can return a new ideal node.
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   207
  if (n->uncast()->_idx >= nodes_size())
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   208
    return PointsToNode::UnknownEscape;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   209
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
  // compute max escape state of anything this node could point to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
  VectorSet ptset(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
  PointsTo(ptset, n, phase);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   213
  for(VectorSetI i(&ptset); i.test() && es != PointsToNode::GlobalEscape; ++i) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
    uint pt = i.elem;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   215
    PointsToNode::EscapeState pes = ptnode_adr(pt)->escape_state();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
    if (pes > es)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
      es = pes;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
  // cache the computed escape state
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
  assert(es != PointsToNode::UnknownEscape, "should have computed an escape state");
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   221
  ptnode_adr(idx)->set_escape_state(es);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
  return es;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
void ConnectionGraph::PointsTo(VectorSet &ptset, Node * n, PhaseTransform *phase) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   226
  VectorSet visited(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
  GrowableArray<uint>  worklist;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
371
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   229
#ifdef ASSERT
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   230
  Node *orig_n = n;
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   231
#endif
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   232
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   233
  n = n->uncast();
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   234
  PointsToNode* npt = ptnode_adr(n->_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
  // If we have a JavaObject, return just that object
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   237
  if (npt->node_type() == PointsToNode::JavaObject) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
    ptset.set(n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   239
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
  }
371
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   241
#ifdef ASSERT
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   242
  if (npt->_node == NULL) {
371
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   243
    if (orig_n != n)
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   244
      orig_n->dump();
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   245
    n->dump();
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   246
    assert(npt->_node != NULL, "unregistered node");
371
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   247
  }
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   248
#endif
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   249
  worklist.push(n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   250
  while(worklist.length() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
    int ni = worklist.pop();
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   252
    if (visited.test_set(ni))
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   253
      continue;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   254
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   255
    PointsToNode* pn = ptnode_adr(ni);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   256
    // ensure that all inputs of a Phi have been processed
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   257
    assert(!_collecting || !pn->_node->is_Phi() || _processed.test(ni),"");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   259
    int edges_processed = 0;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   260
    uint e_cnt = pn->edge_count();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   261
    for (uint e = 0; e < e_cnt; e++) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   262
      uint etgt = pn->edge_target(e);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   263
      PointsToNode::EdgeType et = pn->edge_type(e);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   264
      if (et == PointsToNode::PointsToEdge) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   265
        ptset.set(etgt);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   266
        edges_processed++;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   267
      } else if (et == PointsToNode::DeferredEdge) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   268
        worklist.push(etgt);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   269
        edges_processed++;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   270
      } else {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   271
        assert(false,"neither PointsToEdge or DeferredEdge");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
      }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   273
    }
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   274
    if (edges_processed == 0) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   275
      // no deferred or pointsto edges found.  Assume the value was set
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   276
      // outside this method.  Add the phantom object to the pointsto set.
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   277
      ptset.set(_phantom_object);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
348
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   282
void ConnectionGraph::remove_deferred(uint ni, GrowableArray<uint>* deferred_edges, VectorSet* visited) {
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   283
  // This method is most expensive during ConnectionGraph construction.
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   284
  // Reuse vectorSet and an additional growable array for deferred edges.
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   285
  deferred_edges->clear();
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   286
  visited->Clear();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   288
  visited->set(ni);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
  PointsToNode *ptn = ptnode_adr(ni);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
348
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   291
  // Mark current edges as visited and move deferred edges to separate array.
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   292
  for (uint i = 0; i < ptn->edge_count(); ) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   293
    uint t = ptn->edge_target(i);
348
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   294
#ifdef ASSERT
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   295
    assert(!visited->test_set(t), "expecting no duplications");
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   296
#else
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   297
    visited->set(t);
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   298
#endif
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   299
    if (ptn->edge_type(i) == PointsToNode::DeferredEdge) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
      ptn->remove_edge(t, PointsToNode::DeferredEdge);
348
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   301
      deferred_edges->append(t);
371
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   302
    } else {
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
   303
      i++;
348
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   304
    }
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   305
  }
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   306
  for (int next = 0; next < deferred_edges->length(); ++next) {
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   307
    uint t = deferred_edges->at(next);
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   308
    PointsToNode *ptt = ptnode_adr(t);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   309
    uint e_cnt = ptt->edge_count();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   310
    for (uint e = 0; e < e_cnt; e++) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   311
      uint etgt = ptt->edge_target(e);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   312
      if (visited->test_set(etgt))
348
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
   313
        continue;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   314
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   315
      PointsToNode::EdgeType et = ptt->edge_type(e);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   316
      if (et == PointsToNode::PointsToEdge) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   317
        add_pointsto_edge(ni, etgt);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   318
        if(etgt == _phantom_object) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   319
          // Special case - field set outside (globally escaping).
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   320
          ptn->set_escape_state(PointsToNode::GlobalEscape);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   321
        }
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   322
      } else if (et == PointsToNode::DeferredEdge) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   323
        deferred_edges->append(etgt);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   324
      } else {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   325
        assert(false,"invalid connection graph");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   326
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
//  Add an edge to node given by "to_i" from any field of adr_i whose offset
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
//  matches "offset"  A deferred edge is added if to_i is a LocalVar, and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
//  a pointsto edge is added if it is a JavaObject
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
void ConnectionGraph::add_edge_from_fields(uint adr_i, uint to_i, int offs) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   337
  PointsToNode* an = ptnode_adr(adr_i);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   338
  PointsToNode* to = ptnode_adr(to_i);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   339
  bool deferred = (to->node_type() == PointsToNode::LocalVar);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   341
  for (uint fe = 0; fe < an->edge_count(); fe++) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   342
    assert(an->edge_type(fe) == PointsToNode::FieldEdge, "expecting a field edge");
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   343
    int fi = an->edge_target(fe);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   344
    PointsToNode* pf = ptnode_adr(fi);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   345
    int po = pf->offset();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
    if (po == offs || po == Type::OffsetBot || offs == Type::OffsetBot) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
      if (deferred)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
        add_deferred_edge(fi, to_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
      else
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
        add_pointsto_edge(fi, to_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   355
// Add a deferred  edge from node given by "from_i" to any field of adr_i
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   356
// whose offset matches "offset".
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
void ConnectionGraph::add_deferred_edge_to_fields(uint from_i, uint adr_i, int offs) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   358
  PointsToNode* an = ptnode_adr(adr_i);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   359
  for (uint fe = 0; fe < an->edge_count(); fe++) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   360
    assert(an->edge_type(fe) == PointsToNode::FieldEdge, "expecting a field edge");
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   361
    int fi = an->edge_target(fe);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   362
    PointsToNode* pf = ptnode_adr(fi);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   363
    int po = pf->offset();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   364
    if (pf->edge_count() == 0) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
      // we have not seen any stores to this field, assume it was set outside this method
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
      add_pointsto_edge(fi, _phantom_object);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
    if (po == offs || po == Type::OffsetBot || offs == Type::OffsetBot) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
      add_deferred_edge(from_i, fi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   374
// Helper functions
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   375
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   376
static Node* get_addp_base(Node *addp) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   377
  assert(addp->is_AddP(), "must be AddP");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   378
  //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   379
  // AddP cases for Base and Address inputs:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   380
  // case #1. Direct object's field reference:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   381
  //     Allocate
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   382
  //       |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   383
  //     Proj #5 ( oop result )
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   384
  //       |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   385
  //     CheckCastPP (cast to instance type)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   386
  //      | |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   387
  //     AddP  ( base == address )
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   388
  //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   389
  // case #2. Indirect object's field reference:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   390
  //      Phi
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   391
  //       |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   392
  //     CastPP (cast to instance type)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   393
  //      | |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   394
  //     AddP  ( base == address )
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   395
  //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   396
  // case #3. Raw object's field reference for Initialize node:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   397
  //      Allocate
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   398
  //        |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   399
  //      Proj #5 ( oop result )
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   400
  //  top   |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   401
  //     \  |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   402
  //     AddP  ( base == top )
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   403
  //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   404
  // case #4. Array's element reference:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   405
  //   {CheckCastPP | CastPP}
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   406
  //     |  | |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   407
  //     |  AddP ( array's element offset )
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   408
  //     |  |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   409
  //     AddP ( array's offset )
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   410
  //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   411
  // case #5. Raw object's field reference for arraycopy stub call:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   412
  //          The inline_native_clone() case when the arraycopy stub is called
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   413
  //          after the allocation before Initialize and CheckCastPP nodes.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   414
  //      Allocate
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   415
  //        |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   416
  //      Proj #5 ( oop result )
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   417
  //       | |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   418
  //       AddP  ( base == address )
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   419
  //
250
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
   420
  // case #6. Constant Pool, ThreadLocal, CastX2P or
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
   421
  //          Raw object's field reference:
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
   422
  //      {ConP, ThreadLocal, CastX2P, raw Load}
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   423
  //  top   |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   424
  //     \  |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   425
  //     AddP  ( base == top )
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   426
  //
250
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
   427
  // case #7. Klass's field reference.
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
   428
  //      LoadKlass
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
   429
  //       | |
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
   430
  //       AddP  ( base == address )
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
   431
  //
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
   432
  // case #8. narrow Klass's field reference.
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
   433
  //      LoadNKlass
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
   434
  //       |
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
   435
  //      DecodeN
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
   436
  //       | |
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
   437
  //       AddP  ( base == address )
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
   438
  //
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   439
  Node *base = addp->in(AddPNode::Base)->uncast();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   440
  if (base->is_top()) { // The AddP case #3 and #6.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   441
    base = addp->in(AddPNode::Address)->uncast();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   442
    assert(base->Opcode() == Op_ConP || base->Opcode() == Op_ThreadLocal ||
594
9f4474e5dbaf 6705887: Compressed Oops: generate x64 addressing and implicit null checks with narrow oops
kvn
parents: 590
diff changeset
   443
           base->Opcode() == Op_CastX2P || base->is_DecodeN() ||
250
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
   444
           (base->is_Mem() && base->bottom_type() == TypeRawPtr::NOTNULL) ||
8f3acb20ed88 6679854: assert in escape.cpp:397
kvn
parents: 238
diff changeset
   445
           (base->is_Proj() && base->in(0)->is_Allocate()), "sanity");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
  }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   447
  return base;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   448
}
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   449
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   450
static Node* find_second_addp(Node* addp, Node* n) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   451
  assert(addp->is_AddP() && addp->outcnt() > 0, "Don't process dead nodes");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   452
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   453
  Node* addp2 = addp->raw_out(0);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   454
  if (addp->outcnt() == 1 && addp2->is_AddP() &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   455
      addp2->in(AddPNode::Base) == n &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   456
      addp2->in(AddPNode::Address) == addp) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   457
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   458
    assert(addp->in(AddPNode::Base) == n, "expecting the same base");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   459
    //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   460
    // Find array's offset to push it on worklist first and
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   461
    // as result process an array's element offset first (pushed second)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   462
    // to avoid CastPP for the array's offset.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   463
    // Otherwise the inserted CastPP (LocalVar) will point to what
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   464
    // the AddP (Field) points to. Which would be wrong since
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   465
    // the algorithm expects the CastPP has the same point as
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   466
    // as AddP's base CheckCastPP (LocalVar).
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   467
    //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   468
    //    ArrayAllocation
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   469
    //     |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   470
    //    CheckCastPP
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   471
    //     |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   472
    //    memProj (from ArrayAllocation CheckCastPP)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   473
    //     |  ||
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   474
    //     |  ||   Int (element index)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   475
    //     |  ||    |   ConI (log(element size))
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   476
    //     |  ||    |   /
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   477
    //     |  ||   LShift
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   478
    //     |  ||  /
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   479
    //     |  AddP (array's element offset)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   480
    //     |  |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   481
    //     |  | ConI (array's offset: #12(32-bits) or #24(64-bits))
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   482
    //     | / /
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   483
    //     AddP (array's offset)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   484
    //      |
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   485
    //     Load/Store (memory operation on array's element)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   486
    //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   487
    return addp2;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   488
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   489
  return NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   490
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
// Adjust the type and inputs of an AddP which computes the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
// address of a field of an instance
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
//
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   496
bool ConnectionGraph::split_AddP(Node *addp, Node *base,  PhaseGVN  *igvn) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   497
  const TypeOopPtr *base_t = igvn->type(base)->isa_oopptr();
769
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
   498
  assert(base_t != NULL && base_t->is_known_instance(), "expecting instance oopptr");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
  const TypeOopPtr *t = igvn->type(addp)->isa_oopptr();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   500
  if (t == NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   501
    // We are computing a raw address for a store captured by an Initialize
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   502
    // compute an appropriate address type (cases #3 and #5).
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   503
    assert(igvn->type(addp) == TypeRawPtr::NOTNULL, "must be raw pointer");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   504
    assert(addp->in(AddPNode::Address)->is_Proj(), "base of raw address must be result projection from allocation");
1068
720698d9c89b 6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents: 1055
diff changeset
   505
    intptr_t offs = (int)igvn->find_intptr_t_con(addp->in(AddPNode::Offset), Type::OffsetBot);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   506
    assert(offs != Type::OffsetBot, "offset must be a constant");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   507
    t = base_t->add_offset(offs)->is_oopptr();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   508
  }
769
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
   509
  int inst_id =  base_t->instance_id();
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
   510
  assert(!t->is_known_instance() || t->instance_id() == inst_id,
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   511
                             "old type must be non-instance or match new type");
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   512
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   513
  // The type 't' could be subclass of 'base_t'.
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   514
  // As result t->offset() could be large then base_t's size and it will
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   515
  // cause the failure in add_offset() with narrow oops since TypeOopPtr()
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   516
  // constructor verifies correctness of the offset.
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   517
  //
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 2110
diff changeset
   518
  // It could happened on subclass's branch (from the type profiling
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   519
  // inlining) which was not eliminated during parsing since the exactness
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   520
  // of the allocation type was not propagated to the subclass type check.
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   521
  //
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   522
  // Do nothing for such AddP node and don't process its users since
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   523
  // this code branch will go away.
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   524
  //
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   525
  if (!t->is_known_instance() &&
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   526
      !t->klass()->equals(base_t->klass()) &&
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   527
      t->klass()->is_subtype_of(base_t->klass())) {
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   528
     return false; // bail out
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   529
  }
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   530
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
  const TypeOopPtr *tinst = base_t->add_offset(t->offset())->is_oopptr();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   532
  // Do NOT remove the next call: ensure an new alias index is allocated
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   533
  // for the instance type
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
  int alias_idx = _compile->get_alias_index(tinst);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
  igvn->set_type(addp, tinst);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
  // record the allocation in the node map
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  set_map(addp->_idx, get_map(base->_idx));
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   538
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   539
  // Set addp's Base and Address to 'base'.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   540
  Node *abase = addp->in(AddPNode::Base);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   541
  Node *adr   = addp->in(AddPNode::Address);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   542
  if (adr->is_Proj() && adr->in(0)->is_Allocate() &&
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   543
      adr->in(0)->_idx == (uint)inst_id) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   544
    // Skip AddP cases #3 and #5.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   545
  } else {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   546
    assert(!abase->is_top(), "sanity"); // AddP case #3
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   547
    if (abase != base) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   548
      igvn->hash_delete(addp);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   549
      addp->set_req(AddPNode::Base, base);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   550
      if (abase == adr) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   551
        addp->set_req(AddPNode::Address, base);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   552
      } else {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   553
        // AddP case #4 (adr is array's element offset AddP node)
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   554
#ifdef ASSERT
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   555
        const TypeOopPtr *atype = igvn->type(adr)->isa_oopptr();
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   556
        assert(adr->is_AddP() && atype != NULL &&
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   557
               atype->instance_id() == inst_id, "array's element offset should be processed first");
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   558
#endif
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   559
      }
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   560
      igvn->hash_insert(addp);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   562
  }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   563
  // Put on IGVN worklist since at least addp's type was changed above.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   564
  record_for_optimizer(addp);
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
   565
  return true;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   569
// Create a new version of orig_phi if necessary. Returns either the newly
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
// created phi or an existing phi.  Sets create_new to indicate wheter  a new
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
// phi was created.  Cache the last newly created phi in the node map.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
PhiNode *ConnectionGraph::create_split_phi(PhiNode *orig_phi, int alias_idx, GrowableArray<PhiNode *>  &orig_phi_worklist, PhaseGVN  *igvn, bool &new_created) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   574
  Compile *C = _compile;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   575
  new_created = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   576
  int phi_alias_idx = C->get_alias_index(orig_phi->adr_type());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
  // nothing to do if orig_phi is bottom memory or matches alias_idx
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   578
  if (phi_alias_idx == alias_idx) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   579
    return orig_phi;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
  // have we already created a Phi for this alias index?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
  PhiNode *result = get_map_phi(orig_phi->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   583
  if (result != NULL && C->get_alias_index(result->adr_type()) == alias_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
    return result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
  }
211
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   586
  if ((int)C->unique() + 2*NodeLimitFudgeFactor > MaxNodeLimit) {
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   587
    if (C->do_escape_analysis() == true && !C->failing()) {
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   588
      // Retry compilation without escape analysis.
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   589
      // If this is the first failure, the sentinel string will "stick"
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   590
      // to the Compile object, and the C2Compiler will see it and retry.
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   591
      C->record_failure(C2Compiler::retry_no_escape_analysis());
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   592
    }
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   593
    return NULL;
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   594
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
  orig_phi_worklist.append_if_missing(orig_phi);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   596
  const TypePtr *atype = C->get_adr_type(alias_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
  result = PhiNode::make(orig_phi->in(0), NULL, Type::MEMORY, atype);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
  set_map_phi(orig_phi->_idx, result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
  igvn->set_type(result, result->bottom_type());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
  record_for_optimizer(result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
  new_created = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
  return result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
489c9b5090e2 Initial load
duke
parents:
diff changeset
   605
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
// Return a new version  of Memory Phi "orig_phi" with the inputs having the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
// specified alias index.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   609
PhiNode *ConnectionGraph::split_memory_phi(PhiNode *orig_phi, int alias_idx, GrowableArray<PhiNode *>  &orig_phi_worklist, PhaseGVN  *igvn) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   610
489c9b5090e2 Initial load
duke
parents:
diff changeset
   611
  assert(alias_idx != Compile::AliasIdxBot, "can't split out bottom memory");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   612
  Compile *C = _compile;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   613
  bool new_phi_created;
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   614
  PhiNode *result = create_split_phi(orig_phi, alias_idx, orig_phi_worklist, igvn, new_phi_created);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   615
  if (!new_phi_created) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   616
    return result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   617
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   618
489c9b5090e2 Initial load
duke
parents:
diff changeset
   619
  GrowableArray<PhiNode *>  phi_list;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   620
  GrowableArray<uint>  cur_input;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   621
489c9b5090e2 Initial load
duke
parents:
diff changeset
   622
  PhiNode *phi = orig_phi;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   623
  uint idx = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   624
  bool finished = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   625
  while(!finished) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   626
    while (idx < phi->req()) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   627
      Node *mem = find_inst_mem(phi->in(idx), alias_idx, orig_phi_worklist, igvn);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   628
      if (mem != NULL && mem->is_Phi()) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   629
        PhiNode *newphi = create_split_phi(mem->as_Phi(), alias_idx, orig_phi_worklist, igvn, new_phi_created);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   630
        if (new_phi_created) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   631
          // found an phi for which we created a new split, push current one on worklist and begin
489c9b5090e2 Initial load
duke
parents:
diff changeset
   632
          // processing new one
489c9b5090e2 Initial load
duke
parents:
diff changeset
   633
          phi_list.push(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   634
          cur_input.push(idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   635
          phi = mem->as_Phi();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   636
          result = newphi;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   637
          idx = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   638
          continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   639
        } else {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   640
          mem = newphi;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   641
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   642
      }
211
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   643
      if (C->failing()) {
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   644
        return NULL;
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   645
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   646
      result->set_req(idx++, mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   647
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   648
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   649
    // verify that the new Phi has an input for each input of the original
489c9b5090e2 Initial load
duke
parents:
diff changeset
   650
    assert( phi->req() == result->req(), "must have same number of inputs.");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   651
    assert( result->in(0) != NULL && result->in(0) == phi->in(0), "regions must match");
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   652
#endif
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   653
    // Check if all new phi's inputs have specified alias index.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   654
    // Otherwise use old phi.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   655
    for (uint i = 1; i < phi->req(); i++) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   656
      Node* in = result->in(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   657
      assert((phi->in(i) == NULL) == (in == NULL), "inputs must correspond.");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   658
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   659
    // we have finished processing a Phi, see if there are any more to do
489c9b5090e2 Initial load
duke
parents:
diff changeset
   660
    finished = (phi_list.length() == 0 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   661
    if (!finished) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   662
      phi = phi_list.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   663
      idx = cur_input.pop();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   664
      PhiNode *prev_result = get_map_phi(phi->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   665
      prev_result->set_req(idx++, result);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   666
      result = prev_result;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   667
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   668
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   669
  return result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   670
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   671
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   672
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   673
//
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   674
// The next methods are derived from methods in MemNode.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   675
//
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   676
static Node *step_through_mergemem(MergeMemNode *mmem, int alias_idx, const TypeOopPtr *tinst) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   677
  Node *mem = mmem;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   678
  // TypeInstPtr::NOTNULL+any is an OOP with unknown offset - generally
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   679
  // means an array I have not precisely typed yet.  Do not do any
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   680
  // alias stuff with it any time soon.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   681
  if( tinst->base() != Type::AnyPtr &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   682
      !(tinst->klass()->is_java_lang_Object() &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   683
        tinst->offset() == Type::OffsetBot) ) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   684
    mem = mmem->memory_at(alias_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   685
    // Update input if it is progress over what we have now
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   686
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   687
  return mem;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   688
}
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   689
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   690
//
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   691
// Search memory chain of "mem" to find a MemNode whose address
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   692
// is the specified alias index.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   693
//
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   694
Node* ConnectionGraph::find_inst_mem(Node *orig_mem, int alias_idx, GrowableArray<PhiNode *>  &orig_phis, PhaseGVN *phase) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   695
  if (orig_mem == NULL)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   696
    return orig_mem;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   697
  Compile* C = phase->C;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   698
  const TypeOopPtr *tinst = C->get_adr_type(alias_idx)->isa_oopptr();
769
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
   699
  bool is_instance = (tinst != NULL) && tinst->is_known_instance();
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   700
  Node *start_mem = C->start()->proj_out(TypeFunc::Memory);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   701
  Node *prev = NULL;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   702
  Node *result = orig_mem;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   703
  while (prev != result) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   704
    prev = result;
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   705
    if (result == start_mem)
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 2110
diff changeset
   706
      break;  // hit one of our sentinels
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   707
    if (result->is_Mem()) {
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   708
      const Type *at = phase->type(result->in(MemNode::Address));
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   709
      if (at != Type::TOP) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   710
        assert (at->isa_ptr() != NULL, "pointer type required.");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   711
        int idx = C->get_alias_index(at->is_ptr());
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   712
        if (idx == alias_idx)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   713
          break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   714
      }
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   715
      result = result->in(MemNode::Memory);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   716
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   717
    if (!is_instance)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   718
      continue;  // don't search further for non-instance types
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   719
    // skip over a call which does not affect this memory slice
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   720
    if (result->is_Proj() && result->as_Proj()->_con == TypeFunc::Memory) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   721
      Node *proj_in = result->in(0);
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   722
      if (proj_in->is_Allocate() && proj_in->_idx == (uint)tinst->instance_id()) {
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 2110
diff changeset
   723
        break;  // hit one of our sentinels
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
   724
      } else if (proj_in->is_Call()) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   725
        CallNode *call = proj_in->as_Call();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   726
        if (!call->may_modify(tinst, phase)) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   727
          result = call->in(TypeFunc::Memory);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   728
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   729
      } else if (proj_in->is_Initialize()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   730
        AllocateNode* alloc = proj_in->as_Initialize()->allocation();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   731
        // Stop if this is the initialization for the object instance which
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   732
        // which contains this memory slice, otherwise skip over it.
769
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
   733
        if (alloc == NULL || alloc->_idx != (uint)tinst->instance_id()) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   734
          result = proj_in->in(TypeFunc::Memory);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   735
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   736
      } else if (proj_in->is_MemBar()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   737
        result = proj_in->in(TypeFunc::Memory);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   738
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   739
    } else if (result->is_MergeMem()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   740
      MergeMemNode *mmem = result->as_MergeMem();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   741
      result = step_through_mergemem(mmem, alias_idx, tinst);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   742
      if (result == mmem->base_memory()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   743
        // Didn't find instance memory, search through general slice recursively.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   744
        result = mmem->memory_at(C->get_general_index(alias_idx));
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   745
        result = find_inst_mem(result, alias_idx, orig_phis, phase);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   746
        if (C->failing()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   747
          return NULL;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   748
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   749
        mmem->set_memory_at(alias_idx, result);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   750
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   751
    } else if (result->is_Phi() &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   752
               C->get_alias_index(result->as_Phi()->adr_type()) != alias_idx) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   753
      Node *un = result->as_Phi()->unique_input(phase);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   754
      if (un != NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   755
        result = un;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   756
      } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   757
        break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   758
      }
2110
40e42c95ac39 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 1613
diff changeset
   759
    } else if (result->Opcode() == Op_SCMemProj) {
40e42c95ac39 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 1613
diff changeset
   760
      assert(result->in(0)->is_LoadStore(), "sanity");
40e42c95ac39 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 1613
diff changeset
   761
      const Type *at = phase->type(result->in(0)->in(MemNode::Address));
40e42c95ac39 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 1613
diff changeset
   762
      if (at != Type::TOP) {
40e42c95ac39 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 1613
diff changeset
   763
        assert (at->isa_ptr() != NULL, "pointer type required.");
40e42c95ac39 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 1613
diff changeset
   764
        int idx = C->get_alias_index(at->is_ptr());
40e42c95ac39 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 1613
diff changeset
   765
        assert(idx != alias_idx, "Object is not scalar replaceable if a LoadStore node access its field");
40e42c95ac39 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 1613
diff changeset
   766
        break;
40e42c95ac39 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 1613
diff changeset
   767
      }
40e42c95ac39 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 1613
diff changeset
   768
      result = result->in(0)->in(MemNode::Memory);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   769
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   770
  }
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   771
  if (result->is_Phi()) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   772
    PhiNode *mphi = result->as_Phi();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   773
    assert(mphi->bottom_type() == Type::MEMORY, "memory phi required");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   774
    const TypePtr *t = mphi->adr_type();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   775
    if (C->get_alias_index(t) != alias_idx) {
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   776
      // Create a new Phi with the specified alias index type.
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   777
      result = split_memory_phi(mphi, alias_idx, orig_phis, phase);
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   778
    } else if (!is_instance) {
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   779
      // Push all non-instance Phis on the orig_phis worklist to update inputs
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   780
      // during Phase 4 if needed.
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   781
      orig_phis.append_if_missing(mphi);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   782
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   783
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   784
  // the result is either MemNode, PhiNode, InitializeNode.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   785
  return result;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   786
}
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   787
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   788
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
//  Convert the types of unescaped object to instance types where possible,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
//  propagate the new type information through the graph, and update memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
//  edges and MergeMem inputs to reflect the new type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
//  We start with allocations (and calls which may be allocations)  on alloc_worklist.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
//  The processing is done in 4 phases:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
//  Phase 1:  Process possible allocations from alloc_worklist.  Create instance
489c9b5090e2 Initial load
duke
parents:
diff changeset
   798
//            types for the CheckCastPP for allocations where possible.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   799
//            Propagate the the new types through users as follows:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   800
//               casts and Phi:  push users on alloc_worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   801
//               AddP:  cast Base and Address inputs to the instance type
489c9b5090e2 Initial load
duke
parents:
diff changeset
   802
//                      push any AddP users on alloc_worklist and push any memnode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   803
//                      users onto memnode_worklist.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   804
//  Phase 2:  Process MemNode's from memnode_worklist. compute new address type and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   805
//            search the Memory chain for a store with the appropriate type
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
//            address type.  If a Phi is found, create a new version with
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 2110
diff changeset
   807
//            the appropriate memory slices from each of the Phi inputs.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
//            For stores, process the users as follows:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   809
//               MemNode:  push on memnode_worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   810
//               MergeMem: push on mergemem_worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   811
//  Phase 3:  Process MergeMem nodes from mergemem_worklist.  Walk each memory slice
489c9b5090e2 Initial load
duke
parents:
diff changeset
   812
//            moving the first node encountered of each  instance type to the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   813
//            the input corresponding to its alias index.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   814
//            appropriate memory slice.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
//  Phase 4:  Update the inputs of non-instance memory Phis and the Memory input of memnodes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
// In the following example, the CheckCastPP nodes are the cast of allocation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
// results and the allocation of node 29 is unescaped and eligible to be an
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
// instance type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
// We start with:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   822
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   823
//     7 Parm #memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
   824
//    10  ConI  "12"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   825
//    19  CheckCastPP   "Foo"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   826
//    20  AddP  _ 19 19 10  Foo+12  alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   827
//    29  CheckCastPP   "Foo"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   828
//    30  AddP  _ 29 29 10  Foo+12  alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   829
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   830
//    40  StoreP  25   7  20   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   831
//    50  StoreP  35  40  30   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   832
//    60  StoreP  45  50  20   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   833
//    70  LoadP    _  60  30   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   834
//    80  Phi     75  50  60   Memory alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   835
//    90  LoadP    _  80  30   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   836
//   100  LoadP    _  80  20   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   837
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   838
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   839
// Phase 1 creates an instance type for node 29 assigning it an instance id of 24
489c9b5090e2 Initial load
duke
parents:
diff changeset
   840
// and creating a new alias index for node 30.  This gives:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   841
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   842
//     7 Parm #memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
   843
//    10  ConI  "12"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   844
//    19  CheckCastPP   "Foo"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   845
//    20  AddP  _ 19 19 10  Foo+12  alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   846
//    29  CheckCastPP   "Foo"  iid=24
489c9b5090e2 Initial load
duke
parents:
diff changeset
   847
//    30  AddP  _ 29 29 10  Foo+12  alias_index=6  iid=24
489c9b5090e2 Initial load
duke
parents:
diff changeset
   848
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   849
//    40  StoreP  25   7  20   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   850
//    50  StoreP  35  40  30   ... alias_index=6
489c9b5090e2 Initial load
duke
parents:
diff changeset
   851
//    60  StoreP  45  50  20   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   852
//    70  LoadP    _  60  30   ... alias_index=6
489c9b5090e2 Initial load
duke
parents:
diff changeset
   853
//    80  Phi     75  50  60   Memory alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   854
//    90  LoadP    _  80  30   ... alias_index=6
489c9b5090e2 Initial load
duke
parents:
diff changeset
   855
//   100  LoadP    _  80  20   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   856
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   857
// In phase 2, new memory inputs are computed for the loads and stores,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   858
// And a new version of the phi is created.  In phase 4, the inputs to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   859
// node 80 are updated and then the memory nodes are updated with the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   860
// values computed in phase 2.  This results in:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   861
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   862
//     7 Parm #memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
   863
//    10  ConI  "12"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   864
//    19  CheckCastPP   "Foo"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   865
//    20  AddP  _ 19 19 10  Foo+12  alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   866
//    29  CheckCastPP   "Foo"  iid=24
489c9b5090e2 Initial load
duke
parents:
diff changeset
   867
//    30  AddP  _ 29 29 10  Foo+12  alias_index=6  iid=24
489c9b5090e2 Initial load
duke
parents:
diff changeset
   868
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   869
//    40  StoreP  25  7   20   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   870
//    50  StoreP  35  7   30   ... alias_index=6
489c9b5090e2 Initial load
duke
parents:
diff changeset
   871
//    60  StoreP  45  40  20   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   872
//    70  LoadP    _  50  30   ... alias_index=6
489c9b5090e2 Initial load
duke
parents:
diff changeset
   873
//    80  Phi     75  40  60   Memory alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   874
//   120  Phi     75  50  50   Memory alias_index=6
489c9b5090e2 Initial load
duke
parents:
diff changeset
   875
//    90  LoadP    _ 120  30   ... alias_index=6
489c9b5090e2 Initial load
duke
parents:
diff changeset
   876
//   100  LoadP    _  80  20   ... alias_index=4
489c9b5090e2 Initial load
duke
parents:
diff changeset
   877
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   878
void ConnectionGraph::split_unique_types(GrowableArray<Node *>  &alloc_worklist) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   879
  GrowableArray<Node *>  memnode_worklist;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   880
  GrowableArray<Node *>  mergemem_worklist;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   881
  GrowableArray<PhiNode *>  orig_phis;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   882
  PhaseGVN  *igvn = _compile->initial_gvn();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   883
  uint new_index_start = (uint) _compile->num_alias_types();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   884
  VectorSet visited(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   885
  VectorSet ptset(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   887
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   888
  //  Phase 1:  Process possible allocations from alloc_worklist.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   889
  //  Create instance types for the CheckCastPP for allocations where possible.
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   890
  //
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   891
  // (Note: don't forget to change the order of the second AddP node on
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   892
  //  the alloc_worklist if the order of the worklist processing is changed,
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   893
  //  see the comment in find_second_addp().)
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   894
  //
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
  while (alloc_worklist.length() != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
    Node *n = alloc_worklist.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
    uint ni = n->_idx;
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   898
    const TypeOopPtr* tinst = NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
    if (n->is_Call()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   900
      CallNode *alloc = n->as_Call();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   901
      // copy escape information to call node
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   902
      PointsToNode* ptn = ptnode_adr(alloc->_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   903
      PointsToNode::EscapeState es = escape_state(alloc, igvn);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   904
      // We have an allocation or call which returns a Java object,
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   905
      // see if it is unescaped.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   906
      if (es != PointsToNode::NoEscape || !ptn->_scalar_replaceable)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   907
        continue;
2871
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   908
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   909
      // Find CheckCastPP for the allocate or for the return value of a call
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   910
      n = alloc->result_cast();
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   911
      if (n == NULL) {            // No uses except Initialize node
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   912
        if (alloc->is_Allocate()) {
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   913
          // Set the scalar_replaceable flag for allocation
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   914
          // so it could be eliminated if it has no uses.
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   915
          alloc->as_Allocate()->_is_scalar_replaceable = true;
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   916
        }
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   917
        continue;
212
cd4963e67949 6667612: (Escape Analysis) disable loop cloning if it has a scalar replaceable allocation
kvn
parents: 211
diff changeset
   918
      }
2871
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   919
      if (!n->is_CheckCastPP()) { // not unique CheckCastPP.
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   920
        assert(!alloc->is_Allocate(), "allocation should have unique type");
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   921
        continue;
2871
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   922
      }
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   923
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   924
      // The inline code for Object.clone() casts the allocation result to
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   925
      // java.lang.Object and then to the actual type of the allocated
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   926
      // object. Detect this case and use the second cast.
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   927
      // Also detect j.l.reflect.Array.newInstance(jobject, jint) case when
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   928
      // the allocation result is cast to java.lang.Object and then
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   929
      // to the actual Array type.
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   930
      if (alloc->is_Allocate() && n->as_Type()->type() == TypeInstPtr::NOTNULL
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   931
          && (alloc->is_AllocateArray() ||
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   932
              igvn->type(alloc->in(AllocateNode::KlassNode)) != TypeKlassPtr::OBJECT)) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   933
        Node *cast2 = NULL;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   934
        for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   935
          Node *use = n->fast_out(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   936
          if (use->is_CheckCastPP()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   937
            cast2 = use;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   938
            break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   939
          }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   940
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   941
        if (cast2 != NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   942
          n = cast2;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   943
        } else {
2871
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   944
          // Non-scalar replaceable if the allocation type is unknown statically
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   945
          // (reflection allocation), the object can't be restored during
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   946
          // deoptimization without precise type.
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   947
          continue;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   948
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   949
      }
2871
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   950
      if (alloc->is_Allocate()) {
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   951
        // Set the scalar_replaceable flag for allocation
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   952
        // so it could be eliminated.
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   953
        alloc->as_Allocate()->_is_scalar_replaceable = true;
519e22b6900d 6836054: java/util/Arrays/CopyMethods.java fails on solaris-sparc with IllegalArgumentException
kvn
parents: 2131
diff changeset
   954
      }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   955
      set_escape_state(n->_idx, es);
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   956
      // in order for an object to be scalar-replaceable, it must be:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   957
      //   - a direct allocation (not a call returning an object)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   958
      //   - non-escaping
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   959
      //   - eligible to be a unique type
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   960
      //   - not determined to be ineligible by escape analysis
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   961
      set_map(alloc->_idx, n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   962
      set_map(n->_idx, alloc);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   963
      const TypeOopPtr *t = igvn->type(n)->isa_oopptr();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   964
      if (t == NULL)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   965
        continue;  // not a TypeInstPtr
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
   966
      tinst = t->cast_to_exactness(true)->is_oopptr()->cast_to_instance_id(ni);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   967
      igvn->hash_delete(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   968
      igvn->set_type(n,  tinst);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   969
      n->raise_bottom_type(tinst);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   970
      igvn->hash_insert(n);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   971
      record_for_optimizer(n);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   972
      if (alloc->is_Allocate() && ptn->_scalar_replaceable &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   973
          (t->isa_instptr() || t->isa_aryptr())) {
589
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   974
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   975
        // First, put on the worklist all Field edges from Connection Graph
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   976
        // which is more accurate then putting immediate users from Ideal Graph.
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   977
        for (uint e = 0; e < ptn->edge_count(); e++) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
   978
          Node *use = ptnode_adr(ptn->edge_target(e))->_node;
589
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   979
          assert(ptn->edge_type(e) == PointsToNode::FieldEdge && use->is_AddP(),
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   980
                 "only AddP nodes are Field edges in CG");
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   981
          if (use->outcnt() > 0) { // Don't process dead nodes
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   982
            Node* addp2 = find_second_addp(use, use->in(AddPNode::Base));
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   983
            if (addp2 != NULL) {
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   984
              assert(alloc->is_AllocateArray(),"array allocation was expected");
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   985
              alloc_worklist.append_if_missing(addp2);
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   986
            }
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   987
            alloc_worklist.append_if_missing(use);
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   988
          }
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   989
        }
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
   990
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   991
        // An allocation may have an Initialize which has raw stores. Scan
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   992
        // the users of the raw allocation result and push AddP users
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   993
        // on alloc_worklist.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   994
        Node *raw_result = alloc->proj_out(TypeFunc::Parms);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   995
        assert (raw_result != NULL, "must have an allocation result");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   996
        for (DUIterator_Fast imax, i = raw_result->fast_outs(imax); i < imax; i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   997
          Node *use = raw_result->fast_out(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   998
          if (use->is_AddP() && use->outcnt() > 0) { // Don't process dead nodes
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
   999
            Node* addp2 = find_second_addp(use, raw_result);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1000
            if (addp2 != NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1001
              assert(alloc->is_AllocateArray(),"array allocation was expected");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1002
              alloc_worklist.append_if_missing(addp2);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1003
            }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1004
            alloc_worklist.append_if_missing(use);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1005
          } else if (use->is_Initialize()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1006
            memnode_worklist.append_if_missing(use);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1007
          }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1008
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1009
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1010
    } else if (n->is_AddP()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1011
      ptset.Clear();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1012
      PointsTo(ptset, get_addp_base(n), igvn);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
      assert(ptset.Size() == 1, "AddP address is unique");
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1014
      uint elem = ptset.getelem(); // Allocation node's index
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1015
      if (elem == _phantom_object)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1016
        continue; // Assume the value was set outside this method.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1017
      Node *base = get_map(elem);  // CheckCastPP node
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
  1018
      if (!split_AddP(n, base, igvn)) continue; // wrong type
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1019
      tinst = igvn->type(base)->isa_oopptr();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1020
    } else if (n->is_Phi() ||
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1021
               n->is_CheckCastPP() ||
594
9f4474e5dbaf 6705887: Compressed Oops: generate x64 addressing and implicit null checks with narrow oops
kvn
parents: 590
diff changeset
  1022
               n->is_EncodeP() ||
9f4474e5dbaf 6705887: Compressed Oops: generate x64 addressing and implicit null checks with narrow oops
kvn
parents: 590
diff changeset
  1023
               n->is_DecodeN() ||
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1024
               (n->is_ConstraintCast() && n->Opcode() == Op_CastPP)) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1025
      if (visited.test_set(n->_idx)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1026
        assert(n->is_Phi(), "loops only through Phi's");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1027
        continue;  // already processed
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1028
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1029
      ptset.Clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1030
      PointsTo(ptset, n, igvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1031
      if (ptset.Size() == 1) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1032
        uint elem = ptset.getelem(); // Allocation node's index
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1033
        if (elem == _phantom_object)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1034
          continue; // Assume the value was set outside this method.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1035
        Node *val = get_map(elem);   // CheckCastPP node
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1036
        TypeNode *tn = n->as_Type();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1037
        tinst = igvn->type(val)->isa_oopptr();
769
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
  1038
        assert(tinst != NULL && tinst->is_known_instance() &&
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
  1039
               (uint)tinst->instance_id() == elem , "instance type expected.");
589
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  1040
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  1041
        const Type *tn_type = igvn->type(tn);
769
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
  1042
        const TypeOopPtr *tn_t;
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
  1043
        if (tn_type->isa_narrowoop()) {
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
  1044
          tn_t = tn_type->make_ptr()->isa_oopptr();
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
  1045
        } else {
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
  1046
          tn_t = tn_type->isa_oopptr();
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
  1047
        }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1048
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1049
        if (tn_t != NULL &&
769
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 767
diff changeset
  1050
            tinst->cast_to_instance_id(TypeOopPtr::InstanceBot)->higher_equal(tn_t)) {
589
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  1051
          if (tn_type->isa_narrowoop()) {
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  1052
            tn_type = tinst->make_narrowoop();
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  1053
          } else {
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  1054
            tn_type = tinst;
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  1055
          }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1056
          igvn->hash_delete(tn);
589
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  1057
          igvn->set_type(tn, tn_type);
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  1058
          tn->set_type(tn_type);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1059
          igvn->hash_insert(tn);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1060
          record_for_optimizer(n);
1055
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
  1061
        } else {
f4fb9fb08038 6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents: 961
diff changeset
  1062
          continue; // wrong type
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1063
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1064
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1065
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1066
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1067
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1068
    // push users on appropriate worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1069
    for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1070
      Node *use = n->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1071
      if(use->is_Mem() && use->in(MemNode::Address) == n) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1072
        memnode_worklist.append_if_missing(use);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1073
      } else if (use->is_Initialize()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1074
        memnode_worklist.append_if_missing(use);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1075
      } else if (use->is_MergeMem()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1076
        mergemem_worklist.append_if_missing(use);
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1077
      } else if (use->is_SafePoint() && tinst != NULL) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1078
        // Look for MergeMem nodes for calls which reference unique allocation
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1079
        // (through CheckCastPP nodes) even for debug info.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1080
        Node* m = use->in(TypeFunc::Memory);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1081
        uint iid = tinst->instance_id();
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1082
        while (m->is_Proj() && m->in(0)->is_SafePoint() &&
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1083
               m->in(0) != use && !m->in(0)->_idx != iid) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1084
          m = m->in(0)->in(TypeFunc::Memory);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1085
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1086
        if (m->is_MergeMem()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1087
          mergemem_worklist.append_if_missing(m);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1088
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1089
      } else if (use->is_AddP() && use->outcnt() > 0) { // No dead nodes
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1090
        Node* addp2 = find_second_addp(use, n);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1091
        if (addp2 != NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1092
          alloc_worklist.append_if_missing(addp2);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1093
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1094
        alloc_worklist.append_if_missing(use);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1095
      } else if (use->is_Phi() ||
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1096
                 use->is_CheckCastPP() ||
594
9f4474e5dbaf 6705887: Compressed Oops: generate x64 addressing and implicit null checks with narrow oops
kvn
parents: 590
diff changeset
  1097
                 use->is_EncodeP() ||
9f4474e5dbaf 6705887: Compressed Oops: generate x64 addressing and implicit null checks with narrow oops
kvn
parents: 590
diff changeset
  1098
                 use->is_DecodeN() ||
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1099
                 (use->is_ConstraintCast() && use->Opcode() == Op_CastPP)) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1100
        alloc_worklist.append_if_missing(use);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1101
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1102
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1103
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1104
  }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1105
  // New alias types were created in split_AddP().
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1106
  uint new_index_end = (uint) _compile->num_alias_types();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1107
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1108
  //  Phase 2:  Process MemNode's from memnode_worklist. compute new address type and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1109
  //            compute new values for Memory inputs  (the Memory inputs are not
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1110
  //            actually updated until phase 4.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1111
  if (memnode_worklist.length() == 0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1112
    return;  // nothing to do
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1113
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1114
  while (memnode_worklist.length() != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1115
    Node *n = memnode_worklist.pop();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1116
    if (visited.test_set(n->_idx))
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1117
      continue;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1118
    if (n->is_Phi()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1119
      assert(n->as_Phi()->adr_type() != TypePtr::BOTTOM, "narrow memory slice required");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1120
      // we don't need to do anything, but the users must be pushed if we haven't processed
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1121
      // this Phi before
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1122
    } else if (n->is_Initialize()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1123
      // we don't need to do anything, but the users of the memory projection must be pushed
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1124
      n = n->as_Initialize()->proj_out(TypeFunc::Memory);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1125
      if (n == NULL)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1126
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1127
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1128
      assert(n->is_Mem(), "memory node required.");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1129
      Node *addr = n->in(MemNode::Address);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1130
      assert(addr->is_AddP(), "AddP required");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1131
      const Type *addr_t = igvn->type(addr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1132
      if (addr_t == Type::TOP)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1133
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1134
      assert (addr_t->isa_ptr() != NULL, "pointer type required.");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1135
      int alias_idx = _compile->get_alias_index(addr_t->is_ptr());
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1136
      assert ((uint)alias_idx < new_index_end, "wrong alias index");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1137
      Node *mem = find_inst_mem(n->in(MemNode::Memory), alias_idx, orig_phis, igvn);
211
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
  1138
      if (_compile->failing()) {
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
  1139
        return;
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
  1140
      }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1141
      if (mem != n->in(MemNode::Memory)) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1142
        set_map(n->_idx, mem);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1143
        ptnode_adr(n->_idx)->_node = n;
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1144
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1145
      if (n->is_Load()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1146
        continue;  // don't push users
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1147
      } else if (n->is_LoadStore()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1148
        // get the memory projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1149
        for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1150
          Node *use = n->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1151
          if (use->Opcode() == Op_SCMemProj) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1152
            n = use;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1153
            break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1154
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1155
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1156
        assert(n->Opcode() == Op_SCMemProj, "memory projection required");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1157
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1158
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1159
    // push user on appropriate worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1160
    for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1161
      Node *use = n->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1162
      if (use->is_Phi()) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1163
        memnode_worklist.append_if_missing(use);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1164
      } else if(use->is_Mem() && use->in(MemNode::Memory) == n) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1165
        memnode_worklist.append_if_missing(use);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1166
      } else if (use->is_Initialize()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1167
        memnode_worklist.append_if_missing(use);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1168
      } else if (use->is_MergeMem()) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1169
        mergemem_worklist.append_if_missing(use);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1170
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1171
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1172
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1173
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1174
  //  Phase 3:  Process MergeMem nodes from mergemem_worklist.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1175
  //            Walk each memory moving the first node encountered of each
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1176
  //            instance type to the the input corresponding to its alias index.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1177
  while (mergemem_worklist.length() != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1178
    Node *n = mergemem_worklist.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1179
    assert(n->is_MergeMem(), "MergeMem node required.");
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1180
    if (visited.test_set(n->_idx))
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1181
      continue;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1182
    MergeMemNode *nmm = n->as_MergeMem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1183
    // Note: we don't want to use MergeMemStream here because we only want to
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1184
    //  scan inputs which exist at the start, not ones we add during processing.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1185
    uint nslices = nmm->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1186
    igvn->hash_delete(nmm);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1187
    for (uint i = Compile::AliasIdxRaw+1; i < nslices; i++) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1188
      Node* mem = nmm->in(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1189
      Node* cur = NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1190
      if (mem == NULL || mem->is_top())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1191
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1192
      while (mem->is_Mem()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1193
        const Type *at = igvn->type(mem->in(MemNode::Address));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1194
        if (at != Type::TOP) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1195
          assert (at->isa_ptr() != NULL, "pointer type required.");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1196
          uint idx = (uint)_compile->get_alias_index(at->is_ptr());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1197
          if (idx == i) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1198
            if (cur == NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1199
              cur = mem;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1200
          } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1201
            if (idx >= nmm->req() || nmm->is_empty_memory(nmm->in(idx))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1202
              nmm->set_memory_at(idx, mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1203
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1204
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1205
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1206
        mem = mem->in(MemNode::Memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1207
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1208
      nmm->set_memory_at(i, (cur != NULL) ? cur : mem);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1209
      // Find any instance of the current type if we haven't encountered
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1210
      // a value of the instance along the chain.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1211
      for (uint ni = new_index_start; ni < new_index_end; ni++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1212
        if((uint)_compile->get_general_index(ni) == i) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1213
          Node *m = (ni >= nmm->req()) ? nmm->empty_memory() : nmm->in(ni);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1214
          if (nmm->is_empty_memory(m)) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1215
            Node* result = find_inst_mem(mem, ni, orig_phis, igvn);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1216
            if (_compile->failing()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1217
              return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1218
            }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1219
            nmm->set_memory_at(ni, result);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1220
          }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1221
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1222
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1223
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1224
    // Find the rest of instances values
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1225
    for (uint ni = new_index_start; ni < new_index_end; ni++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1226
      const TypeOopPtr *tinst = igvn->C->get_adr_type(ni)->isa_oopptr();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1227
      Node* result = step_through_mergemem(nmm, ni, tinst);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1228
      if (result == nmm->base_memory()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1229
        // Didn't find instance memory, search through general slice recursively.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1230
        result = nmm->memory_at(igvn->C->get_general_index(ni));
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1231
        result = find_inst_mem(result, ni, orig_phis, igvn);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1232
        if (_compile->failing()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1233
          return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1234
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1235
        nmm->set_memory_at(ni, result);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1236
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1237
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1238
    igvn->hash_insert(nmm);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1239
    record_for_optimizer(nmm);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1240
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1241
    // Propagate new memory slices to following MergeMem nodes.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1242
    for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1243
      Node *use = n->fast_out(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1244
      if (use->is_Call()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1245
        CallNode* in = use->as_Call();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1246
        if (in->proj_out(TypeFunc::Memory) != NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1247
          Node* m = in->proj_out(TypeFunc::Memory);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1248
          for (DUIterator_Fast jmax, j = m->fast_outs(jmax); j < jmax; j++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1249
            Node* mm = m->fast_out(j);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1250
            if (mm->is_MergeMem()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1251
              mergemem_worklist.append_if_missing(mm);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1252
            }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1253
          }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1254
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1255
        if (use->is_Allocate()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1256
          use = use->as_Allocate()->initialization();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1257
          if (use == NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1258
            continue;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1259
          }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1260
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1261
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1262
      if (use->is_Initialize()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1263
        InitializeNode* in = use->as_Initialize();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1264
        if (in->proj_out(TypeFunc::Memory) != NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1265
          Node* m = in->proj_out(TypeFunc::Memory);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1266
          for (DUIterator_Fast jmax, j = m->fast_outs(jmax); j < jmax; j++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1267
            Node* mm = m->fast_out(j);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1268
            if (mm->is_MergeMem()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1269
              mergemem_worklist.append_if_missing(mm);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1270
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1271
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1272
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1273
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1274
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1275
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1276
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1277
  //  Phase 4:  Update the inputs of non-instance memory Phis and
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1278
  //            the Memory input of memnodes
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1279
  // First update the inputs of any non-instance Phi's from
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1280
  // which we split out an instance Phi.  Note we don't have
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1281
  // to recursively process Phi's encounted on the input memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1282
  // chains as is done in split_memory_phi() since they  will
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1283
  // also be processed here.
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
  1284
  for (int j = 0; j < orig_phis.length(); j++) {
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 953
diff changeset
  1285
    PhiNode *phi = orig_phis.at(j);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1286
    int alias_idx = _compile->get_alias_index(phi->adr_type());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1287
    igvn->hash_delete(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1288
    for (uint i = 1; i < phi->req(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1289
      Node *mem = phi->in(i);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1290
      Node *new_mem = find_inst_mem(mem, alias_idx, orig_phis, igvn);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1291
      if (_compile->failing()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1292
        return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1293
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1294
      if (mem != new_mem) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1295
        phi->set_req(i, new_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1296
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1297
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1298
    igvn->hash_insert(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1299
    record_for_optimizer(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1300
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1301
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1302
  // Update the memory inputs of MemNodes with the value we computed
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1303
  // in Phase 2.
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1304
  for (uint i = 0; i < nodes_size(); i++) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1305
    Node *nmem = get_map(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1306
    if (nmem != NULL) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1307
      Node *n = ptnode_adr(i)->_node;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1308
      if (n != NULL && n->is_Mem()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1309
        igvn->hash_delete(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1310
        n->set_req(MemNode::Memory, nmem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1311
        igvn->hash_insert(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1312
        record_for_optimizer(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1313
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1314
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1315
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1316
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1317
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1318
bool ConnectionGraph::has_candidates(Compile *C) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1319
  // EA brings benefits only when the code has allocations and/or locks which
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1320
  // are represented by ideal Macro nodes.
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1321
  int cnt = C->macro_count();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1322
  for( int i=0; i < cnt; i++ ) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1323
    Node *n = C->macro_node(i);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1324
    if ( n->is_Allocate() )
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1325
      return true;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1326
    if( n->is_Lock() ) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1327
      Node* obj = n->as_Lock()->obj_node()->uncast();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1328
      if( !(obj->is_Parm() || obj->is_Con()) )
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1329
        return true;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1330
    }
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1331
  }
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1332
  return false;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1333
}
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1334
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1335
bool ConnectionGraph::compute_escape() {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1336
  Compile* C = _compile;
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1337
589
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  1338
  // 1. Populate Connection Graph (CG) with Ideal nodes.
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1339
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1340
  Unique_Node_List worklist_init;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1341
  worklist_init.map(C->unique(), NULL);  // preallocate space
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1342
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1343
  // Initialize worklist
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1344
  if (C->root() != NULL) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1345
    worklist_init.push(C->root());
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1346
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1347
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1348
  GrowableArray<int> cg_worklist;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1349
  PhaseGVN* igvn = C->initial_gvn();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1350
  bool has_allocations = false;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1351
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1352
  // Push all useful nodes onto CG list and set their type.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1353
  for( uint next = 0; next < worklist_init.size(); ++next ) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1354
    Node* n = worklist_init.at(next);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1355
    record_for_escape_analysis(n, igvn);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1356
    // Only allocations and java static calls results are checked
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1357
    // for an escape status. See process_call_result() below.
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1358
    if (n->is_Allocate() || n->is_CallStaticJava() &&
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1359
        ptnode_adr(n->_idx)->node_type() == PointsToNode::JavaObject) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1360
      has_allocations = true;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1361
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1362
    if(n->is_AddP())
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1363
      cg_worklist.append(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1364
    for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1365
      Node* m = n->fast_out(i);   // Get user
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1366
      worklist_init.push(m);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1367
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1368
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1369
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1370
  if (!has_allocations) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1371
    _collecting = false;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1372
    return false; // Nothing to do.
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1373
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1374
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1375
  // 2. First pass to create simple CG edges (doesn't require to walk CG).
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1376
  uint delayed_size = _delayed_worklist.size();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1377
  for( uint next = 0; next < delayed_size; ++next ) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1378
    Node* n = _delayed_worklist.at(next);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1379
    build_connection_graph(n, igvn);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1380
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1381
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1382
  // 3. Pass to create fields edges (Allocate -F-> AddP).
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1383
  uint cg_length = cg_worklist.length();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1384
  for( uint next = 0; next < cg_length; ++next ) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1385
    int ni = cg_worklist.at(next);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1386
    build_connection_graph(ptnode_adr(ni)->_node, igvn);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1387
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1388
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1389
  cg_worklist.clear();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1390
  cg_worklist.append(_phantom_object);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1391
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1392
  // 4. Build Connection Graph which need
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1393
  //    to walk the connection graph.
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1394
  for (uint ni = 0; ni < nodes_size(); ni++) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1395
    PointsToNode* ptn = ptnode_adr(ni);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1396
    Node *n = ptn->_node;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1397
    if (n != NULL) { // Call, AddP, LoadP, StoreP
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1398
      build_connection_graph(n, igvn);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1399
      if (ptn->node_type() != PointsToNode::UnknownType)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1400
        cg_worklist.append(n->_idx); // Collect CG nodes
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1401
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1402
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1403
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1404
  VectorSet ptset(Thread::current()->resource_area());
348
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
  1405
  GrowableArray<uint>  deferred_edges;
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
  1406
  VectorSet visited(Thread::current()->resource_area());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1407
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1408
  // 5. Remove deferred edges from the graph and collect
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1409
  //    information needed for type splitting.
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1410
  cg_length = cg_worklist.length();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1411
  for( uint next = 0; next < cg_length; ++next ) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1412
    int ni = cg_worklist.at(next);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1413
    PointsToNode* ptn = ptnode_adr(ni);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1414
    PointsToNode::NodeType nt = ptn->node_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1415
    if (nt == PointsToNode::LocalVar || nt == PointsToNode::Field) {
348
905c4cbf5d6a 6681577: PIT: some VM tests fails with -XX:+AggressiveOpts in 6u5p b01
kvn
parents: 238
diff changeset
  1416
      remove_deferred(ni, &deferred_edges, &visited);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1417
      Node *n = ptn->_node;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1418
      if (n->is_AddP()) {
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1419
        // Search for objects which are not scalar replaceable.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1420
        // Mark their escape state as ArgEscape to propagate the state
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1421
        // to referenced objects.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1422
        // Note: currently there are no difference in compiler optimizations
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1423
        // for ArgEscape objects and NoEscape objects which are not
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1424
        // scalar replaceable.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1425
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1426
        int offset = ptn->offset();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1427
        Node *base = get_addp_base(n);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1428
        ptset.Clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1429
        PointsTo(ptset, base, igvn);
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1430
        int ptset_size = ptset.Size();
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1431
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1432
        // Check if a field's initializing value is recorded and add
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1433
        // a corresponding NULL field's value if it is not recorded.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1434
        // Connection Graph does not record a default initialization by NULL
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1435
        // captured by Initialize node.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1436
        //
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1437
        // Note: it will disable scalar replacement in some cases:
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1438
        //
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1439
        //    Point p[] = new Point[1];
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1440
        //    p[0] = new Point(); // Will be not scalar replaced
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1441
        //
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1442
        // but it will save us from incorrect optimizations in next cases:
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1443
        //
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1444
        //    Point p[] = new Point[1];
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1445
        //    if ( x ) p[0] = new Point(); // Will be not scalar replaced
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1446
        //
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1447
        // Without a control flow analysis we can't distinguish above cases.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1448
        //
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1449
        if (offset != Type::OffsetBot && ptset_size == 1) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1450
          uint elem = ptset.getelem(); // Allocation node's index
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1451
          // It does not matter if it is not Allocation node since
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1452
          // only non-escaping allocations are scalar replaced.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1453
          if (ptnode_adr(elem)->_node->is_Allocate() &&
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1454
              ptnode_adr(elem)->escape_state() == PointsToNode::NoEscape) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1455
            AllocateNode* alloc = ptnode_adr(elem)->_node->as_Allocate();
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1456
            InitializeNode* ini = alloc->initialization();
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1457
            Node* value = NULL;
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1458
            if (ini != NULL) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1459
              BasicType ft = UseCompressedOops ? T_NARROWOOP : T_OBJECT;
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1460
              Node* store = ini->find_captured_store(offset, type2aelembytes(ft), igvn);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1461
              if (store != NULL && store->is_Store())
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1462
                value = store->in(MemNode::ValueIn);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1463
            }
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1464
            if (value == NULL || value != ptnode_adr(value->_idx)->_node) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1465
              // A field's initializing value was not recorded. Add NULL.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1466
              uint null_idx = UseCompressedOops ? _noop_null : _oop_null;
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1467
              add_pointsto_edge(ni, null_idx);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1468
            }
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1469
          }
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1470
        }
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1471
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1472
        // An object is not scalar replaceable if the field which may point
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1473
        // to it has unknown offset (unknown element of an array of objects).
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1474
        //
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1475
        if (offset == Type::OffsetBot) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1476
          uint e_cnt = ptn->edge_count();
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1477
          for (uint ei = 0; ei < e_cnt; ei++) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1478
            uint npi = ptn->edge_target(ei);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1479
            set_escape_state(npi, PointsToNode::ArgEscape);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1480
            ptnode_adr(npi)->_scalar_replaceable = false;
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1481
          }
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1482
        }
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1483
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1484
        // Currently an object is not scalar replaceable if a LoadStore node
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1485
        // access its field since the field value is unknown after it.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1486
        //
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1487
        bool has_LoadStore = false;
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1488
        for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1489
          Node *use = n->fast_out(i);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1490
          if (use->is_LoadStore()) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1491
            has_LoadStore = true;
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1492
            break;
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1493
          }
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1494
        }
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1495
        // An object is not scalar replaceable if the address points
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1496
        // to unknown field (unknown element for arrays, offset is OffsetBot).
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1497
        //
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1498
        // Or the address may point to more then one object. This may produce
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1499
        // the false positive result (set scalar_replaceable to false)
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1500
        // since the flow-insensitive escape analysis can't separate
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1501
        // the case when stores overwrite the field's value from the case
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1502
        // when stores happened on different control branches.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1503
        //
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1504
        if (ptset_size > 1 || ptset_size != 0 &&
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1505
            (has_LoadStore || offset == Type::OffsetBot)) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1506
          for( VectorSetI j(&ptset); j.test(); ++j ) {
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  1507
            set_escape_state(j.elem, PointsToNode::ArgEscape);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1508
            ptnode_adr(j.elem)->_scalar_replaceable = false;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1509
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1510
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1511
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1512
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1513
  }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1514
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1515
  // 6. Propagate escape states.
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1516
  GrowableArray<int>  worklist;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1517
  bool has_non_escaping_obj = false;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1518
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1519
  // push all GlobalEscape nodes on the worklist
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1520
  for( uint next = 0; next < cg_length; ++next ) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1521
    int nk = cg_worklist.at(next);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1522
    if (ptnode_adr(nk)->escape_state() == PointsToNode::GlobalEscape)
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1523
      worklist.push(nk);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1524
  }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1525
  // mark all nodes reachable from GlobalEscape nodes
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1526
  while(worklist.length() > 0) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1527
    PointsToNode* ptn = ptnode_adr(worklist.pop());
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1528
    uint e_cnt = ptn->edge_count();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1529
    for (uint ei = 0; ei < e_cnt; ei++) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1530
      uint npi = ptn->edge_target(ei);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1531
      PointsToNode *np = ptnode_adr(npi);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1532
      if (np->escape_state() < PointsToNode::GlobalEscape) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1533
        np->set_escape_state(PointsToNode::GlobalEscape);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1534
        worklist.push(npi);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1535
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1536
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1537
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1538
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1539
  // push all ArgEscape nodes on the worklist
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1540
  for( uint next = 0; next < cg_length; ++next ) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1541
    int nk = cg_worklist.at(next);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1542
    if (ptnode_adr(nk)->escape_state() == PointsToNode::ArgEscape)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1543
      worklist.push(nk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1544
  }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1545
  // mark all nodes reachable from ArgEscape nodes
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1546
  while(worklist.length() > 0) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1547
    PointsToNode* ptn = ptnode_adr(worklist.pop());
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1548
    if (ptn->node_type() == PointsToNode::JavaObject)
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1549
      has_non_escaping_obj = true; // Non GlobalEscape
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1550
    uint e_cnt = ptn->edge_count();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1551
    for (uint ei = 0; ei < e_cnt; ei++) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1552
      uint npi = ptn->edge_target(ei);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1553
      PointsToNode *np = ptnode_adr(npi);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1554
      if (np->escape_state() < PointsToNode::ArgEscape) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1555
        np->set_escape_state(PointsToNode::ArgEscape);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1556
        worklist.push(npi);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1557
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1558
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1559
  }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1560
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1561
  GrowableArray<Node*> alloc_worklist;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1562
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1563
  // push all NoEscape nodes on the worklist
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1564
  for( uint next = 0; next < cg_length; ++next ) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1565
    int nk = cg_worklist.at(next);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1566
    if (ptnode_adr(nk)->escape_state() == PointsToNode::NoEscape)
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1567
      worklist.push(nk);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1568
  }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1569
  // mark all nodes reachable from NoEscape nodes
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1570
  while(worklist.length() > 0) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1571
    PointsToNode* ptn = ptnode_adr(worklist.pop());
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1572
    if (ptn->node_type() == PointsToNode::JavaObject)
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1573
      has_non_escaping_obj = true; // Non GlobalEscape
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1574
    Node* n = ptn->_node;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1575
    if (n->is_Allocate() && ptn->_scalar_replaceable ) {
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 2110
diff changeset
  1576
      // Push scalar replaceable allocations on alloc_worklist
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1577
      // for processing in split_unique_types().
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1578
      alloc_worklist.append(n);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1579
    }
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1580
    uint e_cnt = ptn->edge_count();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1581
    for (uint ei = 0; ei < e_cnt; ei++) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1582
      uint npi = ptn->edge_target(ei);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1583
      PointsToNode *np = ptnode_adr(npi);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1584
      if (np->escape_state() < PointsToNode::NoEscape) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1585
        np->set_escape_state(PointsToNode::NoEscape);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1586
        worklist.push(npi);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1587
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1588
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1589
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1590
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1591
  _collecting = false;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1592
  assert(C->unique() == nodes_size(), "there should be no new ideal nodes during ConnectionGraph build");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1593
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1594
  bool has_scalar_replaceable_candidates = alloc_worklist.length() > 0;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1595
  if ( has_scalar_replaceable_candidates &&
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1596
       C->AliasLevel() >= 3 && EliminateAllocations ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1597
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1598
    // Now use the escape information to create unique types for
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1599
    // scalar replaceable objects.
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1600
    split_unique_types(alloc_worklist);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1601
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1602
    if (C->failing())  return false;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1603
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1604
    // Clean up after split unique types.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1605
    ResourceMark rm;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1606
    PhaseRemoveUseless pru(C->initial_gvn(), C->for_igvn());
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1607
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1608
    C->print_method("After Escape Analysis", 2);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1609
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1610
#ifdef ASSERT
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1611
  } else if (Verbose && (PrintEscapeAnalysis || PrintEliminateAllocations)) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1612
    tty->print("=== No allocations eliminated for ");
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1613
    C->method()->print_short_name();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1614
    if(!EliminateAllocations) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1615
      tty->print(" since EliminateAllocations is off ===");
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1616
    } else if(!has_scalar_replaceable_candidates) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1617
      tty->print(" since there are no scalar replaceable candidates ===");
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1618
    } else if(C->AliasLevel() < 3) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1619
      tty->print(" since AliasLevel < 3 ===");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1620
    }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1621
    tty->cr();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1622
#endif
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1623
  }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1624
  return has_non_escaping_obj;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1625
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1626
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1627
void ConnectionGraph::process_call_arguments(CallNode *call, PhaseTransform *phase) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1628
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1629
    switch (call->Opcode()) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1630
#ifdef ASSERT
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1631
    case Op_Allocate:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1632
    case Op_AllocateArray:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1633
    case Op_Lock:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1634
    case Op_Unlock:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1635
      assert(false, "should be done already");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1636
      break;
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1637
#endif
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1638
    case Op_CallLeafNoFP:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1639
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1640
      // Stub calls, objects do not escape but they are not scale replaceable.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1641
      // Adjust escape state for outgoing arguments.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1642
      const TypeTuple * d = call->tf()->domain();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1643
      VectorSet ptset(Thread::current()->resource_area());
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1644
      for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1645
        const Type* at = d->field_at(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1646
        Node *arg = call->in(i)->uncast();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1647
        const Type *aat = phase->type(arg);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1648
        if (!arg->is_top() && at->isa_ptr() && aat->isa_ptr()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1649
          assert(aat == Type::TOP || aat == TypePtr::NULL_PTR ||
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1650
                 aat->isa_ptr() != NULL, "expecting an Ptr");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1651
          set_escape_state(arg->_idx, PointsToNode::ArgEscape);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1652
          if (arg->is_AddP()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1653
            //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1654
            // The inline_native_clone() case when the arraycopy stub is called
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1655
            // after the allocation before Initialize and CheckCastPP nodes.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1656
            //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1657
            // Set AddP's base (Allocate) as not scalar replaceable since
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1658
            // pointer to the base (with offset) is passed as argument.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1659
            //
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1660
            arg = get_addp_base(arg);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1661
          }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1662
          ptset.Clear();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1663
          PointsTo(ptset, arg, phase);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1664
          for( VectorSetI j(&ptset); j.test(); ++j ) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1665
            uint pt = j.elem;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1666
            set_escape_state(pt, PointsToNode::ArgEscape);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1667
          }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1668
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1669
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1670
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1671
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1672
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1673
    case Op_CallStaticJava:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1674
    // For a static call, we know exactly what method is being called.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1675
    // Use bytecode estimator to record the call's escape affects
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1676
    {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1677
      ciMethod *meth = call->as_CallJava()->method();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1678
      BCEscapeAnalyzer *call_analyzer = (meth !=NULL) ? meth->get_bcea() : NULL;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1679
      // fall-through if not a Java method or no analyzer information
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1680
      if (call_analyzer != NULL) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1681
        const TypeTuple * d = call->tf()->domain();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1682
        VectorSet ptset(Thread::current()->resource_area());
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1683
        bool copy_dependencies = false;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1684
        for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1685
          const Type* at = d->field_at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1686
          int k = i - TypeFunc::Parms;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1687
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1688
          if (at->isa_oopptr() != NULL) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1689
            Node *arg = call->in(i)->uncast();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1690
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1691
            bool global_escapes = false;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1692
            bool fields_escapes = false;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1693
            if (!call_analyzer->is_arg_stack(k)) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1694
              // The argument global escapes, mark everything it could point to
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1695
              set_escape_state(arg->_idx, PointsToNode::GlobalEscape);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1696
              global_escapes = true;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1697
            } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1698
              if (!call_analyzer->is_arg_local(k)) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1699
                // The argument itself doesn't escape, but any fields might
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1700
                fields_escapes = true;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1701
              }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1702
              set_escape_state(arg->_idx, PointsToNode::ArgEscape);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1703
              copy_dependencies = true;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1704
            }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1705
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1706
            ptset.Clear();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1707
            PointsTo(ptset, arg, phase);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1708
            for( VectorSetI j(&ptset); j.test(); ++j ) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1709
              uint pt = j.elem;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1710
              if (global_escapes) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1711
                //The argument global escapes, mark everything it could point to
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1712
                set_escape_state(pt, PointsToNode::GlobalEscape);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1713
              } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1714
                if (fields_escapes) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1715
                  // The argument itself doesn't escape, but any fields might
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1716
                  add_edge_from_fields(pt, _phantom_object, Type::OffsetBot);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1717
                }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1718
                set_escape_state(pt, PointsToNode::ArgEscape);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1719
              }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1720
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1721
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1722
        }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1723
        if (copy_dependencies)
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1724
          call_analyzer->copy_dependencies(_compile->dependencies());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1725
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1726
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1727
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1728
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1729
    default:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1730
    // Fall-through here if not a Java method or no analyzer information
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1731
    // or some other type of call, assume the worst case: all arguments
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1732
    // globally escape.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1733
    {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1734
      // adjust escape state for  outgoing arguments
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1735
      const TypeTuple * d = call->tf()->domain();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1736
      VectorSet ptset(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1737
      for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1738
        const Type* at = d->field_at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1739
        if (at->isa_oopptr() != NULL) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1740
          Node *arg = call->in(i)->uncast();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1741
          set_escape_state(arg->_idx, PointsToNode::GlobalEscape);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1742
          ptset.Clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1743
          PointsTo(ptset, arg, phase);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1744
          for( VectorSetI j(&ptset); j.test(); ++j ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1745
            uint pt = j.elem;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1746
            set_escape_state(pt, PointsToNode::GlobalEscape);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1747
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1748
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1749
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1750
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1751
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1752
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1753
void ConnectionGraph::process_call_result(ProjNode *resproj, PhaseTransform *phase) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1754
  CallNode   *call = resproj->in(0)->as_Call();
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1755
  uint    call_idx = call->_idx;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1756
  uint resproj_idx = resproj->_idx;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1757
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1758
  switch (call->Opcode()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1759
    case Op_Allocate:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1760
    {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1761
      Node *k = call->in(AllocateNode::KlassNode);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1762
      const TypeKlassPtr *kt;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1763
      if (k->Opcode() == Op_LoadKlass) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1764
        kt = k->as_Load()->type()->isa_klassptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1765
      } else {
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
  1766
        // Also works for DecodeN(LoadNKlass).
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1767
        kt = k->as_Type()->type()->isa_klassptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1768
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1769
      assert(kt != NULL, "TypeKlassPtr  required.");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1770
      ciKlass* cik = kt->klass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1771
      ciInstanceKlass* ciik = cik->as_instance_klass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1772
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1773
      PointsToNode::EscapeState es;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1774
      uint edge_to;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1775
      if (cik->is_subclass_of(_compile->env()->Thread_klass()) || ciik->has_finalizer()) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1776
        es = PointsToNode::GlobalEscape;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1777
        edge_to = _phantom_object; // Could not be worse
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1778
      } else {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1779
        es = PointsToNode::NoEscape;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1780
        edge_to = call_idx;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1781
      }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1782
      set_escape_state(call_idx, es);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1783
      add_pointsto_edge(resproj_idx, edge_to);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1784
      _processed.set(resproj_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1785
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1786
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1787
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1788
    case Op_AllocateArray:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1789
    {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1790
      int length = call->in(AllocateNode::ALength)->find_int_con(-1);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1791
      if (length < 0 || length > EliminateAllocationArraySizeLimit) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1792
        // Not scalar replaceable if the length is not constant or too big.
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1793
        ptnode_adr(call_idx)->_scalar_replaceable = false;
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1794
      }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1795
      set_escape_state(call_idx, PointsToNode::NoEscape);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1796
      add_pointsto_edge(resproj_idx, call_idx);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1797
      _processed.set(resproj_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1798
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1799
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1800
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1801
    case Op_CallStaticJava:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1802
    // For a static call, we know exactly what method is being called.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1803
    // Use bytecode estimator to record whether the call's return value escapes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1804
    {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1805
      bool done = true;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1806
      const TypeTuple *r = call->tf()->range();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1807
      const Type* ret_type = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1808
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1809
      if (r->cnt() > TypeFunc::Parms)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1810
        ret_type = r->field_at(TypeFunc::Parms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1811
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1812
      // Note:  we use isa_ptr() instead of isa_oopptr()  here because the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1813
      //        _multianewarray functions return a TypeRawPtr.
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1814
      if (ret_type == NULL || ret_type->isa_ptr() == NULL) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1815
        _processed.set(resproj_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1816
        break;  // doesn't return a pointer type
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1817
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1818
      ciMethod *meth = call->as_CallJava()->method();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1819
      const TypeTuple * d = call->tf()->domain();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1820
      if (meth == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1821
        // not a Java method, assume global escape
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1822
        set_escape_state(call_idx, PointsToNode::GlobalEscape);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1823
        add_pointsto_edge(resproj_idx, _phantom_object);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1824
      } else {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1825
        BCEscapeAnalyzer *call_analyzer = meth->get_bcea();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1826
        bool copy_dependencies = false;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1827
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1828
        if (call_analyzer->is_return_allocated()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1829
          // Returns a newly allocated unescaped object, simply
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1830
          // update dependency information.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1831
          // Mark it as NoEscape so that objects referenced by
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1832
          // it's fields will be marked as NoEscape at least.
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1833
          set_escape_state(call_idx, PointsToNode::NoEscape);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1834
          add_pointsto_edge(resproj_idx, call_idx);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1835
          copy_dependencies = true;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1836
        } else if (call_analyzer->is_return_local()) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1837
          // determine whether any arguments are returned
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1838
          set_escape_state(call_idx, PointsToNode::NoEscape);
1069
ef51f81ebe0f 6732732: CTW with EA: assert(n != 0L,"Bad immediate dominator info.")
kvn
parents: 1068
diff changeset
  1839
          bool ret_arg = false;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1840
          for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1841
            const Type* at = d->field_at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1842
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1843
            if (at->isa_oopptr() != NULL) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1844
              Node *arg = call->in(i)->uncast();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1845
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1846
              if (call_analyzer->is_arg_returned(i - TypeFunc::Parms)) {
1069
ef51f81ebe0f 6732732: CTW with EA: assert(n != 0L,"Bad immediate dominator info.")
kvn
parents: 1068
diff changeset
  1847
                ret_arg = true;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1848
                PointsToNode *arg_esp = ptnode_adr(arg->_idx);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1849
                if (arg_esp->node_type() == PointsToNode::UnknownType)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1850
                  done = false;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1851
                else if (arg_esp->node_type() == PointsToNode::JavaObject)
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1852
                  add_pointsto_edge(resproj_idx, arg->_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1853
                else
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1854
                  add_deferred_edge(resproj_idx, arg->_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1855
                arg_esp->_hidden_alias = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1856
              }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1857
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1858
          }
1069
ef51f81ebe0f 6732732: CTW with EA: assert(n != 0L,"Bad immediate dominator info.")
kvn
parents: 1068
diff changeset
  1859
          if (done && !ret_arg) {
ef51f81ebe0f 6732732: CTW with EA: assert(n != 0L,"Bad immediate dominator info.")
kvn
parents: 1068
diff changeset
  1860
            // Returns unknown object.
ef51f81ebe0f 6732732: CTW with EA: assert(n != 0L,"Bad immediate dominator info.")
kvn
parents: 1068
diff changeset
  1861
            set_escape_state(call_idx, PointsToNode::GlobalEscape);
ef51f81ebe0f 6732732: CTW with EA: assert(n != 0L,"Bad immediate dominator info.")
kvn
parents: 1068
diff changeset
  1862
            add_pointsto_edge(resproj_idx, _phantom_object);
ef51f81ebe0f 6732732: CTW with EA: assert(n != 0L,"Bad immediate dominator info.")
kvn
parents: 1068
diff changeset
  1863
          }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1864
          copy_dependencies = true;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1865
        } else {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1866
          set_escape_state(call_idx, PointsToNode::GlobalEscape);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1867
          add_pointsto_edge(resproj_idx, _phantom_object);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1868
          for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1869
            const Type* at = d->field_at(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1870
            if (at->isa_oopptr() != NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1871
              Node *arg = call->in(i)->uncast();
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1872
              PointsToNode *arg_esp = ptnode_adr(arg->_idx);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1873
              arg_esp->_hidden_alias = true;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1874
            }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1875
          }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1876
        }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1877
        if (copy_dependencies)
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1878
          call_analyzer->copy_dependencies(_compile->dependencies());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1879
      }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1880
      if (done)
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1881
        _processed.set(resproj_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1882
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1883
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1884
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1885
    default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1886
    // Some other type of call, assume the worst case that the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1887
    // returned value, if any, globally escapes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1888
    {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1889
      const TypeTuple *r = call->tf()->range();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1890
      if (r->cnt() > TypeFunc::Parms) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1891
        const Type* ret_type = r->field_at(TypeFunc::Parms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1892
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1893
        // Note:  we use isa_ptr() instead of isa_oopptr()  here because the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1894
        //        _multianewarray functions return a TypeRawPtr.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1895
        if (ret_type->isa_ptr() != NULL) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1896
          set_escape_state(call_idx, PointsToNode::GlobalEscape);
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1897
          add_pointsto_edge(resproj_idx, _phantom_object);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1898
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1899
      }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1900
      _processed.set(resproj_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1901
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1902
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1903
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1904
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1905
// Populate Connection Graph with Ideal nodes and create simple
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1906
// connection graph edges (do not need to check the node_type of inputs
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1907
// or to call PointsTo() to walk the connection graph).
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1908
void ConnectionGraph::record_for_escape_analysis(Node *n, PhaseTransform *phase) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1909
  if (_processed.test(n->_idx))
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1910
    return; // No need to redefine node's state.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1911
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1912
  if (n->is_Call()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1913
    // Arguments to allocation and locking don't escape.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1914
    if (n->is_Allocate()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1915
      add_node(n, PointsToNode::JavaObject, PointsToNode::UnknownEscape, true);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1916
      record_for_optimizer(n);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1917
    } else if (n->is_Lock() || n->is_Unlock()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1918
      // Put Lock and Unlock nodes on IGVN worklist to process them during
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1919
      // the first IGVN optimization when escape information is still available.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1920
      record_for_optimizer(n);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1921
      _processed.set(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1922
    } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1923
      // Have to process call's arguments first.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1924
      PointsToNode::NodeType nt = PointsToNode::UnknownType;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1925
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1926
      // Check if a call returns an object.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1927
      const TypeTuple *r = n->as_Call()->tf()->range();
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1928
      if (n->is_CallStaticJava() && r->cnt() > TypeFunc::Parms &&
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1929
          n->as_Call()->proj_out(TypeFunc::Parms) != NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1930
        // Note:  use isa_ptr() instead of isa_oopptr() here because
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1931
        //        the _multianewarray functions return a TypeRawPtr.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1932
        if (r->field_at(TypeFunc::Parms)->isa_ptr() != NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1933
          nt = PointsToNode::JavaObject;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1934
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1935
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1936
      add_node(n, nt, PointsToNode::UnknownEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1937
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1938
    return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1939
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1940
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1941
  // Using isa_ptr() instead of isa_oopptr() for LoadP and Phi because
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1942
  // ThreadLocal has RawPrt type.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1943
  switch (n->Opcode()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1944
    case Op_AddP:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1945
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1946
      add_node(n, PointsToNode::Field, PointsToNode::UnknownEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1947
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1948
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1949
    case Op_CastX2P:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1950
    { // "Unsafe" memory access.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1951
      add_node(n, PointsToNode::JavaObject, PointsToNode::GlobalEscape, true);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1952
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1953
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1954
    case Op_CastPP:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1955
    case Op_CheckCastPP:
371
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  1956
    case Op_EncodeP:
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  1957
    case Op_DecodeN:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1958
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1959
      add_node(n, PointsToNode::LocalVar, PointsToNode::UnknownEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1960
      int ti = n->in(1)->_idx;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  1961
      PointsToNode::NodeType nt = ptnode_adr(ti)->node_type();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1962
      if (nt == PointsToNode::UnknownType) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1963
        _delayed_worklist.push(n); // Process it later.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1964
        break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1965
      } else if (nt == PointsToNode::JavaObject) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1966
        add_pointsto_edge(n->_idx, ti);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1967
      } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1968
        add_deferred_edge(n->_idx, ti);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1969
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1970
      _processed.set(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1971
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1972
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1973
    case Op_ConP:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1974
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1975
      // assume all pointer constants globally escape except for null
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1976
      PointsToNode::EscapeState es;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1977
      if (phase->type(n) == TypePtr::NULL_PTR)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1978
        es = PointsToNode::NoEscape;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1979
      else
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1980
        es = PointsToNode::GlobalEscape;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1981
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1982
      add_node(n, PointsToNode::JavaObject, es, true);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1983
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  1984
    }
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1985
    case Op_ConN:
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1986
    {
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1987
      // assume all narrow oop constants globally escape except for null
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1988
      PointsToNode::EscapeState es;
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1989
      if (phase->type(n) == TypeNarrowOop::NULL_PTR)
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1990
        es = PointsToNode::NoEscape;
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1991
      else
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1992
        es = PointsToNode::GlobalEscape;
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1993
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1994
      add_node(n, PointsToNode::JavaObject, es, true);
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1995
      break;
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  1996
    }
371
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  1997
    case Op_CreateEx:
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  1998
    {
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  1999
      // assume that all exception objects globally escape
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  2000
      add_node(n, PointsToNode::JavaObject, PointsToNode::GlobalEscape, true);
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  2001
      break;
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  2002
    }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2003
    case Op_LoadKlass:
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
  2004
    case Op_LoadNKlass:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2005
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2006
      add_node(n, PointsToNode::JavaObject, PointsToNode::GlobalEscape, true);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2007
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2008
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2009
    case Op_LoadP:
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  2010
    case Op_LoadN:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2011
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2012
      const Type *t = phase->type(n);
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  2013
      if (t->make_ptr() == NULL) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2014
        _processed.set(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2015
        return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2016
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2017
      add_node(n, PointsToNode::LocalVar, PointsToNode::UnknownEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2018
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2019
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2020
    case Op_Parm:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2021
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2022
      _processed.set(n->_idx); // No need to redefine it state.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2023
      uint con = n->as_Proj()->_con;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2024
      if (con < TypeFunc::Parms)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2025
        return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2026
      const Type *t = n->in(0)->as_Start()->_domain->field_at(con);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2027
      if (t->isa_ptr() == NULL)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2028
        return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2029
      // We have to assume all input parameters globally escape
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2030
      // (Note: passing 'false' since _processed is already set).
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2031
      add_node(n, PointsToNode::JavaObject, PointsToNode::GlobalEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2032
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2033
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2034
    case Op_Phi:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2035
    {
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  2036
      const Type *t = n->as_Phi()->type();
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  2037
      if (t->make_ptr() == NULL) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  2038
        // nothing to do if not an oop or narrow oop
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2039
        _processed.set(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2040
        return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2041
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2042
      add_node(n, PointsToNode::LocalVar, PointsToNode::UnknownEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2043
      uint i;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2044
      for (i = 1; i < n->req() ; i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2045
        Node* in = n->in(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2046
        if (in == NULL)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2047
          continue;  // ignore NULL
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2048
        in = in->uncast();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2049
        if (in->is_top() || in == n)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2050
          continue;  // ignore top or inputs which go back this node
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2051
        int ti = in->_idx;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2052
        PointsToNode::NodeType nt = ptnode_adr(ti)->node_type();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2053
        if (nt == PointsToNode::UnknownType) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2054
          break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2055
        } else if (nt == PointsToNode::JavaObject) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2056
          add_pointsto_edge(n->_idx, ti);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2057
        } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2058
          add_deferred_edge(n->_idx, ti);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2059
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2060
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2061
      if (i >= n->req())
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2062
        _processed.set(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2063
      else
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2064
        _delayed_worklist.push(n);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2065
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2066
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2067
    case Op_Proj:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2068
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2069
      // we are only interested in the result projection from a call
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2070
      if (n->as_Proj()->_con == TypeFunc::Parms && n->in(0)->is_Call() ) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2071
        add_node(n, PointsToNode::LocalVar, PointsToNode::UnknownEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2072
        process_call_result(n->as_Proj(), phase);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2073
        if (!_processed.test(n->_idx)) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2074
          // The call's result may need to be processed later if the call
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2075
          // returns it's argument and the argument is not processed yet.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2076
          _delayed_worklist.push(n);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2077
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2078
      } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2079
        _processed.set(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2080
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2081
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2082
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2083
    case Op_Return:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2084
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2085
      if( n->req() > TypeFunc::Parms &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2086
          phase->type(n->in(TypeFunc::Parms))->isa_oopptr() ) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2087
        // Treat Return value as LocalVar with GlobalEscape escape state.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2088
        add_node(n, PointsToNode::LocalVar, PointsToNode::GlobalEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2089
        int ti = n->in(TypeFunc::Parms)->_idx;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2090
        PointsToNode::NodeType nt = ptnode_adr(ti)->node_type();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2091
        if (nt == PointsToNode::UnknownType) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2092
          _delayed_worklist.push(n); // Process it later.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2093
          break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2094
        } else if (nt == PointsToNode::JavaObject) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2095
          add_pointsto_edge(n->_idx, ti);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2096
        } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2097
          add_deferred_edge(n->_idx, ti);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2098
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2099
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2100
      _processed.set(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2101
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2102
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2103
    case Op_StoreP:
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  2104
    case Op_StoreN:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2105
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2106
      const Type *adr_type = phase->type(n->in(MemNode::Address));
767
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 594
diff changeset
  2107
      adr_type = adr_type->make_ptr();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2108
      if (adr_type->isa_oopptr()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2109
        add_node(n, PointsToNode::UnknownType, PointsToNode::UnknownEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2110
      } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2111
        Node* adr = n->in(MemNode::Address);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2112
        if (adr->is_AddP() && phase->type(adr) == TypeRawPtr::NOTNULL &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2113
            adr->in(AddPNode::Address)->is_Proj() &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2114
            adr->in(AddPNode::Address)->in(0)->is_Allocate()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2115
          add_node(n, PointsToNode::UnknownType, PointsToNode::UnknownEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2116
          // We are computing a raw address for a store captured
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2117
          // by an Initialize compute an appropriate address type.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2118
          int offs = (int)phase->find_intptr_t_con(adr->in(AddPNode::Offset), Type::OffsetBot);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2119
          assert(offs != Type::OffsetBot, "offset must be a constant");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2120
        } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2121
          _processed.set(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2122
          return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2123
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2124
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2125
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2126
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2127
    case Op_StorePConditional:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2128
    case Op_CompareAndSwapP:
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  2129
    case Op_CompareAndSwapN:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2130
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2131
      const Type *adr_type = phase->type(n->in(MemNode::Address));
767
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 594
diff changeset
  2132
      adr_type = adr_type->make_ptr();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2133
      if (adr_type->isa_oopptr()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2134
        add_node(n, PointsToNode::UnknownType, PointsToNode::UnknownEscape, false);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2135
      } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2136
        _processed.set(n->_idx);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2137
        return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2138
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2139
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2140
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2141
    case Op_ThreadLocal:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2142
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2143
      add_node(n, PointsToNode::JavaObject, PointsToNode::ArgEscape, true);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2144
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2145
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2146
    default:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2147
      ;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2148
      // nothing to do
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2149
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2150
  return;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2151
}
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2152
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2153
void ConnectionGraph::build_connection_graph(Node *n, PhaseTransform *phase) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2154
  uint n_idx = n->_idx;
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2155
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2156
  // Don't set processed bit for AddP, LoadP, StoreP since
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2157
  // they may need more then one pass to process.
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2158
  if (_processed.test(n_idx))
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2159
    return; // No need to redefine node's state.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2160
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2161
  if (n->is_Call()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2162
    CallNode *call = n->as_Call();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2163
    process_call_arguments(call, phase);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2164
    _processed.set(n_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2165
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2166
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2167
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2168
  switch (n->Opcode()) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2169
    case Op_AddP:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2170
    {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2171
      Node *base = get_addp_base(n);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2172
      // Create a field edge to this node from everything base could point to.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2173
      VectorSet ptset(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2174
      PointsTo(ptset, base, phase);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2175
      for( VectorSetI i(&ptset); i.test(); ++i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2176
        uint pt = i.elem;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2177
        add_field_edge(pt, n_idx, address_offset(n, phase));
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2178
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2179
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2180
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2181
    case Op_CastX2P:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2182
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2183
      assert(false, "Op_CastX2P");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2184
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2185
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2186
    case Op_CastPP:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2187
    case Op_CheckCastPP:
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  2188
    case Op_EncodeP:
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 349
diff changeset
  2189
    case Op_DecodeN:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2190
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2191
      int ti = n->in(1)->_idx;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2192
      if (ptnode_adr(ti)->node_type() == PointsToNode::JavaObject) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2193
        add_pointsto_edge(n_idx, ti);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2194
      } else {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2195
        add_deferred_edge(n_idx, ti);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2196
      }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2197
      _processed.set(n_idx);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2198
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2199
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2200
    case Op_ConP:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2201
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2202
      assert(false, "Op_ConP");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2203
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2204
    }
589
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  2205
    case Op_ConN:
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  2206
    {
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  2207
      assert(false, "Op_ConN");
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  2208
      break;
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 371
diff changeset
  2209
    }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2210
    case Op_CreateEx:
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2211
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2212
      assert(false, "Op_CreateEx");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2213
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2214
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2215
    case Op_LoadKlass:
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
  2216
    case Op_LoadNKlass:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2217
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2218
      assert(false, "Op_LoadKlass");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2219
      break;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2220
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2221
    case Op_LoadP:
371
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  2222
    case Op_LoadN:
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2223
    {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2224
      const Type *t = phase->type(n);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2225
#ifdef ASSERT
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  2226
      if (t->make_ptr() == NULL)
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2227
        assert(false, "Op_LoadP");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2228
#endif
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2229
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2230
      Node* adr = n->in(MemNode::Address)->uncast();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2231
      const Type *adr_type = phase->type(adr);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2232
      Node* adr_base;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2233
      if (adr->is_AddP()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2234
        adr_base = get_addp_base(adr);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2235
      } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2236
        adr_base = adr;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2237
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2239
      // For everything "adr_base" could point to, create a deferred edge from
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2240
      // this node to each field with the same offset.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2241
      VectorSet ptset(Thread::current()->resource_area());
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2242
      PointsTo(ptset, adr_base, phase);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2243
      int offset = address_offset(adr, phase);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2244
      for( VectorSetI i(&ptset); i.test(); ++i ) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2245
        uint pt = i.elem;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2246
        add_deferred_edge_to_fields(n_idx, pt, offset);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2247
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2248
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2249
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2250
    case Op_Parm:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2251
    {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2252
      assert(false, "Op_Parm");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2253
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2254
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2255
    case Op_Phi:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2256
    {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2257
#ifdef ASSERT
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  2258
      const Type *t = n->as_Phi()->type();
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  2259
      if (t->make_ptr() == NULL)
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2260
        assert(false, "Op_Phi");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2261
#endif
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2262
      for (uint i = 1; i < n->req() ; i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2263
        Node* in = n->in(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2264
        if (in == NULL)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2265
          continue;  // ignore NULL
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2266
        in = in->uncast();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2267
        if (in->is_top() || in == n)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2268
          continue;  // ignore top or inputs which go back this node
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2269
        int ti = in->_idx;
1069
ef51f81ebe0f 6732732: CTW with EA: assert(n != 0L,"Bad immediate dominator info.")
kvn
parents: 1068
diff changeset
  2270
        PointsToNode::NodeType nt = ptnode_adr(ti)->node_type();
ef51f81ebe0f 6732732: CTW with EA: assert(n != 0L,"Bad immediate dominator info.")
kvn
parents: 1068
diff changeset
  2271
        assert(nt != PointsToNode::UnknownType, "all nodes should be known");
ef51f81ebe0f 6732732: CTW with EA: assert(n != 0L,"Bad immediate dominator info.")
kvn
parents: 1068
diff changeset
  2272
        if (nt == PointsToNode::JavaObject) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2273
          add_pointsto_edge(n_idx, ti);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2274
        } else {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2275
          add_deferred_edge(n_idx, ti);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2276
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2277
      }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2278
      _processed.set(n_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2279
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2280
    }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2281
    case Op_Proj:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2282
    {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2283
      // we are only interested in the result projection from a call
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2284
      if (n->as_Proj()->_con == TypeFunc::Parms && n->in(0)->is_Call() ) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2285
        process_call_result(n->as_Proj(), phase);
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2286
        assert(_processed.test(n_idx), "all call results should be processed");
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2287
      } else {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2288
        assert(false, "Op_Proj");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2289
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2290
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2291
    }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2292
    case Op_Return:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2293
    {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2294
#ifdef ASSERT
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2295
      if( n->req() <= TypeFunc::Parms ||
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2296
          !phase->type(n->in(TypeFunc::Parms))->isa_oopptr() ) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2297
        assert(false, "Op_Return");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2298
      }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2299
#endif
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2300
      int ti = n->in(TypeFunc::Parms)->_idx;
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2301
      if (ptnode_adr(ti)->node_type() == PointsToNode::JavaObject) {
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2302
        add_pointsto_edge(n_idx, ti);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2303
      } else {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2304
        add_deferred_edge(n_idx, ti);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2305
      }
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2306
      _processed.set(n_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2307
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2308
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2309
    case Op_StoreP:
371
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  2310
    case Op_StoreN:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2311
    case Op_StorePConditional:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2312
    case Op_CompareAndSwapP:
371
1aacedc9db7c 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 360
diff changeset
  2313
    case Op_CompareAndSwapN:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2314
    {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2315
      Node *adr = n->in(MemNode::Address);
767
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 594
diff changeset
  2316
      const Type *adr_type = phase->type(adr)->make_ptr();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2317
#ifdef ASSERT
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2318
      if (!adr_type->isa_oopptr())
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2319
        assert(phase->type(adr) == TypeRawPtr::NOTNULL, "Op_StoreP");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2320
#endif
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2321
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2322
      assert(adr->is_AddP(), "expecting an AddP");
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2323
      Node *adr_base = get_addp_base(adr);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2324
      Node *val = n->in(MemNode::ValueIn)->uncast();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2325
      // For everything "adr_base" could point to, create a deferred edge
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2326
      // to "val" from each field with the same offset.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2327
      VectorSet ptset(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2328
      PointsTo(ptset, adr_base, phase);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2329
      for( VectorSetI i(&ptset); i.test(); ++i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2330
        uint pt = i.elem;
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2331
        add_edge_from_fields(pt, val->_idx, address_offset(adr, phase));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2332
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2333
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2334
    }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2335
    case Op_ThreadLocal:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2336
    {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2337
      assert(false, "Op_ThreadLocal");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2338
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2339
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2340
    default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2341
      ;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2342
      // nothing to do
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2343
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2344
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2345
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2346
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2347
void ConnectionGraph::dump() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2348
  PhaseGVN  *igvn = _compile->initial_gvn();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2349
  bool first = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2350
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2351
  uint size = nodes_size();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2352
  for (uint ni = 0; ni < size; ni++) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2353
    PointsToNode *ptn = ptnode_adr(ni);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2354
    PointsToNode::NodeType ptn_type = ptn->node_type();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2355
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2356
    if (ptn_type != PointsToNode::JavaObject || ptn->_node == NULL)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2357
      continue;
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2358
    PointsToNode::EscapeState es = escape_state(ptn->_node, igvn);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2359
    if (ptn->_node->is_Allocate() && (es == PointsToNode::NoEscape || Verbose)) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2360
      if (first) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2361
        tty->cr();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2362
        tty->print("======== Connection graph for ");
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2363
        _compile->method()->print_short_name();
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2364
        tty->cr();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2365
        first = false;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2366
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2367
      tty->print("%6d ", ni);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2368
      ptn->dump();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2369
      // Print all locals which reference this allocation
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2370
      for (uint li = ni; li < size; li++) {
952
38812d18eec0 6684714: Optimize EA Connection Graph build performance
kvn
parents: 769
diff changeset
  2371
        PointsToNode *ptn_loc = ptnode_adr(li);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2372
        PointsToNode::NodeType ptn_loc_type = ptn_loc->node_type();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2373
        if ( ptn_loc_type == PointsToNode::LocalVar && ptn_loc->_node != NULL &&
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2374
             ptn_loc->edge_count() == 1 && ptn_loc->edge_target(0) == ni ) {
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  2375
          ptnode_adr(li)->dump(false);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2376
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2377
      }
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2378
      if (Verbose) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2379
        // Print all fields which reference this allocation
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2380
        for (uint i = 0; i < ptn->edge_count(); i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2381
          uint ei = ptn->edge_target(i);
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 955
diff changeset
  2382
          ptnode_adr(ei)->dump(false);
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2383
        }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2384
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 212
diff changeset
  2385
      tty->cr();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2386
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2387
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2388
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2389
#endif