5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "compiler/compileLog.hpp"
26 #include "gc/shared/collectedHeap.inline.hpp"
27 #include "gc/shared/tlab_globals.hpp"
28 #include "libadt/vectset.hpp"
29 #include "memory/universe.hpp"
30 #include "opto/addnode.hpp"
31 #include "opto/arraycopynode.hpp"
32 #include "opto/callnode.hpp"
33 #include "opto/castnode.hpp"
34 #include "opto/cfgnode.hpp"
35 #include "opto/compile.hpp"
36 #include "opto/convertnode.hpp"
37 #include "opto/graphKit.hpp"
38 #include "opto/intrinsicnode.hpp"
39 #include "opto/locknode.hpp"
40 #include "opto/loopnode.hpp"
41 #include "opto/macro.hpp"
42 #include "opto/memnode.hpp"
43 #include "opto/narrowptrnode.hpp"
44 #include "opto/node.hpp"
45 #include "opto/opaquenode.hpp"
46 #include "opto/phaseX.hpp"
47 #include "opto/rootnode.hpp"
48 #include "opto/runtime.hpp"
49 #include "opto/subnode.hpp"
50 #include "opto/subtypenode.hpp"
51 #include "opto/type.hpp"
52 #include "prims/jvmtiExport.hpp"
53 #include "runtime/continuation.hpp"
54 #include "runtime/sharedRuntime.hpp"
55 #include "utilities/macros.hpp"
56 #include "utilities/powerOfTwo.hpp"
57 #if INCLUDE_G1GC
58 #include "gc/g1/g1ThreadLocalData.hpp"
59 #endif // INCLUDE_G1GC
60
61
62 //
63 // Replace any references to "oldref" in inputs to "use" with "newref".
64 // Returns the number of replacements made.
65 //
66 int PhaseMacroExpand::replace_input(Node *use, Node *oldref, Node *newref) {
67 int nreplacements = 0;
68 uint req = use->req();
69 for (uint j = 0; j < use->len(); j++) {
70 Node *uin = use->in(j);
71 if (uin == oldref) {
72 if (j < req)
73 use->set_req(j, newref);
74 else
75 use->set_prec(j, newref);
76 nreplacements++;
77 } else if (j >= req && uin == nullptr) {
78 break;
79 }
80 }
81 return nreplacements;
82 }
83
84 void PhaseMacroExpand::migrate_outs(Node *old, Node *target) {
85 assert(old != nullptr, "sanity");
86 for (DUIterator_Fast imax, i = old->fast_outs(imax); i < imax; i++) {
87 Node* use = old->fast_out(i);
88 _igvn.rehash_node_delayed(use);
89 imax -= replace_input(use, old, target);
90 // back up iterator
91 --i;
92 }
93 assert(old->outcnt() == 0, "all uses must be deleted");
94 }
95
96 Node* PhaseMacroExpand::opt_bits_test(Node* ctrl, Node* region, int edge, Node* word) {
97 Node* cmp = word;
98 Node* bol = transform_later(new BoolNode(cmp, BoolTest::ne));
99 IfNode* iff = new IfNode( ctrl, bol, PROB_MIN, COUNT_UNKNOWN );
100 transform_later(iff);
101
102 // Fast path taken.
103 Node *fast_taken = transform_later(new IfFalseNode(iff));
104
105 // Fast path not-taken, i.e. slow path
106 Node *slow_taken = transform_later(new IfTrueNode(iff));
107
108 region->init_req(edge, fast_taken); // Capture fast-control
109 return slow_taken;
110 }
111
112 //--------------------copy_predefined_input_for_runtime_call--------------------
113 void PhaseMacroExpand::copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call) {
114 // Set fixed predefined input arguments
127 // Slow-path call
128 CallNode *call = leaf_name
129 ? (CallNode*)new CallLeafNode ( slow_call_type, slow_call, leaf_name, TypeRawPtr::BOTTOM )
130 : (CallNode*)new CallStaticJavaNode( slow_call_type, slow_call, OptoRuntime::stub_name(slow_call), TypeRawPtr::BOTTOM );
131
132 // Slow path call has no side-effects, uses few values
133 copy_predefined_input_for_runtime_call(slow_path, oldcall, call );
134 if (parm0 != nullptr) call->init_req(TypeFunc::Parms+0, parm0);
135 if (parm1 != nullptr) call->init_req(TypeFunc::Parms+1, parm1);
136 if (parm2 != nullptr) call->init_req(TypeFunc::Parms+2, parm2);
137 call->copy_call_debug_info(&_igvn, oldcall);
138 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
139 _igvn.replace_node(oldcall, call);
140 transform_later(call);
141
142 return call;
143 }
144
145 void PhaseMacroExpand::eliminate_gc_barrier(Node* p2x) {
146 BarrierSetC2 *bs = BarrierSet::barrier_set()->barrier_set_c2();
147 bs->eliminate_gc_barrier(this, p2x);
148 #ifndef PRODUCT
149 if (PrintOptoStatistics) {
150 AtomicAccess::inc(&PhaseMacroExpand::_GC_barriers_removed_counter);
151 }
152 #endif
153 }
154
155 // Search for a memory operation for the specified memory slice.
156 static Node *scan_mem_chain(Node *mem, int alias_idx, int offset, Node *start_mem, Node *alloc, PhaseGVN *phase) {
157 Node *orig_mem = mem;
158 Node *alloc_mem = alloc->as_Allocate()->proj_out_or_null(TypeFunc::Memory, /*io_use:*/false);
159 assert(alloc_mem != nullptr, "Allocation without a memory projection.");
160 const TypeOopPtr *tinst = phase->C->get_adr_type(alias_idx)->isa_oopptr();
161 while (true) {
162 if (mem == alloc_mem || mem == start_mem ) {
163 return mem; // hit one of our sentinels
164 } else if (mem->is_MergeMem()) {
165 mem = mem->as_MergeMem()->memory_at(alias_idx);
166 } else if (mem->is_Proj() && mem->as_Proj()->_con == TypeFunc::Memory) {
167 Node *in = mem->in(0);
170 if (in->is_Initialize() && in->as_Initialize()->allocation() == alloc) {
171 return in;
172 } else if (in->is_Call()) {
173 CallNode *call = in->as_Call();
174 if (call->may_modify(tinst, phase)) {
175 assert(call->is_ArrayCopy(), "ArrayCopy is the only call node that doesn't make allocation escape");
176 if (call->as_ArrayCopy()->modifies(offset, offset, phase, false)) {
177 return in;
178 }
179 }
180 mem = in->in(TypeFunc::Memory);
181 } else if (in->is_MemBar()) {
182 ArrayCopyNode* ac = nullptr;
183 if (ArrayCopyNode::may_modify(tinst, in->as_MemBar(), phase, ac)) {
184 if (ac != nullptr) {
185 assert(ac->is_clonebasic(), "Only basic clone is a non escaping clone");
186 return ac;
187 }
188 }
189 mem = in->in(TypeFunc::Memory);
190 } else {
191 #ifdef ASSERT
192 in->dump();
193 mem->dump();
194 assert(false, "unexpected projection");
195 #endif
196 }
197 } else if (mem->is_Store()) {
198 const TypePtr* atype = mem->as_Store()->adr_type();
199 int adr_idx = phase->C->get_alias_index(atype);
200 if (adr_idx == alias_idx) {
201 assert(atype->isa_oopptr(), "address type must be oopptr");
202 int adr_offset = atype->offset();
203 uint adr_iid = atype->is_oopptr()->instance_id();
204 // Array elements references have the same alias_idx
205 // but different offset and different instance_id.
206 if (adr_offset == offset && adr_iid == alloc->_idx) {
207 return mem;
208 }
209 } else {
210 assert(adr_idx == Compile::AliasIdxRaw, "address must match or be raw");
211 }
212 mem = mem->in(MemNode::Memory);
213 } else if (mem->is_ClearArray()) {
214 if (!ClearArrayNode::step_through(&mem, alloc->_idx, phase)) {
215 // Can not bypass initialization of the instance
216 // we are looking.
217 DEBUG_ONLY(intptr_t offset;)
218 assert(alloc == AllocateNode::Ideal_allocation(mem->in(3), phase, offset), "sanity");
219 InitializeNode* init = alloc->as_Allocate()->initialization();
220 // We are looking for stored value, return Initialize node
221 // or memory edge from Allocate node.
222 if (init != nullptr) {
227 }
228 // Otherwise skip it (the call updated 'mem' value).
229 } else if (mem->Opcode() == Op_SCMemProj) {
230 mem = mem->in(0);
231 Node* adr = nullptr;
232 if (mem->is_LoadStore()) {
233 adr = mem->in(MemNode::Address);
234 } else {
235 assert(mem->Opcode() == Op_EncodeISOArray ||
236 mem->Opcode() == Op_StrCompressedCopy, "sanity");
237 adr = mem->in(3); // Destination array
238 }
239 const TypePtr* atype = adr->bottom_type()->is_ptr();
240 int adr_idx = phase->C->get_alias_index(atype);
241 if (adr_idx == alias_idx) {
242 DEBUG_ONLY(mem->dump();)
243 assert(false, "Object is not scalar replaceable if a LoadStore node accesses its field");
244 return nullptr;
245 }
246 mem = mem->in(MemNode::Memory);
247 } else if (mem->Opcode() == Op_StrInflatedCopy) {
248 Node* adr = mem->in(3); // Destination array
249 const TypePtr* atype = adr->bottom_type()->is_ptr();
250 int adr_idx = phase->C->get_alias_index(atype);
251 if (adr_idx == alias_idx) {
252 DEBUG_ONLY(mem->dump();)
253 assert(false, "Object is not scalar replaceable if a StrInflatedCopy node accesses its field");
254 return nullptr;
255 }
256 mem = mem->in(MemNode::Memory);
257 } else {
258 return mem;
259 }
260 assert(mem != orig_mem, "dead memory loop");
261 }
262 }
263
264 // Generate loads from source of the arraycopy for fields of
265 // destination needed at a deoptimization point
266 Node* PhaseMacroExpand::make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, Node* mem, BasicType ft, const Type *ftype, AllocateNode *alloc) {
267 BasicType bt = ft;
272 }
273 Node* res = nullptr;
274 if (ac->is_clonebasic()) {
275 assert(ac->in(ArrayCopyNode::Src) != ac->in(ArrayCopyNode::Dest), "clone source equals destination");
276 Node* base = ac->in(ArrayCopyNode::Src);
277 Node* adr = _igvn.transform(new AddPNode(base, base, _igvn.MakeConX(offset)));
278 const TypePtr* adr_type = _igvn.type(base)->is_ptr()->add_offset(offset);
279 MergeMemNode* mergemen = _igvn.transform(MergeMemNode::make(mem))->as_MergeMem();
280 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
281 res = ArrayCopyNode::load(bs, &_igvn, ctl, mergemen, adr, adr_type, type, bt);
282 } else {
283 if (ac->modifies(offset, offset, &_igvn, true)) {
284 assert(ac->in(ArrayCopyNode::Dest) == alloc->result_cast(), "arraycopy destination should be allocation's result");
285 uint shift = exact_log2(type2aelembytes(bt));
286 Node* src_pos = ac->in(ArrayCopyNode::SrcPos);
287 Node* dest_pos = ac->in(ArrayCopyNode::DestPos);
288 const TypeInt* src_pos_t = _igvn.type(src_pos)->is_int();
289 const TypeInt* dest_pos_t = _igvn.type(dest_pos)->is_int();
290
291 Node* adr = nullptr;
292 const TypePtr* adr_type = nullptr;
293 if (src_pos_t->is_con() && dest_pos_t->is_con()) {
294 intptr_t off = ((src_pos_t->get_con() - dest_pos_t->get_con()) << shift) + offset;
295 Node* base = ac->in(ArrayCopyNode::Src);
296 adr = _igvn.transform(new AddPNode(base, base, _igvn.MakeConX(off)));
297 adr_type = _igvn.type(base)->is_ptr()->add_offset(off);
298 if (ac->in(ArrayCopyNode::Src) == ac->in(ArrayCopyNode::Dest)) {
299 // Don't emit a new load from src if src == dst but try to get the value from memory instead
300 return value_from_mem(ac->in(TypeFunc::Memory), ctl, ft, ftype, adr_type->isa_oopptr(), alloc);
301 }
302 } else {
303 Node* diff = _igvn.transform(new SubINode(ac->in(ArrayCopyNode::SrcPos), ac->in(ArrayCopyNode::DestPos)));
304 #ifdef _LP64
305 diff = _igvn.transform(new ConvI2LNode(diff));
306 #endif
307 diff = _igvn.transform(new LShiftXNode(diff, _igvn.intcon(shift)));
308
309 Node* off = _igvn.transform(new AddXNode(_igvn.MakeConX(offset), diff));
310 Node* base = ac->in(ArrayCopyNode::Src);
311 adr = _igvn.transform(new AddPNode(base, base, off));
312 adr_type = _igvn.type(base)->is_ptr()->add_offset(Type::OffsetBot);
313 if (ac->in(ArrayCopyNode::Src) == ac->in(ArrayCopyNode::Dest)) {
314 // Non constant offset in the array: we can't statically
315 // determine the value
316 return nullptr;
317 }
318 }
319 MergeMemNode* mergemen = _igvn.transform(MergeMemNode::make(mem))->as_MergeMem();
320 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
321 res = ArrayCopyNode::load(bs, &_igvn, ctl, mergemen, adr, adr_type, type, bt);
322 }
323 }
324 if (res != nullptr) {
325 if (ftype->isa_narrowoop()) {
326 // PhaseMacroExpand::scalar_replacement adds DecodeN nodes
327 res = _igvn.transform(new EncodePNode(res, ftype));
328 }
329 return res;
330 }
331 return nullptr;
332 }
333
334 //
335 // Given a Memory Phi, compute a value Phi containing the values from stores
336 // on the input paths.
337 // Note: this function is recursive, its depth is limited by the "level" argument
338 // Returns the computed Phi, or null if it cannot compute it.
339 Node *PhaseMacroExpand::value_from_mem_phi(Node *mem, BasicType ft, const Type *phi_type, const TypeOopPtr *adr_t, AllocateNode *alloc, Node_Stack *value_phis, int level) {
340 assert(mem->is_Phi(), "sanity");
341 int alias_idx = C->get_alias_index(adr_t);
342 int offset = adr_t->offset();
343 int instance_id = adr_t->instance_id();
344
345 // Check if an appropriate value phi already exists.
346 Node* region = mem->in(0);
347 for (DUIterator_Fast kmax, k = region->fast_outs(kmax); k < kmax; k++) {
348 Node* phi = region->fast_out(k);
349 if (phi->is_Phi() && phi != mem &&
350 phi->as_Phi()->is_same_inst_field(phi_type, (int)mem->_idx, instance_id, alias_idx, offset)) {
351 return phi;
352 }
353 }
354 // Check if an appropriate new value phi already exists.
355 Node* new_phi = value_phis->find(mem->_idx);
356 if (new_phi != nullptr)
357 return new_phi;
358
359 if (level <= 0) {
360 return nullptr; // Give up: phi tree too deep
361 }
362 Node *start_mem = C->start()->proj_out_or_null(TypeFunc::Memory);
363 Node *alloc_mem = alloc->proj_out_or_null(TypeFunc::Memory, /*io_use:*/false);
364 assert(alloc_mem != nullptr, "Allocation without a memory projection.");
365
366 uint length = mem->req();
367 GrowableArray <Node *> values(length, length, nullptr);
368
369 // create a new Phi for the value
370 PhiNode *phi = new PhiNode(mem->in(0), phi_type, nullptr, mem->_idx, instance_id, alias_idx, offset);
371 transform_later(phi);
372 value_phis->push(phi, mem->_idx);
373
374 for (uint j = 1; j < length; j++) {
375 Node *in = mem->in(j);
376 if (in == nullptr || in->is_top()) {
377 values.at_put(j, in);
378 } else {
379 Node *val = scan_mem_chain(in, alias_idx, offset, start_mem, alloc, &_igvn);
380 if (val == start_mem || val == alloc_mem) {
381 // hit a sentinel, return appropriate 0 value
382 values.at_put(j, _igvn.zerocon(ft));
383 continue;
384 }
385 if (val->is_Initialize()) {
386 val = val->as_Initialize()->find_captured_store(offset, type2aelembytes(ft), &_igvn);
387 }
388 if (val == nullptr) {
389 return nullptr; // can't find a value on this path
390 }
391 if (val == mem) {
392 values.at_put(j, mem);
393 } else if (val->is_Store()) {
394 Node* n = val->in(MemNode::ValueIn);
395 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
396 n = bs->step_over_gc_barrier(n);
397 if (is_subword_type(ft)) {
398 n = Compile::narrow_value(ft, n, phi_type, &_igvn, true);
399 }
400 values.at_put(j, n);
401 } else if(val->is_Proj() && val->in(0) == alloc) {
402 values.at_put(j, _igvn.zerocon(ft));
403 } else if (val->is_Phi()) {
404 val = value_from_mem_phi(val, ft, phi_type, adr_t, alloc, value_phis, level-1);
405 if (val == nullptr) {
406 return nullptr;
407 }
408 values.at_put(j, val);
409 } else if (val->Opcode() == Op_SCMemProj) {
410 assert(val->in(0)->is_LoadStore() ||
411 val->in(0)->Opcode() == Op_EncodeISOArray ||
412 val->in(0)->Opcode() == Op_StrCompressedCopy, "sanity");
413 assert(false, "Object is not scalar replaceable if a LoadStore node accesses its field");
414 return nullptr;
415 } else if (val->is_ArrayCopy()) {
416 Node* res = make_arraycopy_load(val->as_ArrayCopy(), offset, val->in(0), val->in(TypeFunc::Memory), ft, phi_type, alloc);
417 if (res == nullptr) {
418 return nullptr;
419 }
420 values.at_put(j, res);
421 } else if (val->is_top()) {
422 // This indicates that this path into the phi is dead. Top will eventually also propagate into the Region.
423 // IGVN will clean this up later.
424 values.at_put(j, val);
425 } else {
426 DEBUG_ONLY( val->dump(); )
427 assert(false, "unknown node on this path");
428 return nullptr; // unknown node on this path
429 }
430 }
431 }
432 // Set Phi's inputs
433 for (uint j = 1; j < length; j++) {
434 if (values.at(j) == mem) {
435 phi->init_req(j, phi);
436 } else {
437 phi->init_req(j, values.at(j));
438 }
439 }
440 return phi;
441 }
442
443 // Search the last value stored into the object's field.
444 Node *PhaseMacroExpand::value_from_mem(Node *sfpt_mem, Node *sfpt_ctl, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc) {
445 assert(adr_t->is_known_instance_field(), "instance required");
446 int instance_id = adr_t->instance_id();
447 assert((uint)instance_id == alloc->_idx, "wrong allocation");
448
449 int alias_idx = C->get_alias_index(adr_t);
450 int offset = adr_t->offset();
451 Node *start_mem = C->start()->proj_out_or_null(TypeFunc::Memory);
452 Node *alloc_ctrl = alloc->in(TypeFunc::Control);
453 Node *alloc_mem = alloc->proj_out_or_null(TypeFunc::Memory, /*io_use:*/false);
454 assert(alloc_mem != nullptr, "Allocation without a memory projection.");
455 VectorSet visited;
456
457 bool done = sfpt_mem == alloc_mem;
458 Node *mem = sfpt_mem;
459 while (!done) {
460 if (visited.test_set(mem->_idx)) {
461 return nullptr; // found a loop, give up
462 }
463 mem = scan_mem_chain(mem, alias_idx, offset, start_mem, alloc, &_igvn);
464 if (mem == start_mem || mem == alloc_mem) {
465 done = true; // hit a sentinel, return appropriate 0 value
466 } else if (mem->is_Initialize()) {
467 mem = mem->as_Initialize()->find_captured_store(offset, type2aelembytes(ft), &_igvn);
468 if (mem == nullptr) {
469 done = true; // Something go wrong.
470 } else if (mem->is_Store()) {
471 const TypePtr* atype = mem->as_Store()->adr_type();
472 assert(C->get_alias_index(atype) == Compile::AliasIdxRaw, "store is correct memory slice");
473 done = true;
474 }
475 } else if (mem->is_Store()) {
476 const TypeOopPtr* atype = mem->as_Store()->adr_type()->isa_oopptr();
477 assert(atype != nullptr, "address type must be oopptr");
478 assert(C->get_alias_index(atype) == alias_idx &&
479 atype->is_known_instance_field() && atype->offset() == offset &&
480 atype->instance_id() == instance_id, "store is correct memory slice");
481 done = true;
482 } else if (mem->is_Phi()) {
483 // try to find a phi's unique input
484 Node *unique_input = nullptr;
485 Node *top = C->top();
486 for (uint i = 1; i < mem->req(); i++) {
487 Node *n = scan_mem_chain(mem->in(i), alias_idx, offset, start_mem, alloc, &_igvn);
488 if (n == nullptr || n == top || n == mem) {
489 continue;
490 } else if (unique_input == nullptr) {
491 unique_input = n;
492 } else if (unique_input != n) {
493 unique_input = top;
494 break;
495 }
496 }
497 if (unique_input != nullptr && unique_input != top) {
498 mem = unique_input;
499 } else {
500 done = true;
501 }
502 } else if (mem->is_ArrayCopy()) {
503 done = true;
504 } else if (mem->is_top()) {
505 // The slice is on a dead path. Returning nullptr would lead to elimination
506 // bailout, but we want to prevent that. Just forwarding the top is also legal,
507 // and IGVN can just clean things up, and remove whatever receives top.
508 return mem;
509 } else {
510 DEBUG_ONLY( mem->dump(); )
511 assert(false, "unexpected node");
512 }
513 }
514 if (mem != nullptr) {
515 if (mem == start_mem || mem == alloc_mem) {
516 // hit a sentinel, return appropriate 0 value
517 return _igvn.zerocon(ft);
518 } else if (mem->is_Store()) {
519 Node* n = mem->in(MemNode::ValueIn);
520 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
521 n = bs->step_over_gc_barrier(n);
522 return n;
523 } else if (mem->is_Phi()) {
524 // attempt to produce a Phi reflecting the values on the input paths of the Phi
525 Node_Stack value_phis(8);
526 Node* phi = value_from_mem_phi(mem, ft, ftype, adr_t, alloc, &value_phis, ValueSearchLimit);
527 if (phi != nullptr) {
528 return phi;
529 } else {
530 // Kill all new Phis
531 while(value_phis.is_nonempty()) {
532 Node* n = value_phis.node();
533 _igvn.replace_node(n, C->top());
534 value_phis.pop();
535 }
536 }
537 } else if (mem->is_ArrayCopy()) {
538 Node* ctl = mem->in(0);
539 Node* m = mem->in(TypeFunc::Memory);
540 if (sfpt_ctl->is_Proj() && sfpt_ctl->as_Proj()->is_uncommon_trap_proj()) {
541 // pin the loads in the uncommon trap path
542 ctl = sfpt_ctl;
543 m = sfpt_mem;
544 }
545 return make_arraycopy_load(mem->as_ArrayCopy(), offset, ctl, m, ft, ftype, alloc);
546 }
547 }
548 // Something go wrong.
549 return nullptr;
550 }
551
552 // Check the possibility of scalar replacement.
553 bool PhaseMacroExpand::can_eliminate_allocation(PhaseIterGVN* igvn, AllocateNode *alloc, GrowableArray <SafePointNode *>* safepoints) {
554 // Scan the uses of the allocation to check for anything that would
555 // prevent us from eliminating it.
556 NOT_PRODUCT( const char* fail_eliminate = nullptr; )
557 DEBUG_ONLY( Node* disq_node = nullptr; )
558 bool can_eliminate = true;
559 bool reduce_merge_precheck = (safepoints == nullptr);
560
561 Node* res = alloc->result_cast();
562 const TypeOopPtr* res_type = nullptr;
563 if (res == nullptr) {
564 // All users were eliminated.
565 } else if (!res->is_CheckCastPP()) {
566 NOT_PRODUCT(fail_eliminate = "Allocation does not have unique CheckCastPP";)
567 can_eliminate = false;
568 } else {
569 res_type = igvn->type(res)->isa_oopptr();
570 if (res_type == nullptr) {
571 NOT_PRODUCT(fail_eliminate = "Neither instance or array allocation";)
572 can_eliminate = false;
573 } else if (!res_type->klass_is_exact()) {
574 NOT_PRODUCT(fail_eliminate = "Not an exact type.";)
575 can_eliminate = false;
576 } else if (res_type->isa_aryptr()) {
577 int length = alloc->in(AllocateNode::ALength)->find_int_con(-1);
578 if (length < 0) {
579 NOT_PRODUCT(fail_eliminate = "Array's size is not constant";)
580 can_eliminate = false;
581 }
582 }
583 }
584
585 if (can_eliminate && res != nullptr) {
586 BarrierSetC2 *bs = BarrierSet::barrier_set()->barrier_set_c2();
587 for (DUIterator_Fast jmax, j = res->fast_outs(jmax);
588 j < jmax && can_eliminate; j++) {
589 Node* use = res->fast_out(j);
590
591 if (use->is_AddP()) {
592 const TypePtr* addp_type = igvn->type(use)->is_ptr();
593 int offset = addp_type->offset();
594
595 if (offset == Type::OffsetTop || offset == Type::OffsetBot) {
596 NOT_PRODUCT(fail_eliminate = "Undefined field reference";)
597 can_eliminate = false;
598 break;
599 }
600 for (DUIterator_Fast kmax, k = use->fast_outs(kmax);
601 k < kmax && can_eliminate; k++) {
602 Node* n = use->fast_out(k);
603 if (n->is_Mem() && n->as_Mem()->is_mismatched_access()) {
604 DEBUG_ONLY(disq_node = n);
605 NOT_PRODUCT(fail_eliminate = "Mismatched access");
606 can_eliminate = false;
607 }
608 if (!n->is_Store() && n->Opcode() != Op_CastP2X && !bs->is_gc_pre_barrier_node(n) && !reduce_merge_precheck) {
609 DEBUG_ONLY(disq_node = n;)
610 if (n->is_Load() || n->is_LoadStore()) {
611 NOT_PRODUCT(fail_eliminate = "Field load";)
612 } else {
613 NOT_PRODUCT(fail_eliminate = "Not store field reference";)
614 }
615 can_eliminate = false;
616 }
617 }
618 } else if (use->is_ArrayCopy() &&
619 (use->as_ArrayCopy()->is_clonebasic() ||
620 use->as_ArrayCopy()->is_arraycopy_validated() ||
621 use->as_ArrayCopy()->is_copyof_validated() ||
622 use->as_ArrayCopy()->is_copyofrange_validated()) &&
623 use->in(ArrayCopyNode::Dest) == res) {
624 // ok to eliminate
625 } else if (use->is_SafePoint()) {
626 SafePointNode* sfpt = use->as_SafePoint();
627 if (sfpt->is_Call() && sfpt->as_Call()->has_non_debug_use(res)) {
628 // Object is passed as argument.
629 DEBUG_ONLY(disq_node = use;)
630 NOT_PRODUCT(fail_eliminate = "Object is passed as argument";)
631 can_eliminate = false;
632 }
633 Node* sfptMem = sfpt->memory();
634 if (sfptMem == nullptr || sfptMem->is_top()) {
635 DEBUG_ONLY(disq_node = use;)
636 NOT_PRODUCT(fail_eliminate = "null or TOP memory";)
637 can_eliminate = false;
638 } else if (!reduce_merge_precheck) {
639 safepoints->append_if_missing(sfpt);
640 }
641 } else if (reduce_merge_precheck &&
642 (use->is_Phi() || use->is_EncodeP() ||
643 use->Opcode() == Op_MemBarRelease ||
644 (UseStoreStoreForCtor && use->Opcode() == Op_MemBarStoreStore))) {
645 // Nothing to do
646 } else if (use->Opcode() != Op_CastP2X) { // CastP2X is used by card mark
647 if (use->is_Phi()) {
648 if (use->outcnt() == 1 && use->unique_out()->Opcode() == Op_Return) {
649 NOT_PRODUCT(fail_eliminate = "Object is return value";)
650 } else {
651 NOT_PRODUCT(fail_eliminate = "Object is referenced by Phi";)
652 }
653 DEBUG_ONLY(disq_node = use;)
654 } else {
655 if (use->Opcode() == Op_Return) {
656 NOT_PRODUCT(fail_eliminate = "Object is return value";)
657 } else {
658 NOT_PRODUCT(fail_eliminate = "Object is referenced by node";)
659 }
660 DEBUG_ONLY(disq_node = use;)
661 }
662 can_eliminate = false;
663 }
664 }
665 }
666
667 #ifndef PRODUCT
668 if (PrintEliminateAllocations && safepoints != nullptr) {
669 if (can_eliminate) {
670 tty->print("Scalar ");
671 if (res == nullptr)
672 alloc->dump();
673 else
674 res->dump();
675 } else if (alloc->_is_scalar_replaceable) {
676 tty->print("NotScalar (%s)", fail_eliminate);
677 if (res == nullptr)
678 alloc->dump();
679 else
680 res->dump();
681 #ifdef ASSERT
682 if (disq_node != nullptr) {
683 tty->print(" >>>> ");
684 disq_node->dump();
685 }
686 #endif /*ASSERT*/
687 }
688 }
689
690 if (TraceReduceAllocationMerges && !can_eliminate && reduce_merge_precheck) {
691 tty->print_cr("\tCan't eliminate allocation because '%s': ", fail_eliminate != nullptr ? fail_eliminate : "");
692 DEBUG_ONLY(if (disq_node != nullptr) disq_node->dump();)
693 }
694 #endif
695 return can_eliminate;
760 // CheckCastPP result was not updated in the stack slot, and so
761 // we ended up using the CastPP. That means that the field knows
762 // that it should get an oop from an interface, but the value lost
763 // that information, and so it is not a subtype.
764 // There may be other issues, feel free to investigate further!
765 if (!is_java_primitive(value_bt)) { return; }
766
767 tty->print_cr("value not compatible for field: %s vs %s",
768 type2name(value_bt),
769 type2name(field_bt));
770 tty->print("value_type: ");
771 value_type->dump();
772 tty->cr();
773 tty->print("field_type: ");
774 field_type->dump();
775 tty->cr();
776 assert(false, "value_type does not fit field_type");
777 }
778 #endif
779
780 SafePointScalarObjectNode* PhaseMacroExpand::create_scalarized_object_description(AllocateNode *alloc, SafePointNode* sfpt) {
781 // Fields of scalar objs are referenced only at the end
782 // of regular debuginfo at the last (youngest) JVMS.
783 // Record relative start index.
784 ciInstanceKlass* iklass = nullptr;
785 BasicType basic_elem_type = T_ILLEGAL;
786 const Type* field_type = nullptr;
787 const TypeOopPtr* res_type = nullptr;
788 int nfields = 0;
789 int array_base = 0;
790 int element_size = 0;
791 uint first_ind = (sfpt->req() - sfpt->jvms()->scloff());
792 Node* res = alloc->result_cast();
793
794 assert(res == nullptr || res->is_CheckCastPP(), "unexpected AllocateNode result");
795 assert(sfpt->jvms() != nullptr, "missed JVMS");
796
797 if (res != nullptr) { // Could be null when there are no users
798 res_type = _igvn.type(res)->isa_oopptr();
799
800 if (res_type->isa_instptr()) {
801 // find the fields of the class which will be needed for safepoint debug information
802 iklass = res_type->is_instptr()->instance_klass();
803 nfields = iklass->nof_nonstatic_fields();
804 } else {
805 // find the array's elements which will be needed for safepoint debug information
806 nfields = alloc->in(AllocateNode::ALength)->find_int_con(-1);
807 assert(nfields >= 0, "must be an array klass.");
808 basic_elem_type = res_type->is_aryptr()->elem()->array_element_basic_type();
809 array_base = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
810 element_size = type2aelembytes(basic_elem_type);
811 field_type = res_type->is_aryptr()->elem();
812 }
813 }
814
815 SafePointScalarObjectNode* sobj = new SafePointScalarObjectNode(res_type, alloc, first_ind, sfpt->jvms()->depth(), nfields);
816 sobj->init_req(0, C->root());
817 transform_later(sobj);
818
819 // Scan object's fields adding an input to the safepoint for each field.
820 for (int j = 0; j < nfields; j++) {
821 intptr_t offset;
822 ciField* field = nullptr;
823 if (iklass != nullptr) {
824 field = iklass->nonstatic_field_at(j);
825 offset = field->offset_in_bytes();
826 ciType* elem_type = field->type();
827 basic_elem_type = field->layout_type();
828
829 // The next code is taken from Parse::do_get_xxx().
830 if (is_reference_type(basic_elem_type)) {
831 if (!elem_type->is_loaded()) {
832 field_type = TypeInstPtr::BOTTOM;
833 } else if (field != nullptr && field->is_static_constant()) {
834 ciObject* con = field->constant_value().as_object();
835 // Do not "join" in the previous type; it doesn't add value,
836 // and may yield a vacuous result if the field is of interface type.
837 field_type = TypeOopPtr::make_from_constant(con)->isa_oopptr();
838 assert(field_type != nullptr, "field singleton type must be consistent");
839 } else {
840 field_type = TypeOopPtr::make_from_klass(elem_type->as_klass());
841 }
842 if (UseCompressedOops) {
843 field_type = field_type->make_narrowoop();
844 basic_elem_type = T_NARROWOOP;
845 }
846 } else {
847 field_type = Type::get_const_basic_type(basic_elem_type);
848 }
849 } else {
850 offset = array_base + j * (intptr_t)element_size;
851 }
852
853 const TypeOopPtr *field_addr_type = res_type->add_offset(offset)->isa_oopptr();
854
855 Node *field_val = value_from_mem(sfpt->memory(), sfpt->control(), basic_elem_type, field_type, field_addr_type, alloc);
856
857 // We weren't able to find a value for this field,
858 // give up on eliminating this allocation.
859 if (field_val == nullptr) {
860 uint last = sfpt->req() - 1;
861 for (int k = 0; k < j; k++) {
862 sfpt->del_req(last--);
863 }
864 _igvn._worklist.push(sfpt);
865
866 #ifndef PRODUCT
867 if (PrintEliminateAllocations) {
868 if (field != nullptr) {
869 tty->print("=== At SafePoint node %d can't find value of field: ", sfpt->_idx);
870 field->print();
871 int field_idx = C->get_alias_index(field_addr_type);
872 tty->print(" (alias_idx=%d)", field_idx);
873 } else { // Array's element
874 tty->print("=== At SafePoint node %d can't find value of array element [%d]", sfpt->_idx, j);
875 }
876 tty->print(", which prevents elimination of: ");
877 if (res == nullptr)
878 alloc->dump();
879 else
880 res->dump();
881 }
882 #endif
883
884 return nullptr;
885 }
886
887 if (UseCompressedOops && field_type->isa_narrowoop()) {
888 // Enable "DecodeN(EncodeP(Allocate)) --> Allocate" transformation
889 // to be able scalar replace the allocation.
890 if (field_val->is_EncodeP()) {
891 field_val = field_val->in(1);
892 } else {
893 field_val = transform_later(new DecodeNNode(field_val, field_val->get_ptr_type()));
894 }
895 }
896 DEBUG_ONLY(verify_type_compatability(field_val->bottom_type(), field_type);)
897 sfpt->add_req(field_val);
898 }
899
900 sfpt->jvms()->set_endoff(sfpt->req());
901
902 return sobj;
903 }
904
905 // Do scalar replacement.
906 bool PhaseMacroExpand::scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints) {
907 GrowableArray <SafePointNode *> safepoints_done;
908 Node* res = alloc->result_cast();
909 assert(res == nullptr || res->is_CheckCastPP(), "unexpected AllocateNode result");
910
911 // Process the safepoint uses
912 while (safepoints.length() > 0) {
913 SafePointNode* sfpt = safepoints.pop();
914 SafePointScalarObjectNode* sobj = create_scalarized_object_description(alloc, sfpt);
915
916 if (sobj == nullptr) {
917 undo_previous_scalarizations(safepoints_done, alloc);
918 return false;
919 }
920
921 // Now make a pass over the debug information replacing any references
922 // to the allocated object with "sobj"
923 JVMState *jvms = sfpt->jvms();
924 sfpt->replace_edges_in_range(res, sobj, jvms->debug_start(), jvms->debug_end(), &_igvn);
925 _igvn._worklist.push(sfpt);
926
927 // keep it for rollback
928 safepoints_done.append_if_missing(sfpt);
929 }
930
931 return true;
932 }
933
934 static void disconnect_projections(MultiNode* n, PhaseIterGVN& igvn) {
935 Node* ctl_proj = n->proj_out_or_null(TypeFunc::Control);
936 Node* mem_proj = n->proj_out_or_null(TypeFunc::Memory);
937 if (ctl_proj != nullptr) {
938 igvn.replace_node(ctl_proj, n->in(0));
939 }
940 if (mem_proj != nullptr) {
941 igvn.replace_node(mem_proj, n->in(TypeFunc::Memory));
942 }
943 }
944
945 // Process users of eliminated allocation.
946 void PhaseMacroExpand::process_users_of_allocation(CallNode *alloc) {
947 Node* res = alloc->result_cast();
948 if (res != nullptr) {
949 for (DUIterator_Last jmin, j = res->last_outs(jmin); j >= jmin; ) {
950 Node *use = res->last_out(j);
951 uint oc1 = res->outcnt();
952
953 if (use->is_AddP()) {
954 for (DUIterator_Last kmin, k = use->last_outs(kmin); k >= kmin; ) {
955 Node *n = use->last_out(k);
956 uint oc2 = use->outcnt();
957 if (n->is_Store()) {
958 #ifdef ASSERT
959 // Verify that there is no dependent MemBarVolatile nodes,
960 // they should be removed during IGVN, see MemBarNode::Ideal().
961 for (DUIterator_Fast pmax, p = n->fast_outs(pmax);
962 p < pmax; p++) {
963 Node* mb = n->fast_out(p);
964 assert(mb->is_Initialize() || !mb->is_MemBar() ||
965 mb->req() <= MemBarNode::Precedent ||
966 mb->in(MemBarNode::Precedent) != n,
967 "MemBarVolatile should be eliminated for non-escaping object");
968 }
969 #endif
970 _igvn.replace_node(n, n->in(MemNode::Memory));
971 } else {
972 eliminate_gc_barrier(n);
973 }
974 k -= (oc2 - use->outcnt());
975 }
976 _igvn.remove_dead_node(use);
977 } else if (use->is_ArrayCopy()) {
978 // Disconnect ArrayCopy node
979 ArrayCopyNode* ac = use->as_ArrayCopy();
980 if (ac->is_clonebasic()) {
981 Node* membar_after = ac->proj_out(TypeFunc::Control)->unique_ctrl_out();
982 disconnect_projections(ac, _igvn);
983 assert(alloc->in(TypeFunc::Memory)->is_Proj() && alloc->in(TypeFunc::Memory)->in(0)->Opcode() == Op_MemBarCPUOrder, "mem barrier expected before allocation");
984 Node* membar_before = alloc->in(TypeFunc::Memory)->in(0);
985 disconnect_projections(membar_before->as_MemBar(), _igvn);
986 if (membar_after->is_MemBar()) {
987 disconnect_projections(membar_after->as_MemBar(), _igvn);
988 }
989 } else {
990 assert(ac->is_arraycopy_validated() ||
991 ac->is_copyof_validated() ||
992 ac->is_copyofrange_validated(), "unsupported");
993 CallProjections callprojs;
994 ac->extract_projections(&callprojs, true);
995
996 _igvn.replace_node(callprojs.fallthrough_ioproj, ac->in(TypeFunc::I_O));
997 _igvn.replace_node(callprojs.fallthrough_memproj, ac->in(TypeFunc::Memory));
998 _igvn.replace_node(callprojs.fallthrough_catchproj, ac->in(TypeFunc::Control));
999
1000 // Set control to top. IGVN will remove the remaining projections
1001 ac->set_req(0, top());
1002 ac->replace_edge(res, top(), &_igvn);
1003
1004 // Disconnect src right away: it can help find new
1005 // opportunities for allocation elimination
1006 Node* src = ac->in(ArrayCopyNode::Src);
1007 ac->replace_edge(src, top(), &_igvn);
1008 // src can be top at this point if src and dest of the
1009 // arraycopy were the same
1010 if (src->outcnt() == 0 && !src->is_top()) {
1011 _igvn.remove_dead_node(src);
1012 }
1013 }
1014 _igvn._worklist.push(ac);
1015 } else {
1016 eliminate_gc_barrier(use);
1017 }
1018 j -= (oc1 - res->outcnt());
1019 }
1020 assert(res->outcnt() == 0, "all uses of allocated objects must be deleted");
1021 _igvn.remove_dead_node(res);
1022 }
1023
1024 //
1025 // Process other users of allocation's projections
1026 //
1027 if (_callprojs.resproj != nullptr && _callprojs.resproj->outcnt() != 0) {
1028 // First disconnect stores captured by Initialize node.
1029 // If Initialize node is eliminated first in the following code,
1030 // it will kill such stores and DUIterator_Last will assert.
1031 for (DUIterator_Fast jmax, j = _callprojs.resproj->fast_outs(jmax); j < jmax; j++) {
1032 Node* use = _callprojs.resproj->fast_out(j);
1033 if (use->is_AddP()) {
1034 // raw memory addresses used only by the initialization
1035 _igvn.replace_node(use, C->top());
1036 --j; --jmax;
1037 }
1038 }
1039 for (DUIterator_Last jmin, j = _callprojs.resproj->last_outs(jmin); j >= jmin; ) {
1040 Node* use = _callprojs.resproj->last_out(j);
1041 uint oc1 = _callprojs.resproj->outcnt();
1042 if (use->is_Initialize()) {
1043 // Eliminate Initialize node.
1044 InitializeNode *init = use->as_Initialize();
1045 Node *ctrl_proj = init->proj_out_or_null(TypeFunc::Control);
1046 if (ctrl_proj != nullptr) {
1047 _igvn.replace_node(ctrl_proj, init->in(TypeFunc::Control));
1048 #ifdef ASSERT
1049 // If the InitializeNode has no memory out, it will die, and tmp will become null
1050 Node* tmp = init->in(TypeFunc::Control);
1051 assert(tmp == nullptr || tmp == _callprojs.fallthrough_catchproj, "allocation control projection");
1052 #endif
1053 }
1054 Node* mem = init->in(TypeFunc::Memory);
1055 #ifdef ASSERT
1056 if (init->number_of_projs(TypeFunc::Memory) > 0) {
1057 if (mem->is_MergeMem()) {
1058 assert(mem->as_MergeMem()->memory_at(Compile::AliasIdxRaw) == _callprojs.fallthrough_memproj, "allocation memory projection");
1059 } else {
1060 assert(mem == _callprojs.fallthrough_memproj, "allocation memory projection");
1061 }
1062 }
1063 #endif
1064 init->replace_mem_projs_by(mem, &_igvn);
1065 assert(init->outcnt() == 0, "should only have had a control and some memory projections, and we removed them");
1066 } else {
1067 assert(false, "only Initialize or AddP expected");
1068 }
1069 j -= (oc1 - _callprojs.resproj->outcnt());
1070 }
1071 }
1072 if (_callprojs.fallthrough_catchproj != nullptr) {
1073 _igvn.replace_node(_callprojs.fallthrough_catchproj, alloc->in(TypeFunc::Control));
1074 }
1075 if (_callprojs.fallthrough_memproj != nullptr) {
1076 _igvn.replace_node(_callprojs.fallthrough_memproj, alloc->in(TypeFunc::Memory));
1077 }
1078 if (_callprojs.catchall_memproj != nullptr) {
1079 _igvn.replace_node(_callprojs.catchall_memproj, C->top());
1080 }
1081 if (_callprojs.fallthrough_ioproj != nullptr) {
1082 _igvn.replace_node(_callprojs.fallthrough_ioproj, alloc->in(TypeFunc::I_O));
1083 }
1084 if (_callprojs.catchall_ioproj != nullptr) {
1085 _igvn.replace_node(_callprojs.catchall_ioproj, C->top());
1086 }
1087 if (_callprojs.catchall_catchproj != nullptr) {
1088 _igvn.replace_node(_callprojs.catchall_catchproj, C->top());
1089 }
1090 }
1091
1092 bool PhaseMacroExpand::eliminate_allocate_node(AllocateNode *alloc) {
1093 // If reallocation fails during deoptimization we'll pop all
1094 // interpreter frames for this compiled frame and that won't play
1095 // nice with JVMTI popframe.
1096 // We avoid this issue by eager reallocation when the popframe request
1097 // is received.
1098 if (!EliminateAllocations || !alloc->_is_non_escaping) {
1099 return false;
1100 }
1101 Node* klass = alloc->in(AllocateNode::KlassNode);
1102 const TypeKlassPtr* tklass = _igvn.type(klass)->is_klassptr();
1103 Node* res = alloc->result_cast();
1104 // Eliminate boxing allocations which are not used
1105 // regardless scalar replaceable status.
1106 bool boxing_alloc = C->eliminate_boxing() &&
1107 tklass->isa_instklassptr() &&
1108 tklass->is_instklassptr()->instance_klass()->is_box_klass();
1109 if (!alloc->_is_scalar_replaceable && (!boxing_alloc || (res != nullptr))) {
1110 return false;
1111 }
1112
1113 alloc->extract_projections(&_callprojs, false /*separate_io_proj*/, false /*do_asserts*/);
1114
1115 GrowableArray <SafePointNode *> safepoints;
1116 if (!can_eliminate_allocation(&_igvn, alloc, &safepoints)) {
1117 return false;
1118 }
1119
1120 if (!alloc->_is_scalar_replaceable) {
1121 assert(res == nullptr, "sanity");
1122 // We can only eliminate allocation if all debug info references
1123 // are already replaced with SafePointScalarObject because
1124 // we can't search for a fields value without instance_id.
1125 if (safepoints.length() > 0) {
1126 return false;
1127 }
1128 }
1129
1130 if (!scalar_replacement(alloc, safepoints)) {
1131 return false;
1132 }
1133
1134 CompileLog* log = C->log();
1135 if (log != nullptr) {
1136 log->head("eliminate_allocation type='%d'",
1137 log->identify(tklass->exact_klass()));
1138 JVMState* p = alloc->jvms();
1139 while (p != nullptr) {
1140 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
1141 p = p->caller();
1142 }
1143 log->tail("eliminate_allocation");
1144 }
1145
1146 process_users_of_allocation(alloc);
1147
1148 #ifndef PRODUCT
1149 if (PrintEliminateAllocations) {
1150 if (alloc->is_AllocateArray())
1151 tty->print_cr("++++ Eliminated: %d AllocateArray", alloc->_idx);
1152 else
1153 tty->print_cr("++++ Eliminated: %d Allocate", alloc->_idx);
1154 }
1155 #endif
1156
1157 return true;
1158 }
1159
1160 bool PhaseMacroExpand::eliminate_boxing_node(CallStaticJavaNode *boxing) {
1161 // EA should remove all uses of non-escaping boxing node.
1162 if (!C->eliminate_boxing() || boxing->proj_out_or_null(TypeFunc::Parms) != nullptr) {
1163 return false;
1164 }
1165
1166 assert(boxing->result_cast() == nullptr, "unexpected boxing node result");
1167
1168 boxing->extract_projections(&_callprojs, false /*separate_io_proj*/, false /*do_asserts*/);
1169
1170 const TypeTuple* r = boxing->tf()->range();
1171 assert(r->cnt() > TypeFunc::Parms, "sanity");
1172 const TypeInstPtr* t = r->field_at(TypeFunc::Parms)->isa_instptr();
1173 assert(t != nullptr, "sanity");
1174
1175 CompileLog* log = C->log();
1176 if (log != nullptr) {
1177 log->head("eliminate_boxing type='%d'",
1178 log->identify(t->instance_klass()));
1179 JVMState* p = boxing->jvms();
1180 while (p != nullptr) {
1181 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
1182 p = p->caller();
1183 }
1184 log->tail("eliminate_boxing");
1185 }
1186
1187 process_users_of_allocation(boxing);
1188
1189 #ifndef PRODUCT
1190 if (PrintEliminateAllocations) {
1254 // oop flavor.
1255 //
1256 //=============================================================================
1257 // FastAllocateSizeLimit value is in DOUBLEWORDS.
1258 // Allocations bigger than this always go the slow route.
1259 // This value must be small enough that allocation attempts that need to
1260 // trigger exceptions go the slow route. Also, it must be small enough so
1261 // that heap_top + size_in_bytes does not wrap around the 4Gig limit.
1262 //=============================================================================j//
1263 // %%% Here is an old comment from parseHelper.cpp; is it outdated?
1264 // The allocator will coalesce int->oop copies away. See comment in
1265 // coalesce.cpp about how this works. It depends critically on the exact
1266 // code shape produced here, so if you are changing this code shape
1267 // make sure the GC info for the heap-top is correct in and around the
1268 // slow-path call.
1269 //
1270
1271 void PhaseMacroExpand::expand_allocate_common(
1272 AllocateNode* alloc, // allocation node to be expanded
1273 Node* length, // array length for an array allocation
1274 const TypeFunc* slow_call_type, // Type of slow call
1275 address slow_call_address, // Address of slow call
1276 Node* valid_length_test // whether length is valid or not
1277 )
1278 {
1279 Node* ctrl = alloc->in(TypeFunc::Control);
1280 Node* mem = alloc->in(TypeFunc::Memory);
1281 Node* i_o = alloc->in(TypeFunc::I_O);
1282 Node* size_in_bytes = alloc->in(AllocateNode::AllocSize);
1283 Node* klass_node = alloc->in(AllocateNode::KlassNode);
1284 Node* initial_slow_test = alloc->in(AllocateNode::InitialTest);
1285 assert(ctrl != nullptr, "must have control");
1286
1287 // We need a Region and corresponding Phi's to merge the slow-path and fast-path results.
1288 // they will not be used if "always_slow" is set
1289 enum { slow_result_path = 1, fast_result_path = 2 };
1290 Node *result_region = nullptr;
1291 Node *result_phi_rawmem = nullptr;
1292 Node *result_phi_rawoop = nullptr;
1293 Node *result_phi_i_o = nullptr;
1336 #endif
1337 yank_alloc_node(alloc);
1338 return;
1339 }
1340 }
1341
1342 enum { too_big_or_final_path = 1, need_gc_path = 2 };
1343 Node *slow_region = nullptr;
1344 Node *toobig_false = ctrl;
1345
1346 // generate the initial test if necessary
1347 if (initial_slow_test != nullptr ) {
1348 assert (expand_fast_path, "Only need test if there is a fast path");
1349 slow_region = new RegionNode(3);
1350
1351 // Now make the initial failure test. Usually a too-big test but
1352 // might be a TRUE for finalizers.
1353 IfNode *toobig_iff = new IfNode(ctrl, initial_slow_test, PROB_MIN, COUNT_UNKNOWN);
1354 transform_later(toobig_iff);
1355 // Plug the failing-too-big test into the slow-path region
1356 Node *toobig_true = new IfTrueNode( toobig_iff );
1357 transform_later(toobig_true);
1358 slow_region ->init_req( too_big_or_final_path, toobig_true );
1359 toobig_false = new IfFalseNode( toobig_iff );
1360 transform_later(toobig_false);
1361 } else {
1362 // No initial test, just fall into next case
1363 assert(allocation_has_use || !expand_fast_path, "Should already have been handled");
1364 toobig_false = ctrl;
1365 DEBUG_ONLY(slow_region = NodeSentinel);
1366 }
1367
1368 // If we are here there are several possibilities
1369 // - expand_fast_path is false - then only a slow path is expanded. That's it.
1370 // no_initial_check means a constant allocation.
1371 // - If check always evaluates to false -> expand_fast_path is false (see above)
1372 // - If check always evaluates to true -> directly into fast path (but may bailout to slowpath)
1373 // if !allocation_has_use the fast path is empty
1374 // if !allocation_has_use && no_initial_check
1375 // - Then there are no fastpath that can fall out to slowpath -> no allocation code at all.
1376 // removed by yank_alloc_node above.
1377
1378 Node *slow_mem = mem; // save the current memory state for slow path
1379 // generate the fast allocation code unless we know that the initial test will always go slow
1380 if (expand_fast_path) {
1381 // Fast path modifies only raw memory.
1382 if (mem->is_MergeMem()) {
1383 mem = mem->as_MergeMem()->memory_at(Compile::AliasIdxRaw);
1384 }
1385
1386 // allocate the Region and Phi nodes for the result
1387 result_region = new RegionNode(3);
1388 result_phi_rawmem = new PhiNode(result_region, Type::MEMORY, TypeRawPtr::BOTTOM);
1389 result_phi_i_o = new PhiNode(result_region, Type::ABIO); // I/O is used for Prefetch
1390
1391 // Grab regular I/O before optional prefetch may change it.
1392 // Slow-path does no I/O so just set it to the original I/O.
1393 result_phi_i_o->init_req(slow_result_path, i_o);
1394
1395 // Name successful fast-path variables
1396 Node* fast_oop_ctrl;
1397 Node* fast_oop_rawmem;
1398 if (allocation_has_use) {
1399 Node* needgc_ctrl = nullptr;
1400 result_phi_rawoop = new PhiNode(result_region, TypeRawPtr::BOTTOM);
1401
1402 intx prefetch_lines = length != nullptr ? AllocatePrefetchLines : AllocateInstancePrefetchLines;
1403 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
1404 Node* fast_oop = bs->obj_allocate(this, mem, toobig_false, size_in_bytes, i_o, needgc_ctrl,
1405 fast_oop_ctrl, fast_oop_rawmem,
1406 prefetch_lines);
1407
1408 if (initial_slow_test != nullptr) {
1409 // This completes all paths into the slow merge point
1410 slow_region->init_req(need_gc_path, needgc_ctrl);
1411 transform_later(slow_region);
1412 } else {
1413 // No initial slow path needed!
1414 // Just fall from the need-GC path straight into the VM call.
1415 slow_region = needgc_ctrl;
1416 }
1417
1435 result_phi_i_o ->init_req(fast_result_path, i_o);
1436 result_phi_rawmem->init_req(fast_result_path, fast_oop_rawmem);
1437 } else {
1438 slow_region = ctrl;
1439 result_phi_i_o = i_o; // Rename it to use in the following code.
1440 }
1441
1442 // Generate slow-path call
1443 CallNode *call = new CallStaticJavaNode(slow_call_type, slow_call_address,
1444 OptoRuntime::stub_name(slow_call_address),
1445 TypePtr::BOTTOM);
1446 call->init_req(TypeFunc::Control, slow_region);
1447 call->init_req(TypeFunc::I_O, top()); // does no i/o
1448 call->init_req(TypeFunc::Memory, slow_mem); // may gc ptrs
1449 call->init_req(TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr));
1450 call->init_req(TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr));
1451
1452 call->init_req(TypeFunc::Parms+0, klass_node);
1453 if (length != nullptr) {
1454 call->init_req(TypeFunc::Parms+1, length);
1455 }
1456
1457 // Copy debug information and adjust JVMState information, then replace
1458 // allocate node with the call
1459 call->copy_call_debug_info(&_igvn, alloc);
1460 // For array allocations, copy the valid length check to the call node so Compile::final_graph_reshaping() can verify
1461 // that the call has the expected number of CatchProj nodes (in case the allocation always fails and the fallthrough
1462 // path dies).
1463 if (valid_length_test != nullptr) {
1464 call->add_req(valid_length_test);
1465 }
1466 if (expand_fast_path) {
1467 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
1468 } else {
1469 // Hook i_o projection to avoid its elimination during allocation
1470 // replacement (when only a slow call is generated).
1471 call->set_req(TypeFunc::I_O, result_phi_i_o);
1472 }
1473 _igvn.replace_node(alloc, call);
1474 transform_later(call);
1475
1476 // Identify the output projections from the allocate node and
1477 // adjust any references to them.
1478 // The control and io projections look like:
1479 //
1480 // v---Proj(ctrl) <-----+ v---CatchProj(ctrl)
1481 // Allocate Catch
1482 // ^---Proj(io) <-------+ ^---CatchProj(io)
1483 //
1484 // We are interested in the CatchProj nodes.
1485 //
1486 call->extract_projections(&_callprojs, false /*separate_io_proj*/, false /*do_asserts*/);
1487
1488 // An allocate node has separate memory projections for the uses on
1489 // the control and i_o paths. Replace the control memory projection with
1490 // result_phi_rawmem (unless we are only generating a slow call when
1491 // both memory projections are combined)
1492 if (expand_fast_path && _callprojs.fallthrough_memproj != nullptr) {
1493 migrate_outs(_callprojs.fallthrough_memproj, result_phi_rawmem);
1494 }
1495 // Now change uses of catchall_memproj to use fallthrough_memproj and delete
1496 // catchall_memproj so we end up with a call that has only 1 memory projection.
1497 if (_callprojs.catchall_memproj != nullptr ) {
1498 if (_callprojs.fallthrough_memproj == nullptr) {
1499 _callprojs.fallthrough_memproj = new ProjNode(call, TypeFunc::Memory);
1500 transform_later(_callprojs.fallthrough_memproj);
1501 }
1502 migrate_outs(_callprojs.catchall_memproj, _callprojs.fallthrough_memproj);
1503 _igvn.remove_dead_node(_callprojs.catchall_memproj);
1504 }
1505
1506 // An allocate node has separate i_o projections for the uses on the control
1507 // and i_o paths. Always replace the control i_o projection with result i_o
1508 // otherwise incoming i_o become dead when only a slow call is generated
1509 // (it is different from memory projections where both projections are
1510 // combined in such case).
1511 if (_callprojs.fallthrough_ioproj != nullptr) {
1512 migrate_outs(_callprojs.fallthrough_ioproj, result_phi_i_o);
1513 }
1514 // Now change uses of catchall_ioproj to use fallthrough_ioproj and delete
1515 // catchall_ioproj so we end up with a call that has only 1 i_o projection.
1516 if (_callprojs.catchall_ioproj != nullptr ) {
1517 if (_callprojs.fallthrough_ioproj == nullptr) {
1518 _callprojs.fallthrough_ioproj = new ProjNode(call, TypeFunc::I_O);
1519 transform_later(_callprojs.fallthrough_ioproj);
1520 }
1521 migrate_outs(_callprojs.catchall_ioproj, _callprojs.fallthrough_ioproj);
1522 _igvn.remove_dead_node(_callprojs.catchall_ioproj);
1523 }
1524
1525 // if we generated only a slow call, we are done
1526 if (!expand_fast_path) {
1527 // Now we can unhook i_o.
1528 if (result_phi_i_o->outcnt() > 1) {
1529 call->set_req(TypeFunc::I_O, top());
1530 } else {
1531 assert(result_phi_i_o->unique_ctrl_out() == call, "sanity");
1532 // Case of new array with negative size known during compilation.
1533 // AllocateArrayNode::Ideal() optimization disconnect unreachable
1534 // following code since call to runtime will throw exception.
1535 // As result there will be no users of i_o after the call.
1536 // Leave i_o attached to this call to avoid problems in preceding graph.
1537 }
1538 return;
1539 }
1540
1541 if (_callprojs.fallthrough_catchproj != nullptr) {
1542 ctrl = _callprojs.fallthrough_catchproj->clone();
1543 transform_later(ctrl);
1544 _igvn.replace_node(_callprojs.fallthrough_catchproj, result_region);
1545 } else {
1546 ctrl = top();
1547 }
1548 Node *slow_result;
1549 if (_callprojs.resproj == nullptr) {
1550 // no uses of the allocation result
1551 slow_result = top();
1552 } else {
1553 slow_result = _callprojs.resproj->clone();
1554 transform_later(slow_result);
1555 _igvn.replace_node(_callprojs.resproj, result_phi_rawoop);
1556 }
1557
1558 // Plug slow-path into result merge point
1559 result_region->init_req( slow_result_path, ctrl);
1560 transform_later(result_region);
1561 if (allocation_has_use) {
1562 result_phi_rawoop->init_req(slow_result_path, slow_result);
1563 transform_later(result_phi_rawoop);
1564 }
1565 result_phi_rawmem->init_req(slow_result_path, _callprojs.fallthrough_memproj);
1566 transform_later(result_phi_rawmem);
1567 transform_later(result_phi_i_o);
1568 // This completes all paths into the result merge point
1569 }
1570
1571 // Remove alloc node that has no uses.
1572 void PhaseMacroExpand::yank_alloc_node(AllocateNode* alloc) {
1573 Node* ctrl = alloc->in(TypeFunc::Control);
1574 Node* mem = alloc->in(TypeFunc::Memory);
1575 Node* i_o = alloc->in(TypeFunc::I_O);
1576
1577 alloc->extract_projections(&_callprojs, false /*separate_io_proj*/, false /*do_asserts*/);
1578 if (_callprojs.resproj != nullptr) {
1579 for (DUIterator_Fast imax, i = _callprojs.resproj->fast_outs(imax); i < imax; i++) {
1580 Node* use = _callprojs.resproj->fast_out(i);
1581 use->isa_MemBar()->remove(&_igvn);
1582 --imax;
1583 --i; // back up iterator
1584 }
1585 assert(_callprojs.resproj->outcnt() == 0, "all uses must be deleted");
1586 _igvn.remove_dead_node(_callprojs.resproj);
1587 }
1588 if (_callprojs.fallthrough_catchproj != nullptr) {
1589 migrate_outs(_callprojs.fallthrough_catchproj, ctrl);
1590 _igvn.remove_dead_node(_callprojs.fallthrough_catchproj);
1591 }
1592 if (_callprojs.catchall_catchproj != nullptr) {
1593 _igvn.rehash_node_delayed(_callprojs.catchall_catchproj);
1594 _callprojs.catchall_catchproj->set_req(0, top());
1595 }
1596 if (_callprojs.fallthrough_proj != nullptr) {
1597 Node* catchnode = _callprojs.fallthrough_proj->unique_ctrl_out();
1598 _igvn.remove_dead_node(catchnode);
1599 _igvn.remove_dead_node(_callprojs.fallthrough_proj);
1600 }
1601 if (_callprojs.fallthrough_memproj != nullptr) {
1602 migrate_outs(_callprojs.fallthrough_memproj, mem);
1603 _igvn.remove_dead_node(_callprojs.fallthrough_memproj);
1604 }
1605 if (_callprojs.fallthrough_ioproj != nullptr) {
1606 migrate_outs(_callprojs.fallthrough_ioproj, i_o);
1607 _igvn.remove_dead_node(_callprojs.fallthrough_ioproj);
1608 }
1609 if (_callprojs.catchall_memproj != nullptr) {
1610 _igvn.rehash_node_delayed(_callprojs.catchall_memproj);
1611 _callprojs.catchall_memproj->set_req(0, top());
1612 }
1613 if (_callprojs.catchall_ioproj != nullptr) {
1614 _igvn.rehash_node_delayed(_callprojs.catchall_ioproj);
1615 _callprojs.catchall_ioproj->set_req(0, top());
1616 }
1617 #ifndef PRODUCT
1618 if (PrintEliminateAllocations) {
1619 if (alloc->is_AllocateArray()) {
1620 tty->print_cr("++++ Eliminated: %d AllocateArray", alloc->_idx);
1621 } else {
1622 tty->print_cr("++++ Eliminated: %d Allocate", alloc->_idx);
1623 }
1624 }
1625 #endif
1626 _igvn.remove_dead_node(alloc);
1627 }
1628
1629 void PhaseMacroExpand::expand_initialize_membar(AllocateNode* alloc, InitializeNode* init,
1630 Node*& fast_oop_ctrl, Node*& fast_oop_rawmem) {
1631 // If initialization is performed by an array copy, any required
1632 // MemBarStoreStore was already added. If the object does not
1633 // escape no need for a MemBarStoreStore. If the object does not
1634 // escape in its initializer and memory barrier (MemBarStoreStore or
1635 // stronger) is already added at exit of initializer, also no need
1729 Node* thread = new ThreadLocalNode();
1730 transform_later(thread);
1731
1732 call->init_req(TypeFunc::Parms + 0, thread);
1733 call->init_req(TypeFunc::Parms + 1, oop);
1734 call->init_req(TypeFunc::Control, ctrl);
1735 call->init_req(TypeFunc::I_O , top()); // does no i/o
1736 call->init_req(TypeFunc::Memory , rawmem);
1737 call->init_req(TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr));
1738 call->init_req(TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr));
1739 transform_later(call);
1740 ctrl = new ProjNode(call, TypeFunc::Control);
1741 transform_later(ctrl);
1742 rawmem = new ProjNode(call, TypeFunc::Memory);
1743 transform_later(rawmem);
1744 }
1745 }
1746
1747 // Helper for PhaseMacroExpand::expand_allocate_common.
1748 // Initializes the newly-allocated storage.
1749 Node*
1750 PhaseMacroExpand::initialize_object(AllocateNode* alloc,
1751 Node* control, Node* rawmem, Node* object,
1752 Node* klass_node, Node* length,
1753 Node* size_in_bytes) {
1754 InitializeNode* init = alloc->initialization();
1755 // Store the klass & mark bits
1756 Node* mark_node = alloc->make_ideal_mark(&_igvn, object, control, rawmem);
1757 if (!mark_node->is_Con()) {
1758 transform_later(mark_node);
1759 }
1760 rawmem = make_store(control, rawmem, object, oopDesc::mark_offset_in_bytes(), mark_node, TypeX_X->basic_type());
1761
1762 if (!UseCompactObjectHeaders) {
1763 rawmem = make_store(control, rawmem, object, oopDesc::klass_offset_in_bytes(), klass_node, T_METADATA);
1764 }
1765 int header_size = alloc->minimum_header_size(); // conservatively small
1766
1767 // Array length
1768 if (length != nullptr) { // Arrays need length field
1769 rawmem = make_store(control, rawmem, object, arrayOopDesc::length_offset_in_bytes(), length, T_INT);
1770 // conservatively small header size:
1771 header_size = arrayOopDesc::base_offset_in_bytes(T_BYTE);
1772 if (_igvn.type(klass_node)->isa_aryklassptr()) { // we know the exact header size in most cases:
1773 BasicType elem = _igvn.type(klass_node)->is_klassptr()->as_instance_type()->isa_aryptr()->elem()->array_element_basic_type();
1774 if (is_reference_type(elem, true)) {
1775 elem = T_OBJECT;
1776 }
1777 header_size = Klass::layout_helper_header_size(Klass::array_layout_helper(elem));
1778 }
1779 }
1780
1781 // Clear the object body, if necessary.
1782 if (init == nullptr) {
1783 // The init has somehow disappeared; be cautious and clear everything.
1784 //
1785 // This can happen if a node is allocated but an uncommon trap occurs
1786 // immediately. In this case, the Initialize gets associated with the
1787 // trap, and may be placed in a different (outer) loop, if the Allocate
1788 // is in a loop. If (this is rare) the inner loop gets unrolled, then
1789 // there can be two Allocates to one Initialize. The answer in all these
1790 // edge cases is safety first. It is always safe to clear immediately
1791 // within an Allocate, and then (maybe or maybe not) clear some more later.
1792 if (!(UseTLAB && ZeroTLAB)) {
1793 rawmem = ClearArrayNode::clear_memory(control, rawmem, object,
1794 header_size, size_in_bytes,
1795 &_igvn);
1796 }
1797 } else {
1798 if (!init->is_complete()) {
1799 // Try to win by zeroing only what the init does not store.
1800 // We can also try to do some peephole optimizations,
1801 // such as combining some adjacent subword stores.
1802 rawmem = init->complete_stores(control, rawmem, object,
1803 header_size, size_in_bytes, &_igvn);
1804 }
1805 // We have no more use for this link, since the AllocateNode goes away:
1806 init->set_req(InitializeNode::RawAddress, top());
1807 // (If we keep the link, it just confuses the register allocator,
1808 // who thinks he sees a real use of the address by the membar.)
1809 }
1810
1811 return rawmem;
1812 }
1813
1948 for ( intx i = 0; i < lines; i++ ) {
1949 prefetch_adr = new AddPNode( old_eden_top, new_eden_top,
1950 _igvn.MakeConX(distance) );
1951 transform_later(prefetch_adr);
1952 prefetch = new PrefetchAllocationNode( i_o, prefetch_adr );
1953 // Do not let it float too high, since if eden_top == eden_end,
1954 // both might be null.
1955 if( i == 0 ) { // Set control for first prefetch, next follows it
1956 prefetch->init_req(0, needgc_false);
1957 }
1958 transform_later(prefetch);
1959 distance += step_size;
1960 i_o = prefetch;
1961 }
1962 }
1963 return i_o;
1964 }
1965
1966
1967 void PhaseMacroExpand::expand_allocate(AllocateNode *alloc) {
1968 expand_allocate_common(alloc, nullptr,
1969 OptoRuntime::new_instance_Type(),
1970 OptoRuntime::new_instance_Java(), nullptr);
1971 }
1972
1973 void PhaseMacroExpand::expand_allocate_array(AllocateArrayNode *alloc) {
1974 Node* length = alloc->in(AllocateNode::ALength);
1975 Node* valid_length_test = alloc->in(AllocateNode::ValidLengthTest);
1976 InitializeNode* init = alloc->initialization();
1977 Node* klass_node = alloc->in(AllocateNode::KlassNode);
1978 const TypeAryKlassPtr* ary_klass_t = _igvn.type(klass_node)->isa_aryklassptr();
1979 address slow_call_address; // Address of slow call
1980 if (init != nullptr && init->is_complete_with_arraycopy() &&
1981 ary_klass_t && ary_klass_t->elem()->isa_klassptr() == nullptr) {
1982 // Don't zero type array during slow allocation in VM since
1983 // it will be initialized later by arraycopy in compiled code.
1984 slow_call_address = OptoRuntime::new_array_nozero_Java();
1985 } else {
1986 slow_call_address = OptoRuntime::new_array_Java();
1987 }
1988 expand_allocate_common(alloc, length,
1989 OptoRuntime::new_array_Type(),
1990 slow_call_address, valid_length_test);
1991 }
1992
1993 //-------------------mark_eliminated_box----------------------------------
1994 //
1995 // During EA obj may point to several objects but after few ideal graph
1996 // transformations (CCP) it may point to only one non escaping object
1997 // (but still using phi), corresponding locks and unlocks will be marked
1998 // for elimination. Later obj could be replaced with a new node (new phi)
1999 // and which does not have escape information. And later after some graph
2000 // reshape other locks and unlocks (which were not marked for elimination
2001 // before) are connected to this new obj (phi) but they still will not be
2002 // marked for elimination since new obj has no escape information.
2003 // Mark all associated (same box and obj) lock and unlock nodes for
2004 // elimination if some of them marked already.
2005 void PhaseMacroExpand::mark_eliminated_box(Node* box, Node* obj) {
2006 BoxLockNode* oldbox = box->as_BoxLock();
2007 if (oldbox->is_eliminated()) {
2008 return; // This BoxLock node was processed already.
2009 }
2181 #ifdef ASSERT
2182 if (!alock->is_coarsened()) {
2183 // Check that new "eliminated" BoxLock node is created.
2184 BoxLockNode* oldbox = alock->box_node()->as_BoxLock();
2185 assert(oldbox->is_eliminated(), "should be done already");
2186 }
2187 #endif
2188
2189 alock->log_lock_optimization(C, "eliminate_lock");
2190
2191 #ifndef PRODUCT
2192 if (PrintEliminateLocks) {
2193 tty->print_cr("++++ Eliminated: %d %s '%s'", alock->_idx, (alock->is_Lock() ? "Lock" : "Unlock"), alock->kind_as_string());
2194 }
2195 #endif
2196
2197 Node* mem = alock->in(TypeFunc::Memory);
2198 Node* ctrl = alock->in(TypeFunc::Control);
2199 guarantee(ctrl != nullptr, "missing control projection, cannot replace_node() with null");
2200
2201 alock->extract_projections(&_callprojs, false /*separate_io_proj*/, false /*do_asserts*/);
2202 // There are 2 projections from the lock. The lock node will
2203 // be deleted when its last use is subsumed below.
2204 assert(alock->outcnt() == 2 &&
2205 _callprojs.fallthrough_proj != nullptr &&
2206 _callprojs.fallthrough_memproj != nullptr,
2207 "Unexpected projections from Lock/Unlock");
2208
2209 Node* fallthroughproj = _callprojs.fallthrough_proj;
2210 Node* memproj_fallthrough = _callprojs.fallthrough_memproj;
2211
2212 // The memory projection from a lock/unlock is RawMem
2213 // The input to a Lock is merged memory, so extract its RawMem input
2214 // (unless the MergeMem has been optimized away.)
2215 if (alock->is_Lock()) {
2216 // Search for MemBarAcquireLock node and delete it also.
2217 MemBarNode* membar = fallthroughproj->unique_ctrl_out()->as_MemBar();
2218 assert(membar != nullptr && membar->Opcode() == Op_MemBarAcquireLock, "");
2219 Node* ctrlproj = membar->proj_out(TypeFunc::Control);
2220 Node* memproj = membar->proj_out(TypeFunc::Memory);
2221 _igvn.replace_node(ctrlproj, fallthroughproj);
2222 _igvn.replace_node(memproj, memproj_fallthrough);
2223
2224 // Delete FastLock node also if this Lock node is unique user
2225 // (a loop peeling may clone a Lock node).
2226 Node* flock = alock->as_Lock()->fastlock_node();
2227 if (flock->outcnt() == 1) {
2228 assert(flock->unique_out() == alock, "sanity");
2229 _igvn.replace_node(flock, top());
2230 }
2261 assert(!box->as_BoxLock()->is_eliminated(), "sanity");
2262
2263 // Make the merge point
2264 Node *region;
2265 Node *mem_phi;
2266 Node *slow_path;
2267
2268 region = new RegionNode(3);
2269 // create a Phi for the memory state
2270 mem_phi = new PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
2271
2272 // Optimize test; set region slot 2
2273 slow_path = opt_bits_test(ctrl, region, 2, flock);
2274 mem_phi->init_req(2, mem);
2275
2276 // Make slow path call
2277 CallNode* call = make_slow_call(lock, OptoRuntime::complete_monitor_enter_Type(),
2278 OptoRuntime::complete_monitor_locking_Java(), nullptr, slow_path,
2279 obj, box, nullptr);
2280
2281 call->extract_projections(&_callprojs, false /*separate_io_proj*/, false /*do_asserts*/);
2282
2283 // Slow path can only throw asynchronous exceptions, which are always
2284 // de-opted. So the compiler thinks the slow-call can never throw an
2285 // exception. If it DOES throw an exception we would need the debug
2286 // info removed first (since if it throws there is no monitor).
2287 assert(_callprojs.fallthrough_ioproj == nullptr && _callprojs.catchall_ioproj == nullptr &&
2288 _callprojs.catchall_memproj == nullptr && _callprojs.catchall_catchproj == nullptr, "Unexpected projection from Lock");
2289
2290 // Capture slow path
2291 // disconnect fall-through projection from call and create a new one
2292 // hook up users of fall-through projection to region
2293 Node *slow_ctrl = _callprojs.fallthrough_proj->clone();
2294 transform_later(slow_ctrl);
2295 _igvn.hash_delete(_callprojs.fallthrough_proj);
2296 _callprojs.fallthrough_proj->disconnect_inputs(C);
2297 region->init_req(1, slow_ctrl);
2298 // region inputs are now complete
2299 transform_later(region);
2300 _igvn.replace_node(_callprojs.fallthrough_proj, region);
2301
2302 Node *memproj = transform_later(new ProjNode(call, TypeFunc::Memory));
2303
2304 mem_phi->init_req(1, memproj);
2305
2306 transform_later(mem_phi);
2307
2308 _igvn.replace_node(_callprojs.fallthrough_memproj, mem_phi);
2309 }
2310
2311 //------------------------------expand_unlock_node----------------------
2312 void PhaseMacroExpand::expand_unlock_node(UnlockNode *unlock) {
2313
2314 Node* ctrl = unlock->in(TypeFunc::Control);
2315 Node* mem = unlock->in(TypeFunc::Memory);
2316 Node* obj = unlock->obj_node();
2317 Node* box = unlock->box_node();
2318
2319 assert(!box->as_BoxLock()->is_eliminated(), "sanity");
2320
2321 // No need for a null check on unlock
2322
2323 // Make the merge point
2324 Node *region;
2325 Node *mem_phi;
2326
2327 region = new RegionNode(3);
2328 // create a Phi for the memory state
2329 mem_phi = new PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
2330
2331 FastUnlockNode *funlock = new FastUnlockNode( ctrl, obj, box );
2332 funlock = transform_later( funlock )->as_FastUnlock();
2333 // Optimize test; set region slot 2
2334 Node *slow_path = opt_bits_test(ctrl, region, 2, funlock);
2335 Node *thread = transform_later(new ThreadLocalNode());
2336
2337 CallNode *call = make_slow_call((CallNode *) unlock, OptoRuntime::complete_monitor_exit_Type(),
2338 CAST_FROM_FN_PTR(address, SharedRuntime::complete_monitor_unlocking_C),
2339 "complete_monitor_unlocking_C", slow_path, obj, box, thread);
2340
2341 call->extract_projections(&_callprojs, false /*separate_io_proj*/, false /*do_asserts*/);
2342 assert(_callprojs.fallthrough_ioproj == nullptr && _callprojs.catchall_ioproj == nullptr &&
2343 _callprojs.catchall_memproj == nullptr && _callprojs.catchall_catchproj == nullptr, "Unexpected projection from Lock");
2344
2345 // No exceptions for unlocking
2346 // Capture slow path
2347 // disconnect fall-through projection from call and create a new one
2348 // hook up users of fall-through projection to region
2349 Node *slow_ctrl = _callprojs.fallthrough_proj->clone();
2350 transform_later(slow_ctrl);
2351 _igvn.hash_delete(_callprojs.fallthrough_proj);
2352 _callprojs.fallthrough_proj->disconnect_inputs(C);
2353 region->init_req(1, slow_ctrl);
2354 // region inputs are now complete
2355 transform_later(region);
2356 _igvn.replace_node(_callprojs.fallthrough_proj, region);
2357
2358 Node *memproj = transform_later(new ProjNode(call, TypeFunc::Memory) );
2359 mem_phi->init_req(1, memproj );
2360 mem_phi->init_req(2, mem);
2361 transform_later(mem_phi);
2362
2363 _igvn.replace_node(_callprojs.fallthrough_memproj, mem_phi);
2364 }
2365
2366 void PhaseMacroExpand::expand_subtypecheck_node(SubTypeCheckNode *check) {
2367 assert(check->in(SubTypeCheckNode::Control) == nullptr, "should be pinned");
2368 Node* bol = check->unique_out();
2369 Node* obj_or_subklass = check->in(SubTypeCheckNode::ObjOrSubKlass);
2370 Node* superklass = check->in(SubTypeCheckNode::SuperKlass);
2371 assert(bol->is_Bool() && bol->as_Bool()->_test._test == BoolTest::ne, "unexpected bool node");
2372
2373 for (DUIterator_Last imin, i = bol->last_outs(imin); i >= imin; --i) {
2374 Node* iff = bol->last_out(i);
2375 assert(iff->is_If(), "where's the if?");
2376
2377 if (iff->in(0)->is_top()) {
2378 _igvn.replace_input_of(iff, 1, C->top());
2379 continue;
2380 }
2381
2382 IfTrueNode* iftrue = iff->as_If()->true_proj();
2383 IfFalseNode* iffalse = iff->as_If()->false_proj();
2384 Node* ctrl = iff->in(0);
2385
2386 Node* subklass = nullptr;
2387 if (_igvn.type(obj_or_subklass)->isa_klassptr()) {
2388 subklass = obj_or_subklass;
2389 } else {
2390 Node* k_adr = basic_plus_adr(obj_or_subklass, oopDesc::klass_offset_in_bytes());
2391 subklass = _igvn.transform(LoadKlassNode::make(_igvn, C->immutable_memory(), k_adr, TypeInstPtr::KLASS));
2392 }
2393
2394 Node* not_subtype_ctrl = Phase::gen_subtype_check(subklass, superklass, &ctrl, nullptr, _igvn, check->method(), check->bci());
2395
2396 _igvn.replace_input_of(iff, 0, C->top());
2397 _igvn.replace_node(iftrue, not_subtype_ctrl);
2398 _igvn.replace_node(iffalse, ctrl);
2399 }
2400 _igvn.replace_node(check, C->top());
2401 }
2402
2403 // Perform refining of strip mined loop nodes in the macro nodes list.
2404 void PhaseMacroExpand::refine_strip_mined_loop_macro_nodes() {
2405 for (int i = C->macro_count(); i > 0; i--) {
2406 Node* n = C->macro_node(i - 1);
2407 if (n->is_OuterStripMinedLoop()) {
2408 n->as_OuterStripMinedLoop()->adjust_strip_mined_loop(&_igvn);
2409 }
2410 }
2411 }
2412
2413 //---------------------------eliminate_macro_nodes----------------------
2414 // Eliminate scalar replaced allocations and associated locks.
2415 void PhaseMacroExpand::eliminate_macro_nodes() {
2416 if (C->macro_count() == 0)
2417 return;
2418
2419 if (StressMacroElimination) {
2420 C->shuffle_macro_nodes();
2421 }
2422 NOT_PRODUCT(int membar_before = count_MemBar(C);)
2423
2424 // Before elimination may re-mark (change to Nested or NonEscObj)
2425 // all associated (same box and obj) lock and unlock nodes.
2426 int cnt = C->macro_count();
2427 for (int i=0; i < cnt; i++) {
2428 Node *n = C->macro_node(i);
2429 if (n->is_AbstractLock()) { // Lock and Unlock nodes
2430 mark_eliminated_locking_nodes(n->as_AbstractLock());
2431 }
2432 }
2433 // Re-marking may break consistency of Coarsened locks.
2434 if (!C->coarsened_locks_consistent()) {
2435 return; // recompile without Coarsened locks if broken
2436 } else {
2437 // After coarsened locks are eliminated locking regions
2438 // become unbalanced. We should not execute any more
2439 // locks elimination optimizations on them.
2440 C->mark_unbalanced_boxes();
2441 }
2442
2443 // First, attempt to eliminate locks
2444 bool progress = true;
2445 while (progress) {
2446 progress = false;
2447 for (int i = C->macro_count(); i > 0; i = MIN2(i - 1, C->macro_count())) { // more than 1 element can be eliminated at once
2448 Node* n = C->macro_node(i - 1);
2449 bool success = false;
2450 DEBUG_ONLY(int old_macro_count = C->macro_count();)
2451 if (n->is_AbstractLock()) {
2452 success = eliminate_locking_node(n->as_AbstractLock());
2453 #ifndef PRODUCT
2454 if (success && PrintOptoStatistics) {
2455 AtomicAccess::inc(&PhaseMacroExpand::_monitor_objects_removed_counter);
2456 }
2457 #endif
2458 }
2459 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count");
2460 progress = progress || success;
2461 if (success) {
2462 C->print_method(PHASE_AFTER_MACRO_ELIMINATION_STEP, 5, n);
2463 }
2464 }
2465 }
2466 // Next, attempt to eliminate allocations
2467 progress = true;
2468 while (progress) {
2469 progress = false;
2470 for (int i = C->macro_count(); i > 0; i = MIN2(i - 1, C->macro_count())) { // more than 1 element can be eliminated at once
2471 Node* n = C->macro_node(i - 1);
2472 bool success = false;
2473 DEBUG_ONLY(int old_macro_count = C->macro_count();)
2474 switch (n->class_id()) {
2475 case Node::Class_Allocate:
2476 case Node::Class_AllocateArray:
2477 success = eliminate_allocate_node(n->as_Allocate());
2478 #ifndef PRODUCT
2479 if (success && PrintOptoStatistics) {
2480 AtomicAccess::inc(&PhaseMacroExpand::_objs_scalar_replaced_counter);
2481 }
2482 #endif
2483 break;
2484 case Node::Class_CallStaticJava:
2485 success = eliminate_boxing_node(n->as_CallStaticJava());
2486 break;
2487 case Node::Class_Lock:
2488 case Node::Class_Unlock:
2489 assert(!n->as_AbstractLock()->is_eliminated(), "sanity");
2490 break;
2491 case Node::Class_ArrayCopy:
2492 break;
2493 case Node::Class_OuterStripMinedLoop:
2494 break;
2495 case Node::Class_SubTypeCheck:
2496 break;
2497 case Node::Class_Opaque1:
2498 break;
2499 default:
2500 assert(n->Opcode() == Op_LoopLimit ||
2501 n->Opcode() == Op_ModD ||
2502 n->Opcode() == Op_ModF ||
2503 n->is_OpaqueNotNull() ||
2504 n->is_OpaqueInitializedAssertionPredicate() ||
2505 n->Opcode() == Op_MaxL ||
2506 n->Opcode() == Op_MinL ||
2507 BarrierSet::barrier_set()->barrier_set_c2()->is_gc_barrier_node(n),
2508 "unknown node type in macro list");
2509 }
2510 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count");
2511 progress = progress || success;
2512 if (success) {
2513 C->print_method(PHASE_AFTER_MACRO_ELIMINATION_STEP, 5, n);
2514 }
2515 }
2516 }
2517 #ifndef PRODUCT
2518 if (PrintOptoStatistics) {
2519 int membar_after = count_MemBar(C);
2520 AtomicAccess::add(&PhaseMacroExpand::_memory_barriers_removed_counter, membar_before - membar_after);
2521 }
2522 #endif
2523 }
2524
2525 void PhaseMacroExpand::eliminate_opaque_looplimit_macro_nodes() {
2526 if (C->macro_count() == 0) {
2527 return;
2528 }
2529 refine_strip_mined_loop_macro_nodes();
2530 // Eliminate Opaque and LoopLimit nodes. Do it after all loop optimizations.
2531 bool progress = true;
2532 while (progress) {
2533 progress = false;
2534 for (int i = C->macro_count(); i > 0; i--) {
2535 Node* n = C->macro_node(i-1);
2536 bool success = false;
2537 DEBUG_ONLY(int old_macro_count = C->macro_count();)
2538 if (n->Opcode() == Op_LoopLimit) {
2539 // Remove it from macro list and put on IGVN worklist to optimize.
2540 C->remove_macro_node(n);
2541 _igvn._worklist.push(n);
2542 success = true;
2543 } else if (n->Opcode() == Op_CallStaticJava) {
2544 // Remove it from macro list and put on IGVN worklist to optimize.
2545 C->remove_macro_node(n);
2546 _igvn._worklist.push(n);
2547 success = true;
2548 } else if (n->is_Opaque1()) {
2549 _igvn.replace_node(n, n->in(1));
2550 success = true;
2551 } else if (n->is_OpaqueNotNull()) {
2552 // Tests with OpaqueNotNull nodes are implicitly known to be true. Replace the node with true. In debug builds,
2553 // we leave the test in the graph to have an additional sanity check at runtime. If the test fails (i.e. a bug),
2554 // we will execute a Halt node.
2555 #ifdef ASSERT
2556 _igvn.replace_node(n, n->in(1));
2557 #else
2558 _igvn.replace_node(n, _igvn.intcon(1));
2559 #endif
2560 success = true;
2561 } else if (n->is_OpaqueInitializedAssertionPredicate()) {
2562 // Initialized Assertion Predicates must always evaluate to true. Therefore, we get rid of them in product
2563 // builds as they are useless. In debug builds we keep them as additional verification code. Even though
2564 // loop opts are already over, we want to keep Initialized Assertion Predicates alive as long as possible to
2565 // enable folding of dead control paths within which cast nodes become top after due to impossible types -
2566 // even after loop opts are over. Therefore, we delay the removal of these opaque nodes until now.
2567 #ifdef ASSERT
2636 // Worst case is a macro node gets expanded into about 200 nodes.
2637 // Allow 50% more for optimization.
2638 if (C->check_node_count(300, "out of nodes before macro expansion")) {
2639 return true;
2640 }
2641
2642 DEBUG_ONLY(int old_macro_count = C->macro_count();)
2643 switch (n->class_id()) {
2644 case Node::Class_Lock:
2645 expand_lock_node(n->as_Lock());
2646 break;
2647 case Node::Class_Unlock:
2648 expand_unlock_node(n->as_Unlock());
2649 break;
2650 case Node::Class_ArrayCopy:
2651 expand_arraycopy_node(n->as_ArrayCopy());
2652 break;
2653 case Node::Class_SubTypeCheck:
2654 expand_subtypecheck_node(n->as_SubTypeCheck());
2655 break;
2656 default:
2657 switch (n->Opcode()) {
2658 case Op_ModD:
2659 case Op_ModF: {
2660 CallNode* mod_macro = n->as_Call();
2661 CallNode* call = new CallLeafPureNode(mod_macro->tf(), mod_macro->entry_point(), mod_macro->_name);
2662 call->init_req(TypeFunc::Control, mod_macro->in(TypeFunc::Control));
2663 call->init_req(TypeFunc::I_O, C->top());
2664 call->init_req(TypeFunc::Memory, C->top());
2665 call->init_req(TypeFunc::ReturnAdr, C->top());
2666 call->init_req(TypeFunc::FramePtr, C->top());
2667 for (unsigned int i = 0; i < mod_macro->tf()->domain()->cnt() - TypeFunc::Parms; i++) {
2668 call->init_req(TypeFunc::Parms + i, mod_macro->in(TypeFunc::Parms + i));
2669 }
2670 _igvn.replace_node(mod_macro, call);
2671 transform_later(call);
2672 break;
2673 }
2674 default:
2675 assert(false, "unknown node type in macro list");
2676 }
2677 }
2678 assert(C->macro_count() == (old_macro_count - 1), "expansion must have deleted one node from macro list");
2679 if (C->failing()) return true;
2680 C->print_method(PHASE_AFTER_MACRO_EXPANSION_STEP, 5, n);
2681
2682 // Clean up the graph so we're less likely to hit the maximum node
2683 // limit
2684 _igvn.set_delay_transform(false);
2685 _igvn.optimize();
2686 if (C->failing()) return true;
2687 _igvn.set_delay_transform(true);
|
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "ci/ciFlatArrayKlass.hpp"
26 #include "ci/ciInlineKlass.hpp"
27 #include "ci/ciInstanceKlass.hpp"
28 #include "compiler/compileLog.hpp"
29 #include "gc/shared/collectedHeap.inline.hpp"
30 #include "gc/shared/tlab_globals.hpp"
31 #include "libadt/vectset.hpp"
32 #include "memory/universe.hpp"
33 #include "opto/addnode.hpp"
34 #include "opto/arraycopynode.hpp"
35 #include "opto/callnode.hpp"
36 #include "opto/castnode.hpp"
37 #include "opto/cfgnode.hpp"
38 #include "opto/compile.hpp"
39 #include "opto/convertnode.hpp"
40 #include "opto/graphKit.hpp"
41 #include "opto/inlinetypenode.hpp"
42 #include "opto/intrinsicnode.hpp"
43 #include "opto/locknode.hpp"
44 #include "opto/loopnode.hpp"
45 #include "opto/macro.hpp"
46 #include "opto/memnode.hpp"
47 #include "opto/narrowptrnode.hpp"
48 #include "opto/node.hpp"
49 #include "opto/opaquenode.hpp"
50 #include "opto/opcodes.hpp"
51 #include "opto/phaseX.hpp"
52 #include "opto/rootnode.hpp"
53 #include "opto/runtime.hpp"
54 #include "opto/subnode.hpp"
55 #include "opto/subtypenode.hpp"
56 #include "opto/type.hpp"
57 #include "prims/jvmtiExport.hpp"
58 #include "runtime/continuation.hpp"
59 #include "runtime/sharedRuntime.hpp"
60 #include "runtime/stubRoutines.hpp"
61 #include "utilities/globalDefinitions.hpp"
62 #include "utilities/macros.hpp"
63 #include "utilities/powerOfTwo.hpp"
64 #if INCLUDE_G1GC
65 #include "gc/g1/g1ThreadLocalData.hpp"
66 #endif // INCLUDE_G1GC
67
68
69 //
70 // Replace any references to "oldref" in inputs to "use" with "newref".
71 // Returns the number of replacements made.
72 //
73 int PhaseMacroExpand::replace_input(Node *use, Node *oldref, Node *newref) {
74 int nreplacements = 0;
75 uint req = use->req();
76 for (uint j = 0; j < use->len(); j++) {
77 Node *uin = use->in(j);
78 if (uin == oldref) {
79 if (j < req)
80 use->set_req(j, newref);
81 else
82 use->set_prec(j, newref);
83 nreplacements++;
84 } else if (j >= req && uin == nullptr) {
85 break;
86 }
87 }
88 return nreplacements;
89 }
90
91
92 Node* PhaseMacroExpand::opt_bits_test(Node* ctrl, Node* region, int edge, Node* word) {
93 Node* cmp = word;
94 Node* bol = transform_later(new BoolNode(cmp, BoolTest::ne));
95 IfNode* iff = new IfNode( ctrl, bol, PROB_MIN, COUNT_UNKNOWN );
96 transform_later(iff);
97
98 // Fast path taken.
99 Node *fast_taken = transform_later(new IfFalseNode(iff));
100
101 // Fast path not-taken, i.e. slow path
102 Node *slow_taken = transform_later(new IfTrueNode(iff));
103
104 region->init_req(edge, fast_taken); // Capture fast-control
105 return slow_taken;
106 }
107
108 //--------------------copy_predefined_input_for_runtime_call--------------------
109 void PhaseMacroExpand::copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call) {
110 // Set fixed predefined input arguments
123 // Slow-path call
124 CallNode *call = leaf_name
125 ? (CallNode*)new CallLeafNode ( slow_call_type, slow_call, leaf_name, TypeRawPtr::BOTTOM )
126 : (CallNode*)new CallStaticJavaNode( slow_call_type, slow_call, OptoRuntime::stub_name(slow_call), TypeRawPtr::BOTTOM );
127
128 // Slow path call has no side-effects, uses few values
129 copy_predefined_input_for_runtime_call(slow_path, oldcall, call );
130 if (parm0 != nullptr) call->init_req(TypeFunc::Parms+0, parm0);
131 if (parm1 != nullptr) call->init_req(TypeFunc::Parms+1, parm1);
132 if (parm2 != nullptr) call->init_req(TypeFunc::Parms+2, parm2);
133 call->copy_call_debug_info(&_igvn, oldcall);
134 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
135 _igvn.replace_node(oldcall, call);
136 transform_later(call);
137
138 return call;
139 }
140
141 void PhaseMacroExpand::eliminate_gc_barrier(Node* p2x) {
142 BarrierSetC2 *bs = BarrierSet::barrier_set()->barrier_set_c2();
143 bs->eliminate_gc_barrier(&_igvn, p2x);
144 #ifndef PRODUCT
145 if (PrintOptoStatistics) {
146 AtomicAccess::inc(&PhaseMacroExpand::_GC_barriers_removed_counter);
147 }
148 #endif
149 }
150
151 // Search for a memory operation for the specified memory slice.
152 static Node *scan_mem_chain(Node *mem, int alias_idx, int offset, Node *start_mem, Node *alloc, PhaseGVN *phase) {
153 Node *orig_mem = mem;
154 Node *alloc_mem = alloc->as_Allocate()->proj_out_or_null(TypeFunc::Memory, /*io_use:*/false);
155 assert(alloc_mem != nullptr, "Allocation without a memory projection.");
156 const TypeOopPtr *tinst = phase->C->get_adr_type(alias_idx)->isa_oopptr();
157 while (true) {
158 if (mem == alloc_mem || mem == start_mem ) {
159 return mem; // hit one of our sentinels
160 } else if (mem->is_MergeMem()) {
161 mem = mem->as_MergeMem()->memory_at(alias_idx);
162 } else if (mem->is_Proj() && mem->as_Proj()->_con == TypeFunc::Memory) {
163 Node *in = mem->in(0);
166 if (in->is_Initialize() && in->as_Initialize()->allocation() == alloc) {
167 return in;
168 } else if (in->is_Call()) {
169 CallNode *call = in->as_Call();
170 if (call->may_modify(tinst, phase)) {
171 assert(call->is_ArrayCopy(), "ArrayCopy is the only call node that doesn't make allocation escape");
172 if (call->as_ArrayCopy()->modifies(offset, offset, phase, false)) {
173 return in;
174 }
175 }
176 mem = in->in(TypeFunc::Memory);
177 } else if (in->is_MemBar()) {
178 ArrayCopyNode* ac = nullptr;
179 if (ArrayCopyNode::may_modify(tinst, in->as_MemBar(), phase, ac)) {
180 if (ac != nullptr) {
181 assert(ac->is_clonebasic(), "Only basic clone is a non escaping clone");
182 return ac;
183 }
184 }
185 mem = in->in(TypeFunc::Memory);
186 } else if (in->is_LoadFlat() || in->is_StoreFlat()) {
187 mem = in->in(TypeFunc::Memory);
188 } else {
189 #ifdef ASSERT
190 in->dump();
191 mem->dump();
192 assert(false, "unexpected projection");
193 #endif
194 }
195 } else if (mem->is_Store()) {
196 const TypePtr* atype = mem->as_Store()->adr_type();
197 int adr_idx = phase->C->get_alias_index(atype);
198 if (adr_idx == alias_idx) {
199 assert(atype->isa_oopptr(), "address type must be oopptr");
200 int adr_offset = atype->flat_offset();
201 uint adr_iid = atype->is_oopptr()->instance_id();
202 // Array elements references have the same alias_idx
203 // but different offset and different instance_id.
204 if (adr_offset == offset && adr_iid == alloc->_idx) {
205 return mem;
206 }
207 } else {
208 assert(adr_idx == Compile::AliasIdxRaw, "address must match or be raw");
209 }
210 mem = mem->in(MemNode::Memory);
211 } else if (mem->is_ClearArray()) {
212 if (!ClearArrayNode::step_through(&mem, alloc->_idx, phase)) {
213 // Can not bypass initialization of the instance
214 // we are looking.
215 DEBUG_ONLY(intptr_t offset;)
216 assert(alloc == AllocateNode::Ideal_allocation(mem->in(3), phase, offset), "sanity");
217 InitializeNode* init = alloc->as_Allocate()->initialization();
218 // We are looking for stored value, return Initialize node
219 // or memory edge from Allocate node.
220 if (init != nullptr) {
225 }
226 // Otherwise skip it (the call updated 'mem' value).
227 } else if (mem->Opcode() == Op_SCMemProj) {
228 mem = mem->in(0);
229 Node* adr = nullptr;
230 if (mem->is_LoadStore()) {
231 adr = mem->in(MemNode::Address);
232 } else {
233 assert(mem->Opcode() == Op_EncodeISOArray ||
234 mem->Opcode() == Op_StrCompressedCopy, "sanity");
235 adr = mem->in(3); // Destination array
236 }
237 const TypePtr* atype = adr->bottom_type()->is_ptr();
238 int adr_idx = phase->C->get_alias_index(atype);
239 if (adr_idx == alias_idx) {
240 DEBUG_ONLY(mem->dump();)
241 assert(false, "Object is not scalar replaceable if a LoadStore node accesses its field");
242 return nullptr;
243 }
244 mem = mem->in(MemNode::Memory);
245 } else if (mem->Opcode() == Op_StrInflatedCopy) {
246 Node* adr = mem->in(3); // Destination array
247 const TypePtr* atype = adr->bottom_type()->is_ptr();
248 int adr_idx = phase->C->get_alias_index(atype);
249 if (adr_idx == alias_idx) {
250 DEBUG_ONLY(mem->dump();)
251 assert(false, "Object is not scalar replaceable if a StrInflatedCopy node accesses its field");
252 return nullptr;
253 }
254 mem = mem->in(MemNode::Memory);
255 } else {
256 return mem;
257 }
258 assert(mem != orig_mem, "dead memory loop");
259 }
260 }
261
262 // Generate loads from source of the arraycopy for fields of
263 // destination needed at a deoptimization point
264 Node* PhaseMacroExpand::make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, Node* mem, BasicType ft, const Type *ftype, AllocateNode *alloc) {
265 BasicType bt = ft;
270 }
271 Node* res = nullptr;
272 if (ac->is_clonebasic()) {
273 assert(ac->in(ArrayCopyNode::Src) != ac->in(ArrayCopyNode::Dest), "clone source equals destination");
274 Node* base = ac->in(ArrayCopyNode::Src);
275 Node* adr = _igvn.transform(new AddPNode(base, base, _igvn.MakeConX(offset)));
276 const TypePtr* adr_type = _igvn.type(base)->is_ptr()->add_offset(offset);
277 MergeMemNode* mergemen = _igvn.transform(MergeMemNode::make(mem))->as_MergeMem();
278 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
279 res = ArrayCopyNode::load(bs, &_igvn, ctl, mergemen, adr, adr_type, type, bt);
280 } else {
281 if (ac->modifies(offset, offset, &_igvn, true)) {
282 assert(ac->in(ArrayCopyNode::Dest) == alloc->result_cast(), "arraycopy destination should be allocation's result");
283 uint shift = exact_log2(type2aelembytes(bt));
284 Node* src_pos = ac->in(ArrayCopyNode::SrcPos);
285 Node* dest_pos = ac->in(ArrayCopyNode::DestPos);
286 const TypeInt* src_pos_t = _igvn.type(src_pos)->is_int();
287 const TypeInt* dest_pos_t = _igvn.type(dest_pos)->is_int();
288
289 Node* adr = nullptr;
290 Node* base = ac->in(ArrayCopyNode::Src);
291 const TypeAryPtr* adr_type = _igvn.type(base)->is_aryptr();
292 if (adr_type->is_flat()) {
293 shift = adr_type->flat_log_elem_size();
294 }
295 if (src_pos_t->is_con() && dest_pos_t->is_con()) {
296 intptr_t off = ((src_pos_t->get_con() - dest_pos_t->get_con()) << shift) + offset;
297 adr = _igvn.transform(new AddPNode(base, base, _igvn.MakeConX(off)));
298 adr_type = _igvn.type(adr)->is_aryptr();
299 assert(adr_type == _igvn.type(base)->is_aryptr()->add_field_offset_and_offset(off), "incorrect address type");
300 if (ac->in(ArrayCopyNode::Src) == ac->in(ArrayCopyNode::Dest)) {
301 // Don't emit a new load from src if src == dst but try to get the value from memory instead
302 return value_from_mem(ac->in(TypeFunc::Memory), ctl, ft, ftype, adr_type, alloc);
303 }
304 } else {
305 if (ac->in(ArrayCopyNode::Src) == ac->in(ArrayCopyNode::Dest)) {
306 // Non constant offset in the array: we can't statically
307 // determine the value
308 return nullptr;
309 }
310 Node* diff = _igvn.transform(new SubINode(ac->in(ArrayCopyNode::SrcPos), ac->in(ArrayCopyNode::DestPos)));
311 #ifdef _LP64
312 diff = _igvn.transform(new ConvI2LNode(diff));
313 #endif
314 diff = _igvn.transform(new LShiftXNode(diff, _igvn.intcon(shift)));
315
316 Node* off = _igvn.transform(new AddXNode(_igvn.MakeConX(offset), diff));
317 adr = _igvn.transform(new AddPNode(base, base, off));
318 // In the case of a flat inline type array, each field has its
319 // own slice so we need to extract the field being accessed from
320 // the address computation
321 adr_type = adr_type->add_field_offset_and_offset(offset)->add_offset(Type::OffsetBot)->is_aryptr();
322 adr = _igvn.transform(new CastPPNode(ctl, adr, adr_type));
323 }
324 MergeMemNode* mergemen = _igvn.transform(MergeMemNode::make(mem))->as_MergeMem();
325 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
326 res = ArrayCopyNode::load(bs, &_igvn, ctl, mergemen, adr, adr_type, type, bt);
327 }
328 }
329 if (res != nullptr) {
330 if (ftype->isa_narrowoop()) {
331 // PhaseMacroExpand::scalar_replacement adds DecodeN nodes
332 assert(res->isa_DecodeN(), "should be narrow oop");
333 res = _igvn.transform(new EncodePNode(res, ftype));
334 }
335 return res;
336 }
337 return nullptr;
338 }
339
340 //
341 // Given a Memory Phi, compute a value Phi containing the values from stores
342 // on the input paths.
343 // Note: this function is recursive, its depth is limited by the "level" argument
344 // Returns the computed Phi, or null if it cannot compute it.
345 Node *PhaseMacroExpand::value_from_mem_phi(Node *mem, BasicType ft, const Type *phi_type, const TypeOopPtr *adr_t, AllocateNode *alloc, Node_Stack *value_phis, int level) {
346 assert(mem->is_Phi(), "sanity");
347 int alias_idx = C->get_alias_index(adr_t);
348 int offset = adr_t->flat_offset();
349 int instance_id = adr_t->instance_id();
350
351 // Check if an appropriate value phi already exists.
352 Node* region = mem->in(0);
353 for (DUIterator_Fast kmax, k = region->fast_outs(kmax); k < kmax; k++) {
354 Node* phi = region->fast_out(k);
355 if (phi->is_Phi() && phi != mem &&
356 phi->as_Phi()->is_same_inst_field(phi_type, (int)mem->_idx, instance_id, alias_idx, offset)) {
357 return phi;
358 }
359 }
360 // Check if an appropriate new value phi already exists.
361 Node* new_phi = value_phis->find(mem->_idx);
362 if (new_phi != nullptr)
363 return new_phi;
364
365 if (level <= 0) {
366 return nullptr; // Give up: phi tree too deep
367 }
368 Node *start_mem = C->start()->proj_out_or_null(TypeFunc::Memory);
369 Node *alloc_mem = alloc->proj_out_or_null(TypeFunc::Memory, /*io_use:*/false);
370 assert(alloc_mem != nullptr, "Allocation without a memory projection.");
371
372 uint length = mem->req();
373 GrowableArray <Node *> values(length, length, nullptr);
374
375 // create a new Phi for the value
376 PhiNode *phi = new PhiNode(mem->in(0), phi_type, nullptr, mem->_idx, instance_id, alias_idx, offset);
377 transform_later(phi);
378 value_phis->push(phi, mem->_idx);
379
380 for (uint j = 1; j < length; j++) {
381 Node *in = mem->in(j);
382 if (in == nullptr || in->is_top()) {
383 values.at_put(j, in);
384 } else {
385 Node *val = scan_mem_chain(in, alias_idx, offset, start_mem, alloc, &_igvn);
386 if (val == start_mem || val == alloc_mem) {
387 // hit a sentinel, return appropriate value
388 Node* init_value = value_from_alloc(ft, adr_t, alloc);
389 if (init_value == nullptr) {
390 return nullptr;
391 } else {
392 values.at_put(j, init_value);
393 continue;
394 }
395 }
396 if (val->is_Initialize()) {
397 val = val->as_Initialize()->find_captured_store(offset, type2aelembytes(ft), &_igvn);
398 }
399 if (val == nullptr) {
400 return nullptr; // can't find a value on this path
401 }
402 if (val == mem) {
403 values.at_put(j, mem);
404 } else if (val->is_Store()) {
405 Node* n = val->in(MemNode::ValueIn);
406 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
407 n = bs->step_over_gc_barrier(n);
408 if (is_subword_type(ft)) {
409 n = Compile::narrow_value(ft, n, phi_type, &_igvn, true);
410 }
411 values.at_put(j, n);
412 } else if (val->is_Proj() && val->in(0) == alloc) {
413 Node* init_value = value_from_alloc(ft, adr_t, alloc);
414 if (init_value == nullptr) {
415 return nullptr;
416 } else {
417 values.at_put(j, init_value);
418 }
419 } else if (val->is_Phi()) {
420 val = value_from_mem_phi(val, ft, phi_type, adr_t, alloc, value_phis, level-1);
421 if (val == nullptr) {
422 return nullptr;
423 }
424 values.at_put(j, val);
425 } else if (val->Opcode() == Op_SCMemProj) {
426 assert(val->in(0)->is_LoadStore() ||
427 val->in(0)->Opcode() == Op_EncodeISOArray ||
428 val->in(0)->Opcode() == Op_StrCompressedCopy, "sanity");
429 assert(false, "Object is not scalar replaceable if a LoadStore node accesses its field");
430 return nullptr;
431 } else if (val->is_ArrayCopy()) {
432 Node* res = make_arraycopy_load(val->as_ArrayCopy(), offset, val->in(0), val->in(TypeFunc::Memory), ft, phi_type, alloc);
433 if (res == nullptr) {
434 return nullptr;
435 }
436 values.at_put(j, res);
437 } else if (val->is_top()) {
438 // This indicates that this path into the phi is dead. Top will eventually also propagate into the Region.
439 // IGVN will clean this up later.
440 values.at_put(j, val);
441 } else {
442 DEBUG_ONLY( val->dump(); )
443 assert(false, "unknown node on this path");
444 return nullptr; // unknown node on this path
445 }
446 }
447 }
448 // Set Phi's inputs
449 for (uint j = 1; j < length; j++) {
450 if (values.at(j) == mem) {
451 phi->init_req(j, phi);
452 } else {
453 phi->init_req(j, values.at(j));
454 }
455 }
456 return phi;
457 }
458
459 // Extract the initial value of a field in an allocation
460 Node* PhaseMacroExpand::value_from_alloc(BasicType ft, const TypeOopPtr* adr_t, AllocateNode* alloc) {
461 Node* init_value = alloc->in(AllocateNode::InitValue);
462 if (init_value == nullptr) {
463 assert(alloc->in(AllocateNode::RawInitValue) == nullptr, "conflicting InitValue and RawInitValue");
464 return _igvn.zerocon(ft);
465 }
466
467 const TypeAryPtr* ary_t = adr_t->isa_aryptr();
468 assert(ary_t != nullptr, "must be a pointer into an array");
469
470 // If this is not a flat array, then it must be an oop array with elements being init_value
471 if (ary_t->is_not_flat()) {
472 #ifdef ASSERT
473 BasicType init_bt = init_value->bottom_type()->basic_type();
474 assert(ft == init_bt ||
475 (!is_java_primitive(ft) && !is_java_primitive(init_bt) && type2aelembytes(ft, true) == type2aelembytes(init_bt, true)) ||
476 (is_subword_type(ft) && init_bt == T_INT),
477 "invalid init_value of type %s for field of type %s", type2name(init_bt), type2name(ft));
478 #endif // ASSERT
479 return init_value;
480 }
481
482 assert(ary_t->klass_is_exact() && ary_t->is_flat(), "must be an exact flat array");
483 assert(ary_t->field_offset().get() != Type::OffsetBot, "unknown offset");
484 if (init_value->is_EncodeP()) {
485 init_value = init_value->in(1);
486 }
487 // Cannot look through init_value if it is an oop
488 if (!init_value->is_InlineType()) {
489 return nullptr;
490 }
491
492 ciInlineKlass* vk = init_value->bottom_type()->inline_klass();
493 if (ary_t->field_offset().get() == vk->null_marker_offset_in_payload()) {
494 init_value = init_value->as_InlineType()->get_null_marker();
495 } else {
496 init_value = init_value->as_InlineType()->field_value_by_offset(ary_t->field_offset().get() + vk->payload_offset(), true);
497 }
498
499 if (ft == T_NARROWOOP) {
500 assert(init_value->bottom_type()->isa_ptr(), "must be a pointer");
501 init_value = transform_later(new EncodePNode(init_value, init_value->bottom_type()->make_narrowoop()));
502 }
503
504 #ifdef ASSERT
505 BasicType init_bt = init_value->bottom_type()->basic_type();
506 assert(ft == init_bt ||
507 (!is_java_primitive(ft) && !is_java_primitive(init_bt) && type2aelembytes(ft, true) == type2aelembytes(init_bt, true)) ||
508 (is_subword_type(ft) && init_bt == T_INT),
509 "invalid init_value of type %s for field of type %s", type2name(init_bt), type2name(ft));
510 #endif // ASSERT
511
512 return init_value;
513 }
514
515 // Search the last value stored into the object's field.
516 Node *PhaseMacroExpand::value_from_mem(Node *sfpt_mem, Node *sfpt_ctl, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc) {
517 assert(adr_t->is_known_instance_field(), "instance required");
518 int instance_id = adr_t->instance_id();
519 assert((uint)instance_id == alloc->_idx, "wrong allocation");
520
521 int alias_idx = C->get_alias_index(adr_t);
522 int offset = adr_t->flat_offset();
523 Node *start_mem = C->start()->proj_out_or_null(TypeFunc::Memory);
524 Node *alloc_mem = alloc->proj_out_or_null(TypeFunc::Memory, /*io_use:*/false);
525 assert(alloc_mem != nullptr, "Allocation without a memory projection.");
526 VectorSet visited;
527
528 bool done = sfpt_mem == alloc_mem;
529 Node *mem = sfpt_mem;
530 while (!done) {
531 if (visited.test_set(mem->_idx)) {
532 return nullptr; // found a loop, give up
533 }
534 mem = scan_mem_chain(mem, alias_idx, offset, start_mem, alloc, &_igvn);
535 if (mem == start_mem || mem == alloc_mem) {
536 done = true; // hit a sentinel, return appropriate 0 value
537 } else if (mem->is_Initialize()) {
538 mem = mem->as_Initialize()->find_captured_store(offset, type2aelembytes(ft), &_igvn);
539 if (mem == nullptr) {
540 done = true; // Something went wrong.
541 } else if (mem->is_Store()) {
542 const TypePtr* atype = mem->as_Store()->adr_type();
543 assert(C->get_alias_index(atype) == Compile::AliasIdxRaw, "store is correct memory slice");
544 done = true;
545 }
546 } else if (mem->is_Store()) {
547 const TypeOopPtr* atype = mem->as_Store()->adr_type()->isa_oopptr();
548 assert(atype != nullptr, "address type must be oopptr");
549 assert(C->get_alias_index(atype) == alias_idx &&
550 atype->is_known_instance_field() && atype->flat_offset() == offset &&
551 atype->instance_id() == instance_id, "store is correct memory slice");
552 done = true;
553 } else if (mem->is_Phi()) {
554 // try to find a phi's unique input
555 Node *unique_input = nullptr;
556 Node *top = C->top();
557 for (uint i = 1; i < mem->req(); i++) {
558 Node *n = scan_mem_chain(mem->in(i), alias_idx, offset, start_mem, alloc, &_igvn);
559 if (n == nullptr || n == top || n == mem) {
560 continue;
561 } else if (unique_input == nullptr) {
562 unique_input = n;
563 } else if (unique_input != n) {
564 unique_input = top;
565 break;
566 }
567 }
568 if (unique_input != nullptr && unique_input != top) {
569 mem = unique_input;
570 } else {
571 done = true;
572 }
573 } else if (mem->is_ArrayCopy()) {
574 done = true;
575 } else if (mem->is_top()) {
576 // The slice is on a dead path. Returning nullptr would lead to elimination
577 // bailout, but we want to prevent that. Just forwarding the top is also legal,
578 // and IGVN can just clean things up, and remove whatever receives top.
579 return mem;
580 } else {
581 DEBUG_ONLY( mem->dump(); )
582 assert(false, "unexpected node");
583 }
584 }
585 if (mem != nullptr) {
586 if (mem == start_mem || mem == alloc_mem) {
587 // hit a sentinel, return appropriate value
588 return value_from_alloc(ft, adr_t, alloc);
589 } else if (mem->is_Store()) {
590 Node* n = mem->in(MemNode::ValueIn);
591 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
592 n = bs->step_over_gc_barrier(n);
593 return n;
594 } else if (mem->is_Phi()) {
595 // attempt to produce a Phi reflecting the values on the input paths of the Phi
596 Node_Stack value_phis(8);
597 Node* phi = value_from_mem_phi(mem, ft, ftype, adr_t, alloc, &value_phis, ValueSearchLimit);
598 if (phi != nullptr) {
599 return phi;
600 } else {
601 // Kill all new Phis
602 while(value_phis.is_nonempty()) {
603 Node* n = value_phis.node();
604 _igvn.replace_node(n, C->top());
605 value_phis.pop();
606 }
607 }
608 } else if (mem->is_ArrayCopy()) {
609 Node* ctl = mem->in(0);
610 Node* m = mem->in(TypeFunc::Memory);
611 if (sfpt_ctl->is_Proj() && sfpt_ctl->as_Proj()->is_uncommon_trap_proj()) {
612 // pin the loads in the uncommon trap path
613 ctl = sfpt_ctl;
614 m = sfpt_mem;
615 }
616 return make_arraycopy_load(mem->as_ArrayCopy(), offset, ctl, m, ft, ftype, alloc);
617 }
618 }
619 // Something went wrong.
620 return nullptr;
621 }
622
623 // Search the last value stored into the inline type's fields (for flat arrays).
624 Node* PhaseMacroExpand::inline_type_from_mem(ciInlineKlass* vk, const TypeAryPtr* elem_adr_type, int elem_idx, int offset_in_element, bool null_free, AllocateNode* alloc, SafePointNode* sfpt) {
625 auto report_failure = [&](int field_offset_in_element) {
626 #ifndef PRODUCT
627 if (PrintEliminateAllocations) {
628 ciInlineKlass* elem_klass = elem_adr_type->elem()->inline_klass();
629 int offset = field_offset_in_element + elem_klass->payload_offset();
630 ciField* flattened_field = elem_klass->get_field_by_offset(offset, false);
631 assert(flattened_field != nullptr, "must have a field of type %s at offset %d", elem_klass->name()->as_utf8(), offset);
632 tty->print("=== At SafePoint node %d can't find value of field [%s] of array element [%d]", sfpt->_idx, flattened_field->name()->as_utf8(), elem_idx);
633 tty->print(", which prevents elimination of: ");
634 alloc->dump();
635 }
636 #endif // PRODUCT
637 };
638
639 // Create a new InlineTypeNode and retrieve the field values from memory
640 InlineTypeNode* vt = InlineTypeNode::make_uninitialized(_igvn, vk, false);
641 transform_later(vt);
642 if (null_free) {
643 vt->set_null_marker(_igvn);
644 } else {
645 int nm_offset_in_element = offset_in_element + vk->null_marker_offset_in_payload();
646 const TypeAryPtr* nm_adr_type = elem_adr_type->with_field_offset(nm_offset_in_element);
647 Node* nm_value = value_from_mem(sfpt->memory(), sfpt->control(), T_BOOLEAN, TypeInt::BOOL, nm_adr_type, alloc);
648 if (nm_value != nullptr) {
649 vt->set_null_marker(_igvn, nm_value);
650 } else {
651 report_failure(nm_offset_in_element);
652 return nullptr;
653 }
654 }
655
656 for (int i = 0; i < vk->nof_declared_nonstatic_fields(); ++i) {
657 ciType* field_type = vt->field_type(i);
658 int field_offset_in_element = offset_in_element + vt->field_offset(i) - vk->payload_offset();
659 Node* field_value = nullptr;
660 if (vt->field_is_flat(i)) {
661 field_value = inline_type_from_mem(field_type->as_inline_klass(), elem_adr_type, elem_idx, field_offset_in_element, vt->field_is_null_free(i), alloc, sfpt);
662 } else {
663 const Type* ft = Type::get_const_type(field_type);
664 BasicType bt = type2field[field_type->basic_type()];
665 if (UseCompressedOops && !is_java_primitive(bt)) {
666 ft = ft->make_narrowoop();
667 bt = T_NARROWOOP;
668 }
669 // Each inline type field has its own memory slice
670 const TypeAryPtr* field_adr_type = elem_adr_type->with_field_offset(field_offset_in_element);
671 field_value = value_from_mem(sfpt->memory(), sfpt->control(), bt, ft, field_adr_type, alloc);
672 if (field_value == nullptr) {
673 report_failure(field_offset_in_element);
674 } else if (ft->isa_narrowoop()) {
675 assert(UseCompressedOops, "unexpected narrow oop");
676 if (field_value->is_EncodeP()) {
677 field_value = field_value->in(1);
678 } else if (!field_value->is_InlineType()) {
679 field_value = transform_later(new DecodeNNode(field_value, field_value->get_ptr_type()));
680 }
681 }
682 }
683 if (field_value != nullptr) {
684 vt->set_field_value(i, field_value);
685 } else {
686 return nullptr;
687 }
688 }
689 return vt;
690 }
691
692 // Check the possibility of scalar replacement.
693 bool PhaseMacroExpand::can_eliminate_allocation(PhaseIterGVN* igvn, AllocateNode *alloc, GrowableArray <SafePointNode *>* safepoints) {
694 // Scan the uses of the allocation to check for anything that would
695 // prevent us from eliminating it.
696 NOT_PRODUCT( const char* fail_eliminate = nullptr; )
697 DEBUG_ONLY( Node* disq_node = nullptr; )
698 bool can_eliminate = true;
699 bool reduce_merge_precheck = (safepoints == nullptr);
700
701 Unique_Node_List worklist;
702 Node* res = alloc->result_cast();
703 const TypeOopPtr* res_type = nullptr;
704 if (res == nullptr) {
705 // All users were eliminated.
706 } else if (!res->is_CheckCastPP()) {
707 NOT_PRODUCT(fail_eliminate = "Allocation does not have unique CheckCastPP";)
708 can_eliminate = false;
709 } else {
710 worklist.push(res);
711 res_type = igvn->type(res)->isa_oopptr();
712 if (res_type == nullptr) {
713 NOT_PRODUCT(fail_eliminate = "Neither instance or array allocation";)
714 can_eliminate = false;
715 } else if (!res_type->klass_is_exact()) {
716 NOT_PRODUCT(fail_eliminate = "Not an exact type.";)
717 can_eliminate = false;
718 } else if (res_type->isa_aryptr()) {
719 int length = alloc->in(AllocateNode::ALength)->find_int_con(-1);
720 if (length < 0) {
721 NOT_PRODUCT(fail_eliminate = "Array's size is not constant";)
722 can_eliminate = false;
723 }
724 }
725 }
726
727 while (can_eliminate && worklist.size() > 0) {
728 BarrierSetC2 *bs = BarrierSet::barrier_set()->barrier_set_c2();
729 res = worklist.pop();
730 for (DUIterator_Fast jmax, j = res->fast_outs(jmax); j < jmax && can_eliminate; j++) {
731 Node* use = res->fast_out(j);
732
733 if (use->is_AddP()) {
734 const TypePtr* addp_type = igvn->type(use)->is_ptr();
735 int offset = addp_type->offset();
736
737 if (offset == Type::OffsetTop || offset == Type::OffsetBot) {
738 NOT_PRODUCT(fail_eliminate = "Undefined field reference";)
739 can_eliminate = false;
740 break;
741 }
742 for (DUIterator_Fast kmax, k = use->fast_outs(kmax);
743 k < kmax && can_eliminate; k++) {
744 Node* n = use->fast_out(k);
745 if ((n->is_Mem() && n->as_Mem()->is_mismatched_access()) || n->is_LoadFlat() || n->is_StoreFlat()) {
746 DEBUG_ONLY(disq_node = n);
747 NOT_PRODUCT(fail_eliminate = "Mismatched access");
748 can_eliminate = false;
749 }
750 if (!n->is_Store() && n->Opcode() != Op_CastP2X && !bs->is_gc_pre_barrier_node(n) && !reduce_merge_precheck) {
751 DEBUG_ONLY(disq_node = n;)
752 if (n->is_Load() || n->is_LoadStore()) {
753 NOT_PRODUCT(fail_eliminate = "Field load";)
754 } else {
755 NOT_PRODUCT(fail_eliminate = "Not store field reference";)
756 }
757 can_eliminate = false;
758 }
759 }
760 } else if (use->is_ArrayCopy() &&
761 (use->as_ArrayCopy()->is_clonebasic() ||
762 use->as_ArrayCopy()->is_arraycopy_validated() ||
763 use->as_ArrayCopy()->is_copyof_validated() ||
764 use->as_ArrayCopy()->is_copyofrange_validated()) &&
765 use->in(ArrayCopyNode::Dest) == res) {
766 // ok to eliminate
767 } else if (use->is_SafePoint()) {
768 SafePointNode* sfpt = use->as_SafePoint();
769 if (sfpt->is_Call() && sfpt->as_Call()->has_non_debug_use(res)) {
770 // Object is passed as argument.
771 DEBUG_ONLY(disq_node = use;)
772 NOT_PRODUCT(fail_eliminate = "Object is passed as argument";)
773 can_eliminate = false;
774 }
775 Node* sfptMem = sfpt->memory();
776 if (sfptMem == nullptr || sfptMem->is_top()) {
777 DEBUG_ONLY(disq_node = use;)
778 NOT_PRODUCT(fail_eliminate = "null or TOP memory";)
779 can_eliminate = false;
780 } else if (!reduce_merge_precheck) {
781 assert(!res->is_Phi() || !res->as_Phi()->can_be_inline_type(), "Inline type allocations should not have safepoint uses");
782 safepoints->append_if_missing(sfpt);
783 }
784 } else if (use->is_InlineType() && use->as_InlineType()->get_oop() == res) {
785 // Look at uses
786 for (DUIterator_Fast kmax, k = use->fast_outs(kmax); k < kmax; k++) {
787 Node* u = use->fast_out(k);
788 if (u->is_InlineType()) {
789 // Use in flat field can be eliminated
790 InlineTypeNode* vt = u->as_InlineType();
791 for (uint i = 0; i < vt->field_count(); ++i) {
792 if (vt->field_value(i) == use && !vt->field_is_flat(i)) {
793 can_eliminate = false; // Use in non-flat field
794 break;
795 }
796 }
797 } else {
798 // Add other uses to the worklist to process individually
799 worklist.push(use);
800 }
801 }
802 } else if (use->Opcode() == Op_StoreX && use->in(MemNode::Address) == res) {
803 // Store to mark word of inline type larval buffer
804 assert(res_type->is_inlinetypeptr(), "Unexpected store to mark word");
805 } else if (res_type->is_inlinetypeptr() && (use->Opcode() == Op_MemBarRelease || use->Opcode() == Op_MemBarStoreStore)) {
806 // Inline type buffer allocations are followed by a membar
807 } else if (reduce_merge_precheck &&
808 (use->is_Phi() || use->is_EncodeP() ||
809 use->Opcode() == Op_MemBarRelease ||
810 (UseStoreStoreForCtor && use->Opcode() == Op_MemBarStoreStore))) {
811 // Nothing to do
812 } else if (use->Opcode() != Op_CastP2X) { // CastP2X is used by card mark
813 if (use->is_Phi()) {
814 if (use->outcnt() == 1 && use->unique_out()->Opcode() == Op_Return) {
815 NOT_PRODUCT(fail_eliminate = "Object is return value";)
816 } else {
817 NOT_PRODUCT(fail_eliminate = "Object is referenced by Phi";)
818 }
819 DEBUG_ONLY(disq_node = use;)
820 } else {
821 if (use->Opcode() == Op_Return) {
822 NOT_PRODUCT(fail_eliminate = "Object is return value";)
823 } else {
824 NOT_PRODUCT(fail_eliminate = "Object is referenced by node";)
825 }
826 DEBUG_ONLY(disq_node = use;)
827 }
828 can_eliminate = false;
829 } else {
830 assert(use->Opcode() == Op_CastP2X, "should be");
831 assert(!use->has_out_with(Op_OrL), "should have been removed because oop is never null");
832 }
833 }
834 }
835
836 #ifndef PRODUCT
837 if (PrintEliminateAllocations && safepoints != nullptr) {
838 if (can_eliminate) {
839 tty->print("Scalar ");
840 if (res == nullptr)
841 alloc->dump();
842 else
843 res->dump();
844 } else {
845 tty->print("NotScalar (%s)", fail_eliminate);
846 if (res == nullptr)
847 alloc->dump();
848 else
849 res->dump();
850 #ifdef ASSERT
851 if (disq_node != nullptr) {
852 tty->print(" >>>> ");
853 disq_node->dump();
854 }
855 #endif /*ASSERT*/
856 }
857 }
858
859 if (TraceReduceAllocationMerges && !can_eliminate && reduce_merge_precheck) {
860 tty->print_cr("\tCan't eliminate allocation because '%s': ", fail_eliminate != nullptr ? fail_eliminate : "");
861 DEBUG_ONLY(if (disq_node != nullptr) disq_node->dump();)
862 }
863 #endif
864 return can_eliminate;
929 // CheckCastPP result was not updated in the stack slot, and so
930 // we ended up using the CastPP. That means that the field knows
931 // that it should get an oop from an interface, but the value lost
932 // that information, and so it is not a subtype.
933 // There may be other issues, feel free to investigate further!
934 if (!is_java_primitive(value_bt)) { return; }
935
936 tty->print_cr("value not compatible for field: %s vs %s",
937 type2name(value_bt),
938 type2name(field_bt));
939 tty->print("value_type: ");
940 value_type->dump();
941 tty->cr();
942 tty->print("field_type: ");
943 field_type->dump();
944 tty->cr();
945 assert(false, "value_type does not fit field_type");
946 }
947 #endif
948
949 void PhaseMacroExpand::process_field_value_at_safepoint(const Type* field_type, Node* field_val, SafePointNode* sfpt, Unique_Node_List* value_worklist) {
950 if (UseCompressedOops && field_type->isa_narrowoop()) {
951 // Enable "DecodeN(EncodeP(Allocate)) --> Allocate" transformation
952 // to be able scalar replace the allocation.
953 if (field_val->is_EncodeP()) {
954 field_val = field_val->in(1);
955 } else if (!field_val->is_InlineType()) {
956 field_val = transform_later(new DecodeNNode(field_val, field_val->get_ptr_type()));
957 }
958 }
959
960 // Keep track of inline types to scalarize them later
961 if (field_val->is_InlineType()) {
962 value_worklist->push(field_val);
963 } else if (field_val->is_Phi()) {
964 PhiNode* phi = field_val->as_Phi();
965 // Eagerly replace inline type phis now since we could be removing an inline type allocation where we must
966 // scalarize all its fields in safepoints.
967 field_val = phi->try_push_inline_types_down(&_igvn, true);
968 if (field_val->is_InlineType()) {
969 value_worklist->push(field_val);
970 }
971 }
972 DEBUG_ONLY(verify_type_compatability(field_val->bottom_type(), field_type);)
973 sfpt->add_req(field_val);
974 }
975
976 bool PhaseMacroExpand::add_array_elems_to_safepoint(AllocateNode* alloc, const TypeAryPtr* array_type, SafePointNode* sfpt, Unique_Node_List* value_worklist) {
977 const Type* elem_type = array_type->elem();
978 BasicType basic_elem_type = elem_type->array_element_basic_type();
979
980 intptr_t elem_size;
981 uint header_size;
982 if (array_type->is_flat()) {
983 elem_size = array_type->flat_elem_size();
984 header_size = arrayOopDesc::base_offset_in_bytes(T_FLAT_ELEMENT);
985 } else {
986 elem_size = type2aelembytes(basic_elem_type);
987 header_size = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
988 }
989
990 int n_elems = alloc->in(AllocateNode::ALength)->get_int();
991 for (int elem_idx = 0; elem_idx < n_elems; elem_idx++) {
992 intptr_t elem_offset = header_size + elem_idx * elem_size;
993 const TypeAryPtr* elem_adr_type = array_type->with_offset(elem_offset);
994 Node* elem_val;
995 if (array_type->is_flat()) {
996 ciInlineKlass* elem_klass = elem_type->inline_klass();
997 assert(elem_klass->maybe_flat_in_array(), "must be flat in array");
998 elem_val = inline_type_from_mem(elem_klass, elem_adr_type, elem_idx, 0, array_type->is_null_free(), alloc, sfpt);
999 } else {
1000 elem_val = value_from_mem(sfpt->memory(), sfpt->control(), basic_elem_type, elem_type, elem_adr_type, alloc);
1001 #ifndef PRODUCT
1002 if (PrintEliminateAllocations && elem_val == nullptr) {
1003 tty->print("=== At SafePoint node %d can't find value of array element [%d]", sfpt->_idx, elem_idx);
1004 tty->print(", which prevents elimination of: ");
1005 alloc->dump();
1006 }
1007 #endif // PRODUCT
1008 }
1009 if (elem_val == nullptr) {
1010 return false;
1011 }
1012
1013 process_field_value_at_safepoint(elem_type, elem_val, sfpt, value_worklist);
1014 }
1015
1016 return true;
1017 }
1018
1019 // Recursively adds all flattened fields of a type 'iklass' inside 'base' to 'sfpt'.
1020 // 'offset_minus_header' refers to the offset of the payload of 'iklass' inside 'base' minus the
1021 // payload offset of 'iklass'. If 'base' is of type 'iklass' then 'offset_minus_header' == 0.
1022 bool PhaseMacroExpand::add_inst_fields_to_safepoint(ciInstanceKlass* iklass, AllocateNode* alloc, Node* base, int offset_minus_header, SafePointNode* sfpt, Unique_Node_List* value_worklist) {
1023 const TypeInstPtr* base_type = _igvn.type(base)->is_instptr();
1024 auto report_failure = [&](int offset) {
1025 #ifndef PRODUCT
1026 if (PrintEliminateAllocations) {
1027 ciInstanceKlass* base_klass = base_type->instance_klass();
1028 ciField* flattened_field = base_klass->get_field_by_offset(offset, false);
1029 assert(flattened_field != nullptr, "must have a field of type %s at offset %d", base_klass->name()->as_utf8(), offset);
1030 tty->print("=== At SafePoint node %d can't find value of field: ", sfpt->_idx);
1031 flattened_field->print();
1032 int field_idx = C->alias_type(flattened_field)->index();
1033 tty->print(" (alias_idx=%d)", field_idx);
1034 tty->print(", which prevents elimination of: ");
1035 base->dump();
1036 }
1037 #endif // PRODUCT
1038 };
1039
1040 for (int i = 0; i < iklass->nof_declared_nonstatic_fields(); i++) {
1041 ciField* field = iklass->declared_nonstatic_field_at(i);
1042 if (field->is_flat()) {
1043 ciInlineKlass* fvk = field->type()->as_inline_klass();
1044 int field_offset_minus_header = offset_minus_header + field->offset_in_bytes() - fvk->payload_offset();
1045 bool success = add_inst_fields_to_safepoint(fvk, alloc, base, field_offset_minus_header, sfpt, value_worklist);
1046 if (!success) {
1047 return false;
1048 }
1049
1050 // The null marker of a field is added right after we scalarize that field
1051 if (!field->is_null_free()) {
1052 int nm_offset = offset_minus_header + field->null_marker_offset();
1053 Node* null_marker = value_from_mem(sfpt->memory(), sfpt->control(), T_BOOLEAN, TypeInt::BOOL, base_type->with_offset(nm_offset), alloc);
1054 if (null_marker == nullptr) {
1055 report_failure(nm_offset);
1056 return false;
1057 }
1058 process_field_value_at_safepoint(TypeInt::BOOL, null_marker, sfpt, value_worklist);
1059 }
1060
1061 continue;
1062 }
1063
1064 int offset = offset_minus_header + field->offset_in_bytes();
1065 ciType* elem_type = field->type();
1066 BasicType basic_elem_type = field->layout_type();
1067
1068 const Type* field_type;
1069 if (is_reference_type(basic_elem_type)) {
1070 if (!elem_type->is_loaded()) {
1071 field_type = TypeInstPtr::BOTTOM;
1072 } else {
1073 field_type = TypeOopPtr::make_from_klass(elem_type->as_klass());
1074 }
1075 if (UseCompressedOops) {
1076 field_type = field_type->make_narrowoop();
1077 basic_elem_type = T_NARROWOOP;
1078 }
1079 } else {
1080 field_type = Type::get_const_basic_type(basic_elem_type);
1081 }
1082
1083 const TypeInstPtr* field_addr_type = base_type->add_offset(offset)->isa_instptr();
1084 Node* field_val = value_from_mem(sfpt->memory(), sfpt->control(), basic_elem_type, field_type, field_addr_type, alloc);
1085 if (field_val == nullptr) {
1086 report_failure(offset);
1087 return false;
1088 }
1089 process_field_value_at_safepoint(field_type, field_val, sfpt, value_worklist);
1090 }
1091
1092 return true;
1093 }
1094
1095 SafePointScalarObjectNode* PhaseMacroExpand::create_scalarized_object_description(AllocateNode* alloc, SafePointNode* sfpt,
1096 Unique_Node_List* value_worklist) {
1097 // Fields of scalar objs are referenced only at the end
1098 // of regular debuginfo at the last (youngest) JVMS.
1099 // Record relative start index.
1100 ciInstanceKlass* iklass = nullptr;
1101 const TypeOopPtr* res_type = nullptr;
1102 int nfields = 0;
1103 uint first_ind = (sfpt->req() - sfpt->jvms()->scloff());
1104 Node* res = alloc->result_cast();
1105
1106 assert(res == nullptr || res->is_CheckCastPP(), "unexpected AllocateNode result");
1107 assert(sfpt->jvms() != nullptr, "missed JVMS");
1108 uint before_sfpt_req = sfpt->req();
1109
1110 if (res != nullptr) { // Could be null when there are no users
1111 res_type = _igvn.type(res)->isa_oopptr();
1112
1113 if (res_type->isa_instptr()) {
1114 // find the fields of the class which will be needed for safepoint debug information
1115 iklass = res_type->is_instptr()->instance_klass();
1116 nfields = iklass->nof_nonstatic_fields();
1117 } else {
1118 // find the array's elements which will be needed for safepoint debug information
1119 nfields = alloc->in(AllocateNode::ALength)->find_int_con(-1);
1120 assert(nfields >= 0, "must be an array klass.");
1121 }
1122
1123 if (res->bottom_type()->is_inlinetypeptr()) {
1124 // Nullable inline types have a null marker field which is added to the safepoint when scalarizing them (see
1125 // InlineTypeNode::make_scalar_in_safepoint()). When having circular inline types, we stop scalarizing at depth 1
1126 // to avoid an endless recursion. Therefore, we do not have a SafePointScalarObjectNode node here, yet.
1127 // We are about to create a SafePointScalarObjectNode as if this is a normal object. Add an additional int input
1128 // with value 1 which sets the null marker to true to indicate that the object is always non-null. This input is checked
1129 // later in PhaseOutput::filLocArray() for inline types.
1130 sfpt->add_req(_igvn.intcon(1));
1131 }
1132 }
1133
1134 SafePointScalarObjectNode* sobj = new SafePointScalarObjectNode(res_type, alloc, first_ind, sfpt->jvms()->depth(), nfields);
1135 sobj->init_req(0, C->root());
1136 transform_later(sobj);
1137
1138 if (res == nullptr) {
1139 sfpt->jvms()->set_endoff(sfpt->req());
1140 return sobj;
1141 }
1142
1143 bool success;
1144 if (iklass == nullptr) {
1145 success = add_array_elems_to_safepoint(alloc, res_type->is_aryptr(), sfpt, value_worklist);
1146 } else {
1147 success = add_inst_fields_to_safepoint(iklass, alloc, res, 0, sfpt, value_worklist);
1148 }
1149
1150 // We weren't able to find a value for this field, remove all the fields added to the safepoint
1151 if (!success) {
1152 for (uint i = sfpt->req() - 1; i >= before_sfpt_req; i--) {
1153 sfpt->del_req(i);
1154 }
1155 _igvn._worklist.push(sfpt);
1156 return nullptr;
1157 }
1158
1159 sfpt->jvms()->set_endoff(sfpt->req());
1160 return sobj;
1161 }
1162
1163 // Do scalar replacement.
1164 bool PhaseMacroExpand::scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints) {
1165 GrowableArray <SafePointNode *> safepoints_done;
1166 Node* res = alloc->result_cast();
1167 assert(res == nullptr || res->is_CheckCastPP(), "unexpected AllocateNode result");
1168 const TypeOopPtr* res_type = nullptr;
1169 if (res != nullptr) { // Could be null when there are no users
1170 res_type = _igvn.type(res)->isa_oopptr();
1171 }
1172
1173 // Process the safepoint uses
1174 Unique_Node_List value_worklist;
1175 while (safepoints.length() > 0) {
1176 SafePointNode* sfpt = safepoints.pop();
1177 SafePointScalarObjectNode* sobj = create_scalarized_object_description(alloc, sfpt, &value_worklist);
1178
1179 if (sobj == nullptr) {
1180 undo_previous_scalarizations(safepoints_done, alloc);
1181 return false;
1182 }
1183
1184 // Now make a pass over the debug information replacing any references
1185 // to the allocated object with "sobj"
1186 JVMState *jvms = sfpt->jvms();
1187 sfpt->replace_edges_in_range(res, sobj, jvms->debug_start(), jvms->debug_end(), &_igvn);
1188 _igvn._worklist.push(sfpt);
1189
1190 // keep it for rollback
1191 safepoints_done.append_if_missing(sfpt);
1192 }
1193 // Scalarize inline types that were added to the safepoint.
1194 // Don't allow linking a constant oop (if available) for flat array elements
1195 // because Deoptimization::reassign_flat_array_elements needs field values.
1196 bool allow_oop = (res_type != nullptr) && !res_type->is_flat();
1197 for (uint i = 0; i < value_worklist.size(); ++i) {
1198 InlineTypeNode* vt = value_worklist.at(i)->as_InlineType();
1199 vt->make_scalar_in_safepoints(&_igvn, allow_oop);
1200 }
1201 return true;
1202 }
1203
1204 static void disconnect_projections(MultiNode* n, PhaseIterGVN& igvn) {
1205 Node* ctl_proj = n->proj_out_or_null(TypeFunc::Control);
1206 Node* mem_proj = n->proj_out_or_null(TypeFunc::Memory);
1207 if (ctl_proj != nullptr) {
1208 igvn.replace_node(ctl_proj, n->in(0));
1209 }
1210 if (mem_proj != nullptr) {
1211 igvn.replace_node(mem_proj, n->in(TypeFunc::Memory));
1212 }
1213 }
1214
1215 // Process users of eliminated allocation.
1216 void PhaseMacroExpand::process_users_of_allocation(CallNode *alloc, bool inline_alloc) {
1217 Unique_Node_List worklist;
1218 Node* res = alloc->result_cast();
1219 if (res != nullptr) {
1220 worklist.push(res);
1221 }
1222 while (worklist.size() > 0) {
1223 res = worklist.pop();
1224 for (DUIterator_Last jmin, j = res->last_outs(jmin); j >= jmin; ) {
1225 Node *use = res->last_out(j);
1226 uint oc1 = res->outcnt();
1227
1228 if (use->is_AddP()) {
1229 for (DUIterator_Last kmin, k = use->last_outs(kmin); k >= kmin; ) {
1230 Node *n = use->last_out(k);
1231 uint oc2 = use->outcnt();
1232 if (n->is_Store()) {
1233 for (DUIterator_Fast pmax, p = n->fast_outs(pmax); p < pmax; p++) {
1234 MemBarNode* mb = n->fast_out(p)->isa_MemBar();
1235 if (mb != nullptr && mb->req() <= MemBarNode::Precedent && mb->in(MemBarNode::Precedent) == n) {
1236 // MemBarVolatiles should have been removed by MemBarNode::Ideal() for non-inline allocations
1237 assert(inline_alloc, "MemBarVolatile should be eliminated for non-escaping object");
1238 mb->remove(&_igvn);
1239 }
1240 }
1241 _igvn.replace_node(n, n->in(MemNode::Memory));
1242 } else {
1243 eliminate_gc_barrier(n);
1244 }
1245 k -= (oc2 - use->outcnt());
1246 }
1247 _igvn.remove_dead_node(use);
1248 } else if (use->is_ArrayCopy()) {
1249 // Disconnect ArrayCopy node
1250 ArrayCopyNode* ac = use->as_ArrayCopy();
1251 if (ac->is_clonebasic()) {
1252 Node* membar_after = ac->proj_out(TypeFunc::Control)->unique_ctrl_out();
1253 disconnect_projections(ac, _igvn);
1254 assert(alloc->in(TypeFunc::Memory)->is_Proj() && alloc->in(TypeFunc::Memory)->in(0)->Opcode() == Op_MemBarCPUOrder, "mem barrier expected before allocation");
1255 Node* membar_before = alloc->in(TypeFunc::Memory)->in(0);
1256 disconnect_projections(membar_before->as_MemBar(), _igvn);
1257 if (membar_after->is_MemBar()) {
1258 disconnect_projections(membar_after->as_MemBar(), _igvn);
1259 }
1260 } else {
1261 assert(ac->is_arraycopy_validated() ||
1262 ac->is_copyof_validated() ||
1263 ac->is_copyofrange_validated(), "unsupported");
1264 CallProjections* callprojs = ac->extract_projections(true);
1265
1266 _igvn.replace_node(callprojs->fallthrough_ioproj, ac->in(TypeFunc::I_O));
1267 _igvn.replace_node(callprojs->fallthrough_memproj, ac->in(TypeFunc::Memory));
1268 _igvn.replace_node(callprojs->fallthrough_catchproj, ac->in(TypeFunc::Control));
1269
1270 // Set control to top. IGVN will remove the remaining projections
1271 ac->set_req(0, top());
1272 ac->replace_edge(res, top(), &_igvn);
1273
1274 // Disconnect src right away: it can help find new
1275 // opportunities for allocation elimination
1276 Node* src = ac->in(ArrayCopyNode::Src);
1277 ac->replace_edge(src, top(), &_igvn);
1278 // src can be top at this point if src and dest of the
1279 // arraycopy were the same
1280 if (src->outcnt() == 0 && !src->is_top()) {
1281 _igvn.remove_dead_node(src);
1282 }
1283 }
1284 _igvn._worklist.push(ac);
1285 } else if (use->is_InlineType()) {
1286 assert(use->as_InlineType()->get_oop() == res, "unexpected inline type ptr use");
1287 // Cut off oop input and remove known instance id from type
1288 _igvn.rehash_node_delayed(use);
1289 use->as_InlineType()->set_oop(_igvn, _igvn.zerocon(T_OBJECT));
1290 use->as_InlineType()->set_is_buffered(_igvn, false);
1291 const TypeOopPtr* toop = _igvn.type(use)->is_oopptr()->cast_to_instance_id(TypeOopPtr::InstanceBot);
1292 _igvn.set_type(use, toop);
1293 use->as_InlineType()->set_type(toop);
1294 // Process users
1295 for (DUIterator_Fast kmax, k = use->fast_outs(kmax); k < kmax; k++) {
1296 Node* u = use->fast_out(k);
1297 if (!u->is_InlineType() && !u->is_StoreFlat()) {
1298 worklist.push(u);
1299 }
1300 }
1301 } else if (use->Opcode() == Op_StoreX && use->in(MemNode::Address) == res) {
1302 // Store to mark word of inline type larval buffer
1303 assert(inline_alloc, "Unexpected store to mark word");
1304 _igvn.replace_node(use, use->in(MemNode::Memory));
1305 } else if (use->Opcode() == Op_MemBarRelease || use->Opcode() == Op_MemBarStoreStore) {
1306 // Inline type buffer allocations are followed by a membar
1307 assert(inline_alloc, "Unexpected MemBarRelease");
1308 use->as_MemBar()->remove(&_igvn);
1309 } else {
1310 eliminate_gc_barrier(use);
1311 }
1312 j -= (oc1 - res->outcnt());
1313 }
1314 assert(res->outcnt() == 0, "all uses of allocated objects must be deleted");
1315 _igvn.remove_dead_node(res);
1316 }
1317
1318 //
1319 // Process other users of allocation's projections
1320 //
1321 if (_callprojs->resproj[0] != nullptr && _callprojs->resproj[0]->outcnt() != 0) {
1322 // First disconnect stores captured by Initialize node.
1323 // If Initialize node is eliminated first in the following code,
1324 // it will kill such stores and DUIterator_Last will assert.
1325 for (DUIterator_Fast jmax, j = _callprojs->resproj[0]->fast_outs(jmax); j < jmax; j++) {
1326 Node* use = _callprojs->resproj[0]->fast_out(j);
1327 if (use->is_AddP()) {
1328 // raw memory addresses used only by the initialization
1329 _igvn.replace_node(use, C->top());
1330 --j; --jmax;
1331 }
1332 }
1333 for (DUIterator_Last jmin, j = _callprojs->resproj[0]->last_outs(jmin); j >= jmin; ) {
1334 Node* use = _callprojs->resproj[0]->last_out(j);
1335 uint oc1 = _callprojs->resproj[0]->outcnt();
1336 if (use->is_Initialize()) {
1337 // Eliminate Initialize node.
1338 InitializeNode *init = use->as_Initialize();
1339 Node *ctrl_proj = init->proj_out_or_null(TypeFunc::Control);
1340 if (ctrl_proj != nullptr) {
1341 _igvn.replace_node(ctrl_proj, init->in(TypeFunc::Control));
1342 #ifdef ASSERT
1343 // If the InitializeNode has no memory out, it will die, and tmp will become null
1344 Node* tmp = init->in(TypeFunc::Control);
1345 assert(tmp == nullptr || tmp == _callprojs->fallthrough_catchproj, "allocation control projection");
1346 #endif
1347 }
1348 Node* mem = init->in(TypeFunc::Memory);
1349 #ifdef ASSERT
1350 if (init->number_of_projs(TypeFunc::Memory) > 0) {
1351 if (mem->is_MergeMem()) {
1352 assert(mem->as_MergeMem()->memory_at(Compile::AliasIdxRaw) == _callprojs->fallthrough_memproj, "allocation memory projection");
1353 } else {
1354 assert(mem == _callprojs->fallthrough_memproj, "allocation memory projection");
1355 }
1356 }
1357 #endif
1358 init->replace_mem_projs_by(mem, &_igvn);
1359 assert(init->outcnt() == 0, "should only have had a control and some memory projections, and we removed them");
1360 } else if (use->Opcode() == Op_MemBarStoreStore) {
1361 // Inline type buffer allocations are followed by a membar
1362 assert(inline_alloc, "Unexpected MemBarStoreStore");
1363 use->as_MemBar()->remove(&_igvn);
1364 } else {
1365 assert(false, "only Initialize or AddP expected");
1366 }
1367 j -= (oc1 - _callprojs->resproj[0]->outcnt());
1368 }
1369 }
1370 if (_callprojs->fallthrough_catchproj != nullptr) {
1371 _igvn.replace_node(_callprojs->fallthrough_catchproj, alloc->in(TypeFunc::Control));
1372 }
1373 if (_callprojs->fallthrough_memproj != nullptr) {
1374 _igvn.replace_node(_callprojs->fallthrough_memproj, alloc->in(TypeFunc::Memory));
1375 }
1376 if (_callprojs->catchall_memproj != nullptr) {
1377 _igvn.replace_node(_callprojs->catchall_memproj, C->top());
1378 }
1379 if (_callprojs->fallthrough_ioproj != nullptr) {
1380 _igvn.replace_node(_callprojs->fallthrough_ioproj, alloc->in(TypeFunc::I_O));
1381 }
1382 if (_callprojs->catchall_ioproj != nullptr) {
1383 _igvn.replace_node(_callprojs->catchall_ioproj, C->top());
1384 }
1385 if (_callprojs->catchall_catchproj != nullptr) {
1386 _igvn.replace_node(_callprojs->catchall_catchproj, C->top());
1387 }
1388 }
1389
1390 bool PhaseMacroExpand::eliminate_allocate_node(AllocateNode *alloc) {
1391 // If reallocation fails during deoptimization we'll pop all
1392 // interpreter frames for this compiled frame and that won't play
1393 // nice with JVMTI popframe.
1394 // We avoid this issue by eager reallocation when the popframe request
1395 // is received.
1396 if (!EliminateAllocations) {
1397 return false;
1398 }
1399 Node* klass = alloc->in(AllocateNode::KlassNode);
1400 const TypeKlassPtr* tklass = _igvn.type(klass)->is_klassptr();
1401
1402 // Attempt to eliminate inline type buffer allocations
1403 // regardless of usage and escape/replaceable status.
1404 bool inline_alloc = tklass->isa_instklassptr() &&
1405 tklass->is_instklassptr()->instance_klass()->is_inlinetype();
1406 if (!alloc->_is_non_escaping && !inline_alloc) {
1407 return false;
1408 }
1409 // Eliminate boxing allocations which are not used
1410 // regardless scalar replaceable status.
1411 Node* res = alloc->result_cast();
1412 bool boxing_alloc = (res == nullptr) && C->eliminate_boxing() &&
1413 tklass->isa_instklassptr() &&
1414 tklass->is_instklassptr()->instance_klass()->is_box_klass();
1415 if (!alloc->_is_scalar_replaceable && !boxing_alloc && !inline_alloc) {
1416 return false;
1417 }
1418
1419 _callprojs = alloc->extract_projections(false /*separate_io_proj*/, false /*do_asserts*/);
1420
1421 GrowableArray <SafePointNode *> safepoints;
1422 if (!can_eliminate_allocation(&_igvn, alloc, &safepoints)) {
1423 return false;
1424 }
1425
1426 if (!alloc->_is_scalar_replaceable) {
1427 assert(res == nullptr || inline_alloc, "sanity");
1428 // We can only eliminate allocation if all debug info references
1429 // are already replaced with SafePointScalarObject because
1430 // we can't search for a fields value without instance_id.
1431 if (safepoints.length() > 0) {
1432 return false;
1433 }
1434 }
1435
1436 if (!scalar_replacement(alloc, safepoints)) {
1437 return false;
1438 }
1439
1440 CompileLog* log = C->log();
1441 if (log != nullptr) {
1442 log->head("eliminate_allocation type='%d'",
1443 log->identify(tklass->exact_klass()));
1444 JVMState* p = alloc->jvms();
1445 while (p != nullptr) {
1446 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
1447 p = p->caller();
1448 }
1449 log->tail("eliminate_allocation");
1450 }
1451
1452 process_users_of_allocation(alloc, inline_alloc);
1453
1454 #ifndef PRODUCT
1455 if (PrintEliminateAllocations) {
1456 if (alloc->is_AllocateArray())
1457 tty->print_cr("++++ Eliminated: %d AllocateArray", alloc->_idx);
1458 else
1459 tty->print_cr("++++ Eliminated: %d Allocate", alloc->_idx);
1460 }
1461 #endif
1462
1463 return true;
1464 }
1465
1466 bool PhaseMacroExpand::eliminate_boxing_node(CallStaticJavaNode *boxing) {
1467 // EA should remove all uses of non-escaping boxing node.
1468 if (!C->eliminate_boxing() || boxing->proj_out_or_null(TypeFunc::Parms) != nullptr) {
1469 return false;
1470 }
1471
1472 assert(boxing->result_cast() == nullptr, "unexpected boxing node result");
1473
1474 _callprojs = boxing->extract_projections(false /*separate_io_proj*/, false /*do_asserts*/);
1475
1476 const TypeTuple* r = boxing->tf()->range_sig();
1477 assert(r->cnt() > TypeFunc::Parms, "sanity");
1478 const TypeInstPtr* t = r->field_at(TypeFunc::Parms)->isa_instptr();
1479 assert(t != nullptr, "sanity");
1480
1481 CompileLog* log = C->log();
1482 if (log != nullptr) {
1483 log->head("eliminate_boxing type='%d'",
1484 log->identify(t->instance_klass()));
1485 JVMState* p = boxing->jvms();
1486 while (p != nullptr) {
1487 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
1488 p = p->caller();
1489 }
1490 log->tail("eliminate_boxing");
1491 }
1492
1493 process_users_of_allocation(boxing);
1494
1495 #ifndef PRODUCT
1496 if (PrintEliminateAllocations) {
1560 // oop flavor.
1561 //
1562 //=============================================================================
1563 // FastAllocateSizeLimit value is in DOUBLEWORDS.
1564 // Allocations bigger than this always go the slow route.
1565 // This value must be small enough that allocation attempts that need to
1566 // trigger exceptions go the slow route. Also, it must be small enough so
1567 // that heap_top + size_in_bytes does not wrap around the 4Gig limit.
1568 //=============================================================================j//
1569 // %%% Here is an old comment from parseHelper.cpp; is it outdated?
1570 // The allocator will coalesce int->oop copies away. See comment in
1571 // coalesce.cpp about how this works. It depends critically on the exact
1572 // code shape produced here, so if you are changing this code shape
1573 // make sure the GC info for the heap-top is correct in and around the
1574 // slow-path call.
1575 //
1576
1577 void PhaseMacroExpand::expand_allocate_common(
1578 AllocateNode* alloc, // allocation node to be expanded
1579 Node* length, // array length for an array allocation
1580 Node* init_val, // value to initialize the array with
1581 const TypeFunc* slow_call_type, // Type of slow call
1582 address slow_call_address, // Address of slow call
1583 Node* valid_length_test // whether length is valid or not
1584 )
1585 {
1586 Node* ctrl = alloc->in(TypeFunc::Control);
1587 Node* mem = alloc->in(TypeFunc::Memory);
1588 Node* i_o = alloc->in(TypeFunc::I_O);
1589 Node* size_in_bytes = alloc->in(AllocateNode::AllocSize);
1590 Node* klass_node = alloc->in(AllocateNode::KlassNode);
1591 Node* initial_slow_test = alloc->in(AllocateNode::InitialTest);
1592 assert(ctrl != nullptr, "must have control");
1593
1594 // We need a Region and corresponding Phi's to merge the slow-path and fast-path results.
1595 // they will not be used if "always_slow" is set
1596 enum { slow_result_path = 1, fast_result_path = 2 };
1597 Node *result_region = nullptr;
1598 Node *result_phi_rawmem = nullptr;
1599 Node *result_phi_rawoop = nullptr;
1600 Node *result_phi_i_o = nullptr;
1643 #endif
1644 yank_alloc_node(alloc);
1645 return;
1646 }
1647 }
1648
1649 enum { too_big_or_final_path = 1, need_gc_path = 2 };
1650 Node *slow_region = nullptr;
1651 Node *toobig_false = ctrl;
1652
1653 // generate the initial test if necessary
1654 if (initial_slow_test != nullptr ) {
1655 assert (expand_fast_path, "Only need test if there is a fast path");
1656 slow_region = new RegionNode(3);
1657
1658 // Now make the initial failure test. Usually a too-big test but
1659 // might be a TRUE for finalizers.
1660 IfNode *toobig_iff = new IfNode(ctrl, initial_slow_test, PROB_MIN, COUNT_UNKNOWN);
1661 transform_later(toobig_iff);
1662 // Plug the failing-too-big test into the slow-path region
1663 Node* toobig_true = new IfTrueNode(toobig_iff);
1664 transform_later(toobig_true);
1665 slow_region ->init_req( too_big_or_final_path, toobig_true );
1666 toobig_false = new IfFalseNode(toobig_iff);
1667 transform_later(toobig_false);
1668 } else {
1669 // No initial test, just fall into next case
1670 assert(allocation_has_use || !expand_fast_path, "Should already have been handled");
1671 toobig_false = ctrl;
1672 DEBUG_ONLY(slow_region = NodeSentinel);
1673 }
1674
1675 // If we are here there are several possibilities
1676 // - expand_fast_path is false - then only a slow path is expanded. That's it.
1677 // no_initial_check means a constant allocation.
1678 // - If check always evaluates to false -> expand_fast_path is false (see above)
1679 // - If check always evaluates to true -> directly into fast path (but may bailout to slowpath)
1680 // if !allocation_has_use the fast path is empty
1681 // if !allocation_has_use && no_initial_check
1682 // - Then there are no fastpath that can fall out to slowpath -> no allocation code at all.
1683 // removed by yank_alloc_node above.
1684
1685 Node *slow_mem = mem; // save the current memory state for slow path
1686 // generate the fast allocation code unless we know that the initial test will always go slow
1687 if (expand_fast_path) {
1688 // Fast path modifies only raw memory.
1689 if (mem->is_MergeMem()) {
1690 mem = mem->as_MergeMem()->memory_at(Compile::AliasIdxRaw);
1691 }
1692
1693 // allocate the Region and Phi nodes for the result
1694 result_region = new RegionNode(3);
1695 result_phi_rawmem = new PhiNode(result_region, Type::MEMORY, TypeRawPtr::BOTTOM);
1696 result_phi_i_o = new PhiNode(result_region, Type::ABIO); // I/O is used for Prefetch
1697
1698 // Grab regular I/O before optional prefetch may change it.
1699 // Slow-path does no I/O so just set it to the original I/O.
1700 result_phi_i_o->init_req(slow_result_path, i_o);
1701
1702 // Name successful fast-path variables
1703 Node* fast_oop_ctrl;
1704 Node* fast_oop_rawmem;
1705
1706 if (allocation_has_use) {
1707 Node* needgc_ctrl = nullptr;
1708 result_phi_rawoop = new PhiNode(result_region, TypeRawPtr::BOTTOM);
1709
1710 intx prefetch_lines = length != nullptr ? AllocatePrefetchLines : AllocateInstancePrefetchLines;
1711 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
1712 Node* fast_oop = bs->obj_allocate(this, mem, toobig_false, size_in_bytes, i_o, needgc_ctrl,
1713 fast_oop_ctrl, fast_oop_rawmem,
1714 prefetch_lines);
1715
1716 if (initial_slow_test != nullptr) {
1717 // This completes all paths into the slow merge point
1718 slow_region->init_req(need_gc_path, needgc_ctrl);
1719 transform_later(slow_region);
1720 } else {
1721 // No initial slow path needed!
1722 // Just fall from the need-GC path straight into the VM call.
1723 slow_region = needgc_ctrl;
1724 }
1725
1743 result_phi_i_o ->init_req(fast_result_path, i_o);
1744 result_phi_rawmem->init_req(fast_result_path, fast_oop_rawmem);
1745 } else {
1746 slow_region = ctrl;
1747 result_phi_i_o = i_o; // Rename it to use in the following code.
1748 }
1749
1750 // Generate slow-path call
1751 CallNode *call = new CallStaticJavaNode(slow_call_type, slow_call_address,
1752 OptoRuntime::stub_name(slow_call_address),
1753 TypePtr::BOTTOM);
1754 call->init_req(TypeFunc::Control, slow_region);
1755 call->init_req(TypeFunc::I_O, top()); // does no i/o
1756 call->init_req(TypeFunc::Memory, slow_mem); // may gc ptrs
1757 call->init_req(TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr));
1758 call->init_req(TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr));
1759
1760 call->init_req(TypeFunc::Parms+0, klass_node);
1761 if (length != nullptr) {
1762 call->init_req(TypeFunc::Parms+1, length);
1763 if (init_val != nullptr) {
1764 call->init_req(TypeFunc::Parms+2, init_val);
1765 }
1766 } else {
1767 // Let the runtime know if this is a larval allocation
1768 call->init_req(TypeFunc::Parms+1, _igvn.intcon(alloc->_larval));
1769 }
1770
1771 // Copy debug information and adjust JVMState information, then replace
1772 // allocate node with the call
1773 call->copy_call_debug_info(&_igvn, alloc);
1774 // For array allocations, copy the valid length check to the call node so Compile::final_graph_reshaping() can verify
1775 // that the call has the expected number of CatchProj nodes (in case the allocation always fails and the fallthrough
1776 // path dies).
1777 if (valid_length_test != nullptr) {
1778 call->add_req(valid_length_test);
1779 }
1780 if (expand_fast_path) {
1781 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
1782 } else {
1783 // Hook i_o projection to avoid its elimination during allocation
1784 // replacement (when only a slow call is generated).
1785 call->set_req(TypeFunc::I_O, result_phi_i_o);
1786 }
1787 _igvn.replace_node(alloc, call);
1788 transform_later(call);
1789
1790 // Identify the output projections from the allocate node and
1791 // adjust any references to them.
1792 // The control and io projections look like:
1793 //
1794 // v---Proj(ctrl) <-----+ v---CatchProj(ctrl)
1795 // Allocate Catch
1796 // ^---Proj(io) <-------+ ^---CatchProj(io)
1797 //
1798 // We are interested in the CatchProj nodes.
1799 //
1800 _callprojs = call->extract_projections(false /*separate_io_proj*/, false /*do_asserts*/);
1801
1802 // An allocate node has separate memory projections for the uses on
1803 // the control and i_o paths. Replace the control memory projection with
1804 // result_phi_rawmem (unless we are only generating a slow call when
1805 // both memory projections are combined)
1806 if (expand_fast_path && _callprojs->fallthrough_memproj != nullptr) {
1807 _igvn.replace_in_uses(_callprojs->fallthrough_memproj, result_phi_rawmem);
1808 }
1809 // Now change uses of catchall_memproj to use fallthrough_memproj and delete
1810 // catchall_memproj so we end up with a call that has only 1 memory projection.
1811 if (_callprojs->catchall_memproj != nullptr) {
1812 if (_callprojs->fallthrough_memproj == nullptr) {
1813 _callprojs->fallthrough_memproj = new ProjNode(call, TypeFunc::Memory);
1814 transform_later(_callprojs->fallthrough_memproj);
1815 }
1816 _igvn.replace_in_uses(_callprojs->catchall_memproj, _callprojs->fallthrough_memproj);
1817 _igvn.remove_dead_node(_callprojs->catchall_memproj);
1818 }
1819
1820 // An allocate node has separate i_o projections for the uses on the control
1821 // and i_o paths. Always replace the control i_o projection with result i_o
1822 // otherwise incoming i_o become dead when only a slow call is generated
1823 // (it is different from memory projections where both projections are
1824 // combined in such case).
1825 if (_callprojs->fallthrough_ioproj != nullptr) {
1826 _igvn.replace_in_uses(_callprojs->fallthrough_ioproj, result_phi_i_o);
1827 }
1828 // Now change uses of catchall_ioproj to use fallthrough_ioproj and delete
1829 // catchall_ioproj so we end up with a call that has only 1 i_o projection.
1830 if (_callprojs->catchall_ioproj != nullptr) {
1831 if (_callprojs->fallthrough_ioproj == nullptr) {
1832 _callprojs->fallthrough_ioproj = new ProjNode(call, TypeFunc::I_O);
1833 transform_later(_callprojs->fallthrough_ioproj);
1834 }
1835 _igvn.replace_in_uses(_callprojs->catchall_ioproj, _callprojs->fallthrough_ioproj);
1836 _igvn.remove_dead_node(_callprojs->catchall_ioproj);
1837 }
1838
1839 // if we generated only a slow call, we are done
1840 if (!expand_fast_path) {
1841 // Now we can unhook i_o.
1842 if (result_phi_i_o->outcnt() > 1) {
1843 call->set_req(TypeFunc::I_O, top());
1844 } else {
1845 assert(result_phi_i_o->unique_ctrl_out() == call, "sanity");
1846 // Case of new array with negative size known during compilation.
1847 // AllocateArrayNode::Ideal() optimization disconnect unreachable
1848 // following code since call to runtime will throw exception.
1849 // As result there will be no users of i_o after the call.
1850 // Leave i_o attached to this call to avoid problems in preceding graph.
1851 }
1852 return;
1853 }
1854
1855 if (_callprojs->fallthrough_catchproj != nullptr) {
1856 ctrl = _callprojs->fallthrough_catchproj->clone();
1857 transform_later(ctrl);
1858 _igvn.replace_node(_callprojs->fallthrough_catchproj, result_region);
1859 } else {
1860 ctrl = top();
1861 }
1862 Node *slow_result;
1863 if (_callprojs->resproj[0] == nullptr) {
1864 // no uses of the allocation result
1865 slow_result = top();
1866 } else {
1867 slow_result = _callprojs->resproj[0]->clone();
1868 transform_later(slow_result);
1869 _igvn.replace_node(_callprojs->resproj[0], result_phi_rawoop);
1870 }
1871
1872 // Plug slow-path into result merge point
1873 result_region->init_req( slow_result_path, ctrl);
1874 transform_later(result_region);
1875 if (allocation_has_use) {
1876 result_phi_rawoop->init_req(slow_result_path, slow_result);
1877 transform_later(result_phi_rawoop);
1878 }
1879 result_phi_rawmem->init_req(slow_result_path, _callprojs->fallthrough_memproj);
1880 transform_later(result_phi_rawmem);
1881 transform_later(result_phi_i_o);
1882 // This completes all paths into the result merge point
1883 }
1884
1885 // Remove alloc node that has no uses.
1886 void PhaseMacroExpand::yank_alloc_node(AllocateNode* alloc) {
1887 Node* ctrl = alloc->in(TypeFunc::Control);
1888 Node* mem = alloc->in(TypeFunc::Memory);
1889 Node* i_o = alloc->in(TypeFunc::I_O);
1890
1891 _callprojs = alloc->extract_projections(false /*separate_io_proj*/, false /*do_asserts*/);
1892 if (_callprojs->resproj[0] != nullptr) {
1893 for (DUIterator_Fast imax, i = _callprojs->resproj[0]->fast_outs(imax); i < imax; i++) {
1894 Node* use = _callprojs->resproj[0]->fast_out(i);
1895 use->isa_MemBar()->remove(&_igvn);
1896 --imax;
1897 --i; // back up iterator
1898 }
1899 assert(_callprojs->resproj[0]->outcnt() == 0, "all uses must be deleted");
1900 _igvn.remove_dead_node(_callprojs->resproj[0]);
1901 }
1902 if (_callprojs->fallthrough_catchproj != nullptr) {
1903 _igvn.replace_in_uses(_callprojs->fallthrough_catchproj, ctrl);
1904 _igvn.remove_dead_node(_callprojs->fallthrough_catchproj);
1905 }
1906 if (_callprojs->catchall_catchproj != nullptr) {
1907 _igvn.rehash_node_delayed(_callprojs->catchall_catchproj);
1908 _callprojs->catchall_catchproj->set_req(0, top());
1909 }
1910 if (_callprojs->fallthrough_proj != nullptr) {
1911 Node* catchnode = _callprojs->fallthrough_proj->unique_ctrl_out();
1912 _igvn.remove_dead_node(catchnode);
1913 _igvn.remove_dead_node(_callprojs->fallthrough_proj);
1914 }
1915 if (_callprojs->fallthrough_memproj != nullptr) {
1916 _igvn.replace_in_uses(_callprojs->fallthrough_memproj, mem);
1917 _igvn.remove_dead_node(_callprojs->fallthrough_memproj);
1918 }
1919 if (_callprojs->fallthrough_ioproj != nullptr) {
1920 _igvn.replace_in_uses(_callprojs->fallthrough_ioproj, i_o);
1921 _igvn.remove_dead_node(_callprojs->fallthrough_ioproj);
1922 }
1923 if (_callprojs->catchall_memproj != nullptr) {
1924 _igvn.rehash_node_delayed(_callprojs->catchall_memproj);
1925 _callprojs->catchall_memproj->set_req(0, top());
1926 }
1927 if (_callprojs->catchall_ioproj != nullptr) {
1928 _igvn.rehash_node_delayed(_callprojs->catchall_ioproj);
1929 _callprojs->catchall_ioproj->set_req(0, top());
1930 }
1931 #ifndef PRODUCT
1932 if (PrintEliminateAllocations) {
1933 if (alloc->is_AllocateArray()) {
1934 tty->print_cr("++++ Eliminated: %d AllocateArray", alloc->_idx);
1935 } else {
1936 tty->print_cr("++++ Eliminated: %d Allocate", alloc->_idx);
1937 }
1938 }
1939 #endif
1940 _igvn.remove_dead_node(alloc);
1941 }
1942
1943 void PhaseMacroExpand::expand_initialize_membar(AllocateNode* alloc, InitializeNode* init,
1944 Node*& fast_oop_ctrl, Node*& fast_oop_rawmem) {
1945 // If initialization is performed by an array copy, any required
1946 // MemBarStoreStore was already added. If the object does not
1947 // escape no need for a MemBarStoreStore. If the object does not
1948 // escape in its initializer and memory barrier (MemBarStoreStore or
1949 // stronger) is already added at exit of initializer, also no need
2043 Node* thread = new ThreadLocalNode();
2044 transform_later(thread);
2045
2046 call->init_req(TypeFunc::Parms + 0, thread);
2047 call->init_req(TypeFunc::Parms + 1, oop);
2048 call->init_req(TypeFunc::Control, ctrl);
2049 call->init_req(TypeFunc::I_O , top()); // does no i/o
2050 call->init_req(TypeFunc::Memory , rawmem);
2051 call->init_req(TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr));
2052 call->init_req(TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr));
2053 transform_later(call);
2054 ctrl = new ProjNode(call, TypeFunc::Control);
2055 transform_later(ctrl);
2056 rawmem = new ProjNode(call, TypeFunc::Memory);
2057 transform_later(rawmem);
2058 }
2059 }
2060
2061 // Helper for PhaseMacroExpand::expand_allocate_common.
2062 // Initializes the newly-allocated storage.
2063 Node* PhaseMacroExpand::initialize_object(AllocateNode* alloc,
2064 Node* control, Node* rawmem, Node* object,
2065 Node* klass_node, Node* length,
2066 Node* size_in_bytes) {
2067 InitializeNode* init = alloc->initialization();
2068 // Store the klass & mark bits
2069 Node* mark_node = alloc->make_ideal_mark(&_igvn, control, rawmem);
2070 if (!mark_node->is_Con()) {
2071 transform_later(mark_node);
2072 }
2073 rawmem = make_store(control, rawmem, object, oopDesc::mark_offset_in_bytes(), mark_node, TypeX_X->basic_type());
2074
2075 if (!UseCompactObjectHeaders) {
2076 rawmem = make_store(control, rawmem, object, oopDesc::klass_offset_in_bytes(), klass_node, T_METADATA);
2077 }
2078 int header_size = alloc->minimum_header_size(); // conservatively small
2079
2080 // Array length
2081 if (length != nullptr) { // Arrays need length field
2082 rawmem = make_store(control, rawmem, object, arrayOopDesc::length_offset_in_bytes(), length, T_INT);
2083 // conservatively small header size:
2084 header_size = arrayOopDesc::base_offset_in_bytes(T_BYTE);
2085 if (_igvn.type(klass_node)->isa_aryklassptr()) { // we know the exact header size in most cases:
2086 BasicType elem = _igvn.type(klass_node)->is_klassptr()->as_instance_type()->isa_aryptr()->elem()->array_element_basic_type();
2087 if (is_reference_type(elem, true)) {
2088 elem = T_OBJECT;
2089 }
2090 header_size = Klass::layout_helper_header_size(Klass::array_layout_helper(elem));
2091 }
2092 }
2093
2094 // Clear the object body, if necessary.
2095 if (init == nullptr) {
2096 // The init has somehow disappeared; be cautious and clear everything.
2097 //
2098 // This can happen if a node is allocated but an uncommon trap occurs
2099 // immediately. In this case, the Initialize gets associated with the
2100 // trap, and may be placed in a different (outer) loop, if the Allocate
2101 // is in a loop. If (this is rare) the inner loop gets unrolled, then
2102 // there can be two Allocates to one Initialize. The answer in all these
2103 // edge cases is safety first. It is always safe to clear immediately
2104 // within an Allocate, and then (maybe or maybe not) clear some more later.
2105 if (!(UseTLAB && ZeroTLAB)) {
2106 rawmem = ClearArrayNode::clear_memory(control, rawmem, object,
2107 alloc->in(AllocateNode::InitValue),
2108 alloc->in(AllocateNode::RawInitValue),
2109 header_size, size_in_bytes,
2110 &_igvn);
2111 }
2112 } else {
2113 if (!init->is_complete()) {
2114 // Try to win by zeroing only what the init does not store.
2115 // We can also try to do some peephole optimizations,
2116 // such as combining some adjacent subword stores.
2117 rawmem = init->complete_stores(control, rawmem, object,
2118 header_size, size_in_bytes, &_igvn);
2119 }
2120 // We have no more use for this link, since the AllocateNode goes away:
2121 init->set_req(InitializeNode::RawAddress, top());
2122 // (If we keep the link, it just confuses the register allocator,
2123 // who thinks he sees a real use of the address by the membar.)
2124 }
2125
2126 return rawmem;
2127 }
2128
2263 for ( intx i = 0; i < lines; i++ ) {
2264 prefetch_adr = new AddPNode( old_eden_top, new_eden_top,
2265 _igvn.MakeConX(distance) );
2266 transform_later(prefetch_adr);
2267 prefetch = new PrefetchAllocationNode( i_o, prefetch_adr );
2268 // Do not let it float too high, since if eden_top == eden_end,
2269 // both might be null.
2270 if( i == 0 ) { // Set control for first prefetch, next follows it
2271 prefetch->init_req(0, needgc_false);
2272 }
2273 transform_later(prefetch);
2274 distance += step_size;
2275 i_o = prefetch;
2276 }
2277 }
2278 return i_o;
2279 }
2280
2281
2282 void PhaseMacroExpand::expand_allocate(AllocateNode *alloc) {
2283 expand_allocate_common(alloc, nullptr, nullptr,
2284 OptoRuntime::new_instance_Type(),
2285 OptoRuntime::new_instance_Java(), nullptr);
2286 }
2287
2288 void PhaseMacroExpand::expand_allocate_array(AllocateArrayNode *alloc) {
2289 Node* length = alloc->in(AllocateNode::ALength);
2290 Node* valid_length_test = alloc->in(AllocateNode::ValidLengthTest);
2291 InitializeNode* init = alloc->initialization();
2292 Node* klass_node = alloc->in(AllocateNode::KlassNode);
2293 Node* init_value = alloc->in(AllocateNode::InitValue);
2294 const TypeAryKlassPtr* ary_klass_t = _igvn.type(klass_node)->isa_aryklassptr();
2295 assert(!ary_klass_t || !ary_klass_t->klass_is_exact() || !ary_klass_t->exact_klass()->is_obj_array_klass() ||
2296 ary_klass_t->is_refined_type(), "Must be a refined array klass");
2297 const TypeFunc* slow_call_type;
2298 address slow_call_address; // Address of slow call
2299 if (init != nullptr && init->is_complete_with_arraycopy() &&
2300 ary_klass_t && ary_klass_t->elem()->isa_klassptr() == nullptr) {
2301 // Don't zero type array during slow allocation in VM since
2302 // it will be initialized later by arraycopy in compiled code.
2303 slow_call_address = OptoRuntime::new_array_nozero_Java();
2304 slow_call_type = OptoRuntime::new_array_nozero_Type();
2305 } else {
2306 slow_call_address = OptoRuntime::new_array_Java();
2307 slow_call_type = OptoRuntime::new_array_Type();
2308
2309 if (init_value == nullptr) {
2310 init_value = _igvn.zerocon(T_OBJECT);
2311 } else if (UseCompressedOops) {
2312 init_value = transform_later(new DecodeNNode(init_value, init_value->bottom_type()->make_ptr()));
2313 }
2314 }
2315 expand_allocate_common(alloc, length, init_value,
2316 slow_call_type,
2317 slow_call_address, valid_length_test);
2318 }
2319
2320 //-------------------mark_eliminated_box----------------------------------
2321 //
2322 // During EA obj may point to several objects but after few ideal graph
2323 // transformations (CCP) it may point to only one non escaping object
2324 // (but still using phi), corresponding locks and unlocks will be marked
2325 // for elimination. Later obj could be replaced with a new node (new phi)
2326 // and which does not have escape information. And later after some graph
2327 // reshape other locks and unlocks (which were not marked for elimination
2328 // before) are connected to this new obj (phi) but they still will not be
2329 // marked for elimination since new obj has no escape information.
2330 // Mark all associated (same box and obj) lock and unlock nodes for
2331 // elimination if some of them marked already.
2332 void PhaseMacroExpand::mark_eliminated_box(Node* box, Node* obj) {
2333 BoxLockNode* oldbox = box->as_BoxLock();
2334 if (oldbox->is_eliminated()) {
2335 return; // This BoxLock node was processed already.
2336 }
2508 #ifdef ASSERT
2509 if (!alock->is_coarsened()) {
2510 // Check that new "eliminated" BoxLock node is created.
2511 BoxLockNode* oldbox = alock->box_node()->as_BoxLock();
2512 assert(oldbox->is_eliminated(), "should be done already");
2513 }
2514 #endif
2515
2516 alock->log_lock_optimization(C, "eliminate_lock");
2517
2518 #ifndef PRODUCT
2519 if (PrintEliminateLocks) {
2520 tty->print_cr("++++ Eliminated: %d %s '%s'", alock->_idx, (alock->is_Lock() ? "Lock" : "Unlock"), alock->kind_as_string());
2521 }
2522 #endif
2523
2524 Node* mem = alock->in(TypeFunc::Memory);
2525 Node* ctrl = alock->in(TypeFunc::Control);
2526 guarantee(ctrl != nullptr, "missing control projection, cannot replace_node() with null");
2527
2528 _callprojs = alock->extract_projections(false /*separate_io_proj*/, false /*do_asserts*/);
2529 // There are 2 projections from the lock. The lock node will
2530 // be deleted when its last use is subsumed below.
2531 assert(alock->outcnt() == 2 &&
2532 _callprojs->fallthrough_proj != nullptr &&
2533 _callprojs->fallthrough_memproj != nullptr,
2534 "Unexpected projections from Lock/Unlock");
2535
2536 Node* fallthroughproj = _callprojs->fallthrough_proj;
2537 Node* memproj_fallthrough = _callprojs->fallthrough_memproj;
2538
2539 // The memory projection from a lock/unlock is RawMem
2540 // The input to a Lock is merged memory, so extract its RawMem input
2541 // (unless the MergeMem has been optimized away.)
2542 if (alock->is_Lock()) {
2543 // Search for MemBarAcquireLock node and delete it also.
2544 MemBarNode* membar = fallthroughproj->unique_ctrl_out()->as_MemBar();
2545 assert(membar != nullptr && membar->Opcode() == Op_MemBarAcquireLock, "");
2546 Node* ctrlproj = membar->proj_out(TypeFunc::Control);
2547 Node* memproj = membar->proj_out(TypeFunc::Memory);
2548 _igvn.replace_node(ctrlproj, fallthroughproj);
2549 _igvn.replace_node(memproj, memproj_fallthrough);
2550
2551 // Delete FastLock node also if this Lock node is unique user
2552 // (a loop peeling may clone a Lock node).
2553 Node* flock = alock->as_Lock()->fastlock_node();
2554 if (flock->outcnt() == 1) {
2555 assert(flock->unique_out() == alock, "sanity");
2556 _igvn.replace_node(flock, top());
2557 }
2588 assert(!box->as_BoxLock()->is_eliminated(), "sanity");
2589
2590 // Make the merge point
2591 Node *region;
2592 Node *mem_phi;
2593 Node *slow_path;
2594
2595 region = new RegionNode(3);
2596 // create a Phi for the memory state
2597 mem_phi = new PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
2598
2599 // Optimize test; set region slot 2
2600 slow_path = opt_bits_test(ctrl, region, 2, flock);
2601 mem_phi->init_req(2, mem);
2602
2603 // Make slow path call
2604 CallNode* call = make_slow_call(lock, OptoRuntime::complete_monitor_enter_Type(),
2605 OptoRuntime::complete_monitor_locking_Java(), nullptr, slow_path,
2606 obj, box, nullptr);
2607
2608 _callprojs = call->extract_projections(false /*separate_io_proj*/, false /*do_asserts*/);
2609
2610 // Slow path can only throw asynchronous exceptions, which are always
2611 // de-opted. So the compiler thinks the slow-call can never throw an
2612 // exception. If it DOES throw an exception we would need the debug
2613 // info removed first (since if it throws there is no monitor).
2614 assert(_callprojs->fallthrough_ioproj == nullptr && _callprojs->catchall_ioproj == nullptr &&
2615 _callprojs->catchall_memproj == nullptr && _callprojs->catchall_catchproj == nullptr, "Unexpected projection from Lock");
2616
2617 // Capture slow path
2618 // disconnect fall-through projection from call and create a new one
2619 // hook up users of fall-through projection to region
2620 Node *slow_ctrl = _callprojs->fallthrough_proj->clone();
2621 transform_later(slow_ctrl);
2622 _igvn.hash_delete(_callprojs->fallthrough_proj);
2623 _callprojs->fallthrough_proj->disconnect_inputs(C);
2624 region->init_req(1, slow_ctrl);
2625 // region inputs are now complete
2626 transform_later(region);
2627 _igvn.replace_node(_callprojs->fallthrough_proj, region);
2628
2629 Node *memproj = transform_later(new ProjNode(call, TypeFunc::Memory));
2630
2631 mem_phi->init_req(1, memproj);
2632
2633 transform_later(mem_phi);
2634
2635 _igvn.replace_node(_callprojs->fallthrough_memproj, mem_phi);
2636 }
2637
2638 //------------------------------expand_unlock_node----------------------
2639 void PhaseMacroExpand::expand_unlock_node(UnlockNode *unlock) {
2640
2641 Node* ctrl = unlock->in(TypeFunc::Control);
2642 Node* mem = unlock->in(TypeFunc::Memory);
2643 Node* obj = unlock->obj_node();
2644 Node* box = unlock->box_node();
2645
2646 assert(!box->as_BoxLock()->is_eliminated(), "sanity");
2647
2648 // No need for a null check on unlock
2649
2650 // Make the merge point
2651 Node *region;
2652 Node *mem_phi;
2653
2654 region = new RegionNode(3);
2655 // create a Phi for the memory state
2656 mem_phi = new PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
2657
2658 FastUnlockNode *funlock = new FastUnlockNode( ctrl, obj, box );
2659 funlock = transform_later( funlock )->as_FastUnlock();
2660 // Optimize test; set region slot 2
2661 Node *slow_path = opt_bits_test(ctrl, region, 2, funlock);
2662 Node *thread = transform_later(new ThreadLocalNode());
2663
2664 CallNode *call = make_slow_call((CallNode *) unlock, OptoRuntime::complete_monitor_exit_Type(),
2665 CAST_FROM_FN_PTR(address, SharedRuntime::complete_monitor_unlocking_C),
2666 "complete_monitor_unlocking_C", slow_path, obj, box, thread);
2667
2668 _callprojs = call->extract_projections(false /*separate_io_proj*/, false /*do_asserts*/);
2669 assert(_callprojs->fallthrough_ioproj == nullptr && _callprojs->catchall_ioproj == nullptr &&
2670 _callprojs->catchall_memproj == nullptr && _callprojs->catchall_catchproj == nullptr, "Unexpected projection from Lock");
2671
2672 // No exceptions for unlocking
2673 // Capture slow path
2674 // disconnect fall-through projection from call and create a new one
2675 // hook up users of fall-through projection to region
2676 Node *slow_ctrl = _callprojs->fallthrough_proj->clone();
2677 transform_later(slow_ctrl);
2678 _igvn.hash_delete(_callprojs->fallthrough_proj);
2679 _callprojs->fallthrough_proj->disconnect_inputs(C);
2680 region->init_req(1, slow_ctrl);
2681 // region inputs are now complete
2682 transform_later(region);
2683 _igvn.replace_node(_callprojs->fallthrough_proj, region);
2684
2685 Node *memproj = transform_later(new ProjNode(call, TypeFunc::Memory) );
2686 mem_phi->init_req(1, memproj );
2687 mem_phi->init_req(2, mem);
2688 transform_later(mem_phi);
2689
2690 _igvn.replace_node(_callprojs->fallthrough_memproj, mem_phi);
2691 }
2692
2693 // An inline type might be returned from the call but we don't know its
2694 // type. Either we get a buffered inline type (and nothing needs to be done)
2695 // or one of the values being returned is the klass of the inline type
2696 // and we need to allocate an inline type instance of that type and
2697 // initialize it with other values being returned. In that case, we
2698 // first try a fast path allocation and initialize the value with the
2699 // inline klass's pack handler or we fall back to a runtime call.
2700 void PhaseMacroExpand::expand_mh_intrinsic_return(CallStaticJavaNode* call) {
2701 assert(call->method()->is_method_handle_intrinsic(), "must be a method handle intrinsic call");
2702 Node* ret = call->proj_out_or_null(TypeFunc::Parms);
2703 if (ret == nullptr) {
2704 return;
2705 }
2706 const TypeFunc* tf = call->_tf;
2707 const TypeTuple* domain = OptoRuntime::store_inline_type_fields_Type()->domain_cc();
2708 const TypeFunc* new_tf = TypeFunc::make(tf->domain_sig(), tf->domain_cc(), tf->range_sig(), domain);
2709 call->_tf = new_tf;
2710 // Make sure the change of type is applied before projections are processed by igvn
2711 _igvn.set_type(call, call->Value(&_igvn));
2712 _igvn.set_type(ret, ret->Value(&_igvn));
2713
2714 // Before any new projection is added:
2715 CallProjections* projs = call->extract_projections(true, true);
2716
2717 // Create temporary hook nodes that will be replaced below.
2718 // Add an input to prevent hook nodes from being dead.
2719 Node* ctl = new Node(call);
2720 Node* mem = new Node(ctl);
2721 Node* io = new Node(ctl);
2722 Node* ex_ctl = new Node(ctl);
2723 Node* ex_mem = new Node(ctl);
2724 Node* ex_io = new Node(ctl);
2725 Node* res = new Node(ctl);
2726
2727 // Allocate a new buffered inline type only if a new one is not returned
2728 Node* cast = transform_later(new CastP2XNode(ctl, res));
2729 Node* mask = MakeConX(0x1);
2730 Node* masked = transform_later(new AndXNode(cast, mask));
2731 Node* cmp = transform_later(new CmpXNode(masked, mask));
2732 Node* bol = transform_later(new BoolNode(cmp, BoolTest::eq));
2733 IfNode* allocation_iff = new IfNode(ctl, bol, PROB_MAX, COUNT_UNKNOWN);
2734 transform_later(allocation_iff);
2735 Node* allocation_ctl = transform_later(new IfTrueNode(allocation_iff));
2736 Node* no_allocation_ctl = transform_later(new IfFalseNode(allocation_iff));
2737 Node* no_allocation_res = transform_later(new CheckCastPPNode(no_allocation_ctl, res, TypeInstPtr::BOTTOM));
2738
2739 // Try to allocate a new buffered inline instance either from TLAB or eden space
2740 Node* needgc_ctrl = nullptr; // needgc means slowcase, i.e. allocation failed
2741 CallLeafNoFPNode* handler_call;
2742 const bool alloc_in_place = UseTLAB;
2743 if (alloc_in_place) {
2744 Node* fast_oop_ctrl = nullptr;
2745 Node* fast_oop_rawmem = nullptr;
2746 Node* mask2 = MakeConX(-2);
2747 Node* masked2 = transform_later(new AndXNode(cast, mask2));
2748 Node* rawklassptr = transform_later(new CastX2PNode(masked2));
2749 Node* klass_node = transform_later(new CheckCastPPNode(allocation_ctl, rawklassptr, TypeInstKlassPtr::OBJECT_OR_NULL));
2750 Node* layout_val = make_load(nullptr, mem, klass_node, in_bytes(Klass::layout_helper_offset()), TypeInt::INT, T_INT);
2751 Node* size_in_bytes = ConvI2X(layout_val);
2752 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
2753 Node* fast_oop = bs->obj_allocate(this, mem, allocation_ctl, size_in_bytes, io, needgc_ctrl,
2754 fast_oop_ctrl, fast_oop_rawmem,
2755 AllocateInstancePrefetchLines);
2756 // Allocation succeed, initialize buffered inline instance header firstly,
2757 // and then initialize its fields with an inline class specific handler
2758 Node* mark_word_node;
2759 if (UseCompactObjectHeaders) {
2760 // COH: We need to load the prototype from the klass at runtime since it encodes the klass pointer already.
2761 mark_word_node = make_load(fast_oop_ctrl, fast_oop_rawmem, klass_node, in_bytes(Klass::prototype_header_offset()), TypeRawPtr::BOTTOM, T_ADDRESS);
2762 } else {
2763 // Otherwise, use the static prototype.
2764 mark_word_node = makecon(TypeRawPtr::make((address)markWord::inline_type_prototype().value()));
2765 }
2766
2767 fast_oop_rawmem = make_store(fast_oop_ctrl, fast_oop_rawmem, fast_oop, oopDesc::mark_offset_in_bytes(), mark_word_node, T_ADDRESS);
2768 if (!UseCompactObjectHeaders) {
2769 // COH: Everything is encoded in the mark word, so nothing left to do.
2770 fast_oop_rawmem = make_store(fast_oop_ctrl, fast_oop_rawmem, fast_oop, oopDesc::klass_offset_in_bytes(), klass_node, T_METADATA);
2771 if (UseCompressedClassPointers) {
2772 fast_oop_rawmem = make_store(fast_oop_ctrl, fast_oop_rawmem, fast_oop, oopDesc::klass_gap_offset_in_bytes(), intcon(0), T_INT);
2773 }
2774 }
2775 Node* members = make_load(fast_oop_ctrl, fast_oop_rawmem, klass_node, in_bytes(InlineKlass::adr_members_offset()), TypeRawPtr::BOTTOM, T_ADDRESS);
2776 Node* pack_handler = make_load(fast_oop_ctrl, fast_oop_rawmem, members, in_bytes(InlineKlass::pack_handler_offset()), TypeRawPtr::BOTTOM, T_ADDRESS);
2777 handler_call = new CallLeafNoFPNode(OptoRuntime::pack_inline_type_Type(),
2778 nullptr,
2779 "pack handler",
2780 TypeRawPtr::BOTTOM);
2781 handler_call->init_req(TypeFunc::Control, fast_oop_ctrl);
2782 handler_call->init_req(TypeFunc::Memory, fast_oop_rawmem);
2783 handler_call->init_req(TypeFunc::I_O, top());
2784 handler_call->init_req(TypeFunc::FramePtr, call->in(TypeFunc::FramePtr));
2785 handler_call->init_req(TypeFunc::ReturnAdr, top());
2786 handler_call->init_req(TypeFunc::Parms, pack_handler);
2787 handler_call->init_req(TypeFunc::Parms+1, fast_oop);
2788 } else {
2789 needgc_ctrl = allocation_ctl;
2790 }
2791
2792 // Allocation failed, fall back to a runtime call
2793 CallStaticJavaNode* slow_call = new CallStaticJavaNode(OptoRuntime::store_inline_type_fields_Type(),
2794 StubRoutines::store_inline_type_fields_to_buf(),
2795 "store_inline_type_fields",
2796 TypePtr::BOTTOM);
2797 slow_call->init_req(TypeFunc::Control, needgc_ctrl);
2798 slow_call->init_req(TypeFunc::Memory, mem);
2799 slow_call->init_req(TypeFunc::I_O, io);
2800 slow_call->init_req(TypeFunc::FramePtr, call->in(TypeFunc::FramePtr));
2801 slow_call->init_req(TypeFunc::ReturnAdr, call->in(TypeFunc::ReturnAdr));
2802 slow_call->init_req(TypeFunc::Parms, res);
2803
2804 Node* slow_ctl = transform_later(new ProjNode(slow_call, TypeFunc::Control));
2805 Node* slow_mem = transform_later(new ProjNode(slow_call, TypeFunc::Memory));
2806 Node* slow_io = transform_later(new ProjNode(slow_call, TypeFunc::I_O));
2807 Node* slow_res = transform_later(new ProjNode(slow_call, TypeFunc::Parms));
2808 Node* slow_catc = transform_later(new CatchNode(slow_ctl, slow_io, 2));
2809 Node* slow_norm = transform_later(new CatchProjNode(slow_catc, CatchProjNode::fall_through_index, CatchProjNode::no_handler_bci));
2810 Node* slow_excp = transform_later(new CatchProjNode(slow_catc, CatchProjNode::catch_all_index, CatchProjNode::no_handler_bci));
2811
2812 Node* ex_r = new RegionNode(3);
2813 Node* ex_mem_phi = new PhiNode(ex_r, Type::MEMORY, TypePtr::BOTTOM);
2814 Node* ex_io_phi = new PhiNode(ex_r, Type::ABIO);
2815 ex_r->init_req(1, slow_excp);
2816 ex_mem_phi->init_req(1, slow_mem);
2817 ex_io_phi->init_req(1, slow_io);
2818 ex_r->init_req(2, ex_ctl);
2819 ex_mem_phi->init_req(2, ex_mem);
2820 ex_io_phi->init_req(2, ex_io);
2821 transform_later(ex_r);
2822 transform_later(ex_mem_phi);
2823 transform_later(ex_io_phi);
2824
2825 // We don't know how many values are returned. This assumes the
2826 // worst case, that all available registers are used.
2827 for (uint i = TypeFunc::Parms+1; i < domain->cnt(); i++) {
2828 if (domain->field_at(i) == Type::HALF) {
2829 slow_call->init_req(i, top());
2830 if (alloc_in_place) {
2831 handler_call->init_req(i+1, top());
2832 }
2833 continue;
2834 }
2835 Node* proj = transform_later(new ProjNode(call, i));
2836 slow_call->init_req(i, proj);
2837 if (alloc_in_place) {
2838 handler_call->init_req(i+1, proj);
2839 }
2840 }
2841 // We can safepoint at that new call
2842 slow_call->copy_call_debug_info(&_igvn, call);
2843 transform_later(slow_call);
2844 if (alloc_in_place) {
2845 transform_later(handler_call);
2846 }
2847
2848 Node* fast_ctl = nullptr;
2849 Node* fast_res = nullptr;
2850 MergeMemNode* fast_mem = nullptr;
2851 if (alloc_in_place) {
2852 fast_ctl = transform_later(new ProjNode(handler_call, TypeFunc::Control));
2853 Node* rawmem = transform_later(new ProjNode(handler_call, TypeFunc::Memory));
2854 fast_res = transform_later(new ProjNode(handler_call, TypeFunc::Parms));
2855 fast_mem = MergeMemNode::make(mem);
2856 fast_mem->set_memory_at(Compile::AliasIdxRaw, rawmem);
2857 transform_later(fast_mem);
2858 }
2859
2860 Node* r = new RegionNode(alloc_in_place ? 4 : 3);
2861 Node* mem_phi = new PhiNode(r, Type::MEMORY, TypePtr::BOTTOM);
2862 Node* io_phi = new PhiNode(r, Type::ABIO);
2863 Node* res_phi = new PhiNode(r, TypeInstPtr::BOTTOM);
2864 r->init_req(1, no_allocation_ctl);
2865 mem_phi->init_req(1, mem);
2866 io_phi->init_req(1, io);
2867 res_phi->init_req(1, no_allocation_res);
2868 r->init_req(2, slow_norm);
2869 mem_phi->init_req(2, slow_mem);
2870 io_phi->init_req(2, slow_io);
2871 res_phi->init_req(2, slow_res);
2872 if (alloc_in_place) {
2873 r->init_req(3, fast_ctl);
2874 mem_phi->init_req(3, fast_mem);
2875 io_phi->init_req(3, io);
2876 res_phi->init_req(3, fast_res);
2877 }
2878 transform_later(r);
2879 transform_later(mem_phi);
2880 transform_later(io_phi);
2881 transform_later(res_phi);
2882
2883 // Do not let stores that initialize this buffer be reordered with a subsequent
2884 // store that would make this buffer accessible by other threads.
2885 MemBarNode* mb = MemBarNode::make(C, Op_MemBarStoreStore, Compile::AliasIdxBot);
2886 transform_later(mb);
2887 mb->init_req(TypeFunc::Memory, mem_phi);
2888 mb->init_req(TypeFunc::Control, r);
2889 r = new ProjNode(mb, TypeFunc::Control);
2890 transform_later(r);
2891 mem_phi = new ProjNode(mb, TypeFunc::Memory);
2892 transform_later(mem_phi);
2893
2894 assert(projs->nb_resproj == 1, "unexpected number of results");
2895 _igvn.replace_in_uses(projs->fallthrough_catchproj, r);
2896 _igvn.replace_in_uses(projs->fallthrough_memproj, mem_phi);
2897 _igvn.replace_in_uses(projs->fallthrough_ioproj, io_phi);
2898 _igvn.replace_in_uses(projs->resproj[0], res_phi);
2899 _igvn.replace_in_uses(projs->catchall_catchproj, ex_r);
2900 _igvn.replace_in_uses(projs->catchall_memproj, ex_mem_phi);
2901 _igvn.replace_in_uses(projs->catchall_ioproj, ex_io_phi);
2902 // The CatchNode should not use the ex_io_phi. Re-connect it to the catchall_ioproj.
2903 Node* cn = projs->fallthrough_catchproj->in(0);
2904 _igvn.replace_input_of(cn, 1, projs->catchall_ioproj);
2905
2906 _igvn.replace_node(ctl, projs->fallthrough_catchproj);
2907 _igvn.replace_node(mem, projs->fallthrough_memproj);
2908 _igvn.replace_node(io, projs->fallthrough_ioproj);
2909 _igvn.replace_node(res, projs->resproj[0]);
2910 _igvn.replace_node(ex_ctl, projs->catchall_catchproj);
2911 _igvn.replace_node(ex_mem, projs->catchall_memproj);
2912 _igvn.replace_node(ex_io, projs->catchall_ioproj);
2913 }
2914
2915 void PhaseMacroExpand::expand_subtypecheck_node(SubTypeCheckNode *check) {
2916 assert(check->in(SubTypeCheckNode::Control) == nullptr, "should be pinned");
2917 Node* bol = check->unique_out();
2918 Node* obj_or_subklass = check->in(SubTypeCheckNode::ObjOrSubKlass);
2919 Node* superklass = check->in(SubTypeCheckNode::SuperKlass);
2920 assert(bol->is_Bool() && bol->as_Bool()->_test._test == BoolTest::ne, "unexpected bool node");
2921
2922 for (DUIterator_Last imin, i = bol->last_outs(imin); i >= imin; --i) {
2923 Node* iff = bol->last_out(i);
2924 assert(iff->is_If(), "where's the if?");
2925
2926 if (iff->in(0)->is_top()) {
2927 _igvn.replace_input_of(iff, 1, C->top());
2928 continue;
2929 }
2930
2931 IfTrueNode* iftrue = iff->as_If()->true_proj();
2932 IfFalseNode* iffalse = iff->as_If()->false_proj();
2933 Node* ctrl = iff->in(0);
2934
2935 Node* subklass = nullptr;
2936 if (_igvn.type(obj_or_subklass)->isa_klassptr()) {
2937 subklass = obj_or_subklass;
2938 } else {
2939 Node* k_adr = basic_plus_adr(obj_or_subklass, oopDesc::klass_offset_in_bytes());
2940 subklass = _igvn.transform(LoadKlassNode::make(_igvn, C->immutable_memory(), k_adr, TypeInstPtr::KLASS, TypeInstKlassPtr::OBJECT));
2941 }
2942
2943 Node* not_subtype_ctrl = Phase::gen_subtype_check(subklass, superklass, &ctrl, nullptr, _igvn, check->method(), check->bci());
2944
2945 _igvn.replace_input_of(iff, 0, C->top());
2946 _igvn.replace_node(iftrue, not_subtype_ctrl);
2947 _igvn.replace_node(iffalse, ctrl);
2948 }
2949 _igvn.replace_node(check, C->top());
2950 }
2951
2952 // FlatArrayCheckNode (array1 array2 ...) is expanded into:
2953 //
2954 // long mark = array1.mark | array2.mark | ...;
2955 // long locked_bit = markWord::unlocked_value & array1.mark & array2.mark & ...;
2956 // if (locked_bit == 0) {
2957 // // One array is locked, load prototype header from the klass
2958 // mark = array1.klass.proto | array2.klass.proto | ...
2959 // }
2960 // if ((mark & markWord::flat_array_bit_in_place) == 0) {
2961 // ...
2962 // }
2963 void PhaseMacroExpand::expand_flatarraycheck_node(FlatArrayCheckNode* check) {
2964 bool array_inputs = _igvn.type(check->in(FlatArrayCheckNode::ArrayOrKlass))->isa_oopptr() != nullptr;
2965 if (array_inputs) {
2966 Node* mark = MakeConX(0);
2967 Node* locked_bit = MakeConX(markWord::unlocked_value);
2968 Node* mem = check->in(FlatArrayCheckNode::Memory);
2969 for (uint i = FlatArrayCheckNode::ArrayOrKlass; i < check->req(); ++i) {
2970 Node* ary = check->in(i);
2971 const TypeOopPtr* t = _igvn.type(ary)->isa_oopptr();
2972 assert(t != nullptr, "Mixing array and klass inputs");
2973 assert(!t->is_flat() && !t->is_not_flat(), "Should have been optimized out");
2974 Node* mark_adr = basic_plus_adr(ary, oopDesc::mark_offset_in_bytes());
2975 Node* mark_load = _igvn.transform(LoadNode::make(_igvn, nullptr, mem, mark_adr, mark_adr->bottom_type()->is_ptr(), TypeX_X, TypeX_X->basic_type(), MemNode::unordered));
2976 mark = _igvn.transform(new OrXNode(mark, mark_load));
2977 locked_bit = _igvn.transform(new AndXNode(locked_bit, mark_load));
2978 }
2979 assert(!mark->is_Con(), "Should have been optimized out");
2980 Node* cmp = _igvn.transform(new CmpXNode(locked_bit, MakeConX(0)));
2981 Node* is_unlocked = _igvn.transform(new BoolNode(cmp, BoolTest::ne));
2982
2983 // BoolNode might be shared, replace each if user
2984 Node* old_bol = check->unique_out();
2985 assert(old_bol->is_Bool() && old_bol->as_Bool()->_test._test == BoolTest::ne, "unexpected condition");
2986 for (DUIterator_Last imin, i = old_bol->last_outs(imin); i >= imin; --i) {
2987 IfNode* old_iff = old_bol->last_out(i)->as_If();
2988 Node* ctrl = old_iff->in(0);
2989 RegionNode* region = new RegionNode(3);
2990 Node* mark_phi = new PhiNode(region, TypeX_X);
2991
2992 // Check if array is unlocked
2993 IfNode* iff = _igvn.transform(new IfNode(ctrl, is_unlocked, PROB_MAX, COUNT_UNKNOWN))->as_If();
2994
2995 // Unlocked: Use bits from mark word
2996 region->init_req(1, _igvn.transform(new IfTrueNode(iff)));
2997 mark_phi->init_req(1, mark);
2998
2999 // Locked: Load prototype header from klass
3000 ctrl = _igvn.transform(new IfFalseNode(iff));
3001 Node* proto = MakeConX(0);
3002 for (uint i = FlatArrayCheckNode::ArrayOrKlass; i < check->req(); ++i) {
3003 Node* ary = check->in(i);
3004 // Make loads control dependent to make sure they are only executed if array is locked
3005 Node* klass_adr = basic_plus_adr(ary, oopDesc::klass_offset_in_bytes());
3006 Node* klass = _igvn.transform(LoadKlassNode::make(_igvn, C->immutable_memory(), klass_adr, TypeInstPtr::KLASS, TypeInstKlassPtr::OBJECT));
3007 Node* proto_adr = basic_plus_adr(klass, in_bytes(Klass::prototype_header_offset()));
3008 Node* proto_load = _igvn.transform(LoadNode::make(_igvn, ctrl, C->immutable_memory(), proto_adr, proto_adr->bottom_type()->is_ptr(), TypeX_X, TypeX_X->basic_type(), MemNode::unordered));
3009 proto = _igvn.transform(new OrXNode(proto, proto_load));
3010 }
3011 region->init_req(2, ctrl);
3012 mark_phi->init_req(2, proto);
3013
3014 // Check if flat array bits are set
3015 Node* mask = MakeConX(markWord::flat_array_bit_in_place);
3016 Node* masked = _igvn.transform(new AndXNode(_igvn.transform(mark_phi), mask));
3017 cmp = _igvn.transform(new CmpXNode(masked, MakeConX(0)));
3018 Node* is_not_flat = _igvn.transform(new BoolNode(cmp, BoolTest::eq));
3019
3020 ctrl = _igvn.transform(region);
3021 iff = _igvn.transform(new IfNode(ctrl, is_not_flat, PROB_MAX, COUNT_UNKNOWN))->as_If();
3022 _igvn.replace_node(old_iff, iff);
3023 }
3024 _igvn.replace_node(check, C->top());
3025 } else {
3026 // Fall back to layout helper check
3027 Node* lhs = intcon(0);
3028 for (uint i = FlatArrayCheckNode::ArrayOrKlass; i < check->req(); ++i) {
3029 Node* array_or_klass = check->in(i);
3030 Node* klass = nullptr;
3031 const TypePtr* t = _igvn.type(array_or_klass)->is_ptr();
3032 assert(!t->is_flat() && !t->is_not_flat(), "Should have been optimized out");
3033 if (t->isa_oopptr() != nullptr) {
3034 Node* klass_adr = basic_plus_adr(array_or_klass, oopDesc::klass_offset_in_bytes());
3035 klass = transform_later(LoadKlassNode::make(_igvn, C->immutable_memory(), klass_adr, TypeInstPtr::KLASS, TypeInstKlassPtr::OBJECT));
3036 } else {
3037 assert(t->isa_klassptr(), "Unexpected input type");
3038 klass = array_or_klass;
3039 }
3040 Node* lh_addr = basic_plus_adr(klass, in_bytes(Klass::layout_helper_offset()));
3041 Node* lh_val = _igvn.transform(LoadNode::make(_igvn, nullptr, C->immutable_memory(), lh_addr, lh_addr->bottom_type()->is_ptr(), TypeInt::INT, T_INT, MemNode::unordered));
3042 lhs = _igvn.transform(new OrINode(lhs, lh_val));
3043 }
3044 Node* masked = transform_later(new AndINode(lhs, intcon(Klass::_lh_array_tag_flat_value_bit_inplace)));
3045 Node* cmp = transform_later(new CmpINode(masked, intcon(0)));
3046 Node* bol = transform_later(new BoolNode(cmp, BoolTest::eq));
3047 Node* m2b = transform_later(new Conv2BNode(masked));
3048 // The matcher expects the input to If/CMove nodes to be produced by a Bool(CmpI..)
3049 // pattern, but the input to other potential users (e.g. Phi) to be some
3050 // other pattern (e.g. a Conv2B node, possibly idealized as a CMoveI).
3051 Node* old_bol = check->unique_out();
3052 for (DUIterator_Last imin, i = old_bol->last_outs(imin); i >= imin; --i) {
3053 Node* user = old_bol->last_out(i);
3054 for (uint j = 0; j < user->req(); j++) {
3055 Node* n = user->in(j);
3056 if (n == old_bol) {
3057 _igvn.replace_input_of(user, j, (user->is_If() || user->is_CMove()) ? bol : m2b);
3058 }
3059 }
3060 }
3061 _igvn.replace_node(check, C->top());
3062 }
3063 }
3064
3065 // Perform refining of strip mined loop nodes in the macro nodes list.
3066 void PhaseMacroExpand::refine_strip_mined_loop_macro_nodes() {
3067 for (int i = C->macro_count(); i > 0; i--) {
3068 Node* n = C->macro_node(i - 1);
3069 if (n->is_OuterStripMinedLoop()) {
3070 n->as_OuterStripMinedLoop()->adjust_strip_mined_loop(&_igvn);
3071 }
3072 }
3073 }
3074
3075 //---------------------------eliminate_macro_nodes----------------------
3076 // Eliminate scalar replaced allocations and associated locks.
3077 void PhaseMacroExpand::eliminate_macro_nodes(bool eliminate_locks) {
3078 if (C->macro_count() == 0) {
3079 return;
3080 }
3081
3082 if (StressMacroElimination) {
3083 C->shuffle_macro_nodes();
3084 }
3085 NOT_PRODUCT(int membar_before = count_MemBar(C);)
3086
3087 int iteration = 0;
3088 while (C->macro_count() > 0) {
3089 if (iteration++ > 100) {
3090 assert(false, "Too slow convergence of macro elimination");
3091 break;
3092 }
3093
3094 // Postpone lock elimination to after EA when most allocations are eliminated
3095 // because they might block lock elimination if their escape state isn't
3096 // determined yet and we only got one chance at eliminating the lock.
3097 if (eliminate_locks) {
3098 // Before elimination may re-mark (change to Nested or NonEscObj)
3099 // all associated (same box and obj) lock and unlock nodes.
3100 int cnt = C->macro_count();
3101 for (int i=0; i < cnt; i++) {
3102 Node *n = C->macro_node(i);
3103 if (n->is_AbstractLock()) { // Lock and Unlock nodes
3104 mark_eliminated_locking_nodes(n->as_AbstractLock());
3105 }
3106 }
3107 // Re-marking may break consistency of Coarsened locks.
3108 if (!C->coarsened_locks_consistent()) {
3109 return; // recompile without Coarsened locks if broken
3110 } else {
3111 // After coarsened locks are eliminated locking regions
3112 // become unbalanced. We should not execute any more
3113 // locks elimination optimizations on them.
3114 C->mark_unbalanced_boxes();
3115 }
3116 }
3117
3118 bool progress = false;
3119 for (int i = C->macro_count(); i > 0; i = MIN2(i - 1, C->macro_count())) { // more than 1 element can be eliminated at once
3120 Node* n = C->macro_node(i - 1);
3121 bool success = false;
3122 DEBUG_ONLY(int old_macro_count = C->macro_count();)
3123 switch (n->class_id()) {
3124 case Node::Class_Allocate:
3125 case Node::Class_AllocateArray:
3126 success = eliminate_allocate_node(n->as_Allocate());
3127 #ifndef PRODUCT
3128 if (success && PrintOptoStatistics) {
3129 AtomicAccess::inc(&PhaseMacroExpand::_objs_scalar_replaced_counter);
3130 }
3131 #endif
3132 break;
3133 case Node::Class_CallStaticJava: {
3134 CallStaticJavaNode* call = n->as_CallStaticJava();
3135 if (!call->method()->is_method_handle_intrinsic()) {
3136 success = eliminate_boxing_node(n->as_CallStaticJava());
3137 }
3138 break;
3139 }
3140 case Node::Class_Lock:
3141 case Node::Class_Unlock:
3142 if (eliminate_locks) {
3143 success = eliminate_locking_node(n->as_AbstractLock());
3144 #ifndef PRODUCT
3145 if (success && PrintOptoStatistics) {
3146 AtomicAccess::inc(&PhaseMacroExpand::_monitor_objects_removed_counter);
3147 }
3148 #endif
3149 }
3150 break;
3151 case Node::Class_ArrayCopy:
3152 break;
3153 case Node::Class_OuterStripMinedLoop:
3154 break;
3155 case Node::Class_SubTypeCheck:
3156 break;
3157 case Node::Class_Opaque1:
3158 break;
3159 case Node::Class_FlatArrayCheck:
3160 break;
3161 default:
3162 assert(n->Opcode() == Op_LoopLimit ||
3163 n->Opcode() == Op_ModD ||
3164 n->Opcode() == Op_ModF ||
3165 n->is_OpaqueNotNull() ||
3166 n->is_OpaqueInitializedAssertionPredicate() ||
3167 n->Opcode() == Op_MaxL ||
3168 n->Opcode() == Op_MinL ||
3169 BarrierSet::barrier_set()->barrier_set_c2()->is_gc_barrier_node(n),
3170 "unknown node type in macro list");
3171 }
3172 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count");
3173 progress = progress || success;
3174 if (success) {
3175 C->print_method(PHASE_AFTER_MACRO_ELIMINATION_STEP, 5, n);
3176 }
3177 }
3178
3179 // Ensure the graph after PhaseMacroExpand::eliminate_macro_nodes is canonical (no igvn
3180 // transformation is pending). If an allocation is used only in safepoints, elimination of
3181 // other macro nodes can remove all these safepoints, allowing the allocation to be removed.
3182 // Hence after igvn we retry removing macro nodes if some progress that has been made in this
3183 // iteration.
3184 _igvn.set_delay_transform(false);
3185 _igvn.optimize();
3186 if (C->failing()) {
3187 return;
3188 }
3189 _igvn.set_delay_transform(true);
3190
3191 if (!progress) {
3192 break;
3193 }
3194 }
3195 #ifndef PRODUCT
3196 if (PrintOptoStatistics) {
3197 int membar_after = count_MemBar(C);
3198 AtomicAccess::add(&PhaseMacroExpand::_memory_barriers_removed_counter, membar_before - membar_after);
3199 }
3200 #endif
3201 }
3202
3203 void PhaseMacroExpand::eliminate_opaque_looplimit_macro_nodes() {
3204 if (C->macro_count() == 0) {
3205 return;
3206 }
3207 refine_strip_mined_loop_macro_nodes();
3208 // Eliminate Opaque and LoopLimit nodes. Do it after all loop optimizations.
3209 bool progress = true;
3210 while (progress) {
3211 progress = false;
3212 for (int i = C->macro_count(); i > 0; i--) {
3213 Node* n = C->macro_node(i-1);
3214 bool success = false;
3215 DEBUG_ONLY(int old_macro_count = C->macro_count();)
3216 if (n->Opcode() == Op_LoopLimit) {
3217 // Remove it from macro list and put on IGVN worklist to optimize.
3218 C->remove_macro_node(n);
3219 _igvn._worklist.push(n);
3220 success = true;
3221 } else if (n->Opcode() == Op_CallStaticJava) {
3222 CallStaticJavaNode* call = n->as_CallStaticJava();
3223 if (!call->method()->is_method_handle_intrinsic()) {
3224 // Remove it from macro list and put on IGVN worklist to optimize.
3225 C->remove_macro_node(n);
3226 _igvn._worklist.push(n);
3227 success = true;
3228 }
3229 } else if (n->is_Opaque1()) {
3230 _igvn.replace_node(n, n->in(1));
3231 success = true;
3232 } else if (n->is_OpaqueNotNull()) {
3233 // Tests with OpaqueNotNull nodes are implicitly known to be true. Replace the node with true. In debug builds,
3234 // we leave the test in the graph to have an additional sanity check at runtime. If the test fails (i.e. a bug),
3235 // we will execute a Halt node.
3236 #ifdef ASSERT
3237 _igvn.replace_node(n, n->in(1));
3238 #else
3239 _igvn.replace_node(n, _igvn.intcon(1));
3240 #endif
3241 success = true;
3242 } else if (n->is_OpaqueInitializedAssertionPredicate()) {
3243 // Initialized Assertion Predicates must always evaluate to true. Therefore, we get rid of them in product
3244 // builds as they are useless. In debug builds we keep them as additional verification code. Even though
3245 // loop opts are already over, we want to keep Initialized Assertion Predicates alive as long as possible to
3246 // enable folding of dead control paths within which cast nodes become top after due to impossible types -
3247 // even after loop opts are over. Therefore, we delay the removal of these opaque nodes until now.
3248 #ifdef ASSERT
3317 // Worst case is a macro node gets expanded into about 200 nodes.
3318 // Allow 50% more for optimization.
3319 if (C->check_node_count(300, "out of nodes before macro expansion")) {
3320 return true;
3321 }
3322
3323 DEBUG_ONLY(int old_macro_count = C->macro_count();)
3324 switch (n->class_id()) {
3325 case Node::Class_Lock:
3326 expand_lock_node(n->as_Lock());
3327 break;
3328 case Node::Class_Unlock:
3329 expand_unlock_node(n->as_Unlock());
3330 break;
3331 case Node::Class_ArrayCopy:
3332 expand_arraycopy_node(n->as_ArrayCopy());
3333 break;
3334 case Node::Class_SubTypeCheck:
3335 expand_subtypecheck_node(n->as_SubTypeCheck());
3336 break;
3337 case Node::Class_CallStaticJava:
3338 expand_mh_intrinsic_return(n->as_CallStaticJava());
3339 C->remove_macro_node(n);
3340 break;
3341 case Node::Class_FlatArrayCheck:
3342 expand_flatarraycheck_node(n->as_FlatArrayCheck());
3343 break;
3344 default:
3345 switch (n->Opcode()) {
3346 case Op_ModD:
3347 case Op_ModF: {
3348 CallNode* mod_macro = n->as_Call();
3349 CallNode* call = new CallLeafPureNode(mod_macro->tf(), mod_macro->entry_point(), mod_macro->_name);
3350 call->init_req(TypeFunc::Control, mod_macro->in(TypeFunc::Control));
3351 call->init_req(TypeFunc::I_O, C->top());
3352 call->init_req(TypeFunc::Memory, C->top());
3353 call->init_req(TypeFunc::ReturnAdr, C->top());
3354 call->init_req(TypeFunc::FramePtr, C->top());
3355 for (unsigned int i = 0; i < mod_macro->tf()->domain_cc()->cnt() - TypeFunc::Parms; i++) {
3356 call->init_req(TypeFunc::Parms + i, mod_macro->in(TypeFunc::Parms + i));
3357 }
3358 _igvn.replace_node(mod_macro, call);
3359 transform_later(call);
3360 break;
3361 }
3362 default:
3363 assert(false, "unknown node type in macro list");
3364 }
3365 }
3366 assert(C->macro_count() == (old_macro_count - 1), "expansion must have deleted one node from macro list");
3367 if (C->failing()) return true;
3368 C->print_method(PHASE_AFTER_MACRO_EXPANSION_STEP, 5, n);
3369
3370 // Clean up the graph so we're less likely to hit the maximum node
3371 // limit
3372 _igvn.set_delay_transform(false);
3373 _igvn.optimize();
3374 if (C->failing()) return true;
3375 _igvn.set_delay_transform(true);
|