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