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 "gc/shared/barrierSet.hpp"
27 #include "gc/shared/c2/barrierSetC2.hpp"
28 #include "gc/shared/c2/cardTableBarrierSetC2.hpp"
29 #include "opto/arraycopynode.hpp"
30 #include "opto/graphKit.hpp"
31 #include "runtime/sharedRuntime.hpp"
32 #include "utilities/macros.hpp"
33
34 ArrayCopyNode::ArrayCopyNode(Compile* C, bool alloc_tightly_coupled, bool has_negative_length_guard)
35 : CallNode(arraycopy_type(), NULL, TypeRawPtr::BOTTOM),
36 _kind(None),
37 _alloc_tightly_coupled(alloc_tightly_coupled),
38 _has_negative_length_guard(has_negative_length_guard),
39 _arguments_validated(false),
40 _src_type(TypeOopPtr::BOTTOM),
41 _dest_type(TypeOopPtr::BOTTOM) {
42 init_class_id(Class_ArrayCopy);
43 init_flags(Flag_is_macro);
44 C->add_macro_node(this);
45 }
46
47 uint ArrayCopyNode::size_of() const { return sizeof(*this); }
48
49 ArrayCopyNode* ArrayCopyNode::make(GraphKit* kit, bool may_throw,
50 Node* src, Node* src_offset,
51 Node* dest, Node* dest_offset,
52 Node* length,
53 bool alloc_tightly_coupled,
54 bool has_negative_length_guard,
55 Node* src_klass, Node* dest_klass,
240 // newly allocated object is guaranteed to not overlap with source object
241 disjoint_bases = is_alloc_tightly_coupled();
242
243 if (ary_src == NULL || ary_src->klass() == NULL ||
244 ary_dest == NULL || ary_dest->klass() == NULL) {
245 // We don't know if arguments are arrays
246 return false;
247 }
248
249 BasicType src_elem = ary_src->klass()->as_array_klass()->element_type()->basic_type();
250 BasicType dest_elem = ary_dest->klass()->as_array_klass()->element_type()->basic_type();
251 if (src_elem == T_ARRAY) src_elem = T_OBJECT;
252 if (dest_elem == T_ARRAY) dest_elem = T_OBJECT;
253
254 if (src_elem != dest_elem || dest_elem == T_VOID) {
255 // We don't know if arguments are arrays of the same type
256 return false;
257 }
258
259 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
260 if (dest_elem == T_OBJECT && (!is_alloc_tightly_coupled() ||
261 bs->array_copy_requires_gc_barriers(T_OBJECT))) {
262 // It's an object array copy but we can't emit the card marking
263 // that is needed
264 return false;
265 }
266
267 value_type = ary_src->elem();
268
269 base_src = src;
270 base_dest = dest;
271
272 uint shift = exact_log2(type2aelembytes(dest_elem));
273 uint header = arrayOopDesc::base_offset_in_bytes(dest_elem);
274
275 adr_src = src;
276 adr_dest = dest;
277
278 src_offset = Compile::conv_I2X_index(phase, src_offset, ary_src->size());
279 dest_offset = Compile::conv_I2X_index(phase, dest_offset, ary_dest->size());
280
281 Node* src_scale = phase->transform(new LShiftXNode(src_offset, phase->intcon(shift)));
290 adr_src = phase->transform(adr_src);
291 adr_dest = phase->transform(adr_dest);
292
293 copy_type = dest_elem;
294 } else {
295 assert(ary_src != NULL, "should be a clone");
296 assert(is_clonebasic(), "should be");
297
298 disjoint_bases = true;
299 assert(src->is_AddP(), "should be base + off");
300 assert(dest->is_AddP(), "should be base + off");
301 adr_src = src;
302 base_src = src->in(AddPNode::Base);
303 adr_dest = dest;
304 base_dest = dest->in(AddPNode::Base);
305
306 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?");
307 BasicType elem = ary_src->klass()->as_array_klass()->element_type()->basic_type();
308 if (elem == T_ARRAY) elem = T_OBJECT;
309
310 int diff = arrayOopDesc::base_offset_in_bytes(elem) - phase->type(src->in(AddPNode::Offset))->is_intptr_t()->get_con();
311 assert(diff >= 0, "clone should not start after 1st array element");
312 if (diff > 0) {
313 adr_src = phase->transform(new AddPNode(base_src, adr_src, phase->MakeConX(diff)));
314 adr_dest = phase->transform(new AddPNode(base_dest, adr_dest, phase->MakeConX(diff)));
315 }
316
317 copy_type = elem;
318 value_type = ary_src->elem();
319 }
320 return true;
321 }
322
323 const TypePtr* ArrayCopyNode::get_address_type(PhaseGVN *phase, Node* n) {
324 const Type* at = phase->type(n);
325 assert(at != Type::TOP, "unexpected type");
326 const TypePtr* atp = at->isa_ptr();
327 // adjust atp to be the correct array element address type
328 atp = atp->add_offset(Type::OffsetBot);
329 return atp;
333 Node* ctl = in(TypeFunc::Control);
334 if (!disjoint_bases && count > 1) {
335 Node* src_offset = in(ArrayCopyNode::SrcPos);
336 Node* dest_offset = in(ArrayCopyNode::DestPos);
337 assert(src_offset != NULL && dest_offset != NULL, "should be");
338 Node* cmp = phase->transform(new CmpINode(src_offset, dest_offset));
339 Node *bol = phase->transform(new BoolNode(cmp, BoolTest::lt));
340 IfNode *iff = new IfNode(ctl, bol, PROB_FAIR, COUNT_UNKNOWN);
341
342 phase->transform(iff);
343
344 forward_ctl = phase->transform(new IfFalseNode(iff));
345 backward_ctl = phase->transform(new IfTrueNode(iff));
346 } else {
347 forward_ctl = ctl;
348 }
349 }
350
351 Node* ArrayCopyNode::array_copy_forward(PhaseGVN *phase,
352 bool can_reshape,
353 Node* forward_ctl,
354 Node* start_mem_src,
355 Node* start_mem_dest,
356 const TypePtr* atp_src,
357 const TypePtr* atp_dest,
358 Node* adr_src,
359 Node* base_src,
360 Node* adr_dest,
361 Node* base_dest,
362 BasicType copy_type,
363 const Type* value_type,
364 int count) {
365 Node* mem = phase->C->top();
366 if (!forward_ctl->is_top()) {
367 // copy forward
368 mem = start_mem_dest;
369 uint alias_idx_src = phase->C->get_alias_index(atp_src);
370 uint alias_idx_dest = phase->C->get_alias_index(atp_dest);
371 bool same_alias = (alias_idx_src == alias_idx_dest);
372
373 if (count > 0) {
374 Node* v = LoadNode::make(*phase, forward_ctl, start_mem_src, adr_src, atp_src, value_type, copy_type, MemNode::unordered);
375 v = phase->transform(v);
376 mem = StoreNode::make(*phase, forward_ctl, mem, adr_dest, atp_dest, v, copy_type, MemNode::unordered);
377 mem = phase->transform(mem);
378 for (int i = 1; i < count; i++) {
379 Node* off = phase->MakeConX(type2aelembytes(copy_type) * i);
380 Node* next_src = phase->transform(new AddPNode(base_src,adr_src,off));
381 Node* next_dest = phase->transform(new AddPNode(base_dest,adr_dest,off));
382 v = LoadNode::make(*phase, forward_ctl, same_alias ? mem : start_mem_src, next_src, atp_src, value_type, copy_type, MemNode::unordered);
383 v = phase->transform(v);
384 mem = StoreNode::make(*phase, forward_ctl,mem,next_dest,atp_dest,v, copy_type, MemNode::unordered);
385 mem = phase->transform(mem);
386 }
387 } else if(can_reshape) {
388 PhaseIterGVN* igvn = phase->is_IterGVN();
389 igvn->_worklist.push(adr_src);
390 igvn->_worklist.push(adr_dest);
391 }
392 }
393 return mem;
394 }
395
396 Node* ArrayCopyNode::array_copy_backward(PhaseGVN *phase,
397 bool can_reshape,
398 Node* backward_ctl,
399 Node* start_mem_src,
400 Node* start_mem_dest,
401 const TypePtr* atp_src,
402 const TypePtr* atp_dest,
403 Node* adr_src,
404 Node* base_src,
405 Node* adr_dest,
406 Node* base_dest,
407 BasicType copy_type,
408 const Type* value_type,
409 int count) {
410 Node* mem = phase->C->top();
411 if (!backward_ctl->is_top()) {
412 // copy backward
413 mem = start_mem_dest;
414 uint alias_idx_src = phase->C->get_alias_index(atp_src);
415 uint alias_idx_dest = phase->C->get_alias_index(atp_dest);
416 bool same_alias = (alias_idx_src == alias_idx_dest);
417
418 if (count > 0) {
419 for (int i = count-1; i >= 1; i--) {
420 Node* off = phase->MakeConX(type2aelembytes(copy_type) * i);
421 Node* next_src = phase->transform(new AddPNode(base_src,adr_src,off));
422 Node* next_dest = phase->transform(new AddPNode(base_dest,adr_dest,off));
423 Node* v = LoadNode::make(*phase, backward_ctl, same_alias ? mem : start_mem_src, next_src, atp_src, value_type, copy_type, MemNode::unordered);
424 v = phase->transform(v);
425 mem = StoreNode::make(*phase, backward_ctl,mem,next_dest,atp_dest,v, copy_type, MemNode::unordered);
426 mem = phase->transform(mem);
427 }
428 Node* v = LoadNode::make(*phase, backward_ctl, same_alias ? mem : start_mem_src, adr_src, atp_src, value_type, copy_type, MemNode::unordered);
429 v = phase->transform(v);
430 mem = StoreNode::make(*phase, backward_ctl, mem, adr_dest, atp_dest, v, copy_type, MemNode::unordered);
431 mem = phase->transform(mem);
432 } else if(can_reshape) {
433 PhaseIterGVN* igvn = phase->is_IterGVN();
434 igvn->_worklist.push(adr_src);
435 igvn->_worklist.push(adr_dest);
436 }
437 }
438 return mem;
439 }
440
441 bool ArrayCopyNode::finish_transform(PhaseGVN *phase, bool can_reshape,
442 Node* ctl, Node *mem) {
443 if (can_reshape) {
444 PhaseIterGVN* igvn = phase->is_IterGVN();
445 igvn->set_delay_transform(false);
446 if (is_clonebasic()) {
447 Node* out_mem = proj_out(TypeFunc::Memory);
448
449 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
450 if (out_mem->outcnt() != 1 || !out_mem->raw_out(0)->is_MergeMem() ||
451 out_mem->raw_out(0)->outcnt() != 1 || !out_mem->raw_out(0)->raw_out(0)->is_MemBar()) {
452 assert(bs->array_copy_requires_gc_barriers(T_OBJECT), "can only happen with card marking");
453 return false;
454 }
455
456 igvn->replace_node(out_mem->raw_out(0), mem);
457
458 Node* out_ctl = proj_out(TypeFunc::Control);
459 igvn->replace_node(out_ctl, ctl);
460 } else {
461 // replace fallthrough projections of the ArrayCopyNode by the
462 // new memory, control and the input IO.
463 CallProjections callprojs;
464 extract_projections(&callprojs, true, false);
465
466 if (callprojs.fallthrough_ioproj != NULL) {
467 igvn->replace_node(callprojs.fallthrough_ioproj, in(TypeFunc::I_O));
468 }
469 if (callprojs.fallthrough_memproj != NULL) {
470 igvn->replace_node(callprojs.fallthrough_memproj, mem);
471 }
472 if (callprojs.fallthrough_catchproj != NULL) {
473 igvn->replace_node(callprojs.fallthrough_catchproj, ctl);
474 }
475
476 // The ArrayCopyNode is not disconnected. It still has the
477 // projections for the exception case. Replace current
478 // ArrayCopyNode with a dummy new one with a top() control so
479 // that this part of the graph stays consistent but is
480 // eventually removed.
481
482 set_req(0, phase->C->top());
483 remove_dead_region(phase, can_reshape);
484 }
485 } else {
486 if (in(TypeFunc::Control) != ctl) {
487 // we can't return new memory and control from Ideal at parse time
488 assert(!is_clonebasic(), "added control for clone?");
489 return false;
490 }
491 }
492 return true;
493 }
494
495
496 Node *ArrayCopyNode::Ideal(PhaseGVN *phase, bool can_reshape) {
497 if (remove_dead_region(phase, can_reshape)) return this;
498
499 if (StressArrayCopyMacroNode && !can_reshape) {
500 phase->record_for_igvn(this);
501 return NULL;
502 }
503
504 // See if it's a small array copy and we can inline it as
505 // loads/stores
506 // Here we can only do:
507 // - arraycopy if all arguments were validated before and we don't
508 // need card marking
542 }
543
544 Node* adr_src = NULL;
545 Node* base_src = NULL;
546 Node* adr_dest = NULL;
547 Node* base_dest = NULL;
548 BasicType copy_type = T_ILLEGAL;
549 const Type* value_type = NULL;
550 bool disjoint_bases = false;
551
552 if (!prepare_array_copy(phase, can_reshape,
553 adr_src, base_src, adr_dest, base_dest,
554 copy_type, value_type, disjoint_bases)) {
555 return NULL;
556 }
557
558 Node* src = in(ArrayCopyNode::Src);
559 Node* dest = in(ArrayCopyNode::Dest);
560 const TypePtr* atp_src = get_address_type(phase, src);
561 const TypePtr* atp_dest = get_address_type(phase, dest);
562 uint alias_idx_src = phase->C->get_alias_index(atp_src);
563 uint alias_idx_dest = phase->C->get_alias_index(atp_dest);
564
565 Node *in_mem = in(TypeFunc::Memory);
566 Node *start_mem_src = in_mem;
567 Node *start_mem_dest = in_mem;
568 if (in_mem->is_MergeMem()) {
569 start_mem_src = in_mem->as_MergeMem()->memory_at(alias_idx_src);
570 start_mem_dest = in_mem->as_MergeMem()->memory_at(alias_idx_dest);
571 }
572
573
574 if (can_reshape) {
575 assert(!phase->is_IterGVN()->delay_transform(), "cannot delay transforms");
576 phase->is_IterGVN()->set_delay_transform(true);
577 }
578
579 Node* backward_ctl = phase->C->top();
580 Node* forward_ctl = phase->C->top();
581 array_copy_test_overlap(phase, can_reshape, disjoint_bases, count, forward_ctl, backward_ctl);
582
583 Node* forward_mem = array_copy_forward(phase, can_reshape, forward_ctl,
584 start_mem_src, start_mem_dest,
585 atp_src, atp_dest,
586 adr_src, base_src, adr_dest, base_dest,
587 copy_type, value_type, count);
588
589 Node* backward_mem = array_copy_backward(phase, can_reshape, backward_ctl,
590 start_mem_src, start_mem_dest,
591 atp_src, atp_dest,
592 adr_src, base_src, adr_dest, base_dest,
593 copy_type, value_type, count);
594
595 Node* ctl = NULL;
596 if (!forward_ctl->is_top() && !backward_ctl->is_top()) {
597 ctl = new RegionNode(3);
598 mem = new PhiNode(ctl, Type::MEMORY, atp_dest);
599 ctl->init_req(1, forward_ctl);
600 mem->init_req(1, forward_mem);
601 ctl->init_req(2, backward_ctl);
602 mem->init_req(2, backward_mem);
603 ctl = phase->transform(ctl);
604 mem = phase->transform(mem);
605 } else if (!forward_ctl->is_top()) {
606 ctl = forward_ctl;
607 mem = forward_mem;
608 } else {
609 assert(!backward_ctl->is_top(), "no copy?");
610 ctl = backward_ctl;
611 mem = backward_mem;
612 }
613
614 if (can_reshape) {
615 assert(phase->is_IterGVN()->delay_transform(), "should be delaying transforms");
616 phase->is_IterGVN()->set_delay_transform(false);
617 }
618
619 MergeMemNode* out_mem = MergeMemNode::make(in_mem);
620 out_mem->set_memory_at(alias_idx_dest, mem);
621 mem = out_mem;
622
623 if (!finish_transform(phase, can_reshape, ctl, mem)) {
624 return NULL;
625 }
626
627 return mem;
628 }
629
630 bool ArrayCopyNode::may_modify(const TypeOopPtr *t_oop, PhaseTransform *phase) {
631 Node* dest = in(ArrayCopyNode::Dest);
632 if (dest->is_top()) {
633 return false;
634 }
635 const TypeOopPtr* dest_t = phase->type(dest)->is_oopptr();
636 assert(!dest_t->is_known_instance() || _dest_type->is_known_instance(), "result of EA not recorded");
637 assert(in(ArrayCopyNode::Src)->is_top() || !phase->type(in(ArrayCopyNode::Src))->is_oopptr()->is_known_instance() ||
638 _src_type->is_known_instance(), "result of EA not recorded");
639
640 if (_dest_type != TypeOopPtr::BOTTOM || t_oop->is_known_instance()) {
641 assert(_dest_type == TypeOopPtr::BOTTOM || _dest_type->is_known_instance(), "result of EA is known instance");
|
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 "gc/shared/barrierSet.hpp"
27 #include "gc/shared/c2/barrierSetC2.hpp"
28 #include "gc/shared/c2/cardTableBarrierSetC2.hpp"
29 #include "opto/arraycopynode.hpp"
30 #include "opto/graphKit.hpp"
31 #include "runtime/sharedRuntime.hpp"
32 #include "utilities/macros.hpp"
33
34 ArrayCopyNode::ArrayCopyNode(Compile* C, bool alloc_tightly_coupled, bool has_negative_length_guard)
35 : CallNode(arraycopy_type(), NULL, TypePtr::BOTTOM),
36 _kind(None),
37 _alloc_tightly_coupled(alloc_tightly_coupled),
38 _has_negative_length_guard(has_negative_length_guard),
39 _arguments_validated(false),
40 _src_type(TypeOopPtr::BOTTOM),
41 _dest_type(TypeOopPtr::BOTTOM) {
42 init_class_id(Class_ArrayCopy);
43 init_flags(Flag_is_macro);
44 C->add_macro_node(this);
45 }
46
47 uint ArrayCopyNode::size_of() const { return sizeof(*this); }
48
49 ArrayCopyNode* ArrayCopyNode::make(GraphKit* kit, bool may_throw,
50 Node* src, Node* src_offset,
51 Node* dest, Node* dest_offset,
52 Node* length,
53 bool alloc_tightly_coupled,
54 bool has_negative_length_guard,
55 Node* src_klass, Node* dest_klass,
240 // newly allocated object is guaranteed to not overlap with source object
241 disjoint_bases = is_alloc_tightly_coupled();
242
243 if (ary_src == NULL || ary_src->klass() == NULL ||
244 ary_dest == NULL || ary_dest->klass() == NULL) {
245 // We don't know if arguments are arrays
246 return false;
247 }
248
249 BasicType src_elem = ary_src->klass()->as_array_klass()->element_type()->basic_type();
250 BasicType dest_elem = ary_dest->klass()->as_array_klass()->element_type()->basic_type();
251 if (src_elem == T_ARRAY) src_elem = T_OBJECT;
252 if (dest_elem == T_ARRAY) dest_elem = T_OBJECT;
253
254 if (src_elem != dest_elem || dest_elem == T_VOID) {
255 // We don't know if arguments are arrays of the same type
256 return false;
257 }
258
259 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
260 if (bs->array_copy_requires_gc_barriers(is_alloc_tightly_coupled(), dest_elem, false, BarrierSetC2::Optimization)) {
261 // It's an object array copy but we can't emit the card marking
262 // that is needed
263 return false;
264 }
265
266 value_type = ary_src->elem();
267
268 base_src = src;
269 base_dest = dest;
270
271 uint shift = exact_log2(type2aelembytes(dest_elem));
272 uint header = arrayOopDesc::base_offset_in_bytes(dest_elem);
273
274 adr_src = src;
275 adr_dest = dest;
276
277 src_offset = Compile::conv_I2X_index(phase, src_offset, ary_src->size());
278 dest_offset = Compile::conv_I2X_index(phase, dest_offset, ary_dest->size());
279
280 Node* src_scale = phase->transform(new LShiftXNode(src_offset, phase->intcon(shift)));
289 adr_src = phase->transform(adr_src);
290 adr_dest = phase->transform(adr_dest);
291
292 copy_type = dest_elem;
293 } else {
294 assert(ary_src != NULL, "should be a clone");
295 assert(is_clonebasic(), "should be");
296
297 disjoint_bases = true;
298 assert(src->is_AddP(), "should be base + off");
299 assert(dest->is_AddP(), "should be base + off");
300 adr_src = src;
301 base_src = src->in(AddPNode::Base);
302 adr_dest = dest;
303 base_dest = dest->in(AddPNode::Base);
304
305 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?");
306 BasicType elem = ary_src->klass()->as_array_klass()->element_type()->basic_type();
307 if (elem == T_ARRAY) elem = T_OBJECT;
308
309 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
310 if (bs->array_copy_requires_gc_barriers(true, elem, true, BarrierSetC2::Optimization)) {
311 return false;
312 }
313
314 int diff = arrayOopDesc::base_offset_in_bytes(elem) - phase->type(src->in(AddPNode::Offset))->is_intptr_t()->get_con();
315 assert(diff >= 0, "clone should not start after 1st array element");
316 if (diff > 0) {
317 adr_src = phase->transform(new AddPNode(base_src, adr_src, phase->MakeConX(diff)));
318 adr_dest = phase->transform(new AddPNode(base_dest, adr_dest, phase->MakeConX(diff)));
319 }
320
321 copy_type = elem;
322 value_type = ary_src->elem();
323 }
324 return true;
325 }
326
327 const TypePtr* ArrayCopyNode::get_address_type(PhaseGVN *phase, Node* n) {
328 const Type* at = phase->type(n);
329 assert(at != Type::TOP, "unexpected type");
330 const TypePtr* atp = at->isa_ptr();
331 // adjust atp to be the correct array element address type
332 atp = atp->add_offset(Type::OffsetBot);
333 return atp;
337 Node* ctl = in(TypeFunc::Control);
338 if (!disjoint_bases && count > 1) {
339 Node* src_offset = in(ArrayCopyNode::SrcPos);
340 Node* dest_offset = in(ArrayCopyNode::DestPos);
341 assert(src_offset != NULL && dest_offset != NULL, "should be");
342 Node* cmp = phase->transform(new CmpINode(src_offset, dest_offset));
343 Node *bol = phase->transform(new BoolNode(cmp, BoolTest::lt));
344 IfNode *iff = new IfNode(ctl, bol, PROB_FAIR, COUNT_UNKNOWN);
345
346 phase->transform(iff);
347
348 forward_ctl = phase->transform(new IfFalseNode(iff));
349 backward_ctl = phase->transform(new IfTrueNode(iff));
350 } else {
351 forward_ctl = ctl;
352 }
353 }
354
355 Node* ArrayCopyNode::array_copy_forward(PhaseGVN *phase,
356 bool can_reshape,
357 Node*& forward_ctl,
358 MergeMemNode* mm,
359 const TypePtr* atp_src,
360 const TypePtr* atp_dest,
361 Node* adr_src,
362 Node* base_src,
363 Node* adr_dest,
364 Node* base_dest,
365 BasicType copy_type,
366 const Type* value_type,
367 int count) {
368 if (!forward_ctl->is_top()) {
369 // copy forward
370 mm = mm->clone()->as_MergeMem();
371 uint alias_idx_src = phase->C->get_alias_index(atp_src);
372 uint alias_idx_dest = phase->C->get_alias_index(atp_dest);
373 Node *start_mem_src = mm->memory_at(alias_idx_src);
374 Node *start_mem_dest = mm->memory_at(alias_idx_dest);
375 Node* mem = start_mem_dest;
376 bool same_alias = (alias_idx_src == alias_idx_dest);
377
378 if (count > 0) {
379 Node* v = LoadNode::make(*phase, forward_ctl, start_mem_src, adr_src, atp_src, value_type, copy_type, MemNode::unordered);
380 v = phase->transform(v);
381 mem = StoreNode::make(*phase, forward_ctl, mem, adr_dest, atp_dest, v, copy_type, MemNode::unordered);
382 mem = phase->transform(mem);
383 for (int i = 1; i < count; i++) {
384 Node* off = phase->MakeConX(type2aelembytes(copy_type) * i);
385 Node* next_src = phase->transform(new AddPNode(base_src,adr_src,off));
386 Node* next_dest = phase->transform(new AddPNode(base_dest,adr_dest,off));
387 v = LoadNode::make(*phase, forward_ctl, same_alias ? mem : start_mem_src, next_src, atp_src, value_type, copy_type, MemNode::unordered);
388 v = phase->transform(v);
389 mem = StoreNode::make(*phase, forward_ctl,mem,next_dest,atp_dest,v, copy_type, MemNode::unordered);
390 mem = phase->transform(mem);
391 }
392 mm->set_memory_at(alias_idx_dest, mem);
393 } else if(can_reshape) {
394 PhaseIterGVN* igvn = phase->is_IterGVN();
395 igvn->_worklist.push(adr_src);
396 igvn->_worklist.push(adr_dest);
397 }
398 return mm;
399 }
400 return phase->C->top();
401 }
402
403 Node* ArrayCopyNode::array_copy_backward(PhaseGVN *phase,
404 bool can_reshape,
405 Node*& backward_ctl,
406 MergeMemNode* mm,
407 const TypePtr* atp_src,
408 const TypePtr* atp_dest,
409 Node* adr_src,
410 Node* base_src,
411 Node* adr_dest,
412 Node* base_dest,
413 BasicType copy_type,
414 const Type* value_type,
415 int count) {
416 if (!backward_ctl->is_top()) {
417 // copy backward
418 mm = mm->clone()->as_MergeMem();
419 uint alias_idx_src = phase->C->get_alias_index(atp_src);
420 uint alias_idx_dest = phase->C->get_alias_index(atp_dest);
421 Node *start_mem_src = mm->memory_at(alias_idx_src);
422 Node *start_mem_dest = mm->memory_at(alias_idx_dest);
423 Node* mem = start_mem_dest;
424
425 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
426 assert(copy_type != T_OBJECT || !bs->array_copy_requires_gc_barriers(false, T_OBJECT, false, BarrierSetC2::Optimization), "only tightly coupled allocations for object arrays");
427 bool same_alias = (alias_idx_src == alias_idx_dest);
428
429 if (count > 0) {
430 for (int i = count-1; i >= 1; i--) {
431 Node* off = phase->MakeConX(type2aelembytes(copy_type) * i);
432 Node* next_src = phase->transform(new AddPNode(base_src,adr_src,off));
433 Node* next_dest = phase->transform(new AddPNode(base_dest,adr_dest,off));
434 Node* v = LoadNode::make(*phase, backward_ctl, same_alias ? mem : start_mem_src, next_src, atp_src, value_type, copy_type, MemNode::unordered);
435 v = phase->transform(v);
436 mem = StoreNode::make(*phase, backward_ctl,mem,next_dest,atp_dest,v, copy_type, MemNode::unordered);
437 mem = phase->transform(mem);
438 }
439 Node* v = LoadNode::make(*phase, backward_ctl, same_alias ? mem : start_mem_src, adr_src, atp_src, value_type, copy_type, MemNode::unordered);
440 v = phase->transform(v);
441 mem = StoreNode::make(*phase, backward_ctl, mem, adr_dest, atp_dest, v, copy_type, MemNode::unordered);
442 mem = phase->transform(mem);
443 mm->set_memory_at(alias_idx_dest, mem);
444 } else if(can_reshape) {
445 PhaseIterGVN* igvn = phase->is_IterGVN();
446 igvn->_worklist.push(adr_src);
447 igvn->_worklist.push(adr_dest);
448 }
449 return phase->transform(mm);
450 }
451 return phase->C->top();
452 }
453
454 bool ArrayCopyNode::finish_transform(PhaseGVN *phase, bool can_reshape,
455 Node* ctl, Node *mem) {
456 if (can_reshape) {
457 PhaseIterGVN* igvn = phase->is_IterGVN();
458 igvn->set_delay_transform(false);
459 if (is_clonebasic()) {
460 Node* out_mem = proj_out(TypeFunc::Memory);
461
462 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
463 if (out_mem->outcnt() != 1 || !out_mem->raw_out(0)->is_MergeMem() ||
464 out_mem->raw_out(0)->outcnt() != 1 || !out_mem->raw_out(0)->raw_out(0)->is_MemBar()) {
465 assert(bs->array_copy_requires_gc_barriers(true, T_OBJECT, true, BarrierSetC2::Optimization), "can only happen with card marking");
466 return false;
467 }
468
469 igvn->replace_node(out_mem->raw_out(0), mem);
470
471 Node* out_ctl = proj_out(TypeFunc::Control);
472 igvn->replace_node(out_ctl, ctl);
473 } else {
474 // replace fallthrough projections of the ArrayCopyNode by the
475 // new memory, control and the input IO.
476 CallProjections callprojs;
477 extract_projections(&callprojs, true, false);
478
479 if (callprojs.fallthrough_ioproj != NULL) {
480 igvn->replace_node(callprojs.fallthrough_ioproj, in(TypeFunc::I_O));
481 }
482 if (callprojs.fallthrough_memproj != NULL) {
483 igvn->replace_node(callprojs.fallthrough_memproj, mem);
484 }
485 if (callprojs.fallthrough_catchproj != NULL) {
486 igvn->replace_node(callprojs.fallthrough_catchproj, ctl);
487 }
488
489 // The ArrayCopyNode is not disconnected. It still has the
490 // projections for the exception case. Replace current
491 // ArrayCopyNode with a dummy new one with a top() control so
492 // that this part of the graph stays consistent but is
493 // eventually removed.
494
495 set_req(0, phase->C->top());
496 remove_dead_region(phase, can_reshape);
497 }
498 } else {
499 if (in(TypeFunc::Control) != ctl) {
500 // we can't return new memory and control from Ideal at parse time
501 assert(!is_clonebasic(), "added control for clone?");
502 phase->record_for_igvn(this);
503 return false;
504 }
505 }
506 return true;
507 }
508
509
510 Node *ArrayCopyNode::Ideal(PhaseGVN *phase, bool can_reshape) {
511 if (remove_dead_region(phase, can_reshape)) return this;
512
513 if (StressArrayCopyMacroNode && !can_reshape) {
514 phase->record_for_igvn(this);
515 return NULL;
516 }
517
518 // See if it's a small array copy and we can inline it as
519 // loads/stores
520 // Here we can only do:
521 // - arraycopy if all arguments were validated before and we don't
522 // need card marking
556 }
557
558 Node* adr_src = NULL;
559 Node* base_src = NULL;
560 Node* adr_dest = NULL;
561 Node* base_dest = NULL;
562 BasicType copy_type = T_ILLEGAL;
563 const Type* value_type = NULL;
564 bool disjoint_bases = false;
565
566 if (!prepare_array_copy(phase, can_reshape,
567 adr_src, base_src, adr_dest, base_dest,
568 copy_type, value_type, disjoint_bases)) {
569 return NULL;
570 }
571
572 Node* src = in(ArrayCopyNode::Src);
573 Node* dest = in(ArrayCopyNode::Dest);
574 const TypePtr* atp_src = get_address_type(phase, src);
575 const TypePtr* atp_dest = get_address_type(phase, dest);
576
577 Node *in_mem = in(TypeFunc::Memory);
578 if (!in_mem->is_MergeMem()) {
579 in_mem = MergeMemNode::make(in_mem);
580 }
581
582
583 if (can_reshape) {
584 assert(!phase->is_IterGVN()->delay_transform(), "cannot delay transforms");
585 phase->is_IterGVN()->set_delay_transform(true);
586 }
587
588 Node* backward_ctl = phase->C->top();
589 Node* forward_ctl = phase->C->top();
590 array_copy_test_overlap(phase, can_reshape, disjoint_bases, count, forward_ctl, backward_ctl);
591
592 Node* forward_mem = array_copy_forward(phase, can_reshape, forward_ctl,
593 in_mem->as_MergeMem(),
594 atp_src, atp_dest,
595 adr_src, base_src, adr_dest, base_dest,
596 copy_type, value_type, count);
597
598 Node* backward_mem = array_copy_backward(phase, can_reshape, backward_ctl,
599 in_mem->as_MergeMem(),
600 atp_src, atp_dest,
601 adr_src, base_src, adr_dest, base_dest,
602 copy_type, value_type, count);
603
604 Node* ctl = NULL;
605 if (!forward_ctl->is_top() && !backward_ctl->is_top()) {
606 ctl = new RegionNode(3);
607 ctl->init_req(1, forward_ctl);
608 ctl->init_req(2, backward_ctl);
609 ctl = phase->transform(ctl);
610 MergeMemNode* forward_mm = forward_mem->as_MergeMem();
611 MergeMemNode* backward_mm = backward_mem->as_MergeMem();
612 for (MergeMemStream mms(forward_mm, backward_mm); mms.next_non_empty2(); ) {
613 if (mms.memory() != mms.memory2()) {
614 Node* phi = new PhiNode(ctl, Type::MEMORY, phase->C->get_adr_type(mms.alias_idx()));
615 phi->init_req(1, mms.memory());
616 phi->init_req(2, mms.memory2());
617 phi = phase->transform(phi);
618 mms.set_memory(phi);
619 }
620 }
621 mem = forward_mem;
622 } else if (!forward_ctl->is_top()) {
623 ctl = forward_ctl;
624 mem = forward_mem;
625 } else {
626 assert(!backward_ctl->is_top(), "no copy?");
627 ctl = backward_ctl;
628 mem = backward_mem;
629 }
630
631 if (can_reshape) {
632 assert(phase->is_IterGVN()->delay_transform(), "should be delaying transforms");
633 phase->is_IterGVN()->set_delay_transform(false);
634 }
635
636 if (!finish_transform(phase, can_reshape, ctl, mem)) {
637 return NULL;
638 }
639
640 return mem;
641 }
642
643 bool ArrayCopyNode::may_modify(const TypeOopPtr *t_oop, PhaseTransform *phase) {
644 Node* dest = in(ArrayCopyNode::Dest);
645 if (dest->is_top()) {
646 return false;
647 }
648 const TypeOopPtr* dest_t = phase->type(dest)->is_oopptr();
649 assert(!dest_t->is_known_instance() || _dest_type->is_known_instance(), "result of EA not recorded");
650 assert(in(ArrayCopyNode::Src)->is_top() || !phase->type(in(ArrayCopyNode::Src))->is_oopptr()->is_known_instance() ||
651 _src_type->is_known_instance(), "result of EA not recorded");
652
653 if (_dest_type != TypeOopPtr::BOTTOM || t_oop->is_known_instance()) {
654 assert(_dest_type == TypeOopPtr::BOTTOM || _dest_type->is_known_instance(), "result of EA is known instance");
|