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