1 /*
2 * Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "oops/objArrayKlass.hpp"
27 #include "opto/convertnode.hpp"
28 #include "opto/graphKit.hpp"
29 #include "opto/macro.hpp"
30 #include "opto/runtime.hpp"
31
32
33 void PhaseMacroExpand::insert_mem_bar(Node** ctrl, Node** mem, int opcode, Node* precedent) {
34 MemBarNode* mb = MemBarNode::make(C, opcode, Compile::AliasIdxBot, precedent);
35 mb->init_req(TypeFunc::Control, *ctrl);
36 mb->init_req(TypeFunc::Memory, *mem);
37 transform_later(mb);
38 *ctrl = new ProjNode(mb,TypeFunc::Control);
39 transform_later(*ctrl);
40 Node* mem_proj = new ProjNode(mb,TypeFunc::Memory);
41 transform_later(mem_proj);
42 *mem = mem_proj;
43 }
44
45 Node* PhaseMacroExpand::array_element_address(Node* ary, Node* idx, BasicType elembt) {
46 uint shift = exact_log2(type2aelembytes(elembt));
47 uint header = arrayOopDesc::base_offset_in_bytes(elembt);
48 Node* base = basic_plus_adr(ary, header);
49 #ifdef _LP64
50 // see comment in GraphKit::array_element_address
51 int index_max = max_jint - 1; // array size is max_jint, index is one less
52 const TypeLong* lidxtype = TypeLong::make(CONST64(0), index_max, Type::WidenMax);
53 idx = transform_later( new ConvI2LNode(idx, lidxtype) );
54 #endif
55 Node* scale = new LShiftXNode(idx, intcon(shift));
56 transform_later(scale);
57 return basic_plus_adr(ary, base, scale);
58 }
59
60 Node* PhaseMacroExpand::ConvI2L(Node* offset) {
61 return transform_later(new ConvI2LNode(offset));
62 }
63
64 Node* PhaseMacroExpand::make_leaf_call(Node* ctrl, Node* mem,
65 const TypeFunc* call_type, address call_addr,
66 const char* call_name,
67 const TypePtr* adr_type,
68 Node* parm0, Node* parm1,
69 Node* parm2, Node* parm3,
70 Node* parm4, Node* parm5,
71 Node* parm6, Node* parm7) {
72 int size = call_type->domain()->cnt();
73 Node* call = new CallLeafNoFPNode(call_type, call_addr, call_name, adr_type);
74 call->init_req(TypeFunc::Control, ctrl);
75 call->init_req(TypeFunc::I_O , top());
76 call->init_req(TypeFunc::Memory , mem);
77 call->init_req(TypeFunc::ReturnAdr, top());
78 call->init_req(TypeFunc::FramePtr, top());
79
80 // Hook each parm in order. Stop looking at the first NULL.
81 if (parm0 != NULL) { call->init_req(TypeFunc::Parms+0, parm0);
82 if (parm1 != NULL) { call->init_req(TypeFunc::Parms+1, parm1);
83 if (parm2 != NULL) { call->init_req(TypeFunc::Parms+2, parm2);
84 if (parm3 != NULL) { call->init_req(TypeFunc::Parms+3, parm3);
85 if (parm4 != NULL) { call->init_req(TypeFunc::Parms+4, parm4);
86 if (parm5 != NULL) { call->init_req(TypeFunc::Parms+5, parm5);
87 if (parm6 != NULL) { call->init_req(TypeFunc::Parms+6, parm6);
88 if (parm7 != NULL) { call->init_req(TypeFunc::Parms+7, parm7);
89 /* close each nested if ===> */ } } } } } } } }
90 assert(call->in(call->req()-1) != NULL, "must initialize all parms");
91
92 return call;
93 }
94
95
96 //------------------------------generate_guard---------------------------
97 // Helper function for generating guarded fast-slow graph structures.
98 // The given 'test', if true, guards a slow path. If the test fails
99 // then a fast path can be taken. (We generally hope it fails.)
100 // In all cases, GraphKit::control() is updated to the fast path.
101 // The returned value represents the control for the slow path.
102 // The return value is never 'top'; it is either a valid control
103 // or NULL if it is obvious that the slow path can never be taken.
104 // Also, if region and the slow control are not NULL, the slow edge
105 // is appended to the region.
106 Node* PhaseMacroExpand::generate_guard(Node** ctrl, Node* test, RegionNode* region, float true_prob) {
107 if ((*ctrl)->is_top()) {
108 // Already short circuited.
109 return NULL;
110 }
111 // Build an if node and its projections.
112 // If test is true we take the slow path, which we assume is uncommon.
113 if (_igvn.type(test) == TypeInt::ZERO) {
114 // The slow branch is never taken. No need to build this guard.
115 return NULL;
116 }
117
118 IfNode* iff = new IfNode(*ctrl, test, true_prob, COUNT_UNKNOWN);
119 transform_later(iff);
120
121 Node* if_slow = new IfTrueNode(iff);
122 transform_later(if_slow);
123
124 if (region != NULL) {
125 region->add_req(if_slow);
126 }
127
128 Node* if_fast = new IfFalseNode(iff);
129 transform_later(if_fast);
130
131 *ctrl = if_fast;
132
133 return if_slow;
134 }
135
136 inline Node* PhaseMacroExpand::generate_slow_guard(Node** ctrl, Node* test, RegionNode* region) {
137 return generate_guard(ctrl, test, region, PROB_UNLIKELY_MAG(3));
138 }
139
140 void PhaseMacroExpand::generate_negative_guard(Node** ctrl, Node* index, RegionNode* region) {
141 if ((*ctrl)->is_top())
142 return; // already stopped
143 if (_igvn.type(index)->higher_equal(TypeInt::POS)) // [0,maxint]
144 return; // index is already adequately typed
145 Node* cmp_lt = new CmpINode(index, intcon(0));
146 transform_later(cmp_lt);
147 Node* bol_lt = new BoolNode(cmp_lt, BoolTest::lt);
148 transform_later(bol_lt);
149 generate_guard(ctrl, bol_lt, region, PROB_MIN);
150 }
151
152 void PhaseMacroExpand::generate_limit_guard(Node** ctrl, Node* offset, Node* subseq_length, Node* array_length, RegionNode* region) {
153 if ((*ctrl)->is_top())
154 return; // already stopped
155 bool zero_offset = _igvn.type(offset) == TypeInt::ZERO;
156 if (zero_offset && subseq_length->eqv_uncast(array_length))
157 return; // common case of whole-array copy
158 Node* last = subseq_length;
159 if (!zero_offset) { // last += offset
160 last = new AddINode(last, offset);
161 transform_later(last);
162 }
163 Node* cmp_lt = new CmpUNode(array_length, last);
164 transform_later(cmp_lt);
165 Node* bol_lt = new BoolNode(cmp_lt, BoolTest::lt);
166 transform_later(bol_lt);
167 generate_guard(ctrl, bol_lt, region, PROB_MIN);
168 }
169
170 Node* PhaseMacroExpand::generate_nonpositive_guard(Node** ctrl, Node* index, bool never_negative) {
171 if ((*ctrl)->is_top()) return NULL;
172
173 if (_igvn.type(index)->higher_equal(TypeInt::POS1)) // [1,maxint]
174 return NULL; // index is already adequately typed
175 Node* cmp_le = new CmpINode(index, intcon(0));
176 transform_later(cmp_le);
177 BoolTest::mask le_or_eq = (never_negative ? BoolTest::eq : BoolTest::le);
178 Node* bol_le = new BoolNode(cmp_le, le_or_eq);
179 transform_later(bol_le);
180 Node* is_notp = generate_guard(ctrl, bol_le, NULL, PROB_MIN);
181
182 return is_notp;
183 }
184
185 void PhaseMacroExpand::finish_arraycopy_call(Node* call, Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type) {
186 transform_later(call);
187
188 *ctrl = new ProjNode(call,TypeFunc::Control);
189 transform_later(*ctrl);
190 Node* newmem = new ProjNode(call, TypeFunc::Memory);
191 transform_later(newmem);
192
193 uint alias_idx = C->get_alias_index(adr_type);
194 if (alias_idx != Compile::AliasIdxBot) {
195 *mem = MergeMemNode::make(*mem);
196 (*mem)->set_memory_at(alias_idx, newmem);
197 } else {
198 *mem = MergeMemNode::make(newmem);
199 }
200 transform_later(*mem);
201 }
202
203 address PhaseMacroExpand::basictype2arraycopy(BasicType t,
204 Node* src_offset,
205 Node* dest_offset,
206 bool disjoint_bases,
207 const char* &name,
208 bool dest_uninitialized) {
209 const TypeInt* src_offset_inttype = _igvn.find_int_type(src_offset);;
210 const TypeInt* dest_offset_inttype = _igvn.find_int_type(dest_offset);;
211
212 bool aligned = false;
213 bool disjoint = disjoint_bases;
214
215 // if the offsets are the same, we can treat the memory regions as
216 // disjoint, because either the memory regions are in different arrays,
217 // or they are identical (which we can treat as disjoint.) We can also
218 // treat a copy with a destination index less that the source index
219 // as disjoint since a low->high copy will work correctly in this case.
220 if (src_offset_inttype != NULL && src_offset_inttype->is_con() &&
221 dest_offset_inttype != NULL && dest_offset_inttype->is_con()) {
222 // both indices are constants
223 int s_offs = src_offset_inttype->get_con();
224 int d_offs = dest_offset_inttype->get_con();
225 int element_size = type2aelembytes(t);
226 aligned = ((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) &&
227 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0);
228 if (s_offs >= d_offs) disjoint = true;
229 } else if (src_offset == dest_offset && src_offset != NULL) {
230 // This can occur if the offsets are identical non-constants.
231 disjoint = true;
232 }
233
234 return StubRoutines::select_arraycopy_function(t, aligned, disjoint, name, dest_uninitialized);
235 }
236
237 #define COMMA ,
238 #define XTOP LP64_ONLY(COMMA top())
239
240 // Generate an optimized call to arraycopy.
241 // Caller must guard against non-arrays.
242 // Caller must determine a common array basic-type for both arrays.
243 // Caller must validate offsets against array bounds.
244 // The slow_region has already collected guard failure paths
245 // (such as out of bounds length or non-conformable array types).
246 // The generated code has this shape, in general:
247 //
248 // if (length == 0) return // via zero_path
249 // slowval = -1
250 // if (types unknown) {
251 // slowval = call generic copy loop
252 // if (slowval == 0) return // via checked_path
253 // } else if (indexes in bounds) {
254 // if ((is object array) && !(array type check)) {
255 // slowval = call checked copy loop
256 // if (slowval == 0) return // via checked_path
257 // } else {
258 // call bulk copy loop
259 // return // via fast_path
260 // }
261 // }
262 // // adjust params for remaining work:
263 // if (slowval != -1) {
264 // n = -1^slowval; src_offset += n; dest_offset += n; length -= n
265 // }
266 // slow_region:
267 // call slow arraycopy(src, src_offset, dest, dest_offset, length)
268 // return // via slow_call_path
269 //
270 // This routine is used from several intrinsics: System.arraycopy,
271 // Object.clone (the array subcase), and Arrays.copyOf[Range].
272 //
273 Node* PhaseMacroExpand::generate_arraycopy(ArrayCopyNode *ac, AllocateArrayNode* alloc,
274 Node** ctrl, MergeMemNode* mem, Node** io,
275 const TypePtr* adr_type,
276 BasicType basic_elem_type,
277 Node* src, Node* src_offset,
278 Node* dest, Node* dest_offset,
279 Node* copy_length,
280 bool disjoint_bases,
281 bool length_never_negative,
282 RegionNode* slow_region) {
283 if (slow_region == NULL) {
284 slow_region = new RegionNode(1);
285 transform_later(slow_region);
286 }
287
288 Node* original_dest = dest;
289 bool dest_uninitialized = false;
290
291 // See if this is the initialization of a newly-allocated array.
292 // If so, we will take responsibility here for initializing it to zero.
293 // (Note: Because tightly_coupled_allocation performs checks on the
294 // out-edges of the dest, we need to avoid making derived pointers
295 // from it until we have checked its uses.)
296 if (ReduceBulkZeroing
297 && !ZeroTLAB // pointless if already zeroed
298 && basic_elem_type != T_CONFLICT // avoid corner case
299 && !src->eqv_uncast(dest)
300 && alloc != NULL
301 && _igvn.find_int_con(alloc->in(AllocateNode::ALength), 1) > 0
302 && alloc->maybe_set_complete(&_igvn)) {
303 // "You break it, you buy it."
304 InitializeNode* init = alloc->initialization();
305 assert(init->is_complete(), "we just did this");
306 init->set_complete_with_arraycopy();
307 assert(dest->is_CheckCastPP(), "sanity");
308 assert(dest->in(0)->in(0) == init, "dest pinned");
309 adr_type = TypeRawPtr::BOTTOM; // all initializations are into raw memory
310 // From this point on, every exit path is responsible for
311 // initializing any non-copied parts of the object to zero.
312 // Also, if this flag is set we make sure that arraycopy interacts properly
313 // with G1, eliding pre-barriers. See CR 6627983.
314 dest_uninitialized = true;
315 } else {
316 // No zeroing elimination here.
317 alloc = NULL;
318 //original_dest = dest;
319 //dest_uninitialized = false;
320 }
321
322 uint alias_idx = C->get_alias_index(adr_type);
323
324 // Results are placed here:
325 enum { fast_path = 1, // normal void-returning assembly stub
326 checked_path = 2, // special assembly stub with cleanup
327 slow_call_path = 3, // something went wrong; call the VM
328 zero_path = 4, // bypass when length of copy is zero
329 bcopy_path = 5, // copy primitive array by 64-bit blocks
330 PATH_LIMIT = 6
331 };
332 RegionNode* result_region = new RegionNode(PATH_LIMIT);
333 PhiNode* result_i_o = new PhiNode(result_region, Type::ABIO);
334 PhiNode* result_memory = new PhiNode(result_region, Type::MEMORY, adr_type);
335 assert(adr_type != TypePtr::BOTTOM, "must be RawMem or a T[] slice");
336 transform_later(result_region);
337 transform_later(result_i_o);
338 transform_later(result_memory);
339
340 // The slow_control path:
341 Node* slow_control;
342 Node* slow_i_o = *io;
343 Node* slow_mem = mem->memory_at(alias_idx);
344 DEBUG_ONLY(slow_control = (Node*) badAddress);
345
346 // Checked control path:
347 Node* checked_control = top();
348 Node* checked_mem = NULL;
349 Node* checked_i_o = NULL;
350 Node* checked_value = NULL;
351
352 if (basic_elem_type == T_CONFLICT) {
353 assert(!dest_uninitialized, "");
354 Node* cv = generate_generic_arraycopy(ctrl, &mem,
355 adr_type,
356 src, src_offset, dest, dest_offset,
357 copy_length, dest_uninitialized);
358 if (cv == NULL) cv = intcon(-1); // failure (no stub available)
359 checked_control = *ctrl;
360 checked_i_o = *io;
361 checked_mem = mem->memory_at(alias_idx);
362 checked_value = cv;
363 *ctrl = top();
364 }
365
366 Node* not_pos = generate_nonpositive_guard(ctrl, copy_length, length_never_negative);
367 if (not_pos != NULL) {
368 Node* local_ctrl = not_pos, *local_io = *io;
369 MergeMemNode* local_mem = MergeMemNode::make(mem);
370 transform_later(local_mem);
371
372 // (6) length must not be negative.
373 if (!length_never_negative) {
374 generate_negative_guard(&local_ctrl, copy_length, slow_region);
375 }
376
377 // copy_length is 0.
378 if (dest_uninitialized) {
379 assert(!local_ctrl->is_top(), "no ctrl?");
380 Node* dest_length = alloc->in(AllocateNode::ALength);
381 if (copy_length->eqv_uncast(dest_length)
382 || _igvn.find_int_con(dest_length, 1) <= 0) {
383 // There is no zeroing to do. No need for a secondary raw memory barrier.
384 } else {
385 // Clear the whole thing since there are no source elements to copy.
386 generate_clear_array(local_ctrl, local_mem,
387 adr_type, dest, basic_elem_type,
388 intcon(0), NULL,
389 alloc->in(AllocateNode::AllocSize));
390 // Use a secondary InitializeNode as raw memory barrier.
391 // Currently it is needed only on this path since other
392 // paths have stub or runtime calls as raw memory barriers.
393 MemBarNode* mb = MemBarNode::make(C, Op_Initialize,
394 Compile::AliasIdxRaw,
395 top());
396 transform_later(mb);
397 mb->set_req(TypeFunc::Control,local_ctrl);
398 mb->set_req(TypeFunc::Memory, local_mem->memory_at(Compile::AliasIdxRaw));
399 local_ctrl = transform_later(new ProjNode(mb, TypeFunc::Control));
400 local_mem->set_memory_at(Compile::AliasIdxRaw, transform_later(new ProjNode(mb, TypeFunc::Memory)));
401
402 InitializeNode* init = mb->as_Initialize();
403 init->set_complete(&_igvn); // (there is no corresponding AllocateNode)
404 }
405 }
406
407 // Present the results of the fast call.
408 result_region->init_req(zero_path, local_ctrl);
409 result_i_o ->init_req(zero_path, local_io);
410 result_memory->init_req(zero_path, local_mem->memory_at(alias_idx));
411 }
412
413 if (!(*ctrl)->is_top() && dest_uninitialized) {
414 // We have to initialize the *uncopied* part of the array to zero.
415 // The copy destination is the slice dest[off..off+len]. The other slices
416 // are dest_head = dest[0..off] and dest_tail = dest[off+len..dest.length].
417 Node* dest_size = alloc->in(AllocateNode::AllocSize);
418 Node* dest_length = alloc->in(AllocateNode::ALength);
419 Node* dest_tail = transform_later( new AddINode(dest_offset, copy_length));
420
421 // If there is a head section that needs zeroing, do it now.
422 if (_igvn.find_int_con(dest_offset, -1) != 0) {
423 generate_clear_array(*ctrl, mem,
424 adr_type, dest, basic_elem_type,
425 intcon(0), dest_offset,
426 NULL);
427 }
428
429 // Next, perform a dynamic check on the tail length.
430 // It is often zero, and we can win big if we prove this.
431 // There are two wins: Avoid generating the ClearArray
432 // with its attendant messy index arithmetic, and upgrade
433 // the copy to a more hardware-friendly word size of 64 bits.
434 Node* tail_ctl = NULL;
435 if (!(*ctrl)->is_top() && !dest_tail->eqv_uncast(dest_length)) {
436 Node* cmp_lt = transform_later( new CmpINode(dest_tail, dest_length) );
437 Node* bol_lt = transform_later( new BoolNode(cmp_lt, BoolTest::lt) );
438 tail_ctl = generate_slow_guard(ctrl, bol_lt, NULL);
439 assert(tail_ctl != NULL || !(*ctrl)->is_top(), "must be an outcome");
440 }
441
442 // At this point, let's assume there is no tail.
443 if (!(*ctrl)->is_top() && alloc != NULL && basic_elem_type != T_OBJECT) {
444 // There is no tail. Try an upgrade to a 64-bit copy.
445 bool didit = false;
446 {
447 Node* local_ctrl = *ctrl, *local_io = *io;
448 MergeMemNode* local_mem = MergeMemNode::make(mem);
449 transform_later(local_mem);
450
451 didit = generate_block_arraycopy(&local_ctrl, &local_mem, local_io,
452 adr_type, basic_elem_type, alloc,
453 src, src_offset, dest, dest_offset,
454 dest_size, dest_uninitialized);
455 if (didit) {
456 // Present the results of the block-copying fast call.
457 result_region->init_req(bcopy_path, local_ctrl);
458 result_i_o ->init_req(bcopy_path, local_io);
459 result_memory->init_req(bcopy_path, local_mem->memory_at(alias_idx));
460 }
461 }
462 if (didit) {
463 *ctrl = top(); // no regular fast path
464 }
465 }
466
467 // Clear the tail, if any.
468 if (tail_ctl != NULL) {
469 Node* notail_ctl = (*ctrl)->is_top() ? NULL : *ctrl;
470 *ctrl = tail_ctl;
471 if (notail_ctl == NULL) {
472 generate_clear_array(*ctrl, mem,
473 adr_type, dest, basic_elem_type,
474 dest_tail, NULL,
475 dest_size);
476 } else {
477 // Make a local merge.
478 Node* done_ctl = transform_later(new RegionNode(3));
479 Node* done_mem = transform_later(new PhiNode(done_ctl, Type::MEMORY, adr_type));
480 done_ctl->init_req(1, notail_ctl);
481 done_mem->init_req(1, mem->memory_at(alias_idx));
482 generate_clear_array(*ctrl, mem,
483 adr_type, dest, basic_elem_type,
484 dest_tail, NULL,
485 dest_size);
486 done_ctl->init_req(2, *ctrl);
487 done_mem->init_req(2, mem->memory_at(alias_idx));
488 *ctrl = done_ctl;
489 mem->set_memory_at(alias_idx, done_mem);
490 }
491 }
492 }
493
494 BasicType copy_type = basic_elem_type;
495 assert(basic_elem_type != T_ARRAY, "caller must fix this");
496 if (!(*ctrl)->is_top() && copy_type == T_OBJECT) {
497 // If src and dest have compatible element types, we can copy bits.
498 // Types S[] and D[] are compatible if D is a supertype of S.
499 //
500 // If they are not, we will use checked_oop_disjoint_arraycopy,
501 // which performs a fast optimistic per-oop check, and backs off
502 // further to JVM_ArrayCopy on the first per-oop check that fails.
503 // (Actually, we don't move raw bits only; the GC requires card marks.)
504
505 // Get the klass* for both src and dest
506 Node* src_klass = ac->in(ArrayCopyNode::SrcKlass);
507 Node* dest_klass = ac->in(ArrayCopyNode::DestKlass);
508
509 assert(src_klass != NULL && dest_klass != NULL, "should have klasses");
510
511 // Generate the subtype check.
512 // This might fold up statically, or then again it might not.
513 //
514 // Non-static example: Copying List<String>.elements to a new String[].
515 // The backing store for a List<String> is always an Object[],
516 // but its elements are always type String, if the generic types
517 // are correct at the source level.
518 //
519 // Test S[] against D[], not S against D, because (probably)
520 // the secondary supertype cache is less busy for S[] than S.
521 // This usually only matters when D is an interface.
522 Node* not_subtype_ctrl = ac->is_arraycopy_validated() ? top() :
523 Phase::gen_subtype_check(src_klass, dest_klass, ctrl, mem, &_igvn);
524 // Plug failing path into checked_oop_disjoint_arraycopy
525 if (not_subtype_ctrl != top()) {
526 Node* local_ctrl = not_subtype_ctrl;
527 MergeMemNode* local_mem = MergeMemNode::make(mem);
528 transform_later(local_mem);
529
530 // (At this point we can assume disjoint_bases, since types differ.)
531 int ek_offset = in_bytes(ObjArrayKlass::element_klass_offset());
532 Node* p1 = basic_plus_adr(dest_klass, ek_offset);
533 Node* n1 = LoadKlassNode::make(_igvn, C->immutable_memory(), p1, TypeRawPtr::BOTTOM);
534 Node* dest_elem_klass = transform_later(n1);
535 Node* cv = generate_checkcast_arraycopy(&local_ctrl, &local_mem,
536 adr_type,
537 dest_elem_klass,
538 src, src_offset, dest, dest_offset,
539 ConvI2X(copy_length), dest_uninitialized);
540 if (cv == NULL) cv = intcon(-1); // failure (no stub available)
541 checked_control = local_ctrl;
542 checked_i_o = *io;
543 checked_mem = local_mem->memory_at(alias_idx);
544 checked_value = cv;
545 }
546 // At this point we know we do not need type checks on oop stores.
547
548 // Let's see if we need card marks:
549 if (alloc != NULL && GraphKit::use_ReduceInitialCardMarks()) {
550 // If we do not need card marks, copy using the jint or jlong stub.
551 copy_type = LP64_ONLY(UseCompressedOops ? T_INT : T_LONG) NOT_LP64(T_INT);
552 assert(type2aelembytes(basic_elem_type) == type2aelembytes(copy_type),
553 "sizes agree");
554 }
555 }
556
557 if (!(*ctrl)->is_top()) {
558 // Generate the fast path, if possible.
559 Node* local_ctrl = *ctrl;
560 MergeMemNode* local_mem = MergeMemNode::make(mem);
561 transform_later(local_mem);
562
563 generate_unchecked_arraycopy(&local_ctrl, &local_mem,
564 adr_type, copy_type, disjoint_bases,
565 src, src_offset, dest, dest_offset,
566 ConvI2X(copy_length), dest_uninitialized);
567
568 // Present the results of the fast call.
569 result_region->init_req(fast_path, local_ctrl);
570 result_i_o ->init_req(fast_path, *io);
571 result_memory->init_req(fast_path, local_mem->memory_at(alias_idx));
572 }
573
574 // Here are all the slow paths up to this point, in one bundle:
575 assert(slow_region != NULL, "allocated on entry");
576 slow_control = slow_region;
577 DEBUG_ONLY(slow_region = (RegionNode*)badAddress);
578
579 *ctrl = checked_control;
580 if (!(*ctrl)->is_top()) {
581 // Clean up after the checked call.
582 // The returned value is either 0 or -1^K,
583 // where K = number of partially transferred array elements.
584 Node* cmp = new CmpINode(checked_value, intcon(0));
585 transform_later(cmp);
586 Node* bol = new BoolNode(cmp, BoolTest::eq);
587 transform_later(bol);
588 IfNode* iff = new IfNode(*ctrl, bol, PROB_MAX, COUNT_UNKNOWN);
589 transform_later(iff);
590
591 // If it is 0, we are done, so transfer to the end.
592 Node* checks_done = new IfTrueNode(iff);
593 transform_later(checks_done);
594 result_region->init_req(checked_path, checks_done);
595 result_i_o ->init_req(checked_path, checked_i_o);
596 result_memory->init_req(checked_path, checked_mem);
597
598 // If it is not zero, merge into the slow call.
599 *ctrl = new IfFalseNode(iff);
600 transform_later(*ctrl);
601 RegionNode* slow_reg2 = new RegionNode(3);
602 PhiNode* slow_i_o2 = new PhiNode(slow_reg2, Type::ABIO);
603 PhiNode* slow_mem2 = new PhiNode(slow_reg2, Type::MEMORY, adr_type);
604 transform_later(slow_reg2);
605 transform_later(slow_i_o2);
606 transform_later(slow_mem2);
607 slow_reg2 ->init_req(1, slow_control);
608 slow_i_o2 ->init_req(1, slow_i_o);
609 slow_mem2 ->init_req(1, slow_mem);
610 slow_reg2 ->init_req(2, *ctrl);
611 slow_i_o2 ->init_req(2, checked_i_o);
612 slow_mem2 ->init_req(2, checked_mem);
613
614 slow_control = slow_reg2;
615 slow_i_o = slow_i_o2;
616 slow_mem = slow_mem2;
617
618 if (alloc != NULL) {
619 // We'll restart from the very beginning, after zeroing the whole thing.
620 // This can cause double writes, but that's OK since dest is brand new.
621 // So we ignore the low 31 bits of the value returned from the stub.
622 } else {
623 // We must continue the copy exactly where it failed, or else
624 // another thread might see the wrong number of writes to dest.
625 Node* checked_offset = new XorINode(checked_value, intcon(-1));
626 Node* slow_offset = new PhiNode(slow_reg2, TypeInt::INT);
627 transform_later(checked_offset);
628 transform_later(slow_offset);
629 slow_offset->init_req(1, intcon(0));
630 slow_offset->init_req(2, checked_offset);
631
632 // Adjust the arguments by the conditionally incoming offset.
633 Node* src_off_plus = new AddINode(src_offset, slow_offset);
634 transform_later(src_off_plus);
635 Node* dest_off_plus = new AddINode(dest_offset, slow_offset);
636 transform_later(dest_off_plus);
637 Node* length_minus = new SubINode(copy_length, slow_offset);
638 transform_later(length_minus);
639
640 // Tweak the node variables to adjust the code produced below:
641 src_offset = src_off_plus;
642 dest_offset = dest_off_plus;
643 copy_length = length_minus;
644 }
645 }
646 *ctrl = slow_control;
647 if (!(*ctrl)->is_top()) {
648 Node* local_ctrl = *ctrl, *local_io = slow_i_o;
649 MergeMemNode* local_mem = MergeMemNode::make(mem);
650 transform_later(local_mem);
651
652 // Generate the slow path, if needed.
653 local_mem->set_memory_at(alias_idx, slow_mem);
654
655 if (dest_uninitialized) {
656 generate_clear_array(local_ctrl, local_mem,
657 adr_type, dest, basic_elem_type,
658 intcon(0), NULL,
659 alloc->in(AllocateNode::AllocSize));
660 }
661
662 local_mem = generate_slow_arraycopy(ac,
663 &local_ctrl, local_mem, &local_io,
664 adr_type,
665 src, src_offset, dest, dest_offset,
666 copy_length, /*dest_uninitialized*/false);
667
668 result_region->init_req(slow_call_path, local_ctrl);
669 result_i_o ->init_req(slow_call_path, local_io);
670 result_memory->init_req(slow_call_path, local_mem->memory_at(alias_idx));
671 } else {
672 ShouldNotReachHere(); // no call to generate_slow_arraycopy:
673 // projections were not extracted
674 }
675
676 // Remove unused edges.
677 for (uint i = 1; i < result_region->req(); i++) {
678 if (result_region->in(i) == NULL) {
679 result_region->init_req(i, top());
680 }
681 }
682
683 // Finished; return the combined state.
684 *ctrl = result_region;
685 *io = result_i_o;
686 mem->set_memory_at(alias_idx, result_memory);
687
688 // mem no longer guaranteed to stay a MergeMemNode
689 Node* out_mem = mem;
690 DEBUG_ONLY(mem = NULL);
691
692 // The memory edges above are precise in order to model effects around
693 // array copies accurately to allow value numbering of field loads around
694 // arraycopy. Such field loads, both before and after, are common in Java
695 // collections and similar classes involving header/array data structures.
696 //
697 // But with low number of register or when some registers are used or killed
698 // by arraycopy calls it causes registers spilling on stack. See 6544710.
699 // The next memory barrier is added to avoid it. If the arraycopy can be
700 // optimized away (which it can, sometimes) then we can manually remove
701 // the membar also.
702 //
703 // Do not let reads from the cloned object float above the arraycopy.
704 if (alloc != NULL && !alloc->initialization()->does_not_escape()) {
705 // Do not let stores that initialize this object be reordered with
706 // a subsequent store that would make this object accessible by
707 // other threads.
708 insert_mem_bar(ctrl, &out_mem, Op_MemBarStoreStore);
709 } else if (InsertMemBarAfterArraycopy) {
710 insert_mem_bar(ctrl, &out_mem, Op_MemBarCPUOrder);
711 }
712
713 _igvn.replace_node(_memproj_fallthrough, out_mem);
714 _igvn.replace_node(_ioproj_fallthrough, *io);
715 _igvn.replace_node(_fallthroughcatchproj, *ctrl);
716
717 return out_mem;
718 }
719
720 // Helper for initialization of arrays, creating a ClearArray.
721 // It writes zero bits in [start..end), within the body of an array object.
722 // The memory effects are all chained onto the 'adr_type' alias category.
723 //
724 // Since the object is otherwise uninitialized, we are free
725 // to put a little "slop" around the edges of the cleared area,
726 // as long as it does not go back into the array's header,
727 // or beyond the array end within the heap.
728 //
729 // The lower edge can be rounded down to the nearest jint and the
730 // upper edge can be rounded up to the nearest MinObjAlignmentInBytes.
731 //
732 // Arguments:
733 // adr_type memory slice where writes are generated
734 // dest oop of the destination array
735 // basic_elem_type element type of the destination
736 // slice_idx array index of first element to store
737 // slice_len number of elements to store (or NULL)
738 // dest_size total size in bytes of the array object
739 //
740 // Exactly one of slice_len or dest_size must be non-NULL.
741 // If dest_size is non-NULL, zeroing extends to the end of the object.
742 // If slice_len is non-NULL, the slice_idx value must be a constant.
743 void PhaseMacroExpand::generate_clear_array(Node* ctrl, MergeMemNode* merge_mem,
744 const TypePtr* adr_type,
745 Node* dest,
746 BasicType basic_elem_type,
747 Node* slice_idx,
748 Node* slice_len,
749 Node* dest_size) {
750 // one or the other but not both of slice_len and dest_size:
751 assert((slice_len != NULL? 1: 0) + (dest_size != NULL? 1: 0) == 1, "");
752 if (slice_len == NULL) slice_len = top();
753 if (dest_size == NULL) dest_size = top();
754
755 uint alias_idx = C->get_alias_index(adr_type);
756
757 // operate on this memory slice:
758 Node* mem = merge_mem->memory_at(alias_idx); // memory slice to operate on
759
760 // scaling and rounding of indexes:
761 int scale = exact_log2(type2aelembytes(basic_elem_type));
762 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
763 int clear_low = (-1 << scale) & (BytesPerInt - 1);
764 int bump_bit = (-1 << scale) & BytesPerInt;
765
766 // determine constant starts and ends
767 const intptr_t BIG_NEG = -128;
768 assert(BIG_NEG + 2*abase < 0, "neg enough");
769 intptr_t slice_idx_con = (intptr_t) _igvn.find_int_con(slice_idx, BIG_NEG);
770 intptr_t slice_len_con = (intptr_t) _igvn.find_int_con(slice_len, BIG_NEG);
771 if (slice_len_con == 0) {
772 return; // nothing to do here
773 }
774 intptr_t start_con = (abase + (slice_idx_con << scale)) & ~clear_low;
775 intptr_t end_con = _igvn.find_intptr_t_con(dest_size, -1);
776 if (slice_idx_con >= 0 && slice_len_con >= 0) {
777 assert(end_con < 0, "not two cons");
778 end_con = round_to(abase + ((slice_idx_con + slice_len_con) << scale),
779 BytesPerLong);
780 }
781
782 if (start_con >= 0 && end_con >= 0) {
783 // Constant start and end. Simple.
784 mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
785 start_con, end_con, &_igvn);
786 } else if (start_con >= 0 && dest_size != top()) {
787 // Constant start, pre-rounded end after the tail of the array.
788 Node* end = dest_size;
789 mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
790 start_con, end, &_igvn);
791 } else if (start_con >= 0 && slice_len != top()) {
792 // Constant start, non-constant end. End needs rounding up.
793 // End offset = round_up(abase + ((slice_idx_con + slice_len) << scale), 8)
794 intptr_t end_base = abase + (slice_idx_con << scale);
795 int end_round = (-1 << scale) & (BytesPerLong - 1);
796 Node* end = ConvI2X(slice_len);
797 if (scale != 0)
798 end = transform_later(new LShiftXNode(end, intcon(scale) ));
799 end_base += end_round;
800 end = transform_later(new AddXNode(end, MakeConX(end_base)) );
801 end = transform_later(new AndXNode(end, MakeConX(~end_round)) );
802 mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
803 start_con, end, &_igvn);
804 } else if (start_con < 0 && dest_size != top()) {
805 // Non-constant start, pre-rounded end after the tail of the array.
806 // This is almost certainly a "round-to-end" operation.
807 Node* start = slice_idx;
808 start = ConvI2X(start);
809 if (scale != 0)
810 start = transform_later(new LShiftXNode( start, intcon(scale) ));
811 start = transform_later(new AddXNode(start, MakeConX(abase)) );
812 if ((bump_bit | clear_low) != 0) {
813 int to_clear = (bump_bit | clear_low);
814 // Align up mod 8, then store a jint zero unconditionally
815 // just before the mod-8 boundary.
816 if (((abase + bump_bit) & ~to_clear) - bump_bit
817 < arrayOopDesc::length_offset_in_bytes() + BytesPerInt) {
818 bump_bit = 0;
819 assert((abase & to_clear) == 0, "array base must be long-aligned");
820 } else {
821 // Bump 'start' up to (or past) the next jint boundary:
822 start = transform_later( new AddXNode(start, MakeConX(bump_bit)) );
823 assert((abase & clear_low) == 0, "array base must be int-aligned");
824 }
825 // Round bumped 'start' down to jlong boundary in body of array.
826 start = transform_later(new AndXNode(start, MakeConX(~to_clear)) );
827 if (bump_bit != 0) {
828 // Store a zero to the immediately preceding jint:
829 Node* x1 = transform_later(new AddXNode(start, MakeConX(-bump_bit)) );
830 Node* p1 = basic_plus_adr(dest, x1);
831 mem = StoreNode::make(_igvn, ctrl, mem, p1, adr_type, intcon(0), T_INT, MemNode::unordered);
832 mem = transform_later(mem);
833 }
834 }
835 Node* end = dest_size; // pre-rounded
836 mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
837 start, end, &_igvn);
838 } else {
839 // Non-constant start, unrounded non-constant end.
840 // (Nobody zeroes a random midsection of an array using this routine.)
841 ShouldNotReachHere(); // fix caller
842 }
843
844 // Done.
845 merge_mem->set_memory_at(alias_idx, mem);
846 }
847
848 bool PhaseMacroExpand::generate_block_arraycopy(Node** ctrl, MergeMemNode** mem, Node* io,
849 const TypePtr* adr_type,
850 BasicType basic_elem_type,
851 AllocateNode* alloc,
852 Node* src, Node* src_offset,
853 Node* dest, Node* dest_offset,
854 Node* dest_size, bool dest_uninitialized) {
855 // See if there is an advantage from block transfer.
856 int scale = exact_log2(type2aelembytes(basic_elem_type));
857 if (scale >= LogBytesPerLong)
858 return false; // it is already a block transfer
859
860 // Look at the alignment of the starting offsets.
861 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
862
863 intptr_t src_off_con = (intptr_t) _igvn.find_int_con(src_offset, -1);
864 intptr_t dest_off_con = (intptr_t) _igvn.find_int_con(dest_offset, -1);
865 if (src_off_con < 0 || dest_off_con < 0) {
866 // At present, we can only understand constants.
867 return false;
868 }
869
870 intptr_t src_off = abase + (src_off_con << scale);
871 intptr_t dest_off = abase + (dest_off_con << scale);
872
873 if (((src_off | dest_off) & (BytesPerLong-1)) != 0) {
874 // Non-aligned; too bad.
875 // One more chance: Pick off an initial 32-bit word.
876 // This is a common case, since abase can be odd mod 8.
877 if (((src_off | dest_off) & (BytesPerLong-1)) == BytesPerInt &&
878 ((src_off ^ dest_off) & (BytesPerLong-1)) == 0) {
879 Node* sptr = basic_plus_adr(src, src_off);
880 Node* dptr = basic_plus_adr(dest, dest_off);
881 uint alias_idx = C->get_alias_index(adr_type);
882 Node* sval = transform_later(LoadNode::make(_igvn, *ctrl, (*mem)->memory_at(alias_idx), sptr, adr_type, TypeInt::INT, T_INT, MemNode::unordered));
883 Node* st = transform_later(StoreNode::make(_igvn, *ctrl, (*mem)->memory_at(alias_idx), dptr, adr_type, sval, T_INT, MemNode::unordered));
884 (*mem)->set_memory_at(alias_idx, st);
885 src_off += BytesPerInt;
886 dest_off += BytesPerInt;
887 } else {
888 return false;
889 }
890 }
891 assert(src_off % BytesPerLong == 0, "");
892 assert(dest_off % BytesPerLong == 0, "");
893
894 // Do this copy by giant steps.
895 Node* sptr = basic_plus_adr(src, src_off);
896 Node* dptr = basic_plus_adr(dest, dest_off);
897 Node* countx = dest_size;
898 countx = transform_later(new SubXNode(countx, MakeConX(dest_off)));
899 countx = transform_later(new URShiftXNode(countx, intcon(LogBytesPerLong)));
900
901 bool disjoint_bases = true; // since alloc != NULL
902 generate_unchecked_arraycopy(ctrl, mem,
903 adr_type, T_LONG, disjoint_bases,
904 sptr, NULL, dptr, NULL, countx, dest_uninitialized);
905
906 return true;
907 }
908
909 // Helper function; generates code for the slow case.
910 // We make a call to a runtime method which emulates the native method,
911 // but without the native wrapper overhead.
912 MergeMemNode* PhaseMacroExpand::generate_slow_arraycopy(ArrayCopyNode *ac,
913 Node** ctrl, Node* mem, Node** io,
914 const TypePtr* adr_type,
915 Node* src, Node* src_offset,
916 Node* dest, Node* dest_offset,
917 Node* copy_length, bool dest_uninitialized) {
918 assert(!dest_uninitialized, "Invariant");
919
920 const TypeFunc* call_type = OptoRuntime::slow_arraycopy_Type();
921 CallNode* call = new CallStaticJavaNode(call_type, OptoRuntime::slow_arraycopy_Java(),
922 "slow_arraycopy",
923 ac->jvms()->bci(), TypePtr::BOTTOM);
924
925 call->init_req(TypeFunc::Control, *ctrl);
926 call->init_req(TypeFunc::I_O , *io);
927 call->init_req(TypeFunc::Memory , mem);
928 call->init_req(TypeFunc::ReturnAdr, top());
929 call->init_req(TypeFunc::FramePtr, top());
930 call->init_req(TypeFunc::Parms+0, src);
931 call->init_req(TypeFunc::Parms+1, src_offset);
932 call->init_req(TypeFunc::Parms+2, dest);
933 call->init_req(TypeFunc::Parms+3, dest_offset);
934 call->init_req(TypeFunc::Parms+4, copy_length);
935 copy_call_debug_info(ac, call);
936
937 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
938 _igvn.replace_node(ac, call);
939 transform_later(call);
940
941 extract_call_projections(call);
942 *ctrl = _fallthroughcatchproj->clone();
943 transform_later(*ctrl);
944
945 Node* m = _memproj_fallthrough->clone();
946 transform_later(m);
947
948 uint alias_idx = C->get_alias_index(adr_type);
949 MergeMemNode* out_mem;
950 if (alias_idx != Compile::AliasIdxBot) {
951 out_mem = MergeMemNode::make(mem);
952 out_mem->set_memory_at(alias_idx, m);
953 } else {
954 out_mem = MergeMemNode::make(m);
955 }
956 transform_later(out_mem);
957
958 *io = _ioproj_fallthrough->clone();
959 transform_later(*io);
960
961 return out_mem;
962 }
963
964 // Helper function; generates code for cases requiring runtime checks.
965 Node* PhaseMacroExpand::generate_checkcast_arraycopy(Node** ctrl, MergeMemNode** mem,
966 const TypePtr* adr_type,
967 Node* dest_elem_klass,
968 Node* src, Node* src_offset,
969 Node* dest, Node* dest_offset,
970 Node* copy_length, bool dest_uninitialized) {
971 if ((*ctrl)->is_top()) return NULL;
972
973 address copyfunc_addr = StubRoutines::checkcast_arraycopy(dest_uninitialized);
974 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path.
975 return NULL;
976 }
977
978 // Pick out the parameters required to perform a store-check
979 // for the target array. This is an optimistic check. It will
980 // look in each non-null element's class, at the desired klass's
981 // super_check_offset, for the desired klass.
982 int sco_offset = in_bytes(Klass::super_check_offset_offset());
983 Node* p3 = basic_plus_adr(dest_elem_klass, sco_offset);
984 Node* n3 = new LoadINode(NULL, *mem /*memory(p3)*/, p3, _igvn.type(p3)->is_ptr(), TypeInt::INT, MemNode::unordered);
985 Node* check_offset = ConvI2X(transform_later(n3));
986 Node* check_value = dest_elem_klass;
987
988 Node* src_start = array_element_address(src, src_offset, T_OBJECT);
989 Node* dest_start = array_element_address(dest, dest_offset, T_OBJECT);
990
991 const TypeFunc* call_type = OptoRuntime::checkcast_arraycopy_Type();
992 Node* call = make_leaf_call(*ctrl, *mem, call_type, copyfunc_addr, "checkcast_arraycopy", adr_type,
993 src_start, dest_start, copy_length XTOP, check_offset XTOP, check_value);
994
995 finish_arraycopy_call(call, ctrl, mem, adr_type);
996
997 Node* proj = new ProjNode(call, TypeFunc::Parms);
998 transform_later(proj);
999
1000 return proj;
1001 }
1002
1003 // Helper function; generates code for cases requiring runtime checks.
1004 Node* PhaseMacroExpand::generate_generic_arraycopy(Node** ctrl, MergeMemNode** mem,
1005 const TypePtr* adr_type,
1006 Node* src, Node* src_offset,
1007 Node* dest, Node* dest_offset,
1008 Node* copy_length, bool dest_uninitialized) {
1009 if ((*ctrl)->is_top()) return NULL;
1010 assert(!dest_uninitialized, "Invariant");
1011
1012 address copyfunc_addr = StubRoutines::generic_arraycopy();
1013 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path.
1014 return NULL;
1015 }
1016
1017 const TypeFunc* call_type = OptoRuntime::generic_arraycopy_Type();
1018 Node* call = make_leaf_call(*ctrl, *mem, call_type, copyfunc_addr, "generic_arraycopy", adr_type,
1019 src, src_offset, dest, dest_offset, copy_length);
1020
1021 finish_arraycopy_call(call, ctrl, mem, adr_type);
1022
1023 Node* proj = new ProjNode(call, TypeFunc::Parms);
1024 transform_later(proj);
1025
1026 return proj;
1027 }
1028
1029 // Helper function; generates the fast out-of-line call to an arraycopy stub.
1030 void PhaseMacroExpand::generate_unchecked_arraycopy(Node** ctrl, MergeMemNode** mem,
1031 const TypePtr* adr_type,
1032 BasicType basic_elem_type,
1033 bool disjoint_bases,
1034 Node* src, Node* src_offset,
1035 Node* dest, Node* dest_offset,
1036 Node* copy_length, bool dest_uninitialized) {
1037 if ((*ctrl)->is_top()) return;
1038
1039 Node* src_start = src;
1040 Node* dest_start = dest;
1041 if (src_offset != NULL || dest_offset != NULL) {
1042 src_start = array_element_address(src, src_offset, basic_elem_type);
1043 dest_start = array_element_address(dest, dest_offset, basic_elem_type);
1044 }
1045
1046 // Figure out which arraycopy runtime method to call.
1047 const char* copyfunc_name = "arraycopy";
1048 address copyfunc_addr =
1049 basictype2arraycopy(basic_elem_type, src_offset, dest_offset,
1050 disjoint_bases, copyfunc_name, dest_uninitialized);
1051
1052 const TypeFunc* call_type = OptoRuntime::fast_arraycopy_Type();
1053 Node* call = make_leaf_call(*ctrl, *mem, call_type, copyfunc_addr, copyfunc_name, adr_type,
1054 src_start, dest_start, copy_length XTOP);
1055
1056 finish_arraycopy_call(call, ctrl, mem, adr_type);
1057 }
1058
1059 void PhaseMacroExpand::expand_arraycopy_node(ArrayCopyNode *ac) {
1060 Node* ctrl = ac->in(TypeFunc::Control);
1061 Node* io = ac->in(TypeFunc::I_O);
1062 Node* src = ac->in(ArrayCopyNode::Src);
1063 Node* src_offset = ac->in(ArrayCopyNode::SrcPos);
1064 Node* dest = ac->in(ArrayCopyNode::Dest);
1065 Node* dest_offset = ac->in(ArrayCopyNode::DestPos);
1066 Node* length = ac->in(ArrayCopyNode::Length);
1067 MergeMemNode* merge_mem = NULL;
1068
1069 if (ac->is_clonebasic()) {
1070 assert (src_offset == NULL && dest_offset == NULL, "for clone offsets should be null");
1071 Node* mem = ac->in(TypeFunc::Memory);
1072 const char* copyfunc_name = "arraycopy";
1073 address copyfunc_addr =
1074 basictype2arraycopy(T_LONG, NULL, NULL,
1075 true, copyfunc_name, true);
1076
1077 const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
1078 const TypeFunc* call_type = OptoRuntime::fast_arraycopy_Type();
1079
1080 Node* call = make_leaf_call(ctrl, mem, call_type, copyfunc_addr, copyfunc_name, raw_adr_type, src, dest, length XTOP);
1081 transform_later(call);
1082
1083 _igvn.replace_node(ac, call);
1084 return;
1085 } else if (ac->is_copyof() || ac->is_copyofrange() || ac->is_cloneoop()) {
1086 Node* mem = ac->in(TypeFunc::Memory);
1087 merge_mem = MergeMemNode::make(mem);
1088 transform_later(merge_mem);
1089
1090 RegionNode* slow_region = new RegionNode(1);
1091 transform_later(slow_region);
1092
1093 AllocateArrayNode* alloc = NULL;
1094 if (ac->is_alloc_tightly_coupled()) {
1095 alloc = AllocateArrayNode::Ideal_array_allocation(dest, &_igvn);
1096 assert(alloc != NULL, "expect alloc");
1097 }
1098
1099 generate_arraycopy(ac, alloc, &ctrl, merge_mem, &io,
1100 TypeAryPtr::OOPS, T_OBJECT,
1101 src, src_offset, dest, dest_offset, length,
1102 true, !ac->is_copyofrange());
1103
1104 return;
1105 }
1106
1107 AllocateArrayNode* alloc = NULL;
1108 if (ac->is_alloc_tightly_coupled()) {
1109 alloc = AllocateArrayNode::Ideal_array_allocation(dest, &_igvn);
1110 assert(alloc != NULL, "expect alloc");
1111 }
1112
1113 assert(ac->is_arraycopy() || ac->is_arraycopy_validated(), "should be an arraycopy");
1114
1115 // Compile time checks. If any of these checks cannot be verified at compile time,
1116 // we do not make a fast path for this call. Instead, we let the call remain as it
1117 // is. The checks we choose to mandate at compile time are:
1118 //
1119 // (1) src and dest are arrays.
1120 const Type* src_type = src->Value(&_igvn);
1121 const Type* dest_type = dest->Value(&_igvn);
1122 const TypeAryPtr* top_src = src_type->isa_aryptr();
1123 const TypeAryPtr* top_dest = dest_type->isa_aryptr();
1124
1125 if (top_src == NULL || top_src->klass() == NULL ||
1126 top_dest == NULL || top_dest->klass() == NULL) {
1127 // Conservatively insert a memory barrier on all memory slices.
1128 // Do not let writes into the source float below the arraycopy.
1129 {
1130 Node* mem = ac->in(TypeFunc::Memory);
1131 insert_mem_bar(&ctrl, &mem, Op_MemBarCPUOrder);
1132
1133 merge_mem = MergeMemNode::make(mem);
1134 transform_later(merge_mem);
1135 }
1136
1137 // Call StubRoutines::generic_arraycopy stub.
1138 Node* mem = generate_arraycopy(ac, NULL, &ctrl, merge_mem, &io,
1139 TypeRawPtr::BOTTOM, T_CONFLICT,
1140 src, src_offset, dest, dest_offset, length);
1141
1142 // Do not let reads from the destination float above the arraycopy.
1143 // Since we cannot type the arrays, we don't know which slices
1144 // might be affected. We could restrict this barrier only to those
1145 // memory slices which pertain to array elements--but don't bother.
1146 if (!InsertMemBarAfterArraycopy) {
1147 // (If InsertMemBarAfterArraycopy, there is already one in place.)
1148 insert_mem_bar(&ctrl, &mem, Op_MemBarCPUOrder);
1149 }
1150 return;
1151 }
1152 // (2) src and dest arrays must have elements of the same BasicType
1153 // Figure out the size and type of the elements we will be copying.
1154 BasicType src_elem = top_src->klass()->as_array_klass()->element_type()->basic_type();
1155 BasicType dest_elem = top_dest->klass()->as_array_klass()->element_type()->basic_type();
1156 if (src_elem == T_ARRAY) src_elem = T_OBJECT;
1157 if (dest_elem == T_ARRAY) dest_elem = T_OBJECT;
1158
1159 if (src_elem != dest_elem || dest_elem == T_VOID) {
1160 // The component types are not the same or are not recognized. Punt.
1161 // (But, avoid the native method wrapper to JVM_ArrayCopy.)
1162 {
1163 Node* mem = ac->in(TypeFunc::Memory);
1164 merge_mem = generate_slow_arraycopy(ac, &ctrl, mem, &io, TypePtr::BOTTOM, src, src_offset, dest, dest_offset, length, false);
1165 }
1166
1167 _igvn.replace_node(_memproj_fallthrough, merge_mem);
1168 _igvn.replace_node(_ioproj_fallthrough, io);
1169 _igvn.replace_node(_fallthroughcatchproj, ctrl);
1170 return;
1171 }
1172
1173 //---------------------------------------------------------------------------
1174 // We will make a fast path for this call to arraycopy.
1175
1176 // We have the following tests left to perform:
1177 //
1178 // (3) src and dest must not be null.
1179 // (4) src_offset must not be negative.
1180 // (5) dest_offset must not be negative.
1181 // (6) length must not be negative.
1182 // (7) src_offset + length must not exceed length of src.
1183 // (8) dest_offset + length must not exceed length of dest.
1184 // (9) each element of an oop array must be assignable
1185
1186 {
1187 Node* mem = ac->in(TypeFunc::Memory);
1188 merge_mem = MergeMemNode::make(mem);
1189 transform_later(merge_mem);
1190 }
1191
1192 RegionNode* slow_region = new RegionNode(1);
1193 transform_later(slow_region);
1194
1195 if (!ac->is_arraycopy_validated()) {
1196 // (3) operands must not be null
1197 // We currently perform our null checks with the null_check routine.
1198 // This means that the null exceptions will be reported in the caller
1199 // rather than (correctly) reported inside of the native arraycopy call.
1200 // This should be corrected, given time. We do our null check with the
1201 // stack pointer restored.
1202 // null checks done library_call.cpp
1203
1204 // (4) src_offset must not be negative.
1205 generate_negative_guard(&ctrl, src_offset, slow_region);
1206
1207 // (5) dest_offset must not be negative.
1208 generate_negative_guard(&ctrl, dest_offset, slow_region);
1209
1210 // (6) length must not be negative (moved to generate_arraycopy()).
1211 // generate_negative_guard(length, slow_region);
1212
1213 // (7) src_offset + length must not exceed length of src.
1214 Node* alen = ac->in(ArrayCopyNode::SrcLen);
1215 assert(alen != NULL, "need src len");
1216 generate_limit_guard(&ctrl,
1217 src_offset, length,
1218 alen,
1219 slow_region);
1220
1221 // (8) dest_offset + length must not exceed length of dest.
1222 alen = ac->in(ArrayCopyNode::DestLen);
1223 assert(alen != NULL, "need dest len");
1224 generate_limit_guard(&ctrl,
1225 dest_offset, length,
1226 alen,
1227 slow_region);
1228
1229 // (9) each element of an oop array must be assignable
1230 // The generate_arraycopy subroutine checks this.
1231 }
1232 // This is where the memory effects are placed:
1233 const TypePtr* adr_type = TypeAryPtr::get_array_body_type(dest_elem);
1234 generate_arraycopy(ac, alloc, &ctrl, merge_mem, &io,
1235 adr_type, dest_elem,
1236 src, src_offset, dest, dest_offset, length,
1237 false, false, slow_region);
1238 }