1 /*
2 * Copyright (c) 1997, 2023, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact 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 "precompiled.hpp"
26 #include "classfile/javaClasses.hpp"
27 #include "compiler/compileLog.hpp"
28 #include "gc/shared/barrierSet.hpp"
29 #include "gc/shared/c2/barrierSetC2.hpp"
30 #include "gc/shared/tlab_globals.hpp"
31 #include "memory/allocation.inline.hpp"
32 #include "memory/resourceArea.hpp"
33 #include "oops/objArrayKlass.hpp"
34 #include "opto/addnode.hpp"
35 #include "opto/arraycopynode.hpp"
36 #include "opto/cfgnode.hpp"
37 #include "opto/regalloc.hpp"
38 #include "opto/compile.hpp"
39 #include "opto/connode.hpp"
40 #include "opto/convertnode.hpp"
41 #include "opto/loopnode.hpp"
42 #include "opto/machnode.hpp"
43 #include "opto/matcher.hpp"
44 #include "opto/memnode.hpp"
45 #include "opto/mulnode.hpp"
46 #include "opto/narrowptrnode.hpp"
47 #include "opto/phaseX.hpp"
48 #include "opto/regmask.hpp"
49 #include "opto/rootnode.hpp"
50 #include "opto/vectornode.hpp"
51 #include "utilities/align.hpp"
52 #include "utilities/copy.hpp"
53 #include "utilities/macros.hpp"
54 #include "utilities/powerOfTwo.hpp"
55 #include "utilities/vmError.hpp"
56
57 // Portions of code courtesy of Clifford Click
58
59 // Optimization - Graph Style
60
61 static Node *step_through_mergemem(PhaseGVN *phase, MergeMemNode *mmem, const TypePtr *tp, const TypePtr *adr_check, outputStream *st);
62
63 //=============================================================================
64 uint MemNode::size_of() const { return sizeof(*this); }
65
66 const TypePtr *MemNode::adr_type() const {
67 Node* adr = in(Address);
68 if (adr == nullptr) return nullptr; // node is dead
69 const TypePtr* cross_check = nullptr;
70 DEBUG_ONLY(cross_check = _adr_type);
71 return calculate_adr_type(adr->bottom_type(), cross_check);
72 }
73
74 bool MemNode::check_if_adr_maybe_raw(Node* adr) {
75 if (adr != nullptr) {
76 if (adr->bottom_type()->base() == Type::RawPtr || adr->bottom_type()->base() == Type::AnyPtr) {
77 return true;
78 }
79 }
80 return false;
81 }
82
83 #ifndef PRODUCT
84 void MemNode::dump_spec(outputStream *st) const {
85 if (in(Address) == nullptr) return; // node is dead
86 #ifndef ASSERT
87 // fake the missing field
88 const TypePtr* _adr_type = nullptr;
89 if (in(Address) != nullptr)
90 _adr_type = in(Address)->bottom_type()->isa_ptr();
91 #endif
92 dump_adr_type(this, _adr_type, st);
93
94 Compile* C = Compile::current();
95 if (C->alias_type(_adr_type)->is_volatile()) {
96 st->print(" Volatile!");
97 }
98 if (_unaligned_access) {
99 st->print(" unaligned");
100 }
101 if (_mismatched_access) {
102 st->print(" mismatched");
103 }
104 if (_unsafe_access) {
105 st->print(" unsafe");
106 }
107 }
108
109 void MemNode::dump_adr_type(const Node* mem, const TypePtr* adr_type, outputStream *st) {
110 st->print(" @");
111 if (adr_type == nullptr) {
112 st->print("null");
113 } else {
114 adr_type->dump_on(st);
115 Compile* C = Compile::current();
116 Compile::AliasType* atp = nullptr;
117 if (C->have_alias_type(adr_type)) atp = C->alias_type(adr_type);
118 if (atp == nullptr)
119 st->print(", idx=?\?;");
120 else if (atp->index() == Compile::AliasIdxBot)
121 st->print(", idx=Bot;");
122 else if (atp->index() == Compile::AliasIdxTop)
123 st->print(", idx=Top;");
124 else if (atp->index() == Compile::AliasIdxRaw)
125 st->print(", idx=Raw;");
126 else {
127 ciField* field = atp->field();
128 if (field) {
129 st->print(", name=");
130 field->print_name_on(st);
131 }
132 st->print(", idx=%d;", atp->index());
133 }
134 }
135 }
136
137 extern void print_alias_types();
138
139 #endif
140
141 Node *MemNode::optimize_simple_memory_chain(Node *mchain, const TypeOopPtr *t_oop, Node *load, PhaseGVN *phase) {
142 assert((t_oop != nullptr), "sanity");
143 bool is_instance = t_oop->is_known_instance_field();
144 bool is_boxed_value_load = t_oop->is_ptr_to_boxed_value() &&
145 (load != nullptr) && load->is_Load() &&
146 (phase->is_IterGVN() != nullptr);
147 if (!(is_instance || is_boxed_value_load))
148 return mchain; // don't try to optimize non-instance types
149 uint instance_id = t_oop->instance_id();
150 Node *start_mem = phase->C->start()->proj_out_or_null(TypeFunc::Memory);
151 Node *prev = nullptr;
152 Node *result = mchain;
153 while (prev != result) {
154 prev = result;
155 if (result == start_mem)
156 break; // hit one of our sentinels
157 // skip over a call which does not affect this memory slice
158 if (result->is_Proj() && result->as_Proj()->_con == TypeFunc::Memory) {
159 Node *proj_in = result->in(0);
160 if (proj_in->is_Allocate() && proj_in->_idx == instance_id) {
161 break; // hit one of our sentinels
162 } else if (proj_in->is_Call()) {
163 // ArrayCopyNodes processed here as well
164 CallNode *call = proj_in->as_Call();
165 if (!call->may_modify(t_oop, phase)) { // returns false for instances
166 result = call->in(TypeFunc::Memory);
167 }
168 } else if (proj_in->is_Initialize()) {
169 AllocateNode* alloc = proj_in->as_Initialize()->allocation();
170 // Stop if this is the initialization for the object instance which
171 // contains this memory slice, otherwise skip over it.
172 if ((alloc == nullptr) || (alloc->_idx == instance_id)) {
173 break;
174 }
175 if (is_instance) {
176 result = proj_in->in(TypeFunc::Memory);
177 } else if (is_boxed_value_load) {
178 Node* klass = alloc->in(AllocateNode::KlassNode);
179 const TypeKlassPtr* tklass = phase->type(klass)->is_klassptr();
180 if (tklass->klass_is_exact() && !tklass->exact_klass()->equals(t_oop->is_instptr()->exact_klass())) {
181 result = proj_in->in(TypeFunc::Memory); // not related allocation
182 }
183 }
184 } else if (proj_in->is_MemBar()) {
185 ArrayCopyNode* ac = nullptr;
186 if (ArrayCopyNode::may_modify(t_oop, proj_in->as_MemBar(), phase, ac)) {
187 break;
188 }
189 result = proj_in->in(TypeFunc::Memory);
190 } else if (proj_in->is_top()) {
191 break; // dead code
192 } else {
193 assert(false, "unexpected projection");
194 }
195 } else if (result->is_ClearArray()) {
196 if (!is_instance || !ClearArrayNode::step_through(&result, instance_id, phase)) {
197 // Can not bypass initialization of the instance
198 // we are looking for.
199 break;
200 }
201 // Otherwise skip it (the call updated 'result' value).
202 } else if (result->is_MergeMem()) {
203 result = step_through_mergemem(phase, result->as_MergeMem(), t_oop, nullptr, tty);
204 }
205 }
206 return result;
207 }
208
209 Node *MemNode::optimize_memory_chain(Node *mchain, const TypePtr *t_adr, Node *load, PhaseGVN *phase) {
210 const TypeOopPtr* t_oop = t_adr->isa_oopptr();
211 if (t_oop == nullptr)
212 return mchain; // don't try to optimize non-oop types
213 Node* result = optimize_simple_memory_chain(mchain, t_oop, load, phase);
214 bool is_instance = t_oop->is_known_instance_field();
215 PhaseIterGVN *igvn = phase->is_IterGVN();
216 if (is_instance && igvn != nullptr && result->is_Phi()) {
217 PhiNode *mphi = result->as_Phi();
218 assert(mphi->bottom_type() == Type::MEMORY, "memory phi required");
219 const TypePtr *t = mphi->adr_type();
220 bool do_split = false;
221 // In the following cases, Load memory input can be further optimized based on
222 // its precise address type
223 if (t == TypePtr::BOTTOM || t == TypeRawPtr::BOTTOM ) {
224 do_split = true;
225 } else if (t->isa_oopptr() && !t->is_oopptr()->is_known_instance()) {
226 const TypeOopPtr* mem_t =
227 t->is_oopptr()->cast_to_exactness(true)
228 ->is_oopptr()->cast_to_ptr_type(t_oop->ptr())
229 ->is_oopptr()->cast_to_instance_id(t_oop->instance_id());
230 if (t_oop->is_aryptr()) {
231 mem_t = mem_t->is_aryptr()
232 ->cast_to_stable(t_oop->is_aryptr()->is_stable())
233 ->cast_to_size(t_oop->is_aryptr()->size())
234 ->with_offset(t_oop->is_aryptr()->offset())
235 ->is_aryptr();
236 }
237 do_split = mem_t == t_oop;
238 }
239 if (do_split) {
240 // clone the Phi with our address type
241 result = mphi->split_out_instance(t_adr, igvn);
242 } else {
243 assert(phase->C->get_alias_index(t) == phase->C->get_alias_index(t_adr), "correct memory chain");
244 }
245 }
246 return result;
247 }
248
249 static Node *step_through_mergemem(PhaseGVN *phase, MergeMemNode *mmem, const TypePtr *tp, const TypePtr *adr_check, outputStream *st) {
250 uint alias_idx = phase->C->get_alias_index(tp);
251 Node *mem = mmem;
252 #ifdef ASSERT
253 {
254 // Check that current type is consistent with the alias index used during graph construction
255 assert(alias_idx >= Compile::AliasIdxRaw, "must not be a bad alias_idx");
256 bool consistent = adr_check == nullptr || adr_check->empty() ||
257 phase->C->must_alias(adr_check, alias_idx );
258 // Sometimes dead array references collapse to a[-1], a[-2], or a[-3]
259 if( !consistent && adr_check != nullptr && !adr_check->empty() &&
260 tp->isa_aryptr() && tp->offset() == Type::OffsetBot &&
261 adr_check->isa_aryptr() && adr_check->offset() != Type::OffsetBot &&
262 ( adr_check->offset() == arrayOopDesc::length_offset_in_bytes() ||
263 adr_check->offset() == oopDesc::klass_offset_in_bytes() ||
264 adr_check->offset() == oopDesc::mark_offset_in_bytes() ) ) {
265 // don't assert if it is dead code.
266 consistent = true;
267 }
268 if( !consistent ) {
269 st->print("alias_idx==%d, adr_check==", alias_idx);
270 if( adr_check == nullptr ) {
271 st->print("null");
272 } else {
273 adr_check->dump();
274 }
275 st->cr();
276 print_alias_types();
277 assert(consistent, "adr_check must match alias idx");
278 }
279 }
280 #endif
281 // TypeOopPtr::NOTNULL+any is an OOP with unknown offset - generally
282 // means an array I have not precisely typed yet. Do not do any
283 // alias stuff with it any time soon.
284 const TypeOopPtr *toop = tp->isa_oopptr();
285 if (tp->base() != Type::AnyPtr &&
286 !(toop &&
287 toop->isa_instptr() &&
288 toop->is_instptr()->instance_klass()->is_java_lang_Object() &&
289 toop->offset() == Type::OffsetBot)) {
290 // compress paths and change unreachable cycles to TOP
291 // If not, we can update the input infinitely along a MergeMem cycle
292 // Equivalent code in PhiNode::Ideal
293 Node* m = phase->transform(mmem);
294 // If transformed to a MergeMem, get the desired slice
295 // Otherwise the returned node represents memory for every slice
296 mem = (m->is_MergeMem())? m->as_MergeMem()->memory_at(alias_idx) : m;
297 // Update input if it is progress over what we have now
298 }
299 return mem;
300 }
301
302 //--------------------------Ideal_common---------------------------------------
303 // Look for degenerate control and memory inputs. Bypass MergeMem inputs.
304 // Unhook non-raw memories from complete (macro-expanded) initializations.
305 Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
306 // If our control input is a dead region, kill all below the region
307 Node *ctl = in(MemNode::Control);
308 if (ctl && remove_dead_region(phase, can_reshape))
309 return this;
310 ctl = in(MemNode::Control);
311 // Don't bother trying to transform a dead node
312 if (ctl && ctl->is_top()) return NodeSentinel;
313
314 PhaseIterGVN *igvn = phase->is_IterGVN();
315 // Wait if control on the worklist.
316 if (ctl && can_reshape && igvn != nullptr) {
317 Node* bol = nullptr;
318 Node* cmp = nullptr;
319 if (ctl->in(0)->is_If()) {
320 assert(ctl->is_IfTrue() || ctl->is_IfFalse(), "sanity");
321 bol = ctl->in(0)->in(1);
322 if (bol->is_Bool())
323 cmp = ctl->in(0)->in(1)->in(1);
324 }
325 if (igvn->_worklist.member(ctl) ||
326 (bol != nullptr && igvn->_worklist.member(bol)) ||
327 (cmp != nullptr && igvn->_worklist.member(cmp)) ) {
328 // This control path may be dead.
329 // Delay this memory node transformation until the control is processed.
330 igvn->_worklist.push(this);
331 return NodeSentinel; // caller will return null
332 }
333 }
334 // Ignore if memory is dead, or self-loop
335 Node *mem = in(MemNode::Memory);
336 if (phase->type( mem ) == Type::TOP) return NodeSentinel; // caller will return null
337 assert(mem != this, "dead loop in MemNode::Ideal");
338
339 if (can_reshape && igvn != nullptr && igvn->_worklist.member(mem)) {
340 // This memory slice may be dead.
341 // Delay this mem node transformation until the memory is processed.
342 igvn->_worklist.push(this);
343 return NodeSentinel; // caller will return null
344 }
345
346 Node *address = in(MemNode::Address);
347 const Type *t_adr = phase->type(address);
348 if (t_adr == Type::TOP) return NodeSentinel; // caller will return null
349
350 if (can_reshape && is_unsafe_access() && (t_adr == TypePtr::NULL_PTR)) {
351 // Unsafe off-heap access with zero address. Remove access and other control users
352 // to not confuse optimizations and add a HaltNode to fail if this is ever executed.
353 assert(ctl != nullptr, "unsafe accesses should be control dependent");
354 for (DUIterator_Fast imax, i = ctl->fast_outs(imax); i < imax; i++) {
355 Node* u = ctl->fast_out(i);
356 if (u != ctl) {
357 igvn->rehash_node_delayed(u);
358 int nb = u->replace_edge(ctl, phase->C->top(), igvn);
359 --i, imax -= nb;
360 }
361 }
362 Node* frame = igvn->transform(new ParmNode(phase->C->start(), TypeFunc::FramePtr));
363 Node* halt = igvn->transform(new HaltNode(ctl, frame, "unsafe off-heap access with zero address"));
364 phase->C->root()->add_req(halt);
365 return this;
366 }
367
368 if (can_reshape && igvn != nullptr &&
369 (igvn->_worklist.member(address) ||
370 (igvn->_worklist.size() > 0 && t_adr != adr_type())) ) {
371 // The address's base and type may change when the address is processed.
372 // Delay this mem node transformation until the address is processed.
373 igvn->_worklist.push(this);
374 return NodeSentinel; // caller will return null
375 }
376
377 // Do NOT remove or optimize the next lines: ensure a new alias index
378 // is allocated for an oop pointer type before Escape Analysis.
379 // Note: C++ will not remove it since the call has side effect.
380 if (t_adr->isa_oopptr()) {
381 int alias_idx = phase->C->get_alias_index(t_adr->is_ptr());
382 }
383
384 Node* base = nullptr;
385 if (address->is_AddP()) {
386 base = address->in(AddPNode::Base);
387 }
388 if (base != nullptr && phase->type(base)->higher_equal(TypePtr::NULL_PTR) &&
389 !t_adr->isa_rawptr()) {
390 // Note: raw address has TOP base and top->higher_equal(TypePtr::NULL_PTR) is true.
391 // Skip this node optimization if its address has TOP base.
392 return NodeSentinel; // caller will return null
393 }
394
395 // Avoid independent memory operations
396 Node* old_mem = mem;
397
398 // The code which unhooks non-raw memories from complete (macro-expanded)
399 // initializations was removed. After macro-expansion all stores caught
400 // by Initialize node became raw stores and there is no information
401 // which memory slices they modify. So it is unsafe to move any memory
402 // operation above these stores. Also in most cases hooked non-raw memories
403 // were already unhooked by using information from detect_ptr_independence()
404 // and find_previous_store().
405
406 if (mem->is_MergeMem()) {
407 MergeMemNode* mmem = mem->as_MergeMem();
408 const TypePtr *tp = t_adr->is_ptr();
409
410 mem = step_through_mergemem(phase, mmem, tp, adr_type(), tty);
411 }
412
413 if (mem != old_mem) {
414 set_req_X(MemNode::Memory, mem, phase);
415 if (phase->type(mem) == Type::TOP) return NodeSentinel;
416 return this;
417 }
418
419 // let the subclass continue analyzing...
420 return nullptr;
421 }
422
423 // Helper function for proving some simple control dominations.
424 // Attempt to prove that all control inputs of 'dom' dominate 'sub'.
425 // Already assumes that 'dom' is available at 'sub', and that 'sub'
426 // is not a constant (dominated by the method's StartNode).
427 // Used by MemNode::find_previous_store to prove that the
428 // control input of a memory operation predates (dominates)
429 // an allocation it wants to look past.
430 bool MemNode::all_controls_dominate(Node* dom, Node* sub) {
431 if (dom == nullptr || dom->is_top() || sub == nullptr || sub->is_top())
432 return false; // Conservative answer for dead code
433
434 // Check 'dom'. Skip Proj and CatchProj nodes.
435 dom = dom->find_exact_control(dom);
436 if (dom == nullptr || dom->is_top())
437 return false; // Conservative answer for dead code
438
439 if (dom == sub) {
440 // For the case when, for example, 'sub' is Initialize and the original
441 // 'dom' is Proj node of the 'sub'.
442 return false;
443 }
444
445 if (dom->is_Con() || dom->is_Start() || dom->is_Root() || dom == sub)
446 return true;
447
448 // 'dom' dominates 'sub' if its control edge and control edges
449 // of all its inputs dominate or equal to sub's control edge.
450
451 // Currently 'sub' is either Allocate, Initialize or Start nodes.
452 // Or Region for the check in LoadNode::Ideal();
453 // 'sub' should have sub->in(0) != nullptr.
454 assert(sub->is_Allocate() || sub->is_Initialize() || sub->is_Start() ||
455 sub->is_Region() || sub->is_Call(), "expecting only these nodes");
456
457 // Get control edge of 'sub'.
458 Node* orig_sub = sub;
459 sub = sub->find_exact_control(sub->in(0));
460 if (sub == nullptr || sub->is_top())
461 return false; // Conservative answer for dead code
462
463 assert(sub->is_CFG(), "expecting control");
464
465 if (sub == dom)
466 return true;
467
468 if (sub->is_Start() || sub->is_Root())
469 return false;
470
471 {
472 // Check all control edges of 'dom'.
473
474 ResourceMark rm;
475 Node_List nlist;
476 Unique_Node_List dom_list;
477
478 dom_list.push(dom);
479 bool only_dominating_controls = false;
480
481 for (uint next = 0; next < dom_list.size(); next++) {
482 Node* n = dom_list.at(next);
483 if (n == orig_sub)
484 return false; // One of dom's inputs dominated by sub.
485 if (!n->is_CFG() && n->pinned()) {
486 // Check only own control edge for pinned non-control nodes.
487 n = n->find_exact_control(n->in(0));
488 if (n == nullptr || n->is_top())
489 return false; // Conservative answer for dead code
490 assert(n->is_CFG(), "expecting control");
491 dom_list.push(n);
492 } else if (n->is_Con() || n->is_Start() || n->is_Root()) {
493 only_dominating_controls = true;
494 } else if (n->is_CFG()) {
495 if (n->dominates(sub, nlist))
496 only_dominating_controls = true;
497 else
498 return false;
499 } else {
500 // First, own control edge.
501 Node* m = n->find_exact_control(n->in(0));
502 if (m != nullptr) {
503 if (m->is_top())
504 return false; // Conservative answer for dead code
505 dom_list.push(m);
506 }
507 // Now, the rest of edges.
508 uint cnt = n->req();
509 for (uint i = 1; i < cnt; i++) {
510 m = n->find_exact_control(n->in(i));
511 if (m == nullptr || m->is_top())
512 continue;
513 dom_list.push(m);
514 }
515 }
516 }
517 return only_dominating_controls;
518 }
519 }
520
521 //---------------------detect_ptr_independence---------------------------------
522 // Used by MemNode::find_previous_store to prove that two base
523 // pointers are never equal.
524 // The pointers are accompanied by their associated allocations,
525 // if any, which have been previously discovered by the caller.
526 bool MemNode::detect_ptr_independence(Node* p1, AllocateNode* a1,
527 Node* p2, AllocateNode* a2,
528 PhaseTransform* phase) {
529 // Attempt to prove that these two pointers cannot be aliased.
530 // They may both manifestly be allocations, and they should differ.
531 // Or, if they are not both allocations, they can be distinct constants.
532 // Otherwise, one is an allocation and the other a pre-existing value.
533 if (a1 == nullptr && a2 == nullptr) { // neither an allocation
534 return (p1 != p2) && p1->is_Con() && p2->is_Con();
535 } else if (a1 != nullptr && a2 != nullptr) { // both allocations
536 return (a1 != a2);
537 } else if (a1 != nullptr) { // one allocation a1
538 // (Note: p2->is_Con implies p2->in(0)->is_Root, which dominates.)
539 return all_controls_dominate(p2, a1);
540 } else { //(a2 != null) // one allocation a2
541 return all_controls_dominate(p1, a2);
542 }
543 return false;
544 }
545
546
547 // Find an arraycopy ac that produces the memory state represented by parameter mem.
548 // Return ac if
549 // (a) can_see_stored_value=true and ac must have set the value for this load or if
550 // (b) can_see_stored_value=false and ac could have set the value for this load or if
551 // (c) can_see_stored_value=false and ac cannot have set the value for this load.
552 // In case (c) change the parameter mem to the memory input of ac to skip it
553 // when searching stored value.
554 // Otherwise return null.
555 Node* LoadNode::find_previous_arraycopy(PhaseValues* phase, Node* ld_alloc, Node*& mem, bool can_see_stored_value) const {
556 ArrayCopyNode* ac = find_array_copy_clone(phase, ld_alloc, mem);
557 if (ac != nullptr) {
558 Node* ld_addp = in(MemNode::Address);
559 Node* src = ac->in(ArrayCopyNode::Src);
560 const TypeAryPtr* ary_t = phase->type(src)->isa_aryptr();
561
562 // This is a load from a cloned array. The corresponding arraycopy ac must
563 // have set the value for the load and we can return ac but only if the load
564 // is known to be within bounds. This is checked below.
565 if (ary_t != nullptr && ld_addp->is_AddP()) {
566 Node* ld_offs = ld_addp->in(AddPNode::Offset);
567 BasicType ary_elem = ary_t->elem()->array_element_basic_type();
568 jlong header = arrayOopDesc::base_offset_in_bytes(ary_elem);
569 jlong elemsize = type2aelembytes(ary_elem);
570
571 const TypeX* ld_offs_t = phase->type(ld_offs)->isa_intptr_t();
572 const TypeInt* sizetype = ary_t->size();
573
574 if (ld_offs_t->_lo >= header && ld_offs_t->_hi < (sizetype->_lo * elemsize + header)) {
575 // The load is known to be within bounds. It receives its value from ac.
576 return ac;
577 }
578 // The load is known to be out-of-bounds.
579 }
580 // The load could be out-of-bounds. It must not be hoisted but must remain
581 // dependent on the runtime range check. This is achieved by returning null.
582 } else if (mem->is_Proj() && mem->in(0) != nullptr && mem->in(0)->is_ArrayCopy()) {
583 ArrayCopyNode* ac = mem->in(0)->as_ArrayCopy();
584
585 if (ac->is_arraycopy_validated() ||
586 ac->is_copyof_validated() ||
587 ac->is_copyofrange_validated()) {
588 Node* ld_addp = in(MemNode::Address);
589 if (ld_addp->is_AddP()) {
590 Node* ld_base = ld_addp->in(AddPNode::Address);
591 Node* ld_offs = ld_addp->in(AddPNode::Offset);
592
593 Node* dest = ac->in(ArrayCopyNode::Dest);
594
595 if (dest == ld_base) {
596 const TypeX* ld_offs_t = phase->type(ld_offs)->isa_intptr_t();
597 assert(!ld_offs_t->empty(), "dead reference should be checked already");
598 // Take into account vector or unsafe access size
599 jlong ld_size_in_bytes = (jlong)memory_size();
600 jlong offset_hi = ld_offs_t->_hi + ld_size_in_bytes - 1;
601 offset_hi = MIN2(offset_hi, (jlong)(TypeX::MAX->_hi)); // Take care for overflow in 32-bit VM
602 if (ac->modifies(ld_offs_t->_lo, (intptr_t)offset_hi, phase, can_see_stored_value)) {
603 return ac;
604 }
605 if (!can_see_stored_value) {
606 mem = ac->in(TypeFunc::Memory);
607 return ac;
608 }
609 }
610 }
611 }
612 }
613 return nullptr;
614 }
615
616 ArrayCopyNode* MemNode::find_array_copy_clone(PhaseValues* phase, Node* ld_alloc, Node* mem) const {
617 if (mem->is_Proj() && mem->in(0) != nullptr && (mem->in(0)->Opcode() == Op_MemBarStoreStore ||
618 mem->in(0)->Opcode() == Op_MemBarCPUOrder)) {
619 if (ld_alloc != nullptr) {
620 // Check if there is an array copy for a clone
621 Node* mb = mem->in(0);
622 ArrayCopyNode* ac = nullptr;
623 if (mb->in(0) != nullptr && mb->in(0)->is_Proj() &&
624 mb->in(0)->in(0) != nullptr && mb->in(0)->in(0)->is_ArrayCopy()) {
625 ac = mb->in(0)->in(0)->as_ArrayCopy();
626 } else {
627 // Step over GC barrier when ReduceInitialCardMarks is disabled
628 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
629 Node* control_proj_ac = bs->step_over_gc_barrier(mb->in(0));
630
631 if (control_proj_ac->is_Proj() && control_proj_ac->in(0)->is_ArrayCopy()) {
632 ac = control_proj_ac->in(0)->as_ArrayCopy();
633 }
634 }
635
636 if (ac != nullptr && ac->is_clonebasic()) {
637 AllocateNode* alloc = AllocateNode::Ideal_allocation(ac->in(ArrayCopyNode::Dest), phase);
638 if (alloc != nullptr && alloc == ld_alloc) {
639 return ac;
640 }
641 }
642 }
643 }
644 return nullptr;
645 }
646
647 // The logic for reordering loads and stores uses four steps:
648 // (a) Walk carefully past stores and initializations which we
649 // can prove are independent of this load.
650 // (b) Observe that the next memory state makes an exact match
651 // with self (load or store), and locate the relevant store.
652 // (c) Ensure that, if we were to wire self directly to the store,
653 // the optimizer would fold it up somehow.
654 // (d) Do the rewiring, and return, depending on some other part of
655 // the optimizer to fold up the load.
656 // This routine handles steps (a) and (b). Steps (c) and (d) are
657 // specific to loads and stores, so they are handled by the callers.
658 // (Currently, only LoadNode::Ideal has steps (c), (d). More later.)
659 //
660 Node* MemNode::find_previous_store(PhaseValues* phase) {
661 Node* ctrl = in(MemNode::Control);
662 Node* adr = in(MemNode::Address);
663 intptr_t offset = 0;
664 Node* base = AddPNode::Ideal_base_and_offset(adr, phase, offset);
665 AllocateNode* alloc = AllocateNode::Ideal_allocation(base, phase);
666
667 if (offset == Type::OffsetBot)
668 return nullptr; // cannot unalias unless there are precise offsets
669
670 const bool adr_maybe_raw = check_if_adr_maybe_raw(adr);
671 const TypeOopPtr *addr_t = adr->bottom_type()->isa_oopptr();
672
673 intptr_t size_in_bytes = memory_size();
674
675 Node* mem = in(MemNode::Memory); // start searching here...
676
677 int cnt = 50; // Cycle limiter
678 for (;;) { // While we can dance past unrelated stores...
679 if (--cnt < 0) break; // Caught in cycle or a complicated dance?
680
681 Node* prev = mem;
682 if (mem->is_Store()) {
683 Node* st_adr = mem->in(MemNode::Address);
684 intptr_t st_offset = 0;
685 Node* st_base = AddPNode::Ideal_base_and_offset(st_adr, phase, st_offset);
686 if (st_base == nullptr)
687 break; // inscrutable pointer
688
689 // For raw accesses it's not enough to prove that constant offsets don't intersect.
690 // We need the bases to be the equal in order for the offset check to make sense.
691 if ((adr_maybe_raw || check_if_adr_maybe_raw(st_adr)) && st_base != base) {
692 break;
693 }
694
695 if (st_offset != offset && st_offset != Type::OffsetBot) {
696 const int MAX_STORE = MAX2(BytesPerLong, (int)MaxVectorSize);
697 assert(mem->as_Store()->memory_size() <= MAX_STORE, "");
698 if (st_offset >= offset + size_in_bytes ||
699 st_offset <= offset - MAX_STORE ||
700 st_offset <= offset - mem->as_Store()->memory_size()) {
701 // Success: The offsets are provably independent.
702 // (You may ask, why not just test st_offset != offset and be done?
703 // The answer is that stores of different sizes can co-exist
704 // in the same sequence of RawMem effects. We sometimes initialize
705 // a whole 'tile' of array elements with a single jint or jlong.)
706 mem = mem->in(MemNode::Memory);
707 continue; // (a) advance through independent store memory
708 }
709 }
710 if (st_base != base &&
711 detect_ptr_independence(base, alloc,
712 st_base,
713 AllocateNode::Ideal_allocation(st_base, phase),
714 phase)) {
715 // Success: The bases are provably independent.
716 mem = mem->in(MemNode::Memory);
717 continue; // (a) advance through independent store memory
718 }
719
720 // (b) At this point, if the bases or offsets do not agree, we lose,
721 // since we have not managed to prove 'this' and 'mem' independent.
722 if (st_base == base && st_offset == offset) {
723 return mem; // let caller handle steps (c), (d)
724 }
725
726 } else if (mem->is_Proj() && mem->in(0)->is_Initialize()) {
727 InitializeNode* st_init = mem->in(0)->as_Initialize();
728 AllocateNode* st_alloc = st_init->allocation();
729 if (st_alloc == nullptr)
730 break; // something degenerated
731 bool known_identical = false;
732 bool known_independent = false;
733 if (alloc == st_alloc)
734 known_identical = true;
735 else if (alloc != nullptr)
736 known_independent = true;
737 else if (all_controls_dominate(this, st_alloc))
738 known_independent = true;
739
740 if (known_independent) {
741 // The bases are provably independent: Either they are
742 // manifestly distinct allocations, or else the control
743 // of this load dominates the store's allocation.
744 int alias_idx = phase->C->get_alias_index(adr_type());
745 if (alias_idx == Compile::AliasIdxRaw) {
746 mem = st_alloc->in(TypeFunc::Memory);
747 } else {
748 mem = st_init->memory(alias_idx);
749 }
750 continue; // (a) advance through independent store memory
751 }
752
753 // (b) at this point, if we are not looking at a store initializing
754 // the same allocation we are loading from, we lose.
755 if (known_identical) {
756 // From caller, can_see_stored_value will consult find_captured_store.
757 return mem; // let caller handle steps (c), (d)
758 }
759
760 } else if (find_previous_arraycopy(phase, alloc, mem, false) != nullptr) {
761 if (prev != mem) {
762 // Found an arraycopy but it doesn't affect that load
763 continue;
764 }
765 // Found an arraycopy that may affect that load
766 return mem;
767 } else if (addr_t != nullptr && addr_t->is_known_instance_field()) {
768 // Can't use optimize_simple_memory_chain() since it needs PhaseGVN.
769 if (mem->is_Proj() && mem->in(0)->is_Call()) {
770 // ArrayCopyNodes processed here as well.
771 CallNode *call = mem->in(0)->as_Call();
772 if (!call->may_modify(addr_t, phase)) {
773 mem = call->in(TypeFunc::Memory);
774 continue; // (a) advance through independent call memory
775 }
776 } else if (mem->is_Proj() && mem->in(0)->is_MemBar()) {
777 ArrayCopyNode* ac = nullptr;
778 if (ArrayCopyNode::may_modify(addr_t, mem->in(0)->as_MemBar(), phase, ac)) {
779 break;
780 }
781 mem = mem->in(0)->in(TypeFunc::Memory);
782 continue; // (a) advance through independent MemBar memory
783 } else if (mem->is_ClearArray()) {
784 if (ClearArrayNode::step_through(&mem, (uint)addr_t->instance_id(), phase)) {
785 // (the call updated 'mem' value)
786 continue; // (a) advance through independent allocation memory
787 } else {
788 // Can not bypass initialization of the instance
789 // we are looking for.
790 return mem;
791 }
792 } else if (mem->is_MergeMem()) {
793 int alias_idx = phase->C->get_alias_index(adr_type());
794 mem = mem->as_MergeMem()->memory_at(alias_idx);
795 continue; // (a) advance through independent MergeMem memory
796 }
797 }
798
799 // Unless there is an explicit 'continue', we must bail out here,
800 // because 'mem' is an inscrutable memory state (e.g., a call).
801 break;
802 }
803
804 return nullptr; // bail out
805 }
806
807 //----------------------calculate_adr_type-------------------------------------
808 // Helper function. Notices when the given type of address hits top or bottom.
809 // Also, asserts a cross-check of the type against the expected address type.
810 const TypePtr* MemNode::calculate_adr_type(const Type* t, const TypePtr* cross_check) {
811 if (t == Type::TOP) return nullptr; // does not touch memory any more?
812 #ifdef ASSERT
813 if (!VerifyAliases || VMError::is_error_reported() || Node::in_dump()) cross_check = nullptr;
814 #endif
815 const TypePtr* tp = t->isa_ptr();
816 if (tp == nullptr) {
817 assert(cross_check == nullptr || cross_check == TypePtr::BOTTOM, "expected memory type must be wide");
818 return TypePtr::BOTTOM; // touches lots of memory
819 } else {
820 #ifdef ASSERT
821 // %%%% [phh] We don't check the alias index if cross_check is
822 // TypeRawPtr::BOTTOM. Needs to be investigated.
823 if (cross_check != nullptr &&
824 cross_check != TypePtr::BOTTOM &&
825 cross_check != TypeRawPtr::BOTTOM) {
826 // Recheck the alias index, to see if it has changed (due to a bug).
827 Compile* C = Compile::current();
828 assert(C->get_alias_index(cross_check) == C->get_alias_index(tp),
829 "must stay in the original alias category");
830 // The type of the address must be contained in the adr_type,
831 // disregarding "null"-ness.
832 // (We make an exception for TypeRawPtr::BOTTOM, which is a bit bucket.)
833 const TypePtr* tp_notnull = tp->join(TypePtr::NOTNULL)->is_ptr();
834 assert(cross_check->meet(tp_notnull) == cross_check->remove_speculative(),
835 "real address must not escape from expected memory type");
836 }
837 #endif
838 return tp;
839 }
840 }
841
842 //=============================================================================
843 // Should LoadNode::Ideal() attempt to remove control edges?
844 bool LoadNode::can_remove_control() const {
845 return !has_pinned_control_dependency();
846 }
847 uint LoadNode::size_of() const { return sizeof(*this); }
848 bool LoadNode::cmp(const Node &n) const {
849 LoadNode& load = (LoadNode &)n;
850 return !Type::cmp(_type, load._type) &&
851 _control_dependency == load._control_dependency &&
852 _mo == load._mo;
853 }
854 const Type *LoadNode::bottom_type() const { return _type; }
855 uint LoadNode::ideal_reg() const {
856 return _type->ideal_reg();
857 }
858
859 #ifndef PRODUCT
860 void LoadNode::dump_spec(outputStream *st) const {
861 MemNode::dump_spec(st);
862 if( !Verbose && !WizardMode ) {
863 // standard dump does this in Verbose and WizardMode
864 st->print(" #"); _type->dump_on(st);
865 }
866 if (!depends_only_on_test()) {
867 st->print(" (does not depend only on test, ");
868 if (control_dependency() == UnknownControl) {
869 st->print("unknown control");
870 } else if (control_dependency() == Pinned) {
871 st->print("pinned");
872 } else if (adr_type() == TypeRawPtr::BOTTOM) {
873 st->print("raw access");
874 } else {
875 st->print("unknown reason");
876 }
877 st->print(")");
878 }
879 }
880 #endif
881
882 #ifdef ASSERT
883 //----------------------------is_immutable_value-------------------------------
884 // Helper function to allow a raw load without control edge for some cases
885 bool LoadNode::is_immutable_value(Node* adr) {
886 if (adr->is_AddP() && adr->in(AddPNode::Base)->is_top() &&
887 adr->in(AddPNode::Address)->Opcode() == Op_ThreadLocal) {
888
889 jlong offset = adr->in(AddPNode::Offset)->find_intptr_t_con(-1);
890 int offsets[] = {
891 in_bytes(JavaThread::osthread_offset()),
892 in_bytes(JavaThread::threadObj_offset()),
893 in_bytes(JavaThread::vthread_offset()),
894 in_bytes(JavaThread::scopedValueCache_offset()),
895 };
896
897 for (size_t i = 0; i < sizeof offsets / sizeof offsets[0]; i++) {
898 if (offset == offsets[i]) {
899 return true;
900 }
901 }
902 }
903
904 return false;
905 }
906 #endif
907
908 //----------------------------LoadNode::make-----------------------------------
909 // Polymorphic factory method:
910 Node* LoadNode::make(PhaseGVN& gvn, Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, const Type* rt, BasicType bt, MemOrd mo,
911 ControlDependency control_dependency, bool require_atomic_access, bool unaligned, bool mismatched, bool unsafe, uint8_t barrier_data) {
912 Compile* C = gvn.C;
913
914 // sanity check the alias category against the created node type
915 assert(!(adr_type->isa_oopptr() &&
916 adr_type->offset() == oopDesc::klass_offset_in_bytes()),
917 "use LoadKlassNode instead");
918 assert(!(adr_type->isa_aryptr() &&
919 adr_type->offset() == arrayOopDesc::length_offset_in_bytes()),
920 "use LoadRangeNode instead");
921 // Check control edge of raw loads
922 assert( ctl != nullptr || C->get_alias_index(adr_type) != Compile::AliasIdxRaw ||
923 // oop will be recorded in oop map if load crosses safepoint
924 rt->isa_oopptr() || is_immutable_value(adr),
925 "raw memory operations should have control edge");
926 LoadNode* load = nullptr;
927 switch (bt) {
928 case T_BOOLEAN: load = new LoadUBNode(ctl, mem, adr, adr_type, rt->is_int(), mo, control_dependency); break;
929 case T_BYTE: load = new LoadBNode (ctl, mem, adr, adr_type, rt->is_int(), mo, control_dependency); break;
930 case T_INT: load = new LoadINode (ctl, mem, adr, adr_type, rt->is_int(), mo, control_dependency); break;
931 case T_CHAR: load = new LoadUSNode(ctl, mem, adr, adr_type, rt->is_int(), mo, control_dependency); break;
932 case T_SHORT: load = new LoadSNode (ctl, mem, adr, adr_type, rt->is_int(), mo, control_dependency); break;
933 case T_LONG: load = new LoadLNode (ctl, mem, adr, adr_type, rt->is_long(), mo, control_dependency, require_atomic_access); break;
934 case T_FLOAT: load = new LoadFNode (ctl, mem, adr, adr_type, rt, mo, control_dependency); break;
935 case T_DOUBLE: load = new LoadDNode (ctl, mem, adr, adr_type, rt, mo, control_dependency, require_atomic_access); break;
936 case T_ADDRESS: load = new LoadPNode (ctl, mem, adr, adr_type, rt->is_ptr(), mo, control_dependency); break;
937 case T_OBJECT:
938 #ifdef _LP64
939 if (adr->bottom_type()->is_ptr_to_narrowoop()) {
940 load = new LoadNNode(ctl, mem, adr, adr_type, rt->make_narrowoop(), mo, control_dependency);
941 } else
942 #endif
943 {
944 assert(!adr->bottom_type()->is_ptr_to_narrowoop() && !adr->bottom_type()->is_ptr_to_narrowklass(), "should have got back a narrow oop");
945 load = new LoadPNode(ctl, mem, adr, adr_type, rt->is_ptr(), mo, control_dependency);
946 }
947 break;
948 default:
949 ShouldNotReachHere();
950 break;
951 }
952 assert(load != nullptr, "LoadNode should have been created");
953 if (unaligned) {
954 load->set_unaligned_access();
955 }
956 if (mismatched) {
957 load->set_mismatched_access();
958 }
959 if (unsafe) {
960 load->set_unsafe_access();
961 }
962 load->set_barrier_data(barrier_data);
963 if (load->Opcode() == Op_LoadN) {
964 Node* ld = gvn.transform(load);
965 return new DecodeNNode(ld, ld->bottom_type()->make_ptr());
966 }
967
968 return load;
969 }
970
971 //------------------------------hash-------------------------------------------
972 uint LoadNode::hash() const {
973 // unroll addition of interesting fields
974 return (uintptr_t)in(Control) + (uintptr_t)in(Memory) + (uintptr_t)in(Address);
975 }
976
977 static bool skip_through_membars(Compile::AliasType* atp, const TypeInstPtr* tp, bool eliminate_boxing) {
978 if ((atp != nullptr) && (atp->index() >= Compile::AliasIdxRaw)) {
979 bool non_volatile = (atp->field() != nullptr) && !atp->field()->is_volatile();
980 bool is_stable_ary = FoldStableValues &&
981 (tp != nullptr) && (tp->isa_aryptr() != nullptr) &&
982 tp->isa_aryptr()->is_stable();
983
984 return (eliminate_boxing && non_volatile) || is_stable_ary;
985 }
986
987 return false;
988 }
989
990 LoadNode* LoadNode::pin_array_access_node() const {
991 const TypePtr* adr_type = this->adr_type();
992 if (adr_type != nullptr && adr_type->isa_aryptr()) {
993 return clone_pinned();
994 }
995 return nullptr;
996 }
997
998 // Is the value loaded previously stored by an arraycopy? If so return
999 // a load node that reads from the source array so we may be able to
1000 // optimize out the ArrayCopy node later.
1001 Node* LoadNode::can_see_arraycopy_value(Node* st, PhaseGVN* phase) const {
1002 Node* ld_adr = in(MemNode::Address);
1003 intptr_t ld_off = 0;
1004 AllocateNode* ld_alloc = AllocateNode::Ideal_allocation(ld_adr, phase, ld_off);
1005 Node* ac = find_previous_arraycopy(phase, ld_alloc, st, true);
1006 if (ac != nullptr) {
1007 assert(ac->is_ArrayCopy(), "what kind of node can this be?");
1008
1009 Node* mem = ac->in(TypeFunc::Memory);
1010 Node* ctl = ac->in(0);
1011 Node* src = ac->in(ArrayCopyNode::Src);
1012
1013 if (!ac->as_ArrayCopy()->is_clonebasic() && !phase->type(src)->isa_aryptr()) {
1014 return nullptr;
1015 }
1016
1017 // load depends on the tests that validate the arraycopy
1018 LoadNode* ld = clone_pinned();
1019 Node* addp = in(MemNode::Address)->clone();
1020 if (ac->as_ArrayCopy()->is_clonebasic()) {
1021 assert(ld_alloc != nullptr, "need an alloc");
1022 assert(addp->is_AddP(), "address must be addp");
1023 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
1024 assert(bs->step_over_gc_barrier(addp->in(AddPNode::Base)) == bs->step_over_gc_barrier(ac->in(ArrayCopyNode::Dest)), "strange pattern");
1025 assert(bs->step_over_gc_barrier(addp->in(AddPNode::Address)) == bs->step_over_gc_barrier(ac->in(ArrayCopyNode::Dest)), "strange pattern");
1026 addp->set_req(AddPNode::Base, src);
1027 addp->set_req(AddPNode::Address, src);
1028 } else {
1029 assert(ac->as_ArrayCopy()->is_arraycopy_validated() ||
1030 ac->as_ArrayCopy()->is_copyof_validated() ||
1031 ac->as_ArrayCopy()->is_copyofrange_validated(), "only supported cases");
1032 assert(addp->in(AddPNode::Base) == addp->in(AddPNode::Address), "should be");
1033 addp->set_req(AddPNode::Base, src);
1034 addp->set_req(AddPNode::Address, src);
1035
1036 const TypeAryPtr* ary_t = phase->type(in(MemNode::Address))->isa_aryptr();
1037 BasicType ary_elem = ary_t->isa_aryptr()->elem()->array_element_basic_type();
1038 if (is_reference_type(ary_elem, true)) ary_elem = T_OBJECT;
1039
1040 uint header = arrayOopDesc::base_offset_in_bytes(ary_elem);
1041 uint shift = exact_log2(type2aelembytes(ary_elem));
1042
1043 Node* diff = phase->transform(new SubINode(ac->in(ArrayCopyNode::SrcPos), ac->in(ArrayCopyNode::DestPos)));
1044 #ifdef _LP64
1045 diff = phase->transform(new ConvI2LNode(diff));
1046 #endif
1047 diff = phase->transform(new LShiftXNode(diff, phase->intcon(shift)));
1048
1049 Node* offset = phase->transform(new AddXNode(addp->in(AddPNode::Offset), diff));
1050 addp->set_req(AddPNode::Offset, offset);
1051 }
1052 addp = phase->transform(addp);
1053 #ifdef ASSERT
1054 const TypePtr* adr_type = phase->type(addp)->is_ptr();
1055 ld->_adr_type = adr_type;
1056 #endif
1057 ld->set_req(MemNode::Address, addp);
1058 ld->set_req(0, ctl);
1059 ld->set_req(MemNode::Memory, mem);
1060 return ld;
1061 }
1062 return nullptr;
1063 }
1064
1065
1066 //---------------------------can_see_stored_value------------------------------
1067 // This routine exists to make sure this set of tests is done the same
1068 // everywhere. We need to make a coordinated change: first LoadNode::Ideal
1069 // will change the graph shape in a way which makes memory alive twice at the
1070 // same time (uses the Oracle model of aliasing), then some
1071 // LoadXNode::Identity will fold things back to the equivalence-class model
1072 // of aliasing.
1073 Node* MemNode::can_see_stored_value(Node* st, PhaseValues* phase) const {
1074 Node* ld_adr = in(MemNode::Address);
1075 intptr_t ld_off = 0;
1076 Node* ld_base = AddPNode::Ideal_base_and_offset(ld_adr, phase, ld_off);
1077 Node* ld_alloc = AllocateNode::Ideal_allocation(ld_base, phase);
1078 const TypeInstPtr* tp = phase->type(ld_adr)->isa_instptr();
1079 Compile::AliasType* atp = (tp != nullptr) ? phase->C->alias_type(tp) : nullptr;
1080 // This is more general than load from boxing objects.
1081 if (skip_through_membars(atp, tp, phase->C->eliminate_boxing())) {
1082 uint alias_idx = atp->index();
1083 Node* result = nullptr;
1084 Node* current = st;
1085 // Skip through chains of MemBarNodes checking the MergeMems for
1086 // new states for the slice of this load. Stop once any other
1087 // kind of node is encountered. Loads from final memory can skip
1088 // through any kind of MemBar but normal loads shouldn't skip
1089 // through MemBarAcquire since the could allow them to move out of
1090 // a synchronized region. It is not safe to step over MemBarCPUOrder,
1091 // because alias info above them may be inaccurate (e.g., due to
1092 // mixed/mismatched unsafe accesses).
1093 bool is_final_mem = !atp->is_rewritable();
1094 while (current->is_Proj()) {
1095 int opc = current->in(0)->Opcode();
1096 if ((is_final_mem && (opc == Op_MemBarAcquire ||
1097 opc == Op_MemBarAcquireLock ||
1098 opc == Op_LoadFence)) ||
1099 opc == Op_MemBarRelease ||
1100 opc == Op_StoreFence ||
1101 opc == Op_MemBarReleaseLock ||
1102 opc == Op_MemBarStoreStore ||
1103 opc == Op_StoreStoreFence) {
1104 Node* mem = current->in(0)->in(TypeFunc::Memory);
1105 if (mem->is_MergeMem()) {
1106 MergeMemNode* merge = mem->as_MergeMem();
1107 Node* new_st = merge->memory_at(alias_idx);
1108 if (new_st == merge->base_memory()) {
1109 // Keep searching
1110 current = new_st;
1111 continue;
1112 }
1113 // Save the new memory state for the slice and fall through
1114 // to exit.
1115 result = new_st;
1116 }
1117 }
1118 break;
1119 }
1120 if (result != nullptr) {
1121 st = result;
1122 }
1123 }
1124
1125 // Loop around twice in the case Load -> Initialize -> Store.
1126 // (See PhaseIterGVN::add_users_to_worklist, which knows about this case.)
1127 for (int trip = 0; trip <= 1; trip++) {
1128
1129 if (st->is_Store()) {
1130 Node* st_adr = st->in(MemNode::Address);
1131 if (st_adr != ld_adr) {
1132 // Try harder before giving up. Unify base pointers with casts (e.g., raw/non-raw pointers).
1133 intptr_t st_off = 0;
1134 Node* st_base = AddPNode::Ideal_base_and_offset(st_adr, phase, st_off);
1135 if (ld_base == nullptr) return nullptr;
1136 if (st_base == nullptr) return nullptr;
1137 if (!ld_base->eqv_uncast(st_base, /*keep_deps=*/true)) return nullptr;
1138 if (ld_off != st_off) return nullptr;
1139 if (ld_off == Type::OffsetBot) return nullptr;
1140 // Same base, same offset.
1141 // Possible improvement for arrays: check index value instead of absolute offset.
1142
1143 // At this point we have proven something like this setup:
1144 // B = << base >>
1145 // L = LoadQ(AddP(Check/CastPP(B), #Off))
1146 // S = StoreQ(AddP( B , #Off), V)
1147 // (Actually, we haven't yet proven the Q's are the same.)
1148 // In other words, we are loading from a casted version of
1149 // the same pointer-and-offset that we stored to.
1150 // Casted version may carry a dependency and it is respected.
1151 // Thus, we are able to replace L by V.
1152 }
1153 // Now prove that we have a LoadQ matched to a StoreQ, for some Q.
1154 if (store_Opcode() != st->Opcode()) {
1155 return nullptr;
1156 }
1157 // LoadVector/StoreVector needs additional check to ensure the types match.
1158 if (st->is_StoreVector()) {
1159 const TypeVect* in_vt = st->as_StoreVector()->vect_type();
1160 const TypeVect* out_vt = as_LoadVector()->vect_type();
1161 if (in_vt != out_vt) {
1162 return nullptr;
1163 }
1164 }
1165 return st->in(MemNode::ValueIn);
1166 }
1167
1168 // A load from a freshly-created object always returns zero.
1169 // (This can happen after LoadNode::Ideal resets the load's memory input
1170 // to find_captured_store, which returned InitializeNode::zero_memory.)
1171 if (st->is_Proj() && st->in(0)->is_Allocate() &&
1172 (st->in(0) == ld_alloc) &&
1173 (ld_off >= st->in(0)->as_Allocate()->minimum_header_size())) {
1174 // return a zero value for the load's basic type
1175 // (This is one of the few places where a generic PhaseTransform
1176 // can create new nodes. Think of it as lazily manifesting
1177 // virtually pre-existing constants.)
1178 if (memory_type() != T_VOID) {
1179 if (ReduceBulkZeroing || find_array_copy_clone(phase, ld_alloc, in(MemNode::Memory)) == nullptr) {
1180 // If ReduceBulkZeroing is disabled, we need to check if the allocation does not belong to an
1181 // ArrayCopyNode clone. If it does, then we cannot assume zero since the initialization is done
1182 // by the ArrayCopyNode.
1183 return phase->zerocon(memory_type());
1184 }
1185 } else {
1186 // TODO: materialize all-zero vector constant
1187 assert(!isa_Load() || as_Load()->type()->isa_vect(), "");
1188 }
1189 }
1190
1191 // A load from an initialization barrier can match a captured store.
1192 if (st->is_Proj() && st->in(0)->is_Initialize()) {
1193 InitializeNode* init = st->in(0)->as_Initialize();
1194 AllocateNode* alloc = init->allocation();
1195 if ((alloc != nullptr) && (alloc == ld_alloc)) {
1196 // examine a captured store value
1197 st = init->find_captured_store(ld_off, memory_size(), phase);
1198 if (st != nullptr) {
1199 continue; // take one more trip around
1200 }
1201 }
1202 }
1203
1204 // Load boxed value from result of valueOf() call is input parameter.
1205 if (this->is_Load() && ld_adr->is_AddP() &&
1206 (tp != nullptr) && tp->is_ptr_to_boxed_value()) {
1207 intptr_t ignore = 0;
1208 Node* base = AddPNode::Ideal_base_and_offset(ld_adr, phase, ignore);
1209 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
1210 base = bs->step_over_gc_barrier(base);
1211 if (base != nullptr && base->is_Proj() &&
1212 base->as_Proj()->_con == TypeFunc::Parms &&
1213 base->in(0)->is_CallStaticJava() &&
1214 base->in(0)->as_CallStaticJava()->is_boxing_method()) {
1215 return base->in(0)->in(TypeFunc::Parms);
1216 }
1217 }
1218
1219 break;
1220 }
1221
1222 return nullptr;
1223 }
1224
1225 //----------------------is_instance_field_load_with_local_phi------------------
1226 bool LoadNode::is_instance_field_load_with_local_phi(Node* ctrl) {
1227 if( in(Memory)->is_Phi() && in(Memory)->in(0) == ctrl &&
1228 in(Address)->is_AddP() ) {
1229 const TypeOopPtr* t_oop = in(Address)->bottom_type()->isa_oopptr();
1230 // Only instances and boxed values.
1231 if( t_oop != nullptr &&
1232 (t_oop->is_ptr_to_boxed_value() ||
1233 t_oop->is_known_instance_field()) &&
1234 t_oop->offset() != Type::OffsetBot &&
1235 t_oop->offset() != Type::OffsetTop) {
1236 return true;
1237 }
1238 }
1239 return false;
1240 }
1241
1242 //------------------------------Identity---------------------------------------
1243 // Loads are identity if previous store is to same address
1244 Node* LoadNode::Identity(PhaseGVN* phase) {
1245 // If the previous store-maker is the right kind of Store, and the store is
1246 // to the same address, then we are equal to the value stored.
1247 Node* mem = in(Memory);
1248 Node* value = can_see_stored_value(mem, phase);
1249 if( value ) {
1250 // byte, short & char stores truncate naturally.
1251 // A load has to load the truncated value which requires
1252 // some sort of masking operation and that requires an
1253 // Ideal call instead of an Identity call.
1254 if (memory_size() < BytesPerInt) {
1255 // If the input to the store does not fit with the load's result type,
1256 // it must be truncated via an Ideal call.
1257 if (!phase->type(value)->higher_equal(phase->type(this)))
1258 return this;
1259 }
1260 // (This works even when value is a Con, but LoadNode::Value
1261 // usually runs first, producing the singleton type of the Con.)
1262 if (!has_pinned_control_dependency() || value->is_Con()) {
1263 return value;
1264 } else {
1265 return this;
1266 }
1267 }
1268
1269 if (has_pinned_control_dependency()) {
1270 return this;
1271 }
1272 // Search for an existing data phi which was generated before for the same
1273 // instance's field to avoid infinite generation of phis in a loop.
1274 Node *region = mem->in(0);
1275 if (is_instance_field_load_with_local_phi(region)) {
1276 const TypeOopPtr *addr_t = in(Address)->bottom_type()->isa_oopptr();
1277 int this_index = phase->C->get_alias_index(addr_t);
1278 int this_offset = addr_t->offset();
1279 int this_iid = addr_t->instance_id();
1280 if (!addr_t->is_known_instance() &&
1281 addr_t->is_ptr_to_boxed_value()) {
1282 // Use _idx of address base (could be Phi node) for boxed values.
1283 intptr_t ignore = 0;
1284 Node* base = AddPNode::Ideal_base_and_offset(in(Address), phase, ignore);
1285 if (base == nullptr) {
1286 return this;
1287 }
1288 this_iid = base->_idx;
1289 }
1290 const Type* this_type = bottom_type();
1291 for (DUIterator_Fast imax, i = region->fast_outs(imax); i < imax; i++) {
1292 Node* phi = region->fast_out(i);
1293 if (phi->is_Phi() && phi != mem &&
1294 phi->as_Phi()->is_same_inst_field(this_type, (int)mem->_idx, this_iid, this_index, this_offset)) {
1295 return phi;
1296 }
1297 }
1298 }
1299
1300 return this;
1301 }
1302
1303 // Construct an equivalent unsigned load.
1304 Node* LoadNode::convert_to_unsigned_load(PhaseGVN& gvn) {
1305 BasicType bt = T_ILLEGAL;
1306 const Type* rt = nullptr;
1307 switch (Opcode()) {
1308 case Op_LoadUB: return this;
1309 case Op_LoadUS: return this;
1310 case Op_LoadB: bt = T_BOOLEAN; rt = TypeInt::UBYTE; break;
1311 case Op_LoadS: bt = T_CHAR; rt = TypeInt::CHAR; break;
1312 default:
1313 assert(false, "no unsigned variant: %s", Name());
1314 return nullptr;
1315 }
1316 return LoadNode::make(gvn, in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address),
1317 raw_adr_type(), rt, bt, _mo, _control_dependency,
1318 false /*require_atomic_access*/, is_unaligned_access(), is_mismatched_access());
1319 }
1320
1321 // Construct an equivalent signed load.
1322 Node* LoadNode::convert_to_signed_load(PhaseGVN& gvn) {
1323 BasicType bt = T_ILLEGAL;
1324 const Type* rt = nullptr;
1325 switch (Opcode()) {
1326 case Op_LoadUB: bt = T_BYTE; rt = TypeInt::BYTE; break;
1327 case Op_LoadUS: bt = T_SHORT; rt = TypeInt::SHORT; break;
1328 case Op_LoadB: // fall through
1329 case Op_LoadS: // fall through
1330 case Op_LoadI: // fall through
1331 case Op_LoadL: return this;
1332 default:
1333 assert(false, "no signed variant: %s", Name());
1334 return nullptr;
1335 }
1336 return LoadNode::make(gvn, in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address),
1337 raw_adr_type(), rt, bt, _mo, _control_dependency,
1338 false /*require_atomic_access*/, is_unaligned_access(), is_mismatched_access());
1339 }
1340
1341 bool LoadNode::has_reinterpret_variant(const Type* rt) {
1342 BasicType bt = rt->basic_type();
1343 switch (Opcode()) {
1344 case Op_LoadI: return (bt == T_FLOAT);
1345 case Op_LoadL: return (bt == T_DOUBLE);
1346 case Op_LoadF: return (bt == T_INT);
1347 case Op_LoadD: return (bt == T_LONG);
1348
1349 default: return false;
1350 }
1351 }
1352
1353 Node* LoadNode::convert_to_reinterpret_load(PhaseGVN& gvn, const Type* rt) {
1354 BasicType bt = rt->basic_type();
1355 assert(has_reinterpret_variant(rt), "no reinterpret variant: %s %s", Name(), type2name(bt));
1356 bool is_mismatched = is_mismatched_access();
1357 const TypeRawPtr* raw_type = gvn.type(in(MemNode::Memory))->isa_rawptr();
1358 if (raw_type == nullptr) {
1359 is_mismatched = true; // conservatively match all non-raw accesses as mismatched
1360 }
1361 const int op = Opcode();
1362 bool require_atomic_access = (op == Op_LoadL && ((LoadLNode*)this)->require_atomic_access()) ||
1363 (op == Op_LoadD && ((LoadDNode*)this)->require_atomic_access());
1364 return LoadNode::make(gvn, in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address),
1365 raw_adr_type(), rt, bt, _mo, _control_dependency,
1366 require_atomic_access, is_unaligned_access(), is_mismatched);
1367 }
1368
1369 bool StoreNode::has_reinterpret_variant(const Type* vt) {
1370 BasicType bt = vt->basic_type();
1371 switch (Opcode()) {
1372 case Op_StoreI: return (bt == T_FLOAT);
1373 case Op_StoreL: return (bt == T_DOUBLE);
1374 case Op_StoreF: return (bt == T_INT);
1375 case Op_StoreD: return (bt == T_LONG);
1376
1377 default: return false;
1378 }
1379 }
1380
1381 Node* StoreNode::convert_to_reinterpret_store(PhaseGVN& gvn, Node* val, const Type* vt) {
1382 BasicType bt = vt->basic_type();
1383 assert(has_reinterpret_variant(vt), "no reinterpret variant: %s %s", Name(), type2name(bt));
1384 const int op = Opcode();
1385 bool require_atomic_access = (op == Op_StoreL && ((StoreLNode*)this)->require_atomic_access()) ||
1386 (op == Op_StoreD && ((StoreDNode*)this)->require_atomic_access());
1387 StoreNode* st = StoreNode::make(gvn, in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address),
1388 raw_adr_type(), val, bt, _mo, require_atomic_access);
1389
1390 bool is_mismatched = is_mismatched_access();
1391 const TypeRawPtr* raw_type = gvn.type(in(MemNode::Memory))->isa_rawptr();
1392 if (raw_type == nullptr) {
1393 is_mismatched = true; // conservatively match all non-raw accesses as mismatched
1394 }
1395 if (is_mismatched) {
1396 st->set_mismatched_access();
1397 }
1398 return st;
1399 }
1400
1401 // We're loading from an object which has autobox behaviour.
1402 // If this object is result of a valueOf call we'll have a phi
1403 // merging a newly allocated object and a load from the cache.
1404 // We want to replace this load with the original incoming
1405 // argument to the valueOf call.
1406 Node* LoadNode::eliminate_autobox(PhaseIterGVN* igvn) {
1407 assert(igvn->C->eliminate_boxing(), "sanity");
1408 intptr_t ignore = 0;
1409 Node* base = AddPNode::Ideal_base_and_offset(in(Address), igvn, ignore);
1410 if ((base == nullptr) || base->is_Phi()) {
1411 // Push the loads from the phi that comes from valueOf up
1412 // through it to allow elimination of the loads and the recovery
1413 // of the original value. It is done in split_through_phi().
1414 return nullptr;
1415 } else if (base->is_Load() ||
1416 (base->is_DecodeN() && base->in(1)->is_Load())) {
1417 // Eliminate the load of boxed value for integer types from the cache
1418 // array by deriving the value from the index into the array.
1419 // Capture the offset of the load and then reverse the computation.
1420
1421 // Get LoadN node which loads a boxing object from 'cache' array.
1422 if (base->is_DecodeN()) {
1423 base = base->in(1);
1424 }
1425 if (!base->in(Address)->is_AddP()) {
1426 return nullptr; // Complex address
1427 }
1428 AddPNode* address = base->in(Address)->as_AddP();
1429 Node* cache_base = address->in(AddPNode::Base);
1430 if ((cache_base != nullptr) && cache_base->is_DecodeN()) {
1431 // Get ConP node which is static 'cache' field.
1432 cache_base = cache_base->in(1);
1433 }
1434 if ((cache_base != nullptr) && cache_base->is_Con()) {
1435 const TypeAryPtr* base_type = cache_base->bottom_type()->isa_aryptr();
1436 if ((base_type != nullptr) && base_type->is_autobox_cache()) {
1437 Node* elements[4];
1438 int shift = exact_log2(type2aelembytes(T_OBJECT));
1439 int count = address->unpack_offsets(elements, ARRAY_SIZE(elements));
1440 if (count > 0 && elements[0]->is_Con() &&
1441 (count == 1 ||
1442 (count == 2 && elements[1]->Opcode() == Op_LShiftX &&
1443 elements[1]->in(2) == igvn->intcon(shift)))) {
1444 ciObjArray* array = base_type->const_oop()->as_obj_array();
1445 // Fetch the box object cache[0] at the base of the array and get its value
1446 ciInstance* box = array->obj_at(0)->as_instance();
1447 ciInstanceKlass* ik = box->klass()->as_instance_klass();
1448 assert(ik->is_box_klass(), "sanity");
1449 assert(ik->nof_nonstatic_fields() == 1, "change following code");
1450 if (ik->nof_nonstatic_fields() == 1) {
1451 // This should be true nonstatic_field_at requires calling
1452 // nof_nonstatic_fields so check it anyway
1453 ciConstant c = box->field_value(ik->nonstatic_field_at(0));
1454 BasicType bt = c.basic_type();
1455 // Only integer types have boxing cache.
1456 assert(bt == T_BOOLEAN || bt == T_CHAR ||
1457 bt == T_BYTE || bt == T_SHORT ||
1458 bt == T_INT || bt == T_LONG, "wrong type = %s", type2name(bt));
1459 jlong cache_low = (bt == T_LONG) ? c.as_long() : c.as_int();
1460 if (cache_low != (int)cache_low) {
1461 return nullptr; // should not happen since cache is array indexed by value
1462 }
1463 jlong offset = arrayOopDesc::base_offset_in_bytes(T_OBJECT) - (cache_low << shift);
1464 if (offset != (int)offset) {
1465 return nullptr; // should not happen since cache is array indexed by value
1466 }
1467 // Add up all the offsets making of the address of the load
1468 Node* result = elements[0];
1469 for (int i = 1; i < count; i++) {
1470 result = igvn->transform(new AddXNode(result, elements[i]));
1471 }
1472 // Remove the constant offset from the address and then
1473 result = igvn->transform(new AddXNode(result, igvn->MakeConX(-(int)offset)));
1474 // remove the scaling of the offset to recover the original index.
1475 if (result->Opcode() == Op_LShiftX && result->in(2) == igvn->intcon(shift)) {
1476 // Peel the shift off directly but wrap it in a dummy node
1477 // since Ideal can't return existing nodes
1478 igvn->_worklist.push(result); // remove dead node later
1479 result = new RShiftXNode(result->in(1), igvn->intcon(0));
1480 } else if (result->is_Add() && result->in(2)->is_Con() &&
1481 result->in(1)->Opcode() == Op_LShiftX &&
1482 result->in(1)->in(2) == igvn->intcon(shift)) {
1483 // We can't do general optimization: ((X<<Z) + Y) >> Z ==> X + (Y>>Z)
1484 // but for boxing cache access we know that X<<Z will not overflow
1485 // (there is range check) so we do this optimizatrion by hand here.
1486 igvn->_worklist.push(result); // remove dead node later
1487 Node* add_con = new RShiftXNode(result->in(2), igvn->intcon(shift));
1488 result = new AddXNode(result->in(1)->in(1), igvn->transform(add_con));
1489 } else {
1490 result = new RShiftXNode(result, igvn->intcon(shift));
1491 }
1492 #ifdef _LP64
1493 if (bt != T_LONG) {
1494 result = new ConvL2INode(igvn->transform(result));
1495 }
1496 #else
1497 if (bt == T_LONG) {
1498 result = new ConvI2LNode(igvn->transform(result));
1499 }
1500 #endif
1501 // Boxing/unboxing can be done from signed & unsigned loads (e.g. LoadUB -> ... -> LoadB pair).
1502 // Need to preserve unboxing load type if it is unsigned.
1503 switch(this->Opcode()) {
1504 case Op_LoadUB:
1505 result = new AndINode(igvn->transform(result), igvn->intcon(0xFF));
1506 break;
1507 case Op_LoadUS:
1508 result = new AndINode(igvn->transform(result), igvn->intcon(0xFFFF));
1509 break;
1510 }
1511 return result;
1512 }
1513 }
1514 }
1515 }
1516 }
1517 return nullptr;
1518 }
1519
1520 static bool stable_phi(PhiNode* phi, PhaseGVN *phase) {
1521 Node* region = phi->in(0);
1522 if (region == nullptr) {
1523 return false; // Wait stable graph
1524 }
1525 uint cnt = phi->req();
1526 for (uint i = 1; i < cnt; i++) {
1527 Node* rc = region->in(i);
1528 if (rc == nullptr || phase->type(rc) == Type::TOP)
1529 return false; // Wait stable graph
1530 Node* in = phi->in(i);
1531 if (in == nullptr || phase->type(in) == Type::TOP)
1532 return false; // Wait stable graph
1533 }
1534 return true;
1535 }
1536 //------------------------------split_through_phi------------------------------
1537 // Split instance or boxed field load through Phi.
1538 Node* LoadNode::split_through_phi(PhaseGVN* phase) {
1539 if (req() > 3) {
1540 assert(is_LoadVector() && Opcode() != Op_LoadVector, "load has too many inputs");
1541 // LoadVector subclasses such as LoadVectorMasked have extra inputs that the logic below doesn't take into account
1542 return nullptr;
1543 }
1544 Node* mem = in(Memory);
1545 Node* address = in(Address);
1546 const TypeOopPtr *t_oop = phase->type(address)->isa_oopptr();
1547
1548 assert((t_oop != nullptr) &&
1549 (t_oop->is_known_instance_field() ||
1550 t_oop->is_ptr_to_boxed_value()), "invalid conditions");
1551
1552 Compile* C = phase->C;
1553 intptr_t ignore = 0;
1554 Node* base = AddPNode::Ideal_base_and_offset(address, phase, ignore);
1555 bool base_is_phi = (base != nullptr) && base->is_Phi();
1556 bool load_boxed_values = t_oop->is_ptr_to_boxed_value() && C->aggressive_unboxing() &&
1557 (base != nullptr) && (base == address->in(AddPNode::Base)) &&
1558 phase->type(base)->higher_equal(TypePtr::NOTNULL);
1559
1560 if (!((mem->is_Phi() || base_is_phi) &&
1561 (load_boxed_values || t_oop->is_known_instance_field()))) {
1562 return nullptr; // memory is not Phi
1563 }
1564
1565 if (mem->is_Phi()) {
1566 if (!stable_phi(mem->as_Phi(), phase)) {
1567 return nullptr; // Wait stable graph
1568 }
1569 uint cnt = mem->req();
1570 // Check for loop invariant memory.
1571 if (cnt == 3) {
1572 for (uint i = 1; i < cnt; i++) {
1573 Node* in = mem->in(i);
1574 Node* m = optimize_memory_chain(in, t_oop, this, phase);
1575 if (m == mem) {
1576 if (i == 1) {
1577 // if the first edge was a loop, check second edge too.
1578 // If both are replaceable - we are in an infinite loop
1579 Node *n = optimize_memory_chain(mem->in(2), t_oop, this, phase);
1580 if (n == mem) {
1581 break;
1582 }
1583 }
1584 set_req(Memory, mem->in(cnt - i));
1585 return this; // made change
1586 }
1587 }
1588 }
1589 }
1590 if (base_is_phi) {
1591 if (!stable_phi(base->as_Phi(), phase)) {
1592 return nullptr; // Wait stable graph
1593 }
1594 uint cnt = base->req();
1595 // Check for loop invariant memory.
1596 if (cnt == 3) {
1597 for (uint i = 1; i < cnt; i++) {
1598 if (base->in(i) == base) {
1599 return nullptr; // Wait stable graph
1600 }
1601 }
1602 }
1603 }
1604
1605 // Split through Phi (see original code in loopopts.cpp).
1606 assert(C->have_alias_type(t_oop), "instance should have alias type");
1607
1608 // Do nothing here if Identity will find a value
1609 // (to avoid infinite chain of value phis generation).
1610 if (this != Identity(phase)) {
1611 return nullptr;
1612 }
1613
1614 // Select Region to split through.
1615 Node* region;
1616 if (!base_is_phi) {
1617 assert(mem->is_Phi(), "sanity");
1618 region = mem->in(0);
1619 // Skip if the region dominates some control edge of the address.
1620 if (!MemNode::all_controls_dominate(address, region))
1621 return nullptr;
1622 } else if (!mem->is_Phi()) {
1623 assert(base_is_phi, "sanity");
1624 region = base->in(0);
1625 // Skip if the region dominates some control edge of the memory.
1626 if (!MemNode::all_controls_dominate(mem, region))
1627 return nullptr;
1628 } else if (base->in(0) != mem->in(0)) {
1629 assert(base_is_phi && mem->is_Phi(), "sanity");
1630 if (MemNode::all_controls_dominate(mem, base->in(0))) {
1631 region = base->in(0);
1632 } else if (MemNode::all_controls_dominate(address, mem->in(0))) {
1633 region = mem->in(0);
1634 } else {
1635 return nullptr; // complex graph
1636 }
1637 } else {
1638 assert(base->in(0) == mem->in(0), "sanity");
1639 region = mem->in(0);
1640 }
1641
1642 const Type* this_type = this->bottom_type();
1643 int this_index = C->get_alias_index(t_oop);
1644 int this_offset = t_oop->offset();
1645 int this_iid = t_oop->instance_id();
1646 if (!t_oop->is_known_instance() && load_boxed_values) {
1647 // Use _idx of address base for boxed values.
1648 this_iid = base->_idx;
1649 }
1650 PhaseIterGVN* igvn = phase->is_IterGVN();
1651 Node* phi = new PhiNode(region, this_type, nullptr, mem->_idx, this_iid, this_index, this_offset);
1652 for (uint i = 1; i < region->req(); i++) {
1653 Node* x;
1654 Node* the_clone = nullptr;
1655 Node* in = region->in(i);
1656 if (region->is_CountedLoop() && region->as_Loop()->is_strip_mined() && i == LoopNode::EntryControl &&
1657 in != nullptr && in->is_OuterStripMinedLoop()) {
1658 // No node should go in the outer strip mined loop
1659 in = in->in(LoopNode::EntryControl);
1660 }
1661 if (in == nullptr || in == C->top()) {
1662 x = C->top(); // Dead path? Use a dead data op
1663 } else {
1664 x = this->clone(); // Else clone up the data op
1665 the_clone = x; // Remember for possible deletion.
1666 // Alter data node to use pre-phi inputs
1667 if (this->in(0) == region) {
1668 x->set_req(0, in);
1669 } else {
1670 x->set_req(0, nullptr);
1671 }
1672 if (mem->is_Phi() && (mem->in(0) == region)) {
1673 x->set_req(Memory, mem->in(i)); // Use pre-Phi input for the clone.
1674 }
1675 if (address->is_Phi() && address->in(0) == region) {
1676 x->set_req(Address, address->in(i)); // Use pre-Phi input for the clone
1677 }
1678 if (base_is_phi && (base->in(0) == region)) {
1679 Node* base_x = base->in(i); // Clone address for loads from boxed objects.
1680 Node* adr_x = phase->transform(new AddPNode(base_x,base_x,address->in(AddPNode::Offset)));
1681 x->set_req(Address, adr_x);
1682 }
1683 }
1684 // Check for a 'win' on some paths
1685 const Type *t = x->Value(igvn);
1686
1687 bool singleton = t->singleton();
1688
1689 // See comments in PhaseIdealLoop::split_thru_phi().
1690 if (singleton && t == Type::TOP) {
1691 singleton &= region->is_Loop() && (i != LoopNode::EntryControl);
1692 }
1693
1694 if (singleton) {
1695 x = igvn->makecon(t);
1696 } else {
1697 // We now call Identity to try to simplify the cloned node.
1698 // Note that some Identity methods call phase->type(this).
1699 // Make sure that the type array is big enough for
1700 // our new node, even though we may throw the node away.
1701 // (This tweaking with igvn only works because x is a new node.)
1702 igvn->set_type(x, t);
1703 // If x is a TypeNode, capture any more-precise type permanently into Node
1704 // otherwise it will be not updated during igvn->transform since
1705 // igvn->type(x) is set to x->Value() already.
1706 x->raise_bottom_type(t);
1707 Node* y = x->Identity(igvn);
1708 if (y != x) {
1709 x = y;
1710 } else {
1711 y = igvn->hash_find_insert(x);
1712 if (y) {
1713 x = y;
1714 } else {
1715 // Else x is a new node we are keeping
1716 // We do not need register_new_node_with_optimizer
1717 // because set_type has already been called.
1718 igvn->_worklist.push(x);
1719 }
1720 }
1721 }
1722 if (x != the_clone && the_clone != nullptr) {
1723 igvn->remove_dead_node(the_clone);
1724 }
1725 phi->set_req(i, x);
1726 }
1727 // Record Phi
1728 igvn->register_new_node_with_optimizer(phi);
1729 return phi;
1730 }
1731
1732 AllocateNode* LoadNode::is_new_object_mark_load(PhaseGVN *phase) const {
1733 if (Opcode() == Op_LoadX) {
1734 Node* address = in(MemNode::Address);
1735 AllocateNode* alloc = AllocateNode::Ideal_allocation(address, phase);
1736 Node* mem = in(MemNode::Memory);
1737 if (alloc != nullptr && mem->is_Proj() &&
1738 mem->in(0) != nullptr &&
1739 mem->in(0) == alloc->initialization() &&
1740 alloc->initialization()->proj_out_or_null(0) != nullptr) {
1741 return alloc;
1742 }
1743 }
1744 return nullptr;
1745 }
1746
1747
1748 //------------------------------Ideal------------------------------------------
1749 // If the load is from Field memory and the pointer is non-null, it might be possible to
1750 // zero out the control input.
1751 // If the offset is constant and the base is an object allocation,
1752 // try to hook me up to the exact initializing store.
1753 Node *LoadNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1754 if (has_pinned_control_dependency()) {
1755 return nullptr;
1756 }
1757 Node* p = MemNode::Ideal_common(phase, can_reshape);
1758 if (p) return (p == NodeSentinel) ? nullptr : p;
1759
1760 Node* ctrl = in(MemNode::Control);
1761 Node* address = in(MemNode::Address);
1762 bool progress = false;
1763
1764 bool addr_mark = ((phase->type(address)->isa_oopptr() || phase->type(address)->isa_narrowoop()) &&
1765 phase->type(address)->is_ptr()->offset() == oopDesc::mark_offset_in_bytes());
1766
1767 // Skip up past a SafePoint control. Cannot do this for Stores because
1768 // pointer stores & cardmarks must stay on the same side of a SafePoint.
1769 if( ctrl != nullptr && ctrl->Opcode() == Op_SafePoint &&
1770 phase->C->get_alias_index(phase->type(address)->is_ptr()) != Compile::AliasIdxRaw &&
1771 !addr_mark &&
1772 (depends_only_on_test() || has_unknown_control_dependency())) {
1773 ctrl = ctrl->in(0);
1774 set_req(MemNode::Control,ctrl);
1775 progress = true;
1776 }
1777
1778 intptr_t ignore = 0;
1779 Node* base = AddPNode::Ideal_base_and_offset(address, phase, ignore);
1780 if (base != nullptr
1781 && phase->C->get_alias_index(phase->type(address)->is_ptr()) != Compile::AliasIdxRaw) {
1782 // Check for useless control edge in some common special cases
1783 if (in(MemNode::Control) != nullptr
1784 && can_remove_control()
1785 && phase->type(base)->higher_equal(TypePtr::NOTNULL)
1786 && all_controls_dominate(base, phase->C->start())) {
1787 // A method-invariant, non-null address (constant or 'this' argument).
1788 set_req(MemNode::Control, nullptr);
1789 progress = true;
1790 }
1791 }
1792
1793 Node* mem = in(MemNode::Memory);
1794 const TypePtr *addr_t = phase->type(address)->isa_ptr();
1795
1796 if (can_reshape && (addr_t != nullptr)) {
1797 // try to optimize our memory input
1798 Node* opt_mem = MemNode::optimize_memory_chain(mem, addr_t, this, phase);
1799 if (opt_mem != mem) {
1800 set_req_X(MemNode::Memory, opt_mem, phase);
1801 if (phase->type( opt_mem ) == Type::TOP) return nullptr;
1802 return this;
1803 }
1804 const TypeOopPtr *t_oop = addr_t->isa_oopptr();
1805 if ((t_oop != nullptr) &&
1806 (t_oop->is_known_instance_field() ||
1807 t_oop->is_ptr_to_boxed_value())) {
1808 PhaseIterGVN *igvn = phase->is_IterGVN();
1809 assert(igvn != nullptr, "must be PhaseIterGVN when can_reshape is true");
1810 if (igvn->_worklist.member(opt_mem)) {
1811 // Delay this transformation until memory Phi is processed.
1812 igvn->_worklist.push(this);
1813 return nullptr;
1814 }
1815 // Split instance field load through Phi.
1816 Node* result = split_through_phi(phase);
1817 if (result != nullptr) return result;
1818
1819 if (t_oop->is_ptr_to_boxed_value()) {
1820 Node* result = eliminate_autobox(igvn);
1821 if (result != nullptr) return result;
1822 }
1823 }
1824 }
1825
1826 // Is there a dominating load that loads the same value? Leave
1827 // anything that is not a load of a field/array element (like
1828 // barriers etc.) alone
1829 if (in(0) != nullptr && !adr_type()->isa_rawptr() && can_reshape) {
1830 for (DUIterator_Fast imax, i = mem->fast_outs(imax); i < imax; i++) {
1831 Node *use = mem->fast_out(i);
1832 if (use != this &&
1833 use->Opcode() == Opcode() &&
1834 use->in(0) != nullptr &&
1835 use->in(0) != in(0) &&
1836 use->in(Address) == in(Address)) {
1837 Node* ctl = in(0);
1838 for (int i = 0; i < 10 && ctl != nullptr; i++) {
1839 ctl = IfNode::up_one_dom(ctl);
1840 if (ctl == use->in(0)) {
1841 set_req(0, use->in(0));
1842 return this;
1843 }
1844 }
1845 }
1846 }
1847 }
1848
1849 // Check for prior store with a different base or offset; make Load
1850 // independent. Skip through any number of them. Bail out if the stores
1851 // are in an endless dead cycle and report no progress. This is a key
1852 // transform for Reflection. However, if after skipping through the Stores
1853 // we can't then fold up against a prior store do NOT do the transform as
1854 // this amounts to using the 'Oracle' model of aliasing. It leaves the same
1855 // array memory alive twice: once for the hoisted Load and again after the
1856 // bypassed Store. This situation only works if EVERYBODY who does
1857 // anti-dependence work knows how to bypass. I.e. we need all
1858 // anti-dependence checks to ask the same Oracle. Right now, that Oracle is
1859 // the alias index stuff. So instead, peek through Stores and IFF we can
1860 // fold up, do so.
1861 Node* prev_mem = find_previous_store(phase);
1862 if (prev_mem != nullptr) {
1863 Node* value = can_see_arraycopy_value(prev_mem, phase);
1864 if (value != nullptr) {
1865 return value;
1866 }
1867 }
1868 // Steps (a), (b): Walk past independent stores to find an exact match.
1869 if (prev_mem != nullptr && prev_mem != in(MemNode::Memory)) {
1870 // (c) See if we can fold up on the spot, but don't fold up here.
1871 // Fold-up might require truncation (for LoadB/LoadS/LoadUS) or
1872 // just return a prior value, which is done by Identity calls.
1873 if (can_see_stored_value(prev_mem, phase)) {
1874 // Make ready for step (d):
1875 set_req_X(MemNode::Memory, prev_mem, phase);
1876 return this;
1877 }
1878 }
1879
1880 return progress ? this : nullptr;
1881 }
1882
1883 // Helper to recognize certain Klass fields which are invariant across
1884 // some group of array types (e.g., int[] or all T[] where T < Object).
1885 const Type*
1886 LoadNode::load_array_final_field(const TypeKlassPtr *tkls,
1887 ciKlass* klass) const {
1888 if (tkls->offset() == in_bytes(Klass::modifier_flags_offset())) {
1889 // The field is Klass::_modifier_flags. Return its (constant) value.
1890 // (Folds up the 2nd indirection in aClassConstant.getModifiers().)
1891 assert(this->Opcode() == Op_LoadI, "must load an int from _modifier_flags");
1892 return TypeInt::make(klass->modifier_flags());
1893 }
1894 if (tkls->offset() == in_bytes(Klass::access_flags_offset())) {
1895 // The field is Klass::_access_flags. Return its (constant) value.
1896 // (Folds up the 2nd indirection in Reflection.getClassAccessFlags(aClassConstant).)
1897 assert(this->Opcode() == Op_LoadI, "must load an int from _access_flags");
1898 return TypeInt::make(klass->access_flags());
1899 }
1900 if (tkls->offset() == in_bytes(Klass::layout_helper_offset())) {
1901 // The field is Klass::_layout_helper. Return its constant value if known.
1902 assert(this->Opcode() == Op_LoadI, "must load an int from _layout_helper");
1903 return TypeInt::make(klass->layout_helper());
1904 }
1905
1906 // No match.
1907 return nullptr;
1908 }
1909
1910 //------------------------------Value-----------------------------------------
1911 const Type* LoadNode::Value(PhaseGVN* phase) const {
1912 // Either input is TOP ==> the result is TOP
1913 Node* mem = in(MemNode::Memory);
1914 const Type *t1 = phase->type(mem);
1915 if (t1 == Type::TOP) return Type::TOP;
1916 Node* adr = in(MemNode::Address);
1917 const TypePtr* tp = phase->type(adr)->isa_ptr();
1918 if (tp == nullptr || tp->empty()) return Type::TOP;
1919 int off = tp->offset();
1920 assert(off != Type::OffsetTop, "case covered by TypePtr::empty");
1921 Compile* C = phase->C;
1922
1923 // Try to guess loaded type from pointer type
1924 if (tp->isa_aryptr()) {
1925 const TypeAryPtr* ary = tp->is_aryptr();
1926 const Type* t = ary->elem();
1927
1928 // Determine whether the reference is beyond the header or not, by comparing
1929 // the offset against the offset of the start of the array's data.
1930 // Different array types begin at slightly different offsets (12 vs. 16).
1931 // We choose T_BYTE as an example base type that is least restrictive
1932 // as to alignment, which will therefore produce the smallest
1933 // possible base offset.
1934 const int min_base_off = arrayOopDesc::base_offset_in_bytes(T_BYTE);
1935 const bool off_beyond_header = (off >= min_base_off);
1936
1937 // Try to constant-fold a stable array element.
1938 if (FoldStableValues && !is_mismatched_access() && ary->is_stable()) {
1939 // Make sure the reference is not into the header and the offset is constant
1940 ciObject* aobj = ary->const_oop();
1941 if (aobj != nullptr && off_beyond_header && adr->is_AddP() && off != Type::OffsetBot) {
1942 int stable_dimension = (ary->stable_dimension() > 0 ? ary->stable_dimension() - 1 : 0);
1943 const Type* con_type = Type::make_constant_from_array_element(aobj->as_array(), off,
1944 stable_dimension,
1945 memory_type(), is_unsigned());
1946 if (con_type != nullptr) {
1947 return con_type;
1948 }
1949 }
1950 }
1951
1952 // Don't do this for integer types. There is only potential profit if
1953 // the element type t is lower than _type; that is, for int types, if _type is
1954 // more restrictive than t. This only happens here if one is short and the other
1955 // char (both 16 bits), and in those cases we've made an intentional decision
1956 // to use one kind of load over the other. See AndINode::Ideal and 4965907.
1957 // Also, do not try to narrow the type for a LoadKlass, regardless of offset.
1958 //
1959 // Yes, it is possible to encounter an expression like (LoadKlass p1:(AddP x x 8))
1960 // where the _gvn.type of the AddP is wider than 8. This occurs when an earlier
1961 // copy p0 of (AddP x x 8) has been proven equal to p1, and the p0 has been
1962 // subsumed by p1. If p1 is on the worklist but has not yet been re-transformed,
1963 // it is possible that p1 will have a type like Foo*[int+]:NotNull*+any.
1964 // In fact, that could have been the original type of p1, and p1 could have
1965 // had an original form like p1:(AddP x x (LShiftL quux 3)), where the
1966 // expression (LShiftL quux 3) independently optimized to the constant 8.
1967 if ((t->isa_int() == nullptr) && (t->isa_long() == nullptr)
1968 && (_type->isa_vect() == nullptr)
1969 && Opcode() != Op_LoadKlass && Opcode() != Op_LoadNKlass) {
1970 // t might actually be lower than _type, if _type is a unique
1971 // concrete subclass of abstract class t.
1972 if (off_beyond_header || off == Type::OffsetBot) { // is the offset beyond the header?
1973 const Type* jt = t->join_speculative(_type);
1974 // In any case, do not allow the join, per se, to empty out the type.
1975 if (jt->empty() && !t->empty()) {
1976 // This can happen if a interface-typed array narrows to a class type.
1977 jt = _type;
1978 }
1979 #ifdef ASSERT
1980 if (phase->C->eliminate_boxing() && adr->is_AddP()) {
1981 // The pointers in the autobox arrays are always non-null
1982 Node* base = adr->in(AddPNode::Base);
1983 if ((base != nullptr) && base->is_DecodeN()) {
1984 // Get LoadN node which loads IntegerCache.cache field
1985 base = base->in(1);
1986 }
1987 if ((base != nullptr) && base->is_Con()) {
1988 const TypeAryPtr* base_type = base->bottom_type()->isa_aryptr();
1989 if ((base_type != nullptr) && base_type->is_autobox_cache()) {
1990 // It could be narrow oop
1991 assert(jt->make_ptr()->ptr() == TypePtr::NotNull,"sanity");
1992 }
1993 }
1994 }
1995 #endif
1996 return jt;
1997 }
1998 }
1999 } else if (tp->base() == Type::InstPtr) {
2000 assert( off != Type::OffsetBot ||
2001 // arrays can be cast to Objects
2002 !tp->isa_instptr() ||
2003 tp->is_instptr()->instance_klass()->is_java_lang_Object() ||
2004 // unsafe field access may not have a constant offset
2005 C->has_unsafe_access(),
2006 "Field accesses must be precise" );
2007 // For oop loads, we expect the _type to be precise.
2008
2009 // Optimize loads from constant fields.
2010 const TypeInstPtr* tinst = tp->is_instptr();
2011 ciObject* const_oop = tinst->const_oop();
2012 if (!is_mismatched_access() && off != Type::OffsetBot && const_oop != nullptr && const_oop->is_instance()) {
2013 const Type* con_type = Type::make_constant_from_field(const_oop->as_instance(), off, is_unsigned(), memory_type());
2014 if (con_type != nullptr) {
2015 return con_type;
2016 }
2017 }
2018 } else if (tp->base() == Type::KlassPtr || tp->base() == Type::InstKlassPtr || tp->base() == Type::AryKlassPtr) {
2019 assert(off != Type::OffsetBot ||
2020 !tp->isa_instklassptr() ||
2021 // arrays can be cast to Objects
2022 tp->isa_instklassptr()->instance_klass()->is_java_lang_Object() ||
2023 // also allow array-loading from the primary supertype
2024 // array during subtype checks
2025 Opcode() == Op_LoadKlass,
2026 "Field accesses must be precise");
2027 // For klass/static loads, we expect the _type to be precise
2028 } else if (tp->base() == Type::RawPtr && adr->is_Load() && off == 0) {
2029 /* With mirrors being an indirect in the Klass*
2030 * the VM is now using two loads. LoadKlass(LoadP(LoadP(Klass, mirror_offset), zero_offset))
2031 * The LoadP from the Klass has a RawPtr type (see LibraryCallKit::load_mirror_from_klass).
2032 *
2033 * So check the type and klass of the node before the LoadP.
2034 */
2035 Node* adr2 = adr->in(MemNode::Address);
2036 const TypeKlassPtr* tkls = phase->type(adr2)->isa_klassptr();
2037 if (tkls != nullptr && !StressReflectiveCode) {
2038 if (tkls->is_loaded() && tkls->klass_is_exact() && tkls->offset() == in_bytes(Klass::java_mirror_offset())) {
2039 ciKlass* klass = tkls->exact_klass();
2040 assert(adr->Opcode() == Op_LoadP, "must load an oop from _java_mirror");
2041 assert(Opcode() == Op_LoadP, "must load an oop from _java_mirror");
2042 return TypeInstPtr::make(klass->java_mirror());
2043 }
2044 }
2045 }
2046
2047 const TypeKlassPtr *tkls = tp->isa_klassptr();
2048 if (tkls != nullptr) {
2049 if (tkls->is_loaded() && tkls->klass_is_exact()) {
2050 ciKlass* klass = tkls->exact_klass();
2051 // We are loading a field from a Klass metaobject whose identity
2052 // is known at compile time (the type is "exact" or "precise").
2053 // Check for fields we know are maintained as constants by the VM.
2054 if (tkls->offset() == in_bytes(Klass::super_check_offset_offset())) {
2055 // The field is Klass::_super_check_offset. Return its (constant) value.
2056 // (Folds up type checking code.)
2057 assert(Opcode() == Op_LoadI, "must load an int from _super_check_offset");
2058 return TypeInt::make(klass->super_check_offset());
2059 }
2060 // Compute index into primary_supers array
2061 juint depth = (tkls->offset() - in_bytes(Klass::primary_supers_offset())) / sizeof(Klass*);
2062 // Check for overflowing; use unsigned compare to handle the negative case.
2063 if( depth < ciKlass::primary_super_limit() ) {
2064 // The field is an element of Klass::_primary_supers. Return its (constant) value.
2065 // (Folds up type checking code.)
2066 assert(Opcode() == Op_LoadKlass, "must load a klass from _primary_supers");
2067 ciKlass *ss = klass->super_of_depth(depth);
2068 return ss ? TypeKlassPtr::make(ss, Type::trust_interfaces) : TypePtr::NULL_PTR;
2069 }
2070 const Type* aift = load_array_final_field(tkls, klass);
2071 if (aift != nullptr) return aift;
2072 }
2073
2074 // We can still check if we are loading from the primary_supers array at a
2075 // shallow enough depth. Even though the klass is not exact, entries less
2076 // than or equal to its super depth are correct.
2077 if (tkls->is_loaded()) {
2078 ciKlass* klass = nullptr;
2079 if (tkls->isa_instklassptr()) {
2080 klass = tkls->is_instklassptr()->instance_klass();
2081 } else {
2082 int dims;
2083 const Type* inner = tkls->is_aryklassptr()->base_element_type(dims);
2084 if (inner->isa_instklassptr()) {
2085 klass = inner->is_instklassptr()->instance_klass();
2086 klass = ciObjArrayKlass::make(klass, dims);
2087 }
2088 }
2089 if (klass != nullptr) {
2090 // Compute index into primary_supers array
2091 juint depth = (tkls->offset() - in_bytes(Klass::primary_supers_offset())) / sizeof(Klass*);
2092 // Check for overflowing; use unsigned compare to handle the negative case.
2093 if (depth < ciKlass::primary_super_limit() &&
2094 depth <= klass->super_depth()) { // allow self-depth checks to handle self-check case
2095 // The field is an element of Klass::_primary_supers. Return its (constant) value.
2096 // (Folds up type checking code.)
2097 assert(Opcode() == Op_LoadKlass, "must load a klass from _primary_supers");
2098 ciKlass *ss = klass->super_of_depth(depth);
2099 return ss ? TypeKlassPtr::make(ss, Type::trust_interfaces) : TypePtr::NULL_PTR;
2100 }
2101 }
2102 }
2103
2104 // If the type is enough to determine that the thing is not an array,
2105 // we can give the layout_helper a positive interval type.
2106 // This will help short-circuit some reflective code.
2107 if (tkls->offset() == in_bytes(Klass::layout_helper_offset()) &&
2108 tkls->isa_instklassptr() && // not directly typed as an array
2109 !tkls->is_instklassptr()->instance_klass()->is_java_lang_Object() // not the supertype of all T[] and specifically not Serializable & Cloneable
2110 ) {
2111 // Note: When interfaces are reliable, we can narrow the interface
2112 // test to (klass != Serializable && klass != Cloneable).
2113 assert(Opcode() == Op_LoadI, "must load an int from _layout_helper");
2114 jint min_size = Klass::instance_layout_helper(oopDesc::header_size(), false);
2115 // The key property of this type is that it folds up tests
2116 // for array-ness, since it proves that the layout_helper is positive.
2117 // Thus, a generic value like the basic object layout helper works fine.
2118 return TypeInt::make(min_size, max_jint, Type::WidenMin);
2119 }
2120 }
2121
2122 // If we are loading from a freshly-allocated object, produce a zero,
2123 // if the load is provably beyond the header of the object.
2124 // (Also allow a variable load from a fresh array to produce zero.)
2125 const TypeOopPtr *tinst = tp->isa_oopptr();
2126 bool is_instance = (tinst != nullptr) && tinst->is_known_instance_field();
2127 bool is_boxed_value = (tinst != nullptr) && tinst->is_ptr_to_boxed_value();
2128 if (ReduceFieldZeroing || is_instance || is_boxed_value) {
2129 Node* value = can_see_stored_value(mem,phase);
2130 if (value != nullptr && value->is_Con()) {
2131 assert(value->bottom_type()->higher_equal(_type),"sanity");
2132 return value->bottom_type();
2133 }
2134 }
2135
2136 bool is_vect = (_type->isa_vect() != nullptr);
2137 if (is_instance && !is_vect) {
2138 // If we have an instance type and our memory input is the
2139 // programs's initial memory state, there is no matching store,
2140 // so just return a zero of the appropriate type -
2141 // except if it is vectorized - then we have no zero constant.
2142 Node *mem = in(MemNode::Memory);
2143 if (mem->is_Parm() && mem->in(0)->is_Start()) {
2144 assert(mem->as_Parm()->_con == TypeFunc::Memory, "must be memory Parm");
2145 return Type::get_zero_type(_type->basic_type());
2146 }
2147 }
2148
2149 Node* alloc = is_new_object_mark_load(phase);
2150 if (alloc != nullptr) {
2151 return TypeX::make(markWord::prototype().value());
2152 }
2153
2154 return _type;
2155 }
2156
2157 //------------------------------match_edge-------------------------------------
2158 // Do we Match on this edge index or not? Match only the address.
2159 uint LoadNode::match_edge(uint idx) const {
2160 return idx == MemNode::Address;
2161 }
2162
2163 //--------------------------LoadBNode::Ideal--------------------------------------
2164 //
2165 // If the previous store is to the same address as this load,
2166 // and the value stored was larger than a byte, replace this load
2167 // with the value stored truncated to a byte. If no truncation is
2168 // needed, the replacement is done in LoadNode::Identity().
2169 //
2170 Node* LoadBNode::Ideal(PhaseGVN* phase, bool can_reshape) {
2171 Node* mem = in(MemNode::Memory);
2172 Node* value = can_see_stored_value(mem,phase);
2173 if (value != nullptr) {
2174 Node* narrow = Compile::narrow_value(T_BYTE, value, _type, phase, false);
2175 if (narrow != value) {
2176 return narrow;
2177 }
2178 }
2179 // Identity call will handle the case where truncation is not needed.
2180 return LoadNode::Ideal(phase, can_reshape);
2181 }
2182
2183 const Type* LoadBNode::Value(PhaseGVN* phase) const {
2184 Node* mem = in(MemNode::Memory);
2185 Node* value = can_see_stored_value(mem,phase);
2186 if (value != nullptr && value->is_Con() &&
2187 !value->bottom_type()->higher_equal(_type)) {
2188 // If the input to the store does not fit with the load's result type,
2189 // it must be truncated. We can't delay until Ideal call since
2190 // a singleton Value is needed for split_thru_phi optimization.
2191 int con = value->get_int();
2192 return TypeInt::make((con << 24) >> 24);
2193 }
2194 return LoadNode::Value(phase);
2195 }
2196
2197 //--------------------------LoadUBNode::Ideal-------------------------------------
2198 //
2199 // If the previous store is to the same address as this load,
2200 // and the value stored was larger than a byte, replace this load
2201 // with the value stored truncated to a byte. If no truncation is
2202 // needed, the replacement is done in LoadNode::Identity().
2203 //
2204 Node* LoadUBNode::Ideal(PhaseGVN* phase, bool can_reshape) {
2205 Node* mem = in(MemNode::Memory);
2206 Node* value = can_see_stored_value(mem, phase);
2207 if (value != nullptr) {
2208 Node* narrow = Compile::narrow_value(T_BOOLEAN, value, _type, phase, false);
2209 if (narrow != value) {
2210 return narrow;
2211 }
2212 }
2213 // Identity call will handle the case where truncation is not needed.
2214 return LoadNode::Ideal(phase, can_reshape);
2215 }
2216
2217 const Type* LoadUBNode::Value(PhaseGVN* phase) const {
2218 Node* mem = in(MemNode::Memory);
2219 Node* value = can_see_stored_value(mem,phase);
2220 if (value != nullptr && value->is_Con() &&
2221 !value->bottom_type()->higher_equal(_type)) {
2222 // If the input to the store does not fit with the load's result type,
2223 // it must be truncated. We can't delay until Ideal call since
2224 // a singleton Value is needed for split_thru_phi optimization.
2225 int con = value->get_int();
2226 return TypeInt::make(con & 0xFF);
2227 }
2228 return LoadNode::Value(phase);
2229 }
2230
2231 //--------------------------LoadUSNode::Ideal-------------------------------------
2232 //
2233 // If the previous store is to the same address as this load,
2234 // and the value stored was larger than a char, replace this load
2235 // with the value stored truncated to a char. If no truncation is
2236 // needed, the replacement is done in LoadNode::Identity().
2237 //
2238 Node* LoadUSNode::Ideal(PhaseGVN* phase, bool can_reshape) {
2239 Node* mem = in(MemNode::Memory);
2240 Node* value = can_see_stored_value(mem,phase);
2241 if (value != nullptr) {
2242 Node* narrow = Compile::narrow_value(T_CHAR, value, _type, phase, false);
2243 if (narrow != value) {
2244 return narrow;
2245 }
2246 }
2247 // Identity call will handle the case where truncation is not needed.
2248 return LoadNode::Ideal(phase, can_reshape);
2249 }
2250
2251 const Type* LoadUSNode::Value(PhaseGVN* phase) const {
2252 Node* mem = in(MemNode::Memory);
2253 Node* value = can_see_stored_value(mem,phase);
2254 if (value != nullptr && value->is_Con() &&
2255 !value->bottom_type()->higher_equal(_type)) {
2256 // If the input to the store does not fit with the load's result type,
2257 // it must be truncated. We can't delay until Ideal call since
2258 // a singleton Value is needed for split_thru_phi optimization.
2259 int con = value->get_int();
2260 return TypeInt::make(con & 0xFFFF);
2261 }
2262 return LoadNode::Value(phase);
2263 }
2264
2265 //--------------------------LoadSNode::Ideal--------------------------------------
2266 //
2267 // If the previous store is to the same address as this load,
2268 // and the value stored was larger than a short, replace this load
2269 // with the value stored truncated to a short. If no truncation is
2270 // needed, the replacement is done in LoadNode::Identity().
2271 //
2272 Node* LoadSNode::Ideal(PhaseGVN* phase, bool can_reshape) {
2273 Node* mem = in(MemNode::Memory);
2274 Node* value = can_see_stored_value(mem,phase);
2275 if (value != nullptr) {
2276 Node* narrow = Compile::narrow_value(T_SHORT, value, _type, phase, false);
2277 if (narrow != value) {
2278 return narrow;
2279 }
2280 }
2281 // Identity call will handle the case where truncation is not needed.
2282 return LoadNode::Ideal(phase, can_reshape);
2283 }
2284
2285 const Type* LoadSNode::Value(PhaseGVN* phase) const {
2286 Node* mem = in(MemNode::Memory);
2287 Node* value = can_see_stored_value(mem,phase);
2288 if (value != nullptr && value->is_Con() &&
2289 !value->bottom_type()->higher_equal(_type)) {
2290 // If the input to the store does not fit with the load's result type,
2291 // it must be truncated. We can't delay until Ideal call since
2292 // a singleton Value is needed for split_thru_phi optimization.
2293 int con = value->get_int();
2294 return TypeInt::make((con << 16) >> 16);
2295 }
2296 return LoadNode::Value(phase);
2297 }
2298
2299 //=============================================================================
2300 //----------------------------LoadKlassNode::make------------------------------
2301 // Polymorphic factory method:
2302 Node* LoadKlassNode::make(PhaseGVN& gvn, Node* ctl, Node* mem, Node* adr, const TypePtr* at, const TypeKlassPtr* tk) {
2303 // sanity check the alias category against the created node type
2304 const TypePtr *adr_type = adr->bottom_type()->isa_ptr();
2305 assert(adr_type != nullptr, "expecting TypeKlassPtr");
2306 #ifdef _LP64
2307 if (adr_type->is_ptr_to_narrowklass()) {
2308 assert(UseCompressedClassPointers, "no compressed klasses");
2309 Node* load_klass = gvn.transform(new LoadNKlassNode(ctl, mem, adr, at, tk->make_narrowklass(), MemNode::unordered));
2310 return new DecodeNKlassNode(load_klass, load_klass->bottom_type()->make_ptr());
2311 }
2312 #endif
2313 assert(!adr_type->is_ptr_to_narrowklass() && !adr_type->is_ptr_to_narrowoop(), "should have got back a narrow oop");
2314 return new LoadKlassNode(ctl, mem, adr, at, tk, MemNode::unordered);
2315 }
2316
2317 //------------------------------Value------------------------------------------
2318 const Type* LoadKlassNode::Value(PhaseGVN* phase) const {
2319 return klass_value_common(phase);
2320 }
2321
2322 // In most cases, LoadKlassNode does not have the control input set. If the control
2323 // input is set, it must not be removed (by LoadNode::Ideal()).
2324 bool LoadKlassNode::can_remove_control() const {
2325 return false;
2326 }
2327
2328 const Type* LoadNode::klass_value_common(PhaseGVN* phase) const {
2329 // Either input is TOP ==> the result is TOP
2330 const Type *t1 = phase->type( in(MemNode::Memory) );
2331 if (t1 == Type::TOP) return Type::TOP;
2332 Node *adr = in(MemNode::Address);
2333 const Type *t2 = phase->type( adr );
2334 if (t2 == Type::TOP) return Type::TOP;
2335 const TypePtr *tp = t2->is_ptr();
2336 if (TypePtr::above_centerline(tp->ptr()) ||
2337 tp->ptr() == TypePtr::Null) return Type::TOP;
2338
2339 // Return a more precise klass, if possible
2340 const TypeInstPtr *tinst = tp->isa_instptr();
2341 if (tinst != nullptr) {
2342 ciInstanceKlass* ik = tinst->instance_klass();
2343 int offset = tinst->offset();
2344 if (ik == phase->C->env()->Class_klass()
2345 && (offset == java_lang_Class::klass_offset() ||
2346 offset == java_lang_Class::array_klass_offset())) {
2347 // We are loading a special hidden field from a Class mirror object,
2348 // the field which points to the VM's Klass metaobject.
2349 ciType* t = tinst->java_mirror_type();
2350 // java_mirror_type returns non-null for compile-time Class constants.
2351 if (t != nullptr) {
2352 // constant oop => constant klass
2353 if (offset == java_lang_Class::array_klass_offset()) {
2354 if (t->is_void()) {
2355 // We cannot create a void array. Since void is a primitive type return null
2356 // klass. Users of this result need to do a null check on the returned klass.
2357 return TypePtr::NULL_PTR;
2358 }
2359 return TypeKlassPtr::make(ciArrayKlass::make(t), Type::trust_interfaces);
2360 }
2361 if (!t->is_klass()) {
2362 // a primitive Class (e.g., int.class) has null for a klass field
2363 return TypePtr::NULL_PTR;
2364 }
2365 // (Folds up the 1st indirection in aClassConstant.getModifiers().)
2366 return TypeKlassPtr::make(t->as_klass(), Type::trust_interfaces);
2367 }
2368 // non-constant mirror, so we can't tell what's going on
2369 }
2370 if (!tinst->is_loaded())
2371 return _type; // Bail out if not loaded
2372 if (offset == oopDesc::klass_offset_in_bytes()) {
2373 return tinst->as_klass_type(true);
2374 }
2375 }
2376
2377 // Check for loading klass from an array
2378 const TypeAryPtr *tary = tp->isa_aryptr();
2379 if (tary != nullptr &&
2380 tary->offset() == oopDesc::klass_offset_in_bytes()) {
2381 return tary->as_klass_type(true);
2382 }
2383
2384 // Check for loading klass from an array klass
2385 const TypeKlassPtr *tkls = tp->isa_klassptr();
2386 if (tkls != nullptr && !StressReflectiveCode) {
2387 if (!tkls->is_loaded())
2388 return _type; // Bail out if not loaded
2389 if (tkls->isa_aryklassptr() && tkls->is_aryklassptr()->elem()->isa_klassptr() &&
2390 tkls->offset() == in_bytes(ObjArrayKlass::element_klass_offset())) {
2391 // // Always returning precise element type is incorrect,
2392 // // e.g., element type could be object and array may contain strings
2393 // return TypeKlassPtr::make(TypePtr::Constant, elem, 0);
2394
2395 // The array's TypeKlassPtr was declared 'precise' or 'not precise'
2396 // according to the element type's subclassing.
2397 return tkls->is_aryklassptr()->elem()->isa_klassptr()->cast_to_exactness(tkls->klass_is_exact());
2398 }
2399 if (tkls->isa_instklassptr() != nullptr && tkls->klass_is_exact() &&
2400 tkls->offset() == in_bytes(Klass::super_offset())) {
2401 ciKlass* sup = tkls->is_instklassptr()->instance_klass()->super();
2402 // The field is Klass::_super. Return its (constant) value.
2403 // (Folds up the 2nd indirection in aClassConstant.getSuperClass().)
2404 return sup ? TypeKlassPtr::make(sup, Type::trust_interfaces) : TypePtr::NULL_PTR;
2405 }
2406 }
2407
2408 // Bailout case
2409 return LoadNode::Value(phase);
2410 }
2411
2412 //------------------------------Identity---------------------------------------
2413 // To clean up reflective code, simplify k.java_mirror.as_klass to plain k.
2414 // Also feed through the klass in Allocate(...klass...)._klass.
2415 Node* LoadKlassNode::Identity(PhaseGVN* phase) {
2416 return klass_identity_common(phase);
2417 }
2418
2419 Node* LoadNode::klass_identity_common(PhaseGVN* phase) {
2420 Node* x = LoadNode::Identity(phase);
2421 if (x != this) return x;
2422
2423 // Take apart the address into an oop and offset.
2424 // Return 'this' if we cannot.
2425 Node* adr = in(MemNode::Address);
2426 intptr_t offset = 0;
2427 Node* base = AddPNode::Ideal_base_and_offset(adr, phase, offset);
2428 if (base == nullptr) return this;
2429 const TypeOopPtr* toop = phase->type(adr)->isa_oopptr();
2430 if (toop == nullptr) return this;
2431
2432 // Step over potential GC barrier for OopHandle resolve
2433 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
2434 if (bs->is_gc_barrier_node(base)) {
2435 base = bs->step_over_gc_barrier(base);
2436 }
2437
2438 // We can fetch the klass directly through an AllocateNode.
2439 // This works even if the klass is not constant (clone or newArray).
2440 if (offset == oopDesc::klass_offset_in_bytes()) {
2441 Node* allocated_klass = AllocateNode::Ideal_klass(base, phase);
2442 if (allocated_klass != nullptr) {
2443 return allocated_klass;
2444 }
2445 }
2446
2447 // Simplify k.java_mirror.as_klass to plain k, where k is a Klass*.
2448 // See inline_native_Class_query for occurrences of these patterns.
2449 // Java Example: x.getClass().isAssignableFrom(y)
2450 //
2451 // This improves reflective code, often making the Class
2452 // mirror go completely dead. (Current exception: Class
2453 // mirrors may appear in debug info, but we could clean them out by
2454 // introducing a new debug info operator for Klass.java_mirror).
2455
2456 if (toop->isa_instptr() && toop->is_instptr()->instance_klass() == phase->C->env()->Class_klass()
2457 && offset == java_lang_Class::klass_offset()) {
2458 if (base->is_Load()) {
2459 Node* base2 = base->in(MemNode::Address);
2460 if (base2->is_Load()) { /* direct load of a load which is the OopHandle */
2461 Node* adr2 = base2->in(MemNode::Address);
2462 const TypeKlassPtr* tkls = phase->type(adr2)->isa_klassptr();
2463 if (tkls != nullptr && !tkls->empty()
2464 && (tkls->isa_instklassptr() || tkls->isa_aryklassptr())
2465 && adr2->is_AddP()
2466 ) {
2467 int mirror_field = in_bytes(Klass::java_mirror_offset());
2468 if (tkls->offset() == mirror_field) {
2469 return adr2->in(AddPNode::Base);
2470 }
2471 }
2472 }
2473 }
2474 }
2475
2476 return this;
2477 }
2478
2479 LoadNode* LoadNode::clone_pinned() const {
2480 LoadNode* ld = clone()->as_Load();
2481 ld->_control_dependency = UnknownControl;
2482 return ld;
2483 }
2484
2485
2486 //------------------------------Value------------------------------------------
2487 const Type* LoadNKlassNode::Value(PhaseGVN* phase) const {
2488 const Type *t = klass_value_common(phase);
2489 if (t == Type::TOP)
2490 return t;
2491
2492 return t->make_narrowklass();
2493 }
2494
2495 //------------------------------Identity---------------------------------------
2496 // To clean up reflective code, simplify k.java_mirror.as_klass to narrow k.
2497 // Also feed through the klass in Allocate(...klass...)._klass.
2498 Node* LoadNKlassNode::Identity(PhaseGVN* phase) {
2499 Node *x = klass_identity_common(phase);
2500
2501 const Type *t = phase->type( x );
2502 if( t == Type::TOP ) return x;
2503 if( t->isa_narrowklass()) return x;
2504 assert (!t->isa_narrowoop(), "no narrow oop here");
2505
2506 return phase->transform(new EncodePKlassNode(x, t->make_narrowklass()));
2507 }
2508
2509 //------------------------------Value-----------------------------------------
2510 const Type* LoadRangeNode::Value(PhaseGVN* phase) const {
2511 // Either input is TOP ==> the result is TOP
2512 const Type *t1 = phase->type( in(MemNode::Memory) );
2513 if( t1 == Type::TOP ) return Type::TOP;
2514 Node *adr = in(MemNode::Address);
2515 const Type *t2 = phase->type( adr );
2516 if( t2 == Type::TOP ) return Type::TOP;
2517 const TypePtr *tp = t2->is_ptr();
2518 if (TypePtr::above_centerline(tp->ptr())) return Type::TOP;
2519 const TypeAryPtr *tap = tp->isa_aryptr();
2520 if( !tap ) return _type;
2521 return tap->size();
2522 }
2523
2524 //-------------------------------Ideal---------------------------------------
2525 // Feed through the length in AllocateArray(...length...)._length.
2526 Node *LoadRangeNode::Ideal(PhaseGVN *phase, bool can_reshape) {
2527 Node* p = MemNode::Ideal_common(phase, can_reshape);
2528 if (p) return (p == NodeSentinel) ? nullptr : p;
2529
2530 // Take apart the address into an oop and offset.
2531 // Return 'this' if we cannot.
2532 Node* adr = in(MemNode::Address);
2533 intptr_t offset = 0;
2534 Node* base = AddPNode::Ideal_base_and_offset(adr, phase, offset);
2535 if (base == nullptr) return nullptr;
2536 const TypeAryPtr* tary = phase->type(adr)->isa_aryptr();
2537 if (tary == nullptr) return nullptr;
2538
2539 // We can fetch the length directly through an AllocateArrayNode.
2540 // This works even if the length is not constant (clone or newArray).
2541 if (offset == arrayOopDesc::length_offset_in_bytes()) {
2542 AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(base, phase);
2543 if (alloc != nullptr) {
2544 Node* allocated_length = alloc->Ideal_length();
2545 Node* len = alloc->make_ideal_length(tary, phase);
2546 if (allocated_length != len) {
2547 // New CastII improves on this.
2548 return len;
2549 }
2550 }
2551 }
2552
2553 return nullptr;
2554 }
2555
2556 //------------------------------Identity---------------------------------------
2557 // Feed through the length in AllocateArray(...length...)._length.
2558 Node* LoadRangeNode::Identity(PhaseGVN* phase) {
2559 Node* x = LoadINode::Identity(phase);
2560 if (x != this) return x;
2561
2562 // Take apart the address into an oop and offset.
2563 // Return 'this' if we cannot.
2564 Node* adr = in(MemNode::Address);
2565 intptr_t offset = 0;
2566 Node* base = AddPNode::Ideal_base_and_offset(adr, phase, offset);
2567 if (base == nullptr) return this;
2568 const TypeAryPtr* tary = phase->type(adr)->isa_aryptr();
2569 if (tary == nullptr) return this;
2570
2571 // We can fetch the length directly through an AllocateArrayNode.
2572 // This works even if the length is not constant (clone or newArray).
2573 if (offset == arrayOopDesc::length_offset_in_bytes()) {
2574 AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(base, phase);
2575 if (alloc != nullptr) {
2576 Node* allocated_length = alloc->Ideal_length();
2577 // Do not allow make_ideal_length to allocate a CastII node.
2578 Node* len = alloc->make_ideal_length(tary, phase, false);
2579 if (allocated_length == len) {
2580 // Return allocated_length only if it would not be improved by a CastII.
2581 return allocated_length;
2582 }
2583 }
2584 }
2585
2586 return this;
2587
2588 }
2589
2590 //=============================================================================
2591 //---------------------------StoreNode::make-----------------------------------
2592 // Polymorphic factory method:
2593 StoreNode* StoreNode::make(PhaseGVN& gvn, Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, Node* val, BasicType bt, MemOrd mo, bool require_atomic_access) {
2594 assert((mo == unordered || mo == release), "unexpected");
2595 Compile* C = gvn.C;
2596 assert(C->get_alias_index(adr_type) != Compile::AliasIdxRaw ||
2597 ctl != nullptr, "raw memory operations should have control edge");
2598
2599 switch (bt) {
2600 case T_BOOLEAN: val = gvn.transform(new AndINode(val, gvn.intcon(0x1))); // Fall through to T_BYTE case
2601 case T_BYTE: return new StoreBNode(ctl, mem, adr, adr_type, val, mo);
2602 case T_INT: return new StoreINode(ctl, mem, adr, adr_type, val, mo);
2603 case T_CHAR:
2604 case T_SHORT: return new StoreCNode(ctl, mem, adr, adr_type, val, mo);
2605 case T_LONG: return new StoreLNode(ctl, mem, adr, adr_type, val, mo, require_atomic_access);
2606 case T_FLOAT: return new StoreFNode(ctl, mem, adr, adr_type, val, mo);
2607 case T_DOUBLE: return new StoreDNode(ctl, mem, adr, adr_type, val, mo, require_atomic_access);
2608 case T_METADATA:
2609 case T_ADDRESS:
2610 case T_OBJECT:
2611 #ifdef _LP64
2612 if (adr->bottom_type()->is_ptr_to_narrowoop()) {
2613 val = gvn.transform(new EncodePNode(val, val->bottom_type()->make_narrowoop()));
2614 return new StoreNNode(ctl, mem, adr, adr_type, val, mo);
2615 } else if (adr->bottom_type()->is_ptr_to_narrowklass() ||
2616 (UseCompressedClassPointers && val->bottom_type()->isa_klassptr() &&
2617 adr->bottom_type()->isa_rawptr())) {
2618 val = gvn.transform(new EncodePKlassNode(val, val->bottom_type()->make_narrowklass()));
2619 return new StoreNKlassNode(ctl, mem, adr, adr_type, val, mo);
2620 }
2621 #endif
2622 {
2623 return new StorePNode(ctl, mem, adr, adr_type, val, mo);
2624 }
2625 default:
2626 ShouldNotReachHere();
2627 return (StoreNode*)nullptr;
2628 }
2629 }
2630
2631 //--------------------------bottom_type----------------------------------------
2632 const Type *StoreNode::bottom_type() const {
2633 return Type::MEMORY;
2634 }
2635
2636 //------------------------------hash-------------------------------------------
2637 uint StoreNode::hash() const {
2638 // unroll addition of interesting fields
2639 //return (uintptr_t)in(Control) + (uintptr_t)in(Memory) + (uintptr_t)in(Address) + (uintptr_t)in(ValueIn);
2640
2641 // Since they are not commoned, do not hash them:
2642 return NO_HASH;
2643 }
2644
2645 //------------------------------Ideal------------------------------------------
2646 // Change back-to-back Store(, p, x) -> Store(m, p, y) to Store(m, p, x).
2647 // When a store immediately follows a relevant allocation/initialization,
2648 // try to capture it into the initialization, or hoist it above.
2649 Node *StoreNode::Ideal(PhaseGVN *phase, bool can_reshape) {
2650 Node* p = MemNode::Ideal_common(phase, can_reshape);
2651 if (p) return (p == NodeSentinel) ? nullptr : p;
2652
2653 Node* mem = in(MemNode::Memory);
2654 Node* address = in(MemNode::Address);
2655 Node* value = in(MemNode::ValueIn);
2656 // Back-to-back stores to same address? Fold em up. Generally
2657 // unsafe if I have intervening uses... Also disallowed for StoreCM
2658 // since they must follow each StoreP operation. Redundant StoreCMs
2659 // are eliminated just before matching in final_graph_reshape.
2660 {
2661 Node* st = mem;
2662 // If Store 'st' has more than one use, we cannot fold 'st' away.
2663 // For example, 'st' might be the final state at a conditional
2664 // return. Or, 'st' might be used by some node which is live at
2665 // the same time 'st' is live, which might be unschedulable. So,
2666 // require exactly ONE user until such time as we clone 'mem' for
2667 // each of 'mem's uses (thus making the exactly-1-user-rule hold
2668 // true).
2669 while (st->is_Store() && st->outcnt() == 1 && st->Opcode() != Op_StoreCM) {
2670 // Looking at a dead closed cycle of memory?
2671 assert(st != st->in(MemNode::Memory), "dead loop in StoreNode::Ideal");
2672 assert(Opcode() == st->Opcode() ||
2673 st->Opcode() == Op_StoreVector ||
2674 Opcode() == Op_StoreVector ||
2675 st->Opcode() == Op_StoreVectorScatter ||
2676 Opcode() == Op_StoreVectorScatter ||
2677 phase->C->get_alias_index(adr_type()) == Compile::AliasIdxRaw ||
2678 (Opcode() == Op_StoreL && st->Opcode() == Op_StoreI) || // expanded ClearArrayNode
2679 (Opcode() == Op_StoreI && st->Opcode() == Op_StoreL) || // initialization by arraycopy
2680 (is_mismatched_access() || st->as_Store()->is_mismatched_access()),
2681 "no mismatched stores, except on raw memory: %s %s", NodeClassNames[Opcode()], NodeClassNames[st->Opcode()]);
2682
2683 if (st->in(MemNode::Address)->eqv_uncast(address) &&
2684 st->as_Store()->memory_size() <= this->memory_size()) {
2685 Node* use = st->raw_out(0);
2686 if (phase->is_IterGVN()) {
2687 phase->is_IterGVN()->rehash_node_delayed(use);
2688 }
2689 // It's OK to do this in the parser, since DU info is always accurate,
2690 // and the parser always refers to nodes via SafePointNode maps.
2691 use->set_req_X(MemNode::Memory, st->in(MemNode::Memory), phase);
2692 return this;
2693 }
2694 st = st->in(MemNode::Memory);
2695 }
2696 }
2697
2698
2699 // Capture an unaliased, unconditional, simple store into an initializer.
2700 // Or, if it is independent of the allocation, hoist it above the allocation.
2701 if (ReduceFieldZeroing && /*can_reshape &&*/
2702 mem->is_Proj() && mem->in(0)->is_Initialize()) {
2703 InitializeNode* init = mem->in(0)->as_Initialize();
2704 intptr_t offset = init->can_capture_store(this, phase, can_reshape);
2705 if (offset > 0) {
2706 Node* moved = init->capture_store(this, offset, phase, can_reshape);
2707 // If the InitializeNode captured me, it made a raw copy of me,
2708 // and I need to disappear.
2709 if (moved != nullptr) {
2710 // %%% hack to ensure that Ideal returns a new node:
2711 mem = MergeMemNode::make(mem);
2712 return mem; // fold me away
2713 }
2714 }
2715 }
2716
2717 // Fold reinterpret cast into memory operation:
2718 // StoreX mem (MoveY2X v) => StoreY mem v
2719 if (value->is_Move()) {
2720 const Type* vt = value->in(1)->bottom_type();
2721 if (has_reinterpret_variant(vt)) {
2722 if (phase->C->post_loop_opts_phase()) {
2723 return convert_to_reinterpret_store(*phase, value->in(1), vt);
2724 } else {
2725 phase->C->record_for_post_loop_opts_igvn(this); // attempt the transformation once loop opts are over
2726 }
2727 }
2728 }
2729
2730 return nullptr; // No further progress
2731 }
2732
2733 //------------------------------Value-----------------------------------------
2734 const Type* StoreNode::Value(PhaseGVN* phase) const {
2735 // Either input is TOP ==> the result is TOP
2736 const Type *t1 = phase->type( in(MemNode::Memory) );
2737 if( t1 == Type::TOP ) return Type::TOP;
2738 const Type *t2 = phase->type( in(MemNode::Address) );
2739 if( t2 == Type::TOP ) return Type::TOP;
2740 const Type *t3 = phase->type( in(MemNode::ValueIn) );
2741 if( t3 == Type::TOP ) return Type::TOP;
2742 return Type::MEMORY;
2743 }
2744
2745 //------------------------------Identity---------------------------------------
2746 // Remove redundant stores:
2747 // Store(m, p, Load(m, p)) changes to m.
2748 // Store(, p, x) -> Store(m, p, x) changes to Store(m, p, x).
2749 Node* StoreNode::Identity(PhaseGVN* phase) {
2750 Node* mem = in(MemNode::Memory);
2751 Node* adr = in(MemNode::Address);
2752 Node* val = in(MemNode::ValueIn);
2753
2754 Node* result = this;
2755
2756 // Load then Store? Then the Store is useless
2757 if (val->is_Load() &&
2758 val->in(MemNode::Address)->eqv_uncast(adr) &&
2759 val->in(MemNode::Memory )->eqv_uncast(mem) &&
2760 val->as_Load()->store_Opcode() == Opcode()) {
2761 // Ensure vector type is the same
2762 if (!is_StoreVector() || (mem->is_LoadVector() && as_StoreVector()->vect_type() == mem->as_LoadVector()->vect_type())) {
2763 result = mem;
2764 }
2765 }
2766
2767 // Two stores in a row of the same value?
2768 if (result == this &&
2769 mem->is_Store() &&
2770 mem->in(MemNode::Address)->eqv_uncast(adr) &&
2771 mem->in(MemNode::ValueIn)->eqv_uncast(val) &&
2772 mem->Opcode() == Opcode()) {
2773 if (!is_StoreVector()) {
2774 result = mem;
2775 } else {
2776 const StoreVectorNode* store_vector = as_StoreVector();
2777 const StoreVectorNode* mem_vector = mem->as_StoreVector();
2778 const Node* store_indices = store_vector->indices();
2779 const Node* mem_indices = mem_vector->indices();
2780 const Node* store_mask = store_vector->mask();
2781 const Node* mem_mask = mem_vector->mask();
2782 // Ensure types, indices, and masks match
2783 if (store_vector->vect_type() == mem_vector->vect_type() &&
2784 ((store_indices == nullptr) == (mem_indices == nullptr) &&
2785 (store_indices == nullptr || store_indices->eqv_uncast(mem_indices))) &&
2786 ((store_mask == nullptr) == (mem_mask == nullptr) &&
2787 (store_mask == nullptr || store_mask->eqv_uncast(mem_mask)))) {
2788 result = mem;
2789 }
2790 }
2791 }
2792
2793 // Store of zero anywhere into a freshly-allocated object?
2794 // Then the store is useless.
2795 // (It must already have been captured by the InitializeNode.)
2796 if (result == this &&
2797 ReduceFieldZeroing && phase->type(val)->is_zero_type()) {
2798 // a newly allocated object is already all-zeroes everywhere
2799 if (mem->is_Proj() && mem->in(0)->is_Allocate()) {
2800 result = mem;
2801 }
2802
2803 if (result == this) {
2804 // the store may also apply to zero-bits in an earlier object
2805 Node* prev_mem = find_previous_store(phase);
2806 // Steps (a), (b): Walk past independent stores to find an exact match.
2807 if (prev_mem != nullptr) {
2808 Node* prev_val = can_see_stored_value(prev_mem, phase);
2809 if (prev_val != nullptr && prev_val == val) {
2810 // prev_val and val might differ by a cast; it would be good
2811 // to keep the more informative of the two.
2812 result = mem;
2813 }
2814 }
2815 }
2816 }
2817
2818 PhaseIterGVN* igvn = phase->is_IterGVN();
2819 if (result != this && igvn != nullptr) {
2820 MemBarNode* trailing = trailing_membar();
2821 if (trailing != nullptr) {
2822 #ifdef ASSERT
2823 const TypeOopPtr* t_oop = phase->type(in(Address))->isa_oopptr();
2824 assert(t_oop == nullptr || t_oop->is_known_instance_field(), "only for non escaping objects");
2825 #endif
2826 trailing->remove(igvn);
2827 }
2828 }
2829
2830 return result;
2831 }
2832
2833 //------------------------------match_edge-------------------------------------
2834 // Do we Match on this edge index or not? Match only memory & value
2835 uint StoreNode::match_edge(uint idx) const {
2836 return idx == MemNode::Address || idx == MemNode::ValueIn;
2837 }
2838
2839 //------------------------------cmp--------------------------------------------
2840 // Do not common stores up together. They generally have to be split
2841 // back up anyways, so do not bother.
2842 bool StoreNode::cmp( const Node &n ) const {
2843 return (&n == this); // Always fail except on self
2844 }
2845
2846 //------------------------------Ideal_masked_input-----------------------------
2847 // Check for a useless mask before a partial-word store
2848 // (StoreB ... (AndI valIn conIa) )
2849 // If (conIa & mask == mask) this simplifies to
2850 // (StoreB ... (valIn) )
2851 Node *StoreNode::Ideal_masked_input(PhaseGVN *phase, uint mask) {
2852 Node *val = in(MemNode::ValueIn);
2853 if( val->Opcode() == Op_AndI ) {
2854 const TypeInt *t = phase->type( val->in(2) )->isa_int();
2855 if( t && t->is_con() && (t->get_con() & mask) == mask ) {
2856 set_req_X(MemNode::ValueIn, val->in(1), phase);
2857 return this;
2858 }
2859 }
2860 return nullptr;
2861 }
2862
2863
2864 //------------------------------Ideal_sign_extended_input----------------------
2865 // Check for useless sign-extension before a partial-word store
2866 // (StoreB ... (RShiftI _ (LShiftI _ valIn conIL ) conIR) )
2867 // If (conIL == conIR && conIR <= num_bits) this simplifies to
2868 // (StoreB ... (valIn) )
2869 Node *StoreNode::Ideal_sign_extended_input(PhaseGVN *phase, int num_bits) {
2870 Node *val = in(MemNode::ValueIn);
2871 if( val->Opcode() == Op_RShiftI ) {
2872 const TypeInt *t = phase->type( val->in(2) )->isa_int();
2873 if( t && t->is_con() && (t->get_con() <= num_bits) ) {
2874 Node *shl = val->in(1);
2875 if( shl->Opcode() == Op_LShiftI ) {
2876 const TypeInt *t2 = phase->type( shl->in(2) )->isa_int();
2877 if( t2 && t2->is_con() && (t2->get_con() == t->get_con()) ) {
2878 set_req_X(MemNode::ValueIn, shl->in(1), phase);
2879 return this;
2880 }
2881 }
2882 }
2883 }
2884 return nullptr;
2885 }
2886
2887 //------------------------------value_never_loaded-----------------------------------
2888 // Determine whether there are any possible loads of the value stored.
2889 // For simplicity, we actually check if there are any loads from the
2890 // address stored to, not just for loads of the value stored by this node.
2891 //
2892 bool StoreNode::value_never_loaded(PhaseValues* phase) const {
2893 Node *adr = in(Address);
2894 const TypeOopPtr *adr_oop = phase->type(adr)->isa_oopptr();
2895 if (adr_oop == nullptr)
2896 return false;
2897 if (!adr_oop->is_known_instance_field())
2898 return false; // if not a distinct instance, there may be aliases of the address
2899 for (DUIterator_Fast imax, i = adr->fast_outs(imax); i < imax; i++) {
2900 Node *use = adr->fast_out(i);
2901 if (use->is_Load() || use->is_LoadStore()) {
2902 return false;
2903 }
2904 }
2905 return true;
2906 }
2907
2908 MemBarNode* StoreNode::trailing_membar() const {
2909 if (is_release()) {
2910 MemBarNode* trailing_mb = nullptr;
2911 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) {
2912 Node* u = fast_out(i);
2913 if (u->is_MemBar()) {
2914 if (u->as_MemBar()->trailing_store()) {
2915 assert(u->Opcode() == Op_MemBarVolatile, "");
2916 assert(trailing_mb == nullptr, "only one");
2917 trailing_mb = u->as_MemBar();
2918 #ifdef ASSERT
2919 Node* leading = u->as_MemBar()->leading_membar();
2920 assert(leading->Opcode() == Op_MemBarRelease, "incorrect membar");
2921 assert(leading->as_MemBar()->leading_store(), "incorrect membar pair");
2922 assert(leading->as_MemBar()->trailing_membar() == u, "incorrect membar pair");
2923 #endif
2924 } else {
2925 assert(u->as_MemBar()->standalone(), "");
2926 }
2927 }
2928 }
2929 return trailing_mb;
2930 }
2931 return nullptr;
2932 }
2933
2934
2935 //=============================================================================
2936 //------------------------------Ideal------------------------------------------
2937 // If the store is from an AND mask that leaves the low bits untouched, then
2938 // we can skip the AND operation. If the store is from a sign-extension
2939 // (a left shift, then right shift) we can skip both.
2940 Node *StoreBNode::Ideal(PhaseGVN *phase, bool can_reshape){
2941 Node *progress = StoreNode::Ideal_masked_input(phase, 0xFF);
2942 if( progress != nullptr ) return progress;
2943
2944 progress = StoreNode::Ideal_sign_extended_input(phase, 24);
2945 if( progress != nullptr ) return progress;
2946
2947 // Finally check the default case
2948 return StoreNode::Ideal(phase, can_reshape);
2949 }
2950
2951 //=============================================================================
2952 //------------------------------Ideal------------------------------------------
2953 // If the store is from an AND mask that leaves the low bits untouched, then
2954 // we can skip the AND operation
2955 Node *StoreCNode::Ideal(PhaseGVN *phase, bool can_reshape){
2956 Node *progress = StoreNode::Ideal_masked_input(phase, 0xFFFF);
2957 if( progress != nullptr ) return progress;
2958
2959 progress = StoreNode::Ideal_sign_extended_input(phase, 16);
2960 if( progress != nullptr ) return progress;
2961
2962 // Finally check the default case
2963 return StoreNode::Ideal(phase, can_reshape);
2964 }
2965
2966 //=============================================================================
2967 //------------------------------Identity---------------------------------------
2968 Node* StoreCMNode::Identity(PhaseGVN* phase) {
2969 // No need to card mark when storing a null ptr
2970 Node* my_store = in(MemNode::OopStore);
2971 if (my_store->is_Store()) {
2972 const Type *t1 = phase->type( my_store->in(MemNode::ValueIn) );
2973 if( t1 == TypePtr::NULL_PTR ) {
2974 return in(MemNode::Memory);
2975 }
2976 }
2977 return this;
2978 }
2979
2980 //=============================================================================
2981 //------------------------------Ideal---------------------------------------
2982 Node *StoreCMNode::Ideal(PhaseGVN *phase, bool can_reshape){
2983 Node* progress = StoreNode::Ideal(phase, can_reshape);
2984 if (progress != nullptr) return progress;
2985
2986 Node* my_store = in(MemNode::OopStore);
2987 if (my_store->is_MergeMem()) {
2988 Node* mem = my_store->as_MergeMem()->memory_at(oop_alias_idx());
2989 set_req_X(MemNode::OopStore, mem, phase);
2990 return this;
2991 }
2992
2993 return nullptr;
2994 }
2995
2996 //------------------------------Value-----------------------------------------
2997 const Type* StoreCMNode::Value(PhaseGVN* phase) const {
2998 // Either input is TOP ==> the result is TOP (checked in StoreNode::Value).
2999 // If extra input is TOP ==> the result is TOP
3000 const Type* t = phase->type(in(MemNode::OopStore));
3001 if (t == Type::TOP) {
3002 return Type::TOP;
3003 }
3004 return StoreNode::Value(phase);
3005 }
3006
3007
3008 //=============================================================================
3009 //----------------------------------SCMemProjNode------------------------------
3010 const Type* SCMemProjNode::Value(PhaseGVN* phase) const
3011 {
3012 if (in(0) == nullptr || phase->type(in(0)) == Type::TOP) {
3013 return Type::TOP;
3014 }
3015 return bottom_type();
3016 }
3017
3018 //=============================================================================
3019 //----------------------------------LoadStoreNode------------------------------
3020 LoadStoreNode::LoadStoreNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* rt, uint required )
3021 : Node(required),
3022 _type(rt),
3023 _adr_type(at),
3024 _barrier_data(0)
3025 {
3026 init_req(MemNode::Control, c );
3027 init_req(MemNode::Memory , mem);
3028 init_req(MemNode::Address, adr);
3029 init_req(MemNode::ValueIn, val);
3030 init_class_id(Class_LoadStore);
3031 }
3032
3033 //------------------------------Value-----------------------------------------
3034 const Type* LoadStoreNode::Value(PhaseGVN* phase) const {
3035 // Either input is TOP ==> the result is TOP
3036 if (!in(MemNode::Control) || phase->type(in(MemNode::Control)) == Type::TOP) {
3037 return Type::TOP;
3038 }
3039 const Type* t = phase->type(in(MemNode::Memory));
3040 if (t == Type::TOP) {
3041 return Type::TOP;
3042 }
3043 t = phase->type(in(MemNode::Address));
3044 if (t == Type::TOP) {
3045 return Type::TOP;
3046 }
3047 t = phase->type(in(MemNode::ValueIn));
3048 if (t == Type::TOP) {
3049 return Type::TOP;
3050 }
3051 return bottom_type();
3052 }
3053
3054 uint LoadStoreNode::ideal_reg() const {
3055 return _type->ideal_reg();
3056 }
3057
3058 bool LoadStoreNode::result_not_used() const {
3059 for( DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++ ) {
3060 Node *x = fast_out(i);
3061 if (x->Opcode() == Op_SCMemProj) continue;
3062 return false;
3063 }
3064 return true;
3065 }
3066
3067 MemBarNode* LoadStoreNode::trailing_membar() const {
3068 MemBarNode* trailing = nullptr;
3069 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) {
3070 Node* u = fast_out(i);
3071 if (u->is_MemBar()) {
3072 if (u->as_MemBar()->trailing_load_store()) {
3073 assert(u->Opcode() == Op_MemBarAcquire, "");
3074 assert(trailing == nullptr, "only one");
3075 trailing = u->as_MemBar();
3076 #ifdef ASSERT
3077 Node* leading = trailing->leading_membar();
3078 assert(support_IRIW_for_not_multiple_copy_atomic_cpu || leading->Opcode() == Op_MemBarRelease, "incorrect membar");
3079 assert(leading->as_MemBar()->leading_load_store(), "incorrect membar pair");
3080 assert(leading->as_MemBar()->trailing_membar() == trailing, "incorrect membar pair");
3081 #endif
3082 } else {
3083 assert(u->as_MemBar()->standalone(), "wrong barrier kind");
3084 }
3085 }
3086 }
3087
3088 return trailing;
3089 }
3090
3091 uint LoadStoreNode::size_of() const { return sizeof(*this); }
3092
3093 //=============================================================================
3094 //----------------------------------LoadStoreConditionalNode--------------------
3095 LoadStoreConditionalNode::LoadStoreConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex ) : LoadStoreNode(c, mem, adr, val, nullptr, TypeInt::BOOL, 5) {
3096 init_req(ExpectedIn, ex );
3097 }
3098
3099 const Type* LoadStoreConditionalNode::Value(PhaseGVN* phase) const {
3100 // Either input is TOP ==> the result is TOP
3101 const Type* t = phase->type(in(ExpectedIn));
3102 if (t == Type::TOP) {
3103 return Type::TOP;
3104 }
3105 return LoadStoreNode::Value(phase);
3106 }
3107
3108 //=============================================================================
3109 //-------------------------------adr_type--------------------------------------
3110 const TypePtr* ClearArrayNode::adr_type() const {
3111 Node *adr = in(3);
3112 if (adr == nullptr) return nullptr; // node is dead
3113 return MemNode::calculate_adr_type(adr->bottom_type());
3114 }
3115
3116 //------------------------------match_edge-------------------------------------
3117 // Do we Match on this edge index or not? Do not match memory
3118 uint ClearArrayNode::match_edge(uint idx) const {
3119 return idx > 1;
3120 }
3121
3122 //------------------------------Identity---------------------------------------
3123 // Clearing a zero length array does nothing
3124 Node* ClearArrayNode::Identity(PhaseGVN* phase) {
3125 return phase->type(in(2))->higher_equal(TypeX::ZERO) ? in(1) : this;
3126 }
3127
3128 //------------------------------Idealize---------------------------------------
3129 // Clearing a short array is faster with stores
3130 Node *ClearArrayNode::Ideal(PhaseGVN *phase, bool can_reshape) {
3131 // Already know this is a large node, do not try to ideal it
3132 if (_is_large) return nullptr;
3133
3134 const int unit = BytesPerLong;
3135 const TypeX* t = phase->type(in(2))->isa_intptr_t();
3136 if (!t) return nullptr;
3137 if (!t->is_con()) return nullptr;
3138 intptr_t raw_count = t->get_con();
3139 intptr_t size = raw_count;
3140 if (!Matcher::init_array_count_is_in_bytes) size *= unit;
3141 // Clearing nothing uses the Identity call.
3142 // Negative clears are possible on dead ClearArrays
3143 // (see jck test stmt114.stmt11402.val).
3144 if (size <= 0 || size % unit != 0) return nullptr;
3145 intptr_t count = size / unit;
3146 // Length too long; communicate this to matchers and assemblers.
3147 // Assemblers are responsible to produce fast hardware clears for it.
3148 if (size > InitArrayShortSize) {
3149 return new ClearArrayNode(in(0), in(1), in(2), in(3), true);
3150 } else if (size > 2 && Matcher::match_rule_supported_vector(Op_ClearArray, 4, T_LONG)) {
3151 return nullptr;
3152 }
3153 if (!IdealizeClearArrayNode) return nullptr;
3154 Node *mem = in(1);
3155 if( phase->type(mem)==Type::TOP ) return nullptr;
3156 Node *adr = in(3);
3157 const Type* at = phase->type(adr);
3158 if( at==Type::TOP ) return nullptr;
3159 const TypePtr* atp = at->isa_ptr();
3160 // adjust atp to be the correct array element address type
3161 if (atp == nullptr) atp = TypePtr::BOTTOM;
3162 else atp = atp->add_offset(Type::OffsetBot);
3163 // Get base for derived pointer purposes
3164 if( adr->Opcode() != Op_AddP ) Unimplemented();
3165 Node *base = adr->in(1);
3166
3167 Node *zero = phase->makecon(TypeLong::ZERO);
3168 Node *off = phase->MakeConX(BytesPerLong);
3169 mem = new StoreLNode(in(0),mem,adr,atp,zero,MemNode::unordered,false);
3170 count--;
3171 while( count-- ) {
3172 mem = phase->transform(mem);
3173 adr = phase->transform(new AddPNode(base,adr,off));
3174 mem = new StoreLNode(in(0),mem,adr,atp,zero,MemNode::unordered,false);
3175 }
3176 return mem;
3177 }
3178
3179 //----------------------------step_through----------------------------------
3180 // Return allocation input memory edge if it is different instance
3181 // or itself if it is the one we are looking for.
3182 bool ClearArrayNode::step_through(Node** np, uint instance_id, PhaseValues* phase) {
3183 Node* n = *np;
3184 assert(n->is_ClearArray(), "sanity");
3185 intptr_t offset;
3186 AllocateNode* alloc = AllocateNode::Ideal_allocation(n->in(3), phase, offset);
3187 // This method is called only before Allocate nodes are expanded
3188 // during macro nodes expansion. Before that ClearArray nodes are
3189 // only generated in PhaseMacroExpand::generate_arraycopy() (before
3190 // Allocate nodes are expanded) which follows allocations.
3191 assert(alloc != nullptr, "should have allocation");
3192 if (alloc->_idx == instance_id) {
3193 // Can not bypass initialization of the instance we are looking for.
3194 return false;
3195 }
3196 // Otherwise skip it.
3197 InitializeNode* init = alloc->initialization();
3198 if (init != nullptr)
3199 *np = init->in(TypeFunc::Memory);
3200 else
3201 *np = alloc->in(TypeFunc::Memory);
3202 return true;
3203 }
3204
3205 //----------------------------clear_memory-------------------------------------
3206 // Generate code to initialize object storage to zero.
3207 Node* ClearArrayNode::clear_memory(Node* ctl, Node* mem, Node* dest,
3208 intptr_t start_offset,
3209 Node* end_offset,
3210 PhaseGVN* phase) {
3211 intptr_t offset = start_offset;
3212
3213 int unit = BytesPerLong;
3214 if ((offset % unit) != 0) {
3215 Node* adr = new AddPNode(dest, dest, phase->MakeConX(offset));
3216 adr = phase->transform(adr);
3217 const TypePtr* atp = TypeRawPtr::BOTTOM;
3218 mem = StoreNode::make(*phase, ctl, mem, adr, atp, phase->zerocon(T_INT), T_INT, MemNode::unordered);
3219 mem = phase->transform(mem);
3220 offset += BytesPerInt;
3221 }
3222 assert((offset % unit) == 0, "");
3223
3224 // Initialize the remaining stuff, if any, with a ClearArray.
3225 return clear_memory(ctl, mem, dest, phase->MakeConX(offset), end_offset, phase);
3226 }
3227
3228 Node* ClearArrayNode::clear_memory(Node* ctl, Node* mem, Node* dest,
3229 Node* start_offset,
3230 Node* end_offset,
3231 PhaseGVN* phase) {
3232 if (start_offset == end_offset) {
3233 // nothing to do
3234 return mem;
3235 }
3236
3237 int unit = BytesPerLong;
3238 Node* zbase = start_offset;
3239 Node* zend = end_offset;
3240
3241 // Scale to the unit required by the CPU:
3242 if (!Matcher::init_array_count_is_in_bytes) {
3243 Node* shift = phase->intcon(exact_log2(unit));
3244 zbase = phase->transform(new URShiftXNode(zbase, shift) );
3245 zend = phase->transform(new URShiftXNode(zend, shift) );
3246 }
3247
3248 // Bulk clear double-words
3249 Node* zsize = phase->transform(new SubXNode(zend, zbase) );
3250 Node* adr = phase->transform(new AddPNode(dest, dest, start_offset) );
3251 mem = new ClearArrayNode(ctl, mem, zsize, adr, false);
3252 return phase->transform(mem);
3253 }
3254
3255 Node* ClearArrayNode::clear_memory(Node* ctl, Node* mem, Node* dest,
3256 intptr_t start_offset,
3257 intptr_t end_offset,
3258 PhaseGVN* phase) {
3259 if (start_offset == end_offset) {
3260 // nothing to do
3261 return mem;
3262 }
3263
3264 assert((end_offset % BytesPerInt) == 0, "odd end offset");
3265 intptr_t done_offset = end_offset;
3266 if ((done_offset % BytesPerLong) != 0) {
3267 done_offset -= BytesPerInt;
3268 }
3269 if (done_offset > start_offset) {
3270 mem = clear_memory(ctl, mem, dest,
3271 start_offset, phase->MakeConX(done_offset), phase);
3272 }
3273 if (done_offset < end_offset) { // emit the final 32-bit store
3274 Node* adr = new AddPNode(dest, dest, phase->MakeConX(done_offset));
3275 adr = phase->transform(adr);
3276 const TypePtr* atp = TypeRawPtr::BOTTOM;
3277 mem = StoreNode::make(*phase, ctl, mem, adr, atp, phase->zerocon(T_INT), T_INT, MemNode::unordered);
3278 mem = phase->transform(mem);
3279 done_offset += BytesPerInt;
3280 }
3281 assert(done_offset == end_offset, "");
3282 return mem;
3283 }
3284
3285 //=============================================================================
3286 MemBarNode::MemBarNode(Compile* C, int alias_idx, Node* precedent)
3287 : MultiNode(TypeFunc::Parms + (precedent == nullptr? 0: 1)),
3288 _adr_type(C->get_adr_type(alias_idx)), _kind(Standalone)
3289 #ifdef ASSERT
3290 , _pair_idx(0)
3291 #endif
3292 {
3293 init_class_id(Class_MemBar);
3294 Node* top = C->top();
3295 init_req(TypeFunc::I_O,top);
3296 init_req(TypeFunc::FramePtr,top);
3297 init_req(TypeFunc::ReturnAdr,top);
3298 if (precedent != nullptr)
3299 init_req(TypeFunc::Parms, precedent);
3300 }
3301
3302 //------------------------------cmp--------------------------------------------
3303 uint MemBarNode::hash() const { return NO_HASH; }
3304 bool MemBarNode::cmp( const Node &n ) const {
3305 return (&n == this); // Always fail except on self
3306 }
3307
3308 //------------------------------make-------------------------------------------
3309 MemBarNode* MemBarNode::make(Compile* C, int opcode, int atp, Node* pn) {
3310 switch (opcode) {
3311 case Op_MemBarAcquire: return new MemBarAcquireNode(C, atp, pn);
3312 case Op_LoadFence: return new LoadFenceNode(C, atp, pn);
3313 case Op_MemBarRelease: return new MemBarReleaseNode(C, atp, pn);
3314 case Op_StoreFence: return new StoreFenceNode(C, atp, pn);
3315 case Op_MemBarStoreStore: return new MemBarStoreStoreNode(C, atp, pn);
3316 case Op_StoreStoreFence: return new StoreStoreFenceNode(C, atp, pn);
3317 case Op_MemBarAcquireLock: return new MemBarAcquireLockNode(C, atp, pn);
3318 case Op_MemBarReleaseLock: return new MemBarReleaseLockNode(C, atp, pn);
3319 case Op_MemBarVolatile: return new MemBarVolatileNode(C, atp, pn);
3320 case Op_MemBarCPUOrder: return new MemBarCPUOrderNode(C, atp, pn);
3321 case Op_OnSpinWait: return new OnSpinWaitNode(C, atp, pn);
3322 case Op_Initialize: return new InitializeNode(C, atp, pn);
3323 default: ShouldNotReachHere(); return nullptr;
3324 }
3325 }
3326
3327 void MemBarNode::remove(PhaseIterGVN *igvn) {
3328 if (outcnt() != 2) {
3329 assert(Opcode() == Op_Initialize, "Only seen when there are no use of init memory");
3330 assert(outcnt() == 1, "Only control then");
3331 }
3332 if (trailing_store() || trailing_load_store()) {
3333 MemBarNode* leading = leading_membar();
3334 if (leading != nullptr) {
3335 assert(leading->trailing_membar() == this, "inconsistent leading/trailing membars");
3336 leading->remove(igvn);
3337 }
3338 }
3339 if (proj_out_or_null(TypeFunc::Memory) != nullptr) {
3340 igvn->replace_node(proj_out(TypeFunc::Memory), in(TypeFunc::Memory));
3341 }
3342 if (proj_out_or_null(TypeFunc::Control) != nullptr) {
3343 igvn->replace_node(proj_out(TypeFunc::Control), in(TypeFunc::Control));
3344 }
3345 }
3346
3347 //------------------------------Ideal------------------------------------------
3348 // Return a node which is more "ideal" than the current node. Strip out
3349 // control copies
3350 Node *MemBarNode::Ideal(PhaseGVN *phase, bool can_reshape) {
3351 if (remove_dead_region(phase, can_reshape)) return this;
3352 // Don't bother trying to transform a dead node
3353 if (in(0) && in(0)->is_top()) {
3354 return nullptr;
3355 }
3356
3357 bool progress = false;
3358 // Eliminate volatile MemBars for scalar replaced objects.
3359 if (can_reshape && req() == (Precedent+1)) {
3360 bool eliminate = false;
3361 int opc = Opcode();
3362 if ((opc == Op_MemBarAcquire || opc == Op_MemBarVolatile)) {
3363 // Volatile field loads and stores.
3364 Node* my_mem = in(MemBarNode::Precedent);
3365 // The MembarAquire may keep an unused LoadNode alive through the Precedent edge
3366 if ((my_mem != nullptr) && (opc == Op_MemBarAcquire) && (my_mem->outcnt() == 1)) {
3367 // if the Precedent is a decodeN and its input (a Load) is used at more than one place,
3368 // replace this Precedent (decodeN) with the Load instead.
3369 if ((my_mem->Opcode() == Op_DecodeN) && (my_mem->in(1)->outcnt() > 1)) {
3370 Node* load_node = my_mem->in(1);
3371 set_req(MemBarNode::Precedent, load_node);
3372 phase->is_IterGVN()->_worklist.push(my_mem);
3373 my_mem = load_node;
3374 } else {
3375 assert(my_mem->unique_out() == this, "sanity");
3376 assert(!trailing_load_store(), "load store node can't be eliminated");
3377 del_req(Precedent);
3378 phase->is_IterGVN()->_worklist.push(my_mem); // remove dead node later
3379 my_mem = nullptr;
3380 }
3381 progress = true;
3382 }
3383 if (my_mem != nullptr && my_mem->is_Mem()) {
3384 const TypeOopPtr* t_oop = my_mem->in(MemNode::Address)->bottom_type()->isa_oopptr();
3385 // Check for scalar replaced object reference.
3386 if( t_oop != nullptr && t_oop->is_known_instance_field() &&
3387 t_oop->offset() != Type::OffsetBot &&
3388 t_oop->offset() != Type::OffsetTop) {
3389 eliminate = true;
3390 }
3391 }
3392 } else if (opc == Op_MemBarRelease) {
3393 // Final field stores.
3394 Node* alloc = AllocateNode::Ideal_allocation(in(MemBarNode::Precedent), phase);
3395 if ((alloc != nullptr) && alloc->is_Allocate() &&
3396 alloc->as_Allocate()->does_not_escape_thread()) {
3397 // The allocated object does not escape.
3398 eliminate = true;
3399 }
3400 }
3401 if (eliminate) {
3402 // Replace MemBar projections by its inputs.
3403 PhaseIterGVN* igvn = phase->is_IterGVN();
3404 remove(igvn);
3405 // Must return either the original node (now dead) or a new node
3406 // (Do not return a top here, since that would break the uniqueness of top.)
3407 return new ConINode(TypeInt::ZERO);
3408 }
3409 }
3410 return progress ? this : nullptr;
3411 }
3412
3413 //------------------------------Value------------------------------------------
3414 const Type* MemBarNode::Value(PhaseGVN* phase) const {
3415 if( !in(0) ) return Type::TOP;
3416 if( phase->type(in(0)) == Type::TOP )
3417 return Type::TOP;
3418 return TypeTuple::MEMBAR;
3419 }
3420
3421 //------------------------------match------------------------------------------
3422 // Construct projections for memory.
3423 Node *MemBarNode::match( const ProjNode *proj, const Matcher *m ) {
3424 switch (proj->_con) {
3425 case TypeFunc::Control:
3426 case TypeFunc::Memory:
3427 return new MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj);
3428 }
3429 ShouldNotReachHere();
3430 return nullptr;
3431 }
3432
3433 void MemBarNode::set_store_pair(MemBarNode* leading, MemBarNode* trailing) {
3434 trailing->_kind = TrailingStore;
3435 leading->_kind = LeadingStore;
3436 #ifdef ASSERT
3437 trailing->_pair_idx = leading->_idx;
3438 leading->_pair_idx = leading->_idx;
3439 #endif
3440 }
3441
3442 void MemBarNode::set_load_store_pair(MemBarNode* leading, MemBarNode* trailing) {
3443 trailing->_kind = TrailingLoadStore;
3444 leading->_kind = LeadingLoadStore;
3445 #ifdef ASSERT
3446 trailing->_pair_idx = leading->_idx;
3447 leading->_pair_idx = leading->_idx;
3448 #endif
3449 }
3450
3451 MemBarNode* MemBarNode::trailing_membar() const {
3452 ResourceMark rm;
3453 Node* trailing = (Node*)this;
3454 VectorSet seen;
3455 Node_Stack multis(0);
3456 do {
3457 Node* c = trailing;
3458 uint i = 0;
3459 do {
3460 trailing = nullptr;
3461 for (; i < c->outcnt(); i++) {
3462 Node* next = c->raw_out(i);
3463 if (next != c && next->is_CFG()) {
3464 if (c->is_MultiBranch()) {
3465 if (multis.node() == c) {
3466 multis.set_index(i+1);
3467 } else {
3468 multis.push(c, i+1);
3469 }
3470 }
3471 trailing = next;
3472 break;
3473 }
3474 }
3475 if (trailing != nullptr && !seen.test_set(trailing->_idx)) {
3476 break;
3477 }
3478 while (multis.size() > 0) {
3479 c = multis.node();
3480 i = multis.index();
3481 if (i < c->req()) {
3482 break;
3483 }
3484 multis.pop();
3485 }
3486 } while (multis.size() > 0);
3487 } while (!trailing->is_MemBar() || !trailing->as_MemBar()->trailing());
3488
3489 MemBarNode* mb = trailing->as_MemBar();
3490 assert((mb->_kind == TrailingStore && _kind == LeadingStore) ||
3491 (mb->_kind == TrailingLoadStore && _kind == LeadingLoadStore), "bad trailing membar");
3492 assert(mb->_pair_idx == _pair_idx, "bad trailing membar");
3493 return mb;
3494 }
3495
3496 MemBarNode* MemBarNode::leading_membar() const {
3497 ResourceMark rm;
3498 VectorSet seen;
3499 Node_Stack regions(0);
3500 Node* leading = in(0);
3501 while (leading != nullptr && (!leading->is_MemBar() || !leading->as_MemBar()->leading())) {
3502 while (leading == nullptr || leading->is_top() || seen.test_set(leading->_idx)) {
3503 leading = nullptr;
3504 while (regions.size() > 0 && leading == nullptr) {
3505 Node* r = regions.node();
3506 uint i = regions.index();
3507 if (i < r->req()) {
3508 leading = r->in(i);
3509 regions.set_index(i+1);
3510 } else {
3511 regions.pop();
3512 }
3513 }
3514 if (leading == nullptr) {
3515 assert(regions.size() == 0, "all paths should have been tried");
3516 return nullptr;
3517 }
3518 }
3519 if (leading->is_Region()) {
3520 regions.push(leading, 2);
3521 leading = leading->in(1);
3522 } else {
3523 leading = leading->in(0);
3524 }
3525 }
3526 #ifdef ASSERT
3527 Unique_Node_List wq;
3528 wq.push((Node*)this);
3529 uint found = 0;
3530 for (uint i = 0; i < wq.size(); i++) {
3531 Node* n = wq.at(i);
3532 if (n->is_Region()) {
3533 for (uint j = 1; j < n->req(); j++) {
3534 Node* in = n->in(j);
3535 if (in != nullptr && !in->is_top()) {
3536 wq.push(in);
3537 }
3538 }
3539 } else {
3540 if (n->is_MemBar() && n->as_MemBar()->leading()) {
3541 assert(n == leading, "consistency check failed");
3542 found++;
3543 } else {
3544 Node* in = n->in(0);
3545 if (in != nullptr && !in->is_top()) {
3546 wq.push(in);
3547 }
3548 }
3549 }
3550 }
3551 assert(found == 1 || (found == 0 && leading == nullptr), "consistency check failed");
3552 #endif
3553 if (leading == nullptr) {
3554 return nullptr;
3555 }
3556 MemBarNode* mb = leading->as_MemBar();
3557 assert((mb->_kind == LeadingStore && _kind == TrailingStore) ||
3558 (mb->_kind == LeadingLoadStore && _kind == TrailingLoadStore), "bad leading membar");
3559 assert(mb->_pair_idx == _pair_idx, "bad leading membar");
3560 return mb;
3561 }
3562
3563
3564 //===========================InitializeNode====================================
3565 // SUMMARY:
3566 // This node acts as a memory barrier on raw memory, after some raw stores.
3567 // The 'cooked' oop value feeds from the Initialize, not the Allocation.
3568 // The Initialize can 'capture' suitably constrained stores as raw inits.
3569 // It can coalesce related raw stores into larger units (called 'tiles').
3570 // It can avoid zeroing new storage for memory units which have raw inits.
3571 // At macro-expansion, it is marked 'complete', and does not optimize further.
3572 //
3573 // EXAMPLE:
3574 // The object 'new short[2]' occupies 16 bytes in a 32-bit machine.
3575 // ctl = incoming control; mem* = incoming memory
3576 // (Note: A star * on a memory edge denotes I/O and other standard edges.)
3577 // First allocate uninitialized memory and fill in the header:
3578 // alloc = (Allocate ctl mem* 16 #short[].klass ...)
3579 // ctl := alloc.Control; mem* := alloc.Memory*
3580 // rawmem = alloc.Memory; rawoop = alloc.RawAddress
3581 // Then initialize to zero the non-header parts of the raw memory block:
3582 // init = (Initialize alloc.Control alloc.Memory* alloc.RawAddress)
3583 // ctl := init.Control; mem.SLICE(#short[*]) := init.Memory
3584 // After the initialize node executes, the object is ready for service:
3585 // oop := (CheckCastPP init.Control alloc.RawAddress #short[])
3586 // Suppose its body is immediately initialized as {1,2}:
3587 // store1 = (StoreC init.Control init.Memory (+ oop 12) 1)
3588 // store2 = (StoreC init.Control store1 (+ oop 14) 2)
3589 // mem.SLICE(#short[*]) := store2
3590 //
3591 // DETAILS:
3592 // An InitializeNode collects and isolates object initialization after
3593 // an AllocateNode and before the next possible safepoint. As a
3594 // memory barrier (MemBarNode), it keeps critical stores from drifting
3595 // down past any safepoint or any publication of the allocation.
3596 // Before this barrier, a newly-allocated object may have uninitialized bits.
3597 // After this barrier, it may be treated as a real oop, and GC is allowed.
3598 //
3599 // The semantics of the InitializeNode include an implicit zeroing of
3600 // the new object from object header to the end of the object.
3601 // (The object header and end are determined by the AllocateNode.)
3602 //
3603 // Certain stores may be added as direct inputs to the InitializeNode.
3604 // These stores must update raw memory, and they must be to addresses
3605 // derived from the raw address produced by AllocateNode, and with
3606 // a constant offset. They must be ordered by increasing offset.
3607 // The first one is at in(RawStores), the last at in(req()-1).
3608 // Unlike most memory operations, they are not linked in a chain,
3609 // but are displayed in parallel as users of the rawmem output of
3610 // the allocation.
3611 //
3612 // (See comments in InitializeNode::capture_store, which continue
3613 // the example given above.)
3614 //
3615 // When the associated Allocate is macro-expanded, the InitializeNode
3616 // may be rewritten to optimize collected stores. A ClearArrayNode
3617 // may also be created at that point to represent any required zeroing.
3618 // The InitializeNode is then marked 'complete', prohibiting further
3619 // capturing of nearby memory operations.
3620 //
3621 // During macro-expansion, all captured initializations which store
3622 // constant values of 32 bits or smaller are coalesced (if advantageous)
3623 // into larger 'tiles' 32 or 64 bits. This allows an object to be
3624 // initialized in fewer memory operations. Memory words which are
3625 // covered by neither tiles nor non-constant stores are pre-zeroed
3626 // by explicit stores of zero. (The code shape happens to do all
3627 // zeroing first, then all other stores, with both sequences occurring
3628 // in order of ascending offsets.)
3629 //
3630 // Alternatively, code may be inserted between an AllocateNode and its
3631 // InitializeNode, to perform arbitrary initialization of the new object.
3632 // E.g., the object copying intrinsics insert complex data transfers here.
3633 // The initialization must then be marked as 'complete' disable the
3634 // built-in zeroing semantics and the collection of initializing stores.
3635 //
3636 // While an InitializeNode is incomplete, reads from the memory state
3637 // produced by it are optimizable if they match the control edge and
3638 // new oop address associated with the allocation/initialization.
3639 // They return a stored value (if the offset matches) or else zero.
3640 // A write to the memory state, if it matches control and address,
3641 // and if it is to a constant offset, may be 'captured' by the
3642 // InitializeNode. It is cloned as a raw memory operation and rewired
3643 // inside the initialization, to the raw oop produced by the allocation.
3644 // Operations on addresses which are provably distinct (e.g., to
3645 // other AllocateNodes) are allowed to bypass the initialization.
3646 //
3647 // The effect of all this is to consolidate object initialization
3648 // (both arrays and non-arrays, both piecewise and bulk) into a
3649 // single location, where it can be optimized as a unit.
3650 //
3651 // Only stores with an offset less than TrackedInitializationLimit words
3652 // will be considered for capture by an InitializeNode. This puts a
3653 // reasonable limit on the complexity of optimized initializations.
3654
3655 //---------------------------InitializeNode------------------------------------
3656 InitializeNode::InitializeNode(Compile* C, int adr_type, Node* rawoop)
3657 : MemBarNode(C, adr_type, rawoop),
3658 _is_complete(Incomplete), _does_not_escape(false)
3659 {
3660 init_class_id(Class_Initialize);
3661
3662 assert(adr_type == Compile::AliasIdxRaw, "only valid atp");
3663 assert(in(RawAddress) == rawoop, "proper init");
3664 // Note: allocation() can be null, for secondary initialization barriers
3665 }
3666
3667 // Since this node is not matched, it will be processed by the
3668 // register allocator. Declare that there are no constraints
3669 // on the allocation of the RawAddress edge.
3670 const RegMask &InitializeNode::in_RegMask(uint idx) const {
3671 // This edge should be set to top, by the set_complete. But be conservative.
3672 if (idx == InitializeNode::RawAddress)
3673 return *(Compile::current()->matcher()->idealreg2spillmask[in(idx)->ideal_reg()]);
3674 return RegMask::Empty;
3675 }
3676
3677 Node* InitializeNode::memory(uint alias_idx) {
3678 Node* mem = in(Memory);
3679 if (mem->is_MergeMem()) {
3680 return mem->as_MergeMem()->memory_at(alias_idx);
3681 } else {
3682 // incoming raw memory is not split
3683 return mem;
3684 }
3685 }
3686
3687 bool InitializeNode::is_non_zero() {
3688 if (is_complete()) return false;
3689 remove_extra_zeroes();
3690 return (req() > RawStores);
3691 }
3692
3693 void InitializeNode::set_complete(PhaseGVN* phase) {
3694 assert(!is_complete(), "caller responsibility");
3695 _is_complete = Complete;
3696
3697 // After this node is complete, it contains a bunch of
3698 // raw-memory initializations. There is no need for
3699 // it to have anything to do with non-raw memory effects.
3700 // Therefore, tell all non-raw users to re-optimize themselves,
3701 // after skipping the memory effects of this initialization.
3702 PhaseIterGVN* igvn = phase->is_IterGVN();
3703 if (igvn) igvn->add_users_to_worklist(this);
3704 }
3705
3706 // convenience function
3707 // return false if the init contains any stores already
3708 bool AllocateNode::maybe_set_complete(PhaseGVN* phase) {
3709 InitializeNode* init = initialization();
3710 if (init == nullptr || init->is_complete()) return false;
3711 init->remove_extra_zeroes();
3712 // for now, if this allocation has already collected any inits, bail:
3713 if (init->is_non_zero()) return false;
3714 init->set_complete(phase);
3715 return true;
3716 }
3717
3718 void InitializeNode::remove_extra_zeroes() {
3719 if (req() == RawStores) return;
3720 Node* zmem = zero_memory();
3721 uint fill = RawStores;
3722 for (uint i = fill; i < req(); i++) {
3723 Node* n = in(i);
3724 if (n->is_top() || n == zmem) continue; // skip
3725 if (fill < i) set_req(fill, n); // compact
3726 ++fill;
3727 }
3728 // delete any empty spaces created:
3729 while (fill < req()) {
3730 del_req(fill);
3731 }
3732 }
3733
3734 // Helper for remembering which stores go with which offsets.
3735 intptr_t InitializeNode::get_store_offset(Node* st, PhaseValues* phase) {
3736 if (!st->is_Store()) return -1; // can happen to dead code via subsume_node
3737 intptr_t offset = -1;
3738 Node* base = AddPNode::Ideal_base_and_offset(st->in(MemNode::Address),
3739 phase, offset);
3740 if (base == nullptr) return -1; // something is dead,
3741 if (offset < 0) return -1; // dead, dead
3742 return offset;
3743 }
3744
3745 // Helper for proving that an initialization expression is
3746 // "simple enough" to be folded into an object initialization.
3747 // Attempts to prove that a store's initial value 'n' can be captured
3748 // within the initialization without creating a vicious cycle, such as:
3749 // { Foo p = new Foo(); p.next = p; }
3750 // True for constants and parameters and small combinations thereof.
3751 bool InitializeNode::detect_init_independence(Node* value, PhaseGVN* phase) {
3752 ResourceMark rm;
3753 Unique_Node_List worklist;
3754 worklist.push(value);
3755
3756 uint complexity_limit = 20;
3757 for (uint j = 0; j < worklist.size(); j++) {
3758 if (j >= complexity_limit) {
3759 return false; // Bail out if processed too many nodes
3760 }
3761
3762 Node* n = worklist.at(j);
3763 if (n == nullptr) continue; // (can this really happen?)
3764 if (n->is_Proj()) n = n->in(0);
3765 if (n == this) return false; // found a cycle
3766 if (n->is_Con()) continue;
3767 if (n->is_Start()) continue; // params, etc., are OK
3768 if (n->is_Root()) continue; // even better
3769
3770 // There cannot be any dependency if 'n' is a CFG node that dominates the current allocation
3771 if (n->is_CFG() && phase->is_dominator(n, allocation())) {
3772 continue;
3773 }
3774
3775 Node* ctl = n->in(0);
3776 if (ctl != nullptr && !ctl->is_top()) {
3777 if (ctl->is_Proj()) ctl = ctl->in(0);
3778 if (ctl == this) return false;
3779
3780 // If we already know that the enclosing memory op is pinned right after
3781 // the init, then any control flow that the store has picked up
3782 // must have preceded the init, or else be equal to the init.
3783 // Even after loop optimizations (which might change control edges)
3784 // a store is never pinned *before* the availability of its inputs.
3785 if (!MemNode::all_controls_dominate(n, this))
3786 return false; // failed to prove a good control
3787 }
3788
3789 // Check data edges for possible dependencies on 'this'.
3790 for (uint i = 1; i < n->req(); i++) {
3791 Node* m = n->in(i);
3792 if (m == nullptr || m == n || m->is_top()) continue;
3793
3794 // Only process data inputs once
3795 worklist.push(m);
3796 }
3797 }
3798
3799 return true;
3800 }
3801
3802 // Here are all the checks a Store must pass before it can be moved into
3803 // an initialization. Returns zero if a check fails.
3804 // On success, returns the (constant) offset to which the store applies,
3805 // within the initialized memory.
3806 intptr_t InitializeNode::can_capture_store(StoreNode* st, PhaseGVN* phase, bool can_reshape) {
3807 const int FAIL = 0;
3808 if (st->req() != MemNode::ValueIn + 1)
3809 return FAIL; // an inscrutable StoreNode (card mark?)
3810 Node* ctl = st->in(MemNode::Control);
3811 if (!(ctl != nullptr && ctl->is_Proj() && ctl->in(0) == this))
3812 return FAIL; // must be unconditional after the initialization
3813 Node* mem = st->in(MemNode::Memory);
3814 if (!(mem->is_Proj() && mem->in(0) == this))
3815 return FAIL; // must not be preceded by other stores
3816 Node* adr = st->in(MemNode::Address);
3817 intptr_t offset;
3818 AllocateNode* alloc = AllocateNode::Ideal_allocation(adr, phase, offset);
3819 if (alloc == nullptr)
3820 return FAIL; // inscrutable address
3821 if (alloc != allocation())
3822 return FAIL; // wrong allocation! (store needs to float up)
3823 int size_in_bytes = st->memory_size();
3824 if ((size_in_bytes != 0) && (offset % size_in_bytes) != 0) {
3825 return FAIL; // mismatched access
3826 }
3827 Node* val = st->in(MemNode::ValueIn);
3828
3829 if (!detect_init_independence(val, phase))
3830 return FAIL; // stored value must be 'simple enough'
3831
3832 // The Store can be captured only if nothing after the allocation
3833 // and before the Store is using the memory location that the store
3834 // overwrites.
3835 bool failed = false;
3836 // If is_complete_with_arraycopy() is true the shape of the graph is
3837 // well defined and is safe so no need for extra checks.
3838 if (!is_complete_with_arraycopy()) {
3839 // We are going to look at each use of the memory state following
3840 // the allocation to make sure nothing reads the memory that the
3841 // Store writes.
3842 const TypePtr* t_adr = phase->type(adr)->isa_ptr();
3843 int alias_idx = phase->C->get_alias_index(t_adr);
3844 ResourceMark rm;
3845 Unique_Node_List mems;
3846 mems.push(mem);
3847 Node* unique_merge = nullptr;
3848 for (uint next = 0; next < mems.size(); ++next) {
3849 Node *m = mems.at(next);
3850 for (DUIterator_Fast jmax, j = m->fast_outs(jmax); j < jmax; j++) {
3851 Node *n = m->fast_out(j);
3852 if (n->outcnt() == 0) {
3853 continue;
3854 }
3855 if (n == st) {
3856 continue;
3857 } else if (n->in(0) != nullptr && n->in(0) != ctl) {
3858 // If the control of this use is different from the control
3859 // of the Store which is right after the InitializeNode then
3860 // this node cannot be between the InitializeNode and the
3861 // Store.
3862 continue;
3863 } else if (n->is_MergeMem()) {
3864 if (n->as_MergeMem()->memory_at(alias_idx) == m) {
3865 // We can hit a MergeMemNode (that will likely go away
3866 // later) that is a direct use of the memory state
3867 // following the InitializeNode on the same slice as the
3868 // store node that we'd like to capture. We need to check
3869 // the uses of the MergeMemNode.
3870 mems.push(n);
3871 }
3872 } else if (n->is_Mem()) {
3873 Node* other_adr = n->in(MemNode::Address);
3874 if (other_adr == adr) {
3875 failed = true;
3876 break;
3877 } else {
3878 const TypePtr* other_t_adr = phase->type(other_adr)->isa_ptr();
3879 if (other_t_adr != nullptr) {
3880 int other_alias_idx = phase->C->get_alias_index(other_t_adr);
3881 if (other_alias_idx == alias_idx) {
3882 // A load from the same memory slice as the store right
3883 // after the InitializeNode. We check the control of the
3884 // object/array that is loaded from. If it's the same as
3885 // the store control then we cannot capture the store.
3886 assert(!n->is_Store(), "2 stores to same slice on same control?");
3887 Node* base = other_adr;
3888 assert(base->is_AddP(), "should be addp but is %s", base->Name());
3889 base = base->in(AddPNode::Base);
3890 if (base != nullptr) {
3891 base = base->uncast();
3892 if (base->is_Proj() && base->in(0) == alloc) {
3893 failed = true;
3894 break;
3895 }
3896 }
3897 }
3898 }
3899 }
3900 } else {
3901 failed = true;
3902 break;
3903 }
3904 }
3905 }
3906 }
3907 if (failed) {
3908 if (!can_reshape) {
3909 // We decided we couldn't capture the store during parsing. We
3910 // should try again during the next IGVN once the graph is
3911 // cleaner.
3912 phase->C->record_for_igvn(st);
3913 }
3914 return FAIL;
3915 }
3916
3917 return offset; // success
3918 }
3919
3920 // Find the captured store in(i) which corresponds to the range
3921 // [start..start+size) in the initialized object.
3922 // If there is one, return its index i. If there isn't, return the
3923 // negative of the index where it should be inserted.
3924 // Return 0 if the queried range overlaps an initialization boundary
3925 // or if dead code is encountered.
3926 // If size_in_bytes is zero, do not bother with overlap checks.
3927 int InitializeNode::captured_store_insertion_point(intptr_t start,
3928 int size_in_bytes,
3929 PhaseValues* phase) {
3930 const int FAIL = 0, MAX_STORE = MAX2(BytesPerLong, (int)MaxVectorSize);
3931
3932 if (is_complete())
3933 return FAIL; // arraycopy got here first; punt
3934
3935 assert(allocation() != nullptr, "must be present");
3936
3937 // no negatives, no header fields:
3938 if (start < (intptr_t) allocation()->minimum_header_size()) return FAIL;
3939
3940 // after a certain size, we bail out on tracking all the stores:
3941 intptr_t ti_limit = (TrackedInitializationLimit * HeapWordSize);
3942 if (start >= ti_limit) return FAIL;
3943
3944 for (uint i = InitializeNode::RawStores, limit = req(); ; ) {
3945 if (i >= limit) return -(int)i; // not found; here is where to put it
3946
3947 Node* st = in(i);
3948 intptr_t st_off = get_store_offset(st, phase);
3949 if (st_off < 0) {
3950 if (st != zero_memory()) {
3951 return FAIL; // bail out if there is dead garbage
3952 }
3953 } else if (st_off > start) {
3954 // ...we are done, since stores are ordered
3955 if (st_off < start + size_in_bytes) {
3956 return FAIL; // the next store overlaps
3957 }
3958 return -(int)i; // not found; here is where to put it
3959 } else if (st_off < start) {
3960 assert(st->as_Store()->memory_size() <= MAX_STORE, "");
3961 if (size_in_bytes != 0 &&
3962 start < st_off + MAX_STORE &&
3963 start < st_off + st->as_Store()->memory_size()) {
3964 return FAIL; // the previous store overlaps
3965 }
3966 } else {
3967 if (size_in_bytes != 0 &&
3968 st->as_Store()->memory_size() != size_in_bytes) {
3969 return FAIL; // mismatched store size
3970 }
3971 return i;
3972 }
3973
3974 ++i;
3975 }
3976 }
3977
3978 // Look for a captured store which initializes at the offset 'start'
3979 // with the given size. If there is no such store, and no other
3980 // initialization interferes, then return zero_memory (the memory
3981 // projection of the AllocateNode).
3982 Node* InitializeNode::find_captured_store(intptr_t start, int size_in_bytes,
3983 PhaseValues* phase) {
3984 assert(stores_are_sane(phase), "");
3985 int i = captured_store_insertion_point(start, size_in_bytes, phase);
3986 if (i == 0) {
3987 return nullptr; // something is dead
3988 } else if (i < 0) {
3989 return zero_memory(); // just primordial zero bits here
3990 } else {
3991 Node* st = in(i); // here is the store at this position
3992 assert(get_store_offset(st->as_Store(), phase) == start, "sanity");
3993 return st;
3994 }
3995 }
3996
3997 // Create, as a raw pointer, an address within my new object at 'offset'.
3998 Node* InitializeNode::make_raw_address(intptr_t offset,
3999 PhaseGVN* phase) {
4000 Node* addr = in(RawAddress);
4001 if (offset != 0) {
4002 Compile* C = phase->C;
4003 addr = phase->transform( new AddPNode(C->top(), addr,
4004 phase->MakeConX(offset)) );
4005 }
4006 return addr;
4007 }
4008
4009 // Clone the given store, converting it into a raw store
4010 // initializing a field or element of my new object.
4011 // Caller is responsible for retiring the original store,
4012 // with subsume_node or the like.
4013 //
4014 // From the example above InitializeNode::InitializeNode,
4015 // here are the old stores to be captured:
4016 // store1 = (StoreC init.Control init.Memory (+ oop 12) 1)
4017 // store2 = (StoreC init.Control store1 (+ oop 14) 2)
4018 //
4019 // Here is the changed code; note the extra edges on init:
4020 // alloc = (Allocate ...)
4021 // rawoop = alloc.RawAddress
4022 // rawstore1 = (StoreC alloc.Control alloc.Memory (+ rawoop 12) 1)
4023 // rawstore2 = (StoreC alloc.Control alloc.Memory (+ rawoop 14) 2)
4024 // init = (Initialize alloc.Control alloc.Memory rawoop
4025 // rawstore1 rawstore2)
4026 //
4027 Node* InitializeNode::capture_store(StoreNode* st, intptr_t start,
4028 PhaseGVN* phase, bool can_reshape) {
4029 assert(stores_are_sane(phase), "");
4030
4031 if (start < 0) return nullptr;
4032 assert(can_capture_store(st, phase, can_reshape) == start, "sanity");
4033
4034 Compile* C = phase->C;
4035 int size_in_bytes = st->memory_size();
4036 int i = captured_store_insertion_point(start, size_in_bytes, phase);
4037 if (i == 0) return nullptr; // bail out
4038 Node* prev_mem = nullptr; // raw memory for the captured store
4039 if (i > 0) {
4040 prev_mem = in(i); // there is a pre-existing store under this one
4041 set_req(i, C->top()); // temporarily disconnect it
4042 // See StoreNode::Ideal 'st->outcnt() == 1' for the reason to disconnect.
4043 } else {
4044 i = -i; // no pre-existing store
4045 prev_mem = zero_memory(); // a slice of the newly allocated object
4046 if (i > InitializeNode::RawStores && in(i-1) == prev_mem)
4047 set_req(--i, C->top()); // reuse this edge; it has been folded away
4048 else
4049 ins_req(i, C->top()); // build a new edge
4050 }
4051 Node* new_st = st->clone();
4052 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
4053 new_st->set_req(MemNode::Control, in(Control));
4054 new_st->set_req(MemNode::Memory, prev_mem);
4055 new_st->set_req(MemNode::Address, make_raw_address(start, phase));
4056 bs->eliminate_gc_barrier_data(new_st);
4057 new_st = phase->transform(new_st);
4058
4059 // At this point, new_st might have swallowed a pre-existing store
4060 // at the same offset, or perhaps new_st might have disappeared,
4061 // if it redundantly stored the same value (or zero to fresh memory).
4062
4063 // In any case, wire it in:
4064 PhaseIterGVN* igvn = phase->is_IterGVN();
4065 if (igvn) {
4066 igvn->rehash_node_delayed(this);
4067 }
4068 set_req(i, new_st);
4069
4070 // The caller may now kill the old guy.
4071 DEBUG_ONLY(Node* check_st = find_captured_store(start, size_in_bytes, phase));
4072 assert(check_st == new_st || check_st == nullptr, "must be findable");
4073 assert(!is_complete(), "");
4074 return new_st;
4075 }
4076
4077 static bool store_constant(jlong* tiles, int num_tiles,
4078 intptr_t st_off, int st_size,
4079 jlong con) {
4080 if ((st_off & (st_size-1)) != 0)
4081 return false; // strange store offset (assume size==2**N)
4082 address addr = (address)tiles + st_off;
4083 assert(st_off >= 0 && addr+st_size <= (address)&tiles[num_tiles], "oob");
4084 switch (st_size) {
4085 case sizeof(jbyte): *(jbyte*) addr = (jbyte) con; break;
4086 case sizeof(jchar): *(jchar*) addr = (jchar) con; break;
4087 case sizeof(jint): *(jint*) addr = (jint) con; break;
4088 case sizeof(jlong): *(jlong*) addr = (jlong) con; break;
4089 default: return false; // strange store size (detect size!=2**N here)
4090 }
4091 return true; // return success to caller
4092 }
4093
4094 // Coalesce subword constants into int constants and possibly
4095 // into long constants. The goal, if the CPU permits,
4096 // is to initialize the object with a small number of 64-bit tiles.
4097 // Also, convert floating-point constants to bit patterns.
4098 // Non-constants are not relevant to this pass.
4099 //
4100 // In terms of the running example on InitializeNode::InitializeNode
4101 // and InitializeNode::capture_store, here is the transformation
4102 // of rawstore1 and rawstore2 into rawstore12:
4103 // alloc = (Allocate ...)
4104 // rawoop = alloc.RawAddress
4105 // tile12 = 0x00010002
4106 // rawstore12 = (StoreI alloc.Control alloc.Memory (+ rawoop 12) tile12)
4107 // init = (Initialize alloc.Control alloc.Memory rawoop rawstore12)
4108 //
4109 void
4110 InitializeNode::coalesce_subword_stores(intptr_t header_size,
4111 Node* size_in_bytes,
4112 PhaseGVN* phase) {
4113 Compile* C = phase->C;
4114
4115 assert(stores_are_sane(phase), "");
4116 // Note: After this pass, they are not completely sane,
4117 // since there may be some overlaps.
4118
4119 int old_subword = 0, old_long = 0, new_int = 0, new_long = 0;
4120
4121 intptr_t ti_limit = (TrackedInitializationLimit * HeapWordSize);
4122 intptr_t size_limit = phase->find_intptr_t_con(size_in_bytes, ti_limit);
4123 size_limit = MIN2(size_limit, ti_limit);
4124 size_limit = align_up(size_limit, BytesPerLong);
4125 int num_tiles = size_limit / BytesPerLong;
4126
4127 // allocate space for the tile map:
4128 const int small_len = DEBUG_ONLY(true ? 3 :) 30; // keep stack frames small
4129 jlong tiles_buf[small_len];
4130 Node* nodes_buf[small_len];
4131 jlong inits_buf[small_len];
4132 jlong* tiles = ((num_tiles <= small_len) ? &tiles_buf[0]
4133 : NEW_RESOURCE_ARRAY(jlong, num_tiles));
4134 Node** nodes = ((num_tiles <= small_len) ? &nodes_buf[0]
4135 : NEW_RESOURCE_ARRAY(Node*, num_tiles));
4136 jlong* inits = ((num_tiles <= small_len) ? &inits_buf[0]
4137 : NEW_RESOURCE_ARRAY(jlong, num_tiles));
4138 // tiles: exact bitwise model of all primitive constants
4139 // nodes: last constant-storing node subsumed into the tiles model
4140 // inits: which bytes (in each tile) are touched by any initializations
4141
4142 //// Pass A: Fill in the tile model with any relevant stores.
4143
4144 Copy::zero_to_bytes(tiles, sizeof(tiles[0]) * num_tiles);
4145 Copy::zero_to_bytes(nodes, sizeof(nodes[0]) * num_tiles);
4146 Copy::zero_to_bytes(inits, sizeof(inits[0]) * num_tiles);
4147 Node* zmem = zero_memory(); // initially zero memory state
4148 for (uint i = InitializeNode::RawStores, limit = req(); i < limit; i++) {
4149 Node* st = in(i);
4150 intptr_t st_off = get_store_offset(st, phase);
4151
4152 // Figure out the store's offset and constant value:
4153 if (st_off < header_size) continue; //skip (ignore header)
4154 if (st->in(MemNode::Memory) != zmem) continue; //skip (odd store chain)
4155 int st_size = st->as_Store()->memory_size();
4156 if (st_off + st_size > size_limit) break;
4157
4158 // Record which bytes are touched, whether by constant or not.
4159 if (!store_constant(inits, num_tiles, st_off, st_size, (jlong) -1))
4160 continue; // skip (strange store size)
4161
4162 const Type* val = phase->type(st->in(MemNode::ValueIn));
4163 if (!val->singleton()) continue; //skip (non-con store)
4164 BasicType type = val->basic_type();
4165
4166 jlong con = 0;
4167 switch (type) {
4168 case T_INT: con = val->is_int()->get_con(); break;
4169 case T_LONG: con = val->is_long()->get_con(); break;
4170 case T_FLOAT: con = jint_cast(val->getf()); break;
4171 case T_DOUBLE: con = jlong_cast(val->getd()); break;
4172 default: continue; //skip (odd store type)
4173 }
4174
4175 if (type == T_LONG && Matcher::isSimpleConstant64(con) &&
4176 st->Opcode() == Op_StoreL) {
4177 continue; // This StoreL is already optimal.
4178 }
4179
4180 // Store down the constant.
4181 store_constant(tiles, num_tiles, st_off, st_size, con);
4182
4183 intptr_t j = st_off >> LogBytesPerLong;
4184
4185 if (type == T_INT && st_size == BytesPerInt
4186 && (st_off & BytesPerInt) == BytesPerInt) {
4187 jlong lcon = tiles[j];
4188 if (!Matcher::isSimpleConstant64(lcon) &&
4189 st->Opcode() == Op_StoreI) {
4190 // This StoreI is already optimal by itself.
4191 jint* intcon = (jint*) &tiles[j];
4192 intcon[1] = 0; // undo the store_constant()
4193
4194 // If the previous store is also optimal by itself, back up and
4195 // undo the action of the previous loop iteration... if we can.
4196 // But if we can't, just let the previous half take care of itself.
4197 st = nodes[j];
4198 st_off -= BytesPerInt;
4199 con = intcon[0];
4200 if (con != 0 && st != nullptr && st->Opcode() == Op_StoreI) {
4201 assert(st_off >= header_size, "still ignoring header");
4202 assert(get_store_offset(st, phase) == st_off, "must be");
4203 assert(in(i-1) == zmem, "must be");
4204 DEBUG_ONLY(const Type* tcon = phase->type(st->in(MemNode::ValueIn)));
4205 assert(con == tcon->is_int()->get_con(), "must be");
4206 // Undo the effects of the previous loop trip, which swallowed st:
4207 intcon[0] = 0; // undo store_constant()
4208 set_req(i-1, st); // undo set_req(i, zmem)
4209 nodes[j] = nullptr; // undo nodes[j] = st
4210 --old_subword; // undo ++old_subword
4211 }
4212 continue; // This StoreI is already optimal.
4213 }
4214 }
4215
4216 // This store is not needed.
4217 set_req(i, zmem);
4218 nodes[j] = st; // record for the moment
4219 if (st_size < BytesPerLong) // something has changed
4220 ++old_subword; // includes int/float, but who's counting...
4221 else ++old_long;
4222 }
4223
4224 if ((old_subword + old_long) == 0)
4225 return; // nothing more to do
4226
4227 //// Pass B: Convert any non-zero tiles into optimal constant stores.
4228 // Be sure to insert them before overlapping non-constant stores.
4229 // (E.g., byte[] x = { 1,2,y,4 } => x[int 0] = 0x01020004, x[2]=y.)
4230 for (int j = 0; j < num_tiles; j++) {
4231 jlong con = tiles[j];
4232 jlong init = inits[j];
4233 if (con == 0) continue;
4234 jint con0, con1; // split the constant, address-wise
4235 jint init0, init1; // split the init map, address-wise
4236 { union { jlong con; jint intcon[2]; } u;
4237 u.con = con;
4238 con0 = u.intcon[0];
4239 con1 = u.intcon[1];
4240 u.con = init;
4241 init0 = u.intcon[0];
4242 init1 = u.intcon[1];
4243 }
4244
4245 Node* old = nodes[j];
4246 assert(old != nullptr, "need the prior store");
4247 intptr_t offset = (j * BytesPerLong);
4248
4249 bool split = !Matcher::isSimpleConstant64(con);
4250
4251 if (offset < header_size) {
4252 assert(offset + BytesPerInt >= header_size, "second int counts");
4253 assert(*(jint*)&tiles[j] == 0, "junk in header");
4254 split = true; // only the second word counts
4255 // Example: int a[] = { 42 ... }
4256 } else if (con0 == 0 && init0 == -1) {
4257 split = true; // first word is covered by full inits
4258 // Example: int a[] = { ... foo(), 42 ... }
4259 } else if (con1 == 0 && init1 == -1) {
4260 split = true; // second word is covered by full inits
4261 // Example: int a[] = { ... 42, foo() ... }
4262 }
4263
4264 // Here's a case where init0 is neither 0 nor -1:
4265 // byte a[] = { ... 0,0,foo(),0, 0,0,0,42 ... }
4266 // Assuming big-endian memory, init0, init1 are 0x0000FF00, 0x000000FF.
4267 // In this case the tile is not split; it is (jlong)42.
4268 // The big tile is stored down, and then the foo() value is inserted.
4269 // (If there were foo(),foo() instead of foo(),0, init0 would be -1.)
4270
4271 Node* ctl = old->in(MemNode::Control);
4272 Node* adr = make_raw_address(offset, phase);
4273 const TypePtr* atp = TypeRawPtr::BOTTOM;
4274
4275 // One or two coalesced stores to plop down.
4276 Node* st[2];
4277 intptr_t off[2];
4278 int nst = 0;
4279 if (!split) {
4280 ++new_long;
4281 off[nst] = offset;
4282 st[nst++] = StoreNode::make(*phase, ctl, zmem, adr, atp,
4283 phase->longcon(con), T_LONG, MemNode::unordered);
4284 } else {
4285 // Omit either if it is a zero.
4286 if (con0 != 0) {
4287 ++new_int;
4288 off[nst] = offset;
4289 st[nst++] = StoreNode::make(*phase, ctl, zmem, adr, atp,
4290 phase->intcon(con0), T_INT, MemNode::unordered);
4291 }
4292 if (con1 != 0) {
4293 ++new_int;
4294 offset += BytesPerInt;
4295 adr = make_raw_address(offset, phase);
4296 off[nst] = offset;
4297 st[nst++] = StoreNode::make(*phase, ctl, zmem, adr, atp,
4298 phase->intcon(con1), T_INT, MemNode::unordered);
4299 }
4300 }
4301
4302 // Insert second store first, then the first before the second.
4303 // Insert each one just before any overlapping non-constant stores.
4304 while (nst > 0) {
4305 Node* st1 = st[--nst];
4306 C->copy_node_notes_to(st1, old);
4307 st1 = phase->transform(st1);
4308 offset = off[nst];
4309 assert(offset >= header_size, "do not smash header");
4310 int ins_idx = captured_store_insertion_point(offset, /*size:*/0, phase);
4311 guarantee(ins_idx != 0, "must re-insert constant store");
4312 if (ins_idx < 0) ins_idx = -ins_idx; // never overlap
4313 if (ins_idx > InitializeNode::RawStores && in(ins_idx-1) == zmem)
4314 set_req(--ins_idx, st1);
4315 else
4316 ins_req(ins_idx, st1);
4317 }
4318 }
4319
4320 if (PrintCompilation && WizardMode)
4321 tty->print_cr("Changed %d/%d subword/long constants into %d/%d int/long",
4322 old_subword, old_long, new_int, new_long);
4323 if (C->log() != nullptr)
4324 C->log()->elem("comment that='%d/%d subword/long to %d/%d int/long'",
4325 old_subword, old_long, new_int, new_long);
4326
4327 // Clean up any remaining occurrences of zmem:
4328 remove_extra_zeroes();
4329 }
4330
4331 // Explore forward from in(start) to find the first fully initialized
4332 // word, and return its offset. Skip groups of subword stores which
4333 // together initialize full words. If in(start) is itself part of a
4334 // fully initialized word, return the offset of in(start). If there
4335 // are no following full-word stores, or if something is fishy, return
4336 // a negative value.
4337 intptr_t InitializeNode::find_next_fullword_store(uint start, PhaseGVN* phase) {
4338 int int_map = 0;
4339 intptr_t int_map_off = 0;
4340 const int FULL_MAP = right_n_bits(BytesPerInt); // the int_map we hope for
4341
4342 for (uint i = start, limit = req(); i < limit; i++) {
4343 Node* st = in(i);
4344
4345 intptr_t st_off = get_store_offset(st, phase);
4346 if (st_off < 0) break; // return conservative answer
4347
4348 int st_size = st->as_Store()->memory_size();
4349 if (st_size >= BytesPerInt && (st_off % BytesPerInt) == 0) {
4350 return st_off; // we found a complete word init
4351 }
4352
4353 // update the map:
4354
4355 intptr_t this_int_off = align_down(st_off, BytesPerInt);
4356 if (this_int_off != int_map_off) {
4357 // reset the map:
4358 int_map = 0;
4359 int_map_off = this_int_off;
4360 }
4361
4362 int subword_off = st_off - this_int_off;
4363 int_map |= right_n_bits(st_size) << subword_off;
4364 if ((int_map & FULL_MAP) == FULL_MAP) {
4365 return this_int_off; // we found a complete word init
4366 }
4367
4368 // Did this store hit or cross the word boundary?
4369 intptr_t next_int_off = align_down(st_off + st_size, BytesPerInt);
4370 if (next_int_off == this_int_off + BytesPerInt) {
4371 // We passed the current int, without fully initializing it.
4372 int_map_off = next_int_off;
4373 int_map >>= BytesPerInt;
4374 } else if (next_int_off > this_int_off + BytesPerInt) {
4375 // We passed the current and next int.
4376 return this_int_off + BytesPerInt;
4377 }
4378 }
4379
4380 return -1;
4381 }
4382
4383
4384 // Called when the associated AllocateNode is expanded into CFG.
4385 // At this point, we may perform additional optimizations.
4386 // Linearize the stores by ascending offset, to make memory
4387 // activity as coherent as possible.
4388 Node* InitializeNode::complete_stores(Node* rawctl, Node* rawmem, Node* rawptr,
4389 intptr_t header_size,
4390 Node* size_in_bytes,
4391 PhaseIterGVN* phase) {
4392 assert(!is_complete(), "not already complete");
4393 assert(stores_are_sane(phase), "");
4394 assert(allocation() != nullptr, "must be present");
4395
4396 remove_extra_zeroes();
4397
4398 if (ReduceFieldZeroing || ReduceBulkZeroing)
4399 // reduce instruction count for common initialization patterns
4400 coalesce_subword_stores(header_size, size_in_bytes, phase);
4401
4402 Node* zmem = zero_memory(); // initially zero memory state
4403 Node* inits = zmem; // accumulating a linearized chain of inits
4404 #ifdef ASSERT
4405 intptr_t first_offset = allocation()->minimum_header_size();
4406 intptr_t last_init_off = first_offset; // previous init offset
4407 intptr_t last_init_end = first_offset; // previous init offset+size
4408 intptr_t last_tile_end = first_offset; // previous tile offset+size
4409 #endif
4410 intptr_t zeroes_done = header_size;
4411
4412 bool do_zeroing = true; // we might give up if inits are very sparse
4413 int big_init_gaps = 0; // how many large gaps have we seen?
4414
4415 if (UseTLAB && ZeroTLAB) do_zeroing = false;
4416 if (!ReduceFieldZeroing && !ReduceBulkZeroing) do_zeroing = false;
4417
4418 for (uint i = InitializeNode::RawStores, limit = req(); i < limit; i++) {
4419 Node* st = in(i);
4420 intptr_t st_off = get_store_offset(st, phase);
4421 if (st_off < 0)
4422 break; // unknown junk in the inits
4423 if (st->in(MemNode::Memory) != zmem)
4424 break; // complicated store chains somehow in list
4425
4426 int st_size = st->as_Store()->memory_size();
4427 intptr_t next_init_off = st_off + st_size;
4428
4429 if (do_zeroing && zeroes_done < next_init_off) {
4430 // See if this store needs a zero before it or under it.
4431 intptr_t zeroes_needed = st_off;
4432
4433 if (st_size < BytesPerInt) {
4434 // Look for subword stores which only partially initialize words.
4435 // If we find some, we must lay down some word-level zeroes first,
4436 // underneath the subword stores.
4437 //
4438 // Examples:
4439 // byte[] a = { p,q,r,s } => a[0]=p,a[1]=q,a[2]=r,a[3]=s
4440 // byte[] a = { x,y,0,0 } => a[0..3] = 0, a[0]=x,a[1]=y
4441 // byte[] a = { 0,0,z,0 } => a[0..3] = 0, a[2]=z
4442 //
4443 // Note: coalesce_subword_stores may have already done this,
4444 // if it was prompted by constant non-zero subword initializers.
4445 // But this case can still arise with non-constant stores.
4446
4447 intptr_t next_full_store = find_next_fullword_store(i, phase);
4448
4449 // In the examples above:
4450 // in(i) p q r s x y z
4451 // st_off 12 13 14 15 12 13 14
4452 // st_size 1 1 1 1 1 1 1
4453 // next_full_s. 12 16 16 16 16 16 16
4454 // z's_done 12 16 16 16 12 16 12
4455 // z's_needed 12 16 16 16 16 16 16
4456 // zsize 0 0 0 0 4 0 4
4457 if (next_full_store < 0) {
4458 // Conservative tack: Zero to end of current word.
4459 zeroes_needed = align_up(zeroes_needed, BytesPerInt);
4460 } else {
4461 // Zero to beginning of next fully initialized word.
4462 // Or, don't zero at all, if we are already in that word.
4463 assert(next_full_store >= zeroes_needed, "must go forward");
4464 assert((next_full_store & (BytesPerInt-1)) == 0, "even boundary");
4465 zeroes_needed = next_full_store;
4466 }
4467 }
4468
4469 if (zeroes_needed > zeroes_done) {
4470 intptr_t zsize = zeroes_needed - zeroes_done;
4471 // Do some incremental zeroing on rawmem, in parallel with inits.
4472 zeroes_done = align_down(zeroes_done, BytesPerInt);
4473 rawmem = ClearArrayNode::clear_memory(rawctl, rawmem, rawptr,
4474 zeroes_done, zeroes_needed,
4475 phase);
4476 zeroes_done = zeroes_needed;
4477 if (zsize > InitArrayShortSize && ++big_init_gaps > 2)
4478 do_zeroing = false; // leave the hole, next time
4479 }
4480 }
4481
4482 // Collect the store and move on:
4483 phase->replace_input_of(st, MemNode::Memory, inits);
4484 inits = st; // put it on the linearized chain
4485 set_req(i, zmem); // unhook from previous position
4486
4487 if (zeroes_done == st_off)
4488 zeroes_done = next_init_off;
4489
4490 assert(!do_zeroing || zeroes_done >= next_init_off, "don't miss any");
4491
4492 #ifdef ASSERT
4493 // Various order invariants. Weaker than stores_are_sane because
4494 // a large constant tile can be filled in by smaller non-constant stores.
4495 assert(st_off >= last_init_off, "inits do not reverse");
4496 last_init_off = st_off;
4497 const Type* val = nullptr;
4498 if (st_size >= BytesPerInt &&
4499 (val = phase->type(st->in(MemNode::ValueIn)))->singleton() &&
4500 (int)val->basic_type() < (int)T_OBJECT) {
4501 assert(st_off >= last_tile_end, "tiles do not overlap");
4502 assert(st_off >= last_init_end, "tiles do not overwrite inits");
4503 last_tile_end = MAX2(last_tile_end, next_init_off);
4504 } else {
4505 intptr_t st_tile_end = align_up(next_init_off, BytesPerLong);
4506 assert(st_tile_end >= last_tile_end, "inits stay with tiles");
4507 assert(st_off >= last_init_end, "inits do not overlap");
4508 last_init_end = next_init_off; // it's a non-tile
4509 }
4510 #endif //ASSERT
4511 }
4512
4513 remove_extra_zeroes(); // clear out all the zmems left over
4514 add_req(inits);
4515
4516 if (!(UseTLAB && ZeroTLAB)) {
4517 // If anything remains to be zeroed, zero it all now.
4518 zeroes_done = align_down(zeroes_done, BytesPerInt);
4519 // if it is the last unused 4 bytes of an instance, forget about it
4520 intptr_t size_limit = phase->find_intptr_t_con(size_in_bytes, max_jint);
4521 if (zeroes_done + BytesPerLong >= size_limit) {
4522 AllocateNode* alloc = allocation();
4523 assert(alloc != nullptr, "must be present");
4524 if (alloc != nullptr && alloc->Opcode() == Op_Allocate) {
4525 Node* klass_node = alloc->in(AllocateNode::KlassNode);
4526 ciKlass* k = phase->type(klass_node)->is_instklassptr()->instance_klass();
4527 if (zeroes_done == k->layout_helper())
4528 zeroes_done = size_limit;
4529 }
4530 }
4531 if (zeroes_done < size_limit) {
4532 rawmem = ClearArrayNode::clear_memory(rawctl, rawmem, rawptr,
4533 zeroes_done, size_in_bytes, phase);
4534 }
4535 }
4536
4537 set_complete(phase);
4538 return rawmem;
4539 }
4540
4541
4542 #ifdef ASSERT
4543 bool InitializeNode::stores_are_sane(PhaseValues* phase) {
4544 if (is_complete())
4545 return true; // stores could be anything at this point
4546 assert(allocation() != nullptr, "must be present");
4547 intptr_t last_off = allocation()->minimum_header_size();
4548 for (uint i = InitializeNode::RawStores; i < req(); i++) {
4549 Node* st = in(i);
4550 intptr_t st_off = get_store_offset(st, phase);
4551 if (st_off < 0) continue; // ignore dead garbage
4552 if (last_off > st_off) {
4553 tty->print_cr("*** bad store offset at %d: " INTX_FORMAT " > " INTX_FORMAT, i, last_off, st_off);
4554 this->dump(2);
4555 assert(false, "ascending store offsets");
4556 return false;
4557 }
4558 last_off = st_off + st->as_Store()->memory_size();
4559 }
4560 return true;
4561 }
4562 #endif //ASSERT
4563
4564
4565
4566
4567 //============================MergeMemNode=====================================
4568 //
4569 // SEMANTICS OF MEMORY MERGES: A MergeMem is a memory state assembled from several
4570 // contributing store or call operations. Each contributor provides the memory
4571 // state for a particular "alias type" (see Compile::alias_type). For example,
4572 // if a MergeMem has an input X for alias category #6, then any memory reference
4573 // to alias category #6 may use X as its memory state input, as an exact equivalent
4574 // to using the MergeMem as a whole.
4575 // Load<6>( MergeMem(<6>: X, ...), p ) <==> Load<6>(X,p)
4576 //
4577 // (Here, the <N> notation gives the index of the relevant adr_type.)
4578 //
4579 // In one special case (and more cases in the future), alias categories overlap.
4580 // The special alias category "Bot" (Compile::AliasIdxBot) includes all memory
4581 // states. Therefore, if a MergeMem has only one contributing input W for Bot,
4582 // it is exactly equivalent to that state W:
4583 // MergeMem(<Bot>: W) <==> W
4584 //
4585 // Usually, the merge has more than one input. In that case, where inputs
4586 // overlap (i.e., one is Bot), the narrower alias type determines the memory
4587 // state for that type, and the wider alias type (Bot) fills in everywhere else:
4588 // Load<5>( MergeMem(<Bot>: W, <6>: X), p ) <==> Load<5>(W,p)
4589 // Load<6>( MergeMem(<Bot>: W, <6>: X), p ) <==> Load<6>(X,p)
4590 //
4591 // A merge can take a "wide" memory state as one of its narrow inputs.
4592 // This simply means that the merge observes out only the relevant parts of
4593 // the wide input. That is, wide memory states arriving at narrow merge inputs
4594 // are implicitly "filtered" or "sliced" as necessary. (This is rare.)
4595 //
4596 // These rules imply that MergeMem nodes may cascade (via their <Bot> links),
4597 // and that memory slices "leak through":
4598 // MergeMem(<Bot>: MergeMem(<Bot>: W, <7>: Y)) <==> MergeMem(<Bot>: W, <7>: Y)
4599 //
4600 // But, in such a cascade, repeated memory slices can "block the leak":
4601 // MergeMem(<Bot>: MergeMem(<Bot>: W, <7>: Y), <7>: Y') <==> MergeMem(<Bot>: W, <7>: Y')
4602 //
4603 // In the last example, Y is not part of the combined memory state of the
4604 // outermost MergeMem. The system must, of course, prevent unschedulable
4605 // memory states from arising, so you can be sure that the state Y is somehow
4606 // a precursor to state Y'.
4607 //
4608 //
4609 // REPRESENTATION OF MEMORY MERGES: The indexes used to address the Node::in array
4610 // of each MergeMemNode array are exactly the numerical alias indexes, including
4611 // but not limited to AliasIdxTop, AliasIdxBot, and AliasIdxRaw. The functions
4612 // Compile::alias_type (and kin) produce and manage these indexes.
4613 //
4614 // By convention, the value of in(AliasIdxTop) (i.e., in(1)) is always the top node.
4615 // (Note that this provides quick access to the top node inside MergeMem methods,
4616 // without the need to reach out via TLS to Compile::current.)
4617 //
4618 // As a consequence of what was just described, a MergeMem that represents a full
4619 // memory state has an edge in(AliasIdxBot) which is a "wide" memory state,
4620 // containing all alias categories.
4621 //
4622 // MergeMem nodes never (?) have control inputs, so in(0) is null.
4623 //
4624 // All other edges in(N) (including in(AliasIdxRaw), which is in(3)) are either
4625 // a memory state for the alias type <N>, or else the top node, meaning that
4626 // there is no particular input for that alias type. Note that the length of
4627 // a MergeMem is variable, and may be extended at any time to accommodate new
4628 // memory states at larger alias indexes. When merges grow, they are of course
4629 // filled with "top" in the unused in() positions.
4630 //
4631 // This use of top is named "empty_memory()", or "empty_mem" (no-memory) as a variable.
4632 // (Top was chosen because it works smoothly with passes like GCM.)
4633 //
4634 // For convenience, we hardwire the alias index for TypeRawPtr::BOTTOM. (It is
4635 // the type of random VM bits like TLS references.) Since it is always the
4636 // first non-Bot memory slice, some low-level loops use it to initialize an
4637 // index variable: for (i = AliasIdxRaw; i < req(); i++).
4638 //
4639 //
4640 // ACCESSORS: There is a special accessor MergeMemNode::base_memory which returns
4641 // the distinguished "wide" state. The accessor MergeMemNode::memory_at(N) returns
4642 // the memory state for alias type <N>, or (if there is no particular slice at <N>,
4643 // it returns the base memory. To prevent bugs, memory_at does not accept <Top>
4644 // or <Bot> indexes. The iterator MergeMemStream provides robust iteration over
4645 // MergeMem nodes or pairs of such nodes, ensuring that the non-top edges are visited.
4646 //
4647 // %%%% We may get rid of base_memory as a separate accessor at some point; it isn't
4648 // really that different from the other memory inputs. An abbreviation called
4649 // "bot_memory()" for "memory_at(AliasIdxBot)" would keep code tidy.
4650 //
4651 //
4652 // PARTIAL MEMORY STATES: During optimization, MergeMem nodes may arise that represent
4653 // partial memory states. When a Phi splits through a MergeMem, the copy of the Phi
4654 // that "emerges though" the base memory will be marked as excluding the alias types
4655 // of the other (narrow-memory) copies which "emerged through" the narrow edges:
4656 //
4657 // Phi<Bot>(U, MergeMem(<Bot>: W, <8>: Y))
4658 // ==Ideal=> MergeMem(<Bot>: Phi<Bot-8>(U, W), Phi<8>(U, Y))
4659 //
4660 // This strange "subtraction" effect is necessary to ensure IGVN convergence.
4661 // (It is currently unimplemented.) As you can see, the resulting merge is
4662 // actually a disjoint union of memory states, rather than an overlay.
4663 //
4664
4665 //------------------------------MergeMemNode-----------------------------------
4666 Node* MergeMemNode::make_empty_memory() {
4667 Node* empty_memory = (Node*) Compile::current()->top();
4668 assert(empty_memory->is_top(), "correct sentinel identity");
4669 return empty_memory;
4670 }
4671
4672 MergeMemNode::MergeMemNode(Node *new_base) : Node(1+Compile::AliasIdxRaw) {
4673 init_class_id(Class_MergeMem);
4674 // all inputs are nullified in Node::Node(int)
4675 // set_input(0, nullptr); // no control input
4676
4677 // Initialize the edges uniformly to top, for starters.
4678 Node* empty_mem = make_empty_memory();
4679 for (uint i = Compile::AliasIdxTop; i < req(); i++) {
4680 init_req(i,empty_mem);
4681 }
4682 assert(empty_memory() == empty_mem, "");
4683
4684 if( new_base != nullptr && new_base->is_MergeMem() ) {
4685 MergeMemNode* mdef = new_base->as_MergeMem();
4686 assert(mdef->empty_memory() == empty_mem, "consistent sentinels");
4687 for (MergeMemStream mms(this, mdef); mms.next_non_empty2(); ) {
4688 mms.set_memory(mms.memory2());
4689 }
4690 assert(base_memory() == mdef->base_memory(), "");
4691 } else {
4692 set_base_memory(new_base);
4693 }
4694 }
4695
4696 // Make a new, untransformed MergeMem with the same base as 'mem'.
4697 // If mem is itself a MergeMem, populate the result with the same edges.
4698 MergeMemNode* MergeMemNode::make(Node* mem) {
4699 return new MergeMemNode(mem);
4700 }
4701
4702 //------------------------------cmp--------------------------------------------
4703 uint MergeMemNode::hash() const { return NO_HASH; }
4704 bool MergeMemNode::cmp( const Node &n ) const {
4705 return (&n == this); // Always fail except on self
4706 }
4707
4708 //------------------------------Identity---------------------------------------
4709 Node* MergeMemNode::Identity(PhaseGVN* phase) {
4710 // Identity if this merge point does not record any interesting memory
4711 // disambiguations.
4712 Node* base_mem = base_memory();
4713 Node* empty_mem = empty_memory();
4714 if (base_mem != empty_mem) { // Memory path is not dead?
4715 for (uint i = Compile::AliasIdxRaw; i < req(); i++) {
4716 Node* mem = in(i);
4717 if (mem != empty_mem && mem != base_mem) {
4718 return this; // Many memory splits; no change
4719 }
4720 }
4721 }
4722 return base_mem; // No memory splits; ID on the one true input
4723 }
4724
4725 //------------------------------Ideal------------------------------------------
4726 // This method is invoked recursively on chains of MergeMem nodes
4727 Node *MergeMemNode::Ideal(PhaseGVN *phase, bool can_reshape) {
4728 // Remove chain'd MergeMems
4729 //
4730 // This is delicate, because the each "in(i)" (i >= Raw) is interpreted
4731 // relative to the "in(Bot)". Since we are patching both at the same time,
4732 // we have to be careful to read each "in(i)" relative to the old "in(Bot)",
4733 // but rewrite each "in(i)" relative to the new "in(Bot)".
4734 Node *progress = nullptr;
4735
4736
4737 Node* old_base = base_memory();
4738 Node* empty_mem = empty_memory();
4739 if (old_base == empty_mem)
4740 return nullptr; // Dead memory path.
4741
4742 MergeMemNode* old_mbase;
4743 if (old_base != nullptr && old_base->is_MergeMem())
4744 old_mbase = old_base->as_MergeMem();
4745 else
4746 old_mbase = nullptr;
4747 Node* new_base = old_base;
4748
4749 // simplify stacked MergeMems in base memory
4750 if (old_mbase) new_base = old_mbase->base_memory();
4751
4752 // the base memory might contribute new slices beyond my req()
4753 if (old_mbase) grow_to_match(old_mbase);
4754
4755 // Note: We do not call verify_sparse on entry, because inputs
4756 // can normalize to the base_memory via subsume_node or similar
4757 // mechanisms. This method repairs that damage.
4758
4759 assert(!old_mbase || old_mbase->is_empty_memory(empty_mem), "consistent sentinels");
4760
4761 // Look at each slice.
4762 for (uint i = Compile::AliasIdxRaw; i < req(); i++) {
4763 Node* old_in = in(i);
4764 // calculate the old memory value
4765 Node* old_mem = old_in;
4766 if (old_mem == empty_mem) old_mem = old_base;
4767 assert(old_mem == memory_at(i), "");
4768
4769 // maybe update (reslice) the old memory value
4770
4771 // simplify stacked MergeMems
4772 Node* new_mem = old_mem;
4773 MergeMemNode* old_mmem;
4774 if (old_mem != nullptr && old_mem->is_MergeMem())
4775 old_mmem = old_mem->as_MergeMem();
4776 else
4777 old_mmem = nullptr;
4778 if (old_mmem == this) {
4779 // This can happen if loops break up and safepoints disappear.
4780 // A merge of BotPtr (default) with a RawPtr memory derived from a
4781 // safepoint can be rewritten to a merge of the same BotPtr with
4782 // the BotPtr phi coming into the loop. If that phi disappears
4783 // also, we can end up with a self-loop of the mergemem.
4784 // In general, if loops degenerate and memory effects disappear,
4785 // a mergemem can be left looking at itself. This simply means
4786 // that the mergemem's default should be used, since there is
4787 // no longer any apparent effect on this slice.
4788 // Note: If a memory slice is a MergeMem cycle, it is unreachable
4789 // from start. Update the input to TOP.
4790 new_mem = (new_base == this || new_base == empty_mem)? empty_mem : new_base;
4791 }
4792 else if (old_mmem != nullptr) {
4793 new_mem = old_mmem->memory_at(i);
4794 }
4795 // else preceding memory was not a MergeMem
4796
4797 // maybe store down a new value
4798 Node* new_in = new_mem;
4799 if (new_in == new_base) new_in = empty_mem;
4800
4801 if (new_in != old_in) {
4802 // Warning: Do not combine this "if" with the previous "if"
4803 // A memory slice might have be be rewritten even if it is semantically
4804 // unchanged, if the base_memory value has changed.
4805 set_req_X(i, new_in, phase);
4806 progress = this; // Report progress
4807 }
4808 }
4809
4810 if (new_base != old_base) {
4811 set_req_X(Compile::AliasIdxBot, new_base, phase);
4812 // Don't use set_base_memory(new_base), because we need to update du.
4813 assert(base_memory() == new_base, "");
4814 progress = this;
4815 }
4816
4817 if( base_memory() == this ) {
4818 // a self cycle indicates this memory path is dead
4819 set_req(Compile::AliasIdxBot, empty_mem);
4820 }
4821
4822 // Resolve external cycles by calling Ideal on a MergeMem base_memory
4823 // Recursion must occur after the self cycle check above
4824 if( base_memory()->is_MergeMem() ) {
4825 MergeMemNode *new_mbase = base_memory()->as_MergeMem();
4826 Node *m = phase->transform(new_mbase); // Rollup any cycles
4827 if( m != nullptr &&
4828 (m->is_top() ||
4829 (m->is_MergeMem() && m->as_MergeMem()->base_memory() == empty_mem)) ) {
4830 // propagate rollup of dead cycle to self
4831 set_req(Compile::AliasIdxBot, empty_mem);
4832 }
4833 }
4834
4835 if( base_memory() == empty_mem ) {
4836 progress = this;
4837 // Cut inputs during Parse phase only.
4838 // During Optimize phase a dead MergeMem node will be subsumed by Top.
4839 if( !can_reshape ) {
4840 for (uint i = Compile::AliasIdxRaw; i < req(); i++) {
4841 if( in(i) != empty_mem ) { set_req(i, empty_mem); }
4842 }
4843 }
4844 }
4845
4846 if( !progress && base_memory()->is_Phi() && can_reshape ) {
4847 // Check if PhiNode::Ideal's "Split phis through memory merges"
4848 // transform should be attempted. Look for this->phi->this cycle.
4849 uint merge_width = req();
4850 if (merge_width > Compile::AliasIdxRaw) {
4851 PhiNode* phi = base_memory()->as_Phi();
4852 for( uint i = 1; i < phi->req(); ++i ) {// For all paths in
4853 if (phi->in(i) == this) {
4854 phase->is_IterGVN()->_worklist.push(phi);
4855 break;
4856 }
4857 }
4858 }
4859 }
4860
4861 assert(progress || verify_sparse(), "please, no dups of base");
4862 return progress;
4863 }
4864
4865 //-------------------------set_base_memory-------------------------------------
4866 void MergeMemNode::set_base_memory(Node *new_base) {
4867 Node* empty_mem = empty_memory();
4868 set_req(Compile::AliasIdxBot, new_base);
4869 assert(memory_at(req()) == new_base, "must set default memory");
4870 // Clear out other occurrences of new_base:
4871 if (new_base != empty_mem) {
4872 for (uint i = Compile::AliasIdxRaw; i < req(); i++) {
4873 if (in(i) == new_base) set_req(i, empty_mem);
4874 }
4875 }
4876 }
4877
4878 //------------------------------out_RegMask------------------------------------
4879 const RegMask &MergeMemNode::out_RegMask() const {
4880 return RegMask::Empty;
4881 }
4882
4883 //------------------------------dump_spec--------------------------------------
4884 #ifndef PRODUCT
4885 void MergeMemNode::dump_spec(outputStream *st) const {
4886 st->print(" {");
4887 Node* base_mem = base_memory();
4888 for( uint i = Compile::AliasIdxRaw; i < req(); i++ ) {
4889 Node* mem = (in(i) != nullptr) ? memory_at(i) : base_mem;
4890 if (mem == base_mem) { st->print(" -"); continue; }
4891 st->print( " N%d:", mem->_idx );
4892 Compile::current()->get_adr_type(i)->dump_on(st);
4893 }
4894 st->print(" }");
4895 }
4896 #endif // !PRODUCT
4897
4898
4899 #ifdef ASSERT
4900 static bool might_be_same(Node* a, Node* b) {
4901 if (a == b) return true;
4902 if (!(a->is_Phi() || b->is_Phi())) return false;
4903 // phis shift around during optimization
4904 return true; // pretty stupid...
4905 }
4906
4907 // verify a narrow slice (either incoming or outgoing)
4908 static void verify_memory_slice(const MergeMemNode* m, int alias_idx, Node* n) {
4909 if (!VerifyAliases) return; // don't bother to verify unless requested
4910 if (VMError::is_error_reported()) return; // muzzle asserts when debugging an error
4911 if (Node::in_dump()) return; // muzzle asserts when printing
4912 assert(alias_idx >= Compile::AliasIdxRaw, "must not disturb base_memory or sentinel");
4913 assert(n != nullptr, "");
4914 // Elide intervening MergeMem's
4915 while (n->is_MergeMem()) {
4916 n = n->as_MergeMem()->memory_at(alias_idx);
4917 }
4918 Compile* C = Compile::current();
4919 const TypePtr* n_adr_type = n->adr_type();
4920 if (n == m->empty_memory()) {
4921 // Implicit copy of base_memory()
4922 } else if (n_adr_type != TypePtr::BOTTOM) {
4923 assert(n_adr_type != nullptr, "new memory must have a well-defined adr_type");
4924 assert(C->must_alias(n_adr_type, alias_idx), "new memory must match selected slice");
4925 } else {
4926 // A few places like make_runtime_call "know" that VM calls are narrow,
4927 // and can be used to update only the VM bits stored as TypeRawPtr::BOTTOM.
4928 bool expected_wide_mem = false;
4929 if (n == m->base_memory()) {
4930 expected_wide_mem = true;
4931 } else if (alias_idx == Compile::AliasIdxRaw ||
4932 n == m->memory_at(Compile::AliasIdxRaw)) {
4933 expected_wide_mem = true;
4934 } else if (!C->alias_type(alias_idx)->is_rewritable()) {
4935 // memory can "leak through" calls on channels that
4936 // are write-once. Allow this also.
4937 expected_wide_mem = true;
4938 }
4939 assert(expected_wide_mem, "expected narrow slice replacement");
4940 }
4941 }
4942 #else // !ASSERT
4943 #define verify_memory_slice(m,i,n) (void)(0) // PRODUCT version is no-op
4944 #endif
4945
4946
4947 //-----------------------------memory_at---------------------------------------
4948 Node* MergeMemNode::memory_at(uint alias_idx) const {
4949 assert(alias_idx >= Compile::AliasIdxRaw ||
4950 alias_idx == Compile::AliasIdxBot && !Compile::current()->do_aliasing(),
4951 "must avoid base_memory and AliasIdxTop");
4952
4953 // Otherwise, it is a narrow slice.
4954 Node* n = alias_idx < req() ? in(alias_idx) : empty_memory();
4955 if (is_empty_memory(n)) {
4956 // the array is sparse; empty slots are the "top" node
4957 n = base_memory();
4958 assert(Node::in_dump()
4959 || n == nullptr || n->bottom_type() == Type::TOP
4960 || n->adr_type() == nullptr // address is TOP
4961 || n->adr_type() == TypePtr::BOTTOM
4962 || n->adr_type() == TypeRawPtr::BOTTOM
4963 || !Compile::current()->do_aliasing(),
4964 "must be a wide memory");
4965 // do_aliasing == false if we are organizing the memory states manually.
4966 // See verify_memory_slice for comments on TypeRawPtr::BOTTOM.
4967 } else {
4968 // make sure the stored slice is sane
4969 #ifdef ASSERT
4970 if (VMError::is_error_reported() || Node::in_dump()) {
4971 } else if (might_be_same(n, base_memory())) {
4972 // Give it a pass: It is a mostly harmless repetition of the base.
4973 // This can arise normally from node subsumption during optimization.
4974 } else {
4975 verify_memory_slice(this, alias_idx, n);
4976 }
4977 #endif
4978 }
4979 return n;
4980 }
4981
4982 //---------------------------set_memory_at-------------------------------------
4983 void MergeMemNode::set_memory_at(uint alias_idx, Node *n) {
4984 verify_memory_slice(this, alias_idx, n);
4985 Node* empty_mem = empty_memory();
4986 if (n == base_memory()) n = empty_mem; // collapse default
4987 uint need_req = alias_idx+1;
4988 if (req() < need_req) {
4989 if (n == empty_mem) return; // already the default, so do not grow me
4990 // grow the sparse array
4991 do {
4992 add_req(empty_mem);
4993 } while (req() < need_req);
4994 }
4995 set_req( alias_idx, n );
4996 }
4997
4998
4999
5000 //--------------------------iteration_setup------------------------------------
5001 void MergeMemNode::iteration_setup(const MergeMemNode* other) {
5002 if (other != nullptr) {
5003 grow_to_match(other);
5004 // invariant: the finite support of mm2 is within mm->req()
5005 #ifdef ASSERT
5006 for (uint i = req(); i < other->req(); i++) {
5007 assert(other->is_empty_memory(other->in(i)), "slice left uncovered");
5008 }
5009 #endif
5010 }
5011 // Replace spurious copies of base_memory by top.
5012 Node* base_mem = base_memory();
5013 if (base_mem != nullptr && !base_mem->is_top()) {
5014 for (uint i = Compile::AliasIdxBot+1, imax = req(); i < imax; i++) {
5015 if (in(i) == base_mem)
5016 set_req(i, empty_memory());
5017 }
5018 }
5019 }
5020
5021 //---------------------------grow_to_match-------------------------------------
5022 void MergeMemNode::grow_to_match(const MergeMemNode* other) {
5023 Node* empty_mem = empty_memory();
5024 assert(other->is_empty_memory(empty_mem), "consistent sentinels");
5025 // look for the finite support of the other memory
5026 for (uint i = other->req(); --i >= req(); ) {
5027 if (other->in(i) != empty_mem) {
5028 uint new_len = i+1;
5029 while (req() < new_len) add_req(empty_mem);
5030 break;
5031 }
5032 }
5033 }
5034
5035 //---------------------------verify_sparse-------------------------------------
5036 #ifndef PRODUCT
5037 bool MergeMemNode::verify_sparse() const {
5038 assert(is_empty_memory(make_empty_memory()), "sane sentinel");
5039 Node* base_mem = base_memory();
5040 // The following can happen in degenerate cases, since empty==top.
5041 if (is_empty_memory(base_mem)) return true;
5042 for (uint i = Compile::AliasIdxRaw; i < req(); i++) {
5043 assert(in(i) != nullptr, "sane slice");
5044 if (in(i) == base_mem) return false; // should have been the sentinel value!
5045 }
5046 return true;
5047 }
5048
5049 bool MergeMemStream::match_memory(Node* mem, const MergeMemNode* mm, int idx) {
5050 Node* n;
5051 n = mm->in(idx);
5052 if (mem == n) return true; // might be empty_memory()
5053 n = (idx == Compile::AliasIdxBot)? mm->base_memory(): mm->memory_at(idx);
5054 if (mem == n) return true;
5055 return false;
5056 }
5057 #endif // !PRODUCT