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
226 if (is_arraycopy() || is_copyofrange() || is_copyof()) {
227 const Type* dest_type = phase->type(dest);
228 const TypeAryPtr* ary_dest = dest_type->isa_aryptr();
229 Node* src_offset = in(ArrayCopyNode::SrcPos);
230 Node* dest_offset = in(ArrayCopyNode::DestPos);
231
232 // newly allocated object is guaranteed to not overlap with source object
233 disjoint_bases = is_alloc_tightly_coupled();
234
235 if (ary_src == NULL || ary_src->klass() == NULL ||
236 ary_dest == NULL || ary_dest->klass() == NULL) {
237 // We don't know if arguments are arrays
238 return false;
239 }
240
241 BasicType src_elem = ary_src->klass()->as_array_klass()->element_type()->basic_type();
242 BasicType dest_elem = ary_dest->klass()->as_array_klass()->element_type()->basic_type();
243 if (src_elem == T_ARRAY) src_elem = T_OBJECT;
244 if (dest_elem == T_ARRAY) dest_elem = T_OBJECT;
245
246 if (src_elem != dest_elem || dest_elem == T_VOID) {
247 // We don't know if arguments are arrays of the same type
248 return false;
249 }
250
251 if (dest_elem == T_OBJECT && (!is_alloc_tightly_coupled() || !GraphKit::use_ReduceInitialCardMarks())) {
252 // It's an object array copy but we can't emit the card marking
253 // that is needed
254 return false;
255 }
256
257 if (UseShenandoahGC && dest_elem == T_OBJECT) {
258 // TODO: Disabled. We need to resolve the loaded values before storing them into
259 // the copy object. Or call out to the clone barrier that takes care of it.
260 return false;
261 }
262
263 value_type = ary_src->elem();
264
265 base_src = src;
266 base_dest = dest;
267
268 uint shift = exact_log2(type2aelembytes(dest_elem));
269 uint header = arrayOopDesc::base_offset_in_bytes(dest_elem);
270
271 adr_src = src;
272 adr_dest = dest;
273
274 src_offset = Compile::conv_I2X_index(phase, src_offset, ary_src->size());
275 dest_offset = Compile::conv_I2X_index(phase, dest_offset, ary_dest->size());
276
277 Node* src_scale = phase->transform(new LShiftXNode(src_offset, phase->intcon(shift)));
278 Node* dest_scale = phase->transform(new LShiftXNode(dest_offset, phase->intcon(shift)));
279
280 adr_src = phase->transform(new AddPNode(base_src, adr_src, src_scale));
281 adr_dest = phase->transform(new AddPNode(base_dest, adr_dest, dest_scale));
282
283 adr_src = new AddPNode(base_src, adr_src, phase->MakeConX(header));
284 adr_dest = new AddPNode(base_dest, adr_dest, phase->MakeConX(header));
285
286 adr_src = phase->transform(adr_src);
287 adr_dest = phase->transform(adr_dest);
288
289 copy_type = dest_elem;
290 } else {
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 if (out_mem->outcnt() != 1 || !out_mem->raw_out(0)->is_MergeMem() ||
439 out_mem->raw_out(0)->outcnt() != 1 || !out_mem->raw_out(0)->raw_out(0)->is_MemBar()) {
440 assert(!GraphKit::use_ReduceInitialCardMarks(), "can only happen with card marking");
441 return false;
442 }
443
444 igvn->replace_node(out_mem->raw_out(0), mem);
445
446 Node* out_ctl = proj_out(TypeFunc::Control);
447 igvn->replace_node(out_ctl, ctl);
448 } else {
449 // replace fallthrough projections of the ArrayCopyNode by the
450 // new memory, control and the input IO.
451 CallProjections callprojs;
452 extract_projections(&callprojs, true, false);
453
454 if (callprojs.fallthrough_ioproj != NULL) {
455 igvn->replace_node(callprojs.fallthrough_ioproj, in(TypeFunc::I_O));
456 }
457 if (callprojs.fallthrough_memproj != NULL) {
458 igvn->replace_node(callprojs.fallthrough_memproj, mem);
459 }
460 if (callprojs.fallthrough_catchproj != NULL) {
461 igvn->replace_node(callprojs.fallthrough_catchproj, ctl);
462 }
463
464 // The ArrayCopyNode is not disconnected. It still has the
465 // projections for the exception case. Replace current
466 // ArrayCopyNode with a dummy new one with a top() control so
467 // that this part of the graph stays consistent but is
468 // eventually removed.
469
470 set_req(0, phase->C->top());
471 remove_dead_region(phase, can_reshape);
472 }
473 } else {
474 if (in(TypeFunc::Control) != ctl) {
475 // we can't return new memory and control from Ideal at parse time
476 assert(!is_clonebasic(), "added control for clone?");
477 return false;
478 }
479 }
480 return true;
481 }
482
483
484 Node *ArrayCopyNode::Ideal(PhaseGVN *phase, bool can_reshape) {
485 if (remove_dead_region(phase, can_reshape)) return this;
486
487 if (StressArrayCopyMacroNode && !can_reshape) {
488 phase->record_for_igvn(this);
489 return NULL;
490 }
491
492 // See if it's a small array copy and we can inline it as
493 // loads/stores
494 // Here we can only do:
495 // - arraycopy if all arguments were validated before and we don't
496 // need card marking
497 // - clone for which we don't need to do card marking
498
499 if (!is_clonebasic() && !is_arraycopy_validated() &&
500 !is_copyofrange_validated() && !is_copyof_validated()) {
501 return NULL;
502 }
503
504 assert(in(TypeFunc::Control) != NULL &&
505 in(TypeFunc::Memory) != NULL &&
506 in(ArrayCopyNode::Src) != NULL &&
507 in(ArrayCopyNode::Dest) != NULL &&
508 in(ArrayCopyNode::Length) != NULL &&
509 ((in(ArrayCopyNode::SrcPos) != NULL && in(ArrayCopyNode::DestPos) != NULL) ||
510 is_clonebasic()), "broken inputs");
511
512 if (in(TypeFunc::Control)->is_top() ||
513 in(TypeFunc::Memory)->is_top() ||
514 phase->type(in(ArrayCopyNode::Src)) == Type::TOP ||
515 phase->type(in(ArrayCopyNode::Dest)) == Type::TOP ||
516 (in(ArrayCopyNode::SrcPos) != NULL && in(ArrayCopyNode::SrcPos)->is_top()) ||
517 (in(ArrayCopyNode::DestPos) != NULL && in(ArrayCopyNode::DestPos)->is_top())) {
518 return NULL;
519 }
520
521 int count = get_count(phase);
522
523 if (count < 0 || count > ArrayCopyLoadStoreMaxElem) {
524 return NULL;
525 }
526
527 Node* mem = try_clone_instance(phase, can_reshape, count);
528 if (mem != NULL) {
529 return mem;
530 }
531
532 Node* adr_src = NULL;
533 Node* base_src = NULL;
534 Node* adr_dest = NULL;
535 Node* base_dest = NULL;
536 BasicType copy_type = T_ILLEGAL;
537 const Type* value_type = NULL;
538 bool disjoint_bases = false;
539
540 if (!prepare_array_copy(phase, can_reshape,
541 adr_src, base_src, adr_dest, base_dest,
542 copy_type, value_type, disjoint_bases)) {
543 return NULL;
544 }
545
546 Node* src = in(ArrayCopyNode::Src);
547 Node* dest = in(ArrayCopyNode::Dest);
548 const TypePtr* atp_src = get_address_type(phase, src);
549 const TypePtr* atp_dest = get_address_type(phase, dest);
550 uint alias_idx_src = phase->C->get_alias_index(atp_src);
551 uint alias_idx_dest = phase->C->get_alias_index(atp_dest);
552
553 Node *in_mem = in(TypeFunc::Memory);
554 Node *start_mem_src = in_mem;
555 Node *start_mem_dest = in_mem;
556 if (in_mem->is_MergeMem()) {
557 start_mem_src = in_mem->as_MergeMem()->memory_at(alias_idx_src);
558 start_mem_dest = in_mem->as_MergeMem()->memory_at(alias_idx_dest);
559 }
560
561
562 if (can_reshape) {
563 assert(!phase->is_IterGVN()->delay_transform(), "cannot delay transforms");
564 phase->is_IterGVN()->set_delay_transform(true);
565 }
566
567 Node* backward_ctl = phase->C->top();
568 Node* forward_ctl = phase->C->top();
569 array_copy_test_overlap(phase, can_reshape, disjoint_bases, count, forward_ctl, backward_ctl);
570
571 Node* forward_mem = array_copy_forward(phase, can_reshape, forward_ctl,
572 start_mem_src, start_mem_dest,
573 atp_src, atp_dest,
574 adr_src, base_src, adr_dest, base_dest,
575 copy_type, value_type, count);
576
577 Node* backward_mem = array_copy_backward(phase, can_reshape, backward_ctl,
578 start_mem_src, start_mem_dest,
579 atp_src, atp_dest,
580 adr_src, base_src, adr_dest, base_dest,
581 copy_type, value_type, count);
582
583 Node* ctl = NULL;
584 if (!forward_ctl->is_top() && !backward_ctl->is_top()) {
585 ctl = new RegionNode(3);
586 mem = new PhiNode(ctl, Type::MEMORY, atp_dest);
587 ctl->init_req(1, forward_ctl);
588 mem->init_req(1, forward_mem);
589 ctl->init_req(2, backward_ctl);
590 mem->init_req(2, backward_mem);
591 ctl = phase->transform(ctl);
592 mem = phase->transform(mem);
593 } else if (!forward_ctl->is_top()) {
594 ctl = forward_ctl;
595 mem = forward_mem;
596 } else {
597 assert(!backward_ctl->is_top(), "no copy?");
598 ctl = backward_ctl;
599 mem = backward_mem;
600 }
601
602 if (can_reshape) {
603 assert(phase->is_IterGVN()->delay_transform(), "should be delaying transforms");
604 phase->is_IterGVN()->set_delay_transform(false);
605 }
606
607 MergeMemNode* out_mem = MergeMemNode::make(in_mem);
608 out_mem->set_memory_at(alias_idx_dest, mem);
609 mem = out_mem;
610
611 if (!finish_transform(phase, can_reshape, ctl, mem)) {
612 return NULL;
613 }
614
615 return mem;
616 }
617
618 bool ArrayCopyNode::may_modify(const TypeOopPtr *t_oop, PhaseTransform *phase) {
619 Node* dest = in(ArrayCopyNode::Dest);
620 if (dest->is_top()) {
621 return false;
622 }
623 const TypeOopPtr* dest_t = phase->type(dest)->is_oopptr();
624 assert(!dest_t->is_known_instance() || _dest_type->is_known_instance(), "result of EA not recorded");
625 assert(in(ArrayCopyNode::Src)->is_top() || !phase->type(in(ArrayCopyNode::Src))->is_oopptr()->is_known_instance() ||
626 _src_type->is_known_instance(), "result of EA not recorded");
627
628 if (_dest_type != TypeOopPtr::BOTTOM || t_oop->is_known_instance()) {
629 assert(_dest_type == TypeOopPtr::BOTTOM || _dest_type->is_known_instance(), "result of EA is known instance");
630 return t_oop->instance_id() == _dest_type->instance_id();
631 }
632
633 return CallNode::may_modify_arraycopy_helper(dest_t, t_oop, phase);
634 }
635
636 bool ArrayCopyNode::may_modify_helper(const TypeOopPtr *t_oop, Node* n, PhaseTransform *phase) {
637 if (n->is_Proj()) {
638 n = n->in(0);
639 if (n->is_Call() && n->as_Call()->may_modify(t_oop, phase)) {
640 return true;
641 }
642 }
643 return false;
644 }
645
646 bool ArrayCopyNode::may_modify(const TypeOopPtr *t_oop, MemBarNode* mb, PhaseTransform *phase) {
647 Node* mem = mb->in(TypeFunc::Memory);
648
649 if (mem->is_MergeMem()) {
650 Node* n = mem->as_MergeMem()->memory_at(Compile::AliasIdxRaw);
651 if (may_modify_helper(t_oop, n, phase)) {
652 return true;
653 } else if (n->is_Phi()) {
654 for (uint i = 1; i < n->req(); i++) {
655 if (n->in(i) != NULL) {
656 if (may_modify_helper(t_oop, n->in(i), phase)) {
657 return true;
658 }
659 }
660 }
661 }
662 }
663
664 return false;
665 }
666
667 // Does this array copy modify offsets between offset_lo and offset_hi
668 // in the destination array
669 // if must_modify is false, return true if the copy could write
670 // between offset_lo and offset_hi
671 // if must_modify is true, return true if the copy is guaranteed to
672 // write between offset_lo and offset_hi
673 bool ArrayCopyNode::modifies(intptr_t offset_lo, intptr_t offset_hi, PhaseTransform* phase, bool must_modify) {
674 assert(_kind == ArrayCopy || _kind == CopyOf || _kind == CopyOfRange, "only for real array copies");
675
676 Node* dest = in(ArrayCopyNode::Dest);
677 Node* src_pos = in(ArrayCopyNode::SrcPos);
678 Node* dest_pos = in(ArrayCopyNode::DestPos);
679 Node* len = in(ArrayCopyNode::Length);
680
681 const TypeInt *dest_pos_t = phase->type(dest_pos)->isa_int();
682 const TypeInt *len_t = phase->type(len)->isa_int();
683 const TypeAryPtr* ary_t = phase->type(dest)->isa_aryptr();
684
685 if (dest_pos_t != NULL && len_t != NULL && ary_t != NULL) {
686 BasicType ary_elem = ary_t->klass()->as_array_klass()->element_type()->basic_type();
687 uint header = arrayOopDesc::base_offset_in_bytes(ary_elem);
688 uint elemsize = type2aelembytes(ary_elem);
689
690 jlong dest_pos_plus_len_lo = (((jlong)dest_pos_t->_lo) + len_t->_lo) * elemsize + header;
691 jlong dest_pos_plus_len_hi = (((jlong)dest_pos_t->_hi) + len_t->_hi) * elemsize + header;
692 jlong dest_pos_lo = ((jlong)dest_pos_t->_lo) * elemsize + header;
693 jlong dest_pos_hi = ((jlong)dest_pos_t->_hi) * elemsize + header;
694
695 if (must_modify) {
696 if (offset_lo >= dest_pos_hi && offset_hi < dest_pos_plus_len_lo) {
697 return true;
698 }
699 } else {
700 if (offset_hi >= dest_pos_lo && offset_lo < dest_pos_plus_len_hi) {
701 return true;
702 }
703 }
704 }
705 return false;
706 }