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