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 "gc/shared/barrierSet.hpp"
27 #include "gc/shared/tlab_globals.hpp"
28 #include "opto/arraycopynode.hpp"
29 #include "oops/objArrayKlass.hpp"
30 #include "opto/convertnode.hpp"
31 #include "opto/vectornode.hpp"
32 #include "opto/graphKit.hpp"
33 #include "opto/macro.hpp"
34 #include "opto/runtime.hpp"
35 #include "opto/castnode.hpp"
36 #include "runtime/stubRoutines.hpp"
37 #include "utilities/align.hpp"
38 #include "utilities/powerOfTwo.hpp"
39
40 void PhaseMacroExpand::insert_mem_bar(Node** ctrl, Node** mem, int opcode, Node* precedent) {
41 MemBarNode* mb = MemBarNode::make(C, opcode, Compile::AliasIdxBot, precedent);
42 mb->init_req(TypeFunc::Control, *ctrl);
43 mb->init_req(TypeFunc::Memory, *mem);
44 transform_later(mb);
45 *ctrl = new ProjNode(mb,TypeFunc::Control);
122 }
123
124 IfNode* iff = new IfNode(*ctrl, test, true_prob, COUNT_UNKNOWN);
125 transform_later(iff);
126
127 Node* if_slow = new IfTrueNode(iff);
128 transform_later(if_slow);
129
130 if (region != nullptr) {
131 region->add_req(if_slow);
132 }
133
134 Node* if_fast = new IfFalseNode(iff);
135 transform_later(if_fast);
136
137 *ctrl = if_fast;
138
139 return if_slow;
140 }
141
142 inline Node* PhaseMacroExpand::generate_slow_guard(Node** ctrl, Node* test, RegionNode* region) {
143 return generate_guard(ctrl, test, region, PROB_UNLIKELY_MAG(3));
144 }
145
146 void PhaseMacroExpand::generate_negative_guard(Node** ctrl, Node* index, RegionNode* region) {
147 if ((*ctrl)->is_top())
148 return; // already stopped
149 if (_igvn.type(index)->higher_equal(TypeInt::POS)) // [0,maxint]
150 return; // index is already adequately typed
151 Node* cmp_lt = new CmpINode(index, intcon(0));
152 transform_later(cmp_lt);
153 Node* bol_lt = new BoolNode(cmp_lt, BoolTest::lt);
154 transform_later(bol_lt);
155 generate_guard(ctrl, bol_lt, region, PROB_MIN);
156 }
157
158 void PhaseMacroExpand::generate_limit_guard(Node** ctrl, Node* offset, Node* subseq_length, Node* array_length, RegionNode* region) {
159 if ((*ctrl)->is_top())
160 return; // already stopped
161 bool zero_offset = _igvn.type(offset) == TypeInt::ZERO;
162 if (zero_offset && subseq_length->eqv_uncast(array_length))
163 return; // common case of whole-array copy
164 Node* last = subseq_length;
165 if (!zero_offset) { // last += offset
266
267 *ctrl = stub_block;
268 }
269
270
271 Node* PhaseMacroExpand::generate_nonpositive_guard(Node** ctrl, Node* index, bool never_negative) {
272 if ((*ctrl)->is_top()) return nullptr;
273
274 if (_igvn.type(index)->higher_equal(TypeInt::POS1)) // [1,maxint]
275 return nullptr; // index is already adequately typed
276 Node* cmp_le = new CmpINode(index, intcon(0));
277 transform_later(cmp_le);
278 BoolTest::mask le_or_eq = (never_negative ? BoolTest::eq : BoolTest::le);
279 Node* bol_le = new BoolNode(cmp_le, le_or_eq);
280 transform_later(bol_le);
281 Node* is_notp = generate_guard(ctrl, bol_le, nullptr, PROB_MIN);
282
283 return is_notp;
284 }
285
286 void PhaseMacroExpand::finish_arraycopy_call(Node* call, Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type) {
287 transform_later(call);
288
289 *ctrl = new ProjNode(call,TypeFunc::Control);
290 transform_later(*ctrl);
291 Node* newmem = new ProjNode(call, TypeFunc::Memory);
292 transform_later(newmem);
293
294 uint alias_idx = C->get_alias_index(adr_type);
295 if (alias_idx != Compile::AliasIdxBot) {
296 *mem = MergeMemNode::make(*mem);
297 (*mem)->set_memory_at(alias_idx, newmem);
298 } else {
299 *mem = MergeMemNode::make(newmem);
300 }
301 transform_later(*mem);
302 }
303
304 address PhaseMacroExpand::basictype2arraycopy(BasicType t,
305 Node* src_offset,
360 // }
361 // }
362 // // adjust params for remaining work:
363 // if (slowval != -1) {
364 // n = -1^slowval; src_offset += n; dest_offset += n; length -= n
365 // }
366 // slow_region:
367 // call slow arraycopy(src, src_offset, dest, dest_offset, length)
368 // return // via slow_call_path
369 //
370 // This routine is used from several intrinsics: System.arraycopy,
371 // Object.clone (the array subcase), and Arrays.copyOf[Range].
372 //
373 Node* PhaseMacroExpand::generate_arraycopy(ArrayCopyNode *ac, AllocateArrayNode* alloc,
374 Node** ctrl, MergeMemNode* mem, Node** io,
375 const TypePtr* adr_type,
376 BasicType basic_elem_type,
377 Node* src, Node* src_offset,
378 Node* dest, Node* dest_offset,
379 Node* copy_length,
380 bool disjoint_bases,
381 bool length_never_negative,
382 RegionNode* slow_region) {
383 if (slow_region == nullptr) {
384 slow_region = new RegionNode(1);
385 transform_later(slow_region);
386 }
387
388 Node* original_dest = dest;
389 bool dest_needs_zeroing = false;
390 bool acopy_to_uninitialized = false;
391
392 // See if this is the initialization of a newly-allocated array.
393 // If so, we will take responsibility here for initializing it to zero.
394 // (Note: Because tightly_coupled_allocation performs checks on the
395 // out-edges of the dest, we need to avoid making derived pointers
396 // from it until we have checked its uses.)
397 if (ReduceBulkZeroing
398 && !(UseTLAB && ZeroTLAB) // pointless if already zeroed
399 && basic_elem_type != T_CONFLICT // avoid corner case
400 && !src->eqv_uncast(dest)
401 && alloc != nullptr
402 && _igvn.find_int_con(alloc->in(AllocateNode::ALength), 1) > 0) {
403 assert(ac->is_alloc_tightly_coupled(), "sanity");
404 // acopy to uninitialized tightly coupled allocations
405 // needs zeroing outside the copy range
406 // and the acopy itself will be to uninitialized memory
407 acopy_to_uninitialized = true;
408 if (alloc->maybe_set_complete(&_igvn)) {
409 // "You break it, you buy it."
410 InitializeNode* init = alloc->initialization();
411 assert(init->is_complete(), "we just did this");
412 init->set_complete_with_arraycopy();
413 assert(dest->is_CheckCastPP(), "sanity");
414 assert(dest->in(0)->in(0) == init, "dest pinned");
415 adr_type = TypeRawPtr::BOTTOM; // all initializations are into raw memory
416 // From this point on, every exit path is responsible for
417 // initializing any non-copied parts of the object to zero.
418 // Also, if this flag is set we make sure that arraycopy interacts properly
419 // with G1, eliding pre-barriers. See CR 6627983.
420 dest_needs_zeroing = true;
421 } else {
422 // dest_need_zeroing = false;
423 }
424 } else {
425 // No zeroing elimination needed here.
426 alloc = nullptr;
427 acopy_to_uninitialized = false;
428 //original_dest = dest;
429 //dest_needs_zeroing = false;
430 }
431
432 uint alias_idx = C->get_alias_index(adr_type);
433
434 // Results are placed here:
435 enum { fast_path = 1, // normal void-returning assembly stub
436 checked_path = 2, // special assembly stub with cleanup
437 slow_call_path = 3, // something went wrong; call the VM
438 zero_path = 4, // bypass when length of copy is zero
439 bcopy_path = 5, // copy primitive array by 64-bit blocks
440 PATH_LIMIT = 6
470 checked_i_o = *io;
471 checked_mem = mem->memory_at(alias_idx);
472 checked_value = cv;
473 *ctrl = top();
474 }
475
476 Node* not_pos = generate_nonpositive_guard(ctrl, copy_length, length_never_negative);
477 if (not_pos != nullptr) {
478 Node* local_ctrl = not_pos, *local_io = *io;
479 MergeMemNode* local_mem = MergeMemNode::make(mem);
480 transform_later(local_mem);
481
482 // (6) length must not be negative.
483 if (!length_never_negative) {
484 generate_negative_guard(&local_ctrl, copy_length, slow_region);
485 }
486
487 // copy_length is 0.
488 if (dest_needs_zeroing) {
489 assert(!local_ctrl->is_top(), "no ctrl?");
490 Node* dest_length = alloc->in(AllocateNode::ALength);
491 if (copy_length->eqv_uncast(dest_length)
492 || _igvn.find_int_con(dest_length, 1) <= 0) {
493 // There is no zeroing to do. No need for a secondary raw memory barrier.
494 } else {
495 // Clear the whole thing since there are no source elements to copy.
496 generate_clear_array(local_ctrl, local_mem,
497 adr_type, dest, basic_elem_type,
498 intcon(0), nullptr,
499 alloc->in(AllocateNode::AllocSize));
500 // Use a secondary InitializeNode as raw memory barrier.
501 // Currently it is needed only on this path since other
502 // paths have stub or runtime calls as raw memory barriers.
503 MemBarNode* mb = MemBarNode::make(C, Op_Initialize,
504 Compile::AliasIdxRaw,
505 top());
506 transform_later(mb);
507 mb->set_req(TypeFunc::Control,local_ctrl);
508 mb->set_req(TypeFunc::Memory, local_mem->memory_at(Compile::AliasIdxRaw));
509 local_ctrl = transform_later(new ProjNode(mb, TypeFunc::Control));
510 local_mem->set_memory_at(Compile::AliasIdxRaw, transform_later(new ProjNode(mb, TypeFunc::Memory)));
511
512 InitializeNode* init = mb->as_Initialize();
513 init->set_complete(&_igvn); // (there is no corresponding AllocateNode)
514 }
515 }
516
517 // Present the results of the fast call.
518 result_region->init_req(zero_path, local_ctrl);
519 result_i_o ->init_req(zero_path, local_io);
520 result_memory->init_req(zero_path, local_mem->memory_at(alias_idx));
521 }
522
523 if (!(*ctrl)->is_top() && dest_needs_zeroing) {
524 // We have to initialize the *uncopied* part of the array to zero.
525 // The copy destination is the slice dest[off..off+len]. The other slices
526 // are dest_head = dest[0..off] and dest_tail = dest[off+len..dest.length].
527 Node* dest_size = alloc->in(AllocateNode::AllocSize);
528 Node* dest_length = alloc->in(AllocateNode::ALength);
529 Node* dest_tail = transform_later( new AddINode(dest_offset, copy_length));
530
531 // If there is a head section that needs zeroing, do it now.
532 if (_igvn.find_int_con(dest_offset, -1) != 0) {
533 generate_clear_array(*ctrl, mem,
534 adr_type, dest, basic_elem_type,
535 intcon(0), dest_offset,
536 nullptr);
537 }
538
539 // Next, perform a dynamic check on the tail length.
540 // It is often zero, and we can win big if we prove this.
541 // There are two wins: Avoid generating the ClearArray
542 // with its attendant messy index arithmetic, and upgrade
543 // the copy to a more hardware-friendly word size of 64 bits.
544 Node* tail_ctl = nullptr;
545 if (!(*ctrl)->is_top() && !dest_tail->eqv_uncast(dest_length)) {
546 Node* cmp_lt = transform_later( new CmpINode(dest_tail, dest_length) );
547 Node* bol_lt = transform_later( new BoolNode(cmp_lt, BoolTest::lt) );
548 tail_ctl = generate_slow_guard(ctrl, bol_lt, nullptr);
549 assert(tail_ctl != nullptr || !(*ctrl)->is_top(), "must be an outcome");
550 }
551
552 // At this point, let's assume there is no tail.
553 if (!(*ctrl)->is_top() && alloc != nullptr && basic_elem_type != T_OBJECT) {
554 // There is no tail. Try an upgrade to a 64-bit copy.
563 src, src_offset, dest, dest_offset,
564 dest_size, acopy_to_uninitialized);
565 if (didit) {
566 // Present the results of the block-copying fast call.
567 result_region->init_req(bcopy_path, local_ctrl);
568 result_i_o ->init_req(bcopy_path, local_io);
569 result_memory->init_req(bcopy_path, local_mem->memory_at(alias_idx));
570 }
571 }
572 if (didit) {
573 *ctrl = top(); // no regular fast path
574 }
575 }
576
577 // Clear the tail, if any.
578 if (tail_ctl != nullptr) {
579 Node* notail_ctl = (*ctrl)->is_top() ? nullptr : *ctrl;
580 *ctrl = tail_ctl;
581 if (notail_ctl == nullptr) {
582 generate_clear_array(*ctrl, mem,
583 adr_type, dest, basic_elem_type,
584 dest_tail, nullptr,
585 dest_size);
586 } else {
587 // Make a local merge.
588 Node* done_ctl = transform_later(new RegionNode(3));
589 Node* done_mem = transform_later(new PhiNode(done_ctl, Type::MEMORY, adr_type));
590 done_ctl->init_req(1, notail_ctl);
591 done_mem->init_req(1, mem->memory_at(alias_idx));
592 generate_clear_array(*ctrl, mem,
593 adr_type, dest, basic_elem_type,
594 dest_tail, nullptr,
595 dest_size);
596 done_ctl->init_req(2, *ctrl);
597 done_mem->init_req(2, mem->memory_at(alias_idx));
598 *ctrl = done_ctl;
599 mem->set_memory_at(alias_idx, done_mem);
600 }
601 }
602 }
603
604 BasicType copy_type = basic_elem_type;
605 assert(basic_elem_type != T_ARRAY, "caller must fix this");
606 if (!(*ctrl)->is_top() && copy_type == T_OBJECT) {
607 // If src and dest have compatible element types, we can copy bits.
608 // Types S[] and D[] are compatible if D is a supertype of S.
609 //
610 // If they are not, we will use checked_oop_disjoint_arraycopy,
611 // which performs a fast optimistic per-oop check, and backs off
612 // further to JVM_ArrayCopy on the first per-oop check that fails.
613 // (Actually, we don't move raw bits only; the GC requires card marks.)
751 Node* length_minus = new SubINode(copy_length, slow_offset);
752 transform_later(length_minus);
753
754 // Tweak the node variables to adjust the code produced below:
755 src_offset = src_off_plus;
756 dest_offset = dest_off_plus;
757 copy_length = length_minus;
758 }
759 }
760 *ctrl = slow_control;
761 if (!(*ctrl)->is_top()) {
762 Node* local_ctrl = *ctrl, *local_io = slow_i_o;
763 MergeMemNode* local_mem = MergeMemNode::make(mem);
764 transform_later(local_mem);
765
766 // Generate the slow path, if needed.
767 local_mem->set_memory_at(alias_idx, slow_mem);
768
769 if (dest_needs_zeroing) {
770 generate_clear_array(local_ctrl, local_mem,
771 adr_type, dest, basic_elem_type,
772 intcon(0), nullptr,
773 alloc->in(AllocateNode::AllocSize));
774 }
775
776 local_mem = generate_slow_arraycopy(ac,
777 &local_ctrl, local_mem, &local_io,
778 adr_type,
779 src, src_offset, dest, dest_offset,
780 copy_length, /*dest_uninitialized*/false);
781
782 result_region->init_req(slow_call_path, local_ctrl);
783 result_i_o ->init_req(slow_call_path, local_io);
784 result_memory->init_req(slow_call_path, local_mem->memory_at(alias_idx));
785 } else {
786 ShouldNotReachHere(); // no call to generate_slow_arraycopy:
787 // projections were not extracted
788 }
789
790 // Remove unused edges.
791 for (uint i = 1; i < result_region->req(); i++) {
813 // The next memory barrier is added to avoid it. If the arraycopy can be
814 // optimized away (which it can, sometimes) then we can manually remove
815 // the membar also.
816 //
817 // Do not let reads from the cloned object float above the arraycopy.
818 if (alloc != nullptr && !alloc->initialization()->does_not_escape()) {
819 // Do not let stores that initialize this object be reordered with
820 // a subsequent store that would make this object accessible by
821 // other threads.
822 insert_mem_bar(ctrl, &out_mem, Op_MemBarStoreStore);
823 } else {
824 insert_mem_bar(ctrl, &out_mem, Op_MemBarCPUOrder);
825 }
826
827 if (is_partial_array_copy) {
828 assert((*ctrl)->is_Proj(), "MemBar control projection");
829 assert((*ctrl)->in(0)->isa_MemBar(), "MemBar node");
830 (*ctrl)->in(0)->isa_MemBar()->set_trailing_partial_array_copy();
831 }
832
833 _igvn.replace_node(_callprojs.fallthrough_memproj, out_mem);
834 if (_callprojs.fallthrough_ioproj != nullptr) {
835 _igvn.replace_node(_callprojs.fallthrough_ioproj, *io);
836 }
837 _igvn.replace_node(_callprojs.fallthrough_catchproj, *ctrl);
838
839 #ifdef ASSERT
840 const TypeOopPtr* dest_t = _igvn.type(dest)->is_oopptr();
841 if (dest_t->is_known_instance() && !is_partial_array_copy) {
842 ArrayCopyNode* ac = nullptr;
843 assert(ArrayCopyNode::may_modify(dest_t, (*ctrl)->in(0)->as_MemBar(), &_igvn, ac), "dependency on arraycopy lost");
844 assert(ac == nullptr, "no arraycopy anymore");
845 }
846 #endif
847
848 return out_mem;
849 }
850
851 // Helper for initialization of arrays, creating a ClearArray.
852 // It writes zero bits in [start..end), within the body of an array object.
853 // The memory effects are all chained onto the 'adr_type' alias category.
854 //
855 // Since the object is otherwise uninitialized, we are free
856 // to put a little "slop" around the edges of the cleared area,
857 // as long as it does not go back into the array's header,
858 // or beyond the array end within the heap.
859 //
860 // The lower edge can be rounded down to the nearest jint and the
861 // upper edge can be rounded up to the nearest MinObjAlignmentInBytes.
862 //
863 // Arguments:
864 // adr_type memory slice where writes are generated
865 // dest oop of the destination array
866 // basic_elem_type element type of the destination
867 // slice_idx array index of first element to store
868 // slice_len number of elements to store (or null)
869 // dest_size total size in bytes of the array object
870 //
871 // Exactly one of slice_len or dest_size must be non-null.
872 // If dest_size is non-null, zeroing extends to the end of the object.
873 // If slice_len is non-null, the slice_idx value must be a constant.
874 void PhaseMacroExpand::generate_clear_array(Node* ctrl, MergeMemNode* merge_mem,
875 const TypePtr* adr_type,
876 Node* dest,
877 BasicType basic_elem_type,
878 Node* slice_idx,
879 Node* slice_len,
880 Node* dest_size) {
881 // one or the other but not both of slice_len and dest_size:
882 assert((slice_len != nullptr? 1: 0) + (dest_size != nullptr? 1: 0) == 1, "");
883 if (slice_len == nullptr) slice_len = top();
884 if (dest_size == nullptr) dest_size = top();
885
886 uint alias_idx = C->get_alias_index(adr_type);
887
888 // operate on this memory slice:
889 Node* mem = merge_mem->memory_at(alias_idx); // memory slice to operate on
890
891 // scaling and rounding of indexes:
892 int scale = exact_log2(type2aelembytes(basic_elem_type));
893 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
894 int clear_low = (-1 << scale) & (BytesPerInt - 1);
895 int bump_bit = (-1 << scale) & BytesPerInt;
896
897 // determine constant starts and ends
898 const intptr_t BIG_NEG = -128;
899 assert(BIG_NEG + 2*abase < 0, "neg enough");
900 intptr_t slice_idx_con = (intptr_t) _igvn.find_int_con(slice_idx, BIG_NEG);
901 intptr_t slice_len_con = (intptr_t) _igvn.find_int_con(slice_len, BIG_NEG);
902 if (slice_len_con == 0) {
903 return; // nothing to do here
904 }
905 intptr_t start_con = (abase + (slice_idx_con << scale)) & ~clear_low;
906 intptr_t end_con = _igvn.find_intptr_t_con(dest_size, -1);
907 if (slice_idx_con >= 0 && slice_len_con >= 0) {
908 assert(end_con < 0, "not two cons");
909 end_con = align_up(abase + ((slice_idx_con + slice_len_con) << scale),
910 BytesPerLong);
911 }
912
913 if (start_con >= 0 && end_con >= 0) {
914 // Constant start and end. Simple.
915 mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
916 start_con, end_con, &_igvn);
917 } else if (start_con >= 0 && dest_size != top()) {
918 // Constant start, pre-rounded end after the tail of the array.
919 Node* end = dest_size;
920 mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
921 start_con, end, &_igvn);
922 } else if (start_con >= 0 && slice_len != top()) {
923 // Constant start, non-constant end. End needs rounding up.
924 // End offset = round_up(abase + ((slice_idx_con + slice_len) << scale), 8)
925 intptr_t end_base = abase + (slice_idx_con << scale);
926 int end_round = (-1 << scale) & (BytesPerLong - 1);
927 Node* end = ConvI2X(slice_len);
928 if (scale != 0)
929 end = transform_later(new LShiftXNode(end, intcon(scale) ));
930 end_base += end_round;
931 end = transform_later(new AddXNode(end, MakeConX(end_base)) );
932 end = transform_later(new AndXNode(end, MakeConX(~end_round)) );
933 mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
934 start_con, end, &_igvn);
935 } else if (start_con < 0 && dest_size != top()) {
936 // Non-constant start, pre-rounded end after the tail of the array.
937 // This is almost certainly a "round-to-end" operation.
938 Node* start = slice_idx;
939 start = ConvI2X(start);
940 if (scale != 0)
941 start = transform_later(new LShiftXNode( start, intcon(scale) ));
942 start = transform_later(new AddXNode(start, MakeConX(abase)) );
943 if ((bump_bit | clear_low) != 0) {
944 int to_clear = (bump_bit | clear_low);
945 // Align up mod 8, then store a jint zero unconditionally
946 // just before the mod-8 boundary.
947 if (((abase + bump_bit) & ~to_clear) - bump_bit
948 < arrayOopDesc::length_offset_in_bytes() + BytesPerInt) {
949 bump_bit = 0;
950 assert((abase & to_clear) == 0, "array base must be long-aligned");
951 } else {
952 // Bump 'start' up to (or past) the next jint boundary:
953 start = transform_later( new AddXNode(start, MakeConX(bump_bit)) );
954 assert((abase & clear_low) == 0, "array base must be int-aligned");
955 }
956 // Round bumped 'start' down to jlong boundary in body of array.
957 start = transform_later(new AndXNode(start, MakeConX(~to_clear)) );
958 if (bump_bit != 0) {
959 // Store a zero to the immediately preceding jint:
960 Node* x1 = transform_later(new AddXNode(start, MakeConX(-bump_bit)) );
961 Node* p1 = basic_plus_adr(dest, x1);
962 mem = StoreNode::make(_igvn, ctrl, mem, p1, adr_type, intcon(0), T_INT, MemNode::unordered);
963 mem = transform_later(mem);
964 }
965 }
966 Node* end = dest_size; // pre-rounded
967 mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
968 start, end, &_igvn);
969 } else {
970 // Non-constant start, unrounded non-constant end.
971 // (Nobody zeroes a random midsection of an array using this routine.)
972 ShouldNotReachHere(); // fix caller
973 }
974
975 // Done.
976 merge_mem->set_memory_at(alias_idx, mem);
977 }
978
979 bool PhaseMacroExpand::generate_block_arraycopy(Node** ctrl, MergeMemNode** mem, Node* io,
980 const TypePtr* adr_type,
981 BasicType basic_elem_type,
982 AllocateNode* alloc,
983 Node* src, Node* src_offset,
984 Node* dest, Node* dest_offset,
985 Node* dest_size, bool dest_uninitialized) {
986 // See if there is an advantage from block transfer.
987 int scale = exact_log2(type2aelembytes(basic_elem_type));
1063 const TypeFunc* call_type = OptoRuntime::slow_arraycopy_Type();
1064 CallNode* call = new CallStaticJavaNode(call_type, OptoRuntime::slow_arraycopy_Java(),
1065 "slow_arraycopy", TypePtr::BOTTOM);
1066
1067 call->init_req(TypeFunc::Control, *ctrl);
1068 call->init_req(TypeFunc::I_O , *io);
1069 call->init_req(TypeFunc::Memory , mem);
1070 call->init_req(TypeFunc::ReturnAdr, top());
1071 call->init_req(TypeFunc::FramePtr, top());
1072 call->init_req(TypeFunc::Parms+0, src);
1073 call->init_req(TypeFunc::Parms+1, src_offset);
1074 call->init_req(TypeFunc::Parms+2, dest);
1075 call->init_req(TypeFunc::Parms+3, dest_offset);
1076 call->init_req(TypeFunc::Parms+4, copy_length);
1077 call->copy_call_debug_info(&_igvn, ac);
1078
1079 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
1080 _igvn.replace_node(ac, call);
1081 transform_later(call);
1082
1083 call->extract_projections(&_callprojs, false /*separate_io_proj*/, false /*do_asserts*/);
1084 *ctrl = _callprojs.fallthrough_catchproj->clone();
1085 transform_later(*ctrl);
1086
1087 Node* m = _callprojs.fallthrough_memproj->clone();
1088 transform_later(m);
1089
1090 uint alias_idx = C->get_alias_index(adr_type);
1091 MergeMemNode* out_mem;
1092 if (alias_idx != Compile::AliasIdxBot) {
1093 out_mem = MergeMemNode::make(mem);
1094 out_mem->set_memory_at(alias_idx, m);
1095 } else {
1096 out_mem = MergeMemNode::make(m);
1097 }
1098 transform_later(out_mem);
1099
1100 // When src is negative and arraycopy is before an infinite loop,_callprojs.fallthrough_ioproj
1101 // could be null. Skip clone and update null fallthrough_ioproj.
1102 if (_callprojs.fallthrough_ioproj != nullptr) {
1103 *io = _callprojs.fallthrough_ioproj->clone();
1104 transform_later(*io);
1105 } else {
1106 *io = nullptr;
1107 }
1108
1109 return out_mem;
1110 }
1111
1112 // Helper function; generates code for cases requiring runtime checks.
1113 Node* PhaseMacroExpand::generate_checkcast_arraycopy(Node** ctrl, MergeMemNode** mem,
1114 const TypePtr* adr_type,
1115 Node* dest_elem_klass,
1116 Node* src, Node* src_offset,
1117 Node* dest, Node* dest_offset,
1118 Node* copy_length, bool dest_uninitialized) {
1119 if ((*ctrl)->is_top()) return nullptr;
1120
1121 address copyfunc_addr = StubRoutines::checkcast_arraycopy(dest_uninitialized);
1122 if (copyfunc_addr == nullptr) { // Stub was not generated, go slow path.
1123 return nullptr;
1215 if (exit_block) {
1216 exit_block->init_req(2, *ctrl);
1217
1218 // Memory edge corresponding to stub_region.
1219 result_memory->init_req(2, *mem);
1220
1221 uint alias_idx = C->get_alias_index(adr_type);
1222 if (alias_idx != Compile::AliasIdxBot) {
1223 *mem = MergeMemNode::make(*mem);
1224 (*mem)->set_memory_at(alias_idx, result_memory);
1225 } else {
1226 *mem = MergeMemNode::make(result_memory);
1227 }
1228 transform_later(*mem);
1229 *ctrl = exit_block;
1230 return true;
1231 }
1232 return false;
1233 }
1234
1235 #undef XTOP
1236
1237 void PhaseMacroExpand::expand_arraycopy_node(ArrayCopyNode *ac) {
1238 Node* ctrl = ac->in(TypeFunc::Control);
1239 Node* io = ac->in(TypeFunc::I_O);
1240 Node* src = ac->in(ArrayCopyNode::Src);
1241 Node* src_offset = ac->in(ArrayCopyNode::SrcPos);
1242 Node* dest = ac->in(ArrayCopyNode::Dest);
1243 Node* dest_offset = ac->in(ArrayCopyNode::DestPos);
1244 Node* length = ac->in(ArrayCopyNode::Length);
1245 MergeMemNode* merge_mem = nullptr;
1246
1247 if (ac->is_clonebasic()) {
1248 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
1249 bs->clone_at_expansion(this, ac);
1250 return;
1251 } else if (ac->is_copyof() || ac->is_copyofrange() || ac->is_clone_oop_array()) {
1252 Node* mem = ac->in(TypeFunc::Memory);
1253 merge_mem = MergeMemNode::make(mem);
1254 transform_later(merge_mem);
1255
1256 AllocateArrayNode* alloc = nullptr;
1257 if (ac->is_alloc_tightly_coupled()) {
1258 alloc = AllocateArrayNode::Ideal_array_allocation(dest);
1259 assert(alloc != nullptr, "expect alloc");
1260 }
1261
1262 const TypePtr* adr_type = _igvn.type(dest)->is_oopptr()->add_offset(Type::OffsetBot);
1263 if (ac->_dest_type != TypeOopPtr::BOTTOM) {
1264 adr_type = ac->_dest_type->add_offset(Type::OffsetBot)->is_ptr();
1265 }
1266 generate_arraycopy(ac, alloc, &ctrl, merge_mem, &io,
1267 adr_type, T_OBJECT,
1268 src, src_offset, dest, dest_offset, length,
1269 true, !ac->is_copyofrange());
1270
1271 return;
1272 }
1273
1274 AllocateArrayNode* alloc = nullptr;
1275 if (ac->is_alloc_tightly_coupled()) {
1276 alloc = AllocateArrayNode::Ideal_array_allocation(dest);
1277 assert(alloc != nullptr, "expect alloc");
1278 }
1279
1280 assert(ac->is_arraycopy() || ac->is_arraycopy_validated(), "should be an arraycopy");
1281
1282 // Compile time checks. If any of these checks cannot be verified at compile time,
1283 // we do not make a fast path for this call. Instead, we let the call remain as it
1284 // is. The checks we choose to mandate at compile time are:
1285 //
1286 // (1) src and dest are arrays.
1287 const Type* src_type = src->Value(&_igvn);
1288 const Type* dest_type = dest->Value(&_igvn);
1289 const TypeAryPtr* top_src = src_type->isa_aryptr();
1290 const TypeAryPtr* top_dest = dest_type->isa_aryptr();
1291
1292 BasicType src_elem = T_CONFLICT;
1293 BasicType dest_elem = T_CONFLICT;
1294
1295 if (top_src != nullptr && top_src->elem() != Type::BOTTOM) {
1296 src_elem = top_src->elem()->array_element_basic_type();
1297 }
1298 if (top_dest != nullptr && top_dest->elem() != Type::BOTTOM) {
1299 dest_elem = top_dest->elem()->array_element_basic_type();
1300 }
1301 if (is_reference_type(src_elem, true)) src_elem = T_OBJECT;
1302 if (is_reference_type(dest_elem, true)) dest_elem = T_OBJECT;
1303
1304 if (ac->is_arraycopy_validated() &&
1305 dest_elem != T_CONFLICT &&
1306 src_elem == T_CONFLICT) {
1307 src_elem = dest_elem;
1308 }
1309
1310 if (src_elem == T_CONFLICT || dest_elem == T_CONFLICT) {
1311 // Conservatively insert a memory barrier on all memory slices.
1312 // Do not let writes into the source float below the arraycopy.
1313 {
1314 Node* mem = ac->in(TypeFunc::Memory);
1315 insert_mem_bar(&ctrl, &mem, Op_MemBarCPUOrder);
1316
1317 merge_mem = MergeMemNode::make(mem);
1318 transform_later(merge_mem);
1319 }
1320
1321 // Call StubRoutines::generic_arraycopy stub.
1322 Node* mem = generate_arraycopy(ac, nullptr, &ctrl, merge_mem, &io,
1323 TypeRawPtr::BOTTOM, T_CONFLICT,
1324 src, src_offset, dest, dest_offset, length,
1325 // If a negative length guard was generated for the ArrayCopyNode,
1326 // the length of the array can never be negative.
1327 false, ac->has_negative_length_guard());
1328 return;
1329 }
1330
1331 assert(!ac->is_arraycopy_validated() || (src_elem == dest_elem && dest_elem != T_VOID), "validated but different basic types");
1332
1333 // (2) src and dest arrays must have elements of the same BasicType
1334 // Figure out the size and type of the elements we will be copying.
1335 if (src_elem != dest_elem || dest_elem == T_VOID) {
1336 // The component types are not the same or are not recognized. Punt.
1337 // (But, avoid the native method wrapper to JVM_ArrayCopy.)
1338 {
1339 Node* mem = ac->in(TypeFunc::Memory);
1340 merge_mem = generate_slow_arraycopy(ac, &ctrl, mem, &io, TypePtr::BOTTOM, src, src_offset, dest, dest_offset, length, false);
1341 }
1342
1343 _igvn.replace_node(_callprojs.fallthrough_memproj, merge_mem);
1344 if (_callprojs.fallthrough_ioproj != nullptr) {
1345 _igvn.replace_node(_callprojs.fallthrough_ioproj, io);
1346 }
1347 _igvn.replace_node(_callprojs.fallthrough_catchproj, ctrl);
1348 return;
1349 }
1350
1351 //---------------------------------------------------------------------------
1352 // We will make a fast path for this call to arraycopy.
1353
1354 // We have the following tests left to perform:
1355 //
1356 // (3) src and dest must not be null.
1357 // (4) src_offset must not be negative.
1358 // (5) dest_offset must not be negative.
1359 // (6) length must not be negative.
1360 // (7) src_offset + length must not exceed length of src.
1361 // (8) dest_offset + length must not exceed length of dest.
1362 // (9) each element of an oop array must be assignable
1363
1364 {
1365 Node* mem = ac->in(TypeFunc::Memory);
1366 merge_mem = MergeMemNode::make(mem);
1367 transform_later(merge_mem);
1368 }
1369
1370 RegionNode* slow_region = new RegionNode(1);
1371 transform_later(slow_region);
1372
1373 if (!ac->is_arraycopy_validated()) {
1374 // (3) operands must not be null
1375 // We currently perform our null checks with the null_check routine.
1376 // This means that the null exceptions will be reported in the caller
1377 // rather than (correctly) reported inside of the native arraycopy call.
1378 // This should be corrected, given time. We do our null check with the
1379 // stack pointer restored.
1380 // null checks done library_call.cpp
1381
1382 // (4) src_offset must not be negative.
1383 generate_negative_guard(&ctrl, src_offset, slow_region);
1384
1385 // (5) dest_offset must not be negative.
1386 generate_negative_guard(&ctrl, dest_offset, slow_region);
1387
1388 // (6) length must not be negative (moved to generate_arraycopy()).
1389 // generate_negative_guard(length, slow_region);
1390
1391 // (7) src_offset + length must not exceed length of src.
1392 Node* alen = ac->in(ArrayCopyNode::SrcLen);
1393 assert(alen != nullptr, "need src len");
1394 generate_limit_guard(&ctrl,
1395 src_offset, length,
1396 alen,
1397 slow_region);
1398
1399 // (8) dest_offset + length must not exceed length of dest.
1400 alen = ac->in(ArrayCopyNode::DestLen);
1401 assert(alen != nullptr, "need dest len");
1402 generate_limit_guard(&ctrl,
1403 dest_offset, length,
1404 alen,
1405 slow_region);
1406
1407 // (9) each element of an oop array must be assignable
1408 // The generate_arraycopy subroutine checks this.
1409 }
1410 // This is where the memory effects are placed:
1411 const TypePtr* adr_type = nullptr;
1412 if (ac->_dest_type != TypeOopPtr::BOTTOM) {
1413 adr_type = ac->_dest_type->add_offset(Type::OffsetBot)->is_ptr();
1414 } else {
1415 adr_type = TypeAryPtr::get_array_body_type(dest_elem);
1416 }
1417
1418 generate_arraycopy(ac, alloc, &ctrl, merge_mem, &io,
1419 adr_type, dest_elem,
1420 src, src_offset, dest, dest_offset, length,
1421 // If a negative length guard was generated for the ArrayCopyNode,
1422 // the length of the array can never be negative.
1423 false, ac->has_negative_length_guard(), slow_region);
1424 }
|
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 "ci/ciFlatArrayKlass.hpp"
27 #include "gc/shared/barrierSet.hpp"
28 #include "gc/shared/tlab_globals.hpp"
29 #include "opto/arraycopynode.hpp"
30 #include "oops/objArrayKlass.hpp"
31 #include "opto/convertnode.hpp"
32 #include "opto/vectornode.hpp"
33 #include "opto/graphKit.hpp"
34 #include "opto/macro.hpp"
35 #include "opto/runtime.hpp"
36 #include "opto/castnode.hpp"
37 #include "runtime/stubRoutines.hpp"
38 #include "utilities/align.hpp"
39 #include "utilities/powerOfTwo.hpp"
40
41 void PhaseMacroExpand::insert_mem_bar(Node** ctrl, Node** mem, int opcode, Node* precedent) {
42 MemBarNode* mb = MemBarNode::make(C, opcode, Compile::AliasIdxBot, precedent);
43 mb->init_req(TypeFunc::Control, *ctrl);
44 mb->init_req(TypeFunc::Memory, *mem);
45 transform_later(mb);
46 *ctrl = new ProjNode(mb,TypeFunc::Control);
123 }
124
125 IfNode* iff = new IfNode(*ctrl, test, true_prob, COUNT_UNKNOWN);
126 transform_later(iff);
127
128 Node* if_slow = new IfTrueNode(iff);
129 transform_later(if_slow);
130
131 if (region != nullptr) {
132 region->add_req(if_slow);
133 }
134
135 Node* if_fast = new IfFalseNode(iff);
136 transform_later(if_fast);
137
138 *ctrl = if_fast;
139
140 return if_slow;
141 }
142
143 Node* PhaseMacroExpand::generate_slow_guard(Node** ctrl, Node* test, RegionNode* region) {
144 return generate_guard(ctrl, test, region, PROB_UNLIKELY_MAG(3));
145 }
146
147 inline Node* PhaseMacroExpand::generate_fair_guard(Node** ctrl, Node* test, RegionNode* region) {
148 return generate_guard(ctrl, test, region, PROB_FAIR);
149 }
150
151 void PhaseMacroExpand::generate_negative_guard(Node** ctrl, Node* index, RegionNode* region) {
152 if ((*ctrl)->is_top())
153 return; // already stopped
154 if (_igvn.type(index)->higher_equal(TypeInt::POS)) // [0,maxint]
155 return; // index is already adequately typed
156 Node* cmp_lt = new CmpINode(index, intcon(0));
157 transform_later(cmp_lt);
158 Node* bol_lt = new BoolNode(cmp_lt, BoolTest::lt);
159 transform_later(bol_lt);
160 generate_guard(ctrl, bol_lt, region, PROB_MIN);
161 }
162
163 void PhaseMacroExpand::generate_limit_guard(Node** ctrl, Node* offset, Node* subseq_length, Node* array_length, RegionNode* region) {
164 if ((*ctrl)->is_top())
165 return; // already stopped
166 bool zero_offset = _igvn.type(offset) == TypeInt::ZERO;
167 if (zero_offset && subseq_length->eqv_uncast(array_length))
168 return; // common case of whole-array copy
169 Node* last = subseq_length;
170 if (!zero_offset) { // last += offset
271
272 *ctrl = stub_block;
273 }
274
275
276 Node* PhaseMacroExpand::generate_nonpositive_guard(Node** ctrl, Node* index, bool never_negative) {
277 if ((*ctrl)->is_top()) return nullptr;
278
279 if (_igvn.type(index)->higher_equal(TypeInt::POS1)) // [1,maxint]
280 return nullptr; // index is already adequately typed
281 Node* cmp_le = new CmpINode(index, intcon(0));
282 transform_later(cmp_le);
283 BoolTest::mask le_or_eq = (never_negative ? BoolTest::eq : BoolTest::le);
284 Node* bol_le = new BoolNode(cmp_le, le_or_eq);
285 transform_later(bol_le);
286 Node* is_notp = generate_guard(ctrl, bol_le, nullptr, PROB_MIN);
287
288 return is_notp;
289 }
290
291 Node* PhaseMacroExpand::mark_word_test(Node** ctrl, Node* obj, MergeMemNode* mem, uintptr_t mask_val, RegionNode* region) {
292 // Load markword and check if obj is locked
293 Node* mark = make_load(nullptr, mem->memory_at(Compile::AliasIdxRaw), obj, oopDesc::mark_offset_in_bytes(), TypeX_X, TypeX_X->basic_type());
294 Node* locked_bit = MakeConX(markWord::unlocked_value);
295 locked_bit = transform_later(new AndXNode(locked_bit, mark));
296 Node* cmp = transform_later(new CmpXNode(locked_bit, MakeConX(0)));
297 Node* is_unlocked = transform_later(new BoolNode(cmp, BoolTest::ne));
298 IfNode* iff = transform_later(new IfNode(*ctrl, is_unlocked, PROB_MAX, COUNT_UNKNOWN))->as_If();
299 Node* locked_region = transform_later(new RegionNode(3));
300 Node* mark_phi = transform_later(new PhiNode(locked_region, TypeX_X));
301
302 // Unlocked: Use bits from mark word
303 locked_region->init_req(1, transform_later(new IfTrueNode(iff)));
304 mark_phi->init_req(1, mark);
305
306 // Locked: Load prototype header from klass
307 *ctrl = transform_later(new IfFalseNode(iff));
308 // Make loads control dependent to make sure they are only executed if array is locked
309 Node* klass_adr = basic_plus_adr(obj, oopDesc::klass_offset_in_bytes());
310 Node* klass = transform_later(LoadKlassNode::make(_igvn, *ctrl, C->immutable_memory(), klass_adr, TypeInstPtr::KLASS, TypeInstKlassPtr::OBJECT));
311 Node* proto_adr = basic_plus_adr(klass, in_bytes(Klass::prototype_header_offset()));
312 Node* proto = transform_later(LoadNode::make(_igvn, *ctrl, C->immutable_memory(), proto_adr, proto_adr->bottom_type()->is_ptr(), TypeX_X, TypeX_X->basic_type(), MemNode::unordered));
313
314 locked_region->init_req(2, *ctrl);
315 mark_phi->init_req(2, proto);
316 *ctrl = locked_region;
317
318 // Now check if mark word bits are set
319 Node* mask = MakeConX(mask_val);
320 Node* masked = transform_later(new AndXNode(mark_phi, mask));
321 cmp = transform_later(new CmpXNode(masked, mask));
322 Node* bol = transform_later(new BoolNode(cmp, BoolTest::eq));
323 return generate_fair_guard(ctrl, bol, region);
324 }
325
326 Node* PhaseMacroExpand::generate_flat_array_guard(Node** ctrl, Node* array, MergeMemNode* mem, RegionNode* region) {
327 return mark_word_test(ctrl, array, mem, markWord::flat_array_bit_in_place, region);
328 }
329
330 Node* PhaseMacroExpand::generate_null_free_array_guard(Node** ctrl, Node* array, MergeMemNode* mem, RegionNode* region) {
331 return mark_word_test(ctrl, array, mem, markWord::null_free_array_bit_in_place, region);
332 }
333
334 void PhaseMacroExpand::finish_arraycopy_call(Node* call, Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type) {
335 transform_later(call);
336
337 *ctrl = new ProjNode(call,TypeFunc::Control);
338 transform_later(*ctrl);
339 Node* newmem = new ProjNode(call, TypeFunc::Memory);
340 transform_later(newmem);
341
342 uint alias_idx = C->get_alias_index(adr_type);
343 if (alias_idx != Compile::AliasIdxBot) {
344 *mem = MergeMemNode::make(*mem);
345 (*mem)->set_memory_at(alias_idx, newmem);
346 } else {
347 *mem = MergeMemNode::make(newmem);
348 }
349 transform_later(*mem);
350 }
351
352 address PhaseMacroExpand::basictype2arraycopy(BasicType t,
353 Node* src_offset,
408 // }
409 // }
410 // // adjust params for remaining work:
411 // if (slowval != -1) {
412 // n = -1^slowval; src_offset += n; dest_offset += n; length -= n
413 // }
414 // slow_region:
415 // call slow arraycopy(src, src_offset, dest, dest_offset, length)
416 // return // via slow_call_path
417 //
418 // This routine is used from several intrinsics: System.arraycopy,
419 // Object.clone (the array subcase), and Arrays.copyOf[Range].
420 //
421 Node* PhaseMacroExpand::generate_arraycopy(ArrayCopyNode *ac, AllocateArrayNode* alloc,
422 Node** ctrl, MergeMemNode* mem, Node** io,
423 const TypePtr* adr_type,
424 BasicType basic_elem_type,
425 Node* src, Node* src_offset,
426 Node* dest, Node* dest_offset,
427 Node* copy_length,
428 Node* dest_length,
429 bool disjoint_bases,
430 bool length_never_negative,
431 RegionNode* slow_region) {
432 if (slow_region == nullptr) {
433 slow_region = new RegionNode(1);
434 transform_later(slow_region);
435 }
436
437 Node* original_dest = dest;
438 bool dest_needs_zeroing = false;
439 bool acopy_to_uninitialized = false;
440 Node* default_value = nullptr;
441 Node* raw_default_value = nullptr;
442
443 // See if this is the initialization of a newly-allocated array.
444 // If so, we will take responsibility here for initializing it to zero.
445 // (Note: Because tightly_coupled_allocation performs checks on the
446 // out-edges of the dest, we need to avoid making derived pointers
447 // from it until we have checked its uses.)
448 if (ReduceBulkZeroing
449 && !(UseTLAB && ZeroTLAB) // pointless if already zeroed
450 && basic_elem_type != T_CONFLICT // avoid corner case
451 && !src->eqv_uncast(dest)
452 && alloc != nullptr
453 && _igvn.find_int_con(alloc->in(AllocateNode::ALength), 1) > 0) {
454 assert(ac->is_alloc_tightly_coupled(), "sanity");
455 // acopy to uninitialized tightly coupled allocations
456 // needs zeroing outside the copy range
457 // and the acopy itself will be to uninitialized memory
458 acopy_to_uninitialized = true;
459 if (alloc->maybe_set_complete(&_igvn)) {
460 // "You break it, you buy it."
461 InitializeNode* init = alloc->initialization();
462 assert(init->is_complete(), "we just did this");
463 init->set_complete_with_arraycopy();
464 assert(dest->is_CheckCastPP(), "sanity");
465 assert(dest->in(0)->in(0) == init, "dest pinned");
466 adr_type = TypeRawPtr::BOTTOM; // all initializations are into raw memory
467 // From this point on, every exit path is responsible for
468 // initializing any non-copied parts of the object to zero.
469 // Also, if this flag is set we make sure that arraycopy interacts properly
470 // with G1, eliding pre-barriers. See CR 6627983.
471 dest_needs_zeroing = true;
472 default_value = alloc->in(AllocateNode::DefaultValue);
473 raw_default_value = alloc->in(AllocateNode::RawDefaultValue);
474 } else {
475 // dest_need_zeroing = false;
476 }
477 } else {
478 // No zeroing elimination needed here.
479 alloc = nullptr;
480 acopy_to_uninitialized = false;
481 //original_dest = dest;
482 //dest_needs_zeroing = false;
483 }
484
485 uint alias_idx = C->get_alias_index(adr_type);
486
487 // Results are placed here:
488 enum { fast_path = 1, // normal void-returning assembly stub
489 checked_path = 2, // special assembly stub with cleanup
490 slow_call_path = 3, // something went wrong; call the VM
491 zero_path = 4, // bypass when length of copy is zero
492 bcopy_path = 5, // copy primitive array by 64-bit blocks
493 PATH_LIMIT = 6
523 checked_i_o = *io;
524 checked_mem = mem->memory_at(alias_idx);
525 checked_value = cv;
526 *ctrl = top();
527 }
528
529 Node* not_pos = generate_nonpositive_guard(ctrl, copy_length, length_never_negative);
530 if (not_pos != nullptr) {
531 Node* local_ctrl = not_pos, *local_io = *io;
532 MergeMemNode* local_mem = MergeMemNode::make(mem);
533 transform_later(local_mem);
534
535 // (6) length must not be negative.
536 if (!length_never_negative) {
537 generate_negative_guard(&local_ctrl, copy_length, slow_region);
538 }
539
540 // copy_length is 0.
541 if (dest_needs_zeroing) {
542 assert(!local_ctrl->is_top(), "no ctrl?");
543 if (copy_length->eqv_uncast(dest_length)
544 || _igvn.find_int_con(dest_length, 1) <= 0) {
545 // There is no zeroing to do. No need for a secondary raw memory barrier.
546 } else {
547 // Clear the whole thing since there are no source elements to copy.
548 generate_clear_array(local_ctrl, local_mem,
549 adr_type, dest,
550 default_value, raw_default_value,
551 basic_elem_type,
552 intcon(0), nullptr,
553 alloc->in(AllocateNode::AllocSize));
554 // Use a secondary InitializeNode as raw memory barrier.
555 // Currently it is needed only on this path since other
556 // paths have stub or runtime calls as raw memory barriers.
557 MemBarNode* mb = MemBarNode::make(C, Op_Initialize,
558 Compile::AliasIdxRaw,
559 top());
560 transform_later(mb);
561 mb->set_req(TypeFunc::Control,local_ctrl);
562 mb->set_req(TypeFunc::Memory, local_mem->memory_at(Compile::AliasIdxRaw));
563 local_ctrl = transform_later(new ProjNode(mb, TypeFunc::Control));
564 local_mem->set_memory_at(Compile::AliasIdxRaw, transform_later(new ProjNode(mb, TypeFunc::Memory)));
565
566 InitializeNode* init = mb->as_Initialize();
567 init->set_complete(&_igvn); // (there is no corresponding AllocateNode)
568 }
569 }
570
571 // Present the results of the fast call.
572 result_region->init_req(zero_path, local_ctrl);
573 result_i_o ->init_req(zero_path, local_io);
574 result_memory->init_req(zero_path, local_mem->memory_at(alias_idx));
575 }
576
577 if (!(*ctrl)->is_top() && dest_needs_zeroing) {
578 // We have to initialize the *uncopied* part of the array to zero.
579 // The copy destination is the slice dest[off..off+len]. The other slices
580 // are dest_head = dest[0..off] and dest_tail = dest[off+len..dest.length].
581 Node* dest_size = alloc->in(AllocateNode::AllocSize);
582 Node* dest_tail = transform_later( new AddINode(dest_offset, copy_length));
583
584 // If there is a head section that needs zeroing, do it now.
585 if (_igvn.find_int_con(dest_offset, -1) != 0) {
586 generate_clear_array(*ctrl, mem,
587 adr_type, dest,
588 default_value, raw_default_value,
589 basic_elem_type,
590 intcon(0), dest_offset,
591 nullptr);
592 }
593
594 // Next, perform a dynamic check on the tail length.
595 // It is often zero, and we can win big if we prove this.
596 // There are two wins: Avoid generating the ClearArray
597 // with its attendant messy index arithmetic, and upgrade
598 // the copy to a more hardware-friendly word size of 64 bits.
599 Node* tail_ctl = nullptr;
600 if (!(*ctrl)->is_top() && !dest_tail->eqv_uncast(dest_length)) {
601 Node* cmp_lt = transform_later( new CmpINode(dest_tail, dest_length) );
602 Node* bol_lt = transform_later( new BoolNode(cmp_lt, BoolTest::lt) );
603 tail_ctl = generate_slow_guard(ctrl, bol_lt, nullptr);
604 assert(tail_ctl != nullptr || !(*ctrl)->is_top(), "must be an outcome");
605 }
606
607 // At this point, let's assume there is no tail.
608 if (!(*ctrl)->is_top() && alloc != nullptr && basic_elem_type != T_OBJECT) {
609 // There is no tail. Try an upgrade to a 64-bit copy.
618 src, src_offset, dest, dest_offset,
619 dest_size, acopy_to_uninitialized);
620 if (didit) {
621 // Present the results of the block-copying fast call.
622 result_region->init_req(bcopy_path, local_ctrl);
623 result_i_o ->init_req(bcopy_path, local_io);
624 result_memory->init_req(bcopy_path, local_mem->memory_at(alias_idx));
625 }
626 }
627 if (didit) {
628 *ctrl = top(); // no regular fast path
629 }
630 }
631
632 // Clear the tail, if any.
633 if (tail_ctl != nullptr) {
634 Node* notail_ctl = (*ctrl)->is_top() ? nullptr : *ctrl;
635 *ctrl = tail_ctl;
636 if (notail_ctl == nullptr) {
637 generate_clear_array(*ctrl, mem,
638 adr_type, dest,
639 default_value, raw_default_value,
640 basic_elem_type,
641 dest_tail, nullptr,
642 dest_size);
643 } else {
644 // Make a local merge.
645 Node* done_ctl = transform_later(new RegionNode(3));
646 Node* done_mem = transform_later(new PhiNode(done_ctl, Type::MEMORY, adr_type));
647 done_ctl->init_req(1, notail_ctl);
648 done_mem->init_req(1, mem->memory_at(alias_idx));
649 generate_clear_array(*ctrl, mem,
650 adr_type, dest,
651 default_value, raw_default_value,
652 basic_elem_type,
653 dest_tail, nullptr,
654 dest_size);
655 done_ctl->init_req(2, *ctrl);
656 done_mem->init_req(2, mem->memory_at(alias_idx));
657 *ctrl = done_ctl;
658 mem->set_memory_at(alias_idx, done_mem);
659 }
660 }
661 }
662
663 BasicType copy_type = basic_elem_type;
664 assert(basic_elem_type != T_ARRAY, "caller must fix this");
665 if (!(*ctrl)->is_top() && copy_type == T_OBJECT) {
666 // If src and dest have compatible element types, we can copy bits.
667 // Types S[] and D[] are compatible if D is a supertype of S.
668 //
669 // If they are not, we will use checked_oop_disjoint_arraycopy,
670 // which performs a fast optimistic per-oop check, and backs off
671 // further to JVM_ArrayCopy on the first per-oop check that fails.
672 // (Actually, we don't move raw bits only; the GC requires card marks.)
810 Node* length_minus = new SubINode(copy_length, slow_offset);
811 transform_later(length_minus);
812
813 // Tweak the node variables to adjust the code produced below:
814 src_offset = src_off_plus;
815 dest_offset = dest_off_plus;
816 copy_length = length_minus;
817 }
818 }
819 *ctrl = slow_control;
820 if (!(*ctrl)->is_top()) {
821 Node* local_ctrl = *ctrl, *local_io = slow_i_o;
822 MergeMemNode* local_mem = MergeMemNode::make(mem);
823 transform_later(local_mem);
824
825 // Generate the slow path, if needed.
826 local_mem->set_memory_at(alias_idx, slow_mem);
827
828 if (dest_needs_zeroing) {
829 generate_clear_array(local_ctrl, local_mem,
830 adr_type, dest,
831 default_value, raw_default_value,
832 basic_elem_type,
833 intcon(0), nullptr,
834 alloc->in(AllocateNode::AllocSize));
835 }
836
837 local_mem = generate_slow_arraycopy(ac,
838 &local_ctrl, local_mem, &local_io,
839 adr_type,
840 src, src_offset, dest, dest_offset,
841 copy_length, /*dest_uninitialized*/false);
842
843 result_region->init_req(slow_call_path, local_ctrl);
844 result_i_o ->init_req(slow_call_path, local_io);
845 result_memory->init_req(slow_call_path, local_mem->memory_at(alias_idx));
846 } else {
847 ShouldNotReachHere(); // no call to generate_slow_arraycopy:
848 // projections were not extracted
849 }
850
851 // Remove unused edges.
852 for (uint i = 1; i < result_region->req(); i++) {
874 // The next memory barrier is added to avoid it. If the arraycopy can be
875 // optimized away (which it can, sometimes) then we can manually remove
876 // the membar also.
877 //
878 // Do not let reads from the cloned object float above the arraycopy.
879 if (alloc != nullptr && !alloc->initialization()->does_not_escape()) {
880 // Do not let stores that initialize this object be reordered with
881 // a subsequent store that would make this object accessible by
882 // other threads.
883 insert_mem_bar(ctrl, &out_mem, Op_MemBarStoreStore);
884 } else {
885 insert_mem_bar(ctrl, &out_mem, Op_MemBarCPUOrder);
886 }
887
888 if (is_partial_array_copy) {
889 assert((*ctrl)->is_Proj(), "MemBar control projection");
890 assert((*ctrl)->in(0)->isa_MemBar(), "MemBar node");
891 (*ctrl)->in(0)->isa_MemBar()->set_trailing_partial_array_copy();
892 }
893
894 _igvn.replace_node(_callprojs->fallthrough_memproj, out_mem);
895 if (_callprojs->fallthrough_ioproj != nullptr) {
896 _igvn.replace_node(_callprojs->fallthrough_ioproj, *io);
897 }
898 _igvn.replace_node(_callprojs->fallthrough_catchproj, *ctrl);
899
900 #ifdef ASSERT
901 const TypeOopPtr* dest_t = _igvn.type(dest)->is_oopptr();
902 if (dest_t->is_known_instance() && !is_partial_array_copy) {
903 ArrayCopyNode* ac = nullptr;
904 assert(ArrayCopyNode::may_modify(dest_t, (*ctrl)->in(0)->as_MemBar(), &_igvn, ac), "dependency on arraycopy lost");
905 assert(ac == nullptr, "no arraycopy anymore");
906 }
907 #endif
908
909 return out_mem;
910 }
911
912 // Helper for initialization of arrays, creating a ClearArray.
913 // It writes zero bits in [start..end), within the body of an array object.
914 // The memory effects are all chained onto the 'adr_type' alias category.
915 //
916 // Since the object is otherwise uninitialized, we are free
917 // to put a little "slop" around the edges of the cleared area,
918 // as long as it does not go back into the array's header,
919 // or beyond the array end within the heap.
920 //
921 // The lower edge can be rounded down to the nearest jint and the
922 // upper edge can be rounded up to the nearest MinObjAlignmentInBytes.
923 //
924 // Arguments:
925 // adr_type memory slice where writes are generated
926 // dest oop of the destination array
927 // basic_elem_type element type of the destination
928 // slice_idx array index of first element to store
929 // slice_len number of elements to store (or null)
930 // dest_size total size in bytes of the array object
931 //
932 // Exactly one of slice_len or dest_size must be non-null.
933 // If dest_size is non-null, zeroing extends to the end of the object.
934 // If slice_len is non-null, the slice_idx value must be a constant.
935 void PhaseMacroExpand::generate_clear_array(Node* ctrl, MergeMemNode* merge_mem,
936 const TypePtr* adr_type,
937 Node* dest,
938 Node* val,
939 Node* raw_val,
940 BasicType basic_elem_type,
941 Node* slice_idx,
942 Node* slice_len,
943 Node* dest_size) {
944 // one or the other but not both of slice_len and dest_size:
945 assert((slice_len != nullptr? 1: 0) + (dest_size != nullptr? 1: 0) == 1, "");
946 if (slice_len == nullptr) slice_len = top();
947 if (dest_size == nullptr) dest_size = top();
948
949 uint alias_idx = C->get_alias_index(adr_type);
950
951 // operate on this memory slice:
952 Node* mem = merge_mem->memory_at(alias_idx); // memory slice to operate on
953
954 // scaling and rounding of indexes:
955 int scale = exact_log2(type2aelembytes(basic_elem_type));
956 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
957 int clear_low = (-1 << scale) & (BytesPerInt - 1);
958 int bump_bit = (-1 << scale) & BytesPerInt;
959
960 // determine constant starts and ends
961 const intptr_t BIG_NEG = -128;
962 assert(BIG_NEG + 2*abase < 0, "neg enough");
963 intptr_t slice_idx_con = (intptr_t) _igvn.find_int_con(slice_idx, BIG_NEG);
964 intptr_t slice_len_con = (intptr_t) _igvn.find_int_con(slice_len, BIG_NEG);
965 if (slice_len_con == 0) {
966 return; // nothing to do here
967 }
968 intptr_t start_con = (abase + (slice_idx_con << scale)) & ~clear_low;
969 intptr_t end_con = _igvn.find_intptr_t_con(dest_size, -1);
970 if (slice_idx_con >= 0 && slice_len_con >= 0) {
971 assert(end_con < 0, "not two cons");
972 end_con = align_up(abase + ((slice_idx_con + slice_len_con) << scale),
973 BytesPerLong);
974 }
975
976 if (start_con >= 0 && end_con >= 0) {
977 // Constant start and end. Simple.
978 mem = ClearArrayNode::clear_memory(ctrl, mem, dest, val, raw_val,
979 start_con, end_con, &_igvn);
980 } else if (start_con >= 0 && dest_size != top()) {
981 // Constant start, pre-rounded end after the tail of the array.
982 Node* end = dest_size;
983 mem = ClearArrayNode::clear_memory(ctrl, mem, dest, val, raw_val,
984 start_con, end, &_igvn);
985 } else if (start_con >= 0 && slice_len != top()) {
986 // Constant start, non-constant end. End needs rounding up.
987 // End offset = round_up(abase + ((slice_idx_con + slice_len) << scale), 8)
988 intptr_t end_base = abase + (slice_idx_con << scale);
989 int end_round = (-1 << scale) & (BytesPerLong - 1);
990 Node* end = ConvI2X(slice_len);
991 if (scale != 0)
992 end = transform_later(new LShiftXNode(end, intcon(scale) ));
993 end_base += end_round;
994 end = transform_later(new AddXNode(end, MakeConX(end_base)) );
995 end = transform_later(new AndXNode(end, MakeConX(~end_round)) );
996 mem = ClearArrayNode::clear_memory(ctrl, mem, dest, val, raw_val,
997 start_con, end, &_igvn);
998 } else if (start_con < 0 && dest_size != top()) {
999 // Non-constant start, pre-rounded end after the tail of the array.
1000 // This is almost certainly a "round-to-end" operation.
1001 Node* start = slice_idx;
1002 start = ConvI2X(start);
1003 if (scale != 0)
1004 start = transform_later(new LShiftXNode( start, intcon(scale) ));
1005 start = transform_later(new AddXNode(start, MakeConX(abase)) );
1006 if ((bump_bit | clear_low) != 0) {
1007 int to_clear = (bump_bit | clear_low);
1008 // Align up mod 8, then store a jint zero unconditionally
1009 // just before the mod-8 boundary.
1010 if (((abase + bump_bit) & ~to_clear) - bump_bit
1011 < arrayOopDesc::length_offset_in_bytes() + BytesPerInt) {
1012 bump_bit = 0;
1013 assert((abase & to_clear) == 0, "array base must be long-aligned");
1014 } else {
1015 // Bump 'start' up to (or past) the next jint boundary:
1016 start = transform_later( new AddXNode(start, MakeConX(bump_bit)) );
1017 assert((abase & clear_low) == 0, "array base must be int-aligned");
1018 }
1019 // Round bumped 'start' down to jlong boundary in body of array.
1020 start = transform_later(new AndXNode(start, MakeConX(~to_clear)) );
1021 if (bump_bit != 0) {
1022 // Store a zero to the immediately preceding jint:
1023 Node* x1 = transform_later(new AddXNode(start, MakeConX(-bump_bit)) );
1024 Node* p1 = basic_plus_adr(dest, x1);
1025 if (val == nullptr) {
1026 assert(raw_val == nullptr, "val may not be null");
1027 mem = StoreNode::make(_igvn, ctrl, mem, p1, adr_type, intcon(0), T_INT, MemNode::unordered);
1028 } else {
1029 assert(_igvn.type(val)->isa_narrowoop(), "should be narrow oop");
1030 mem = new StoreNNode(ctrl, mem, p1, adr_type, val, MemNode::unordered);
1031 }
1032 mem = transform_later(mem);
1033 }
1034 }
1035 Node* end = dest_size; // pre-rounded
1036 mem = ClearArrayNode::clear_memory(ctrl, mem, dest, raw_val,
1037 start, end, &_igvn);
1038 } else {
1039 // Non-constant start, unrounded non-constant end.
1040 // (Nobody zeroes a random midsection of an array using this routine.)
1041 ShouldNotReachHere(); // fix caller
1042 }
1043
1044 // Done.
1045 merge_mem->set_memory_at(alias_idx, mem);
1046 }
1047
1048 bool PhaseMacroExpand::generate_block_arraycopy(Node** ctrl, MergeMemNode** mem, Node* io,
1049 const TypePtr* adr_type,
1050 BasicType basic_elem_type,
1051 AllocateNode* alloc,
1052 Node* src, Node* src_offset,
1053 Node* dest, Node* dest_offset,
1054 Node* dest_size, bool dest_uninitialized) {
1055 // See if there is an advantage from block transfer.
1056 int scale = exact_log2(type2aelembytes(basic_elem_type));
1132 const TypeFunc* call_type = OptoRuntime::slow_arraycopy_Type();
1133 CallNode* call = new CallStaticJavaNode(call_type, OptoRuntime::slow_arraycopy_Java(),
1134 "slow_arraycopy", TypePtr::BOTTOM);
1135
1136 call->init_req(TypeFunc::Control, *ctrl);
1137 call->init_req(TypeFunc::I_O , *io);
1138 call->init_req(TypeFunc::Memory , mem);
1139 call->init_req(TypeFunc::ReturnAdr, top());
1140 call->init_req(TypeFunc::FramePtr, top());
1141 call->init_req(TypeFunc::Parms+0, src);
1142 call->init_req(TypeFunc::Parms+1, src_offset);
1143 call->init_req(TypeFunc::Parms+2, dest);
1144 call->init_req(TypeFunc::Parms+3, dest_offset);
1145 call->init_req(TypeFunc::Parms+4, copy_length);
1146 call->copy_call_debug_info(&_igvn, ac);
1147
1148 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
1149 _igvn.replace_node(ac, call);
1150 transform_later(call);
1151
1152 _callprojs = call->extract_projections(false /*separate_io_proj*/, false /*do_asserts*/);
1153 *ctrl = _callprojs->fallthrough_catchproj->clone();
1154 transform_later(*ctrl);
1155
1156 Node* m = _callprojs->fallthrough_memproj->clone();
1157 transform_later(m);
1158
1159 uint alias_idx = C->get_alias_index(adr_type);
1160 MergeMemNode* out_mem;
1161 if (alias_idx != Compile::AliasIdxBot) {
1162 out_mem = MergeMemNode::make(mem);
1163 out_mem->set_memory_at(alias_idx, m);
1164 } else {
1165 out_mem = MergeMemNode::make(m);
1166 }
1167 transform_later(out_mem);
1168
1169 // When src is negative and arraycopy is before an infinite loop,_callprojs.fallthrough_ioproj
1170 // could be nullptr. Skip clone and update nullptr fallthrough_ioproj.
1171 if (_callprojs->fallthrough_ioproj != nullptr) {
1172 *io = _callprojs->fallthrough_ioproj->clone();
1173 transform_later(*io);
1174 } else {
1175 *io = nullptr;
1176 }
1177
1178 return out_mem;
1179 }
1180
1181 // Helper function; generates code for cases requiring runtime checks.
1182 Node* PhaseMacroExpand::generate_checkcast_arraycopy(Node** ctrl, MergeMemNode** mem,
1183 const TypePtr* adr_type,
1184 Node* dest_elem_klass,
1185 Node* src, Node* src_offset,
1186 Node* dest, Node* dest_offset,
1187 Node* copy_length, bool dest_uninitialized) {
1188 if ((*ctrl)->is_top()) return nullptr;
1189
1190 address copyfunc_addr = StubRoutines::checkcast_arraycopy(dest_uninitialized);
1191 if (copyfunc_addr == nullptr) { // Stub was not generated, go slow path.
1192 return nullptr;
1284 if (exit_block) {
1285 exit_block->init_req(2, *ctrl);
1286
1287 // Memory edge corresponding to stub_region.
1288 result_memory->init_req(2, *mem);
1289
1290 uint alias_idx = C->get_alias_index(adr_type);
1291 if (alias_idx != Compile::AliasIdxBot) {
1292 *mem = MergeMemNode::make(*mem);
1293 (*mem)->set_memory_at(alias_idx, result_memory);
1294 } else {
1295 *mem = MergeMemNode::make(result_memory);
1296 }
1297 transform_later(*mem);
1298 *ctrl = exit_block;
1299 return true;
1300 }
1301 return false;
1302 }
1303
1304 const TypePtr* PhaseMacroExpand::adjust_for_flat_array(const TypeAryPtr* top_dest, Node*& src_offset,
1305 Node*& dest_offset, Node*& length, BasicType& dest_elem,
1306 Node*& dest_length) {
1307 #ifdef ASSERT
1308 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
1309 bool needs_barriers = top_dest->elem()->inline_klass()->contains_oops() &&
1310 bs->array_copy_requires_gc_barriers(dest_length != nullptr, T_OBJECT, false, false, BarrierSetC2::Optimization);
1311 assert(!needs_barriers || StressReflectiveCode, "Flat arracopy would require GC barriers");
1312 #endif
1313 int elem_size = top_dest->flat_elem_size();
1314 if (elem_size >= 8) {
1315 if (elem_size > 8) {
1316 // treat as array of long but scale length, src offset and dest offset
1317 assert((elem_size % 8) == 0, "not a power of 2?");
1318 int factor = elem_size / 8;
1319 length = transform_later(new MulINode(length, intcon(factor)));
1320 src_offset = transform_later(new MulINode(src_offset, intcon(factor)));
1321 dest_offset = transform_later(new MulINode(dest_offset, intcon(factor)));
1322 if (dest_length != nullptr) {
1323 dest_length = transform_later(new MulINode(dest_length, intcon(factor)));
1324 }
1325 elem_size = 8;
1326 }
1327 dest_elem = T_LONG;
1328 } else if (elem_size == 4) {
1329 dest_elem = T_INT;
1330 } else if (elem_size == 2) {
1331 dest_elem = T_CHAR;
1332 } else if (elem_size == 1) {
1333 dest_elem = T_BYTE;
1334 } else {
1335 ShouldNotReachHere();
1336 }
1337 return TypeRawPtr::BOTTOM;
1338 }
1339
1340 #undef XTOP
1341
1342 void PhaseMacroExpand::expand_arraycopy_node(ArrayCopyNode *ac) {
1343 Node* ctrl = ac->in(TypeFunc::Control);
1344 Node* io = ac->in(TypeFunc::I_O);
1345 Node* src = ac->in(ArrayCopyNode::Src);
1346 Node* src_offset = ac->in(ArrayCopyNode::SrcPos);
1347 Node* dest = ac->in(ArrayCopyNode::Dest);
1348 Node* dest_offset = ac->in(ArrayCopyNode::DestPos);
1349 Node* length = ac->in(ArrayCopyNode::Length);
1350 MergeMemNode* merge_mem = nullptr;
1351
1352 if (ac->is_clonebasic()) {
1353 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
1354 bs->clone_at_expansion(this, ac);
1355 return;
1356 } else if (ac->is_copyof() || ac->is_copyofrange() || ac->is_clone_oop_array()) {
1357 const Type* src_type = _igvn.type(src);
1358 const Type* dest_type = _igvn.type(dest);
1359 const TypeAryPtr* top_src = src_type->isa_aryptr();
1360 const TypeAryPtr* top_dest = dest_type->isa_aryptr();
1361 BasicType dest_elem = T_OBJECT;
1362 if (top_dest != nullptr && top_dest->elem() != Type::BOTTOM) {
1363 dest_elem = top_dest->elem()->array_element_basic_type();
1364 }
1365 if (is_reference_type(dest_elem, true)) dest_elem = T_OBJECT;
1366
1367 if (top_src != nullptr && top_src->is_flat()) {
1368 // If src is flat, dest is guaranteed to be flat as well
1369 top_dest = top_src;
1370 }
1371
1372 AllocateArrayNode* alloc = nullptr;
1373 Node* dest_length = nullptr;
1374 if (ac->is_alloc_tightly_coupled()) {
1375 alloc = AllocateArrayNode::Ideal_array_allocation(dest);
1376 assert(alloc != nullptr, "expect alloc");
1377 dest_length = alloc->in(AllocateNode::ALength);
1378 }
1379
1380 Node* mem = ac->in(TypeFunc::Memory);
1381 const TypePtr* adr_type = nullptr;
1382 if (top_dest->is_flat()) {
1383 assert(dest_length != nullptr || StressReflectiveCode, "must be tightly coupled");
1384 // Copy to a flat array modifies multiple memory slices. Conservatively insert a barrier
1385 // on all slices to prevent writes into the source from floating below the arraycopy.
1386 insert_mem_bar(&ctrl, &mem, Op_MemBarCPUOrder);
1387 adr_type = adjust_for_flat_array(top_dest, src_offset, dest_offset, length, dest_elem, dest_length);
1388 } else {
1389 adr_type = dest_type->is_oopptr()->add_offset(Type::OffsetBot);
1390 if (ac->_dest_type != TypeOopPtr::BOTTOM) {
1391 adr_type = ac->_dest_type->add_offset(Type::OffsetBot)->is_ptr();
1392 }
1393 if (ac->_src_type != ac->_dest_type) {
1394 adr_type = TypeRawPtr::BOTTOM;
1395 }
1396 }
1397 merge_mem = MergeMemNode::make(mem);
1398 transform_later(merge_mem);
1399
1400 generate_arraycopy(ac, alloc, &ctrl, merge_mem, &io,
1401 adr_type, dest_elem,
1402 src, src_offset, dest, dest_offset, length,
1403 dest_length,
1404 true, !ac->is_copyofrange());
1405 return;
1406 }
1407
1408 AllocateArrayNode* alloc = nullptr;
1409 if (ac->is_alloc_tightly_coupled()) {
1410 alloc = AllocateArrayNode::Ideal_array_allocation(dest);
1411 assert(alloc != nullptr, "expect alloc");
1412 }
1413
1414 assert(ac->is_arraycopy() || ac->is_arraycopy_validated(), "should be an arraycopy");
1415
1416 // Compile time checks. If any of these checks cannot be verified at compile time,
1417 // we do not make a fast path for this call. Instead, we let the call remain as it
1418 // is. The checks we choose to mandate at compile time are:
1419 //
1420 // (1) src and dest are arrays.
1421 const Type* src_type = src->Value(&_igvn);
1422 const Type* dest_type = dest->Value(&_igvn);
1423 const TypeAryPtr* top_src = src_type->isa_aryptr();
1424 const TypeAryPtr* top_dest = dest_type->isa_aryptr();
1425
1426 BasicType src_elem = T_CONFLICT;
1427 BasicType dest_elem = T_CONFLICT;
1428
1429 if (top_src != nullptr && top_src->elem() != Type::BOTTOM) {
1430 src_elem = top_src->elem()->array_element_basic_type();
1431 }
1432 if (top_dest != nullptr && top_dest->elem() != Type::BOTTOM) {
1433 dest_elem = top_dest->elem()->array_element_basic_type();
1434 }
1435 if (is_reference_type(src_elem, true)) src_elem = T_OBJECT;
1436 if (is_reference_type(dest_elem, true)) dest_elem = T_OBJECT;
1437
1438 if (ac->is_arraycopy_validated() && dest_elem != T_CONFLICT && src_elem == T_CONFLICT) {
1439 src_elem = dest_elem;
1440 }
1441
1442 if (src_elem == T_CONFLICT || dest_elem == T_CONFLICT) {
1443 // Conservatively insert a memory barrier on all memory slices.
1444 // Do not let writes into the source float below the arraycopy.
1445 {
1446 Node* mem = ac->in(TypeFunc::Memory);
1447 insert_mem_bar(&ctrl, &mem, Op_MemBarCPUOrder);
1448
1449 merge_mem = MergeMemNode::make(mem);
1450 transform_later(merge_mem);
1451 }
1452
1453 // Call StubRoutines::generic_arraycopy stub.
1454 Node* mem = generate_arraycopy(ac, nullptr, &ctrl, merge_mem, &io,
1455 TypeRawPtr::BOTTOM, T_CONFLICT,
1456 src, src_offset, dest, dest_offset, length,
1457 nullptr,
1458 // If a negative length guard was generated for the ArrayCopyNode,
1459 // the length of the array can never be negative.
1460 false, ac->has_negative_length_guard());
1461 return;
1462 }
1463
1464 assert(!ac->is_arraycopy_validated() || (src_elem == dest_elem && dest_elem != T_VOID), "validated but different basic types");
1465
1466 // (2) src and dest arrays must have elements of the same BasicType
1467 // Figure out the size and type of the elements we will be copying.
1468 //
1469 // We have no stub to copy flat inline type arrays with oop
1470 // fields if we need to emit write barriers.
1471 //
1472 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
1473 if (src_elem != dest_elem || top_src->is_flat() != top_dest->is_flat() || dest_elem == T_VOID ||
1474 (top_src->is_flat() && top_dest->elem()->inline_klass()->contains_oops() &&
1475 bs->array_copy_requires_gc_barriers(alloc != nullptr, T_OBJECT, false, false, BarrierSetC2::Optimization))) {
1476 // The component types are not the same or are not recognized. Punt.
1477 // (But, avoid the native method wrapper to JVM_ArrayCopy.)
1478 {
1479 Node* mem = ac->in(TypeFunc::Memory);
1480 merge_mem = generate_slow_arraycopy(ac, &ctrl, mem, &io, TypePtr::BOTTOM, src, src_offset, dest, dest_offset, length, false);
1481 }
1482
1483 _igvn.replace_node(_callprojs->fallthrough_memproj, merge_mem);
1484 if (_callprojs->fallthrough_ioproj != nullptr) {
1485 _igvn.replace_node(_callprojs->fallthrough_ioproj, io);
1486 }
1487 _igvn.replace_node(_callprojs->fallthrough_catchproj, ctrl);
1488 return;
1489 }
1490
1491 //---------------------------------------------------------------------------
1492 // We will make a fast path for this call to arraycopy.
1493
1494 // We have the following tests left to perform:
1495 //
1496 // (3) src and dest must not be null.
1497 // (4) src_offset must not be negative.
1498 // (5) dest_offset must not be negative.
1499 // (6) length must not be negative.
1500 // (7) src_offset + length must not exceed length of src.
1501 // (8) dest_offset + length must not exceed length of dest.
1502 // (9) each element of an oop array must be assignable
1503
1504 Node* mem = ac->in(TypeFunc::Memory);
1505 if (top_dest->is_flat()) {
1506 // Copy to a flat array modifies multiple memory slices. Conservatively insert a barrier
1507 // on all slices to prevent writes into the source from floating below the arraycopy.
1508 insert_mem_bar(&ctrl, &mem, Op_MemBarCPUOrder);
1509 }
1510 merge_mem = MergeMemNode::make(mem);
1511 transform_later(merge_mem);
1512
1513 RegionNode* slow_region = new RegionNode(1);
1514 transform_later(slow_region);
1515
1516 if (!ac->is_arraycopy_validated()) {
1517 // (3) operands must not be null
1518 // We currently perform our null checks with the null_check routine.
1519 // This means that the null exceptions will be reported in the caller
1520 // rather than (correctly) reported inside of the native arraycopy call.
1521 // This should be corrected, given time. We do our null check with the
1522 // stack pointer restored.
1523 // null checks done library_call.cpp
1524
1525 // (4) src_offset must not be negative.
1526 generate_negative_guard(&ctrl, src_offset, slow_region);
1527
1528 // (5) dest_offset must not be negative.
1529 generate_negative_guard(&ctrl, dest_offset, slow_region);
1530
1531 // (6) length must not be negative (moved to generate_arraycopy()).
1532 // generate_negative_guard(length, slow_region);
1533
1534 // (7) src_offset + length must not exceed length of src.
1535 Node* alen = ac->in(ArrayCopyNode::SrcLen);
1536 assert(alen != nullptr, "need src len");
1537 generate_limit_guard(&ctrl,
1538 src_offset, length,
1539 alen,
1540 slow_region);
1541
1542 // (8) dest_offset + length must not exceed length of dest.
1543 alen = ac->in(ArrayCopyNode::DestLen);
1544 assert(alen != nullptr, "need dest len");
1545 generate_limit_guard(&ctrl,
1546 dest_offset, length,
1547 alen,
1548 slow_region);
1549
1550 // (9) each element of an oop array must be assignable
1551 // The generate_arraycopy subroutine checks this.
1552
1553 // Handle inline type arrays
1554 if (!top_src->is_flat()) {
1555 if (UseFlatArray && !top_src->is_not_flat()) {
1556 // Src might be flat and dest might not be flat. Go to the slow path if src is flat.
1557 generate_flat_array_guard(&ctrl, src, merge_mem, slow_region);
1558 }
1559 if (EnableValhalla) {
1560 // No validation. The subtype check emitted at macro expansion time will not go to the slow
1561 // path but call checkcast_arraycopy which can not handle flat/null-free inline type arrays.
1562 generate_null_free_array_guard(&ctrl, dest, merge_mem, slow_region);
1563 }
1564 } else {
1565 assert(top_dest->is_flat(), "dest array must be flat");
1566 }
1567 }
1568
1569 // This is where the memory effects are placed:
1570 const TypePtr* adr_type = nullptr;
1571 Node* dest_length = (alloc != nullptr) ? alloc->in(AllocateNode::ALength) : nullptr;
1572
1573 if (top_dest->is_flat()) {
1574 adr_type = adjust_for_flat_array(top_dest, src_offset, dest_offset, length, dest_elem, dest_length);
1575 } else if (ac->_dest_type != TypeOopPtr::BOTTOM) {
1576 adr_type = ac->_dest_type->add_offset(Type::OffsetBot)->is_ptr();
1577 } else {
1578 adr_type = TypeAryPtr::get_array_body_type(dest_elem);
1579 }
1580
1581 generate_arraycopy(ac, alloc, &ctrl, merge_mem, &io,
1582 adr_type, dest_elem,
1583 src, src_offset, dest, dest_offset, length,
1584 dest_length,
1585 // If a negative length guard was generated for the ArrayCopyNode,
1586 // the length of the array can never be negative.
1587 false, ac->has_negative_length_guard(),
1588 slow_region);
1589 }
|