1 /*
2 * Copyright (c) 2016, 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 "opto/arraycopynode.hpp"
27 #include "opto/graphKit.hpp"
28
29 ArrayCopyNode::ArrayCopyNode(Compile* C, bool alloc_tightly_coupled, bool has_negative_length_guard)
30 : CallNode(arraycopy_type(), NULL, TypeRawPtr::BOTTOM),
31 _alloc_tightly_coupled(alloc_tightly_coupled),
32 _has_negative_length_guard(has_negative_length_guard),
33 _kind(None),
34 _arguments_validated(false),
35 _src_type(TypeOopPtr::BOTTOM),
36 _dest_type(TypeOopPtr::BOTTOM) {
37 init_class_id(Class_ArrayCopy);
38 init_flags(Flag_is_macro);
39 C->add_macro_node(this);
40 }
41
42 uint ArrayCopyNode::size_of() const { return sizeof(*this); }
43
44 ArrayCopyNode* ArrayCopyNode::make(GraphKit* kit, bool may_throw,
45 Node* src, Node* src_offset,
46 Node* dest, Node* dest_offset,
47 Node* length,
48 bool alloc_tightly_coupled,
49 bool has_negative_length_guard,
50 Node* src_klass, Node* dest_klass,
51 Node* src_length, Node* dest_length) {
52
53 ArrayCopyNode* ac = new ArrayCopyNode(kit->C, alloc_tightly_coupled, has_negative_length_guard);
54 Node* prev_mem = kit->set_predefined_input_for_runtime_call(ac);
55
56 ac->init_req(ArrayCopyNode::Src, src);
57 ac->init_req(ArrayCopyNode::SrcPos, src_offset);
58 ac->init_req(ArrayCopyNode::Dest, dest);
59 ac->init_req(ArrayCopyNode::DestPos, dest_offset);
60 ac->init_req(ArrayCopyNode::Length, length);
61 ac->init_req(ArrayCopyNode::SrcLen, src_length);
62 ac->init_req(ArrayCopyNode::DestLen, dest_length);
63 ac->init_req(ArrayCopyNode::SrcKlass, src_klass);
64 ac->init_req(ArrayCopyNode::DestKlass, dest_klass);
65
66 if (may_throw) {
67 ac->set_req(TypeFunc::I_O , kit->i_o());
68 kit->add_safepoint_edges(ac, false);
69 }
70
71 return ac;
72 }
73
74 void ArrayCopyNode::connect_outputs(GraphKit* kit) {
75 kit->set_all_memory_call(this, true);
76 kit->set_control(kit->gvn().transform(new ProjNode(this,TypeFunc::Control)));
77 kit->set_i_o(kit->gvn().transform(new ProjNode(this, TypeFunc::I_O)));
78 kit->make_slow_call_ex(this, kit->env()->Throwable_klass(), true);
79 kit->set_all_memory_call(this);
80 }
81
82 #ifndef PRODUCT
83 const char* ArrayCopyNode::_kind_names[] = {"arraycopy", "arraycopy, validated arguments", "clone", "oop array clone", "CopyOf", "CopyOfRange"};
84
85 void ArrayCopyNode::dump_spec(outputStream *st) const {
86 CallNode::dump_spec(st);
87 st->print(" (%s%s)", _kind_names[_kind], _alloc_tightly_coupled ? ", tightly coupled allocation" : "");
88 }
89
90 void ArrayCopyNode::dump_compact_spec(outputStream* st) const {
91 st->print("%s%s", _kind_names[_kind], _alloc_tightly_coupled ? ",tight" : "");
92 }
93 #endif
94
95 intptr_t ArrayCopyNode::get_length_if_constant(PhaseGVN *phase) const {
96 // check that length is constant
97 Node* length = in(ArrayCopyNode::Length);
98 const Type* length_type = phase->type(length);
99
100 if (length_type == Type::TOP) {
101 return -1;
102 }
103
104 assert(is_clonebasic() || is_arraycopy() || is_copyof() || is_copyofrange(), "unexpected array copy type");
105
106 return is_clonebasic() ? length->find_intptr_t_con(-1) : length->find_int_con(-1);
107 }
108
109 int ArrayCopyNode::get_count(PhaseGVN *phase) const {
110 Node* src = in(ArrayCopyNode::Src);
111 const Type* src_type = phase->type(src);
112
113 if (is_clonebasic()) {
114 if (src_type->isa_instptr()) {
115 const TypeInstPtr* inst_src = src_type->is_instptr();
116 ciInstanceKlass* ik = inst_src->klass()->as_instance_klass();
117 // ciInstanceKlass::nof_nonstatic_fields() doesn't take injected
118 // fields into account. They are rare anyway so easier to simply
119 // skip instances with injected fields.
120 if ((!inst_src->klass_is_exact() && (ik->is_interface() || ik->has_subklass())) || ik->has_injected_fields()) {
121 return -1;
122 }
123 int nb_fields = ik->nof_nonstatic_fields();
124 return nb_fields;
125 } else {
126 const TypeAryPtr* ary_src = src_type->isa_aryptr();
127 assert (ary_src != NULL, "not an array or instance?");
128 // clone passes a length as a rounded number of longs. If we're
129 // cloning an array we'll do it element by element. If the
130 // length input to ArrayCopyNode is constant, length of input
131 // array must be too.
132
133 assert((get_length_if_constant(phase) == -1) == !ary_src->size()->is_con() ||
134 phase->is_IterGVN(), "inconsistent");
135
136 if (ary_src->size()->is_con()) {
137 return ary_src->size()->get_con();
138 }
139 return -1;
140 }
141 }
142
143 return get_length_if_constant(phase);
144 }
145
146 Node* ArrayCopyNode::try_clone_instance(PhaseGVN *phase, bool can_reshape, int count) {
147 if (!is_clonebasic()) {
148 return NULL;
149 }
150
151 Node* src = in(ArrayCopyNode::Src);
152 Node* dest = in(ArrayCopyNode::Dest);
153 Node* ctl = in(TypeFunc::Control);
154 Node* in_mem = in(TypeFunc::Memory);
155
156 const Type* src_type = phase->type(src);
157
158 assert(src->is_AddP(), "should be base + off");
159 assert(dest->is_AddP(), "should be base + off");
160 Node* base_src = src->in(AddPNode::Base);
161 Node* base_dest = dest->in(AddPNode::Base);
162
163 MergeMemNode* mem = MergeMemNode::make(in_mem);
164
165 const TypeInstPtr* inst_src = src_type->isa_instptr();
166
167 if (inst_src == NULL) {
168 return NULL;
169 }
170
171 if (!inst_src->klass_is_exact()) {
172 ciInstanceKlass* ik = inst_src->klass()->as_instance_klass();
173 assert(!ik->is_interface() && !ik->has_subklass(), "inconsistent klass hierarchy");
174 phase->C->dependencies()->assert_leaf_type(ik);
175 }
176
177 ciInstanceKlass* ik = inst_src->klass()->as_instance_klass();
178 assert(ik->nof_nonstatic_fields() <= ArrayCopyLoadStoreMaxElem, "too many fields");
179
180 for (int i = 0; i < count; i++) {
181 ciField* field = ik->nonstatic_field_at(i);
182 int fieldidx = phase->C->alias_type(field)->index();
183 const TypePtr* adr_type = phase->C->alias_type(field)->adr_type();
184 Node* off = phase->MakeConX(field->offset());
185 Node* next_src = phase->transform(new AddPNode(base_src,base_src,off));
186 Node* next_dest = phase->transform(new AddPNode(base_dest,base_dest,off));
187 BasicType bt = field->layout_type();
188
189 const Type *type;
190 if (bt == T_OBJECT) {
191 if (!field->type()->is_loaded()) {
192 type = TypeInstPtr::BOTTOM;
193 } else {
194 ciType* field_klass = field->type();
195 type = TypeOopPtr::make_from_klass(field_klass->as_klass());
196 }
197 } else {
198 type = Type::get_const_basic_type(bt);
199 }
200
201 Node* v = LoadNode::make(*phase, ctl, mem->memory_at(fieldidx), next_src, adr_type, type, bt, MemNode::unordered);
202 v = phase->transform(v);
203 Node* s = StoreNode::make(*phase, ctl, mem->memory_at(fieldidx), next_dest, adr_type, v, bt, MemNode::unordered);
204 s = phase->transform(s);
205 mem->set_memory_at(fieldidx, s);
206 }
207
208 if (!finish_transform(phase, can_reshape, ctl, mem)) {
209 // Return NodeSentinel to indicate that the transform failed
210 return NodeSentinel;
211 }
212
213 return mem;
214 }
215
216 bool ArrayCopyNode::prepare_array_copy(PhaseGVN *phase, bool can_reshape,
217 Node*& adr_src,
218 Node*& base_src,
219 Node*& adr_dest,
220 Node*& base_dest,
221 BasicType& copy_type,
222 const Type*& value_type,
223 bool& disjoint_bases) {
224 Node* src = in(ArrayCopyNode::Src);
225 Node* dest = in(ArrayCopyNode::Dest);
226 const Type* src_type = phase->type(src);
227 const TypeAryPtr* ary_src = src_type->isa_aryptr();
228
229 if (is_arraycopy() || is_copyofrange() || is_copyof()) {
230 const Type* dest_type = phase->type(dest);
231 const TypeAryPtr* ary_dest = dest_type->isa_aryptr();
232 Node* src_offset = in(ArrayCopyNode::SrcPos);
233 Node* dest_offset = in(ArrayCopyNode::DestPos);
234
235 // newly allocated object is guaranteed to not overlap with source object
236 disjoint_bases = is_alloc_tightly_coupled();
237
238 if (ary_src == NULL || ary_src->klass() == NULL ||
239 ary_dest == NULL || ary_dest->klass() == NULL) {
240 // We don't know if arguments are arrays
241 return false;
242 }
243
244 BasicType src_elem = ary_src->klass()->as_array_klass()->element_type()->basic_type();
245 BasicType dest_elem = ary_dest->klass()->as_array_klass()->element_type()->basic_type();
246 if (src_elem == T_ARRAY) src_elem = T_OBJECT;
247 if (dest_elem == T_ARRAY) dest_elem = T_OBJECT;
248
249 if (src_elem != dest_elem || dest_elem == T_VOID) {
250 // We don't know if arguments are arrays of the same type
251 return false;
252 }
253
254 C2BarrierSetCodeGen* code_gen = Universe::heap()->barrier_set()->c2_code_gen();
255 if (dest_elem == T_OBJECT && (!is_alloc_tightly_coupled() ||
256 code_gen->array_copy_requires_gc_barriers(T_OBJECT))) {
257 // It's an object array copy but we can't emit the card marking
258 // that is needed
259 return false;
260 }
261
262 value_type = ary_src->elem();
263
264 base_src = src;
265 base_dest = dest;
266
267 uint shift = exact_log2(type2aelembytes(dest_elem));
268 uint header = arrayOopDesc::base_offset_in_bytes(dest_elem);
269
270 adr_src = src;
271 adr_dest = dest;
272
273 src_offset = Compile::conv_I2X_index(phase, src_offset, ary_src->size());
274 dest_offset = Compile::conv_I2X_index(phase, dest_offset, ary_dest->size());
275
276 Node* src_scale = phase->transform(new LShiftXNode(src_offset, phase->intcon(shift)));
277 Node* dest_scale = phase->transform(new LShiftXNode(dest_offset, phase->intcon(shift)));
278
279 adr_src = phase->transform(new AddPNode(base_src, adr_src, src_scale));
280 adr_dest = phase->transform(new AddPNode(base_dest, adr_dest, dest_scale));
281
282 adr_src = new AddPNode(base_src, adr_src, phase->MakeConX(header));
283 adr_dest = new AddPNode(base_dest, adr_dest, phase->MakeConX(header));
284
285 adr_src = phase->transform(adr_src);
286 adr_dest = phase->transform(adr_dest);
287
288 copy_type = dest_elem;
289 } else {
290 assert(ary_src != NULL, "should be a clone");
291 assert(is_clonebasic(), "should be");
292
293 disjoint_bases = true;
294 assert(src->is_AddP(), "should be base + off");
295 assert(dest->is_AddP(), "should be base + off");
296 adr_src = src;
297 base_src = src->in(AddPNode::Base);
298 adr_dest = dest;
299 base_dest = dest->in(AddPNode::Base);
300
301 assert(phase->type(src->in(AddPNode::Offset))->is_intptr_t()->get_con() == phase->type(dest->in(AddPNode::Offset))->is_intptr_t()->get_con(), "same start offset?");
302 BasicType elem = ary_src->klass()->as_array_klass()->element_type()->basic_type();
303 if (elem == T_ARRAY) elem = T_OBJECT;
304
305 int diff = arrayOopDesc::base_offset_in_bytes(elem) - phase->type(src->in(AddPNode::Offset))->is_intptr_t()->get_con();
306 assert(diff >= 0, "clone should not start after 1st array element");
307 if (diff > 0) {
308 adr_src = phase->transform(new AddPNode(base_src, adr_src, phase->MakeConX(diff)));
309 adr_dest = phase->transform(new AddPNode(base_dest, adr_dest, phase->MakeConX(diff)));
310 }
311
312 copy_type = elem;
313 value_type = ary_src->elem();
314 }
315 return true;
316 }
317
318 const TypePtr* ArrayCopyNode::get_address_type(PhaseGVN *phase, Node* n) {
319 const Type* at = phase->type(n);
320 assert(at != Type::TOP, "unexpected type");
321 const TypePtr* atp = at->isa_ptr();
322 // adjust atp to be the correct array element address type
323 atp = atp->add_offset(Type::OffsetBot);
324 return atp;
325 }
326
327 void ArrayCopyNode::array_copy_test_overlap(PhaseGVN *phase, bool can_reshape, bool disjoint_bases, int count, Node*& forward_ctl, Node*& backward_ctl) {
328 Node* ctl = in(TypeFunc::Control);
329 if (!disjoint_bases && count > 1) {
330 Node* src_offset = in(ArrayCopyNode::SrcPos);
331 Node* dest_offset = in(ArrayCopyNode::DestPos);
332 assert(src_offset != NULL && dest_offset != NULL, "should be");
333 Node* cmp = phase->transform(new CmpINode(src_offset, dest_offset));
334 Node *bol = phase->transform(new BoolNode(cmp, BoolTest::lt));
335 IfNode *iff = new IfNode(ctl, bol, PROB_FAIR, COUNT_UNKNOWN);
336
337 phase->transform(iff);
338
339 forward_ctl = phase->transform(new IfFalseNode(iff));
340 backward_ctl = phase->transform(new IfTrueNode(iff));
341 } else {
342 forward_ctl = ctl;
343 }
344 }
345
346 Node* ArrayCopyNode::array_copy_forward(PhaseGVN *phase,
347 bool can_reshape,
348 Node* forward_ctl,
349 Node* start_mem_src,
350 Node* start_mem_dest,
351 const TypePtr* atp_src,
352 const TypePtr* atp_dest,
353 Node* adr_src,
354 Node* base_src,
355 Node* adr_dest,
356 Node* base_dest,
357 BasicType copy_type,
358 const Type* value_type,
359 int count) {
360 Node* mem = phase->C->top();
361 if (!forward_ctl->is_top()) {
362 // copy forward
363 mem = start_mem_dest;
364
365 if (count > 0) {
366 Node* v = LoadNode::make(*phase, forward_ctl, start_mem_src, adr_src, atp_src, value_type, copy_type, MemNode::unordered);
367 v = phase->transform(v);
368 mem = StoreNode::make(*phase, forward_ctl, mem, adr_dest, atp_dest, v, copy_type, MemNode::unordered);
369 mem = phase->transform(mem);
370 for (int i = 1; i < count; i++) {
371 Node* off = phase->MakeConX(type2aelembytes(copy_type) * i);
372 Node* next_src = phase->transform(new AddPNode(base_src,adr_src,off));
373 Node* next_dest = phase->transform(new AddPNode(base_dest,adr_dest,off));
374 v = LoadNode::make(*phase, forward_ctl, mem, next_src, atp_src, value_type, copy_type, MemNode::unordered);
375 v = phase->transform(v);
376 mem = StoreNode::make(*phase, forward_ctl,mem,next_dest,atp_dest,v, copy_type, MemNode::unordered);
377 mem = phase->transform(mem);
378 }
379 } else if(can_reshape) {
380 PhaseIterGVN* igvn = phase->is_IterGVN();
381 igvn->_worklist.push(adr_src);
382 igvn->_worklist.push(adr_dest);
383 }
384 }
385 return mem;
386 }
387
388 Node* ArrayCopyNode::array_copy_backward(PhaseGVN *phase,
389 bool can_reshape,
390 Node* backward_ctl,
391 Node* start_mem_src,
392 Node* start_mem_dest,
393 const TypePtr* atp_src,
394 const TypePtr* atp_dest,
395 Node* adr_src,
396 Node* base_src,
397 Node* adr_dest,
398 Node* base_dest,
399 BasicType copy_type,
400 const Type* value_type,
401 int count) {
402 Node* mem = phase->C->top();
403 if (!backward_ctl->is_top()) {
404 // copy backward
405 mem = start_mem_dest;
406
407 if (count > 0) {
408 for (int i = count-1; i >= 1; i--) {
409 Node* off = phase->MakeConX(type2aelembytes(copy_type) * i);
410 Node* next_src = phase->transform(new AddPNode(base_src,adr_src,off));
411 Node* next_dest = phase->transform(new AddPNode(base_dest,adr_dest,off));
412 Node* v = LoadNode::make(*phase, backward_ctl, mem, next_src, atp_src, value_type, copy_type, MemNode::unordered);
413 v = phase->transform(v);
414 mem = StoreNode::make(*phase, backward_ctl,mem,next_dest,atp_dest,v, copy_type, MemNode::unordered);
415 mem = phase->transform(mem);
416 }
417 Node* v = LoadNode::make(*phase, backward_ctl, mem, adr_src, atp_src, value_type, copy_type, MemNode::unordered);
418 v = phase->transform(v);
419 mem = StoreNode::make(*phase, backward_ctl, mem, adr_dest, atp_dest, v, copy_type, MemNode::unordered);
420 mem = phase->transform(mem);
421 } else if(can_reshape) {
422 PhaseIterGVN* igvn = phase->is_IterGVN();
423 igvn->_worklist.push(adr_src);
424 igvn->_worklist.push(adr_dest);
425 }
426 }
427 return mem;
428 }
429
430 bool ArrayCopyNode::finish_transform(PhaseGVN *phase, bool can_reshape,
431 Node* ctl, Node *mem) {
432 if (can_reshape) {
433 PhaseIterGVN* igvn = phase->is_IterGVN();
434 igvn->set_delay_transform(false);
435 if (is_clonebasic()) {
436 Node* out_mem = proj_out(TypeFunc::Memory);
437
438 C2BarrierSetCodeGen* code_gen = Universe::heap()->barrier_set()->c2_code_gen();
439 if (out_mem->outcnt() != 1 || !out_mem->raw_out(0)->is_MergeMem() ||
440 out_mem->raw_out(0)->outcnt() != 1 || !out_mem->raw_out(0)->raw_out(0)->is_MemBar()) {
441 assert(code_gen->array_copy_requires_gc_barriers(T_OBJECT), "can only happen with card marking");
442 return false;
443 }
444
445 igvn->replace_node(out_mem->raw_out(0), mem);
446
447 Node* out_ctl = proj_out(TypeFunc::Control);
448 igvn->replace_node(out_ctl, ctl);
449 } else {
450 // replace fallthrough projections of the ArrayCopyNode by the
451 // new memory, control and the input IO.
452 CallProjections callprojs;
453 extract_projections(&callprojs, true, false);
454
455 if (callprojs.fallthrough_ioproj != NULL) {
456 igvn->replace_node(callprojs.fallthrough_ioproj, in(TypeFunc::I_O));
457 }
458 if (callprojs.fallthrough_memproj != NULL) {
459 igvn->replace_node(callprojs.fallthrough_memproj, mem);
460 }
461 if (callprojs.fallthrough_catchproj != NULL) {
462 igvn->replace_node(callprojs.fallthrough_catchproj, ctl);
463 }
464
465 // The ArrayCopyNode is not disconnected. It still has the
466 // projections for the exception case. Replace current
467 // ArrayCopyNode with a dummy new one with a top() control so
468 // that this part of the graph stays consistent but is
469 // eventually removed.
470
471 set_req(0, phase->C->top());
472 remove_dead_region(phase, can_reshape);
473 }
474 } else {
475 if (in(TypeFunc::Control) != ctl) {
476 // we can't return new memory and control from Ideal at parse time
477 assert(!is_clonebasic(), "added control for clone?");
478 return false;
479 }
480 }
481 return true;
482 }
483
484
485 Node *ArrayCopyNode::Ideal(PhaseGVN *phase, bool can_reshape) {
486 if (remove_dead_region(phase, can_reshape)) return this;
487
488 if (StressArrayCopyMacroNode && !can_reshape) {
489 phase->record_for_igvn(this);
490 return NULL;
491 }
492
493 // See if it's a small array copy and we can inline it as
494 // loads/stores
495 // Here we can only do:
496 // - arraycopy if all arguments were validated before and we don't
497 // need card marking
498 // - clone for which we don't need to do card marking
499
500 if (!is_clonebasic() && !is_arraycopy_validated() &&
501 !is_copyofrange_validated() && !is_copyof_validated()) {
502 return NULL;
503 }
504
505 assert(in(TypeFunc::Control) != NULL &&
506 in(TypeFunc::Memory) != NULL &&
507 in(ArrayCopyNode::Src) != NULL &&
508 in(ArrayCopyNode::Dest) != NULL &&
509 in(ArrayCopyNode::Length) != NULL &&
510 ((in(ArrayCopyNode::SrcPos) != NULL && in(ArrayCopyNode::DestPos) != NULL) ||
511 is_clonebasic()), "broken inputs");
512
513 if (in(TypeFunc::Control)->is_top() ||
514 in(TypeFunc::Memory)->is_top() ||
515 phase->type(in(ArrayCopyNode::Src)) == Type::TOP ||
516 phase->type(in(ArrayCopyNode::Dest)) == Type::TOP ||
517 (in(ArrayCopyNode::SrcPos) != NULL && in(ArrayCopyNode::SrcPos)->is_top()) ||
518 (in(ArrayCopyNode::DestPos) != NULL && in(ArrayCopyNode::DestPos)->is_top())) {
519 return NULL;
520 }
521
522 int count = get_count(phase);
523
524 if (count < 0 || count > ArrayCopyLoadStoreMaxElem) {
525 return NULL;
526 }
527
528 Node* mem = try_clone_instance(phase, can_reshape, count);
529 if (mem != NULL) {
530 return (mem == NodeSentinel) ? NULL : mem;
531 }
532
533 Node* adr_src = NULL;
534 Node* base_src = NULL;
535 Node* adr_dest = NULL;
536 Node* base_dest = NULL;
537 BasicType copy_type = T_ILLEGAL;
538 const Type* value_type = NULL;
539 bool disjoint_bases = false;
540
541 if (!prepare_array_copy(phase, can_reshape,
542 adr_src, base_src, adr_dest, base_dest,
543 copy_type, value_type, disjoint_bases)) {
544 return NULL;
545 }
546
547 Node* src = in(ArrayCopyNode::Src);
548 Node* dest = in(ArrayCopyNode::Dest);
549 const TypePtr* atp_src = get_address_type(phase, src);
550 const TypePtr* atp_dest = get_address_type(phase, dest);
551 uint alias_idx_src = phase->C->get_alias_index(atp_src);
552 uint alias_idx_dest = phase->C->get_alias_index(atp_dest);
553
554 Node *in_mem = in(TypeFunc::Memory);
555 Node *start_mem_src = in_mem;
556 Node *start_mem_dest = in_mem;
557 if (in_mem->is_MergeMem()) {
558 start_mem_src = in_mem->as_MergeMem()->memory_at(alias_idx_src);
559 start_mem_dest = in_mem->as_MergeMem()->memory_at(alias_idx_dest);
560 }
561
562
563 if (can_reshape) {
564 assert(!phase->is_IterGVN()->delay_transform(), "cannot delay transforms");
565 phase->is_IterGVN()->set_delay_transform(true);
566 }
567
568 Node* backward_ctl = phase->C->top();
569 Node* forward_ctl = phase->C->top();
570 array_copy_test_overlap(phase, can_reshape, disjoint_bases, count, forward_ctl, backward_ctl);
571
572 Node* forward_mem = array_copy_forward(phase, can_reshape, forward_ctl,
573 start_mem_src, start_mem_dest,
574 atp_src, atp_dest,
575 adr_src, base_src, adr_dest, base_dest,
576 copy_type, value_type, count);
577
578 Node* backward_mem = array_copy_backward(phase, can_reshape, backward_ctl,
579 start_mem_src, start_mem_dest,
580 atp_src, atp_dest,
581 adr_src, base_src, adr_dest, base_dest,
582 copy_type, value_type, count);
583
584 Node* ctl = NULL;
585 if (!forward_ctl->is_top() && !backward_ctl->is_top()) {
586 ctl = new RegionNode(3);
587 mem = new PhiNode(ctl, Type::MEMORY, atp_dest);
588 ctl->init_req(1, forward_ctl);
589 mem->init_req(1, forward_mem);
590 ctl->init_req(2, backward_ctl);
591 mem->init_req(2, backward_mem);
592 ctl = phase->transform(ctl);
593 mem = phase->transform(mem);
594 } else if (!forward_ctl->is_top()) {
595 ctl = forward_ctl;
596 mem = forward_mem;
597 } else {
598 assert(!backward_ctl->is_top(), "no copy?");
599 ctl = backward_ctl;
600 mem = backward_mem;
601 }
602
603 if (can_reshape) {
604 assert(phase->is_IterGVN()->delay_transform(), "should be delaying transforms");
605 phase->is_IterGVN()->set_delay_transform(false);
606 }
607
608 MergeMemNode* out_mem = MergeMemNode::make(in_mem);
609 out_mem->set_memory_at(alias_idx_dest, mem);
610 mem = out_mem;
611
612 if (!finish_transform(phase, can_reshape, ctl, mem)) {
613 return NULL;
614 }
615
616 return mem;
617 }
618
619 bool ArrayCopyNode::may_modify(const TypeOopPtr *t_oop, PhaseTransform *phase) {
620 Node* dest = in(ArrayCopyNode::Dest);
621 if (dest->is_top()) {
622 return false;
623 }
624 const TypeOopPtr* dest_t = phase->type(dest)->is_oopptr();
625 assert(!dest_t->is_known_instance() || _dest_type->is_known_instance(), "result of EA not recorded");
626 assert(in(ArrayCopyNode::Src)->is_top() || !phase->type(in(ArrayCopyNode::Src))->is_oopptr()->is_known_instance() ||
627 _src_type->is_known_instance(), "result of EA not recorded");
628
629 if (_dest_type != TypeOopPtr::BOTTOM || t_oop->is_known_instance()) {
630 assert(_dest_type == TypeOopPtr::BOTTOM || _dest_type->is_known_instance(), "result of EA is known instance");
631 return t_oop->instance_id() == _dest_type->instance_id();
632 }
633
634 return CallNode::may_modify_arraycopy_helper(dest_t, t_oop, phase);
635 }
636
637 bool ArrayCopyNode::may_modify_helper(const TypeOopPtr *t_oop, Node* n, PhaseTransform *phase, ArrayCopyNode*& ac) {
638 if (n->Opcode() == Op_StoreCM ||
639 n->Opcode() == Op_StoreB) {
640 // Ignore card mark stores
641 n = n->in(MemNode::Memory);
642 }
643
644 if (n->is_Proj()) {
645 n = n->in(0);
646 if (n->is_Call() && n->as_Call()->may_modify(t_oop, phase)) {
647 if (n->isa_ArrayCopy() != NULL) {
648 ac = n->as_ArrayCopy();
649 }
650 return true;
651 }
652 }
653 return false;
654 }
655
656 bool ArrayCopyNode::may_modify(const TypeOopPtr *t_oop, MemBarNode* mb, PhaseTransform *phase, ArrayCopyNode*& ac) {
657 Node* mem = mb->in(TypeFunc::Memory);
658
659 if (mem->is_MergeMem()) {
660 Node* n = mem->as_MergeMem()->memory_at(Compile::AliasIdxRaw);
661 if (may_modify_helper(t_oop, n, phase, ac)) {
662 return true;
663 } else if (n->is_Phi()) {
664 for (uint i = 1; i < n->req(); i++) {
665 if (n->in(i) != NULL) {
666 if (may_modify_helper(t_oop, n->in(i), phase, ac)) {
667 return true;
668 }
669 }
670 }
671 }
672 }
673
674 return false;
675 }
676
677 // Does this array copy modify offsets between offset_lo and offset_hi
678 // in the destination array
679 // if must_modify is false, return true if the copy could write
680 // between offset_lo and offset_hi
681 // if must_modify is true, return true if the copy is guaranteed to
682 // write between offset_lo and offset_hi
683 bool ArrayCopyNode::modifies(intptr_t offset_lo, intptr_t offset_hi, PhaseTransform* phase, bool must_modify) {
684 assert(_kind == ArrayCopy || _kind == CopyOf || _kind == CopyOfRange, "only for real array copies");
685
686 Node* dest = in(ArrayCopyNode::Dest);
687 Node* src_pos = in(ArrayCopyNode::SrcPos);
688 Node* dest_pos = in(ArrayCopyNode::DestPos);
689 Node* len = in(ArrayCopyNode::Length);
690
691 const TypeInt *dest_pos_t = phase->type(dest_pos)->isa_int();
692 const TypeInt *len_t = phase->type(len)->isa_int();
693 const TypeAryPtr* ary_t = phase->type(dest)->isa_aryptr();
694
695 if (dest_pos_t != NULL && len_t != NULL && ary_t != NULL) {
696 BasicType ary_elem = ary_t->klass()->as_array_klass()->element_type()->basic_type();
697 uint header = arrayOopDesc::base_offset_in_bytes(ary_elem);
698 uint elemsize = type2aelembytes(ary_elem);
699
700 jlong dest_pos_plus_len_lo = (((jlong)dest_pos_t->_lo) + len_t->_lo) * elemsize + header;
701 jlong dest_pos_plus_len_hi = (((jlong)dest_pos_t->_hi) + len_t->_hi) * elemsize + header;
702 jlong dest_pos_lo = ((jlong)dest_pos_t->_lo) * elemsize + header;
703 jlong dest_pos_hi = ((jlong)dest_pos_t->_hi) * elemsize + header;
704
705 if (must_modify) {
706 if (offset_lo >= dest_pos_hi && offset_hi < dest_pos_plus_len_lo) {
707 return true;
708 }
709 } else {
710 if (offset_hi >= dest_pos_lo && offset_lo < dest_pos_plus_len_hi) {
711 return true;
712 }
713 }
714 }
715 return false;
716 }