Mercurial > hg > truffle

annotate src/share/vm/opto/macro.cpp @ 1080:7c57aead6d3e

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6892658: C2 should optimize some stringbuilder patterns Reviewed-by: kvn, twisti
author never
date Thu, 12 Nov 2009 09:24:21 -0800
parents fc4be448891f
children f96a1a986f7b
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1 /*
579
0fbdb4381b99 6814575: Update copyright year
xdono
parents: 565
diff changeset
2 * Copyright 2005-2009 Sun Microsystems, Inc. All Rights Reserved.
0
a61af66fc99e Initial load
duke
parents:
diff changeset
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
a61af66fc99e Initial load
duke
parents:
diff changeset
4 *
a61af66fc99e Initial load
duke
parents:
diff changeset
5 * This code is free software; you can redistribute it and/or modify it
a61af66fc99e Initial load
duke
parents:
diff changeset
6 * under the terms of the GNU General Public License version 2 only, as
a61af66fc99e Initial load
duke
parents:
diff changeset
7 * published by the Free Software Foundation.
a61af66fc99e Initial load
duke
parents:
diff changeset
8 *
a61af66fc99e Initial load
duke
parents:
diff changeset
9 * This code is distributed in the hope that it will be useful, but WITHOUT
a61af66fc99e Initial load
duke
parents:
diff changeset
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
a61af66fc99e Initial load
duke
parents:
diff changeset
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
a61af66fc99e Initial load
duke
parents:
diff changeset
12 * version 2 for more details (a copy is included in the LICENSE file that
a61af66fc99e Initial load
duke
parents:
diff changeset
13 * accompanied this code).
a61af66fc99e Initial load
duke
parents:
diff changeset
14 *
a61af66fc99e Initial load
duke
parents:
diff changeset
15 * You should have received a copy of the GNU General Public License version
a61af66fc99e Initial load
duke
parents:
diff changeset
16 * 2 along with this work; if not, write to the Free Software Foundation,
a61af66fc99e Initial load
duke
parents:
diff changeset
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
a61af66fc99e Initial load
duke
parents:
diff changeset
18 *
a61af66fc99e Initial load
duke
parents:
diff changeset
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
a61af66fc99e Initial load
duke
parents:
diff changeset
20 * CA 95054 USA or visit www.sun.com if you need additional information or
a61af66fc99e Initial load
duke
parents:
diff changeset
21 * have any questions.
a61af66fc99e Initial load
duke
parents:
diff changeset
22 *
a61af66fc99e Initial load
duke
parents:
diff changeset
23 */
a61af66fc99e Initial load
duke
parents:
diff changeset
24
a61af66fc99e Initial load
duke
parents:
diff changeset
25 #include "incls/_precompiled.incl"
a61af66fc99e Initial load
duke
parents:
diff changeset
26 #include "incls/_macro.cpp.incl"
a61af66fc99e Initial load
duke
parents:
diff changeset
27
a61af66fc99e Initial load
duke
parents:
diff changeset
28
a61af66fc99e Initial load
duke
parents:
diff changeset
29 //
a61af66fc99e Initial load
duke
parents:
diff changeset
30 // Replace any references to "oldref" in inputs to "use" with "newref".
a61af66fc99e Initial load
duke
parents:
diff changeset
31 // Returns the number of replacements made.
a61af66fc99e Initial load
duke
parents:
diff changeset
32 //
a61af66fc99e Initial load
duke
parents:
diff changeset
33 int PhaseMacroExpand::replace_input(Node *use, Node *oldref, Node *newref) {
a61af66fc99e Initial load
duke
parents:
diff changeset
34 int nreplacements = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
35 uint req = use->req();
a61af66fc99e Initial load
duke
parents:
diff changeset
36 for (uint j = 0; j < use->len(); j++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
37 Node *uin = use->in(j);
a61af66fc99e Initial load
duke
parents:
diff changeset
38 if (uin == oldref) {
a61af66fc99e Initial load
duke
parents:
diff changeset
39 if (j < req)
a61af66fc99e Initial load
duke
parents:
diff changeset
40 use->set_req(j, newref);
a61af66fc99e Initial load
duke
parents:
diff changeset
41 else
a61af66fc99e Initial load
duke
parents:
diff changeset
42 use->set_prec(j, newref);
a61af66fc99e Initial load
duke
parents:
diff changeset
43 nreplacements++;
a61af66fc99e Initial load
duke
parents:
diff changeset
44 } else if (j >= req && uin == NULL) {
a61af66fc99e Initial load
duke
parents:
diff changeset
45 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
46 }
a61af66fc99e Initial load
duke
parents:
diff changeset
47 }
a61af66fc99e Initial load
duke
parents:
diff changeset
48 return nreplacements;
a61af66fc99e Initial load
duke
parents:
diff changeset
49 }
a61af66fc99e Initial load
duke
parents:
diff changeset
50
a61af66fc99e Initial load
duke
parents:
diff changeset
51 void PhaseMacroExpand::copy_call_debug_info(CallNode *oldcall, CallNode * newcall) {
a61af66fc99e Initial load
duke
parents:
diff changeset
52 // Copy debug information and adjust JVMState information
a61af66fc99e Initial load
duke
parents:
diff changeset
53 uint old_dbg_start = oldcall->tf()->domain()->cnt();
a61af66fc99e Initial load
duke
parents:
diff changeset
54 uint new_dbg_start = newcall->tf()->domain()->cnt();
a61af66fc99e Initial load
duke
parents:
diff changeset
55 int jvms_adj = new_dbg_start - old_dbg_start;
a61af66fc99e Initial load
duke
parents:
diff changeset
56 assert (new_dbg_start == newcall->req(), "argument count mismatch");
63
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
57
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
58 Dict* sosn_map = new Dict(cmpkey,hashkey);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
59 for (uint i = old_dbg_start; i < oldcall->req(); i++) {
63
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
60 Node* old_in = oldcall->in(i);
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
61 // Clone old SafePointScalarObjectNodes, adjusting their field contents.
460
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
62 if (old_in != NULL && old_in->is_SafePointScalarObject()) {
63
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
63 SafePointScalarObjectNode* old_sosn = old_in->as_SafePointScalarObject();
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
64 uint old_unique = C->unique();
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
65 Node* new_in = old_sosn->clone(jvms_adj, sosn_map);
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
66 if (old_unique != C->unique()) {
601
523ded093c31 6809798: SafePointScalarObject node placed into incorrect block during GCM
kvn
parents: 584
diff changeset
67 new_in->set_req(0, newcall->in(0)); // reset control edge
63
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
68 new_in = transform_later(new_in); // Register new node.
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
69 }
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
70 old_in = new_in;
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
71 }
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
72 newcall->add_req(old_in);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
73 }
63
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
74
0
a61af66fc99e Initial load
duke
parents:
diff changeset
75 newcall->set_jvms(oldcall->jvms());
a61af66fc99e Initial load
duke
parents:
diff changeset
76 for (JVMState *jvms = newcall->jvms(); jvms != NULL; jvms = jvms->caller()) {
a61af66fc99e Initial load
duke
parents:
diff changeset
77 jvms->set_map(newcall);
a61af66fc99e Initial load
duke
parents:
diff changeset
78 jvms->set_locoff(jvms->locoff()+jvms_adj);
a61af66fc99e Initial load
duke
parents:
diff changeset
79 jvms->set_stkoff(jvms->stkoff()+jvms_adj);
a61af66fc99e Initial load
duke
parents:
diff changeset
80 jvms->set_monoff(jvms->monoff()+jvms_adj);
63
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 0
diff changeset
81 jvms->set_scloff(jvms->scloff()+jvms_adj);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
82 jvms->set_endoff(jvms->endoff()+jvms_adj);
a61af66fc99e Initial load
duke
parents:
diff changeset
83 }
a61af66fc99e Initial load
duke
parents:
diff changeset
84 }
a61af66fc99e Initial load
duke
parents:
diff changeset
85
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
86 Node* PhaseMacroExpand::opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
87 Node* cmp;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
88 if (mask != 0) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
89 Node* and_node = transform_later(new (C, 3) AndXNode(word, MakeConX(mask)));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
90 cmp = transform_later(new (C, 3) CmpXNode(and_node, MakeConX(bits)));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
91 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
92 cmp = word;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
93 }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
94 Node* bol = transform_later(new (C, 2) BoolNode(cmp, BoolTest::ne));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
95 IfNode* iff = new (C, 2) IfNode( ctrl, bol, PROB_MIN, COUNT_UNKNOWN );
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
96 transform_later(iff);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
97
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
98 // Fast path taken.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
99 Node *fast_taken = transform_later( new (C, 1) IfFalseNode(iff) );
0
a61af66fc99e Initial load
duke
parents:
diff changeset
100
a61af66fc99e Initial load
duke
parents:
diff changeset
101 // Fast path not-taken, i.e. slow path
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
102 Node *slow_taken = transform_later( new (C, 1) IfTrueNode(iff) );
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
103
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
104 if (return_fast_path) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
105 region->init_req(edge, slow_taken); // Capture slow-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
106 return fast_taken;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
107 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
108 region->init_req(edge, fast_taken); // Capture fast-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
109 return slow_taken;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
110 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
111 }
a61af66fc99e Initial load
duke
parents:
diff changeset
112
a61af66fc99e Initial load
duke
parents:
diff changeset
113 //--------------------copy_predefined_input_for_runtime_call--------------------
a61af66fc99e Initial load
duke
parents:
diff changeset
114 void PhaseMacroExpand::copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call) {
a61af66fc99e Initial load
duke
parents:
diff changeset
115 // Set fixed predefined input arguments
a61af66fc99e Initial load
duke
parents:
diff changeset
116 call->init_req( TypeFunc::Control, ctrl );
a61af66fc99e Initial load
duke
parents:
diff changeset
117 call->init_req( TypeFunc::I_O , oldcall->in( TypeFunc::I_O) );
a61af66fc99e Initial load
duke
parents:
diff changeset
118 call->init_req( TypeFunc::Memory , oldcall->in( TypeFunc::Memory ) ); // ?????
a61af66fc99e Initial load
duke
parents:
diff changeset
119 call->init_req( TypeFunc::ReturnAdr, oldcall->in( TypeFunc::ReturnAdr ) );
a61af66fc99e Initial load
duke
parents:
diff changeset
120 call->init_req( TypeFunc::FramePtr, oldcall->in( TypeFunc::FramePtr ) );
a61af66fc99e Initial load
duke
parents:
diff changeset
121 }
a61af66fc99e Initial load
duke
parents:
diff changeset
122
a61af66fc99e Initial load
duke
parents:
diff changeset
123 //------------------------------make_slow_call---------------------------------
a61af66fc99e Initial load
duke
parents:
diff changeset
124 CallNode* PhaseMacroExpand::make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, address slow_call, const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1) {
a61af66fc99e Initial load
duke
parents:
diff changeset
125
a61af66fc99e Initial load
duke
parents:
diff changeset
126 // Slow-path call
a61af66fc99e Initial load
duke
parents:
diff changeset
127 int size = slow_call_type->domain()->cnt();
a61af66fc99e Initial load
duke
parents:
diff changeset
128 CallNode *call = leaf_name
a61af66fc99e Initial load
duke
parents:
diff changeset
129 ? (CallNode*)new (C, size) CallLeafNode ( slow_call_type, slow_call, leaf_name, TypeRawPtr::BOTTOM )
a61af66fc99e Initial load
duke
parents:
diff changeset
130 : (CallNode*)new (C, size) CallStaticJavaNode( slow_call_type, slow_call, OptoRuntime::stub_name(slow_call), oldcall->jvms()->bci(), TypeRawPtr::BOTTOM );
a61af66fc99e Initial load
duke
parents:
diff changeset
131
a61af66fc99e Initial load
duke
parents:
diff changeset
132 // Slow path call has no side-effects, uses few values
a61af66fc99e Initial load
duke
parents:
diff changeset
133 copy_predefined_input_for_runtime_call(slow_path, oldcall, call );
a61af66fc99e Initial load
duke
parents:
diff changeset
134 if (parm0 != NULL) call->init_req(TypeFunc::Parms+0, parm0);
a61af66fc99e Initial load
duke
parents:
diff changeset
135 if (parm1 != NULL) call->init_req(TypeFunc::Parms+1, parm1);
a61af66fc99e Initial load
duke
parents:
diff changeset
136 copy_call_debug_info(oldcall, call);
a61af66fc99e Initial load
duke
parents:
diff changeset
137 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
a61af66fc99e Initial load
duke
parents:
diff changeset
138 _igvn.hash_delete(oldcall);
a61af66fc99e Initial load
duke
parents:
diff changeset
139 _igvn.subsume_node(oldcall, call);
a61af66fc99e Initial load
duke
parents:
diff changeset
140 transform_later(call);
a61af66fc99e Initial load
duke
parents:
diff changeset
141
a61af66fc99e Initial load
duke
parents:
diff changeset
142 return call;
a61af66fc99e Initial load
duke
parents:
diff changeset
143 }
a61af66fc99e Initial load
duke
parents:
diff changeset
144
a61af66fc99e Initial load
duke
parents:
diff changeset
145 void PhaseMacroExpand::extract_call_projections(CallNode *call) {
a61af66fc99e Initial load
duke
parents:
diff changeset
146 _fallthroughproj = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
147 _fallthroughcatchproj = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
148 _ioproj_fallthrough = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
149 _ioproj_catchall = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
150 _catchallcatchproj = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
151 _memproj_fallthrough = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
152 _memproj_catchall = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
153 _resproj = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
154 for (DUIterator_Fast imax, i = call->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
155 ProjNode *pn = call->fast_out(i)->as_Proj();
a61af66fc99e Initial load
duke
parents:
diff changeset
156 switch (pn->_con) {
a61af66fc99e Initial load
duke
parents:
diff changeset
157 case TypeFunc::Control:
a61af66fc99e Initial load
duke
parents:
diff changeset
158 {
a61af66fc99e Initial load
duke
parents:
diff changeset
159 // For Control (fallthrough) and I_O (catch_all_index) we have CatchProj -> Catch -> Proj
a61af66fc99e Initial load
duke
parents:
diff changeset
160 _fallthroughproj = pn;
a61af66fc99e Initial load
duke
parents:
diff changeset
161 DUIterator_Fast jmax, j = pn->fast_outs(jmax);
a61af66fc99e Initial load
duke
parents:
diff changeset
162 const Node *cn = pn->fast_out(j);
a61af66fc99e Initial load
duke
parents:
diff changeset
163 if (cn->is_Catch()) {
a61af66fc99e Initial load
duke
parents:
diff changeset
164 ProjNode *cpn = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
165 for (DUIterator_Fast kmax, k = cn->fast_outs(kmax); k < kmax; k++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
166 cpn = cn->fast_out(k)->as_Proj();
a61af66fc99e Initial load
duke
parents:
diff changeset
167 assert(cpn->is_CatchProj(), "must be a CatchProjNode");
a61af66fc99e Initial load
duke
parents:
diff changeset
168 if (cpn->_con == CatchProjNode::fall_through_index)
a61af66fc99e Initial load
duke
parents:
diff changeset
169 _fallthroughcatchproj = cpn;
a61af66fc99e Initial load
duke
parents:
diff changeset
170 else {
a61af66fc99e Initial load
duke
parents:
diff changeset
171 assert(cpn->_con == CatchProjNode::catch_all_index, "must be correct index.");
a61af66fc99e Initial load
duke
parents:
diff changeset
172 _catchallcatchproj = cpn;
a61af66fc99e Initial load
duke
parents:
diff changeset
173 }
a61af66fc99e Initial load
duke
parents:
diff changeset
174 }
a61af66fc99e Initial load
duke
parents:
diff changeset
175 }
a61af66fc99e Initial load
duke
parents:
diff changeset
176 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
177 }
a61af66fc99e Initial load
duke
parents:
diff changeset
178 case TypeFunc::I_O:
a61af66fc99e Initial load
duke
parents:
diff changeset
179 if (pn->_is_io_use)
a61af66fc99e Initial load
duke
parents:
diff changeset
180 _ioproj_catchall = pn;
a61af66fc99e Initial load
duke
parents:
diff changeset
181 else
a61af66fc99e Initial load
duke
parents:
diff changeset
182 _ioproj_fallthrough = pn;
a61af66fc99e Initial load
duke
parents:
diff changeset
183 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
184 case TypeFunc::Memory:
a61af66fc99e Initial load
duke
parents:
diff changeset
185 if (pn->_is_io_use)
a61af66fc99e Initial load
duke
parents:
diff changeset
186 _memproj_catchall = pn;
a61af66fc99e Initial load
duke
parents:
diff changeset
187 else
a61af66fc99e Initial load
duke
parents:
diff changeset
188 _memproj_fallthrough = pn;
a61af66fc99e Initial load
duke
parents:
diff changeset
189 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
190 case TypeFunc::Parms:
a61af66fc99e Initial load
duke
parents:
diff changeset
191 _resproj = pn;
a61af66fc99e Initial load
duke
parents:
diff changeset
192 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
193 default:
a61af66fc99e Initial load
duke
parents:
diff changeset
194 assert(false, "unexpected projection from allocation node.");
a61af66fc99e Initial load
duke
parents:
diff changeset
195 }
a61af66fc99e Initial load
duke
parents:
diff changeset
196 }
a61af66fc99e Initial load
duke
parents:
diff changeset
197
a61af66fc99e Initial load
duke
parents:
diff changeset
198 }
a61af66fc99e Initial load
duke
parents:
diff changeset
199
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
200 // Eliminate a card mark sequence. p2x is a ConvP2XNode
851
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
201 void PhaseMacroExpand::eliminate_card_mark(Node* p2x) {
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
202 assert(p2x->Opcode() == Op_CastP2X, "ConvP2XNode required");
851
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
203 if (!UseG1GC) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
204 // vanilla/CMS post barrier
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
205 Node *shift = p2x->unique_out();
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
206 Node *addp = shift->unique_out();
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
207 for (DUIterator_Last jmin, j = addp->last_outs(jmin); j >= jmin; --j) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
208 Node *st = addp->last_out(j);
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
209 assert(st->is_Store(), "store required");
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
210 _igvn.replace_node(st, st->in(MemNode::Memory));
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
211 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
212 } else {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
213 // G1 pre/post barriers
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
214 assert(p2x->outcnt() == 2, "expects 2 users: Xor and URShift nodes");
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
215 // It could be only one user, URShift node, in Object.clone() instrinsic
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
216 // but the new allocation is passed to arraycopy stub and it could not
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
217 // be scalar replaced. So we don't check the case.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
218
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
219 // Remove G1 post barrier.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
220
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
221 // Search for CastP2X->Xor->URShift->Cmp path which
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
222 // checks if the store done to a different from the value's region.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
223 // And replace Cmp with #0 (false) to collapse G1 post barrier.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
224 Node* xorx = NULL;
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
225 for (DUIterator_Fast imax, i = p2x->fast_outs(imax); i < imax; i++) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
226 Node* u = p2x->fast_out(i);
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
227 if (u->Opcode() == Op_XorX) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
228 xorx = u;
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
229 break;
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
230 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
231 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
232 assert(xorx != NULL, "missing G1 post barrier");
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
233 Node* shift = xorx->unique_out();
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
234 Node* cmpx = shift->unique_out();
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
235 assert(cmpx->is_Cmp() && cmpx->unique_out()->is_Bool() &&
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
236 cmpx->unique_out()->as_Bool()->_test._test == BoolTest::ne,
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
237 "missing region check in G1 post barrier");
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
238 _igvn.replace_node(cmpx, makecon(TypeInt::CC_EQ));
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
239
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
240 // Remove G1 pre barrier.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
241
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
242 // Search "if (marking != 0)" check and set it to "false".
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
243 Node* this_region = p2x->in(0);
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
244 assert(this_region != NULL, "");
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
245 // There is no G1 pre barrier if previous stored value is NULL
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
246 // (for example, after initialization).
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
247 if (this_region->is_Region() && this_region->req() == 3) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
248 int ind = 1;
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
249 if (!this_region->in(ind)->is_IfFalse()) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
250 ind = 2;
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
251 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
252 if (this_region->in(ind)->is_IfFalse()) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
253 Node* bol = this_region->in(ind)->in(0)->in(1);
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
254 assert(bol->is_Bool(), "");
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
255 cmpx = bol->in(1);
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
256 if (bol->as_Bool()->_test._test == BoolTest::ne &&
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
257 cmpx->is_Cmp() && cmpx->in(2) == intcon(0) &&
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
258 cmpx->in(1)->is_Load()) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
259 Node* adr = cmpx->in(1)->as_Load()->in(MemNode::Address);
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
260 const int marking_offset = in_bytes(JavaThread::satb_mark_queue_offset() +
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
261 PtrQueue::byte_offset_of_active());
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
262 if (adr->is_AddP() && adr->in(AddPNode::Base) == top() &&
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
263 adr->in(AddPNode::Address)->Opcode() == Op_ThreadLocal &&
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
264 adr->in(AddPNode::Offset) == MakeConX(marking_offset)) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
265 _igvn.replace_node(cmpx, makecon(TypeInt::CC_EQ));
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
266 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
267 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
268 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
269 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
270 // Now CastP2X can be removed since it is used only on dead path
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
271 // which currently still alive until igvn optimize it.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
272 assert(p2x->unique_out()->Opcode() == Op_URShiftX, "");
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 780
diff changeset
273 _igvn.replace_node(p2x, top());
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
274 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
275 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
276
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
277 // Search for a memory operation for the specified memory slice.
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
278 static Node *scan_mem_chain(Node *mem, int alias_idx, int offset, Node *start_mem, Node *alloc, PhaseGVN *phase) {
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
279 Node *orig_mem = mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
280 Node *alloc_mem = alloc->in(TypeFunc::Memory);
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
281 const TypeOopPtr *tinst = phase->C->get_adr_type(alias_idx)->isa_oopptr();
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
282 while (true) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
283 if (mem == alloc_mem || mem == start_mem ) {
605
98cb887364d3 6810672: Comment typos
twisti
parents: 601
diff changeset
284 return mem; // hit one of our sentinels
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
285 } else if (mem->is_MergeMem()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
286 mem = mem->as_MergeMem()->memory_at(alias_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
287 } else if (mem->is_Proj() && mem->as_Proj()->_con == TypeFunc::Memory) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
288 Node *in = mem->in(0);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
289 // we can safely skip over safepoints, calls, locks and membars because we
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
290 // already know that the object is safe to eliminate.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
291 if (in->is_Initialize() && in->as_Initialize()->allocation() == alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
292 return in;
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
293 } else if (in->is_Call()) {
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
294 CallNode *call = in->as_Call();
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
295 if (!call->may_modify(tinst, phase)) {
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
296 mem = call->in(TypeFunc::Memory);
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
297 }
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
298 mem = in->in(TypeFunc::Memory);
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
299 } else if (in->is_MemBar()) {
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
300 mem = in->in(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
301 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
302 assert(false, "unexpected projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
303 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
304 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
305 const TypePtr* atype = mem->as_Store()->adr_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
306 int adr_idx = Compile::current()->get_alias_index(atype);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
307 if (adr_idx == alias_idx) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
308 assert(atype->isa_oopptr(), "address type must be oopptr");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
309 int adr_offset = atype->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
310 uint adr_iid = atype->is_oopptr()->instance_id();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
311 // Array elements references have the same alias_idx
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
312 // but different offset and different instance_id.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
313 if (adr_offset == offset && adr_iid == alloc->_idx)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
314 return mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
315 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
316 assert(adr_idx == Compile::AliasIdxRaw, "address must match or be raw");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
317 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
318 mem = mem->in(MemNode::Memory);
584
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
319 } else if (mem->Opcode() == Op_SCMemProj) {
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
320 assert(mem->in(0)->is_LoadStore(), "sanity");
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
321 const TypePtr* atype = mem->in(0)->in(MemNode::Address)->bottom_type()->is_ptr();
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
322 int adr_idx = Compile::current()->get_alias_index(atype);
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
323 if (adr_idx == alias_idx) {
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
324 assert(false, "Object is not scalar replaceable if a LoadStore node access its field");
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
325 return NULL;
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
326 }
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
327 mem = mem->in(0)->in(MemNode::Memory);
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
328 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
329 return mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
330 }
247
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
331 assert(mem != orig_mem, "dead memory loop");
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
332 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
333 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
334
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
335 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
336 // Given a Memory Phi, compute a value Phi containing the values from stores
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
337 // on the input paths.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
338 // Note: this function is recursive, its depth is limied by the "level" argument
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
339 // Returns the computed Phi, or NULL if it cannot compute it.
247
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
340 Node *PhaseMacroExpand::value_from_mem_phi(Node *mem, BasicType ft, const Type *phi_type, const TypeOopPtr *adr_t, Node *alloc, Node_Stack *value_phis, int level) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
341 assert(mem->is_Phi(), "sanity");
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
342 int alias_idx = C->get_alias_index(adr_t);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
343 int offset = adr_t->offset();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
344 int instance_id = adr_t->instance_id();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
345
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
346 // Check if an appropriate value phi already exists.
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
347 Node* region = mem->in(0);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
348 for (DUIterator_Fast kmax, k = region->fast_outs(kmax); k < kmax; k++) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
349 Node* phi = region->fast_out(k);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
350 if (phi->is_Phi() && phi != mem &&
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
351 phi->as_Phi()->is_same_inst_field(phi_type, instance_id, alias_idx, offset)) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
352 return phi;
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
353 }
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
354 }
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
355 // Check if an appropriate new value phi already exists.
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
356 Node* new_phi = NULL;
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
357 uint size = value_phis->size();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
358 for (uint i=0; i < size; i++) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
359 if ( mem->_idx == value_phis->index_at(i) ) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
360 return value_phis->node_at(i);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
361 }
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
362 }
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
363
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
364 if (level <= 0) {
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
365 return NULL; // Give up: phi tree too deep
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
366 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
367 Node *start_mem = C->start()->proj_out(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
368 Node *alloc_mem = alloc->in(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
369
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
370 uint length = mem->req();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
371 GrowableArray <Node *> values(length, length, NULL);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
372
247
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
373 // create a new Phi for the value
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
374 PhiNode *phi = new (C, length) PhiNode(mem->in(0), phi_type, NULL, instance_id, alias_idx, offset);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
375 transform_later(phi);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
376 value_phis->push(phi, mem->_idx);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
377
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
378 for (uint j = 1; j < length; j++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
379 Node *in = mem->in(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
380 if (in == NULL || in->is_top()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
381 values.at_put(j, in);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
382 } else {
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
383 Node *val = scan_mem_chain(in, alias_idx, offset, start_mem, alloc, &_igvn);
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
384 if (val == start_mem || val == alloc_mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
385 // hit a sentinel, return appropriate 0 value
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
386 values.at_put(j, _igvn.zerocon(ft));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
387 continue;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
388 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
389 if (val->is_Initialize()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
390 val = val->as_Initialize()->find_captured_store(offset, type2aelembytes(ft), &_igvn);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
391 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
392 if (val == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
393 return NULL; // can't find a value on this path
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
394 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
395 if (val == mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
396 values.at_put(j, mem);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
397 } else if (val->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
398 values.at_put(j, val->in(MemNode::ValueIn));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
399 } else if(val->is_Proj() && val->in(0) == alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
400 values.at_put(j, _igvn.zerocon(ft));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
401 } else if (val->is_Phi()) {
247
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
402 val = value_from_mem_phi(val, ft, phi_type, adr_t, alloc, value_phis, level-1);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
403 if (val == NULL) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
404 return NULL;
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
405 }
247
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
406 values.at_put(j, val);
584
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
407 } else if (val->Opcode() == Op_SCMemProj) {
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
408 assert(val->in(0)->is_LoadStore(), "sanity");
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
409 assert(false, "Object is not scalar replaceable if a LoadStore node access its field");
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
410 return NULL;
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
411 } else {
584
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
412 #ifdef ASSERT
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
413 val->dump();
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
414 assert(false, "unknown node on this path");
584
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path")
kvn
parents: 565
diff changeset
415 #endif
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
416 return NULL; // unknown node on this path
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
417 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
418 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
419 }
247
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
420 // Set Phi's inputs
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
421 for (uint j = 1; j < length; j++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
422 if (values.at(j) == mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
423 phi->init_req(j, phi);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
424 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
425 phi->init_req(j, values.at(j));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
426 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
427 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
428 return phi;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
429 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
430
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
431 // Search the last value stored into the object's field.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
432 Node *PhaseMacroExpand::value_from_mem(Node *sfpt_mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc) {
223
1dd146f17531 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 221
diff changeset
433 assert(adr_t->is_known_instance_field(), "instance required");
1dd146f17531 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 221
diff changeset
434 int instance_id = adr_t->instance_id();
1dd146f17531 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 221
diff changeset
435 assert((uint)instance_id == alloc->_idx, "wrong allocation");
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
436
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
437 int alias_idx = C->get_alias_index(adr_t);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
438 int offset = adr_t->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
439 Node *start_mem = C->start()->proj_out(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
440 Node *alloc_ctrl = alloc->in(TypeFunc::Control);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
441 Node *alloc_mem = alloc->in(TypeFunc::Memory);
247
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
442 Arena *a = Thread::current()->resource_area();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
443 VectorSet visited(a);
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
444
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
445
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
446 bool done = sfpt_mem == alloc_mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
447 Node *mem = sfpt_mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
448 while (!done) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
449 if (visited.test_set(mem->_idx)) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
450 return NULL; // found a loop, give up
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
451 }
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
452 mem = scan_mem_chain(mem, alias_idx, offset, start_mem, alloc, &_igvn);
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
453 if (mem == start_mem || mem == alloc_mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
454 done = true; // hit a sentinel, return appropriate 0 value
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
455 } else if (mem->is_Initialize()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
456 mem = mem->as_Initialize()->find_captured_store(offset, type2aelembytes(ft), &_igvn);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
457 if (mem == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
458 done = true; // Something go wrong.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
459 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
460 const TypePtr* atype = mem->as_Store()->adr_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
461 assert(C->get_alias_index(atype) == Compile::AliasIdxRaw, "store is correct memory slice");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
462 done = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
463 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
464 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
465 const TypeOopPtr* atype = mem->as_Store()->adr_type()->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
466 assert(atype != NULL, "address type must be oopptr");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
467 assert(C->get_alias_index(atype) == alias_idx &&
223
1dd146f17531 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 221
diff changeset
468 atype->is_known_instance_field() && atype->offset() == offset &&
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
469 atype->instance_id() == instance_id, "store is correct memory slice");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
470 done = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
471 } else if (mem->is_Phi()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
472 // try to find a phi's unique input
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
473 Node *unique_input = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
474 Node *top = C->top();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
475 for (uint i = 1; i < mem->req(); i++) {
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
476 Node *n = scan_mem_chain(mem->in(i), alias_idx, offset, start_mem, alloc, &_igvn);
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
477 if (n == NULL || n == top || n == mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
478 continue;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
479 } else if (unique_input == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
480 unique_input = n;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
481 } else if (unique_input != n) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
482 unique_input = top;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
483 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
484 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
485 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
486 if (unique_input != NULL && unique_input != top) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
487 mem = unique_input;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
488 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
489 done = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
490 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
491 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
492 assert(false, "unexpected node");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
493 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
494 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
495 if (mem != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
496 if (mem == start_mem || mem == alloc_mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
497 // hit a sentinel, return appropriate 0 value
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
498 return _igvn.zerocon(ft);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
499 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
500 return mem->in(MemNode::ValueIn);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
501 } else if (mem->is_Phi()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
502 // attempt to produce a Phi reflecting the values on the input paths of the Phi
247
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
503 Node_Stack value_phis(a, 8);
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
504 Node * phi = value_from_mem_phi(mem, ft, ftype, adr_t, alloc, &value_phis, ValueSearchLimit);
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
505 if (phi != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
506 return phi;
247
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
507 } else {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
508 // Kill all new Phis
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
509 while(value_phis.is_nonempty()) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
510 Node* n = value_phis.node();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
511 _igvn.hash_delete(n);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
512 _igvn.subsume_node(n, C->top());
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
513 value_phis.pop();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 235
diff changeset
514 }
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
515 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
516 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
517 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
518 // Something go wrong.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
519 return NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
520 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
521
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
522 // Check the possibility of scalar replacement.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
523 bool PhaseMacroExpand::can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
524 // Scan the uses of the allocation to check for anything that would
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
525 // prevent us from eliminating it.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
526 NOT_PRODUCT( const char* fail_eliminate = NULL; )
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
527 DEBUG_ONLY( Node* disq_node = NULL; )
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
528 bool can_eliminate = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
529
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
530 Node* res = alloc->result_cast();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
531 const TypeOopPtr* res_type = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
532 if (res == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
533 // All users were eliminated.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
534 } else if (!res->is_CheckCastPP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
535 alloc->_is_scalar_replaceable = false; // don't try again
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
536 NOT_PRODUCT(fail_eliminate = "Allocation does not have unique CheckCastPP";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
537 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
538 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
539 res_type = _igvn.type(res)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
540 if (res_type == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
541 NOT_PRODUCT(fail_eliminate = "Neither instance or array allocation";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
542 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
543 } else if (res_type->isa_aryptr()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
544 int length = alloc->in(AllocateNode::ALength)->find_int_con(-1);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
545 if (length < 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
546 NOT_PRODUCT(fail_eliminate = "Array's size is not constant";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
547 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
548 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
549 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
550 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
551
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
552 if (can_eliminate && res != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
553 for (DUIterator_Fast jmax, j = res->fast_outs(jmax);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
554 j < jmax && can_eliminate; j++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
555 Node* use = res->fast_out(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
556
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
557 if (use->is_AddP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
558 const TypePtr* addp_type = _igvn.type(use)->is_ptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
559 int offset = addp_type->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
560
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
561 if (offset == Type::OffsetTop || offset == Type::OffsetBot) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
562 NOT_PRODUCT(fail_eliminate = "Undefined field referrence";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
563 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
564 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
565 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
566 for (DUIterator_Fast kmax, k = use->fast_outs(kmax);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
567 k < kmax && can_eliminate; k++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
568 Node* n = use->fast_out(k);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
569 if (!n->is_Store() && n->Opcode() != Op_CastP2X) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
570 DEBUG_ONLY(disq_node = n;)
253
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 247
diff changeset
571 if (n->is_Load() || n->is_LoadStore()) {
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
572 NOT_PRODUCT(fail_eliminate = "Field load";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
573 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
574 NOT_PRODUCT(fail_eliminate = "Not store field referrence";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
575 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
576 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
577 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
578 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
579 } else if (use->is_SafePoint()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
580 SafePointNode* sfpt = use->as_SafePoint();
168
7793bd37a336 6705887: Compressed Oops: generate x64 addressing and implicit null checks with narrow oops
kvn
parents: 163
diff changeset
581 if (sfpt->is_Call() && sfpt->as_Call()->has_non_debug_use(res)) {
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
582 // Object is passed as argument.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
583 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
584 NOT_PRODUCT(fail_eliminate = "Object is passed as argument";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
585 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
586 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
587 Node* sfptMem = sfpt->memory();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
588 if (sfptMem == NULL || sfptMem->is_top()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
589 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
590 NOT_PRODUCT(fail_eliminate = "NULL or TOP memory";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
591 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
592 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
593 safepoints.append_if_missing(sfpt);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
594 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
595 } else if (use->Opcode() != Op_CastP2X) { // CastP2X is used by card mark
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
596 if (use->is_Phi()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
597 if (use->outcnt() == 1 && use->unique_out()->Opcode() == Op_Return) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
598 NOT_PRODUCT(fail_eliminate = "Object is return value";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
599 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
600 NOT_PRODUCT(fail_eliminate = "Object is referenced by Phi";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
601 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
602 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
603 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
604 if (use->Opcode() == Op_Return) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
605 NOT_PRODUCT(fail_eliminate = "Object is return value";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
606 }else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
607 NOT_PRODUCT(fail_eliminate = "Object is referenced by node";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
608 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
609 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
610 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
611 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
612 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
613 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
614 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
615
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
616 #ifndef PRODUCT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
617 if (PrintEliminateAllocations) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
618 if (can_eliminate) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
619 tty->print("Scalar ");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
620 if (res == NULL)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
621 alloc->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
622 else
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
623 res->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
624 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
625 tty->print("NotScalar (%s)", fail_eliminate);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
626 if (res == NULL)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
627 alloc->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
628 else
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
629 res->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
630 #ifdef ASSERT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
631 if (disq_node != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
632 tty->print(" >>>> ");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
633 disq_node->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
634 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
635 #endif /*ASSERT*/
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
636 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
637 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
638 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
639 return can_eliminate;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
640 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
641
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
642 // Do scalar replacement.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
643 bool PhaseMacroExpand::scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
644 GrowableArray <SafePointNode *> safepoints_done;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
645
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
646 ciKlass* klass = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
647 ciInstanceKlass* iklass = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
648 int nfields = 0;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
649 int array_base;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
650 int element_size;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
651 BasicType basic_elem_type;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
652 ciType* elem_type;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
653
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
654 Node* res = alloc->result_cast();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
655 const TypeOopPtr* res_type = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
656 if (res != NULL) { // Could be NULL when there are no users
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
657 res_type = _igvn.type(res)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
658 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
659
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
660 if (res != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
661 klass = res_type->klass();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
662 if (res_type->isa_instptr()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
663 // find the fields of the class which will be needed for safepoint debug information
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
664 assert(klass->is_instance_klass(), "must be an instance klass.");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
665 iklass = klass->as_instance_klass();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
666 nfields = iklass->nof_nonstatic_fields();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
667 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
668 // find the array's elements which will be needed for safepoint debug information
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
669 nfields = alloc->in(AllocateNode::ALength)->find_int_con(-1);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
670 assert(klass->is_array_klass() && nfields >= 0, "must be an array klass.");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
671 elem_type = klass->as_array_klass()->element_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
672 basic_elem_type = elem_type->basic_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
673 array_base = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
674 element_size = type2aelembytes(basic_elem_type);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
675 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
676 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
677 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
678 // Process the safepoint uses
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
679 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
680 while (safepoints.length() > 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
681 SafePointNode* sfpt = safepoints.pop();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
682 Node* mem = sfpt->memory();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
683 uint first_ind = sfpt->req();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
684 SafePointScalarObjectNode* sobj = new (C, 1) SafePointScalarObjectNode(res_type,
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
685 #ifdef ASSERT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
686 alloc,
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
687 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
688 first_ind, nfields);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
689 sobj->init_req(0, sfpt->in(TypeFunc::Control));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
690 transform_later(sobj);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
691
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
692 // Scan object's fields adding an input to the safepoint for each field.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
693 for (int j = 0; j < nfields; j++) {
306
af945ba2e739 6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents: 253
diff changeset
694 intptr_t offset;
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
695 ciField* field = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
696 if (iklass != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
697 field = iklass->nonstatic_field_at(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
698 offset = field->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
699 elem_type = field->type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
700 basic_elem_type = field->layout_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
701 } else {
306
af945ba2e739 6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents: 253
diff changeset
702 offset = array_base + j * (intptr_t)element_size;
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
703 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
704
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
705 const Type *field_type;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
706 // The next code is taken from Parse::do_get_xxx().
124
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 113
diff changeset
707 if (basic_elem_type == T_OBJECT || basic_elem_type == T_ARRAY) {
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
708 if (!elem_type->is_loaded()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
709 field_type = TypeInstPtr::BOTTOM;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
710 } else if (field != NULL && field->is_constant()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
711 // This can happen if the constant oop is non-perm.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
712 ciObject* con = field->constant_value().as_object();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
713 // Do not "join" in the previous type; it doesn't add value,
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
714 // and may yield a vacuous result if the field is of interface type.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
715 field_type = TypeOopPtr::make_from_constant(con)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
716 assert(field_type != NULL, "field singleton type must be consistent");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
717 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
718 field_type = TypeOopPtr::make_from_klass(elem_type->as_klass());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
719 }
124
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 113
diff changeset
720 if (UseCompressedOops) {
221
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 216
diff changeset
721 field_type = field_type->make_narrowoop();
124
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 113
diff changeset
722 basic_elem_type = T_NARROWOOP;
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 113
diff changeset
723 }
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
724 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
725 field_type = Type::get_const_basic_type(basic_elem_type);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
726 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
727
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
728 const TypeOopPtr *field_addr_type = res_type->add_offset(offset)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
729
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
730 Node *field_val = value_from_mem(mem, basic_elem_type, field_type, field_addr_type, alloc);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
731 if (field_val == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
732 // we weren't able to find a value for this field,
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
733 // give up on eliminating this allocation
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
734 alloc->_is_scalar_replaceable = false; // don't try again
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
735 // remove any extra entries we added to the safepoint
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
736 uint last = sfpt->req() - 1;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
737 for (int k = 0; k < j; k++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
738 sfpt->del_req(last--);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
739 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
740 // rollback processed safepoints
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
741 while (safepoints_done.length() > 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
742 SafePointNode* sfpt_done = safepoints_done.pop();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
743 // remove any extra entries we added to the safepoint
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
744 last = sfpt_done->req() - 1;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
745 for (int k = 0; k < nfields; k++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
746 sfpt_done->del_req(last--);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
747 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
748 JVMState *jvms = sfpt_done->jvms();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
749 jvms->set_endoff(sfpt_done->req());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
750 // Now make a pass over the debug information replacing any references
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
751 // to SafePointScalarObjectNode with the allocated object.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
752 int start = jvms->debug_start();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
753 int end = jvms->debug_end();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
754 for (int i = start; i < end; i++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
755 if (sfpt_done->in(i)->is_SafePointScalarObject()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
756 SafePointScalarObjectNode* scobj = sfpt_done->in(i)->as_SafePointScalarObject();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
757 if (scobj->first_index() == sfpt_done->req() &&
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
758 scobj->n_fields() == (uint)nfields) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
759 assert(scobj->alloc() == alloc, "sanity");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
760 sfpt_done->set_req(i, res);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
761 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
762 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
763 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
764 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
765 #ifndef PRODUCT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
766 if (PrintEliminateAllocations) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
767 if (field != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
768 tty->print("=== At SafePoint node %d can't find value of Field: ",
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
769 sfpt->_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
770 field->print();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
771 int field_idx = C->get_alias_index(field_addr_type);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
772 tty->print(" (alias_idx=%d)", field_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
773 } else { // Array's element
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
774 tty->print("=== At SafePoint node %d can't find value of array element [%d]",
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
775 sfpt->_idx, j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
776 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
777 tty->print(", which prevents elimination of: ");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
778 if (res == NULL)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
779 alloc->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
780 else
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
781 res->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
782 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
783 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
784 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
785 }
124
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 113
diff changeset
786 if (UseCompressedOops && field_type->isa_narrowoop()) {
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 113
diff changeset
787 // Enable "DecodeN(EncodeP(Allocate)) --> Allocate" transformation
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 113
diff changeset
788 // to be able scalar replace the allocation.
221
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 216
diff changeset
789 if (field_val->is_EncodeP()) {
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 216
diff changeset
790 field_val = field_val->in(1);
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 216
diff changeset
791 } else {
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 216
diff changeset
792 field_val = transform_later(new (C, 2) DecodeNNode(field_val, field_val->bottom_type()->make_ptr()));
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 216
diff changeset
793 }
124
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops
kvn
parents: 113
diff changeset
794 }
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
795 sfpt->add_req(field_val);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
796 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
797 JVMState *jvms = sfpt->jvms();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
798 jvms->set_endoff(sfpt->req());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
799 // Now make a pass over the debug information replacing any references
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
800 // to the allocated object with "sobj"
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
801 int start = jvms->debug_start();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
802 int end = jvms->debug_end();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
803 for (int i = start; i < end; i++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
804 if (sfpt->in(i) == res) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
805 sfpt->set_req(i, sobj);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
806 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
807 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
808 safepoints_done.append_if_missing(sfpt); // keep it for rollback
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
809 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
810 return true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
811 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
812
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
813 // Process users of eliminated allocation.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
814 void PhaseMacroExpand::process_users_of_allocation(AllocateNode *alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
815 Node* res = alloc->result_cast();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
816 if (res != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
817 for (DUIterator_Last jmin, j = res->last_outs(jmin); j >= jmin; ) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
818 Node *use = res->last_out(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
819 uint oc1 = res->outcnt();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
820
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
821 if (use->is_AddP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
822 for (DUIterator_Last kmin, k = use->last_outs(kmin); k >= kmin; ) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
823 Node *n = use->last_out(k);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
824 uint oc2 = use->outcnt();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
825 if (n->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
826 _igvn.replace_node(n, n->in(MemNode::Memory));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
827 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
828 eliminate_card_mark(n);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
829 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
830 k -= (oc2 - use->outcnt());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
831 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
832 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
833 eliminate_card_mark(use);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
834 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
835 j -= (oc1 - res->outcnt());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
836 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
837 assert(res->outcnt() == 0, "all uses of allocated objects must be deleted");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
838 _igvn.remove_dead_node(res);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
839 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
840
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
841 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
842 // Process other users of allocation's projections
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
843 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
844 if (_resproj != NULL && _resproj->outcnt() != 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
845 for (DUIterator_Last jmin, j = _resproj->last_outs(jmin); j >= jmin; ) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
846 Node *use = _resproj->last_out(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
847 uint oc1 = _resproj->outcnt();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
848 if (use->is_Initialize()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
849 // Eliminate Initialize node.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
850 InitializeNode *init = use->as_Initialize();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
851 assert(init->outcnt() <= 2, "only a control and memory projection expected");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
852 Node *ctrl_proj = init->proj_out(TypeFunc::Control);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
853 if (ctrl_proj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
854 assert(init->in(TypeFunc::Control) == _fallthroughcatchproj, "allocation control projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
855 _igvn.replace_node(ctrl_proj, _fallthroughcatchproj);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
856 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
857 Node *mem_proj = init->proj_out(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
858 if (mem_proj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
859 Node *mem = init->in(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
860 #ifdef ASSERT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
861 if (mem->is_MergeMem()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
862 assert(mem->in(TypeFunc::Memory) == _memproj_fallthrough, "allocation memory projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
863 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
864 assert(mem == _memproj_fallthrough, "allocation memory projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
865 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
866 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
867 _igvn.replace_node(mem_proj, mem);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
868 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
869 } else if (use->is_AddP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
870 // raw memory addresses used only by the initialization
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
871 _igvn.replace_node(use, C->top());
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
872 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
873 assert(false, "only Initialize or AddP expected");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
874 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
875 j -= (oc1 - _resproj->outcnt());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
876 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
877 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
878 if (_fallthroughcatchproj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
879 _igvn.replace_node(_fallthroughcatchproj, alloc->in(TypeFunc::Control));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
880 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
881 if (_memproj_fallthrough != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
882 _igvn.replace_node(_memproj_fallthrough, alloc->in(TypeFunc::Memory));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
883 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
884 if (_memproj_catchall != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
885 _igvn.replace_node(_memproj_catchall, C->top());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
886 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
887 if (_ioproj_fallthrough != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
888 _igvn.replace_node(_ioproj_fallthrough, alloc->in(TypeFunc::I_O));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
889 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
890 if (_ioproj_catchall != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
891 _igvn.replace_node(_ioproj_catchall, C->top());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
892 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
893 if (_catchallcatchproj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
894 _igvn.replace_node(_catchallcatchproj, C->top());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
895 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
896 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
897
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
898 bool PhaseMacroExpand::eliminate_allocate_node(AllocateNode *alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
899
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
900 if (!EliminateAllocations || !alloc->_is_scalar_replaceable) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
901 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
902 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
903
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
904 extract_call_projections(alloc);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
905
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
906 GrowableArray <SafePointNode *> safepoints;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
907 if (!can_eliminate_allocation(alloc, safepoints)) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
908 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
909 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
910
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
911 if (!scalar_replacement(alloc, safepoints)) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
912 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
913 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
914
1080
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
915 CompileLog* log = C->log();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
916 if (log != NULL) {
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
917 Node* klass = alloc->in(AllocateNode::KlassNode);
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
918 const TypeKlassPtr* tklass = _igvn.type(klass)->is_klassptr();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
919 log->head("eliminate_allocation type='%d'",
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
920 log->identify(tklass->klass()));
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
921 JVMState* p = alloc->jvms();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
922 while (p != NULL) {
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
923 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
924 p = p->caller();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
925 }
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
926 log->tail("eliminate_allocation");
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
927 }
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
928
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
929 process_users_of_allocation(alloc);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
930
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
931 #ifndef PRODUCT
1080
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
932 if (PrintEliminateAllocations) {
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
933 if (alloc->is_AllocateArray())
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
934 tty->print_cr("++++ Eliminated: %d AllocateArray", alloc->_idx);
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
935 else
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
936 tty->print_cr("++++ Eliminated: %d Allocate", alloc->_idx);
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
937 }
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
938 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
939
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
940 return true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
941 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
942
0
a61af66fc99e Initial load
duke
parents:
diff changeset
943
a61af66fc99e Initial load
duke
parents:
diff changeset
944 //---------------------------set_eden_pointers-------------------------
a61af66fc99e Initial load
duke
parents:
diff changeset
945 void PhaseMacroExpand::set_eden_pointers(Node* &eden_top_adr, Node* &eden_end_adr) {
a61af66fc99e Initial load
duke
parents:
diff changeset
946 if (UseTLAB) { // Private allocation: load from TLS
a61af66fc99e Initial load
duke
parents:
diff changeset
947 Node* thread = transform_later(new (C, 1) ThreadLocalNode());
a61af66fc99e Initial load
duke
parents:
diff changeset
948 int tlab_top_offset = in_bytes(JavaThread::tlab_top_offset());
a61af66fc99e Initial load
duke
parents:
diff changeset
949 int tlab_end_offset = in_bytes(JavaThread::tlab_end_offset());
a61af66fc99e Initial load
duke
parents:
diff changeset
950 eden_top_adr = basic_plus_adr(top()/*not oop*/, thread, tlab_top_offset);
a61af66fc99e Initial load
duke
parents:
diff changeset
951 eden_end_adr = basic_plus_adr(top()/*not oop*/, thread, tlab_end_offset);
a61af66fc99e Initial load
duke
parents:
diff changeset
952 } else { // Shared allocation: load from globals
a61af66fc99e Initial load
duke
parents:
diff changeset
953 CollectedHeap* ch = Universe::heap();
a61af66fc99e Initial load
duke
parents:
diff changeset
954 address top_adr = (address)ch->top_addr();
a61af66fc99e Initial load
duke
parents:
diff changeset
955 address end_adr = (address)ch->end_addr();
a61af66fc99e Initial load
duke
parents:
diff changeset
956 eden_top_adr = makecon(TypeRawPtr::make(top_adr));
a61af66fc99e Initial load
duke
parents:
diff changeset
957 eden_end_adr = basic_plus_adr(eden_top_adr, end_adr - top_adr);
a61af66fc99e Initial load
duke
parents:
diff changeset
958 }
a61af66fc99e Initial load
duke
parents:
diff changeset
959 }
a61af66fc99e Initial load
duke
parents:
diff changeset
960
a61af66fc99e Initial load
duke
parents:
diff changeset
961
a61af66fc99e Initial load
duke
parents:
diff changeset
962 Node* PhaseMacroExpand::make_load(Node* ctl, Node* mem, Node* base, int offset, const Type* value_type, BasicType bt) {
a61af66fc99e Initial load
duke
parents:
diff changeset
963 Node* adr = basic_plus_adr(base, offset);
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
964 const TypePtr* adr_type = adr->bottom_type()->is_ptr();
113
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 73
diff changeset
965 Node* value = LoadNode::make(_igvn, ctl, mem, adr, adr_type, value_type, bt);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
966 transform_later(value);
a61af66fc99e Initial load
duke
parents:
diff changeset
967 return value;
a61af66fc99e Initial load
duke
parents:
diff changeset
968 }
a61af66fc99e Initial load
duke
parents:
diff changeset
969
a61af66fc99e Initial load
duke
parents:
diff changeset
970
a61af66fc99e Initial load
duke
parents:
diff changeset
971 Node* PhaseMacroExpand::make_store(Node* ctl, Node* mem, Node* base, int offset, Node* value, BasicType bt) {
a61af66fc99e Initial load
duke
parents:
diff changeset
972 Node* adr = basic_plus_adr(base, offset);
113
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 73
diff changeset
973 mem = StoreNode::make(_igvn, ctl, mem, adr, NULL, value, bt);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
974 transform_later(mem);
a61af66fc99e Initial load
duke
parents:
diff changeset
975 return mem;
a61af66fc99e Initial load
duke
parents:
diff changeset
976 }
a61af66fc99e Initial load
duke
parents:
diff changeset
977
a61af66fc99e Initial load
duke
parents:
diff changeset
978 //=============================================================================
a61af66fc99e Initial load
duke
parents:
diff changeset
979 //
a61af66fc99e Initial load
duke
parents:
diff changeset
980 // A L L O C A T I O N
a61af66fc99e Initial load
duke
parents:
diff changeset
981 //
a61af66fc99e Initial load
duke
parents:
diff changeset
982 // Allocation attempts to be fast in the case of frequent small objects.
a61af66fc99e Initial load
duke
parents:
diff changeset
983 // It breaks down like this:
a61af66fc99e Initial load
duke
parents:
diff changeset
984 //
a61af66fc99e Initial load
duke
parents:
diff changeset
985 // 1) Size in doublewords is computed. This is a constant for objects and
a61af66fc99e Initial load
duke
parents:
diff changeset
986 // variable for most arrays. Doubleword units are used to avoid size
a61af66fc99e Initial load
duke
parents:
diff changeset
987 // overflow of huge doubleword arrays. We need doublewords in the end for
a61af66fc99e Initial load
duke
parents:
diff changeset
988 // rounding.
a61af66fc99e Initial load
duke
parents:
diff changeset
989 //
a61af66fc99e Initial load
duke
parents:
diff changeset
990 // 2) Size is checked for being 'too large'. Too-large allocations will go
a61af66fc99e Initial load
duke
parents:
diff changeset
991 // the slow path into the VM. The slow path can throw any required
a61af66fc99e Initial load
duke
parents:
diff changeset
992 // exceptions, and does all the special checks for very large arrays. The
a61af66fc99e Initial load
duke
parents:
diff changeset
993 // size test can constant-fold away for objects. For objects with
a61af66fc99e Initial load
duke
parents:
diff changeset
994 // finalizers it constant-folds the otherway: you always go slow with
a61af66fc99e Initial load
duke
parents:
diff changeset
995 // finalizers.
a61af66fc99e Initial load
duke
parents:
diff changeset
996 //
a61af66fc99e Initial load
duke
parents:
diff changeset
997 // 3) If NOT using TLABs, this is the contended loop-back point.
a61af66fc99e Initial load
duke
parents:
diff changeset
998 // Load-Locked the heap top. If using TLABs normal-load the heap top.
a61af66fc99e Initial load
duke
parents:
diff changeset
999 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1000 // 4) Check that heap top + size*8 < max. If we fail go the slow ` route.
a61af66fc99e Initial load
duke
parents:
diff changeset
1001 // NOTE: "top+size*8" cannot wrap the 4Gig line! Here's why: for largish
a61af66fc99e Initial load
duke
parents:
diff changeset
1002 // "size*8" we always enter the VM, where "largish" is a constant picked small
a61af66fc99e Initial load
duke
parents:
diff changeset
1003 // enough that there's always space between the eden max and 4Gig (old space is
a61af66fc99e Initial load
duke
parents:
diff changeset
1004 // there so it's quite large) and large enough that the cost of entering the VM
a61af66fc99e Initial load
duke
parents:
diff changeset
1005 // is dwarfed by the cost to initialize the space.
a61af66fc99e Initial load
duke
parents:
diff changeset
1006 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1007 // 5) If NOT using TLABs, Store-Conditional the adjusted heap top back
a61af66fc99e Initial load
duke
parents:
diff changeset
1008 // down. If contended, repeat at step 3. If using TLABs normal-store
a61af66fc99e Initial load
duke
parents:
diff changeset
1009 // adjusted heap top back down; there is no contention.
a61af66fc99e Initial load
duke
parents:
diff changeset
1010 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1011 // 6) If !ZeroTLAB then Bulk-clear the object/array. Fill in klass & mark
a61af66fc99e Initial load
duke
parents:
diff changeset
1012 // fields.
a61af66fc99e Initial load
duke
parents:
diff changeset
1013 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1014 // 7) Merge with the slow-path; cast the raw memory pointer to the correct
a61af66fc99e Initial load
duke
parents:
diff changeset
1015 // oop flavor.
a61af66fc99e Initial load
duke
parents:
diff changeset
1016 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1017 //=============================================================================
a61af66fc99e Initial load
duke
parents:
diff changeset
1018 // FastAllocateSizeLimit value is in DOUBLEWORDS.
a61af66fc99e Initial load
duke
parents:
diff changeset
1019 // Allocations bigger than this always go the slow route.
a61af66fc99e Initial load
duke
parents:
diff changeset
1020 // This value must be small enough that allocation attempts that need to
a61af66fc99e Initial load
duke
parents:
diff changeset
1021 // trigger exceptions go the slow route. Also, it must be small enough so
a61af66fc99e Initial load
duke
parents:
diff changeset
1022 // that heap_top + size_in_bytes does not wrap around the 4Gig limit.
a61af66fc99e Initial load
duke
parents:
diff changeset
1023 //=============================================================================j//
a61af66fc99e Initial load
duke
parents:
diff changeset
1024 // %%% Here is an old comment from parseHelper.cpp; is it outdated?
a61af66fc99e Initial load
duke
parents:
diff changeset
1025 // The allocator will coalesce int->oop copies away. See comment in
a61af66fc99e Initial load
duke
parents:
diff changeset
1026 // coalesce.cpp about how this works. It depends critically on the exact
a61af66fc99e Initial load
duke
parents:
diff changeset
1027 // code shape produced here, so if you are changing this code shape
a61af66fc99e Initial load
duke
parents:
diff changeset
1028 // make sure the GC info for the heap-top is correct in and around the
a61af66fc99e Initial load
duke
parents:
diff changeset
1029 // slow-path call.
a61af66fc99e Initial load
duke
parents:
diff changeset
1030 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1031
a61af66fc99e Initial load
duke
parents:
diff changeset
1032 void PhaseMacroExpand::expand_allocate_common(
a61af66fc99e Initial load
duke
parents:
diff changeset
1033 AllocateNode* alloc, // allocation node to be expanded
a61af66fc99e Initial load
duke
parents:
diff changeset
1034 Node* length, // array length for an array allocation
a61af66fc99e Initial load
duke
parents:
diff changeset
1035 const TypeFunc* slow_call_type, // Type of slow call
a61af66fc99e Initial load
duke
parents:
diff changeset
1036 address slow_call_address // Address of slow call
a61af66fc99e Initial load
duke
parents:
diff changeset
1037 )
a61af66fc99e Initial load
duke
parents:
diff changeset
1038 {
a61af66fc99e Initial load
duke
parents:
diff changeset
1039
a61af66fc99e Initial load
duke
parents:
diff changeset
1040 Node* ctrl = alloc->in(TypeFunc::Control);
a61af66fc99e Initial load
duke
parents:
diff changeset
1041 Node* mem = alloc->in(TypeFunc::Memory);
a61af66fc99e Initial load
duke
parents:
diff changeset
1042 Node* i_o = alloc->in(TypeFunc::I_O);
a61af66fc99e Initial load
duke
parents:
diff changeset
1043 Node* size_in_bytes = alloc->in(AllocateNode::AllocSize);
a61af66fc99e Initial load
duke
parents:
diff changeset
1044 Node* klass_node = alloc->in(AllocateNode::KlassNode);
a61af66fc99e Initial load
duke
parents:
diff changeset
1045 Node* initial_slow_test = alloc->in(AllocateNode::InitialTest);
a61af66fc99e Initial load
duke
parents:
diff changeset
1046
a61af66fc99e Initial load
duke
parents:
diff changeset
1047 assert(ctrl != NULL, "must have control");
a61af66fc99e Initial load
duke
parents:
diff changeset
1048 // We need a Region and corresponding Phi's to merge the slow-path and fast-path results.
a61af66fc99e Initial load
duke
parents:
diff changeset
1049 // they will not be used if "always_slow" is set
a61af66fc99e Initial load
duke
parents:
diff changeset
1050 enum { slow_result_path = 1, fast_result_path = 2 };
a61af66fc99e Initial load
duke
parents:
diff changeset
1051 Node *result_region;
a61af66fc99e Initial load
duke
parents:
diff changeset
1052 Node *result_phi_rawmem;
a61af66fc99e Initial load
duke
parents:
diff changeset
1053 Node *result_phi_rawoop;
a61af66fc99e Initial load
duke
parents:
diff changeset
1054 Node *result_phi_i_o;
a61af66fc99e Initial load
duke
parents:
diff changeset
1055
a61af66fc99e Initial load
duke
parents:
diff changeset
1056 // The initial slow comparison is a size check, the comparison
a61af66fc99e Initial load
duke
parents:
diff changeset
1057 // we want to do is a BoolTest::gt
a61af66fc99e Initial load
duke
parents:
diff changeset
1058 bool always_slow = false;
a61af66fc99e Initial load
duke
parents:
diff changeset
1059 int tv = _igvn.find_int_con(initial_slow_test, -1);
a61af66fc99e Initial load
duke
parents:
diff changeset
1060 if (tv >= 0) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1061 always_slow = (tv == 1);
a61af66fc99e Initial load
duke
parents:
diff changeset
1062 initial_slow_test = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
1063 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
1064 initial_slow_test = BoolNode::make_predicate(initial_slow_test, &_igvn);
a61af66fc99e Initial load
duke
parents:
diff changeset
1065 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1066
780
c96bf21b756f 6788527: Server vm intermittently fails with assertion "live value must not be garbage" with fastdebug bits
kvn
parents: 708
diff changeset
1067 if (C->env()->dtrace_alloc_probes() ||
342
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1068 !UseTLAB && (!Universe::heap()->supports_inline_contig_alloc() ||
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1069 (UseConcMarkSweepGC && CMSIncrementalMode))) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1070 // Force slow-path allocation
a61af66fc99e Initial load
duke
parents:
diff changeset
1071 always_slow = true;
a61af66fc99e Initial load
duke
parents:
diff changeset
1072 initial_slow_test = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
1073 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1074
342
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1075
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1076 enum { too_big_or_final_path = 1, need_gc_path = 2 };
a61af66fc99e Initial load
duke
parents:
diff changeset
1077 Node *slow_region = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
1078 Node *toobig_false = ctrl;
a61af66fc99e Initial load
duke
parents:
diff changeset
1079
a61af66fc99e Initial load
duke
parents:
diff changeset
1080 assert (initial_slow_test == NULL || !always_slow, "arguments must be consistent");
a61af66fc99e Initial load
duke
parents:
diff changeset
1081 // generate the initial test if necessary
a61af66fc99e Initial load
duke
parents:
diff changeset
1082 if (initial_slow_test != NULL ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1083 slow_region = new (C, 3) RegionNode(3);
a61af66fc99e Initial load
duke
parents:
diff changeset
1084
a61af66fc99e Initial load
duke
parents:
diff changeset
1085 // Now make the initial failure test. Usually a too-big test but
a61af66fc99e Initial load
duke
parents:
diff changeset
1086 // might be a TRUE for finalizers or a fancy class check for
a61af66fc99e Initial load
duke
parents:
diff changeset
1087 // newInstance0.
a61af66fc99e Initial load
duke
parents:
diff changeset
1088 IfNode *toobig_iff = new (C, 2) IfNode(ctrl, initial_slow_test, PROB_MIN, COUNT_UNKNOWN);
a61af66fc99e Initial load
duke
parents:
diff changeset
1089 transform_later(toobig_iff);
a61af66fc99e Initial load
duke
parents:
diff changeset
1090 // Plug the failing-too-big test into the slow-path region
a61af66fc99e Initial load
duke
parents:
diff changeset
1091 Node *toobig_true = new (C, 1) IfTrueNode( toobig_iff );
a61af66fc99e Initial load
duke
parents:
diff changeset
1092 transform_later(toobig_true);
a61af66fc99e Initial load
duke
parents:
diff changeset
1093 slow_region ->init_req( too_big_or_final_path, toobig_true );
a61af66fc99e Initial load
duke
parents:
diff changeset
1094 toobig_false = new (C, 1) IfFalseNode( toobig_iff );
a61af66fc99e Initial load
duke
parents:
diff changeset
1095 transform_later(toobig_false);
a61af66fc99e Initial load
duke
parents:
diff changeset
1096 } else { // No initial test, just fall into next case
a61af66fc99e Initial load
duke
parents:
diff changeset
1097 toobig_false = ctrl;
a61af66fc99e Initial load
duke
parents:
diff changeset
1098 debug_only(slow_region = NodeSentinel);
a61af66fc99e Initial load
duke
parents:
diff changeset
1099 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1100
a61af66fc99e Initial load
duke
parents:
diff changeset
1101 Node *slow_mem = mem; // save the current memory state for slow path
a61af66fc99e Initial load
duke
parents:
diff changeset
1102 // generate the fast allocation code unless we know that the initial test will always go slow
a61af66fc99e Initial load
duke
parents:
diff changeset
1103 if (!always_slow) {
565
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception
kvn
parents: 490
diff changeset
1104 // Fast path modifies only raw memory.
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception
kvn
parents: 490
diff changeset
1105 if (mem->is_MergeMem()) {
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception
kvn
parents: 490
diff changeset
1106 mem = mem->as_MergeMem()->memory_at(Compile::AliasIdxRaw);
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception
kvn
parents: 490
diff changeset
1107 }
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception
kvn
parents: 490
diff changeset
1108
342
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1109 Node* eden_top_adr;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1110 Node* eden_end_adr;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1111
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1112 set_eden_pointers(eden_top_adr, eden_end_adr);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1113
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1114 // Load Eden::end. Loop invariant and hoisted.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1115 //
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1116 // Note: We set the control input on "eden_end" and "old_eden_top" when using
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1117 // a TLAB to work around a bug where these values were being moved across
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1118 // a safepoint. These are not oops, so they cannot be include in the oop
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1119 // map, but the can be changed by a GC. The proper way to fix this would
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1120 // be to set the raw memory state when generating a SafepointNode. However
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1121 // this will require extensive changes to the loop optimization in order to
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1122 // prevent a degradation of the optimization.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1123 // See comment in memnode.hpp, around line 227 in class LoadPNode.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1124 Node *eden_end = make_load(ctrl, mem, eden_end_adr, 0, TypeRawPtr::BOTTOM, T_ADDRESS);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector
ysr
parents: 124
diff changeset
1125
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1126 // allocate the Region and Phi nodes for the result
a61af66fc99e Initial load
duke
parents:
diff changeset
1127 result_region = new (C, 3) RegionNode(3);
a61af66fc99e Initial load
duke
parents:
diff changeset
1128 result_phi_rawmem = new (C, 3) PhiNode( result_region, Type::MEMORY, TypeRawPtr::BOTTOM );
a61af66fc99e Initial load
duke
parents:
diff changeset
1129 result_phi_rawoop = new (C, 3) PhiNode( result_region, TypeRawPtr::BOTTOM );
a61af66fc99e Initial load
duke
parents:
diff changeset
1130 result_phi_i_o = new (C, 3) PhiNode( result_region, Type::ABIO ); // I/O is used for Prefetch
a61af66fc99e Initial load
duke
parents:
diff changeset
1131
a61af66fc99e Initial load
duke
parents:
diff changeset
1132 // We need a Region for the loop-back contended case.
a61af66fc99e Initial load
duke
parents:
diff changeset
1133 enum { fall_in_path = 1, contended_loopback_path = 2 };
a61af66fc99e Initial load
duke
parents:
diff changeset
1134 Node *contended_region;
a61af66fc99e Initial load
duke
parents:
diff changeset
1135 Node *contended_phi_rawmem;
a61af66fc99e Initial load
duke
parents:
diff changeset
1136 if( UseTLAB ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1137 contended_region = toobig_false;
a61af66fc99e Initial load
duke
parents:
diff changeset
1138 contended_phi_rawmem = mem;
a61af66fc99e Initial load
duke
parents:
diff changeset
1139 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
1140 contended_region = new (C, 3) RegionNode(3);
a61af66fc99e Initial load
duke
parents:
diff changeset
1141 contended_phi_rawmem = new (C, 3) PhiNode( contended_region, Type::MEMORY, TypeRawPtr::BOTTOM);
a61af66fc99e Initial load
duke
parents:
diff changeset
1142 // Now handle the passing-too-big test. We fall into the contended
a61af66fc99e Initial load
duke
parents:
diff changeset
1143 // loop-back merge point.
a61af66fc99e Initial load
duke
parents:
diff changeset
1144 contended_region ->init_req( fall_in_path, toobig_false );
a61af66fc99e Initial load
duke
parents:
diff changeset
1145 contended_phi_rawmem->init_req( fall_in_path, mem );
a61af66fc99e Initial load
duke
parents:
diff changeset
1146 transform_later(contended_region);
a61af66fc99e Initial load
duke
parents:
diff changeset
1147 transform_later(contended_phi_rawmem);
a61af66fc99e Initial load
duke
parents:
diff changeset
1148 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1149
a61af66fc99e Initial load
duke
parents:
diff changeset
1150 // Load(-locked) the heap top.
a61af66fc99e Initial load
duke
parents:
diff changeset
1151 // See note above concerning the control input when using a TLAB
a61af66fc99e Initial load
duke
parents:
diff changeset
1152 Node *old_eden_top = UseTLAB
a61af66fc99e Initial load
duke
parents:
diff changeset
1153 ? new (C, 3) LoadPNode ( ctrl, contended_phi_rawmem, eden_top_adr, TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM )
a61af66fc99e Initial load
duke
parents:
diff changeset
1154 : new (C, 3) LoadPLockedNode( contended_region, contended_phi_rawmem, eden_top_adr );
a61af66fc99e Initial load
duke
parents:
diff changeset
1155
a61af66fc99e Initial load
duke
parents:
diff changeset
1156 transform_later(old_eden_top);
a61af66fc99e Initial load
duke
parents:
diff changeset
1157 // Add to heap top to get a new heap top
a61af66fc99e Initial load
duke
parents:
diff changeset
1158 Node *new_eden_top = new (C, 4) AddPNode( top(), old_eden_top, size_in_bytes );
a61af66fc99e Initial load
duke
parents:
diff changeset
1159 transform_later(new_eden_top);
a61af66fc99e Initial load
duke
parents:
diff changeset
1160 // Check for needing a GC; compare against heap end
a61af66fc99e Initial load
duke
parents:
diff changeset
1161 Node *needgc_cmp = new (C, 3) CmpPNode( new_eden_top, eden_end );
a61af66fc99e Initial load
duke
parents:
diff changeset
1162 transform_later(needgc_cmp);
a61af66fc99e Initial load
duke
parents:
diff changeset
1163 Node *needgc_bol = new (C, 2) BoolNode( needgc_cmp, BoolTest::ge );
a61af66fc99e Initial load
duke
parents:
diff changeset
1164 transform_later(needgc_bol);
a61af66fc99e Initial load
duke
parents:
diff changeset
1165 IfNode *needgc_iff = new (C, 2) IfNode(contended_region, needgc_bol, PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN );
a61af66fc99e Initial load
duke
parents:
diff changeset
1166 transform_later(needgc_iff);
a61af66fc99e Initial load
duke
parents:
diff changeset
1167
a61af66fc99e Initial load
duke
parents:
diff changeset
1168 // Plug the failing-heap-space-need-gc test into the slow-path region
a61af66fc99e Initial load
duke
parents:
diff changeset
1169 Node *needgc_true = new (C, 1) IfTrueNode( needgc_iff );
a61af66fc99e Initial load
duke
parents:
diff changeset
1170 transform_later(needgc_true);
a61af66fc99e Initial load
duke
parents:
diff changeset
1171 if( initial_slow_test ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1172 slow_region ->init_req( need_gc_path, needgc_true );
a61af66fc99e Initial load
duke
parents:
diff changeset
1173 // This completes all paths into the slow merge point
a61af66fc99e Initial load
duke
parents:
diff changeset
1174 transform_later(slow_region);
a61af66fc99e Initial load
duke
parents:
diff changeset
1175 } else { // No initial slow path needed!
a61af66fc99e Initial load
duke
parents:
diff changeset
1176 // Just fall from the need-GC path straight into the VM call.
a61af66fc99e Initial load
duke
parents:
diff changeset
1177 slow_region = needgc_true;
a61af66fc99e Initial load
duke
parents:
diff changeset
1178 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1179 // No need for a GC. Setup for the Store-Conditional
a61af66fc99e Initial load
duke
parents:
diff changeset
1180 Node *needgc_false = new (C, 1) IfFalseNode( needgc_iff );
a61af66fc99e Initial load
duke
parents:
diff changeset
1181 transform_later(needgc_false);
a61af66fc99e Initial load
duke
parents:
diff changeset
1182
a61af66fc99e Initial load
duke
parents:
diff changeset
1183 // Grab regular I/O before optional prefetch may change it.
a61af66fc99e Initial load
duke
parents:
diff changeset
1184 // Slow-path does no I/O so just set it to the original I/O.
a61af66fc99e Initial load
duke
parents:
diff changeset
1185 result_phi_i_o->init_req( slow_result_path, i_o );
a61af66fc99e Initial load
duke
parents:
diff changeset
1186
a61af66fc99e Initial load
duke
parents:
diff changeset
1187 i_o = prefetch_allocation(i_o, needgc_false, contended_phi_rawmem,
a61af66fc99e Initial load
duke
parents:
diff changeset
1188 old_eden_top, new_eden_top, length);
a61af66fc99e Initial load
duke
parents:
diff changeset
1189
a61af66fc99e Initial load
duke
parents:
diff changeset
1190 // Store (-conditional) the modified eden top back down.
a61af66fc99e Initial load
duke
parents:
diff changeset
1191 // StorePConditional produces flags for a test PLUS a modified raw
a61af66fc99e Initial load
duke
parents:
diff changeset
1192 // memory state.
a61af66fc99e Initial load
duke
parents:
diff changeset
1193 Node *store_eden_top;
a61af66fc99e Initial load
duke
parents:
diff changeset
1194 Node *fast_oop_ctrl;
a61af66fc99e Initial load
duke
parents:
diff changeset
1195 if( UseTLAB ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1196 store_eden_top = new (C, 4) StorePNode( needgc_false, contended_phi_rawmem, eden_top_adr, TypeRawPtr::BOTTOM, new_eden_top );
a61af66fc99e Initial load
duke
parents:
diff changeset
1197 transform_later(store_eden_top);
a61af66fc99e Initial load
duke
parents:
diff changeset
1198 fast_oop_ctrl = needgc_false; // No contention, so this is the fast path
a61af66fc99e Initial load
duke
parents:
diff changeset
1199 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
1200 store_eden_top = new (C, 5) StorePConditionalNode( needgc_false, contended_phi_rawmem, eden_top_adr, new_eden_top, old_eden_top );
a61af66fc99e Initial load
duke
parents:
diff changeset
1201 transform_later(store_eden_top);
a61af66fc99e Initial load
duke
parents:
diff changeset
1202 Node *contention_check = new (C, 2) BoolNode( store_eden_top, BoolTest::ne );
a61af66fc99e Initial load
duke
parents:
diff changeset
1203 transform_later(contention_check);
a61af66fc99e Initial load
duke
parents:
diff changeset
1204 store_eden_top = new (C, 1) SCMemProjNode(store_eden_top);
a61af66fc99e Initial load
duke
parents:
diff changeset
1205 transform_later(store_eden_top);
a61af66fc99e Initial load
duke
parents:
diff changeset
1206
a61af66fc99e Initial load
duke
parents:
diff changeset
1207 // If not using TLABs, check to see if there was contention.
a61af66fc99e Initial load
duke
parents:
diff changeset
1208 IfNode *contention_iff = new (C, 2) IfNode ( needgc_false, contention_check, PROB_MIN, COUNT_UNKNOWN );
a61af66fc99e Initial load
duke
parents:
diff changeset
1209 transform_later(contention_iff);
a61af66fc99e Initial load
duke
parents:
diff changeset
1210 Node *contention_true = new (C, 1) IfTrueNode( contention_iff );
a61af66fc99e Initial load
duke
parents:
diff changeset
1211 transform_later(contention_true);
a61af66fc99e Initial load
duke
parents:
diff changeset
1212 // If contention, loopback and try again.
a61af66fc99e Initial load
duke
parents:
diff changeset
1213 contended_region->init_req( contended_loopback_path, contention_true );
a61af66fc99e Initial load
duke
parents:
diff changeset
1214 contended_phi_rawmem->init_req( contended_loopback_path, store_eden_top );
a61af66fc99e Initial load
duke
parents:
diff changeset
1215
a61af66fc99e Initial load
duke
parents:
diff changeset
1216 // Fast-path succeeded with no contention!
a61af66fc99e Initial load
duke
parents:
diff changeset
1217 Node *contention_false = new (C, 1) IfFalseNode( contention_iff );
a61af66fc99e Initial load
duke
parents:
diff changeset
1218 transform_later(contention_false);
a61af66fc99e Initial load
duke
parents:
diff changeset
1219 fast_oop_ctrl = contention_false;
a61af66fc99e Initial load
duke
parents:
diff changeset
1220 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1221
a61af66fc99e Initial load
duke
parents:
diff changeset
1222 // Rename successful fast-path variables to make meaning more obvious
a61af66fc99e Initial load
duke
parents:
diff changeset
1223 Node* fast_oop = old_eden_top;
a61af66fc99e Initial load
duke
parents:
diff changeset
1224 Node* fast_oop_rawmem = store_eden_top;
a61af66fc99e Initial load
duke
parents:
diff changeset
1225 fast_oop_rawmem = initialize_object(alloc,
a61af66fc99e Initial load
duke
parents:
diff changeset
1226 fast_oop_ctrl, fast_oop_rawmem, fast_oop,
a61af66fc99e Initial load
duke
parents:
diff changeset
1227 klass_node, length, size_in_bytes);
a61af66fc99e Initial load
duke
parents:
diff changeset
1228
780
c96bf21b756f 6788527: Server vm intermittently fails with assertion "live value must not be garbage" with fastdebug bits
kvn
parents: 708
diff changeset
1229 if (C->env()->dtrace_extended_probes()) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1230 // Slow-path call
a61af66fc99e Initial load
duke
parents:
diff changeset
1231 int size = TypeFunc::Parms + 2;
a61af66fc99e Initial load
duke
parents:
diff changeset
1232 CallLeafNode *call = new (C, size) CallLeafNode(OptoRuntime::dtrace_object_alloc_Type(),
a61af66fc99e Initial load
duke
parents:
diff changeset
1233 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_object_alloc_base),
a61af66fc99e Initial load
duke
parents:
diff changeset
1234 "dtrace_object_alloc",
a61af66fc99e Initial load
duke
parents:
diff changeset
1235 TypeRawPtr::BOTTOM);
a61af66fc99e Initial load
duke
parents:
diff changeset
1236
a61af66fc99e Initial load
duke
parents:
diff changeset
1237 // Get base of thread-local storage area
a61af66fc99e Initial load
duke
parents:
diff changeset
1238 Node* thread = new (C, 1) ThreadLocalNode();
a61af66fc99e Initial load
duke
parents:
diff changeset
1239 transform_later(thread);
a61af66fc99e Initial load
duke
parents:
diff changeset
1240
a61af66fc99e Initial load
duke
parents:
diff changeset
1241 call->init_req(TypeFunc::Parms+0, thread);
a61af66fc99e Initial load
duke
parents:
diff changeset
1242 call->init_req(TypeFunc::Parms+1, fast_oop);
a61af66fc99e Initial load
duke
parents:
diff changeset
1243 call->init_req( TypeFunc::Control, fast_oop_ctrl );
a61af66fc99e Initial load
duke
parents:
diff changeset
1244 call->init_req( TypeFunc::I_O , top() ) ; // does no i/o
a61af66fc99e Initial load
duke
parents:
diff changeset
1245 call->init_req( TypeFunc::Memory , fast_oop_rawmem );
a61af66fc99e Initial load
duke
parents:
diff changeset
1246 call->init_req( TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr) );
a61af66fc99e Initial load
duke
parents:
diff changeset
1247 call->init_req( TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr) );
a61af66fc99e Initial load
duke
parents:
diff changeset
1248 transform_later(call);
a61af66fc99e Initial load
duke
parents:
diff changeset
1249 fast_oop_ctrl = new (C, 1) ProjNode(call,TypeFunc::Control);
a61af66fc99e Initial load
duke
parents:
diff changeset
1250 transform_later(fast_oop_ctrl);
a61af66fc99e Initial load
duke
parents:
diff changeset
1251 fast_oop_rawmem = new (C, 1) ProjNode(call,TypeFunc::Memory);
a61af66fc99e Initial load
duke
parents:
diff changeset
1252 transform_later(fast_oop_rawmem);
a61af66fc99e Initial load
duke
parents:
diff changeset
1253 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1254
a61af66fc99e Initial load
duke
parents:
diff changeset
1255 // Plug in the successful fast-path into the result merge point
a61af66fc99e Initial load
duke
parents:
diff changeset
1256 result_region ->init_req( fast_result_path, fast_oop_ctrl );
a61af66fc99e Initial load
duke
parents:
diff changeset
1257 result_phi_rawoop->init_req( fast_result_path, fast_oop );
a61af66fc99e Initial load
duke
parents:
diff changeset
1258 result_phi_i_o ->init_req( fast_result_path, i_o );
a61af66fc99e Initial load
duke
parents:
diff changeset
1259 result_phi_rawmem->init_req( fast_result_path, fast_oop_rawmem );
a61af66fc99e Initial load
duke
parents:
diff changeset
1260 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
1261 slow_region = ctrl;
a61af66fc99e Initial load
duke
parents:
diff changeset
1262 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1263
a61af66fc99e Initial load
duke
parents:
diff changeset
1264 // Generate slow-path call
a61af66fc99e Initial load
duke
parents:
diff changeset
1265 CallNode *call = new (C, slow_call_type->domain()->cnt())
a61af66fc99e Initial load
duke
parents:
diff changeset
1266 CallStaticJavaNode(slow_call_type, slow_call_address,
a61af66fc99e Initial load
duke
parents:
diff changeset
1267 OptoRuntime::stub_name(slow_call_address),
a61af66fc99e Initial load
duke
parents:
diff changeset
1268 alloc->jvms()->bci(),
a61af66fc99e Initial load
duke
parents:
diff changeset
1269 TypePtr::BOTTOM);
a61af66fc99e Initial load
duke
parents:
diff changeset
1270 call->init_req( TypeFunc::Control, slow_region );
a61af66fc99e Initial load
duke
parents:
diff changeset
1271 call->init_req( TypeFunc::I_O , top() ) ; // does no i/o
a61af66fc99e Initial load
duke
parents:
diff changeset
1272 call->init_req( TypeFunc::Memory , slow_mem ); // may gc ptrs
a61af66fc99e Initial load
duke
parents:
diff changeset
1273 call->init_req( TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr) );
a61af66fc99e Initial load
duke
parents:
diff changeset
1274 call->init_req( TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr) );
a61af66fc99e Initial load
duke
parents:
diff changeset
1275
a61af66fc99e Initial load
duke
parents:
diff changeset
1276 call->init_req(TypeFunc::Parms+0, klass_node);
a61af66fc99e Initial load
duke
parents:
diff changeset
1277 if (length != NULL) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1278 call->init_req(TypeFunc::Parms+1, length);
a61af66fc99e Initial load
duke
parents:
diff changeset
1279 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1280
a61af66fc99e Initial load
duke
parents:
diff changeset
1281 // Copy debug information and adjust JVMState information, then replace
a61af66fc99e Initial load
duke
parents:
diff changeset
1282 // allocate node with the call
a61af66fc99e Initial load
duke
parents:
diff changeset
1283 copy_call_debug_info((CallNode *) alloc, call);
a61af66fc99e Initial load
duke
parents:
diff changeset
1284 if (!always_slow) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1285 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
a61af66fc99e Initial load
duke
parents:
diff changeset
1286 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1287 _igvn.hash_delete(alloc);
a61af66fc99e Initial load
duke
parents:
diff changeset
1288 _igvn.subsume_node(alloc, call);
a61af66fc99e Initial load
duke
parents:
diff changeset
1289 transform_later(call);
a61af66fc99e Initial load
duke
parents:
diff changeset
1290
a61af66fc99e Initial load
duke
parents:
diff changeset
1291 // Identify the output projections from the allocate node and
a61af66fc99e Initial load
duke
parents:
diff changeset
1292 // adjust any references to them.
a61af66fc99e Initial load
duke
parents:
diff changeset
1293 // The control and io projections look like:
a61af66fc99e Initial load
duke
parents:
diff changeset
1294 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1295 // v---Proj(ctrl) <-----+ v---CatchProj(ctrl)
a61af66fc99e Initial load
duke
parents:
diff changeset
1296 // Allocate Catch
a61af66fc99e Initial load
duke
parents:
diff changeset
1297 // ^---Proj(io) <-------+ ^---CatchProj(io)
a61af66fc99e Initial load
duke
parents:
diff changeset
1298 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1299 // We are interested in the CatchProj nodes.
a61af66fc99e Initial load
duke
parents:
diff changeset
1300 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1301 extract_call_projections(call);
a61af66fc99e Initial load
duke
parents:
diff changeset
1302
a61af66fc99e Initial load
duke
parents:
diff changeset
1303 // An allocate node has separate memory projections for the uses on the control and i_o paths
a61af66fc99e Initial load
duke
parents:
diff changeset
1304 // Replace uses of the control memory projection with result_phi_rawmem (unless we are only generating a slow call)
a61af66fc99e Initial load
duke
parents:
diff changeset
1305 if (!always_slow && _memproj_fallthrough != NULL) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1306 for (DUIterator_Fast imax, i = _memproj_fallthrough->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1307 Node *use = _memproj_fallthrough->fast_out(i);
a61af66fc99e Initial load
duke
parents:
diff changeset
1308 _igvn.hash_delete(use);
a61af66fc99e Initial load
duke
parents:
diff changeset
1309 imax -= replace_input(use, _memproj_fallthrough, result_phi_rawmem);
a61af66fc99e Initial load
duke
parents:
diff changeset
1310 _igvn._worklist.push(use);
a61af66fc99e Initial load
duke
parents:
diff changeset
1311 // back up iterator
a61af66fc99e Initial load
duke
parents:
diff changeset
1312 --i;
a61af66fc99e Initial load
duke
parents:
diff changeset
1313 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1314 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1315 // Now change uses of _memproj_catchall to use _memproj_fallthrough and delete _memproj_catchall so
a61af66fc99e Initial load
duke
parents:
diff changeset
1316 // we end up with a call that has only 1 memory projection
a61af66fc99e Initial load
duke
parents:
diff changeset
1317 if (_memproj_catchall != NULL ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1318 if (_memproj_fallthrough == NULL) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1319 _memproj_fallthrough = new (C, 1) ProjNode(call, TypeFunc::Memory);
a61af66fc99e Initial load
duke
parents:
diff changeset
1320 transform_later(_memproj_fallthrough);
a61af66fc99e Initial load
duke
parents:
diff changeset
1321 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1322 for (DUIterator_Fast imax, i = _memproj_catchall->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1323 Node *use = _memproj_catchall->fast_out(i);
a61af66fc99e Initial load
duke
parents:
diff changeset
1324 _igvn.hash_delete(use);
a61af66fc99e Initial load
duke
parents:
diff changeset
1325 imax -= replace_input(use, _memproj_catchall, _memproj_fallthrough);
a61af66fc99e Initial load
duke
parents:
diff changeset
1326 _igvn._worklist.push(use);
a61af66fc99e Initial load
duke
parents:
diff changeset
1327 // back up iterator
a61af66fc99e Initial load
duke
parents:
diff changeset
1328 --i;
a61af66fc99e Initial load
duke
parents:
diff changeset
1329 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1330 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1331
a61af66fc99e Initial load
duke
parents:
diff changeset
1332 // An allocate node has separate i_o projections for the uses on the control and i_o paths
a61af66fc99e Initial load
duke
parents:
diff changeset
1333 // Replace uses of the control i_o projection with result_phi_i_o (unless we are only generating a slow call)
a61af66fc99e Initial load
duke
parents:
diff changeset
1334 if (_ioproj_fallthrough == NULL) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1335 _ioproj_fallthrough = new (C, 1) ProjNode(call, TypeFunc::I_O);
a61af66fc99e Initial load
duke
parents:
diff changeset
1336 transform_later(_ioproj_fallthrough);
a61af66fc99e Initial load
duke
parents:
diff changeset
1337 } else if (!always_slow) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1338 for (DUIterator_Fast imax, i = _ioproj_fallthrough->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1339 Node *use = _ioproj_fallthrough->fast_out(i);
a61af66fc99e Initial load
duke
parents:
diff changeset
1340
a61af66fc99e Initial load
duke
parents:
diff changeset
1341 _igvn.hash_delete(use);
a61af66fc99e Initial load
duke
parents:
diff changeset
1342 imax -= replace_input(use, _ioproj_fallthrough, result_phi_i_o);
a61af66fc99e Initial load
duke
parents:
diff changeset
1343 _igvn._worklist.push(use);
a61af66fc99e Initial load
duke
parents:
diff changeset
1344 // back up iterator
a61af66fc99e Initial load
duke
parents:
diff changeset
1345 --i;
a61af66fc99e Initial load
duke
parents:
diff changeset
1346 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1347 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1348 // Now change uses of _ioproj_catchall to use _ioproj_fallthrough and delete _ioproj_catchall so
a61af66fc99e Initial load
duke
parents:
diff changeset
1349 // we end up with a call that has only 1 control projection
a61af66fc99e Initial load
duke
parents:
diff changeset
1350 if (_ioproj_catchall != NULL ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1351 for (DUIterator_Fast imax, i = _ioproj_catchall->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1352 Node *use = _ioproj_catchall->fast_out(i);
a61af66fc99e Initial load
duke
parents:
diff changeset
1353 _igvn.hash_delete(use);
a61af66fc99e Initial load
duke
parents:
diff changeset
1354 imax -= replace_input(use, _ioproj_catchall, _ioproj_fallthrough);
a61af66fc99e Initial load
duke
parents:
diff changeset
1355 _igvn._worklist.push(use);
a61af66fc99e Initial load
duke
parents:
diff changeset
1356 // back up iterator
a61af66fc99e Initial load
duke
parents:
diff changeset
1357 --i;
a61af66fc99e Initial load
duke
parents:
diff changeset
1358 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1359 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1360
a61af66fc99e Initial load
duke
parents:
diff changeset
1361 // if we generated only a slow call, we are done
a61af66fc99e Initial load
duke
parents:
diff changeset
1362 if (always_slow)
a61af66fc99e Initial load
duke
parents:
diff changeset
1363 return;
a61af66fc99e Initial load
duke
parents:
diff changeset
1364
a61af66fc99e Initial load
duke
parents:
diff changeset
1365
a61af66fc99e Initial load
duke
parents:
diff changeset
1366 if (_fallthroughcatchproj != NULL) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1367 ctrl = _fallthroughcatchproj->clone();
a61af66fc99e Initial load
duke
parents:
diff changeset
1368 transform_later(ctrl);
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1369 _igvn.replace_node(_fallthroughcatchproj, result_region);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1370 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
1371 ctrl = top();
a61af66fc99e Initial load
duke
parents:
diff changeset
1372 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1373 Node *slow_result;
a61af66fc99e Initial load
duke
parents:
diff changeset
1374 if (_resproj == NULL) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1375 // no uses of the allocation result
a61af66fc99e Initial load
duke
parents:
diff changeset
1376 slow_result = top();
a61af66fc99e Initial load
duke
parents:
diff changeset
1377 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
1378 slow_result = _resproj->clone();
a61af66fc99e Initial load
duke
parents:
diff changeset
1379 transform_later(slow_result);
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1380 _igvn.replace_node(_resproj, result_phi_rawoop);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1381 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1382
a61af66fc99e Initial load
duke
parents:
diff changeset
1383 // Plug slow-path into result merge point
a61af66fc99e Initial load
duke
parents:
diff changeset
1384 result_region ->init_req( slow_result_path, ctrl );
a61af66fc99e Initial load
duke
parents:
diff changeset
1385 result_phi_rawoop->init_req( slow_result_path, slow_result);
a61af66fc99e Initial load
duke
parents:
diff changeset
1386 result_phi_rawmem->init_req( slow_result_path, _memproj_fallthrough );
a61af66fc99e Initial load
duke
parents:
diff changeset
1387 transform_later(result_region);
a61af66fc99e Initial load
duke
parents:
diff changeset
1388 transform_later(result_phi_rawoop);
a61af66fc99e Initial load
duke
parents:
diff changeset
1389 transform_later(result_phi_rawmem);
a61af66fc99e Initial load
duke
parents:
diff changeset
1390 transform_later(result_phi_i_o);
a61af66fc99e Initial load
duke
parents:
diff changeset
1391 // This completes all paths into the result merge point
a61af66fc99e Initial load
duke
parents:
diff changeset
1392 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1393
a61af66fc99e Initial load
duke
parents:
diff changeset
1394
a61af66fc99e Initial load
duke
parents:
diff changeset
1395 // Helper for PhaseMacroExpand::expand_allocate_common.
a61af66fc99e Initial load
duke
parents:
diff changeset
1396 // Initializes the newly-allocated storage.
a61af66fc99e Initial load
duke
parents:
diff changeset
1397 Node*
a61af66fc99e Initial load
duke
parents:
diff changeset
1398 PhaseMacroExpand::initialize_object(AllocateNode* alloc,
a61af66fc99e Initial load
duke
parents:
diff changeset
1399 Node* control, Node* rawmem, Node* object,
a61af66fc99e Initial load
duke
parents:
diff changeset
1400 Node* klass_node, Node* length,
a61af66fc99e Initial load
duke
parents:
diff changeset
1401 Node* size_in_bytes) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1402 InitializeNode* init = alloc->initialization();
a61af66fc99e Initial load
duke
parents:
diff changeset
1403 // Store the klass & mark bits
a61af66fc99e Initial load
duke
parents:
diff changeset
1404 Node* mark_node = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
1405 // For now only enable fast locking for non-array types
a61af66fc99e Initial load
duke
parents:
diff changeset
1406 if (UseBiasedLocking && (length == NULL)) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1407 mark_node = make_load(NULL, rawmem, klass_node, Klass::prototype_header_offset_in_bytes() + sizeof(oopDesc), TypeRawPtr::BOTTOM, T_ADDRESS);
a61af66fc99e Initial load
duke
parents:
diff changeset
1408 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
1409 mark_node = makecon(TypeRawPtr::make((address)markOopDesc::prototype()));
a61af66fc99e Initial load
duke
parents:
diff changeset
1410 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1411 rawmem = make_store(control, rawmem, object, oopDesc::mark_offset_in_bytes(), mark_node, T_ADDRESS);
113
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 73
diff changeset
1412
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1413 rawmem = make_store(control, rawmem, object, oopDesc::klass_offset_in_bytes(), klass_node, T_OBJECT);
a61af66fc99e Initial load
duke
parents:
diff changeset
1414 int header_size = alloc->minimum_header_size(); // conservatively small
a61af66fc99e Initial load
duke
parents:
diff changeset
1415
a61af66fc99e Initial load
duke
parents:
diff changeset
1416 // Array length
a61af66fc99e Initial load
duke
parents:
diff changeset
1417 if (length != NULL) { // Arrays need length field
a61af66fc99e Initial load
duke
parents:
diff changeset
1418 rawmem = make_store(control, rawmem, object, arrayOopDesc::length_offset_in_bytes(), length, T_INT);
a61af66fc99e Initial load
duke
parents:
diff changeset
1419 // conservatively small header size:
113
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 73
diff changeset
1420 header_size = arrayOopDesc::base_offset_in_bytes(T_BYTE);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1421 ciKlass* k = _igvn.type(klass_node)->is_klassptr()->klass();
a61af66fc99e Initial load
duke
parents:
diff changeset
1422 if (k->is_array_klass()) // we know the exact header size in most cases:
a61af66fc99e Initial load
duke
parents:
diff changeset
1423 header_size = Klass::layout_helper_header_size(k->layout_helper());
a61af66fc99e Initial load
duke
parents:
diff changeset
1424 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1425
a61af66fc99e Initial load
duke
parents:
diff changeset
1426 // Clear the object body, if necessary.
a61af66fc99e Initial load
duke
parents:
diff changeset
1427 if (init == NULL) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1428 // The init has somehow disappeared; be cautious and clear everything.
a61af66fc99e Initial load
duke
parents:
diff changeset
1429 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1430 // This can happen if a node is allocated but an uncommon trap occurs
a61af66fc99e Initial load
duke
parents:
diff changeset
1431 // immediately. In this case, the Initialize gets associated with the
a61af66fc99e Initial load
duke
parents:
diff changeset
1432 // trap, and may be placed in a different (outer) loop, if the Allocate
a61af66fc99e Initial load
duke
parents:
diff changeset
1433 // is in a loop. If (this is rare) the inner loop gets unrolled, then
a61af66fc99e Initial load
duke
parents:
diff changeset
1434 // there can be two Allocates to one Initialize. The answer in all these
a61af66fc99e Initial load
duke
parents:
diff changeset
1435 // edge cases is safety first. It is always safe to clear immediately
a61af66fc99e Initial load
duke
parents:
diff changeset
1436 // within an Allocate, and then (maybe or maybe not) clear some more later.
a61af66fc99e Initial load
duke
parents:
diff changeset
1437 if (!ZeroTLAB)
a61af66fc99e Initial load
duke
parents:
diff changeset
1438 rawmem = ClearArrayNode::clear_memory(control, rawmem, object,
a61af66fc99e Initial load
duke
parents:
diff changeset
1439 header_size, size_in_bytes,
a61af66fc99e Initial load
duke
parents:
diff changeset
1440 &_igvn);
a61af66fc99e Initial load
duke
parents:
diff changeset
1441 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
1442 if (!init->is_complete()) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1443 // Try to win by zeroing only what the init does not store.
a61af66fc99e Initial load
duke
parents:
diff changeset
1444 // We can also try to do some peephole optimizations,
a61af66fc99e Initial load
duke
parents:
diff changeset
1445 // such as combining some adjacent subword stores.
a61af66fc99e Initial load
duke
parents:
diff changeset
1446 rawmem = init->complete_stores(control, rawmem, object,
a61af66fc99e Initial load
duke
parents:
diff changeset
1447 header_size, size_in_bytes, &_igvn);
a61af66fc99e Initial load
duke
parents:
diff changeset
1448 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1449 // We have no more use for this link, since the AllocateNode goes away:
a61af66fc99e Initial load
duke
parents:
diff changeset
1450 init->set_req(InitializeNode::RawAddress, top());
a61af66fc99e Initial load
duke
parents:
diff changeset
1451 // (If we keep the link, it just confuses the register allocator,
a61af66fc99e Initial load
duke
parents:
diff changeset
1452 // who thinks he sees a real use of the address by the membar.)
a61af66fc99e Initial load
duke
parents:
diff changeset
1453 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1454
a61af66fc99e Initial load
duke
parents:
diff changeset
1455 return rawmem;
a61af66fc99e Initial load
duke
parents:
diff changeset
1456 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1457
a61af66fc99e Initial load
duke
parents:
diff changeset
1458 // Generate prefetch instructions for next allocations.
a61af66fc99e Initial load
duke
parents:
diff changeset
1459 Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
a61af66fc99e Initial load
duke
parents:
diff changeset
1460 Node*& contended_phi_rawmem,
a61af66fc99e Initial load
duke
parents:
diff changeset
1461 Node* old_eden_top, Node* new_eden_top,
a61af66fc99e Initial load
duke
parents:
diff changeset
1462 Node* length) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1463 if( UseTLAB && AllocatePrefetchStyle == 2 ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1464 // Generate prefetch allocation with watermark check.
a61af66fc99e Initial load
duke
parents:
diff changeset
1465 // As an allocation hits the watermark, we will prefetch starting
a61af66fc99e Initial load
duke
parents:
diff changeset
1466 // at a "distance" away from watermark.
a61af66fc99e Initial load
duke
parents:
diff changeset
1467 enum { fall_in_path = 1, pf_path = 2 };
a61af66fc99e Initial load
duke
parents:
diff changeset
1468
a61af66fc99e Initial load
duke
parents:
diff changeset
1469 Node *pf_region = new (C, 3) RegionNode(3);
a61af66fc99e Initial load
duke
parents:
diff changeset
1470 Node *pf_phi_rawmem = new (C, 3) PhiNode( pf_region, Type::MEMORY,
a61af66fc99e Initial load
duke
parents:
diff changeset
1471 TypeRawPtr::BOTTOM );
a61af66fc99e Initial load
duke
parents:
diff changeset
1472 // I/O is used for Prefetch
a61af66fc99e Initial load
duke
parents:
diff changeset
1473 Node *pf_phi_abio = new (C, 3) PhiNode( pf_region, Type::ABIO );
a61af66fc99e Initial load
duke
parents:
diff changeset
1474
a61af66fc99e Initial load
duke
parents:
diff changeset
1475 Node *thread = new (C, 1) ThreadLocalNode();
a61af66fc99e Initial load
duke
parents:
diff changeset
1476 transform_later(thread);
a61af66fc99e Initial load
duke
parents:
diff changeset
1477
a61af66fc99e Initial load
duke
parents:
diff changeset
1478 Node *eden_pf_adr = new (C, 4) AddPNode( top()/*not oop*/, thread,
a61af66fc99e Initial load
duke
parents:
diff changeset
1479 _igvn.MakeConX(in_bytes(JavaThread::tlab_pf_top_offset())) );
a61af66fc99e Initial load
duke
parents:
diff changeset
1480 transform_later(eden_pf_adr);
a61af66fc99e Initial load
duke
parents:
diff changeset
1481
a61af66fc99e Initial load
duke
parents:
diff changeset
1482 Node *old_pf_wm = new (C, 3) LoadPNode( needgc_false,
a61af66fc99e Initial load
duke
parents:
diff changeset
1483 contended_phi_rawmem, eden_pf_adr,
a61af66fc99e Initial load
duke
parents:
diff changeset
1484 TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM );
a61af66fc99e Initial load
duke
parents:
diff changeset
1485 transform_later(old_pf_wm);
a61af66fc99e Initial load
duke
parents:
diff changeset
1486
a61af66fc99e Initial load
duke
parents:
diff changeset
1487 // check against new_eden_top
a61af66fc99e Initial load
duke
parents:
diff changeset
1488 Node *need_pf_cmp = new (C, 3) CmpPNode( new_eden_top, old_pf_wm );
a61af66fc99e Initial load
duke
parents:
diff changeset
1489 transform_later(need_pf_cmp);
a61af66fc99e Initial load
duke
parents:
diff changeset
1490 Node *need_pf_bol = new (C, 2) BoolNode( need_pf_cmp, BoolTest::ge );
a61af66fc99e Initial load
duke
parents:
diff changeset
1491 transform_later(need_pf_bol);
a61af66fc99e Initial load
duke
parents:
diff changeset
1492 IfNode *need_pf_iff = new (C, 2) IfNode( needgc_false, need_pf_bol,
a61af66fc99e Initial load
duke
parents:
diff changeset
1493 PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN );
a61af66fc99e Initial load
duke
parents:
diff changeset
1494 transform_later(need_pf_iff);
a61af66fc99e Initial load
duke
parents:
diff changeset
1495
a61af66fc99e Initial load
duke
parents:
diff changeset
1496 // true node, add prefetchdistance
a61af66fc99e Initial load
duke
parents:
diff changeset
1497 Node *need_pf_true = new (C, 1) IfTrueNode( need_pf_iff );
a61af66fc99e Initial load
duke
parents:
diff changeset
1498 transform_later(need_pf_true);
a61af66fc99e Initial load
duke
parents:
diff changeset
1499
a61af66fc99e Initial load
duke
parents:
diff changeset
1500 Node *need_pf_false = new (C, 1) IfFalseNode( need_pf_iff );
a61af66fc99e Initial load
duke
parents:
diff changeset
1501 transform_later(need_pf_false);
a61af66fc99e Initial load
duke
parents:
diff changeset
1502
a61af66fc99e Initial load
duke
parents:
diff changeset
1503 Node *new_pf_wmt = new (C, 4) AddPNode( top(), old_pf_wm,
a61af66fc99e Initial load
duke
parents:
diff changeset
1504 _igvn.MakeConX(AllocatePrefetchDistance) );
a61af66fc99e Initial load
duke
parents:
diff changeset
1505 transform_later(new_pf_wmt );
a61af66fc99e Initial load
duke
parents:
diff changeset
1506 new_pf_wmt->set_req(0, need_pf_true);
a61af66fc99e Initial load
duke
parents:
diff changeset
1507
a61af66fc99e Initial load
duke
parents:
diff changeset
1508 Node *store_new_wmt = new (C, 4) StorePNode( need_pf_true,
a61af66fc99e Initial load
duke
parents:
diff changeset
1509 contended_phi_rawmem, eden_pf_adr,
a61af66fc99e Initial load
duke
parents:
diff changeset
1510 TypeRawPtr::BOTTOM, new_pf_wmt );
a61af66fc99e Initial load
duke
parents:
diff changeset
1511 transform_later(store_new_wmt);
a61af66fc99e Initial load
duke
parents:
diff changeset
1512
a61af66fc99e Initial load
duke
parents:
diff changeset
1513 // adding prefetches
a61af66fc99e Initial load
duke
parents:
diff changeset
1514 pf_phi_abio->init_req( fall_in_path, i_o );
a61af66fc99e Initial load
duke
parents:
diff changeset
1515
a61af66fc99e Initial load
duke
parents:
diff changeset
1516 Node *prefetch_adr;
a61af66fc99e Initial load
duke
parents:
diff changeset
1517 Node *prefetch;
a61af66fc99e Initial load
duke
parents:
diff changeset
1518 uint lines = AllocatePrefetchDistance / AllocatePrefetchStepSize;
a61af66fc99e Initial load
duke
parents:
diff changeset
1519 uint step_size = AllocatePrefetchStepSize;
a61af66fc99e Initial load
duke
parents:
diff changeset
1520 uint distance = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
1521
a61af66fc99e Initial load
duke
parents:
diff changeset
1522 for ( uint i = 0; i < lines; i++ ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1523 prefetch_adr = new (C, 4) AddPNode( old_pf_wm, new_pf_wmt,
a61af66fc99e Initial load
duke
parents:
diff changeset
1524 _igvn.MakeConX(distance) );
a61af66fc99e Initial load
duke
parents:
diff changeset
1525 transform_later(prefetch_adr);
a61af66fc99e Initial load
duke
parents:
diff changeset
1526 prefetch = new (C, 3) PrefetchWriteNode( i_o, prefetch_adr );
a61af66fc99e Initial load
duke
parents:
diff changeset
1527 transform_later(prefetch);
a61af66fc99e Initial load
duke
parents:
diff changeset
1528 distance += step_size;
a61af66fc99e Initial load
duke
parents:
diff changeset
1529 i_o = prefetch;
a61af66fc99e Initial load
duke
parents:
diff changeset
1530 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1531 pf_phi_abio->set_req( pf_path, i_o );
a61af66fc99e Initial load
duke
parents:
diff changeset
1532
a61af66fc99e Initial load
duke
parents:
diff changeset
1533 pf_region->init_req( fall_in_path, need_pf_false );
a61af66fc99e Initial load
duke
parents:
diff changeset
1534 pf_region->init_req( pf_path, need_pf_true );
a61af66fc99e Initial load
duke
parents:
diff changeset
1535
a61af66fc99e Initial load
duke
parents:
diff changeset
1536 pf_phi_rawmem->init_req( fall_in_path, contended_phi_rawmem );
a61af66fc99e Initial load
duke
parents:
diff changeset
1537 pf_phi_rawmem->init_req( pf_path, store_new_wmt );
a61af66fc99e Initial load
duke
parents:
diff changeset
1538
a61af66fc99e Initial load
duke
parents:
diff changeset
1539 transform_later(pf_region);
a61af66fc99e Initial load
duke
parents:
diff changeset
1540 transform_later(pf_phi_rawmem);
a61af66fc99e Initial load
duke
parents:
diff changeset
1541 transform_later(pf_phi_abio);
a61af66fc99e Initial load
duke
parents:
diff changeset
1542
a61af66fc99e Initial load
duke
parents:
diff changeset
1543 needgc_false = pf_region;
a61af66fc99e Initial load
duke
parents:
diff changeset
1544 contended_phi_rawmem = pf_phi_rawmem;
a61af66fc99e Initial load
duke
parents:
diff changeset
1545 i_o = pf_phi_abio;
a61af66fc99e Initial load
duke
parents:
diff changeset
1546 } else if( AllocatePrefetchStyle > 0 ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1547 // Insert a prefetch for each allocation only on the fast-path
a61af66fc99e Initial load
duke
parents:
diff changeset
1548 Node *prefetch_adr;
a61af66fc99e Initial load
duke
parents:
diff changeset
1549 Node *prefetch;
a61af66fc99e Initial load
duke
parents:
diff changeset
1550 // Generate several prefetch instructions only for arrays.
a61af66fc99e Initial load
duke
parents:
diff changeset
1551 uint lines = (length != NULL) ? AllocatePrefetchLines : 1;
a61af66fc99e Initial load
duke
parents:
diff changeset
1552 uint step_size = AllocatePrefetchStepSize;
a61af66fc99e Initial load
duke
parents:
diff changeset
1553 uint distance = AllocatePrefetchDistance;
a61af66fc99e Initial load
duke
parents:
diff changeset
1554 for ( uint i = 0; i < lines; i++ ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1555 prefetch_adr = new (C, 4) AddPNode( old_eden_top, new_eden_top,
a61af66fc99e Initial load
duke
parents:
diff changeset
1556 _igvn.MakeConX(distance) );
a61af66fc99e Initial load
duke
parents:
diff changeset
1557 transform_later(prefetch_adr);
a61af66fc99e Initial load
duke
parents:
diff changeset
1558 prefetch = new (C, 3) PrefetchWriteNode( i_o, prefetch_adr );
a61af66fc99e Initial load
duke
parents:
diff changeset
1559 // Do not let it float too high, since if eden_top == eden_end,
a61af66fc99e Initial load
duke
parents:
diff changeset
1560 // both might be null.
a61af66fc99e Initial load
duke
parents:
diff changeset
1561 if( i == 0 ) { // Set control for first prefetch, next follows it
a61af66fc99e Initial load
duke
parents:
diff changeset
1562 prefetch->init_req(0, needgc_false);
a61af66fc99e Initial load
duke
parents:
diff changeset
1563 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1564 transform_later(prefetch);
a61af66fc99e Initial load
duke
parents:
diff changeset
1565 distance += step_size;
a61af66fc99e Initial load
duke
parents:
diff changeset
1566 i_o = prefetch;
a61af66fc99e Initial load
duke
parents:
diff changeset
1567 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1568 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1569 return i_o;
a61af66fc99e Initial load
duke
parents:
diff changeset
1570 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1571
a61af66fc99e Initial load
duke
parents:
diff changeset
1572
a61af66fc99e Initial load
duke
parents:
diff changeset
1573 void PhaseMacroExpand::expand_allocate(AllocateNode *alloc) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1574 expand_allocate_common(alloc, NULL,
a61af66fc99e Initial load
duke
parents:
diff changeset
1575 OptoRuntime::new_instance_Type(),
a61af66fc99e Initial load
duke
parents:
diff changeset
1576 OptoRuntime::new_instance_Java());
a61af66fc99e Initial load
duke
parents:
diff changeset
1577 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1578
a61af66fc99e Initial load
duke
parents:
diff changeset
1579 void PhaseMacroExpand::expand_allocate_array(AllocateArrayNode *alloc) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1580 Node* length = alloc->in(AllocateNode::ALength);
a61af66fc99e Initial load
duke
parents:
diff changeset
1581 expand_allocate_common(alloc, length,
a61af66fc99e Initial load
duke
parents:
diff changeset
1582 OptoRuntime::new_array_Type(),
a61af66fc99e Initial load
duke
parents:
diff changeset
1583 OptoRuntime::new_array_Java());
a61af66fc99e Initial load
duke
parents:
diff changeset
1584 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1585
a61af66fc99e Initial load
duke
parents:
diff changeset
1586
a61af66fc99e Initial load
duke
parents:
diff changeset
1587 // we have determined that this lock/unlock can be eliminated, we simply
a61af66fc99e Initial load
duke
parents:
diff changeset
1588 // eliminate the node without expanding it.
a61af66fc99e Initial load
duke
parents:
diff changeset
1589 //
a61af66fc99e Initial load
duke
parents:
diff changeset
1590 // Note: The membar's associated with the lock/unlock are currently not
a61af66fc99e Initial load
duke
parents:
diff changeset
1591 // eliminated. This should be investigated as a future enhancement.
a61af66fc99e Initial load
duke
parents:
diff changeset
1592 //
66
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1593 bool PhaseMacroExpand::eliminate_locking_node(AbstractLockNode *alock) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1594
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1595 if (!alock->is_eliminated()) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1596 return false;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1597 }
460
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1598 if (alock->is_Lock() && !alock->is_coarsened()) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1599 // Create new "eliminated" BoxLock node and use it
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1600 // in monitor debug info for the same object.
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1601 BoxLockNode* oldbox = alock->box_node()->as_BoxLock();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1602 Node* obj = alock->obj_node();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1603 if (!oldbox->is_eliminated()) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1604 BoxLockNode* newbox = oldbox->clone()->as_BoxLock();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1605 newbox->set_eliminated();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1606 transform_later(newbox);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1607 // Replace old box node with new box for all users
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1608 // of the same object.
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1609 for (uint i = 0; i < oldbox->outcnt();) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1610
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1611 bool next_edge = true;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1612 Node* u = oldbox->raw_out(i);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1613 if (u == alock) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1614 i++;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1615 continue; // It will be removed below
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1616 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1617 if (u->is_Lock() &&
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1618 u->as_Lock()->obj_node() == obj &&
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1619 // oldbox could be referenced in debug info also
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1620 u->as_Lock()->box_node() == oldbox) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1621 assert(u->as_Lock()->is_eliminated(), "sanity");
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1622 _igvn.hash_delete(u);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1623 u->set_req(TypeFunc::Parms + 1, newbox);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1624 next_edge = false;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1625 #ifdef ASSERT
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1626 } else if (u->is_Unlock() && u->as_Unlock()->obj_node() == obj) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1627 assert(u->as_Unlock()->is_eliminated(), "sanity");
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1628 #endif
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1629 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1630 // Replace old box in monitor debug info.
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1631 if (u->is_SafePoint() && u->as_SafePoint()->jvms()) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1632 SafePointNode* sfn = u->as_SafePoint();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1633 JVMState* youngest_jvms = sfn->jvms();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1634 int max_depth = youngest_jvms->depth();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1635 for (int depth = 1; depth <= max_depth; depth++) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1636 JVMState* jvms = youngest_jvms->of_depth(depth);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1637 int num_mon = jvms->nof_monitors();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1638 // Loop over monitors
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1639 for (int idx = 0; idx < num_mon; idx++) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1640 Node* obj_node = sfn->monitor_obj(jvms, idx);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1641 Node* box_node = sfn->monitor_box(jvms, idx);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1642 if (box_node == oldbox && obj_node == obj) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1643 int j = jvms->monitor_box_offset(idx);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1644 _igvn.hash_delete(u);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1645 u->set_req(j, newbox);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1646 next_edge = false;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1647 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1648 } // for (int idx = 0;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1649 } // for (int depth = 1;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1650 } // if (u->is_SafePoint()
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1651 if (next_edge) i++;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1652 } // for (uint i = 0; i < oldbox->outcnt();)
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1653 } // if (!oldbox->is_eliminated())
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1654 } // if (alock->is_Lock() && !lock->is_coarsened())
66
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1655
1080
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1656 CompileLog* log = C->log();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1657 if (log != NULL) {
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1658 log->head("eliminate_lock lock='%d'",
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1659 alock->is_Lock());
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1660 JVMState* p = alock->jvms();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1661 while (p != NULL) {
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1662 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1663 p = p->caller();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1664 }
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1665 log->tail("eliminate_lock");
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1666 }
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 851
diff changeset
1667
66
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1668 #ifndef PRODUCT
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1669 if (PrintEliminateLocks) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1670 if (alock->is_Lock()) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1671 tty->print_cr("++++ Eliminating: %d Lock", alock->_idx);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1672 } else {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1673 tty->print_cr("++++ Eliminating: %d Unlock", alock->_idx);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1674 }
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1675 }
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1676 #endif
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1677
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1678 Node* mem = alock->in(TypeFunc::Memory);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1679 Node* ctrl = alock->in(TypeFunc::Control);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1680
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1681 extract_call_projections(alock);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1682 // There are 2 projections from the lock. The lock node will
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1683 // be deleted when its last use is subsumed below.
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1684 assert(alock->outcnt() == 2 &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1685 _fallthroughproj != NULL &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1686 _memproj_fallthrough != NULL,
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1687 "Unexpected projections from Lock/Unlock");
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1688
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1689 Node* fallthroughproj = _fallthroughproj;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1690 Node* memproj_fallthrough = _memproj_fallthrough;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1691
a61af66fc99e Initial load
duke
parents:
diff changeset
1692 // The memory projection from a lock/unlock is RawMem
a61af66fc99e Initial load
duke
parents:
diff changeset
1693 // The input to a Lock is merged memory, so extract its RawMem input
a61af66fc99e Initial load
duke
parents:
diff changeset
1694 // (unless the MergeMem has been optimized away.)
a61af66fc99e Initial load
duke
parents:
diff changeset
1695 if (alock->is_Lock()) {
66
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1696 // Seach for MemBarAcquire node and delete it also.
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1697 MemBarNode* membar = fallthroughproj->unique_ctrl_out()->as_MemBar();
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1698 assert(membar != NULL && membar->Opcode() == Op_MemBarAcquire, "");
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1699 Node* ctrlproj = membar->proj_out(TypeFunc::Control);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1700 Node* memproj = membar->proj_out(TypeFunc::Memory);
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1701 _igvn.replace_node(ctrlproj, fallthroughproj);
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1702 _igvn.replace_node(memproj, memproj_fallthrough);
460
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1703
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1704 // Delete FastLock node also if this Lock node is unique user
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1705 // (a loop peeling may clone a Lock node).
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1706 Node* flock = alock->as_Lock()->fastlock_node();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1707 if (flock->outcnt() == 1) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1708 assert(flock->unique_out() == alock, "sanity");
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1709 _igvn.replace_node(flock, top());
460
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
1710 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1711 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1712
66
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1713 // Seach for MemBarRelease node and delete it also.
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1714 if (alock->is_Unlock() && ctrl != NULL && ctrl->is_Proj() &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1715 ctrl->in(0)->is_MemBar()) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1716 MemBarNode* membar = ctrl->in(0)->as_MemBar();
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1717 assert(membar->Opcode() == Op_MemBarRelease &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1718 mem->is_Proj() && membar == mem->in(0), "");
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1719 _igvn.replace_node(fallthroughproj, ctrl);
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1720 _igvn.replace_node(memproj_fallthrough, mem);
66
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1721 fallthroughproj = ctrl;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1722 memproj_fallthrough = mem;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1723 ctrl = membar->in(TypeFunc::Control);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1724 mem = membar->in(TypeFunc::Memory);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1725 }
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1726
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1727 _igvn.replace_node(fallthroughproj, ctrl);
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1728 _igvn.replace_node(memproj_fallthrough, mem);
66
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1729 return true;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1730 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1731
a61af66fc99e Initial load
duke
parents:
diff changeset
1732
a61af66fc99e Initial load
duke
parents:
diff changeset
1733 //------------------------------expand_lock_node----------------------
a61af66fc99e Initial load
duke
parents:
diff changeset
1734 void PhaseMacroExpand::expand_lock_node(LockNode *lock) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1735
a61af66fc99e Initial load
duke
parents:
diff changeset
1736 Node* ctrl = lock->in(TypeFunc::Control);
a61af66fc99e Initial load
duke
parents:
diff changeset
1737 Node* mem = lock->in(TypeFunc::Memory);
a61af66fc99e Initial load
duke
parents:
diff changeset
1738 Node* obj = lock->obj_node();
a61af66fc99e Initial load
duke
parents:
diff changeset
1739 Node* box = lock->box_node();
66
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1740 Node* flock = lock->fastlock_node();
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1741
a61af66fc99e Initial load
duke
parents:
diff changeset
1742 // Make the merge point
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1743 Node *region;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1744 Node *mem_phi;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1745 Node *slow_path;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1746
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1747 if (UseOptoBiasInlining) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1748 /*
605
98cb887364d3 6810672: Comment typos
twisti
parents: 601
diff changeset
1749 * See the full description in MacroAssembler::biased_locking_enter().
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1750 *
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1751 * if( (mark_word & biased_lock_mask) == biased_lock_pattern ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1752 * // The object is biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1753 * proto_node = klass->prototype_header;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1754 * o_node = thread | proto_node;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1755 * x_node = o_node ^ mark_word;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1756 * if( (x_node & ~age_mask) == 0 ) { // Biased to the current thread ?
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1757 * // Done.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1758 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1759 * if( (x_node & biased_lock_mask) != 0 ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1760 * // The klass's prototype header is no longer biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1761 * cas(&mark_word, mark_word, proto_node)
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1762 * goto cas_lock;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1763 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1764 * // The klass's prototype header is still biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1765 * if( (x_node & epoch_mask) != 0 ) { // Expired epoch?
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1766 * old = mark_word;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1767 * new = o_node;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1768 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1769 * // Different thread or anonymous biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1770 * old = mark_word & (epoch_mask | age_mask | biased_lock_mask);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1771 * new = thread | old;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1772 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1773 * // Try to rebias.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1774 * if( cas(&mark_word, old, new) == 0 ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1775 * // Done.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1776 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1777 * goto slow_path; // Failed.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1778 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1779 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1780 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1781 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1782 * // The object is not biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1783 * cas_lock:
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1784 * if( FastLock(obj) == 0 ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1785 * // Done.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1786 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1787 * slow_path:
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1788 * OptoRuntime::complete_monitor_locking_Java(obj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1789 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1790 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1791 */
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1792
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1793 region = new (C, 5) RegionNode(5);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1794 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1795 mem_phi = new (C, 5) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1796
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1797 Node* fast_lock_region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1798 Node* fast_lock_mem_phi = new (C, 3) PhiNode( fast_lock_region, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1799
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1800 // First, check mark word for the biased lock pattern.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1801 Node* mark_node = make_load(ctrl, mem, obj, oopDesc::mark_offset_in_bytes(), TypeX_X, TypeX_X->basic_type());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1802
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1803 // Get fast path - mark word has the biased lock pattern.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1804 ctrl = opt_bits_test(ctrl, fast_lock_region, 1, mark_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1805 markOopDesc::biased_lock_mask_in_place,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1806 markOopDesc::biased_lock_pattern, true);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1807 // fast_lock_region->in(1) is set to slow path.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1808 fast_lock_mem_phi->init_req(1, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1809
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1810 // Now check that the lock is biased to the current thread and has
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1811 // the same epoch and bias as Klass::_prototype_header.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1812
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1813 // Special-case a fresh allocation to avoid building nodes:
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1814 Node* klass_node = AllocateNode::Ideal_klass(obj, &_igvn);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1815 if (klass_node == NULL) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1816 Node* k_adr = basic_plus_adr(obj, oopDesc::klass_offset_in_bytes());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1817 klass_node = transform_later( LoadKlassNode::make(_igvn, mem, k_adr, _igvn.type(k_adr)->is_ptr()) );
490
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code"
kvn
parents: 460
diff changeset
1818 #ifdef _LP64
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code"
kvn
parents: 460
diff changeset
1819 if (UseCompressedOops && klass_node->is_DecodeN()) {
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code"
kvn
parents: 460
diff changeset
1820 assert(klass_node->in(1)->Opcode() == Op_LoadNKlass, "sanity");
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code"
kvn
parents: 460
diff changeset
1821 klass_node->in(1)->init_req(0, ctrl);
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code"
kvn
parents: 460
diff changeset
1822 } else
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code"
kvn
parents: 460
diff changeset
1823 #endif
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code"
kvn
parents: 460
diff changeset
1824 klass_node->init_req(0, ctrl);
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1825 }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1826 Node *proto_node = make_load(ctrl, mem, klass_node, Klass::prototype_header_offset_in_bytes() + sizeof(oopDesc), TypeX_X, TypeX_X->basic_type());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1827
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1828 Node* thread = transform_later(new (C, 1) ThreadLocalNode());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1829 Node* cast_thread = transform_later(new (C, 2) CastP2XNode(ctrl, thread));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1830 Node* o_node = transform_later(new (C, 3) OrXNode(cast_thread, proto_node));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1831 Node* x_node = transform_later(new (C, 3) XorXNode(o_node, mark_node));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1832
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1833 // Get slow path - mark word does NOT match the value.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1834 Node* not_biased_ctrl = opt_bits_test(ctrl, region, 3, x_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1835 (~markOopDesc::age_mask_in_place), 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1836 // region->in(3) is set to fast path - the object is biased to the current thread.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1837 mem_phi->init_req(3, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1838
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1839
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1840 // Mark word does NOT match the value (thread | Klass::_prototype_header).
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1841
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1842
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1843 // First, check biased pattern.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1844 // Get fast path - _prototype_header has the same biased lock pattern.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1845 ctrl = opt_bits_test(not_biased_ctrl, fast_lock_region, 2, x_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1846 markOopDesc::biased_lock_mask_in_place, 0, true);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1847
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1848 not_biased_ctrl = fast_lock_region->in(2); // Slow path
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1849 // fast_lock_region->in(2) - the prototype header is no longer biased
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1850 // and we have to revoke the bias on this object.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1851 // We are going to try to reset the mark of this object to the prototype
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1852 // value and fall through to the CAS-based locking scheme.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1853 Node* adr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1854 Node* cas = new (C, 5) StoreXConditionalNode(not_biased_ctrl, mem, adr,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1855 proto_node, mark_node);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1856 transform_later(cas);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1857 Node* proj = transform_later( new (C, 1) SCMemProjNode(cas));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1858 fast_lock_mem_phi->init_req(2, proj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1859
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1860
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1861 // Second, check epoch bits.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1862 Node* rebiased_region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1863 Node* old_phi = new (C, 3) PhiNode( rebiased_region, TypeX_X);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1864 Node* new_phi = new (C, 3) PhiNode( rebiased_region, TypeX_X);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1865
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1866 // Get slow path - mark word does NOT match epoch bits.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1867 Node* epoch_ctrl = opt_bits_test(ctrl, rebiased_region, 1, x_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1868 markOopDesc::epoch_mask_in_place, 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1869 // The epoch of the current bias is not valid, attempt to rebias the object
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1870 // toward the current thread.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1871 rebiased_region->init_req(2, epoch_ctrl);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1872 old_phi->init_req(2, mark_node);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1873 new_phi->init_req(2, o_node);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1874
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1875 // rebiased_region->in(1) is set to fast path.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1876 // The epoch of the current bias is still valid but we know
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1877 // nothing about the owner; it might be set or it might be clear.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1878 Node* cmask = MakeConX(markOopDesc::biased_lock_mask_in_place |
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1879 markOopDesc::age_mask_in_place |
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1880 markOopDesc::epoch_mask_in_place);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1881 Node* old = transform_later(new (C, 3) AndXNode(mark_node, cmask));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1882 cast_thread = transform_later(new (C, 2) CastP2XNode(ctrl, thread));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1883 Node* new_mark = transform_later(new (C, 3) OrXNode(cast_thread, old));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1884 old_phi->init_req(1, old);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1885 new_phi->init_req(1, new_mark);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1886
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1887 transform_later(rebiased_region);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1888 transform_later(old_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1889 transform_later(new_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1890
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1891 // Try to acquire the bias of the object using an atomic operation.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1892 // If this fails we will go in to the runtime to revoke the object's bias.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1893 cas = new (C, 5) StoreXConditionalNode(rebiased_region, mem, adr,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1894 new_phi, old_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1895 transform_later(cas);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1896 proj = transform_later( new (C, 1) SCMemProjNode(cas));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1897
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1898 // Get slow path - Failed to CAS.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1899 not_biased_ctrl = opt_bits_test(rebiased_region, region, 4, cas, 0, 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1900 mem_phi->init_req(4, proj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1901 // region->in(4) is set to fast path - the object is rebiased to the current thread.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1902
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1903 // Failed to CAS.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1904 slow_path = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1905 Node *slow_mem = new (C, 3) PhiNode( slow_path, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1906
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1907 slow_path->init_req(1, not_biased_ctrl); // Capture slow-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1908 slow_mem->init_req(1, proj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1909
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1910 // Call CAS-based locking scheme (FastLock node).
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1911
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1912 transform_later(fast_lock_region);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1913 transform_later(fast_lock_mem_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1914
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1915 // Get slow path - FastLock failed to lock the object.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1916 ctrl = opt_bits_test(fast_lock_region, region, 2, flock, 0, 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1917 mem_phi->init_req(2, fast_lock_mem_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1918 // region->in(2) is set to fast path - the object is locked to the current thread.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1919
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1920 slow_path->init_req(2, ctrl); // Capture slow-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1921 slow_mem->init_req(2, fast_lock_mem_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1922
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1923 transform_later(slow_path);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1924 transform_later(slow_mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1925 // Reset lock's memory edge.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1926 lock->set_req(TypeFunc::Memory, slow_mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1927
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1928 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1929 region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1930 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1931 mem_phi = new (C, 3) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1932
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1933 // Optimize test; set region slot 2
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1934 slow_path = opt_bits_test(ctrl, region, 2, flock, 0, 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1935 mem_phi->init_req(2, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1936 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1937
a61af66fc99e Initial load
duke
parents:
diff changeset
1938 // Make slow path call
a61af66fc99e Initial load
duke
parents:
diff changeset
1939 CallNode *call = make_slow_call( (CallNode *) lock, OptoRuntime::complete_monitor_enter_Type(), OptoRuntime::complete_monitor_locking_Java(), NULL, slow_path, obj, box );
a61af66fc99e Initial load
duke
parents:
diff changeset
1940
a61af66fc99e Initial load
duke
parents:
diff changeset
1941 extract_call_projections(call);
a61af66fc99e Initial load
duke
parents:
diff changeset
1942
a61af66fc99e Initial load
duke
parents:
diff changeset
1943 // Slow path can only throw asynchronous exceptions, which are always
a61af66fc99e Initial load
duke
parents:
diff changeset
1944 // de-opted. So the compiler thinks the slow-call can never throw an
a61af66fc99e Initial load
duke
parents:
diff changeset
1945 // exception. If it DOES throw an exception we would need the debug
a61af66fc99e Initial load
duke
parents:
diff changeset
1946 // info removed first (since if it throws there is no monitor).
a61af66fc99e Initial load
duke
parents:
diff changeset
1947 assert ( _ioproj_fallthrough == NULL && _ioproj_catchall == NULL &&
a61af66fc99e Initial load
duke
parents:
diff changeset
1948 _memproj_catchall == NULL && _catchallcatchproj == NULL, "Unexpected projection from Lock");
a61af66fc99e Initial load
duke
parents:
diff changeset
1949
a61af66fc99e Initial load
duke
parents:
diff changeset
1950 // Capture slow path
a61af66fc99e Initial load
duke
parents:
diff changeset
1951 // disconnect fall-through projection from call and create a new one
a61af66fc99e Initial load
duke
parents:
diff changeset
1952 // hook up users of fall-through projection to region
a61af66fc99e Initial load
duke
parents:
diff changeset
1953 Node *slow_ctrl = _fallthroughproj->clone();
a61af66fc99e Initial load
duke
parents:
diff changeset
1954 transform_later(slow_ctrl);
a61af66fc99e Initial load
duke
parents:
diff changeset
1955 _igvn.hash_delete(_fallthroughproj);
a61af66fc99e Initial load
duke
parents:
diff changeset
1956 _fallthroughproj->disconnect_inputs(NULL);
a61af66fc99e Initial load
duke
parents:
diff changeset
1957 region->init_req(1, slow_ctrl);
a61af66fc99e Initial load
duke
parents:
diff changeset
1958 // region inputs are now complete
a61af66fc99e Initial load
duke
parents:
diff changeset
1959 transform_later(region);
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1960 _igvn.replace_node(_fallthroughproj, region);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1961
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1962 Node *memproj = transform_later( new(C, 1) ProjNode(call, TypeFunc::Memory) );
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1963 mem_phi->init_req(1, memproj );
a61af66fc99e Initial load
duke
parents:
diff changeset
1964 transform_later(mem_phi);
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
1965 _igvn.replace_node(_memproj_fallthrough, mem_phi);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1966 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1967
a61af66fc99e Initial load
duke
parents:
diff changeset
1968 //------------------------------expand_unlock_node----------------------
a61af66fc99e Initial load
duke
parents:
diff changeset
1969 void PhaseMacroExpand::expand_unlock_node(UnlockNode *unlock) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1970
66
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 63
diff changeset
1971 Node* ctrl = unlock->in(TypeFunc::Control);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1972 Node* mem = unlock->in(TypeFunc::Memory);
a61af66fc99e Initial load
duke
parents:
diff changeset
1973 Node* obj = unlock->obj_node();
a61af66fc99e Initial load
duke
parents:
diff changeset
1974 Node* box = unlock->box_node();
a61af66fc99e Initial load
duke
parents:
diff changeset
1975
a61af66fc99e Initial load
duke
parents:
diff changeset
1976 // No need for a null check on unlock
a61af66fc99e Initial load
duke
parents:
diff changeset
1977
a61af66fc99e Initial load
duke
parents:
diff changeset
1978 // Make the merge point
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1979 Node *region;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1980 Node *mem_phi;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1981
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1982 if (UseOptoBiasInlining) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1983 // Check for biased locking unlock case, which is a no-op.
605
98cb887364d3 6810672: Comment typos
twisti
parents: 601
diff changeset
1984 // See the full description in MacroAssembler::biased_locking_exit().
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1985 region = new (C, 4) RegionNode(4);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1986 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1987 mem_phi = new (C, 4) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1988 mem_phi->init_req(3, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1989
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1990 Node* mark_node = make_load(ctrl, mem, obj, oopDesc::mark_offset_in_bytes(), TypeX_X, TypeX_X->basic_type());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1991 ctrl = opt_bits_test(ctrl, region, 3, mark_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1992 markOopDesc::biased_lock_mask_in_place,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1993 markOopDesc::biased_lock_pattern);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1994 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1995 region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1996 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1997 mem_phi = new (C, 3) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
1998 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1999
a61af66fc99e Initial load
duke
parents:
diff changeset
2000 FastUnlockNode *funlock = new (C, 3) FastUnlockNode( ctrl, obj, box );
a61af66fc99e Initial load
duke
parents:
diff changeset
2001 funlock = transform_later( funlock )->as_FastUnlock();
a61af66fc99e Initial load
duke
parents:
diff changeset
2002 // Optimize test; set region slot 2
420
a1980da045cc 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 362
diff changeset
2003 Node *slow_path = opt_bits_test(ctrl, region, 2, funlock, 0, 0);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
2004
a61af66fc99e Initial load
duke
parents:
diff changeset
2005 CallNode *call = make_slow_call( (CallNode *) unlock, OptoRuntime::complete_monitor_exit_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::complete_monitor_unlocking_C), "complete_monitor_unlocking_C", slow_path, obj, box );
a61af66fc99e Initial load
duke
parents:
diff changeset
2006
a61af66fc99e Initial load
duke
parents:
diff changeset
2007 extract_call_projections(call);
a61af66fc99e Initial load
duke
parents:
diff changeset
2008
a61af66fc99e Initial load
duke
parents:
diff changeset
2009 assert ( _ioproj_fallthrough == NULL && _ioproj_catchall == NULL &&
a61af66fc99e Initial load
duke
parents:
diff changeset
2010 _memproj_catchall == NULL && _catchallcatchproj == NULL, "Unexpected projection from Lock");
a61af66fc99e Initial load
duke
parents:
diff changeset
2011
a61af66fc99e Initial load
duke
parents:
diff changeset
2012 // No exceptions for unlocking
a61af66fc99e Initial load
duke
parents:
diff changeset
2013 // Capture slow path
a61af66fc99e Initial load
duke
parents:
diff changeset
2014 // disconnect fall-through projection from call and create a new one
a61af66fc99e Initial load
duke
parents:
diff changeset
2015 // hook up users of fall-through projection to region
a61af66fc99e Initial load
duke
parents:
diff changeset
2016 Node *slow_ctrl = _fallthroughproj->clone();
a61af66fc99e Initial load
duke
parents:
diff changeset
2017 transform_later(slow_ctrl);
a61af66fc99e Initial load
duke
parents:
diff changeset
2018 _igvn.hash_delete(_fallthroughproj);
a61af66fc99e Initial load
duke
parents:
diff changeset
2019 _fallthroughproj->disconnect_inputs(NULL);
a61af66fc99e Initial load
duke
parents:
diff changeset
2020 region->init_req(1, slow_ctrl);
a61af66fc99e Initial load
duke
parents:
diff changeset
2021 // region inputs are now complete
a61af66fc99e Initial load
duke
parents:
diff changeset
2022 transform_later(region);
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
2023 _igvn.replace_node(_fallthroughproj, region);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
2024
a61af66fc99e Initial load
duke
parents:
diff changeset
2025 Node *memproj = transform_later( new(C, 1) ProjNode(call, TypeFunc::Memory) );
a61af66fc99e Initial load
duke
parents:
diff changeset
2026 mem_phi->init_req(1, memproj );
a61af66fc99e Initial load
duke
parents:
diff changeset
2027 mem_phi->init_req(2, mem);
a61af66fc99e Initial load
duke
parents:
diff changeset
2028 transform_later(mem_phi);
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
2029 _igvn.replace_node(_memproj_fallthrough, mem_phi);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
2030 }
a61af66fc99e Initial load
duke
parents:
diff changeset
2031
a61af66fc99e Initial load
duke
parents:
diff changeset
2032 //------------------------------expand_macro_nodes----------------------
a61af66fc99e Initial load
duke
parents:
diff changeset
2033 // Returns true if a failure occurred.
a61af66fc99e Initial load
duke
parents:
diff changeset
2034 bool PhaseMacroExpand::expand_macro_nodes() {
a61af66fc99e Initial load
duke
parents:
diff changeset
2035 if (C->macro_count() == 0)
a61af66fc99e Initial load
duke
parents:
diff changeset
2036 return false;
460
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2037 // First, attempt to eliminate locks
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2038 bool progress = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2039 while (progress) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2040 progress = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2041 for (int i = C->macro_count(); i > 0; i--) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2042 Node * n = C->macro_node(i-1);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2043 bool success = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2044 debug_only(int old_macro_count = C->macro_count(););
460
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2045 if (n->is_AbstractLock()) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2046 success = eliminate_locking_node(n->as_AbstractLock());
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2047 } else if (n->Opcode() == Op_Opaque1 || n->Opcode() == Op_Opaque2) {
708
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr")
kvn
parents: 628
diff changeset
2048 _igvn.replace_node(n, n->in(1));
460
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2049 success = true;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2050 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2051 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count");
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2052 progress = progress || success;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2053 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2054 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2055 // Next, attempt to eliminate allocations
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2056 progress = true;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2057 while (progress) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2058 progress = false;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2059 for (int i = C->macro_count(); i > 0; i--) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2060 Node * n = C->macro_node(i-1);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2061 bool success = false;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2062 debug_only(int old_macro_count = C->macro_count(););
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2063 switch (n->class_id()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2064 case Node::Class_Allocate:
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2065 case Node::Class_AllocateArray:
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2066 success = eliminate_allocate_node(n->as_Allocate());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2067 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2068 case Node::Class_Lock:
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2069 case Node::Class_Unlock:
460
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2070 assert(!n->as_AbstractLock()->is_eliminated(), "sanity");
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2071 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2072 default:
460
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents: 436
diff changeset
2073 assert(false, "unknown node type in macro list");
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2074 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2075 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2076 progress = progress || success;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2077 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2078 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2079 // Make sure expansion will not cause node limit to be exceeded.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2080 // Worst case is a macro node gets expanded into about 50 nodes.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2081 // Allow 50% more for optimization.
0
a61af66fc99e Initial load
duke
parents:
diff changeset
2082 if (C->check_node_count(C->macro_count() * 75, "out of nodes before macro expansion" ) )
a61af66fc99e Initial load
duke
parents:
diff changeset
2083 return true;
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2084
0
a61af66fc99e Initial load
duke
parents:
diff changeset
2085 // expand "macro" nodes
a61af66fc99e Initial load
duke
parents:
diff changeset
2086 // nodes are removed from the macro list as they are processed
a61af66fc99e Initial load
duke
parents:
diff changeset
2087 while (C->macro_count() > 0) {
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2088 int macro_count = C->macro_count();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2089 Node * n = C->macro_node(macro_count-1);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
2090 assert(n->is_macro(), "only macro nodes expected here");
a61af66fc99e Initial load
duke
parents:
diff changeset
2091 if (_igvn.type(n) == Type::TOP || n->in(0)->is_top() ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
2092 // node is unreachable, so don't try to expand it
a61af66fc99e Initial load
duke
parents:
diff changeset
2093 C->remove_macro_node(n);
a61af66fc99e Initial load
duke
parents:
diff changeset
2094 continue;
a61af66fc99e Initial load
duke
parents:
diff changeset
2095 }
a61af66fc99e Initial load
duke
parents:
diff changeset
2096 switch (n->class_id()) {
a61af66fc99e Initial load
duke
parents:
diff changeset
2097 case Node::Class_Allocate:
a61af66fc99e Initial load
duke
parents:
diff changeset
2098 expand_allocate(n->as_Allocate());
a61af66fc99e Initial load
duke
parents:
diff changeset
2099 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
2100 case Node::Class_AllocateArray:
a61af66fc99e Initial load
duke
parents:
diff changeset
2101 expand_allocate_array(n->as_AllocateArray());
a61af66fc99e Initial load
duke
parents:
diff changeset
2102 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
2103 case Node::Class_Lock:
a61af66fc99e Initial load
duke
parents:
diff changeset
2104 expand_lock_node(n->as_Lock());
a61af66fc99e Initial load
duke
parents:
diff changeset
2105 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
2106 case Node::Class_Unlock:
a61af66fc99e Initial load
duke
parents:
diff changeset
2107 expand_unlock_node(n->as_Unlock());
a61af66fc99e Initial load
duke
parents:
diff changeset
2108 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
2109 default:
a61af66fc99e Initial load
duke
parents:
diff changeset
2110 assert(false, "unknown node type in macro list");
a61af66fc99e Initial load
duke
parents:
diff changeset
2111 }
73
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents: 66
diff changeset
2112 assert(C->macro_count() < macro_count, "must have deleted a node from macro list");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
2113 if (C->failing()) return true;
a61af66fc99e Initial load
duke
parents:
diff changeset
2114 }
113
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 73
diff changeset
2115
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 73
diff changeset
2116 _igvn.set_delay_transform(false);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
2117 _igvn.optimize();
a61af66fc99e Initial load
duke
parents:
diff changeset
2118 return false;
a61af66fc99e Initial load
duke
parents:
diff changeset
2119 }