1 /*
2 * Copyright (c) 1999, 2013, 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 "classfile/systemDictionary.hpp"
27 #include "classfile/vmSymbols.hpp"
28 #include "compiler/compileBroker.hpp"
29 #include "compiler/compileLog.hpp"
30 #include "oops/objArrayKlass.hpp"
31 #include "opto/addnode.hpp"
32 #include "opto/callGenerator.hpp"
33 #include "opto/cfgnode.hpp"
34 #include "opto/connode.hpp"
35 #include "opto/idealKit.hpp"
36 #include "opto/mathexactnode.hpp"
37 #include "opto/mulnode.hpp"
38 #include "opto/parse.hpp"
39 #include "opto/runtime.hpp"
40 #include "opto/subnode.hpp"
41 #include "prims/nativeLookup.hpp"
42 #include "runtime/sharedRuntime.hpp"
43 #include "trace/traceMacros.hpp"
44
45 class LibraryIntrinsic : public InlineCallGenerator {
46 // Extend the set of intrinsics known to the runtime:
47 public:
48 private:
49 bool _is_virtual;
50 bool _does_virtual_dispatch;
51 int8_t _predicates_count; // Intrinsic is predicated by several conditions
52 int8_t _last_predicate; // Last generated predicate
53 vmIntrinsics::ID _intrinsic_id;
54
55 public:
56 LibraryIntrinsic(ciMethod* m, bool is_virtual, int predicates_count, bool does_virtual_dispatch, vmIntrinsics::ID id)
57 : InlineCallGenerator(m),
58 _is_virtual(is_virtual),
59 _does_virtual_dispatch(does_virtual_dispatch),
60 _predicates_count((int8_t)predicates_count),
61 _last_predicate((int8_t)-1),
62 _intrinsic_id(id)
63 {
64 }
65 virtual bool is_intrinsic() const { return true; }
66 virtual bool is_virtual() const { return _is_virtual; }
67 virtual bool is_predicated() const { return _predicates_count > 0; }
68 virtual int predicates_count() const { return _predicates_count; }
69 virtual bool does_virtual_dispatch() const { return _does_virtual_dispatch; }
70 virtual JVMState* generate(JVMState* jvms);
71 virtual Node* generate_predicate(JVMState* jvms, int predicate);
72 vmIntrinsics::ID intrinsic_id() const { return _intrinsic_id; }
73 };
74
75
76 // Local helper class for LibraryIntrinsic:
77 class LibraryCallKit : public GraphKit {
78 private:
79 LibraryIntrinsic* _intrinsic; // the library intrinsic being called
80 Node* _result; // the result node, if any
81 int _reexecute_sp; // the stack pointer when bytecode needs to be reexecuted
82
83 const TypeOopPtr* sharpen_unsafe_type(Compile::AliasType* alias_type, const TypePtr *adr_type, bool is_native_ptr = false);
84
85 public:
86 LibraryCallKit(JVMState* jvms, LibraryIntrinsic* intrinsic)
87 : GraphKit(jvms),
88 _intrinsic(intrinsic),
89 _result(NULL)
90 {
91 // Check if this is a root compile. In that case we don't have a caller.
92 if (!jvms->has_method()) {
93 _reexecute_sp = sp();
94 } else {
95 // Find out how many arguments the interpreter needs when deoptimizing
96 // and save the stack pointer value so it can used by uncommon_trap.
97 // We find the argument count by looking at the declared signature.
98 bool ignored_will_link;
99 ciSignature* declared_signature = NULL;
100 ciMethod* ignored_callee = caller()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
101 const int nargs = declared_signature->arg_size_for_bc(caller()->java_code_at_bci(bci()));
102 _reexecute_sp = sp() + nargs; // "push" arguments back on stack
103 }
104 }
105
106 virtual LibraryCallKit* is_LibraryCallKit() const { return (LibraryCallKit*)this; }
107
108 ciMethod* caller() const { return jvms()->method(); }
109 int bci() const { return jvms()->bci(); }
110 LibraryIntrinsic* intrinsic() const { return _intrinsic; }
111 vmIntrinsics::ID intrinsic_id() const { return _intrinsic->intrinsic_id(); }
112 ciMethod* callee() const { return _intrinsic->method(); }
113
114 bool try_to_inline(int predicate);
115 Node* try_to_predicate(int predicate);
116
117 void push_result() {
118 // Push the result onto the stack.
119 if (!stopped() && result() != NULL) {
120 BasicType bt = result()->bottom_type()->basic_type();
121 push_node(bt, result());
122 }
123 }
124
125 private:
126 void fatal_unexpected_iid(vmIntrinsics::ID iid) {
127 fatal(err_msg_res("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid)));
128 }
129
130 void set_result(Node* n) { assert(_result == NULL, "only set once"); _result = n; }
131 void set_result(RegionNode* region, PhiNode* value);
132 Node* result() { return _result; }
133
134 virtual int reexecute_sp() { return _reexecute_sp; }
135
136 // Helper functions to inline natives
137 Node* generate_guard(Node* test, RegionNode* region, float true_prob);
138 Node* generate_slow_guard(Node* test, RegionNode* region);
139 Node* generate_fair_guard(Node* test, RegionNode* region);
140 Node* generate_negative_guard(Node* index, RegionNode* region,
141 // resulting CastII of index:
142 Node* *pos_index = NULL);
143 Node* generate_nonpositive_guard(Node* index, bool never_negative,
144 // resulting CastII of index:
145 Node* *pos_index = NULL);
146 Node* generate_limit_guard(Node* offset, Node* subseq_length,
147 Node* array_length,
148 RegionNode* region);
149 Node* generate_current_thread(Node* &tls_output);
150 address basictype2arraycopy(BasicType t, Node *src_offset, Node *dest_offset,
151 bool disjoint_bases, const char* &name, bool dest_uninitialized);
152 Node* load_mirror_from_klass(Node* klass);
153 Node* load_klass_from_mirror_common(Node* mirror, bool never_see_null,
154 RegionNode* region, int null_path,
155 int offset);
156 Node* load_klass_from_mirror(Node* mirror, bool never_see_null,
157 RegionNode* region, int null_path) {
158 int offset = java_lang_Class::klass_offset_in_bytes();
159 return load_klass_from_mirror_common(mirror, never_see_null,
160 region, null_path,
161 offset);
162 }
163 Node* load_array_klass_from_mirror(Node* mirror, bool never_see_null,
164 RegionNode* region, int null_path) {
165 int offset = java_lang_Class::array_klass_offset_in_bytes();
166 return load_klass_from_mirror_common(mirror, never_see_null,
167 region, null_path,
168 offset);
169 }
170 Node* generate_access_flags_guard(Node* kls,
171 int modifier_mask, int modifier_bits,
172 RegionNode* region);
173 Node* generate_interface_guard(Node* kls, RegionNode* region);
174 Node* generate_array_guard(Node* kls, RegionNode* region) {
175 return generate_array_guard_common(kls, region, false, false);
176 }
177 Node* generate_non_array_guard(Node* kls, RegionNode* region) {
178 return generate_array_guard_common(kls, region, false, true);
179 }
180 Node* generate_objArray_guard(Node* kls, RegionNode* region) {
181 return generate_array_guard_common(kls, region, true, false);
182 }
183 Node* generate_non_objArray_guard(Node* kls, RegionNode* region) {
184 return generate_array_guard_common(kls, region, true, true);
185 }
186 Node* generate_array_guard_common(Node* kls, RegionNode* region,
187 bool obj_array, bool not_array);
188 Node* generate_virtual_guard(Node* obj_klass, RegionNode* slow_region);
189 CallJavaNode* generate_method_call(vmIntrinsics::ID method_id,
190 bool is_virtual = false, bool is_static = false);
191 CallJavaNode* generate_method_call_static(vmIntrinsics::ID method_id) {
192 return generate_method_call(method_id, false, true);
193 }
194 CallJavaNode* generate_method_call_virtual(vmIntrinsics::ID method_id) {
195 return generate_method_call(method_id, true, false);
196 }
197 Node * load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString, bool is_exact, bool is_static);
198
199 Node* make_string_method_node(int opcode, Node* str1_start, Node* cnt1, Node* str2_start, Node* cnt2);
200 Node* make_string_method_node(int opcode, Node* str1, Node* str2);
201 bool inline_string_compareTo();
202 bool inline_string_indexOf();
203 Node* string_indexOf(Node* string_object, ciTypeArray* target_array, jint offset, jint cache_i, jint md2_i);
204 bool inline_string_equals();
205 Node* round_double_node(Node* n);
206 bool runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName);
207 bool inline_math_native(vmIntrinsics::ID id);
208 bool inline_trig(vmIntrinsics::ID id);
209 bool inline_math(vmIntrinsics::ID id);
210 template <typename OverflowOp>
211 bool inline_math_overflow(Node* arg1, Node* arg2);
212 void inline_math_mathExact(Node* math, Node* test);
213 bool inline_math_addExactI(bool is_increment);
214 bool inline_math_addExactL(bool is_increment);
215 bool inline_math_multiplyExactI();
216 bool inline_math_multiplyExactL();
217 bool inline_math_negateExactI();
218 bool inline_math_negateExactL();
219 bool inline_math_subtractExactI(bool is_decrement);
220 bool inline_math_subtractExactL(bool is_decrement);
221 bool inline_exp();
222 bool inline_pow();
223 Node* finish_pow_exp(Node* result, Node* x, Node* y, const TypeFunc* call_type, address funcAddr, const char* funcName);
224 bool inline_min_max(vmIntrinsics::ID id);
225 Node* generate_min_max(vmIntrinsics::ID id, Node* x, Node* y);
226 // This returns Type::AnyPtr, RawPtr, or OopPtr.
227 int classify_unsafe_addr(Node* &base, Node* &offset);
228 Node* make_unsafe_address(Node* base, Node* offset);
229 // Helper for inline_unsafe_access.
230 // Generates the guards that check whether the result of
231 // Unsafe.getObject should be recorded in an SATB log buffer.
232 void insert_pre_barrier(Node* base_oop, Node* offset, Node* pre_val, bool need_mem_bar);
233 bool inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile, bool is_unaligned);
234 bool inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static);
235 static bool klass_needs_init_guard(Node* kls);
236 bool inline_unsafe_allocate();
237 bool inline_unsafe_copyMemory();
238 bool inline_native_currentThread();
239 #ifdef TRACE_HAVE_INTRINSICS
240 bool inline_native_classID();
241 bool inline_native_threadID();
242 #endif
243 bool inline_native_time_funcs(address method, const char* funcName);
244 bool inline_native_isInterrupted();
245 bool inline_native_Class_query(vmIntrinsics::ID id);
246 bool inline_native_subtype_check();
247
248 bool inline_native_newArray();
249 bool inline_native_getLength();
250 bool inline_array_copyOf(bool is_copyOfRange);
251 bool inline_array_equals();
252 void copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array, bool card_mark);
253 bool inline_native_clone(bool is_virtual);
254 bool inline_native_Reflection_getCallerClass();
255 // Helper function for inlining native object hash method
256 bool inline_native_hashcode(bool is_virtual, bool is_static);
257 bool inline_native_getClass();
258
259 // Helper functions for inlining arraycopy
260 bool inline_arraycopy();
261 void generate_arraycopy(const TypePtr* adr_type,
262 BasicType basic_elem_type,
263 Node* src, Node* src_offset,
264 Node* dest, Node* dest_offset,
265 Node* copy_length,
266 bool disjoint_bases = false,
267 bool length_never_negative = false,
268 RegionNode* slow_region = NULL);
269 AllocateArrayNode* tightly_coupled_allocation(Node* ptr,
270 RegionNode* slow_region);
271 void generate_clear_array(const TypePtr* adr_type,
272 Node* dest,
273 BasicType basic_elem_type,
274 Node* slice_off,
275 Node* slice_len,
276 Node* slice_end);
277 bool generate_block_arraycopy(const TypePtr* adr_type,
278 BasicType basic_elem_type,
279 AllocateNode* alloc,
280 Node* src, Node* src_offset,
281 Node* dest, Node* dest_offset,
282 Node* dest_size, bool dest_uninitialized);
283 void generate_slow_arraycopy(const TypePtr* adr_type,
284 Node* src, Node* src_offset,
285 Node* dest, Node* dest_offset,
286 Node* copy_length, bool dest_uninitialized);
287 Node* generate_checkcast_arraycopy(const TypePtr* adr_type,
288 Node* dest_elem_klass,
289 Node* src, Node* src_offset,
290 Node* dest, Node* dest_offset,
291 Node* copy_length, bool dest_uninitialized);
292 Node* generate_generic_arraycopy(const TypePtr* adr_type,
293 Node* src, Node* src_offset,
294 Node* dest, Node* dest_offset,
295 Node* copy_length, bool dest_uninitialized);
296 void generate_unchecked_arraycopy(const TypePtr* adr_type,
297 BasicType basic_elem_type,
298 bool disjoint_bases,
299 Node* src, Node* src_offset,
300 Node* dest, Node* dest_offset,
301 Node* copy_length, bool dest_uninitialized);
302 typedef enum { LS_xadd, LS_xchg, LS_cmpxchg } LoadStoreKind;
303 bool inline_unsafe_load_store(BasicType type, LoadStoreKind kind);
304 bool inline_unsafe_ordered_store(BasicType type);
305 bool inline_unsafe_fence(vmIntrinsics::ID id);
306 bool inline_fp_conversions(vmIntrinsics::ID id);
307 bool inline_number_methods(vmIntrinsics::ID id);
308 bool inline_reference_get();
309 bool inline_aescrypt_Block(vmIntrinsics::ID id);
310 bool inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id);
311 Node* inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting);
312 Node* get_key_start_from_aescrypt_object(Node* aescrypt_object);
313 Node* get_original_key_start_from_aescrypt_object(Node* aescrypt_object);
314 bool inline_sha_implCompress(vmIntrinsics::ID id);
315 bool inline_digestBase_implCompressMB(int predicate);
316 bool inline_sha_implCompressMB(Node* digestBaseObj, ciInstanceKlass* instklass_SHA,
317 bool long_state, address stubAddr, const char *stubName,
318 Node* src_start, Node* ofs, Node* limit);
319 Node* get_state_from_sha_object(Node *sha_object);
320 Node* get_state_from_sha5_object(Node *sha_object);
321 Node* inline_digestBase_implCompressMB_predicate(int predicate);
322 bool inline_encodeISOArray();
323 bool inline_updateCRC32();
324 bool inline_updateBytesCRC32();
325 bool inline_updateByteBufferCRC32();
326 bool inline_multiplyToLen();
327 bool inline_squareToLen();
328 bool inline_mulAdd();
329 bool inline_montgomeryMultiply();
330 bool inline_montgomerySquare();
331
332 bool inline_profileBoolean();
333 };
334
335
336 //---------------------------make_vm_intrinsic----------------------------
337 CallGenerator* Compile::make_vm_intrinsic(ciMethod* m, bool is_virtual) {
338 vmIntrinsics::ID id = m->intrinsic_id();
339 assert(id != vmIntrinsics::_none, "must be a VM intrinsic");
340
341 ccstr disable_intr = NULL;
342
343 if ((DisableIntrinsic[0] != '\0'
344 && strstr(DisableIntrinsic, vmIntrinsics::name_at(id)) != NULL) ||
345 (method_has_option_value("DisableIntrinsic", disable_intr)
346 && strstr(disable_intr, vmIntrinsics::name_at(id)) != NULL)) {
347 // disabled by a user request on the command line:
348 // example: -XX:DisableIntrinsic=_hashCode,_getClass
349 return NULL;
350 }
351
352 if (!m->is_loaded()) {
353 // do not attempt to inline unloaded methods
354 return NULL;
355 }
356
357 // Only a few intrinsics implement a virtual dispatch.
358 // They are expensive calls which are also frequently overridden.
359 if (is_virtual) {
360 switch (id) {
361 case vmIntrinsics::_hashCode:
362 case vmIntrinsics::_clone:
363 // OK, Object.hashCode and Object.clone intrinsics come in both flavors
364 break;
365 default:
366 return NULL;
367 }
368 }
369
370 // -XX:-InlineNatives disables nearly all intrinsics:
371 if (!InlineNatives) {
372 switch (id) {
373 case vmIntrinsics::_indexOf:
374 case vmIntrinsics::_compareTo:
375 case vmIntrinsics::_equals:
376 case vmIntrinsics::_equalsC:
377 case vmIntrinsics::_getAndAddInt:
378 case vmIntrinsics::_getAndAddLong:
379 case vmIntrinsics::_getAndSetInt:
380 case vmIntrinsics::_getAndSetLong:
381 case vmIntrinsics::_getAndSetObject:
382 case vmIntrinsics::_loadFence:
383 case vmIntrinsics::_storeFence:
384 case vmIntrinsics::_fullFence:
385 break; // InlineNatives does not control String.compareTo
386 case vmIntrinsics::_Reference_get:
387 break; // InlineNatives does not control Reference.get
388 default:
389 return NULL;
390 }
391 }
392
393 int predicates = 0;
394 bool does_virtual_dispatch = false;
395
396 switch (id) {
397 case vmIntrinsics::_compareTo:
398 if (!SpecialStringCompareTo) return NULL;
399 if (!Matcher::match_rule_supported(Op_StrComp)) return NULL;
400 break;
401 case vmIntrinsics::_indexOf:
402 if (!SpecialStringIndexOf) return NULL;
403 break;
404 case vmIntrinsics::_equals:
405 if (!SpecialStringEquals) return NULL;
406 if (!Matcher::match_rule_supported(Op_StrEquals)) return NULL;
407 break;
408 case vmIntrinsics::_equalsC:
409 if (!SpecialArraysEquals) return NULL;
410 if (!Matcher::match_rule_supported(Op_AryEq)) return NULL;
411 break;
412 case vmIntrinsics::_arraycopy:
413 if (!InlineArrayCopy) return NULL;
414 break;
415 case vmIntrinsics::_copyMemory:
416 if (StubRoutines::unsafe_arraycopy() == NULL) return NULL;
417 if (!InlineArrayCopy) return NULL;
418 break;
419 case vmIntrinsics::_hashCode:
420 if (!InlineObjectHash) return NULL;
421 does_virtual_dispatch = true;
422 break;
423 case vmIntrinsics::_clone:
424 does_virtual_dispatch = true;
425 case vmIntrinsics::_copyOf:
426 case vmIntrinsics::_copyOfRange:
427 if (!InlineObjectCopy) return NULL;
428 // These also use the arraycopy intrinsic mechanism:
429 if (!InlineArrayCopy) return NULL;
430 break;
431 case vmIntrinsics::_encodeISOArray:
432 if (!SpecialEncodeISOArray) return NULL;
433 if (!Matcher::match_rule_supported(Op_EncodeISOArray)) return NULL;
434 break;
435 case vmIntrinsics::_checkIndex:
436 // We do not intrinsify this. The optimizer does fine with it.
437 return NULL;
438
439 case vmIntrinsics::_getCallerClass:
440 if (!UseNewReflection) return NULL;
441 if (!InlineReflectionGetCallerClass) return NULL;
442 if (SystemDictionary::reflect_CallerSensitive_klass() == NULL) return NULL;
443 break;
444
445 case vmIntrinsics::_bitCount_i:
446 if (!Matcher::match_rule_supported(Op_PopCountI)) return NULL;
447 break;
448
449 case vmIntrinsics::_bitCount_l:
450 if (!Matcher::match_rule_supported(Op_PopCountL)) return NULL;
451 break;
452
453 case vmIntrinsics::_numberOfLeadingZeros_i:
454 if (!Matcher::match_rule_supported(Op_CountLeadingZerosI)) return NULL;
455 break;
456
457 case vmIntrinsics::_numberOfLeadingZeros_l:
458 if (!Matcher::match_rule_supported(Op_CountLeadingZerosL)) return NULL;
459 break;
460
461 case vmIntrinsics::_numberOfTrailingZeros_i:
462 if (!Matcher::match_rule_supported(Op_CountTrailingZerosI)) return NULL;
463 break;
464
465 case vmIntrinsics::_numberOfTrailingZeros_l:
466 if (!Matcher::match_rule_supported(Op_CountTrailingZerosL)) return NULL;
467 break;
468
469 case vmIntrinsics::_reverseBytes_c:
470 if (!Matcher::match_rule_supported(Op_ReverseBytesUS)) return NULL;
471 break;
472 case vmIntrinsics::_reverseBytes_s:
473 if (!Matcher::match_rule_supported(Op_ReverseBytesS)) return NULL;
474 break;
475 case vmIntrinsics::_reverseBytes_i:
476 if (!Matcher::match_rule_supported(Op_ReverseBytesI)) return NULL;
477 break;
478 case vmIntrinsics::_reverseBytes_l:
479 if (!Matcher::match_rule_supported(Op_ReverseBytesL)) return NULL;
480 break;
481
482 case vmIntrinsics::_Reference_get:
483 // Use the intrinsic version of Reference.get() so that the value in
484 // the referent field can be registered by the G1 pre-barrier code.
485 // Also add memory barrier to prevent commoning reads from this field
486 // across safepoint since GC can change it value.
487 break;
488
489 case vmIntrinsics::_compareAndSwapObject:
490 #ifdef _LP64
491 if (!UseCompressedOops && !Matcher::match_rule_supported(Op_CompareAndSwapP)) return NULL;
492 #endif
493 break;
494
495 case vmIntrinsics::_compareAndSwapLong:
496 if (!Matcher::match_rule_supported(Op_CompareAndSwapL)) return NULL;
497 break;
498
499 case vmIntrinsics::_getAndAddInt:
500 if (!Matcher::match_rule_supported(Op_GetAndAddI)) return NULL;
501 break;
502
503 case vmIntrinsics::_getAndAddLong:
504 if (!Matcher::match_rule_supported(Op_GetAndAddL)) return NULL;
505 break;
506
507 case vmIntrinsics::_getAndSetInt:
508 if (!Matcher::match_rule_supported(Op_GetAndSetI)) return NULL;
509 break;
510
511 case vmIntrinsics::_getAndSetLong:
512 if (!Matcher::match_rule_supported(Op_GetAndSetL)) return NULL;
513 break;
514
515 case vmIntrinsics::_getAndSetObject:
516 #ifdef _LP64
517 if (!UseCompressedOops && !Matcher::match_rule_supported(Op_GetAndSetP)) return NULL;
518 if (UseCompressedOops && !Matcher::match_rule_supported(Op_GetAndSetN)) return NULL;
519 break;
520 #else
521 if (!Matcher::match_rule_supported(Op_GetAndSetP)) return NULL;
522 break;
523 #endif
524
525 case vmIntrinsics::_aescrypt_encryptBlock:
526 case vmIntrinsics::_aescrypt_decryptBlock:
527 if (!UseAESIntrinsics) return NULL;
528 break;
529
530 case vmIntrinsics::_multiplyToLen:
531 if (!UseMultiplyToLenIntrinsic) return NULL;
532 break;
533
534 case vmIntrinsics::_squareToLen:
535 if (!UseSquareToLenIntrinsic) return NULL;
536 break;
537
538 case vmIntrinsics::_mulAdd:
539 if (!UseMulAddIntrinsic) return NULL;
540 break;
541
542 case vmIntrinsics::_montgomeryMultiply:
543 if (!UseMontgomeryMultiplyIntrinsic) return NULL;
544 break;
545 case vmIntrinsics::_montgomerySquare:
546 if (!UseMontgomerySquareIntrinsic) return NULL;
547 break;
548
549 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt:
550 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt:
551 if (!UseAESIntrinsics) return NULL;
552 // these two require the predicated logic
553 predicates = 1;
554 break;
555
556 case vmIntrinsics::_sha_implCompress:
557 if (!UseSHA1Intrinsics) return NULL;
558 break;
559
560 case vmIntrinsics::_sha2_implCompress:
561 if (!UseSHA256Intrinsics) return NULL;
562 break;
563
564 case vmIntrinsics::_sha5_implCompress:
565 if (!UseSHA512Intrinsics) return NULL;
566 break;
567
568 case vmIntrinsics::_digestBase_implCompressMB:
569 if (!(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics)) return NULL;
570 predicates = 3;
571 break;
572
573 case vmIntrinsics::_updateCRC32:
574 case vmIntrinsics::_updateBytesCRC32:
575 case vmIntrinsics::_updateByteBufferCRC32:
576 if (!UseCRC32Intrinsics) return NULL;
577 break;
578
579 case vmIntrinsics::_incrementExactI:
580 case vmIntrinsics::_addExactI:
581 if (!Matcher::match_rule_supported(Op_OverflowAddI) || !UseMathExactIntrinsics) return NULL;
582 break;
583 case vmIntrinsics::_incrementExactL:
584 case vmIntrinsics::_addExactL:
585 if (!Matcher::match_rule_supported(Op_OverflowAddL) || !UseMathExactIntrinsics) return NULL;
586 break;
587 case vmIntrinsics::_decrementExactI:
588 case vmIntrinsics::_subtractExactI:
589 if (!Matcher::match_rule_supported(Op_OverflowSubI) || !UseMathExactIntrinsics) return NULL;
590 break;
591 case vmIntrinsics::_decrementExactL:
592 case vmIntrinsics::_subtractExactL:
593 if (!Matcher::match_rule_supported(Op_OverflowSubL) || !UseMathExactIntrinsics) return NULL;
594 break;
595 case vmIntrinsics::_negateExactI:
596 if (!Matcher::match_rule_supported(Op_OverflowSubI) || !UseMathExactIntrinsics) return NULL;
597 break;
598 case vmIntrinsics::_negateExactL:
599 if (!Matcher::match_rule_supported(Op_OverflowSubL) || !UseMathExactIntrinsics) return NULL;
600 break;
601 case vmIntrinsics::_multiplyExactI:
602 if (!Matcher::match_rule_supported(Op_OverflowMulI) || !UseMathExactIntrinsics) return NULL;
603 break;
604 case vmIntrinsics::_multiplyExactL:
605 if (!Matcher::match_rule_supported(Op_OverflowMulL) || !UseMathExactIntrinsics) return NULL;
606 break;
607
608 default:
609 assert(id <= vmIntrinsics::LAST_COMPILER_INLINE, "caller responsibility");
610 assert(id != vmIntrinsics::_Object_init && id != vmIntrinsics::_invoke, "enum out of order?");
611 break;
612 }
613
614 // -XX:-InlineClassNatives disables natives from the Class class.
615 // The flag applies to all reflective calls, notably Array.newArray
616 // (visible to Java programmers as Array.newInstance).
617 if (m->holder()->name() == ciSymbol::java_lang_Class() ||
618 m->holder()->name() == ciSymbol::java_lang_reflect_Array()) {
619 if (!InlineClassNatives) return NULL;
620 }
621
622 // -XX:-InlineThreadNatives disables natives from the Thread class.
623 if (m->holder()->name() == ciSymbol::java_lang_Thread()) {
624 if (!InlineThreadNatives) return NULL;
625 }
626
627 // -XX:-InlineMathNatives disables natives from the Math,Float and Double classes.
628 if (m->holder()->name() == ciSymbol::java_lang_Math() ||
629 m->holder()->name() == ciSymbol::java_lang_Float() ||
630 m->holder()->name() == ciSymbol::java_lang_Double()) {
631 if (!InlineMathNatives) return NULL;
632 }
633
634 // -XX:-InlineUnsafeOps disables natives from the Unsafe class.
635 if (m->holder()->name() == ciSymbol::sun_misc_Unsafe()) {
636 if (!InlineUnsafeOps) return NULL;
637 }
638
639 return new LibraryIntrinsic(m, is_virtual, predicates, does_virtual_dispatch, (vmIntrinsics::ID) id);
640 }
641
642 //----------------------register_library_intrinsics-----------------------
643 // Initialize this file's data structures, for each Compile instance.
644 void Compile::register_library_intrinsics() {
645 // Nothing to do here.
646 }
647
648 JVMState* LibraryIntrinsic::generate(JVMState* jvms) {
649 LibraryCallKit kit(jvms, this);
650 Compile* C = kit.C;
651 int nodes = C->unique();
652 #ifndef PRODUCT
653 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
654 char buf[1000];
655 const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf));
656 tty->print_cr("Intrinsic %s", str);
657 }
658 #endif
659 ciMethod* callee = kit.callee();
660 const int bci = kit.bci();
661
662 // Try to inline the intrinsic.
663 if (kit.try_to_inline(_last_predicate)) {
664 if (C->print_intrinsics() || C->print_inlining()) {
665 C->print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual)" : "(intrinsic)");
666 }
667 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked);
668 if (C->log()) {
669 C->log()->elem("intrinsic id='%s'%s nodes='%d'",
670 vmIntrinsics::name_at(intrinsic_id()),
671 (is_virtual() ? " virtual='1'" : ""),
672 C->unique() - nodes);
673 }
674 // Push the result from the inlined method onto the stack.
675 kit.push_result();
676 return kit.transfer_exceptions_into_jvms();
677 }
678
679 // The intrinsic bailed out
680 if (C->print_intrinsics() || C->print_inlining()) {
681 if (jvms->has_method()) {
682 // Not a root compile.
683 const char* msg = is_virtual() ? "failed to inline (intrinsic, virtual)" : "failed to inline (intrinsic)";
684 C->print_inlining(callee, jvms->depth() - 1, bci, msg);
685 } else {
686 // Root compile
687 tty->print("Did not generate intrinsic %s%s at bci:%d in",
688 vmIntrinsics::name_at(intrinsic_id()),
689 (is_virtual() ? " (virtual)" : ""), bci);
690 }
691 }
692 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed);
693 return NULL;
694 }
695
696 Node* LibraryIntrinsic::generate_predicate(JVMState* jvms, int predicate) {
697 LibraryCallKit kit(jvms, this);
698 Compile* C = kit.C;
699 int nodes = C->unique();
700 _last_predicate = predicate;
701 #ifndef PRODUCT
702 assert(is_predicated() && predicate < predicates_count(), "sanity");
703 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
704 char buf[1000];
705 const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf));
706 tty->print_cr("Predicate for intrinsic %s", str);
707 }
708 #endif
709 ciMethod* callee = kit.callee();
710 const int bci = kit.bci();
711
712 Node* slow_ctl = kit.try_to_predicate(predicate);
713 if (!kit.failing()) {
714 if (C->print_intrinsics() || C->print_inlining()) {
715 C->print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual, predicate)" : "(intrinsic, predicate)");
716 }
717 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked);
718 if (C->log()) {
719 C->log()->elem("predicate_intrinsic id='%s'%s nodes='%d'",
720 vmIntrinsics::name_at(intrinsic_id()),
721 (is_virtual() ? " virtual='1'" : ""),
722 C->unique() - nodes);
723 }
724 return slow_ctl; // Could be NULL if the check folds.
725 }
726
727 // The intrinsic bailed out
728 if (C->print_intrinsics() || C->print_inlining()) {
729 if (jvms->has_method()) {
730 // Not a root compile.
731 const char* msg = "failed to generate predicate for intrinsic";
732 C->print_inlining(kit.callee(), jvms->depth() - 1, bci, msg);
733 } else {
734 // Root compile
735 C->print_inlining_stream()->print("Did not generate predicate for intrinsic %s%s at bci:%d in",
736 vmIntrinsics::name_at(intrinsic_id()),
737 (is_virtual() ? " (virtual)" : ""), bci);
738 }
739 }
740 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed);
741 return NULL;
742 }
743
744 bool LibraryCallKit::try_to_inline(int predicate) {
745 // Handle symbolic names for otherwise undistinguished boolean switches:
746 const bool is_store = true;
747 const bool is_native_ptr = true;
748 const bool is_static = true;
749 const bool is_volatile = true;
750
751 if (!jvms()->has_method()) {
752 // Root JVMState has a null method.
753 assert(map()->memory()->Opcode() == Op_Parm, "");
754 // Insert the memory aliasing node
755 set_all_memory(reset_memory());
756 }
757 assert(merged_memory(), "");
758
759
760 switch (intrinsic_id()) {
761 case vmIntrinsics::_hashCode: return inline_native_hashcode(intrinsic()->is_virtual(), !is_static);
762 case vmIntrinsics::_identityHashCode: return inline_native_hashcode(/*!virtual*/ false, is_static);
763 case vmIntrinsics::_getClass: return inline_native_getClass();
764
765 case vmIntrinsics::_dsin:
766 case vmIntrinsics::_dcos:
767 case vmIntrinsics::_dtan:
768 case vmIntrinsics::_dabs:
769 case vmIntrinsics::_datan2:
770 case vmIntrinsics::_dsqrt:
771 case vmIntrinsics::_dexp:
772 case vmIntrinsics::_dlog:
773 case vmIntrinsics::_dlog10:
774 case vmIntrinsics::_dpow: return inline_math_native(intrinsic_id());
775
776 case vmIntrinsics::_min:
777 case vmIntrinsics::_max: return inline_min_max(intrinsic_id());
778
779 case vmIntrinsics::_addExactI: return inline_math_addExactI(false /* add */);
780 case vmIntrinsics::_addExactL: return inline_math_addExactL(false /* add */);
781 case vmIntrinsics::_decrementExactI: return inline_math_subtractExactI(true /* decrement */);
782 case vmIntrinsics::_decrementExactL: return inline_math_subtractExactL(true /* decrement */);
783 case vmIntrinsics::_incrementExactI: return inline_math_addExactI(true /* increment */);
784 case vmIntrinsics::_incrementExactL: return inline_math_addExactL(true /* increment */);
785 case vmIntrinsics::_multiplyExactI: return inline_math_multiplyExactI();
786 case vmIntrinsics::_multiplyExactL: return inline_math_multiplyExactL();
787 case vmIntrinsics::_negateExactI: return inline_math_negateExactI();
788 case vmIntrinsics::_negateExactL: return inline_math_negateExactL();
789 case vmIntrinsics::_subtractExactI: return inline_math_subtractExactI(false /* subtract */);
790 case vmIntrinsics::_subtractExactL: return inline_math_subtractExactL(false /* subtract */);
791
792 case vmIntrinsics::_arraycopy: return inline_arraycopy();
793
794 case vmIntrinsics::_compareTo: return inline_string_compareTo();
795 case vmIntrinsics::_indexOf: return inline_string_indexOf();
796 case vmIntrinsics::_equals: return inline_string_equals();
797
798 case vmIntrinsics::_getObject: return inline_unsafe_access(!is_native_ptr, !is_store, T_OBJECT, !is_volatile, false);
799 case vmIntrinsics::_getBoolean: return inline_unsafe_access(!is_native_ptr, !is_store, T_BOOLEAN, !is_volatile, false);
800 case vmIntrinsics::_getByte: return inline_unsafe_access(!is_native_ptr, !is_store, T_BYTE, !is_volatile, false);
801 case vmIntrinsics::_getShort: return inline_unsafe_access(!is_native_ptr, !is_store, T_SHORT, !is_volatile, false);
802 case vmIntrinsics::_getChar: return inline_unsafe_access(!is_native_ptr, !is_store, T_CHAR, !is_volatile, false);
803 case vmIntrinsics::_getInt: return inline_unsafe_access(!is_native_ptr, !is_store, T_INT, !is_volatile, false);
804 case vmIntrinsics::_getLong: return inline_unsafe_access(!is_native_ptr, !is_store, T_LONG, !is_volatile, false);
805 case vmIntrinsics::_getFloat: return inline_unsafe_access(!is_native_ptr, !is_store, T_FLOAT, !is_volatile, false);
806 case vmIntrinsics::_getDouble: return inline_unsafe_access(!is_native_ptr, !is_store, T_DOUBLE, !is_volatile, false);
807
808 case vmIntrinsics::_putObject: return inline_unsafe_access(!is_native_ptr, is_store, T_OBJECT, !is_volatile, false);
809 case vmIntrinsics::_putBoolean: return inline_unsafe_access(!is_native_ptr, is_store, T_BOOLEAN, !is_volatile, false);
810 case vmIntrinsics::_putByte: return inline_unsafe_access(!is_native_ptr, is_store, T_BYTE, !is_volatile, false);
811 case vmIntrinsics::_putShort: return inline_unsafe_access(!is_native_ptr, is_store, T_SHORT, !is_volatile, false);
812 case vmIntrinsics::_putChar: return inline_unsafe_access(!is_native_ptr, is_store, T_CHAR, !is_volatile, false);
813 case vmIntrinsics::_putInt: return inline_unsafe_access(!is_native_ptr, is_store, T_INT, !is_volatile, false);
814 case vmIntrinsics::_putLong: return inline_unsafe_access(!is_native_ptr, is_store, T_LONG, !is_volatile, false);
815 case vmIntrinsics::_putFloat: return inline_unsafe_access(!is_native_ptr, is_store, T_FLOAT, !is_volatile, false);
816 case vmIntrinsics::_putDouble: return inline_unsafe_access(!is_native_ptr, is_store, T_DOUBLE, !is_volatile, false);
817
818 case vmIntrinsics::_getByte_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_BYTE, !is_volatile, false);
819 case vmIntrinsics::_getShort_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_SHORT, !is_volatile, false);
820 case vmIntrinsics::_getChar_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_CHAR, !is_volatile, false);
821 case vmIntrinsics::_getInt_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_INT, !is_volatile, false);
822 case vmIntrinsics::_getLong_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_LONG, !is_volatile, false);
823 case vmIntrinsics::_getFloat_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_FLOAT, !is_volatile, false);
824 case vmIntrinsics::_getDouble_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_DOUBLE, !is_volatile, false);
825 case vmIntrinsics::_getAddress_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_ADDRESS, !is_volatile, false);
826
827 case vmIntrinsics::_putByte_raw: return inline_unsafe_access( is_native_ptr, is_store, T_BYTE, !is_volatile, false);
828 case vmIntrinsics::_putShort_raw: return inline_unsafe_access( is_native_ptr, is_store, T_SHORT, !is_volatile, false);
829 case vmIntrinsics::_putChar_raw: return inline_unsafe_access( is_native_ptr, is_store, T_CHAR, !is_volatile, false);
830 case vmIntrinsics::_putInt_raw: return inline_unsafe_access( is_native_ptr, is_store, T_INT, !is_volatile, false);
831 case vmIntrinsics::_putLong_raw: return inline_unsafe_access( is_native_ptr, is_store, T_LONG, !is_volatile, false);
832 case vmIntrinsics::_putFloat_raw: return inline_unsafe_access( is_native_ptr, is_store, T_FLOAT, !is_volatile, false);
833 case vmIntrinsics::_putDouble_raw: return inline_unsafe_access( is_native_ptr, is_store, T_DOUBLE, !is_volatile, false);
834 case vmIntrinsics::_putAddress_raw: return inline_unsafe_access( is_native_ptr, is_store, T_ADDRESS, !is_volatile, false);
835
836 case vmIntrinsics::_getObjectVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_OBJECT, is_volatile, false);
837 case vmIntrinsics::_getBooleanVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_BOOLEAN, is_volatile, false);
838 case vmIntrinsics::_getByteVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_BYTE, is_volatile, false);
839 case vmIntrinsics::_getShortVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_SHORT, is_volatile, false);
840 case vmIntrinsics::_getCharVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_CHAR, is_volatile, false);
841 case vmIntrinsics::_getIntVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_INT, is_volatile, false);
842 case vmIntrinsics::_getLongVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_LONG, is_volatile, false);
843 case vmIntrinsics::_getFloatVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_FLOAT, is_volatile, false);
844 case vmIntrinsics::_getDoubleVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_DOUBLE, is_volatile, false);
845
846 case vmIntrinsics::_putObjectVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_OBJECT, is_volatile, false);
847 case vmIntrinsics::_putBooleanVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_BOOLEAN, is_volatile, false);
848 case vmIntrinsics::_putByteVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_BYTE, is_volatile, false);
849 case vmIntrinsics::_putShortVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_SHORT, is_volatile, false);
850 case vmIntrinsics::_putCharVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_CHAR, is_volatile, false);
851 case vmIntrinsics::_putIntVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_INT, is_volatile, false);
852 case vmIntrinsics::_putLongVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_LONG, is_volatile, false);
853 case vmIntrinsics::_putFloatVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_FLOAT, is_volatile, false);
854 case vmIntrinsics::_putDoubleVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_DOUBLE, is_volatile, false);
855
856 case vmIntrinsics::_prefetchRead: return inline_unsafe_prefetch(!is_native_ptr, !is_store, !is_static);
857 case vmIntrinsics::_prefetchWrite: return inline_unsafe_prefetch(!is_native_ptr, is_store, !is_static);
858 case vmIntrinsics::_prefetchReadStatic: return inline_unsafe_prefetch(!is_native_ptr, !is_store, is_static);
859 case vmIntrinsics::_prefetchWriteStatic: return inline_unsafe_prefetch(!is_native_ptr, is_store, is_static);
860
861 case vmIntrinsics::_compareAndSwapObject: return inline_unsafe_load_store(T_OBJECT, LS_cmpxchg);
862 case vmIntrinsics::_compareAndSwapInt: return inline_unsafe_load_store(T_INT, LS_cmpxchg);
863 case vmIntrinsics::_compareAndSwapLong: return inline_unsafe_load_store(T_LONG, LS_cmpxchg);
864
865 case vmIntrinsics::_putOrderedObject: return inline_unsafe_ordered_store(T_OBJECT);
866 case vmIntrinsics::_putOrderedInt: return inline_unsafe_ordered_store(T_INT);
867 case vmIntrinsics::_putOrderedLong: return inline_unsafe_ordered_store(T_LONG);
868
869 case vmIntrinsics::_getAndAddInt: return inline_unsafe_load_store(T_INT, LS_xadd);
870 case vmIntrinsics::_getAndAddLong: return inline_unsafe_load_store(T_LONG, LS_xadd);
871 case vmIntrinsics::_getAndSetInt: return inline_unsafe_load_store(T_INT, LS_xchg);
872 case vmIntrinsics::_getAndSetLong: return inline_unsafe_load_store(T_LONG, LS_xchg);
873 case vmIntrinsics::_getAndSetObject: return inline_unsafe_load_store(T_OBJECT, LS_xchg);
874
875 case vmIntrinsics::_loadFence:
876 case vmIntrinsics::_storeFence:
877 case vmIntrinsics::_fullFence: return inline_unsafe_fence(intrinsic_id());
878
879 case vmIntrinsics::_currentThread: return inline_native_currentThread();
880 case vmIntrinsics::_isInterrupted: return inline_native_isInterrupted();
881
882 #ifdef TRACE_HAVE_INTRINSICS
883 case vmIntrinsics::_classID: return inline_native_classID();
884 case vmIntrinsics::_threadID: return inline_native_threadID();
885 case vmIntrinsics::_counterTime: return inline_native_time_funcs(CAST_FROM_FN_PTR(address, TRACE_TIME_METHOD), "counterTime");
886 #endif
887 case vmIntrinsics::_currentTimeMillis: return inline_native_time_funcs(CAST_FROM_FN_PTR(address, os::javaTimeMillis), "currentTimeMillis");
888 case vmIntrinsics::_nanoTime: return inline_native_time_funcs(CAST_FROM_FN_PTR(address, os::javaTimeNanos), "nanoTime");
889 case vmIntrinsics::_allocateInstance: return inline_unsafe_allocate();
890 case vmIntrinsics::_copyMemory: return inline_unsafe_copyMemory();
891 case vmIntrinsics::_newArray: return inline_native_newArray();
892 case vmIntrinsics::_getLength: return inline_native_getLength();
893 case vmIntrinsics::_copyOf: return inline_array_copyOf(false);
894 case vmIntrinsics::_copyOfRange: return inline_array_copyOf(true);
895 case vmIntrinsics::_equalsC: return inline_array_equals();
896 case vmIntrinsics::_clone: return inline_native_clone(intrinsic()->is_virtual());
897
898 case vmIntrinsics::_isAssignableFrom: return inline_native_subtype_check();
899
900 case vmIntrinsics::_isInstance:
901 case vmIntrinsics::_getModifiers:
902 case vmIntrinsics::_isInterface:
903 case vmIntrinsics::_isArray:
904 case vmIntrinsics::_isPrimitive:
905 case vmIntrinsics::_getSuperclass:
906 case vmIntrinsics::_getComponentType:
907 case vmIntrinsics::_getClassAccessFlags: return inline_native_Class_query(intrinsic_id());
908
909 case vmIntrinsics::_floatToRawIntBits:
910 case vmIntrinsics::_floatToIntBits:
911 case vmIntrinsics::_intBitsToFloat:
912 case vmIntrinsics::_doubleToRawLongBits:
913 case vmIntrinsics::_doubleToLongBits:
914 case vmIntrinsics::_longBitsToDouble: return inline_fp_conversions(intrinsic_id());
915
916 case vmIntrinsics::_numberOfLeadingZeros_i:
917 case vmIntrinsics::_numberOfLeadingZeros_l:
918 case vmIntrinsics::_numberOfTrailingZeros_i:
919 case vmIntrinsics::_numberOfTrailingZeros_l:
920 case vmIntrinsics::_bitCount_i:
921 case vmIntrinsics::_bitCount_l:
922 case vmIntrinsics::_reverseBytes_i:
923 case vmIntrinsics::_reverseBytes_l:
924 case vmIntrinsics::_reverseBytes_s:
925 case vmIntrinsics::_reverseBytes_c: return inline_number_methods(intrinsic_id());
926
927 case vmIntrinsics::_getCallerClass: return inline_native_Reflection_getCallerClass();
928
929 case vmIntrinsics::_Reference_get: return inline_reference_get();
930
931 case vmIntrinsics::_aescrypt_encryptBlock:
932 case vmIntrinsics::_aescrypt_decryptBlock: return inline_aescrypt_Block(intrinsic_id());
933
934 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt:
935 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt:
936 return inline_cipherBlockChaining_AESCrypt(intrinsic_id());
937
938 case vmIntrinsics::_sha_implCompress:
939 case vmIntrinsics::_sha2_implCompress:
940 case vmIntrinsics::_sha5_implCompress:
941 return inline_sha_implCompress(intrinsic_id());
942
943 case vmIntrinsics::_digestBase_implCompressMB:
944 return inline_digestBase_implCompressMB(predicate);
945
946 case vmIntrinsics::_multiplyToLen:
947 return inline_multiplyToLen();
948
949 case vmIntrinsics::_squareToLen:
950 return inline_squareToLen();
951
952 case vmIntrinsics::_mulAdd:
953 return inline_mulAdd();
954
955 case vmIntrinsics::_montgomeryMultiply:
956 return inline_montgomeryMultiply();
957 case vmIntrinsics::_montgomerySquare:
958 return inline_montgomerySquare();
959
960 case vmIntrinsics::_encodeISOArray:
961 return inline_encodeISOArray();
962
963 case vmIntrinsics::_updateCRC32:
964 return inline_updateCRC32();
965 case vmIntrinsics::_updateBytesCRC32:
966 return inline_updateBytesCRC32();
967 case vmIntrinsics::_updateByteBufferCRC32:
968 return inline_updateByteBufferCRC32();
969
970 case vmIntrinsics::_profileBoolean:
971 return inline_profileBoolean();
972
973 default:
974 // If you get here, it may be that someone has added a new intrinsic
975 // to the list in vmSymbols.hpp without implementing it here.
976 #ifndef PRODUCT
977 if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) {
978 tty->print_cr("*** Warning: Unimplemented intrinsic %s(%d)",
979 vmIntrinsics::name_at(intrinsic_id()), intrinsic_id());
980 }
981 #endif
982 return false;
983 }
984 }
985
986 Node* LibraryCallKit::try_to_predicate(int predicate) {
987 if (!jvms()->has_method()) {
988 // Root JVMState has a null method.
989 assert(map()->memory()->Opcode() == Op_Parm, "");
990 // Insert the memory aliasing node
991 set_all_memory(reset_memory());
992 }
993 assert(merged_memory(), "");
994
995 switch (intrinsic_id()) {
996 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt:
997 return inline_cipherBlockChaining_AESCrypt_predicate(false);
998 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt:
999 return inline_cipherBlockChaining_AESCrypt_predicate(true);
1000 case vmIntrinsics::_digestBase_implCompressMB:
1001 return inline_digestBase_implCompressMB_predicate(predicate);
1002
1003 default:
1004 // If you get here, it may be that someone has added a new intrinsic
1005 // to the list in vmSymbols.hpp without implementing it here.
1006 #ifndef PRODUCT
1007 if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) {
1008 tty->print_cr("*** Warning: Unimplemented predicate for intrinsic %s(%d)",
1009 vmIntrinsics::name_at(intrinsic_id()), intrinsic_id());
1010 }
1011 #endif
1012 Node* slow_ctl = control();
1013 set_control(top()); // No fast path instrinsic
1014 return slow_ctl;
1015 }
1016 }
1017
1018 //------------------------------set_result-------------------------------
1019 // Helper function for finishing intrinsics.
1020 void LibraryCallKit::set_result(RegionNode* region, PhiNode* value) {
1021 record_for_igvn(region);
1022 set_control(_gvn.transform(region));
1023 set_result( _gvn.transform(value));
1024 assert(value->type()->basic_type() == result()->bottom_type()->basic_type(), "sanity");
1025 }
1026
1027 //------------------------------generate_guard---------------------------
1028 // Helper function for generating guarded fast-slow graph structures.
1029 // The given 'test', if true, guards a slow path. If the test fails
1030 // then a fast path can be taken. (We generally hope it fails.)
1031 // In all cases, GraphKit::control() is updated to the fast path.
1032 // The returned value represents the control for the slow path.
1033 // The return value is never 'top'; it is either a valid control
1034 // or NULL if it is obvious that the slow path can never be taken.
1035 // Also, if region and the slow control are not NULL, the slow edge
1036 // is appended to the region.
1037 Node* LibraryCallKit::generate_guard(Node* test, RegionNode* region, float true_prob) {
1038 if (stopped()) {
1039 // Already short circuited.
1040 return NULL;
1041 }
1042
1043 // Build an if node and its projections.
1044 // If test is true we take the slow path, which we assume is uncommon.
1045 if (_gvn.type(test) == TypeInt::ZERO) {
1046 // The slow branch is never taken. No need to build this guard.
1047 return NULL;
1048 }
1049
1050 IfNode* iff = create_and_map_if(control(), test, true_prob, COUNT_UNKNOWN);
1051
1052 Node* if_slow = _gvn.transform(new (C) IfTrueNode(iff));
1053 if (if_slow == top()) {
1054 // The slow branch is never taken. No need to build this guard.
1055 return NULL;
1056 }
1057
1058 if (region != NULL)
1059 region->add_req(if_slow);
1060
1061 Node* if_fast = _gvn.transform(new (C) IfFalseNode(iff));
1062 set_control(if_fast);
1063
1064 return if_slow;
1065 }
1066
1067 inline Node* LibraryCallKit::generate_slow_guard(Node* test, RegionNode* region) {
1068 return generate_guard(test, region, PROB_UNLIKELY_MAG(3));
1069 }
1070 inline Node* LibraryCallKit::generate_fair_guard(Node* test, RegionNode* region) {
1071 return generate_guard(test, region, PROB_FAIR);
1072 }
1073
1074 inline Node* LibraryCallKit::generate_negative_guard(Node* index, RegionNode* region,
1075 Node* *pos_index) {
1076 if (stopped())
1077 return NULL; // already stopped
1078 if (_gvn.type(index)->higher_equal(TypeInt::POS)) // [0,maxint]
1079 return NULL; // index is already adequately typed
1080 Node* cmp_lt = _gvn.transform(new (C) CmpINode(index, intcon(0)));
1081 Node* bol_lt = _gvn.transform(new (C) BoolNode(cmp_lt, BoolTest::lt));
1082 Node* is_neg = generate_guard(bol_lt, region, PROB_MIN);
1083 if (is_neg != NULL && pos_index != NULL) {
1084 // Emulate effect of Parse::adjust_map_after_if.
1085 Node* ccast = new (C) CastIINode(index, TypeInt::POS);
1086 ccast->set_req(0, control());
1087 (*pos_index) = _gvn.transform(ccast);
1088 }
1089 return is_neg;
1090 }
1091
1092 inline Node* LibraryCallKit::generate_nonpositive_guard(Node* index, bool never_negative,
1093 Node* *pos_index) {
1094 if (stopped())
1095 return NULL; // already stopped
1096 if (_gvn.type(index)->higher_equal(TypeInt::POS1)) // [1,maxint]
1097 return NULL; // index is already adequately typed
1098 Node* cmp_le = _gvn.transform(new (C) CmpINode(index, intcon(0)));
1099 BoolTest::mask le_or_eq = (never_negative ? BoolTest::eq : BoolTest::le);
1100 Node* bol_le = _gvn.transform(new (C) BoolNode(cmp_le, le_or_eq));
1101 Node* is_notp = generate_guard(bol_le, NULL, PROB_MIN);
1102 if (is_notp != NULL && pos_index != NULL) {
1103 // Emulate effect of Parse::adjust_map_after_if.
1104 Node* ccast = new (C) CastIINode(index, TypeInt::POS1);
1105 ccast->set_req(0, control());
1106 (*pos_index) = _gvn.transform(ccast);
1107 }
1108 return is_notp;
1109 }
1110
1111 // Make sure that 'position' is a valid limit index, in [0..length].
1112 // There are two equivalent plans for checking this:
1113 // A. (offset + copyLength) unsigned<= arrayLength
1114 // B. offset <= (arrayLength - copyLength)
1115 // We require that all of the values above, except for the sum and
1116 // difference, are already known to be non-negative.
1117 // Plan A is robust in the face of overflow, if offset and copyLength
1118 // are both hugely positive.
1119 //
1120 // Plan B is less direct and intuitive, but it does not overflow at
1121 // all, since the difference of two non-negatives is always
1122 // representable. Whenever Java methods must perform the equivalent
1123 // check they generally use Plan B instead of Plan A.
1124 // For the moment we use Plan A.
1125 inline Node* LibraryCallKit::generate_limit_guard(Node* offset,
1126 Node* subseq_length,
1127 Node* array_length,
1128 RegionNode* region) {
1129 if (stopped())
1130 return NULL; // already stopped
1131 bool zero_offset = _gvn.type(offset) == TypeInt::ZERO;
1132 if (zero_offset && subseq_length->eqv_uncast(array_length))
1133 return NULL; // common case of whole-array copy
1134 Node* last = subseq_length;
1135 if (!zero_offset) // last += offset
1136 last = _gvn.transform(new (C) AddINode(last, offset));
1137 Node* cmp_lt = _gvn.transform(new (C) CmpUNode(array_length, last));
1138 Node* bol_lt = _gvn.transform(new (C) BoolNode(cmp_lt, BoolTest::lt));
1139 Node* is_over = generate_guard(bol_lt, region, PROB_MIN);
1140 return is_over;
1141 }
1142
1143
1144 //--------------------------generate_current_thread--------------------
1145 Node* LibraryCallKit::generate_current_thread(Node* &tls_output) {
1146 ciKlass* thread_klass = env()->Thread_klass();
1147 const Type* thread_type = TypeOopPtr::make_from_klass(thread_klass)->cast_to_ptr_type(TypePtr::NotNull);
1148 Node* thread = _gvn.transform(new (C) ThreadLocalNode());
1149 Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(JavaThread::threadObj_offset()));
1150 Node* threadObj = make_load(NULL, p, thread_type, T_OBJECT, MemNode::unordered);
1151 tls_output = thread;
1152 return threadObj;
1153 }
1154
1155
1156 //------------------------------make_string_method_node------------------------
1157 // Helper method for String intrinsic functions. This version is called
1158 // with str1 and str2 pointing to String object nodes.
1159 //
1160 Node* LibraryCallKit::make_string_method_node(int opcode, Node* str1, Node* str2) {
1161 Node* no_ctrl = NULL;
1162
1163 // Get start addr of string
1164 Node* str1_value = load_String_value(no_ctrl, str1);
1165 Node* str1_offset = load_String_offset(no_ctrl, str1);
1166 Node* str1_start = array_element_address(str1_value, str1_offset, T_CHAR);
1167
1168 // Get length of string 1
1169 Node* str1_len = load_String_length(no_ctrl, str1);
1170
1171 Node* str2_value = load_String_value(no_ctrl, str2);
1172 Node* str2_offset = load_String_offset(no_ctrl, str2);
1173 Node* str2_start = array_element_address(str2_value, str2_offset, T_CHAR);
1174
1175 Node* str2_len = NULL;
1176 Node* result = NULL;
1177
1178 switch (opcode) {
1179 case Op_StrIndexOf:
1180 // Get length of string 2
1181 str2_len = load_String_length(no_ctrl, str2);
1182
1183 result = new (C) StrIndexOfNode(control(), memory(TypeAryPtr::CHARS),
1184 str1_start, str1_len, str2_start, str2_len);
1185 break;
1186 case Op_StrComp:
1187 // Get length of string 2
1188 str2_len = load_String_length(no_ctrl, str2);
1189
1190 result = new (C) StrCompNode(control(), memory(TypeAryPtr::CHARS),
1191 str1_start, str1_len, str2_start, str2_len);
1192 break;
1193 case Op_StrEquals:
1194 result = new (C) StrEqualsNode(control(), memory(TypeAryPtr::CHARS),
1195 str1_start, str2_start, str1_len);
1196 break;
1197 default:
1198 ShouldNotReachHere();
1199 return NULL;
1200 }
1201
1202 // All these intrinsics have checks.
1203 C->set_has_split_ifs(true); // Has chance for split-if optimization
1204
1205 return _gvn.transform(result);
1206 }
1207
1208 // Helper method for String intrinsic functions. This version is called
1209 // with str1 and str2 pointing to char[] nodes, with cnt1 and cnt2 pointing
1210 // to Int nodes containing the lenghts of str1 and str2.
1211 //
1212 Node* LibraryCallKit::make_string_method_node(int opcode, Node* str1_start, Node* cnt1, Node* str2_start, Node* cnt2) {
1213 Node* result = NULL;
1214 switch (opcode) {
1215 case Op_StrIndexOf:
1216 result = new (C) StrIndexOfNode(control(), memory(TypeAryPtr::CHARS),
1217 str1_start, cnt1, str2_start, cnt2);
1218 break;
1219 case Op_StrComp:
1220 result = new (C) StrCompNode(control(), memory(TypeAryPtr::CHARS),
1221 str1_start, cnt1, str2_start, cnt2);
1222 break;
1223 case Op_StrEquals:
1224 result = new (C) StrEqualsNode(control(), memory(TypeAryPtr::CHARS),
1225 str1_start, str2_start, cnt1);
1226 break;
1227 default:
1228 ShouldNotReachHere();
1229 return NULL;
1230 }
1231
1232 // All these intrinsics have checks.
1233 C->set_has_split_ifs(true); // Has chance for split-if optimization
1234
1235 return _gvn.transform(result);
1236 }
1237
1238 //------------------------------inline_string_compareTo------------------------
1239 // public int java.lang.String.compareTo(String anotherString);
1240 bool LibraryCallKit::inline_string_compareTo() {
1241 Node* receiver = null_check(argument(0));
1242 Node* arg = null_check(argument(1));
1243 if (stopped()) {
1244 return true;
1245 }
1246 set_result(make_string_method_node(Op_StrComp, receiver, arg));
1247 return true;
1248 }
1249
1250 //------------------------------inline_string_equals------------------------
1251 bool LibraryCallKit::inline_string_equals() {
1252 Node* receiver = null_check_receiver();
1253 // NOTE: Do not null check argument for String.equals() because spec
1254 // allows to specify NULL as argument.
1255 Node* argument = this->argument(1);
1256 if (stopped()) {
1257 return true;
1258 }
1259
1260 // paths (plus control) merge
1261 RegionNode* region = new (C) RegionNode(5);
1262 Node* phi = new (C) PhiNode(region, TypeInt::BOOL);
1263
1264 // does source == target string?
1265 Node* cmp = _gvn.transform(new (C) CmpPNode(receiver, argument));
1266 Node* bol = _gvn.transform(new (C) BoolNode(cmp, BoolTest::eq));
1267
1268 Node* if_eq = generate_slow_guard(bol, NULL);
1269 if (if_eq != NULL) {
1270 // receiver == argument
1271 phi->init_req(2, intcon(1));
1272 region->init_req(2, if_eq);
1273 }
1274
1275 // get String klass for instanceOf
1276 ciInstanceKlass* klass = env()->String_klass();
1277
1278 if (!stopped()) {
1279 Node* inst = gen_instanceof(argument, makecon(TypeKlassPtr::make(klass)));
1280 Node* cmp = _gvn.transform(new (C) CmpINode(inst, intcon(1)));
1281 Node* bol = _gvn.transform(new (C) BoolNode(cmp, BoolTest::ne));
1282
1283 Node* inst_false = generate_guard(bol, NULL, PROB_MIN);
1284 //instanceOf == true, fallthrough
1285
1286 if (inst_false != NULL) {
1287 phi->init_req(3, intcon(0));
1288 region->init_req(3, inst_false);
1289 }
1290 }
1291
1292 if (!stopped()) {
1293 const TypeOopPtr* string_type = TypeOopPtr::make_from_klass(klass);
1294
1295 // Properly cast the argument to String
1296 argument = _gvn.transform(new (C) CheckCastPPNode(control(), argument, string_type));
1297 // This path is taken only when argument's type is String:NotNull.
1298 argument = cast_not_null(argument, false);
1299
1300 Node* no_ctrl = NULL;
1301
1302 // Get start addr of receiver
1303 Node* receiver_val = load_String_value(no_ctrl, receiver);
1304 Node* receiver_offset = load_String_offset(no_ctrl, receiver);
1305 Node* receiver_start = array_element_address(receiver_val, receiver_offset, T_CHAR);
1306
1307 // Get length of receiver
1308 Node* receiver_cnt = load_String_length(no_ctrl, receiver);
1309
1310 // Get start addr of argument
1311 Node* argument_val = load_String_value(no_ctrl, argument);
1312 Node* argument_offset = load_String_offset(no_ctrl, argument);
1313 Node* argument_start = array_element_address(argument_val, argument_offset, T_CHAR);
1314
1315 // Get length of argument
1316 Node* argument_cnt = load_String_length(no_ctrl, argument);
1317
1318 // Check for receiver count != argument count
1319 Node* cmp = _gvn.transform(new(C) CmpINode(receiver_cnt, argument_cnt));
1320 Node* bol = _gvn.transform(new(C) BoolNode(cmp, BoolTest::ne));
1321 Node* if_ne = generate_slow_guard(bol, NULL);
1322 if (if_ne != NULL) {
1323 phi->init_req(4, intcon(0));
1324 region->init_req(4, if_ne);
1325 }
1326
1327 // Check for count == 0 is done by assembler code for StrEquals.
1328
1329 if (!stopped()) {
1330 Node* equals = make_string_method_node(Op_StrEquals, receiver_start, receiver_cnt, argument_start, argument_cnt);
1331 phi->init_req(1, equals);
1332 region->init_req(1, control());
1333 }
1334 }
1335
1336 // post merge
1337 set_control(_gvn.transform(region));
1338 record_for_igvn(region);
1339
1340 set_result(_gvn.transform(phi));
1341 return true;
1342 }
1343
1344 //------------------------------inline_array_equals----------------------------
1345 bool LibraryCallKit::inline_array_equals() {
1346 Node* arg1 = argument(0);
1347 Node* arg2 = argument(1);
1348 set_result(_gvn.transform(new (C) AryEqNode(control(), memory(TypeAryPtr::CHARS), arg1, arg2)));
1349 return true;
1350 }
1351
1352 // Java version of String.indexOf(constant string)
1353 // class StringDecl {
1354 // StringDecl(char[] ca) {
1355 // offset = 0;
1356 // count = ca.length;
1357 // value = ca;
1358 // }
1359 // int offset;
1360 // int count;
1361 // char[] value;
1362 // }
1363 //
1364 // static int string_indexOf_J(StringDecl string_object, char[] target_object,
1365 // int targetOffset, int cache_i, int md2) {
1366 // int cache = cache_i;
1367 // int sourceOffset = string_object.offset;
1368 // int sourceCount = string_object.count;
1369 // int targetCount = target_object.length;
1370 //
1371 // int targetCountLess1 = targetCount - 1;
1372 // int sourceEnd = sourceOffset + sourceCount - targetCountLess1;
1373 //
1374 // char[] source = string_object.value;
1375 // char[] target = target_object;
1376 // int lastChar = target[targetCountLess1];
1377 //
1378 // outer_loop:
1379 // for (int i = sourceOffset; i < sourceEnd; ) {
1380 // int src = source[i + targetCountLess1];
1381 // if (src == lastChar) {
1382 // // With random strings and a 4-character alphabet,
1383 // // reverse matching at this point sets up 0.8% fewer
1384 // // frames, but (paradoxically) makes 0.3% more probes.
1385 // // Since those probes are nearer the lastChar probe,
1386 // // there is may be a net D$ win with reverse matching.
1387 // // But, reversing loop inhibits unroll of inner loop
1388 // // for unknown reason. So, does running outer loop from
1389 // // (sourceOffset - targetCountLess1) to (sourceOffset + sourceCount)
1390 // for (int j = 0; j < targetCountLess1; j++) {
1391 // if (target[targetOffset + j] != source[i+j]) {
1392 // if ((cache & (1 << source[i+j])) == 0) {
1393 // if (md2 < j+1) {
1394 // i += j+1;
1395 // continue outer_loop;
1396 // }
1397 // }
1398 // i += md2;
1399 // continue outer_loop;
1400 // }
1401 // }
1402 // return i - sourceOffset;
1403 // }
1404 // if ((cache & (1 << src)) == 0) {
1405 // i += targetCountLess1;
1406 // } // using "i += targetCount;" and an "else i++;" causes a jump to jump.
1407 // i++;
1408 // }
1409 // return -1;
1410 // }
1411
1412 //------------------------------string_indexOf------------------------
1413 Node* LibraryCallKit::string_indexOf(Node* string_object, ciTypeArray* target_array, jint targetOffset_i,
1414 jint cache_i, jint md2_i) {
1415
1416 Node* no_ctrl = NULL;
1417 float likely = PROB_LIKELY(0.9);
1418 float unlikely = PROB_UNLIKELY(0.9);
1419
1420 const int nargs = 0; // no arguments to push back for uncommon trap in predicate
1421
1422 Node* source = load_String_value(no_ctrl, string_object);
1423 Node* sourceOffset = load_String_offset(no_ctrl, string_object);
1424 Node* sourceCount = load_String_length(no_ctrl, string_object);
1425
1426 Node* target = _gvn.transform( makecon(TypeOopPtr::make_from_constant(target_array, true)));
1427 jint target_length = target_array->length();
1428 const TypeAry* target_array_type = TypeAry::make(TypeInt::CHAR, TypeInt::make(0, target_length, Type::WidenMin));
1429 const TypeAryPtr* target_type = TypeAryPtr::make(TypePtr::BotPTR, target_array_type, target_array->klass(), true, Type::OffsetBot);
1430
1431 // String.value field is known to be @Stable.
1432 if (UseImplicitStableValues) {
1433 target = cast_array_to_stable(target, target_type);
1434 }
1435
1436 IdealKit kit(this, false, true);
1437 #define __ kit.
1438 Node* zero = __ ConI(0);
1439 Node* one = __ ConI(1);
1440 Node* cache = __ ConI(cache_i);
1441 Node* md2 = __ ConI(md2_i);
1442 Node* lastChar = __ ConI(target_array->char_at(target_length - 1));
1443 Node* targetCount = __ ConI(target_length);
1444 Node* targetCountLess1 = __ ConI(target_length - 1);
1445 Node* targetOffset = __ ConI(targetOffset_i);
1446 Node* sourceEnd = __ SubI(__ AddI(sourceOffset, sourceCount), targetCountLess1);
1447
1448 IdealVariable rtn(kit), i(kit), j(kit); __ declarations_done();
1449 Node* outer_loop = __ make_label(2 /* goto */);
1450 Node* return_ = __ make_label(1);
1451
1452 __ set(rtn,__ ConI(-1));
1453 __ loop(this, nargs, i, sourceOffset, BoolTest::lt, sourceEnd); {
1454 Node* i2 = __ AddI(__ value(i), targetCountLess1);
1455 // pin to prohibit loading of "next iteration" value which may SEGV (rare)
1456 Node* src = load_array_element(__ ctrl(), source, i2, TypeAryPtr::CHARS);
1457 __ if_then(src, BoolTest::eq, lastChar, unlikely); {
1458 __ loop(this, nargs, j, zero, BoolTest::lt, targetCountLess1); {
1459 Node* tpj = __ AddI(targetOffset, __ value(j));
1460 Node* targ = load_array_element(no_ctrl, target, tpj, target_type);
1461 Node* ipj = __ AddI(__ value(i), __ value(j));
1462 Node* src2 = load_array_element(no_ctrl, source, ipj, TypeAryPtr::CHARS);
1463 __ if_then(targ, BoolTest::ne, src2); {
1464 __ if_then(__ AndI(cache, __ LShiftI(one, src2)), BoolTest::eq, zero); {
1465 __ if_then(md2, BoolTest::lt, __ AddI(__ value(j), one)); {
1466 __ increment(i, __ AddI(__ value(j), one));
1467 __ goto_(outer_loop);
1468 } __ end_if(); __ dead(j);
1469 }__ end_if(); __ dead(j);
1470 __ increment(i, md2);
1471 __ goto_(outer_loop);
1472 }__ end_if();
1473 __ increment(j, one);
1474 }__ end_loop(); __ dead(j);
1475 __ set(rtn, __ SubI(__ value(i), sourceOffset)); __ dead(i);
1476 __ goto_(return_);
1477 }__ end_if();
1478 __ if_then(__ AndI(cache, __ LShiftI(one, src)), BoolTest::eq, zero, likely); {
1479 __ increment(i, targetCountLess1);
1480 }__ end_if();
1481 __ increment(i, one);
1482 __ bind(outer_loop);
1483 }__ end_loop(); __ dead(i);
1484 __ bind(return_);
1485
1486 // Final sync IdealKit and GraphKit.
1487 final_sync(kit);
1488 Node* result = __ value(rtn);
1489 #undef __
1490 C->set_has_loops(true);
1491 return result;
1492 }
1493
1494 //------------------------------inline_string_indexOf------------------------
1495 bool LibraryCallKit::inline_string_indexOf() {
1496 Node* receiver = argument(0);
1497 Node* arg = argument(1);
1498
1499 Node* result;
1500 // Disable the use of pcmpestri until it can be guaranteed that
1501 // the load doesn't cross into the uncommited space.
1502 if (Matcher::has_match_rule(Op_StrIndexOf) &&
1503 UseSSE42Intrinsics) {
1504 // Generate SSE4.2 version of indexOf
1505 // We currently only have match rules that use SSE4.2
1506
1507 receiver = null_check(receiver);
1508 arg = null_check(arg);
1509 if (stopped()) {
1510 return true;
1511 }
1512
1513 ciInstanceKlass* str_klass = env()->String_klass();
1514 const TypeOopPtr* string_type = TypeOopPtr::make_from_klass(str_klass);
1515
1516 // Make the merge point
1517 RegionNode* result_rgn = new (C) RegionNode(4);
1518 Node* result_phi = new (C) PhiNode(result_rgn, TypeInt::INT);
1519 Node* no_ctrl = NULL;
1520
1521 // Get start addr of source string
1522 Node* source = load_String_value(no_ctrl, receiver);
1523 Node* source_offset = load_String_offset(no_ctrl, receiver);
1524 Node* source_start = array_element_address(source, source_offset, T_CHAR);
1525
1526 // Get length of source string
1527 Node* source_cnt = load_String_length(no_ctrl, receiver);
1528
1529 // Get start addr of substring
1530 Node* substr = load_String_value(no_ctrl, arg);
1531 Node* substr_offset = load_String_offset(no_ctrl, arg);
1532 Node* substr_start = array_element_address(substr, substr_offset, T_CHAR);
1533
1534 // Get length of source string
1535 Node* substr_cnt = load_String_length(no_ctrl, arg);
1536
1537 // Check for substr count > string count
1538 Node* cmp = _gvn.transform(new(C) CmpINode(substr_cnt, source_cnt));
1539 Node* bol = _gvn.transform(new(C) BoolNode(cmp, BoolTest::gt));
1540 Node* if_gt = generate_slow_guard(bol, NULL);
1541 if (if_gt != NULL) {
1542 result_phi->init_req(2, intcon(-1));
1543 result_rgn->init_req(2, if_gt);
1544 }
1545
1546 if (!stopped()) {
1547 // Check for substr count == 0
1548 cmp = _gvn.transform(new(C) CmpINode(substr_cnt, intcon(0)));
1549 bol = _gvn.transform(new(C) BoolNode(cmp, BoolTest::eq));
1550 Node* if_zero = generate_slow_guard(bol, NULL);
1551 if (if_zero != NULL) {
1552 result_phi->init_req(3, intcon(0));
1553 result_rgn->init_req(3, if_zero);
1554 }
1555 }
1556
1557 if (!stopped()) {
1558 result = make_string_method_node(Op_StrIndexOf, source_start, source_cnt, substr_start, substr_cnt);
1559 result_phi->init_req(1, result);
1560 result_rgn->init_req(1, control());
1561 }
1562 set_control(_gvn.transform(result_rgn));
1563 record_for_igvn(result_rgn);
1564 result = _gvn.transform(result_phi);
1565
1566 } else { // Use LibraryCallKit::string_indexOf
1567 // don't intrinsify if argument isn't a constant string.
1568 if (!arg->is_Con()) {
1569 return false;
1570 }
1571 const TypeOopPtr* str_type = _gvn.type(arg)->isa_oopptr();
1572 if (str_type == NULL) {
1573 return false;
1574 }
1575 ciInstanceKlass* klass = env()->String_klass();
1576 ciObject* str_const = str_type->const_oop();
1577 if (str_const == NULL || str_const->klass() != klass) {
1578 return false;
1579 }
1580 ciInstance* str = str_const->as_instance();
1581 assert(str != NULL, "must be instance");
1582
1583 ciObject* v = str->field_value_by_offset(java_lang_String::value_offset_in_bytes()).as_object();
1584 ciTypeArray* pat = v->as_type_array(); // pattern (argument) character array
1585
1586 int o;
1587 int c;
1588 if (java_lang_String::has_offset_field()) {
1589 o = str->field_value_by_offset(java_lang_String::offset_offset_in_bytes()).as_int();
1590 c = str->field_value_by_offset(java_lang_String::count_offset_in_bytes()).as_int();
1591 } else {
1592 o = 0;
1593 c = pat->length();
1594 }
1595
1596 // constant strings have no offset and count == length which
1597 // simplifies the resulting code somewhat so lets optimize for that.
1598 if (o != 0 || c != pat->length()) {
1599 return false;
1600 }
1601
1602 receiver = null_check(receiver, T_OBJECT);
1603 // NOTE: No null check on the argument is needed since it's a constant String oop.
1604 if (stopped()) {
1605 return true;
1606 }
1607
1608 // The null string as a pattern always returns 0 (match at beginning of string)
1609 if (c == 0) {
1610 set_result(intcon(0));
1611 return true;
1612 }
1613
1614 // Generate default indexOf
1615 jchar lastChar = pat->char_at(o + (c - 1));
1616 int cache = 0;
1617 int i;
1618 for (i = 0; i < c - 1; i++) {
1619 assert(i < pat->length(), "out of range");
1620 cache |= (1 << (pat->char_at(o + i) & (sizeof(cache) * BitsPerByte - 1)));
1621 }
1622
1623 int md2 = c;
1624 for (i = 0; i < c - 1; i++) {
1625 assert(i < pat->length(), "out of range");
1626 if (pat->char_at(o + i) == lastChar) {
1627 md2 = (c - 1) - i;
1628 }
1629 }
1630
1631 result = string_indexOf(receiver, pat, o, cache, md2);
1632 }
1633 set_result(result);
1634 return true;
1635 }
1636
1637 //--------------------------round_double_node--------------------------------
1638 // Round a double node if necessary.
1639 Node* LibraryCallKit::round_double_node(Node* n) {
1640 if (Matcher::strict_fp_requires_explicit_rounding && UseSSE <= 1)
1641 n = _gvn.transform(new (C) RoundDoubleNode(0, n));
1642 return n;
1643 }
1644
1645 //------------------------------inline_math-----------------------------------
1646 // public static double Math.abs(double)
1647 // public static double Math.sqrt(double)
1648 // public static double Math.log(double)
1649 // public static double Math.log10(double)
1650 bool LibraryCallKit::inline_math(vmIntrinsics::ID id) {
1651 Node* arg = round_double_node(argument(0));
1652 Node* n = NULL;
1653 switch (id) {
1654 case vmIntrinsics::_dabs: n = new (C) AbsDNode( arg); break;
1655 case vmIntrinsics::_dsqrt: n = new (C) SqrtDNode(C, control(), arg); break;
1656 case vmIntrinsics::_dlog: n = new (C) LogDNode(C, control(), arg); break;
1657 case vmIntrinsics::_dlog10: n = new (C) Log10DNode(C, control(), arg); break;
1658 default: fatal_unexpected_iid(id); break;
1659 }
1660 set_result(_gvn.transform(n));
1661 return true;
1662 }
1663
1664 //------------------------------inline_trig----------------------------------
1665 // Inline sin/cos/tan instructions, if possible. If rounding is required, do
1666 // argument reduction which will turn into a fast/slow diamond.
1667 bool LibraryCallKit::inline_trig(vmIntrinsics::ID id) {
1668 Node* arg = round_double_node(argument(0));
1669 Node* n = NULL;
1670
1671 switch (id) {
1672 case vmIntrinsics::_dsin: n = new (C) SinDNode(C, control(), arg); break;
1673 case vmIntrinsics::_dcos: n = new (C) CosDNode(C, control(), arg); break;
1674 case vmIntrinsics::_dtan: n = new (C) TanDNode(C, control(), arg); break;
1675 default: fatal_unexpected_iid(id); break;
1676 }
1677 n = _gvn.transform(n);
1678
1679 // Rounding required? Check for argument reduction!
1680 if (Matcher::strict_fp_requires_explicit_rounding) {
1681 static const double pi_4 = 0.7853981633974483;
1682 static const double neg_pi_4 = -0.7853981633974483;
1683 // pi/2 in 80-bit extended precision
1684 // static const unsigned char pi_2_bits_x[] = {0x35,0xc2,0x68,0x21,0xa2,0xda,0x0f,0xc9,0xff,0x3f,0x00,0x00,0x00,0x00,0x00,0x00};
1685 // -pi/2 in 80-bit extended precision
1686 // static const unsigned char neg_pi_2_bits_x[] = {0x35,0xc2,0x68,0x21,0xa2,0xda,0x0f,0xc9,0xff,0xbf,0x00,0x00,0x00,0x00,0x00,0x00};
1687 // Cutoff value for using this argument reduction technique
1688 //static const double pi_2_minus_epsilon = 1.564660403643354;
1689 //static const double neg_pi_2_plus_epsilon = -1.564660403643354;
1690
1691 // Pseudocode for sin:
1692 // if (x <= Math.PI / 4.0) {
1693 // if (x >= -Math.PI / 4.0) return fsin(x);
1694 // if (x >= -Math.PI / 2.0) return -fcos(x + Math.PI / 2.0);
1695 // } else {
1696 // if (x <= Math.PI / 2.0) return fcos(x - Math.PI / 2.0);
1697 // }
1698 // return StrictMath.sin(x);
1699
1700 // Pseudocode for cos:
1701 // if (x <= Math.PI / 4.0) {
1702 // if (x >= -Math.PI / 4.0) return fcos(x);
1703 // if (x >= -Math.PI / 2.0) return fsin(x + Math.PI / 2.0);
1704 // } else {
1705 // if (x <= Math.PI / 2.0) return -fsin(x - Math.PI / 2.0);
1706 // }
1707 // return StrictMath.cos(x);
1708
1709 // Actually, sticking in an 80-bit Intel value into C2 will be tough; it
1710 // requires a special machine instruction to load it. Instead we'll try
1711 // the 'easy' case. If we really need the extra range +/- PI/2 we'll
1712 // probably do the math inside the SIN encoding.
1713
1714 // Make the merge point
1715 RegionNode* r = new (C) RegionNode(3);
1716 Node* phi = new (C) PhiNode(r, Type::DOUBLE);
1717
1718 // Flatten arg so we need only 1 test
1719 Node *abs = _gvn.transform(new (C) AbsDNode(arg));
1720 // Node for PI/4 constant
1721 Node *pi4 = makecon(TypeD::make(pi_4));
1722 // Check PI/4 : abs(arg)
1723 Node *cmp = _gvn.transform(new (C) CmpDNode(pi4,abs));
1724 // Check: If PI/4 < abs(arg) then go slow
1725 Node *bol = _gvn.transform(new (C) BoolNode( cmp, BoolTest::lt ));
1726 // Branch either way
1727 IfNode *iff = create_and_xform_if(control(),bol, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
1728 set_control(opt_iff(r,iff));
1729
1730 // Set fast path result
1731 phi->init_req(2, n);
1732
1733 // Slow path - non-blocking leaf call
1734 Node* call = NULL;
1735 switch (id) {
1736 case vmIntrinsics::_dsin:
1737 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(),
1738 CAST_FROM_FN_PTR(address, SharedRuntime::dsin),
1739 "Sin", NULL, arg, top());
1740 break;
1741 case vmIntrinsics::_dcos:
1742 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(),
1743 CAST_FROM_FN_PTR(address, SharedRuntime::dcos),
1744 "Cos", NULL, arg, top());
1745 break;
1746 case vmIntrinsics::_dtan:
1747 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(),
1748 CAST_FROM_FN_PTR(address, SharedRuntime::dtan),
1749 "Tan", NULL, arg, top());
1750 break;
1751 }
1752 assert(control()->in(0) == call, "");
1753 Node* slow_result = _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms));
1754 r->init_req(1, control());
1755 phi->init_req(1, slow_result);
1756
1757 // Post-merge
1758 set_control(_gvn.transform(r));
1759 record_for_igvn(r);
1760 n = _gvn.transform(phi);
1761
1762 C->set_has_split_ifs(true); // Has chance for split-if optimization
1763 }
1764 set_result(n);
1765 return true;
1766 }
1767
1768 Node* LibraryCallKit::finish_pow_exp(Node* result, Node* x, Node* y, const TypeFunc* call_type, address funcAddr, const char* funcName) {
1769 //-------------------
1770 //result=(result.isNaN())? funcAddr():result;
1771 // Check: If isNaN() by checking result!=result? then either trap
1772 // or go to runtime
1773 Node* cmpisnan = _gvn.transform(new (C) CmpDNode(result, result));
1774 // Build the boolean node
1775 Node* bolisnum = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::eq));
1776
1777 if (!too_many_traps(Deoptimization::Reason_intrinsic)) {
1778 { BuildCutout unless(this, bolisnum, PROB_STATIC_FREQUENT);
1779 // The pow or exp intrinsic returned a NaN, which requires a call
1780 // to the runtime. Recompile with the runtime call.
1781 uncommon_trap(Deoptimization::Reason_intrinsic,
1782 Deoptimization::Action_make_not_entrant);
1783 }
1784 return result;
1785 } else {
1786 // If this inlining ever returned NaN in the past, we compile a call
1787 // to the runtime to properly handle corner cases
1788
1789 IfNode* iff = create_and_xform_if(control(), bolisnum, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
1790 Node* if_slow = _gvn.transform(new (C) IfFalseNode(iff));
1791 Node* if_fast = _gvn.transform(new (C) IfTrueNode(iff));
1792
1793 if (!if_slow->is_top()) {
1794 RegionNode* result_region = new (C) RegionNode(3);
1795 PhiNode* result_val = new (C) PhiNode(result_region, Type::DOUBLE);
1796
1797 result_region->init_req(1, if_fast);
1798 result_val->init_req(1, result);
1799
1800 set_control(if_slow);
1801
1802 const TypePtr* no_memory_effects = NULL;
1803 Node* rt = make_runtime_call(RC_LEAF, call_type, funcAddr, funcName,
1804 no_memory_effects,
1805 x, top(), y, y ? top() : NULL);
1806 Node* value = _gvn.transform(new (C) ProjNode(rt, TypeFunc::Parms+0));
1807 #ifdef ASSERT
1808 Node* value_top = _gvn.transform(new (C) ProjNode(rt, TypeFunc::Parms+1));
1809 assert(value_top == top(), "second value must be top");
1810 #endif
1811
1812 result_region->init_req(2, control());
1813 result_val->init_req(2, value);
1814 set_control(_gvn.transform(result_region));
1815 return _gvn.transform(result_val);
1816 } else {
1817 return result;
1818 }
1819 }
1820 }
1821
1822 //------------------------------inline_exp-------------------------------------
1823 // Inline exp instructions, if possible. The Intel hardware only misses
1824 // really odd corner cases (+/- Infinity). Just uncommon-trap them.
1825 bool LibraryCallKit::inline_exp() {
1826 Node* arg = round_double_node(argument(0));
1827 Node* n = _gvn.transform(new (C) ExpDNode(C, control(), arg));
1828
1829 n = finish_pow_exp(n, arg, NULL, OptoRuntime::Math_D_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dexp), "EXP");
1830 set_result(n);
1831
1832 C->set_has_split_ifs(true); // Has chance for split-if optimization
1833 return true;
1834 }
1835
1836 //------------------------------inline_pow-------------------------------------
1837 // Inline power instructions, if possible.
1838 bool LibraryCallKit::inline_pow() {
1839 // Pseudocode for pow
1840 // if (y == 2) {
1841 // return x * x;
1842 // } else {
1843 // if (x <= 0.0) {
1844 // long longy = (long)y;
1845 // if ((double)longy == y) { // if y is long
1846 // if (y + 1 == y) longy = 0; // huge number: even
1847 // result = ((1&longy) == 0)?-DPow(abs(x), y):DPow(abs(x), y);
1848 // } else {
1849 // result = NaN;
1850 // }
1851 // } else {
1852 // result = DPow(x,y);
1853 // }
1854 // if (result != result)? {
1855 // result = uncommon_trap() or runtime_call();
1856 // }
1857 // return result;
1858 // }
1859
1860 Node* x = round_double_node(argument(0));
1861 Node* y = round_double_node(argument(2));
1862
1863 Node* result = NULL;
1864
1865 Node* const_two_node = makecon(TypeD::make(2.0));
1866 Node* cmp_node = _gvn.transform(new (C) CmpDNode(y, const_two_node));
1867 Node* bool_node = _gvn.transform(new (C) BoolNode(cmp_node, BoolTest::eq));
1868 IfNode* if_node = create_and_xform_if(control(), bool_node, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN);
1869 Node* if_true = _gvn.transform(new (C) IfTrueNode(if_node));
1870 Node* if_false = _gvn.transform(new (C) IfFalseNode(if_node));
1871
1872 RegionNode* region_node = new (C) RegionNode(3);
1873 region_node->init_req(1, if_true);
1874
1875 Node* phi_node = new (C) PhiNode(region_node, Type::DOUBLE);
1876 // special case for x^y where y == 2, we can convert it to x * x
1877 phi_node->init_req(1, _gvn.transform(new (C) MulDNode(x, x)));
1878
1879 // set control to if_false since we will now process the false branch
1880 set_control(if_false);
1881
1882 if (!too_many_traps(Deoptimization::Reason_intrinsic)) {
1883 // Short form: skip the fancy tests and just check for NaN result.
1884 result = _gvn.transform(new (C) PowDNode(C, control(), x, y));
1885 } else {
1886 // If this inlining ever returned NaN in the past, include all
1887 // checks + call to the runtime.
1888
1889 // Set the merge point for If node with condition of (x <= 0.0)
1890 // There are four possible paths to region node and phi node
1891 RegionNode *r = new (C) RegionNode(4);
1892 Node *phi = new (C) PhiNode(r, Type::DOUBLE);
1893
1894 // Build the first if node: if (x <= 0.0)
1895 // Node for 0 constant
1896 Node *zeronode = makecon(TypeD::ZERO);
1897 // Check x:0
1898 Node *cmp = _gvn.transform(new (C) CmpDNode(x, zeronode));
1899 // Check: If (x<=0) then go complex path
1900 Node *bol1 = _gvn.transform(new (C) BoolNode( cmp, BoolTest::le ));
1901 // Branch either way
1902 IfNode *if1 = create_and_xform_if(control(),bol1, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN);
1903 // Fast path taken; set region slot 3
1904 Node *fast_taken = _gvn.transform(new (C) IfFalseNode(if1));
1905 r->init_req(3,fast_taken); // Capture fast-control
1906
1907 // Fast path not-taken, i.e. slow path
1908 Node *complex_path = _gvn.transform(new (C) IfTrueNode(if1));
1909
1910 // Set fast path result
1911 Node *fast_result = _gvn.transform(new (C) PowDNode(C, control(), x, y));
1912 phi->init_req(3, fast_result);
1913
1914 // Complex path
1915 // Build the second if node (if y is long)
1916 // Node for (long)y
1917 Node *longy = _gvn.transform(new (C) ConvD2LNode(y));
1918 // Node for (double)((long) y)
1919 Node *doublelongy= _gvn.transform(new (C) ConvL2DNode(longy));
1920 // Check (double)((long) y) : y
1921 Node *cmplongy= _gvn.transform(new (C) CmpDNode(doublelongy, y));
1922 // Check if (y isn't long) then go to slow path
1923
1924 Node *bol2 = _gvn.transform(new (C) BoolNode( cmplongy, BoolTest::ne ));
1925 // Branch either way
1926 IfNode *if2 = create_and_xform_if(complex_path,bol2, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN);
1927 Node* ylong_path = _gvn.transform(new (C) IfFalseNode(if2));
1928
1929 Node *slow_path = _gvn.transform(new (C) IfTrueNode(if2));
1930
1931 // Calculate DPow(abs(x), y)*(1 & (long)y)
1932 // Node for constant 1
1933 Node *conone = longcon(1);
1934 // 1& (long)y
1935 Node *signnode= _gvn.transform(new (C) AndLNode(conone, longy));
1936
1937 // A huge number is always even. Detect a huge number by checking
1938 // if y + 1 == y and set integer to be tested for parity to 0.
1939 // Required for corner case:
1940 // (long)9.223372036854776E18 = max_jlong
1941 // (double)(long)9.223372036854776E18 = 9.223372036854776E18
1942 // max_jlong is odd but 9.223372036854776E18 is even
1943 Node* yplus1 = _gvn.transform(new (C) AddDNode(y, makecon(TypeD::make(1))));
1944 Node *cmpyplus1= _gvn.transform(new (C) CmpDNode(yplus1, y));
1945 Node *bolyplus1 = _gvn.transform(new (C) BoolNode( cmpyplus1, BoolTest::eq ));
1946 Node* correctedsign = NULL;
1947 if (ConditionalMoveLimit != 0) {
1948 correctedsign = _gvn.transform( CMoveNode::make(C, NULL, bolyplus1, signnode, longcon(0), TypeLong::LONG));
1949 } else {
1950 IfNode *ifyplus1 = create_and_xform_if(ylong_path,bolyplus1, PROB_FAIR, COUNT_UNKNOWN);
1951 RegionNode *r = new (C) RegionNode(3);
1952 Node *phi = new (C) PhiNode(r, TypeLong::LONG);
1953 r->init_req(1, _gvn.transform(new (C) IfFalseNode(ifyplus1)));
1954 r->init_req(2, _gvn.transform(new (C) IfTrueNode(ifyplus1)));
1955 phi->init_req(1, signnode);
1956 phi->init_req(2, longcon(0));
1957 correctedsign = _gvn.transform(phi);
1958 ylong_path = _gvn.transform(r);
1959 record_for_igvn(r);
1960 }
1961
1962 // zero node
1963 Node *conzero = longcon(0);
1964 // Check (1&(long)y)==0?
1965 Node *cmpeq1 = _gvn.transform(new (C) CmpLNode(correctedsign, conzero));
1966 // Check if (1&(long)y)!=0?, if so the result is negative
1967 Node *bol3 = _gvn.transform(new (C) BoolNode( cmpeq1, BoolTest::ne ));
1968 // abs(x)
1969 Node *absx=_gvn.transform(new (C) AbsDNode(x));
1970 // abs(x)^y
1971 Node *absxpowy = _gvn.transform(new (C) PowDNode(C, control(), absx, y));
1972 // -abs(x)^y
1973 Node *negabsxpowy = _gvn.transform(new (C) NegDNode (absxpowy));
1974 // (1&(long)y)==1?-DPow(abs(x), y):DPow(abs(x), y)
1975 Node *signresult = NULL;
1976 if (ConditionalMoveLimit != 0) {
1977 signresult = _gvn.transform( CMoveNode::make(C, NULL, bol3, absxpowy, negabsxpowy, Type::DOUBLE));
1978 } else {
1979 IfNode *ifyeven = create_and_xform_if(ylong_path,bol3, PROB_FAIR, COUNT_UNKNOWN);
1980 RegionNode *r = new (C) RegionNode(3);
1981 Node *phi = new (C) PhiNode(r, Type::DOUBLE);
1982 r->init_req(1, _gvn.transform(new (C) IfFalseNode(ifyeven)));
1983 r->init_req(2, _gvn.transform(new (C) IfTrueNode(ifyeven)));
1984 phi->init_req(1, absxpowy);
1985 phi->init_req(2, negabsxpowy);
1986 signresult = _gvn.transform(phi);
1987 ylong_path = _gvn.transform(r);
1988 record_for_igvn(r);
1989 }
1990 // Set complex path fast result
1991 r->init_req(2, ylong_path);
1992 phi->init_req(2, signresult);
1993
1994 static const jlong nan_bits = CONST64(0x7ff8000000000000);
1995 Node *slow_result = makecon(TypeD::make(*(double*)&nan_bits)); // return NaN
1996 r->init_req(1,slow_path);
1997 phi->init_req(1,slow_result);
1998
1999 // Post merge
2000 set_control(_gvn.transform(r));
2001 record_for_igvn(r);
2002 result = _gvn.transform(phi);
2003 }
2004
2005 result = finish_pow_exp(result, x, y, OptoRuntime::Math_DD_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dpow), "POW");
2006
2007 // control from finish_pow_exp is now input to the region node
2008 region_node->set_req(2, control());
2009 // the result from finish_pow_exp is now input to the phi node
2010 phi_node->init_req(2, result);
2011 set_control(_gvn.transform(region_node));
2012 record_for_igvn(region_node);
2013 set_result(_gvn.transform(phi_node));
2014
2015 C->set_has_split_ifs(true); // Has chance for split-if optimization
2016 return true;
2017 }
2018
2019 //------------------------------runtime_math-----------------------------
2020 bool LibraryCallKit::runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName) {
2021 assert(call_type == OptoRuntime::Math_DD_D_Type() || call_type == OptoRuntime::Math_D_D_Type(),
2022 "must be (DD)D or (D)D type");
2023
2024 // Inputs
2025 Node* a = round_double_node(argument(0));
2026 Node* b = (call_type == OptoRuntime::Math_DD_D_Type()) ? round_double_node(argument(2)) : NULL;
2027
2028 const TypePtr* no_memory_effects = NULL;
2029 Node* trig = make_runtime_call(RC_LEAF, call_type, funcAddr, funcName,
2030 no_memory_effects,
2031 a, top(), b, b ? top() : NULL);
2032 Node* value = _gvn.transform(new (C) ProjNode(trig, TypeFunc::Parms+0));
2033 #ifdef ASSERT
2034 Node* value_top = _gvn.transform(new (C) ProjNode(trig, TypeFunc::Parms+1));
2035 assert(value_top == top(), "second value must be top");
2036 #endif
2037
2038 set_result(value);
2039 return true;
2040 }
2041
2042 //------------------------------inline_math_native-----------------------------
2043 bool LibraryCallKit::inline_math_native(vmIntrinsics::ID id) {
2044 #define FN_PTR(f) CAST_FROM_FN_PTR(address, f)
2045 switch (id) {
2046 // These intrinsics are not properly supported on all hardware
2047 case vmIntrinsics::_dcos: return Matcher::has_match_rule(Op_CosD) ? inline_trig(id) :
2048 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dcos), "COS");
2049 case vmIntrinsics::_dsin: return Matcher::has_match_rule(Op_SinD) ? inline_trig(id) :
2050 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dsin), "SIN");
2051 case vmIntrinsics::_dtan: return Matcher::has_match_rule(Op_TanD) ? inline_trig(id) :
2052 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dtan), "TAN");
2053
2054 case vmIntrinsics::_dlog: return Matcher::has_match_rule(Op_LogD) ? inline_math(id) :
2055 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dlog), "LOG");
2056 case vmIntrinsics::_dlog10: return Matcher::has_match_rule(Op_Log10D) ? inline_math(id) :
2057 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dlog10), "LOG10");
2058
2059 // These intrinsics are supported on all hardware
2060 case vmIntrinsics::_dsqrt: return Matcher::match_rule_supported(Op_SqrtD) ? inline_math(id) : false;
2061 case vmIntrinsics::_dabs: return Matcher::has_match_rule(Op_AbsD) ? inline_math(id) : false;
2062
2063 case vmIntrinsics::_dexp: return Matcher::has_match_rule(Op_ExpD) ? inline_exp() :
2064 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dexp), "EXP");
2065 case vmIntrinsics::_dpow: return Matcher::has_match_rule(Op_PowD) ? inline_pow() :
2066 runtime_math(OptoRuntime::Math_DD_D_Type(), FN_PTR(SharedRuntime::dpow), "POW");
2067 #undef FN_PTR
2068
2069 // These intrinsics are not yet correctly implemented
2070 case vmIntrinsics::_datan2:
2071 return false;
2072
2073 default:
2074 fatal_unexpected_iid(id);
2075 return false;
2076 }
2077 }
2078
2079 static bool is_simple_name(Node* n) {
2080 return (n->req() == 1 // constant
2081 || (n->is_Type() && n->as_Type()->type()->singleton())
2082 || n->is_Proj() // parameter or return value
2083 || n->is_Phi() // local of some sort
2084 );
2085 }
2086
2087 //----------------------------inline_min_max-----------------------------------
2088 bool LibraryCallKit::inline_min_max(vmIntrinsics::ID id) {
2089 set_result(generate_min_max(id, argument(0), argument(1)));
2090 return true;
2091 }
2092
2093 void LibraryCallKit::inline_math_mathExact(Node* math, Node *test) {
2094 Node* bol = _gvn.transform( new (C) BoolNode(test, BoolTest::overflow) );
2095 IfNode* check = create_and_map_if(control(), bol, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN);
2096 Node* fast_path = _gvn.transform( new (C) IfFalseNode(check));
2097 Node* slow_path = _gvn.transform( new (C) IfTrueNode(check) );
2098
2099 {
2100 PreserveJVMState pjvms(this);
2101 PreserveReexecuteState preexecs(this);
2102 jvms()->set_should_reexecute(true);
2103
2104 set_control(slow_path);
2105 set_i_o(i_o());
2106
2107 uncommon_trap(Deoptimization::Reason_intrinsic,
2108 Deoptimization::Action_none);
2109 }
2110
2111 set_control(fast_path);
2112 set_result(math);
2113 }
2114
2115 template <typename OverflowOp>
2116 bool LibraryCallKit::inline_math_overflow(Node* arg1, Node* arg2) {
2117 typedef typename OverflowOp::MathOp MathOp;
2118
2119 MathOp* mathOp = new(C) MathOp(arg1, arg2);
2120 Node* operation = _gvn.transform( mathOp );
2121 Node* ofcheck = _gvn.transform( new(C) OverflowOp(arg1, arg2) );
2122 inline_math_mathExact(operation, ofcheck);
2123 return true;
2124 }
2125
2126 bool LibraryCallKit::inline_math_addExactI(bool is_increment) {
2127 return inline_math_overflow<OverflowAddINode>(argument(0), is_increment ? intcon(1) : argument(1));
2128 }
2129
2130 bool LibraryCallKit::inline_math_addExactL(bool is_increment) {
2131 return inline_math_overflow<OverflowAddLNode>(argument(0), is_increment ? longcon(1) : argument(2));
2132 }
2133
2134 bool LibraryCallKit::inline_math_subtractExactI(bool is_decrement) {
2135 return inline_math_overflow<OverflowSubINode>(argument(0), is_decrement ? intcon(1) : argument(1));
2136 }
2137
2138 bool LibraryCallKit::inline_math_subtractExactL(bool is_decrement) {
2139 return inline_math_overflow<OverflowSubLNode>(argument(0), is_decrement ? longcon(1) : argument(2));
2140 }
2141
2142 bool LibraryCallKit::inline_math_negateExactI() {
2143 return inline_math_overflow<OverflowSubINode>(intcon(0), argument(0));
2144 }
2145
2146 bool LibraryCallKit::inline_math_negateExactL() {
2147 return inline_math_overflow<OverflowSubLNode>(longcon(0), argument(0));
2148 }
2149
2150 bool LibraryCallKit::inline_math_multiplyExactI() {
2151 return inline_math_overflow<OverflowMulINode>(argument(0), argument(1));
2152 }
2153
2154 bool LibraryCallKit::inline_math_multiplyExactL() {
2155 return inline_math_overflow<OverflowMulLNode>(argument(0), argument(2));
2156 }
2157
2158 Node*
2159 LibraryCallKit::generate_min_max(vmIntrinsics::ID id, Node* x0, Node* y0) {
2160 // These are the candidate return value:
2161 Node* xvalue = x0;
2162 Node* yvalue = y0;
2163
2164 if (xvalue == yvalue) {
2165 return xvalue;
2166 }
2167
2168 bool want_max = (id == vmIntrinsics::_max);
2169
2170 const TypeInt* txvalue = _gvn.type(xvalue)->isa_int();
2171 const TypeInt* tyvalue = _gvn.type(yvalue)->isa_int();
2172 if (txvalue == NULL || tyvalue == NULL) return top();
2173 // This is not really necessary, but it is consistent with a
2174 // hypothetical MaxINode::Value method:
2175 int widen = MAX2(txvalue->_widen, tyvalue->_widen);
2176
2177 // %%% This folding logic should (ideally) be in a different place.
2178 // Some should be inside IfNode, and there to be a more reliable
2179 // transformation of ?: style patterns into cmoves. We also want
2180 // more powerful optimizations around cmove and min/max.
2181
2182 // Try to find a dominating comparison of these guys.
2183 // It can simplify the index computation for Arrays.copyOf
2184 // and similar uses of System.arraycopy.
2185 // First, compute the normalized version of CmpI(x, y).
2186 int cmp_op = Op_CmpI;
2187 Node* xkey = xvalue;
2188 Node* ykey = yvalue;
2189 Node* ideal_cmpxy = _gvn.transform(new(C) CmpINode(xkey, ykey));
2190 if (ideal_cmpxy->is_Cmp()) {
2191 // E.g., if we have CmpI(length - offset, count),
2192 // it might idealize to CmpI(length, count + offset)
2193 cmp_op = ideal_cmpxy->Opcode();
2194 xkey = ideal_cmpxy->in(1);
2195 ykey = ideal_cmpxy->in(2);
2196 }
2197
2198 // Start by locating any relevant comparisons.
2199 Node* start_from = (xkey->outcnt() < ykey->outcnt()) ? xkey : ykey;
2200 Node* cmpxy = NULL;
2201 Node* cmpyx = NULL;
2202 for (DUIterator_Fast kmax, k = start_from->fast_outs(kmax); k < kmax; k++) {
2203 Node* cmp = start_from->fast_out(k);
2204 if (cmp->outcnt() > 0 && // must have prior uses
2205 cmp->in(0) == NULL && // must be context-independent
2206 cmp->Opcode() == cmp_op) { // right kind of compare
2207 if (cmp->in(1) == xkey && cmp->in(2) == ykey) cmpxy = cmp;
2208 if (cmp->in(1) == ykey && cmp->in(2) == xkey) cmpyx = cmp;
2209 }
2210 }
2211
2212 const int NCMPS = 2;
2213 Node* cmps[NCMPS] = { cmpxy, cmpyx };
2214 int cmpn;
2215 for (cmpn = 0; cmpn < NCMPS; cmpn++) {
2216 if (cmps[cmpn] != NULL) break; // find a result
2217 }
2218 if (cmpn < NCMPS) {
2219 // Look for a dominating test that tells us the min and max.
2220 int depth = 0; // Limit search depth for speed
2221 Node* dom = control();
2222 for (; dom != NULL; dom = IfNode::up_one_dom(dom, true)) {
2223 if (++depth >= 100) break;
2224 Node* ifproj = dom;
2225 if (!ifproj->is_Proj()) continue;
2226 Node* iff = ifproj->in(0);
2227 if (!iff->is_If()) continue;
2228 Node* bol = iff->in(1);
2229 if (!bol->is_Bool()) continue;
2230 Node* cmp = bol->in(1);
2231 if (cmp == NULL) continue;
2232 for (cmpn = 0; cmpn < NCMPS; cmpn++)
2233 if (cmps[cmpn] == cmp) break;
2234 if (cmpn == NCMPS) continue;
2235 BoolTest::mask btest = bol->as_Bool()->_test._test;
2236 if (ifproj->is_IfFalse()) btest = BoolTest(btest).negate();
2237 if (cmp->in(1) == ykey) btest = BoolTest(btest).commute();
2238 // At this point, we know that 'x btest y' is true.
2239 switch (btest) {
2240 case BoolTest::eq:
2241 // They are proven equal, so we can collapse the min/max.
2242 // Either value is the answer. Choose the simpler.
2243 if (is_simple_name(yvalue) && !is_simple_name(xvalue))
2244 return yvalue;
2245 return xvalue;
2246 case BoolTest::lt: // x < y
2247 case BoolTest::le: // x <= y
2248 return (want_max ? yvalue : xvalue);
2249 case BoolTest::gt: // x > y
2250 case BoolTest::ge: // x >= y
2251 return (want_max ? xvalue : yvalue);
2252 }
2253 }
2254 }
2255
2256 // We failed to find a dominating test.
2257 // Let's pick a test that might GVN with prior tests.
2258 Node* best_bol = NULL;
2259 BoolTest::mask best_btest = BoolTest::illegal;
2260 for (cmpn = 0; cmpn < NCMPS; cmpn++) {
2261 Node* cmp = cmps[cmpn];
2262 if (cmp == NULL) continue;
2263 for (DUIterator_Fast jmax, j = cmp->fast_outs(jmax); j < jmax; j++) {
2264 Node* bol = cmp->fast_out(j);
2265 if (!bol->is_Bool()) continue;
2266 BoolTest::mask btest = bol->as_Bool()->_test._test;
2267 if (btest == BoolTest::eq || btest == BoolTest::ne) continue;
2268 if (cmp->in(1) == ykey) btest = BoolTest(btest).commute();
2269 if (bol->outcnt() > (best_bol == NULL ? 0 : best_bol->outcnt())) {
2270 best_bol = bol->as_Bool();
2271 best_btest = btest;
2272 }
2273 }
2274 }
2275
2276 Node* answer_if_true = NULL;
2277 Node* answer_if_false = NULL;
2278 switch (best_btest) {
2279 default:
2280 if (cmpxy == NULL)
2281 cmpxy = ideal_cmpxy;
2282 best_bol = _gvn.transform(new(C) BoolNode(cmpxy, BoolTest::lt));
2283 // and fall through:
2284 case BoolTest::lt: // x < y
2285 case BoolTest::le: // x <= y
2286 answer_if_true = (want_max ? yvalue : xvalue);
2287 answer_if_false = (want_max ? xvalue : yvalue);
2288 break;
2289 case BoolTest::gt: // x > y
2290 case BoolTest::ge: // x >= y
2291 answer_if_true = (want_max ? xvalue : yvalue);
2292 answer_if_false = (want_max ? yvalue : xvalue);
2293 break;
2294 }
2295
2296 jint hi, lo;
2297 if (want_max) {
2298 // We can sharpen the minimum.
2299 hi = MAX2(txvalue->_hi, tyvalue->_hi);
2300 lo = MAX2(txvalue->_lo, tyvalue->_lo);
2301 } else {
2302 // We can sharpen the maximum.
2303 hi = MIN2(txvalue->_hi, tyvalue->_hi);
2304 lo = MIN2(txvalue->_lo, tyvalue->_lo);
2305 }
2306
2307 // Use a flow-free graph structure, to avoid creating excess control edges
2308 // which could hinder other optimizations.
2309 // Since Math.min/max is often used with arraycopy, we want
2310 // tightly_coupled_allocation to be able to see beyond min/max expressions.
2311 Node* cmov = CMoveNode::make(C, NULL, best_bol,
2312 answer_if_false, answer_if_true,
2313 TypeInt::make(lo, hi, widen));
2314
2315 return _gvn.transform(cmov);
2316
2317 /*
2318 // This is not as desirable as it may seem, since Min and Max
2319 // nodes do not have a full set of optimizations.
2320 // And they would interfere, anyway, with 'if' optimizations
2321 // and with CMoveI canonical forms.
2322 switch (id) {
2323 case vmIntrinsics::_min:
2324 result_val = _gvn.transform(new (C, 3) MinINode(x,y)); break;
2325 case vmIntrinsics::_max:
2326 result_val = _gvn.transform(new (C, 3) MaxINode(x,y)); break;
2327 default:
2328 ShouldNotReachHere();
2329 }
2330 */
2331 }
2332
2333 inline int
2334 LibraryCallKit::classify_unsafe_addr(Node* &base, Node* &offset) {
2335 const TypePtr* base_type = TypePtr::NULL_PTR;
2336 if (base != NULL) base_type = _gvn.type(base)->isa_ptr();
2337 if (base_type == NULL) {
2338 // Unknown type.
2339 return Type::AnyPtr;
2340 } else if (base_type == TypePtr::NULL_PTR) {
2341 // Since this is a NULL+long form, we have to switch to a rawptr.
2342 base = _gvn.transform(new (C) CastX2PNode(offset));
2343 offset = MakeConX(0);
2344 return Type::RawPtr;
2345 } else if (base_type->base() == Type::RawPtr) {
2346 return Type::RawPtr;
2347 } else if (base_type->isa_oopptr()) {
2348 // Base is never null => always a heap address.
2349 if (base_type->ptr() == TypePtr::NotNull) {
2350 return Type::OopPtr;
2351 }
2352 // Offset is small => always a heap address.
2353 const TypeX* offset_type = _gvn.type(offset)->isa_intptr_t();
2354 if (offset_type != NULL &&
2355 base_type->offset() == 0 && // (should always be?)
2356 offset_type->_lo >= 0 &&
2357 !MacroAssembler::needs_explicit_null_check(offset_type->_hi)) {
2358 return Type::OopPtr;
2359 }
2360 // Otherwise, it might either be oop+off or NULL+addr.
2361 return Type::AnyPtr;
2362 } else {
2363 // No information:
2364 return Type::AnyPtr;
2365 }
2366 }
2367
2368 inline Node* LibraryCallKit::make_unsafe_address(Node* base, Node* offset) {
2369 int kind = classify_unsafe_addr(base, offset);
2370 if (kind == Type::RawPtr) {
2371 return basic_plus_adr(top(), base, offset);
2372 } else {
2373 return basic_plus_adr(base, offset);
2374 }
2375 }
2376
2377 //--------------------------inline_number_methods-----------------------------
2378 // inline int Integer.numberOfLeadingZeros(int)
2379 // inline int Long.numberOfLeadingZeros(long)
2380 //
2381 // inline int Integer.numberOfTrailingZeros(int)
2382 // inline int Long.numberOfTrailingZeros(long)
2383 //
2384 // inline int Integer.bitCount(int)
2385 // inline int Long.bitCount(long)
2386 //
2387 // inline char Character.reverseBytes(char)
2388 // inline short Short.reverseBytes(short)
2389 // inline int Integer.reverseBytes(int)
2390 // inline long Long.reverseBytes(long)
2391 bool LibraryCallKit::inline_number_methods(vmIntrinsics::ID id) {
2392 Node* arg = argument(0);
2393 Node* n = NULL;
2394 switch (id) {
2395 case vmIntrinsics::_numberOfLeadingZeros_i: n = new (C) CountLeadingZerosINode( arg); break;
2396 case vmIntrinsics::_numberOfLeadingZeros_l: n = new (C) CountLeadingZerosLNode( arg); break;
2397 case vmIntrinsics::_numberOfTrailingZeros_i: n = new (C) CountTrailingZerosINode(arg); break;
2398 case vmIntrinsics::_numberOfTrailingZeros_l: n = new (C) CountTrailingZerosLNode(arg); break;
2399 case vmIntrinsics::_bitCount_i: n = new (C) PopCountINode( arg); break;
2400 case vmIntrinsics::_bitCount_l: n = new (C) PopCountLNode( arg); break;
2401 case vmIntrinsics::_reverseBytes_c: n = new (C) ReverseBytesUSNode(0, arg); break;
2402 case vmIntrinsics::_reverseBytes_s: n = new (C) ReverseBytesSNode( 0, arg); break;
2403 case vmIntrinsics::_reverseBytes_i: n = new (C) ReverseBytesINode( 0, arg); break;
2404 case vmIntrinsics::_reverseBytes_l: n = new (C) ReverseBytesLNode( 0, arg); break;
2405 default: fatal_unexpected_iid(id); break;
2406 }
2407 set_result(_gvn.transform(n));
2408 return true;
2409 }
2410
2411 //----------------------------inline_unsafe_access----------------------------
2412
2413 const static BasicType T_ADDRESS_HOLDER = T_LONG;
2414
2415 // Helper that guards and inserts a pre-barrier.
2416 void LibraryCallKit::insert_pre_barrier(Node* base_oop, Node* offset,
2417 Node* pre_val, bool need_mem_bar) {
2418 // We could be accessing the referent field of a reference object. If so, when G1
2419 // is enabled, we need to log the value in the referent field in an SATB buffer.
2420 // This routine performs some compile time filters and generates suitable
2421 // runtime filters that guard the pre-barrier code.
2422 // Also add memory barrier for non volatile load from the referent field
2423 // to prevent commoning of loads across safepoint.
2424 if (!UseG1GC && !need_mem_bar)
2425 return;
2426
2427 // Some compile time checks.
2428
2429 // If offset is a constant, is it java_lang_ref_Reference::_reference_offset?
2430 const TypeX* otype = offset->find_intptr_t_type();
2431 if (otype != NULL && otype->is_con() &&
2432 otype->get_con() != java_lang_ref_Reference::referent_offset) {
2433 // Constant offset but not the reference_offset so just return
2434 return;
2435 }
2436
2437 // We only need to generate the runtime guards for instances.
2438 const TypeOopPtr* btype = base_oop->bottom_type()->isa_oopptr();
2439 if (btype != NULL) {
2440 if (btype->isa_aryptr()) {
2441 // Array type so nothing to do
2442 return;
2443 }
2444
2445 const TypeInstPtr* itype = btype->isa_instptr();
2446 if (itype != NULL) {
2447 // Can the klass of base_oop be statically determined to be
2448 // _not_ a sub-class of Reference and _not_ Object?
2449 ciKlass* klass = itype->klass();
2450 if ( klass->is_loaded() &&
2451 !klass->is_subtype_of(env()->Reference_klass()) &&
2452 !env()->Object_klass()->is_subtype_of(klass)) {
2453 return;
2454 }
2455 }
2456 }
2457
2458 // The compile time filters did not reject base_oop/offset so
2459 // we need to generate the following runtime filters
2460 //
2461 // if (offset == java_lang_ref_Reference::_reference_offset) {
2462 // if (instance_of(base, java.lang.ref.Reference)) {
2463 // pre_barrier(_, pre_val, ...);
2464 // }
2465 // }
2466
2467 float likely = PROB_LIKELY( 0.999);
2468 float unlikely = PROB_UNLIKELY(0.999);
2469
2470 IdealKit ideal(this);
2471 #define __ ideal.
2472
2473 Node* referent_off = __ ConX(java_lang_ref_Reference::referent_offset);
2474
2475 __ if_then(offset, BoolTest::eq, referent_off, unlikely); {
2476 // Update graphKit memory and control from IdealKit.
2477 sync_kit(ideal);
2478
2479 Node* ref_klass_con = makecon(TypeKlassPtr::make(env()->Reference_klass()));
2480 Node* is_instof = gen_instanceof(base_oop, ref_klass_con);
2481
2482 // Update IdealKit memory and control from graphKit.
2483 __ sync_kit(this);
2484
2485 Node* one = __ ConI(1);
2486 // is_instof == 0 if base_oop == NULL
2487 __ if_then(is_instof, BoolTest::eq, one, unlikely); {
2488
2489 // Update graphKit from IdeakKit.
2490 sync_kit(ideal);
2491
2492 // Use the pre-barrier to record the value in the referent field
2493 pre_barrier(false /* do_load */,
2494 __ ctrl(),
2495 NULL /* obj */, NULL /* adr */, max_juint /* alias_idx */, NULL /* val */, NULL /* val_type */,
2496 pre_val /* pre_val */,
2497 T_OBJECT);
2498 if (need_mem_bar) {
2499 // Add memory barrier to prevent commoning reads from this field
2500 // across safepoint since GC can change its value.
2501 insert_mem_bar(Op_MemBarCPUOrder);
2502 }
2503 // Update IdealKit from graphKit.
2504 __ sync_kit(this);
2505
2506 } __ end_if(); // _ref_type != ref_none
2507 } __ end_if(); // offset == referent_offset
2508
2509 // Final sync IdealKit and GraphKit.
2510 final_sync(ideal);
2511 #undef __
2512 }
2513
2514
2515 // Interpret Unsafe.fieldOffset cookies correctly:
2516 extern jlong Unsafe_field_offset_to_byte_offset(jlong field_offset);
2517
2518 const TypeOopPtr* LibraryCallKit::sharpen_unsafe_type(Compile::AliasType* alias_type, const TypePtr *adr_type, bool is_native_ptr) {
2519 // Attempt to infer a sharper value type from the offset and base type.
2520 ciKlass* sharpened_klass = NULL;
2521
2522 // See if it is an instance field, with an object type.
2523 if (alias_type->field() != NULL) {
2524 assert(!is_native_ptr, "native pointer op cannot use a java address");
2525 if (alias_type->field()->type()->is_klass()) {
2526 sharpened_klass = alias_type->field()->type()->as_klass();
2527 }
2528 }
2529
2530 // See if it is a narrow oop array.
2531 if (adr_type->isa_aryptr()) {
2532 if (adr_type->offset() >= objArrayOopDesc::base_offset_in_bytes()) {
2533 const TypeOopPtr *elem_type = adr_type->is_aryptr()->elem()->isa_oopptr();
2534 if (elem_type != NULL) {
2535 sharpened_klass = elem_type->klass();
2536 }
2537 }
2538 }
2539
2540 // The sharpened class might be unloaded if there is no class loader
2541 // contraint in place.
2542 if (sharpened_klass != NULL && sharpened_klass->is_loaded()) {
2543 const TypeOopPtr* tjp = TypeOopPtr::make_from_klass(sharpened_klass);
2544
2545 #ifndef PRODUCT
2546 if (C->print_intrinsics() || C->print_inlining()) {
2547 tty->print(" from base type: "); adr_type->dump();
2548 tty->print(" sharpened value: "); tjp->dump();
2549 }
2550 #endif
2551 // Sharpen the value type.
2552 return tjp;
2553 }
2554 return NULL;
2555 }
2556
2557 bool LibraryCallKit::inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile, bool unaligned) {
2558 if (callee()->is_static()) return false; // caller must have the capability!
2559
2560 #ifndef PRODUCT
2561 {
2562 ResourceMark rm;
2563 // Check the signatures.
2564 ciSignature* sig = callee()->signature();
2565 #ifdef ASSERT
2566 if (!is_store) {
2567 // Object getObject(Object base, int/long offset), etc.
2568 BasicType rtype = sig->return_type()->basic_type();
2569 if (rtype == T_ADDRESS_HOLDER && callee()->name() == ciSymbol::getAddress_name())
2570 rtype = T_ADDRESS; // it is really a C void*
2571 assert(rtype == type, "getter must return the expected value");
2572 if (!is_native_ptr) {
2573 assert(sig->count() == 2, "oop getter has 2 arguments");
2574 assert(sig->type_at(0)->basic_type() == T_OBJECT, "getter base is object");
2575 assert(sig->type_at(1)->basic_type() == T_LONG, "getter offset is correct");
2576 } else {
2577 assert(sig->count() == 1, "native getter has 1 argument");
2578 assert(sig->type_at(0)->basic_type() == T_LONG, "getter base is long");
2579 }
2580 } else {
2581 // void putObject(Object base, int/long offset, Object x), etc.
2582 assert(sig->return_type()->basic_type() == T_VOID, "putter must not return a value");
2583 if (!is_native_ptr) {
2584 assert(sig->count() == 3, "oop putter has 3 arguments");
2585 assert(sig->type_at(0)->basic_type() == T_OBJECT, "putter base is object");
2586 assert(sig->type_at(1)->basic_type() == T_LONG, "putter offset is correct");
2587 } else {
2588 assert(sig->count() == 2, "native putter has 2 arguments");
2589 assert(sig->type_at(0)->basic_type() == T_LONG, "putter base is long");
2590 }
2591 BasicType vtype = sig->type_at(sig->count()-1)->basic_type();
2592 if (vtype == T_ADDRESS_HOLDER && callee()->name() == ciSymbol::putAddress_name())
2593 vtype = T_ADDRESS; // it is really a C void*
2594 assert(vtype == type, "putter must accept the expected value");
2595 }
2596 #endif // ASSERT
2597 }
2598 #endif //PRODUCT
2599
2600 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe".
2601
2602 Node* receiver = argument(0); // type: oop
2603
2604 // Build address expression. See the code in inline_unsafe_prefetch.
2605 Node* adr;
2606 Node* heap_base_oop = top();
2607 Node* offset = top();
2608 Node* val;
2609
2610 if (!is_native_ptr) {
2611 // The base is either a Java object or a value produced by Unsafe.staticFieldBase
2612 Node* base = argument(1); // type: oop
2613 // The offset is a value produced by Unsafe.staticFieldOffset or Unsafe.objectFieldOffset
2614 offset = argument(2); // type: long
2615 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset
2616 // to be plain byte offsets, which are also the same as those accepted
2617 // by oopDesc::field_base.
2618 assert(Unsafe_field_offset_to_byte_offset(11) == 11,
2619 "fieldOffset must be byte-scaled");
2620 // 32-bit machines ignore the high half!
2621 offset = ConvL2X(offset);
2622 adr = make_unsafe_address(base, offset);
2623 heap_base_oop = base;
2624 val = is_store ? argument(4) : NULL;
2625 } else {
2626 Node* ptr = argument(1); // type: long
2627 ptr = ConvL2X(ptr); // adjust Java long to machine word
2628 adr = make_unsafe_address(NULL, ptr);
2629 val = is_store ? argument(3) : NULL;
2630 }
2631
2632 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr();
2633
2634 // First guess at the value type.
2635 const Type *value_type = Type::get_const_basic_type(type);
2636
2637 // Try to categorize the address. If it comes up as TypeJavaPtr::BOTTOM,
2638 // there was not enough information to nail it down.
2639 Compile::AliasType* alias_type = C->alias_type(adr_type);
2640 assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here");
2641
2642 // We will need memory barriers unless we can determine a unique
2643 // alias category for this reference. (Note: If for some reason
2644 // the barriers get omitted and the unsafe reference begins to "pollute"
2645 // the alias analysis of the rest of the graph, either Compile::can_alias
2646 // or Compile::must_alias will throw a diagnostic assert.)
2647 bool need_mem_bar = (alias_type->adr_type() == TypeOopPtr::BOTTOM);
2648
2649 // If we are reading the value of the referent field of a Reference
2650 // object (either by using Unsafe directly or through reflection)
2651 // then, if G1 is enabled, we need to record the referent in an
2652 // SATB log buffer using the pre-barrier mechanism.
2653 // Also we need to add memory barrier to prevent commoning reads
2654 // from this field across safepoint since GC can change its value.
2655 bool need_read_barrier = !is_native_ptr && !is_store &&
2656 offset != top() && heap_base_oop != top();
2657
2658 if (!is_store && type == T_OBJECT) {
2659 const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type, is_native_ptr);
2660 if (tjp != NULL) {
2661 value_type = tjp;
2662 }
2663 }
2664
2665 receiver = null_check(receiver);
2666 if (stopped()) {
2667 return true;
2668 }
2669 // Heap pointers get a null-check from the interpreter,
2670 // as a courtesy. However, this is not guaranteed by Unsafe,
2671 // and it is not possible to fully distinguish unintended nulls
2672 // from intended ones in this API.
2673
2674 if (is_volatile) {
2675 // We need to emit leading and trailing CPU membars (see below) in
2676 // addition to memory membars when is_volatile. This is a little
2677 // too strong, but avoids the need to insert per-alias-type
2678 // volatile membars (for stores; compare Parse::do_put_xxx), which
2679 // we cannot do effectively here because we probably only have a
2680 // rough approximation of type.
2681 need_mem_bar = true;
2682 // For Stores, place a memory ordering barrier now.
2683 if (is_store) {
2684 insert_mem_bar(Op_MemBarRelease);
2685 } else {
2686 if (support_IRIW_for_not_multiple_copy_atomic_cpu) {
2687 insert_mem_bar(Op_MemBarVolatile);
2688 }
2689 }
2690 }
2691
2692 // Memory barrier to prevent normal and 'unsafe' accesses from
2693 // bypassing each other. Happens after null checks, so the
2694 // exception paths do not take memory state from the memory barrier,
2695 // so there's no problems making a strong assert about mixing users
2696 // of safe & unsafe memory. Otherwise fails in a CTW of rt.jar
2697 // around 5701, class sun/reflect/UnsafeBooleanFieldAccessorImpl.
2698 if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder);
2699
2700 assert(alias_type->adr_type() == TypeRawPtr::BOTTOM || alias_type->adr_type() == TypeOopPtr::BOTTOM ||
2701 alias_type->field() != NULL || alias_type->element() != NULL, "field, array element or unknown");
2702 bool mismatched = false;
2703 if (alias_type->element() != NULL || alias_type->field() != NULL) {
2704 BasicType bt;
2705 if (alias_type->element() != NULL) {
2706 const Type* element = alias_type->element();
2707 bt = element->isa_narrowoop() ? T_OBJECT : element->array_element_basic_type();
2708 } else {
2709 bt = alias_type->field()->type()->basic_type();
2710 }
2711 if (bt != type) {
2712 mismatched = true;
2713 }
2714 }
2715 assert(type != T_OBJECT || !unaligned, "unaligned access not supported with object type");
2716
2717 if (!is_store) {
2718 MemNode::MemOrd mo = is_volatile ? MemNode::acquire : MemNode::unordered;
2719 // To be valid, unsafe loads may depend on other conditions than
2720 // the one that guards them: pin the Load node
2721 Node* p = make_load(control(), adr, value_type, type, adr_type, mo, LoadNode::Pinned, is_volatile, unaligned, mismatched);
2722 // load value
2723 switch (type) {
2724 case T_BOOLEAN:
2725 case T_CHAR:
2726 case T_BYTE:
2727 case T_SHORT:
2728 case T_INT:
2729 case T_LONG:
2730 case T_FLOAT:
2731 case T_DOUBLE:
2732 break;
2733 case T_OBJECT:
2734 if (need_read_barrier) {
2735 insert_pre_barrier(heap_base_oop, offset, p, !(is_volatile || need_mem_bar));
2736 }
2737 break;
2738 case T_ADDRESS:
2739 // Cast to an int type.
2740 p = _gvn.transform(new (C) CastP2XNode(NULL, p));
2741 p = ConvX2UL(p);
2742 break;
2743 default:
2744 fatal(err_msg_res("unexpected type %d: %s", type, type2name(type)));
2745 break;
2746 }
2747 // The load node has the control of the preceding MemBarCPUOrder. All
2748 // following nodes will have the control of the MemBarCPUOrder inserted at
2749 // the end of this method. So, pushing the load onto the stack at a later
2750 // point is fine.
2751 set_result(p);
2752 } else {
2753 // place effect of store into memory
2754 switch (type) {
2755 case T_DOUBLE:
2756 val = dstore_rounding(val);
2757 break;
2758 case T_ADDRESS:
2759 // Repackage the long as a pointer.
2760 val = ConvL2X(val);
2761 val = _gvn.transform(new (C) CastX2PNode(val));
2762 break;
2763 }
2764
2765 MemNode::MemOrd mo = is_volatile ? MemNode::release : MemNode::unordered;
2766 if (type != T_OBJECT ) {
2767 (void) store_to_memory(control(), adr, val, type, adr_type, mo, is_volatile, unaligned, mismatched);
2768 } else {
2769 // Possibly an oop being stored to Java heap or native memory
2770 if (!TypePtr::NULL_PTR->higher_equal(_gvn.type(heap_base_oop))) {
2771 // oop to Java heap.
2772 (void) store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type, mo, mismatched);
2773 } else {
2774 // We can't tell at compile time if we are storing in the Java heap or outside
2775 // of it. So we need to emit code to conditionally do the proper type of
2776 // store.
2777
2778 IdealKit ideal(this);
2779 #define __ ideal.
2780 // QQQ who knows what probability is here??
2781 __ if_then(heap_base_oop, BoolTest::ne, null(), PROB_UNLIKELY(0.999)); {
2782 // Sync IdealKit and graphKit.
2783 sync_kit(ideal);
2784 Node* st = store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type, mo, mismatched);
2785 // Update IdealKit memory.
2786 __ sync_kit(this);
2787 } __ else_(); {
2788 __ store(__ ctrl(), adr, val, type, alias_type->index(), mo, is_volatile, mismatched);
2789 } __ end_if();
2790 // Final sync IdealKit and GraphKit.
2791 final_sync(ideal);
2792 #undef __
2793 }
2794 }
2795 }
2796
2797 if (is_volatile) {
2798 if (!is_store) {
2799 insert_mem_bar(Op_MemBarAcquire);
2800 } else {
2801 if (!support_IRIW_for_not_multiple_copy_atomic_cpu) {
2802 insert_mem_bar(Op_MemBarVolatile);
2803 }
2804 }
2805 }
2806
2807 if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder);
2808
2809 return true;
2810 }
2811
2812 //----------------------------inline_unsafe_prefetch----------------------------
2813
2814 bool LibraryCallKit::inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static) {
2815 #ifndef PRODUCT
2816 {
2817 ResourceMark rm;
2818 // Check the signatures.
2819 ciSignature* sig = callee()->signature();
2820 #ifdef ASSERT
2821 // Object getObject(Object base, int/long offset), etc.
2822 BasicType rtype = sig->return_type()->basic_type();
2823 if (!is_native_ptr) {
2824 assert(sig->count() == 2, "oop prefetch has 2 arguments");
2825 assert(sig->type_at(0)->basic_type() == T_OBJECT, "prefetch base is object");
2826 assert(sig->type_at(1)->basic_type() == T_LONG, "prefetcha offset is correct");
2827 } else {
2828 assert(sig->count() == 1, "native prefetch has 1 argument");
2829 assert(sig->type_at(0)->basic_type() == T_LONG, "prefetch base is long");
2830 }
2831 #endif // ASSERT
2832 }
2833 #endif // !PRODUCT
2834
2835 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe".
2836
2837 const int idx = is_static ? 0 : 1;
2838 if (!is_static) {
2839 null_check_receiver();
2840 if (stopped()) {
2841 return true;
2842 }
2843 }
2844
2845 // Build address expression. See the code in inline_unsafe_access.
2846 Node *adr;
2847 if (!is_native_ptr) {
2848 // The base is either a Java object or a value produced by Unsafe.staticFieldBase
2849 Node* base = argument(idx + 0); // type: oop
2850 // The offset is a value produced by Unsafe.staticFieldOffset or Unsafe.objectFieldOffset
2851 Node* offset = argument(idx + 1); // type: long
2852 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset
2853 // to be plain byte offsets, which are also the same as those accepted
2854 // by oopDesc::field_base.
2855 assert(Unsafe_field_offset_to_byte_offset(11) == 11,
2856 "fieldOffset must be byte-scaled");
2857 // 32-bit machines ignore the high half!
2858 offset = ConvL2X(offset);
2859 adr = make_unsafe_address(base, offset);
2860 } else {
2861 Node* ptr = argument(idx + 0); // type: long
2862 ptr = ConvL2X(ptr); // adjust Java long to machine word
2863 adr = make_unsafe_address(NULL, ptr);
2864 }
2865
2866 // Generate the read or write prefetch
2867 Node *prefetch;
2868 if (is_store) {
2869 prefetch = new (C) PrefetchWriteNode(i_o(), adr);
2870 } else {
2871 prefetch = new (C) PrefetchReadNode(i_o(), adr);
2872 }
2873 prefetch->init_req(0, control());
2874 set_i_o(_gvn.transform(prefetch));
2875
2876 return true;
2877 }
2878
2879 //----------------------------inline_unsafe_load_store----------------------------
2880 // This method serves a couple of different customers (depending on LoadStoreKind):
2881 //
2882 // LS_cmpxchg:
2883 // public final native boolean compareAndSwapObject(Object o, long offset, Object expected, Object x);
2884 // public final native boolean compareAndSwapInt( Object o, long offset, int expected, int x);
2885 // public final native boolean compareAndSwapLong( Object o, long offset, long expected, long x);
2886 //
2887 // LS_xadd:
2888 // public int getAndAddInt( Object o, long offset, int delta)
2889 // public long getAndAddLong(Object o, long offset, long delta)
2890 //
2891 // LS_xchg:
2892 // int getAndSet(Object o, long offset, int newValue)
2893 // long getAndSet(Object o, long offset, long newValue)
2894 // Object getAndSet(Object o, long offset, Object newValue)
2895 //
2896 bool LibraryCallKit::inline_unsafe_load_store(BasicType type, LoadStoreKind kind) {
2897 // This basic scheme here is the same as inline_unsafe_access, but
2898 // differs in enough details that combining them would make the code
2899 // overly confusing. (This is a true fact! I originally combined
2900 // them, but even I was confused by it!) As much code/comments as
2901 // possible are retained from inline_unsafe_access though to make
2902 // the correspondences clearer. - dl
2903
2904 if (callee()->is_static()) return false; // caller must have the capability!
2905
2906 #ifndef PRODUCT
2907 BasicType rtype;
2908 {
2909 ResourceMark rm;
2910 // Check the signatures.
2911 ciSignature* sig = callee()->signature();
2912 rtype = sig->return_type()->basic_type();
2913 if (kind == LS_xadd || kind == LS_xchg) {
2914 // Check the signatures.
2915 #ifdef ASSERT
2916 assert(rtype == type, "get and set must return the expected type");
2917 assert(sig->count() == 3, "get and set has 3 arguments");
2918 assert(sig->type_at(0)->basic_type() == T_OBJECT, "get and set base is object");
2919 assert(sig->type_at(1)->basic_type() == T_LONG, "get and set offset is long");
2920 assert(sig->type_at(2)->basic_type() == type, "get and set must take expected type as new value/delta");
2921 #endif // ASSERT
2922 } else if (kind == LS_cmpxchg) {
2923 // Check the signatures.
2924 #ifdef ASSERT
2925 assert(rtype == T_BOOLEAN, "CAS must return boolean");
2926 assert(sig->count() == 4, "CAS has 4 arguments");
2927 assert(sig->type_at(0)->basic_type() == T_OBJECT, "CAS base is object");
2928 assert(sig->type_at(1)->basic_type() == T_LONG, "CAS offset is long");
2929 #endif // ASSERT
2930 } else {
2931 ShouldNotReachHere();
2932 }
2933 }
2934 #endif //PRODUCT
2935
2936 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe".
2937
2938 // Get arguments:
2939 Node* receiver = NULL;
2940 Node* base = NULL;
2941 Node* offset = NULL;
2942 Node* oldval = NULL;
2943 Node* newval = NULL;
2944 if (kind == LS_cmpxchg) {
2945 const bool two_slot_type = type2size[type] == 2;
2946 receiver = argument(0); // type: oop
2947 base = argument(1); // type: oop
2948 offset = argument(2); // type: long
2949 oldval = argument(4); // type: oop, int, or long
2950 newval = argument(two_slot_type ? 6 : 5); // type: oop, int, or long
2951 } else if (kind == LS_xadd || kind == LS_xchg){
2952 receiver = argument(0); // type: oop
2953 base = argument(1); // type: oop
2954 offset = argument(2); // type: long
2955 oldval = NULL;
2956 newval = argument(4); // type: oop, int, or long
2957 }
2958
2959 // Null check receiver.
2960 receiver = null_check(receiver);
2961 if (stopped()) {
2962 return true;
2963 }
2964
2965 // Build field offset expression.
2966 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset
2967 // to be plain byte offsets, which are also the same as those accepted
2968 // by oopDesc::field_base.
2969 assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled");
2970 // 32-bit machines ignore the high half of long offsets
2971 offset = ConvL2X(offset);
2972 Node* adr = make_unsafe_address(base, offset);
2973 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr();
2974
2975 // For CAS, unlike inline_unsafe_access, there seems no point in
2976 // trying to refine types. Just use the coarse types here.
2977 const Type *value_type = Type::get_const_basic_type(type);
2978 Compile::AliasType* alias_type = C->alias_type(adr_type);
2979 assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here");
2980
2981 if (kind == LS_xchg && type == T_OBJECT) {
2982 const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type);
2983 if (tjp != NULL) {
2984 value_type = tjp;
2985 }
2986 }
2987
2988 int alias_idx = C->get_alias_index(adr_type);
2989
2990 // Memory-model-wise, a LoadStore acts like a little synchronized
2991 // block, so needs barriers on each side. These don't translate
2992 // into actual barriers on most machines, but we still need rest of
2993 // compiler to respect ordering.
2994
2995 insert_mem_bar(Op_MemBarRelease);
2996 insert_mem_bar(Op_MemBarCPUOrder);
2997
2998 // 4984716: MemBars must be inserted before this
2999 // memory node in order to avoid a false
3000 // dependency which will confuse the scheduler.
3001 Node *mem = memory(alias_idx);
3002
3003 // For now, we handle only those cases that actually exist: ints,
3004 // longs, and Object. Adding others should be straightforward.
3005 Node* load_store = NULL;
3006 switch(type) {
3007 case T_INT:
3008 if (kind == LS_xadd) {
3009 load_store = _gvn.transform(new (C) GetAndAddINode(control(), mem, adr, newval, adr_type));
3010 } else if (kind == LS_xchg) {
3011 load_store = _gvn.transform(new (C) GetAndSetINode(control(), mem, adr, newval, adr_type));
3012 } else if (kind == LS_cmpxchg) {
3013 load_store = _gvn.transform(new (C) CompareAndSwapINode(control(), mem, adr, newval, oldval));
3014 } else {
3015 ShouldNotReachHere();
3016 }
3017 break;
3018 case T_LONG:
3019 if (kind == LS_xadd) {
3020 load_store = _gvn.transform(new (C) GetAndAddLNode(control(), mem, adr, newval, adr_type));
3021 } else if (kind == LS_xchg) {
3022 load_store = _gvn.transform(new (C) GetAndSetLNode(control(), mem, adr, newval, adr_type));
3023 } else if (kind == LS_cmpxchg) {
3024 load_store = _gvn.transform(new (C) CompareAndSwapLNode(control(), mem, adr, newval, oldval));
3025 } else {
3026 ShouldNotReachHere();
3027 }
3028 break;
3029 case T_OBJECT:
3030 // Transformation of a value which could be NULL pointer (CastPP #NULL)
3031 // could be delayed during Parse (for example, in adjust_map_after_if()).
3032 // Execute transformation here to avoid barrier generation in such case.
3033 if (_gvn.type(newval) == TypePtr::NULL_PTR)
3034 newval = _gvn.makecon(TypePtr::NULL_PTR);
3035
3036 // Reference stores need a store barrier.
3037 if (kind == LS_xchg) {
3038 // If pre-barrier must execute before the oop store, old value will require do_load here.
3039 if (!can_move_pre_barrier()) {
3040 pre_barrier(true /* do_load*/,
3041 control(), base, adr, alias_idx, newval, value_type->make_oopptr(),
3042 NULL /* pre_val*/,
3043 T_OBJECT);
3044 } // Else move pre_barrier to use load_store value, see below.
3045 } else if (kind == LS_cmpxchg) {
3046 // Same as for newval above:
3047 if (_gvn.type(oldval) == TypePtr::NULL_PTR) {
3048 oldval = _gvn.makecon(TypePtr::NULL_PTR);
3049 }
3050 // The only known value which might get overwritten is oldval.
3051 pre_barrier(false /* do_load */,
3052 control(), NULL, NULL, max_juint, NULL, NULL,
3053 oldval /* pre_val */,
3054 T_OBJECT);
3055 } else {
3056 ShouldNotReachHere();
3057 }
3058
3059 #ifdef _LP64
3060 if (adr->bottom_type()->is_ptr_to_narrowoop()) {
3061 Node *newval_enc = _gvn.transform(new (C) EncodePNode(newval, newval->bottom_type()->make_narrowoop()));
3062 if (kind == LS_xchg) {
3063 load_store = _gvn.transform(new (C) GetAndSetNNode(control(), mem, adr,
3064 newval_enc, adr_type, value_type->make_narrowoop()));
3065 } else {
3066 assert(kind == LS_cmpxchg, "wrong LoadStore operation");
3067 Node *oldval_enc = _gvn.transform(new (C) EncodePNode(oldval, oldval->bottom_type()->make_narrowoop()));
3068 load_store = _gvn.transform(new (C) CompareAndSwapNNode(control(), mem, adr,
3069 newval_enc, oldval_enc));
3070 }
3071 } else
3072 #endif
3073 {
3074 if (kind == LS_xchg) {
3075 load_store = _gvn.transform(new (C) GetAndSetPNode(control(), mem, adr, newval, adr_type, value_type->is_oopptr()));
3076 } else {
3077 assert(kind == LS_cmpxchg, "wrong LoadStore operation");
3078 load_store = _gvn.transform(new (C) CompareAndSwapPNode(control(), mem, adr, newval, oldval));
3079 }
3080 }
3081 post_barrier(control(), load_store, base, adr, alias_idx, newval, T_OBJECT, true);
3082 break;
3083 default:
3084 fatal(err_msg_res("unexpected type %d: %s", type, type2name(type)));
3085 break;
3086 }
3087
3088 // SCMemProjNodes represent the memory state of a LoadStore. Their
3089 // main role is to prevent LoadStore nodes from being optimized away
3090 // when their results aren't used.
3091 Node* proj = _gvn.transform(new (C) SCMemProjNode(load_store));
3092 set_memory(proj, alias_idx);
3093
3094 if (type == T_OBJECT && kind == LS_xchg) {
3095 #ifdef _LP64
3096 if (adr->bottom_type()->is_ptr_to_narrowoop()) {
3097 load_store = _gvn.transform(new (C) DecodeNNode(load_store, load_store->get_ptr_type()));
3098 }
3099 #endif
3100 if (can_move_pre_barrier()) {
3101 // Don't need to load pre_val. The old value is returned by load_store.
3102 // The pre_barrier can execute after the xchg as long as no safepoint
3103 // gets inserted between them.
3104 pre_barrier(false /* do_load */,
3105 control(), NULL, NULL, max_juint, NULL, NULL,
3106 load_store /* pre_val */,
3107 T_OBJECT);
3108 }
3109 }
3110
3111 // Add the trailing membar surrounding the access
3112 insert_mem_bar(Op_MemBarCPUOrder);
3113 insert_mem_bar(Op_MemBarAcquire);
3114
3115 assert(type2size[load_store->bottom_type()->basic_type()] == type2size[rtype], "result type should match");
3116 set_result(load_store);
3117 return true;
3118 }
3119
3120 //----------------------------inline_unsafe_ordered_store----------------------
3121 // public native void sun.misc.Unsafe.putOrderedObject(Object o, long offset, Object x);
3122 // public native void sun.misc.Unsafe.putOrderedInt(Object o, long offset, int x);
3123 // public native void sun.misc.Unsafe.putOrderedLong(Object o, long offset, long x);
3124 bool LibraryCallKit::inline_unsafe_ordered_store(BasicType type) {
3125 // This is another variant of inline_unsafe_access, differing in
3126 // that it always issues store-store ("release") barrier and ensures
3127 // store-atomicity (which only matters for "long").
3128
3129 if (callee()->is_static()) return false; // caller must have the capability!
3130
3131 #ifndef PRODUCT
3132 {
3133 ResourceMark rm;
3134 // Check the signatures.
3135 ciSignature* sig = callee()->signature();
3136 #ifdef ASSERT
3137 BasicType rtype = sig->return_type()->basic_type();
3138 assert(rtype == T_VOID, "must return void");
3139 assert(sig->count() == 3, "has 3 arguments");
3140 assert(sig->type_at(0)->basic_type() == T_OBJECT, "base is object");
3141 assert(sig->type_at(1)->basic_type() == T_LONG, "offset is long");
3142 #endif // ASSERT
3143 }
3144 #endif //PRODUCT
3145
3146 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe".
3147
3148 // Get arguments:
3149 Node* receiver = argument(0); // type: oop
3150 Node* base = argument(1); // type: oop
3151 Node* offset = argument(2); // type: long
3152 Node* val = argument(4); // type: oop, int, or long
3153
3154 // Null check receiver.
3155 receiver = null_check(receiver);
3156 if (stopped()) {
3157 return true;
3158 }
3159
3160 // Build field offset expression.
3161 assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled");
3162 // 32-bit machines ignore the high half of long offsets
3163 offset = ConvL2X(offset);
3164 Node* adr = make_unsafe_address(base, offset);
3165 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr();
3166 const Type *value_type = Type::get_const_basic_type(type);
3167 Compile::AliasType* alias_type = C->alias_type(adr_type);
3168
3169 insert_mem_bar(Op_MemBarRelease);
3170 insert_mem_bar(Op_MemBarCPUOrder);
3171 // Ensure that the store is atomic for longs:
3172 const bool require_atomic_access = true;
3173 Node* store;
3174 if (type == T_OBJECT) // reference stores need a store barrier.
3175 store = store_oop_to_unknown(control(), base, adr, adr_type, val, type, MemNode::release);
3176 else {
3177 store = store_to_memory(control(), adr, val, type, adr_type, MemNode::release, require_atomic_access);
3178 }
3179 insert_mem_bar(Op_MemBarCPUOrder);
3180 return true;
3181 }
3182
3183 bool LibraryCallKit::inline_unsafe_fence(vmIntrinsics::ID id) {
3184 // Regardless of form, don't allow previous ld/st to move down,
3185 // then issue acquire, release, or volatile mem_bar.
3186 insert_mem_bar(Op_MemBarCPUOrder);
3187 switch(id) {
3188 case vmIntrinsics::_loadFence:
3189 insert_mem_bar(Op_LoadFence);
3190 return true;
3191 case vmIntrinsics::_storeFence:
3192 insert_mem_bar(Op_StoreFence);
3193 return true;
3194 case vmIntrinsics::_fullFence:
3195 insert_mem_bar(Op_MemBarVolatile);
3196 return true;
3197 default:
3198 fatal_unexpected_iid(id);
3199 return false;
3200 }
3201 }
3202
3203 bool LibraryCallKit::klass_needs_init_guard(Node* kls) {
3204 if (!kls->is_Con()) {
3205 return true;
3206 }
3207 const TypeKlassPtr* klsptr = kls->bottom_type()->isa_klassptr();
3208 if (klsptr == NULL) {
3209 return true;
3210 }
3211 ciInstanceKlass* ik = klsptr->klass()->as_instance_klass();
3212 // don't need a guard for a klass that is already initialized
3213 return !ik->is_initialized();
3214 }
3215
3216 //----------------------------inline_unsafe_allocate---------------------------
3217 // public native Object sun.misc.Unsafe.allocateInstance(Class<?> cls);
3218 bool LibraryCallKit::inline_unsafe_allocate() {
3219 if (callee()->is_static()) return false; // caller must have the capability!
3220
3221 null_check_receiver(); // null-check, then ignore
3222 Node* cls = null_check(argument(1));
3223 if (stopped()) return true;
3224
3225 Node* kls = load_klass_from_mirror(cls, false, NULL, 0);
3226 kls = null_check(kls);
3227 if (stopped()) return true; // argument was like int.class
3228
3229 Node* test = NULL;
3230 if (LibraryCallKit::klass_needs_init_guard(kls)) {
3231 // Note: The argument might still be an illegal value like
3232 // Serializable.class or Object[].class. The runtime will handle it.
3233 // But we must make an explicit check for initialization.
3234 Node* insp = basic_plus_adr(kls, in_bytes(InstanceKlass::init_state_offset()));
3235 // Use T_BOOLEAN for InstanceKlass::_init_state so the compiler
3236 // can generate code to load it as unsigned byte.
3237 Node* inst = make_load(NULL, insp, TypeInt::UBYTE, T_BOOLEAN, MemNode::unordered);
3238 Node* bits = intcon(InstanceKlass::fully_initialized);
3239 test = _gvn.transform(new (C) SubINode(inst, bits));
3240 // The 'test' is non-zero if we need to take a slow path.
3241 }
3242
3243 Node* obj = new_instance(kls, test);
3244 set_result(obj);
3245 return true;
3246 }
3247
3248 #ifdef TRACE_HAVE_INTRINSICS
3249 /*
3250 * oop -> myklass
3251 * myklass->trace_id |= USED
3252 * return myklass->trace_id & ~0x3
3253 */
3254 bool LibraryCallKit::inline_native_classID() {
3255 null_check_receiver(); // null-check, then ignore
3256 Node* cls = null_check(argument(1), T_OBJECT);
3257 Node* kls = load_klass_from_mirror(cls, false, NULL, 0);
3258 kls = null_check(kls, T_OBJECT);
3259 ByteSize offset = TRACE_ID_OFFSET;
3260 Node* insp = basic_plus_adr(kls, in_bytes(offset));
3261 Node* tvalue = make_load(NULL, insp, TypeLong::LONG, T_LONG, MemNode::unordered);
3262 Node* bits = longcon(~0x03l); // ignore bit 0 & 1
3263 Node* andl = _gvn.transform(new (C) AndLNode(tvalue, bits));
3264 Node* clsused = longcon(0x01l); // set the class bit
3265 Node* orl = _gvn.transform(new (C) OrLNode(tvalue, clsused));
3266
3267 const TypePtr *adr_type = _gvn.type(insp)->isa_ptr();
3268 store_to_memory(control(), insp, orl, T_LONG, adr_type, MemNode::unordered);
3269 set_result(andl);
3270 return true;
3271 }
3272
3273 bool LibraryCallKit::inline_native_threadID() {
3274 Node* tls_ptr = NULL;
3275 Node* cur_thr = generate_current_thread(tls_ptr);
3276 Node* p = basic_plus_adr(top()/*!oop*/, tls_ptr, in_bytes(JavaThread::osthread_offset()));
3277 Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS, MemNode::unordered);
3278 p = basic_plus_adr(top()/*!oop*/, osthread, in_bytes(OSThread::thread_id_offset()));
3279
3280 Node* threadid = NULL;
3281 size_t thread_id_size = OSThread::thread_id_size();
3282 if (thread_id_size == (size_t) BytesPerLong) {
3283 threadid = ConvL2I(make_load(control(), p, TypeLong::LONG, T_LONG, MemNode::unordered));
3284 } else if (thread_id_size == (size_t) BytesPerInt) {
3285 threadid = make_load(control(), p, TypeInt::INT, T_INT, MemNode::unordered);
3286 } else {
3287 ShouldNotReachHere();
3288 }
3289 set_result(threadid);
3290 return true;
3291 }
3292 #endif
3293
3294 //------------------------inline_native_time_funcs--------------
3295 // inline code for System.currentTimeMillis() and System.nanoTime()
3296 // these have the same type and signature
3297 bool LibraryCallKit::inline_native_time_funcs(address funcAddr, const char* funcName) {
3298 const TypeFunc* tf = OptoRuntime::void_long_Type();
3299 const TypePtr* no_memory_effects = NULL;
3300 Node* time = make_runtime_call(RC_LEAF, tf, funcAddr, funcName, no_memory_effects);
3301 Node* value = _gvn.transform(new (C) ProjNode(time, TypeFunc::Parms+0));
3302 #ifdef ASSERT
3303 Node* value_top = _gvn.transform(new (C) ProjNode(time, TypeFunc::Parms+1));
3304 assert(value_top == top(), "second value must be top");
3305 #endif
3306 set_result(value);
3307 return true;
3308 }
3309
3310 //------------------------inline_native_currentThread------------------
3311 bool LibraryCallKit::inline_native_currentThread() {
3312 Node* junk = NULL;
3313 set_result(generate_current_thread(junk));
3314 return true;
3315 }
3316
3317 //------------------------inline_native_isInterrupted------------------
3318 // private native boolean java.lang.Thread.isInterrupted(boolean ClearInterrupted);
3319 bool LibraryCallKit::inline_native_isInterrupted() {
3320 // Add a fast path to t.isInterrupted(clear_int):
3321 // (t == Thread.current() &&
3322 // (!TLS._osthread._interrupted || WINDOWS_ONLY(false) NOT_WINDOWS(!clear_int)))
3323 // ? TLS._osthread._interrupted : /*slow path:*/ t.isInterrupted(clear_int)
3324 // So, in the common case that the interrupt bit is false,
3325 // we avoid making a call into the VM. Even if the interrupt bit
3326 // is true, if the clear_int argument is false, we avoid the VM call.
3327 // However, if the receiver is not currentThread, we must call the VM,
3328 // because there must be some locking done around the operation.
3329
3330 // We only go to the fast case code if we pass two guards.
3331 // Paths which do not pass are accumulated in the slow_region.
3332
3333 enum {
3334 no_int_result_path = 1, // t == Thread.current() && !TLS._osthread._interrupted
3335 no_clear_result_path = 2, // t == Thread.current() && TLS._osthread._interrupted && !clear_int
3336 slow_result_path = 3, // slow path: t.isInterrupted(clear_int)
3337 PATH_LIMIT
3338 };
3339
3340 // Ensure that it's not possible to move the load of TLS._osthread._interrupted flag
3341 // out of the function.
3342 insert_mem_bar(Op_MemBarCPUOrder);
3343
3344 RegionNode* result_rgn = new (C) RegionNode(PATH_LIMIT);
3345 PhiNode* result_val = new (C) PhiNode(result_rgn, TypeInt::BOOL);
3346
3347 RegionNode* slow_region = new (C) RegionNode(1);
3348 record_for_igvn(slow_region);
3349
3350 // (a) Receiving thread must be the current thread.
3351 Node* rec_thr = argument(0);
3352 Node* tls_ptr = NULL;
3353 Node* cur_thr = generate_current_thread(tls_ptr);
3354 Node* cmp_thr = _gvn.transform(new (C) CmpPNode(cur_thr, rec_thr));
3355 Node* bol_thr = _gvn.transform(new (C) BoolNode(cmp_thr, BoolTest::ne));
3356
3357 generate_slow_guard(bol_thr, slow_region);
3358
3359 // (b) Interrupt bit on TLS must be false.
3360 Node* p = basic_plus_adr(top()/*!oop*/, tls_ptr, in_bytes(JavaThread::osthread_offset()));
3361 Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS, MemNode::unordered);
3362 p = basic_plus_adr(top()/*!oop*/, osthread, in_bytes(OSThread::interrupted_offset()));
3363
3364 // Set the control input on the field _interrupted read to prevent it floating up.
3365 Node* int_bit = make_load(control(), p, TypeInt::BOOL, T_INT, MemNode::unordered);
3366 Node* cmp_bit = _gvn.transform(new (C) CmpINode(int_bit, intcon(0)));
3367 Node* bol_bit = _gvn.transform(new (C) BoolNode(cmp_bit, BoolTest::ne));
3368
3369 IfNode* iff_bit = create_and_map_if(control(), bol_bit, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN);
3370
3371 // First fast path: if (!TLS._interrupted) return false;
3372 Node* false_bit = _gvn.transform(new (C) IfFalseNode(iff_bit));
3373 result_rgn->init_req(no_int_result_path, false_bit);
3374 result_val->init_req(no_int_result_path, intcon(0));
3375
3376 // drop through to next case
3377 set_control( _gvn.transform(new (C) IfTrueNode(iff_bit)));
3378
3379 #ifndef TARGET_OS_FAMILY_windows
3380 // (c) Or, if interrupt bit is set and clear_int is false, use 2nd fast path.
3381 Node* clr_arg = argument(1);
3382 Node* cmp_arg = _gvn.transform(new (C) CmpINode(clr_arg, intcon(0)));
3383 Node* bol_arg = _gvn.transform(new (C) BoolNode(cmp_arg, BoolTest::ne));
3384 IfNode* iff_arg = create_and_map_if(control(), bol_arg, PROB_FAIR, COUNT_UNKNOWN);
3385
3386 // Second fast path: ... else if (!clear_int) return true;
3387 Node* false_arg = _gvn.transform(new (C) IfFalseNode(iff_arg));
3388 result_rgn->init_req(no_clear_result_path, false_arg);
3389 result_val->init_req(no_clear_result_path, intcon(1));
3390
3391 // drop through to next case
3392 set_control( _gvn.transform(new (C) IfTrueNode(iff_arg)));
3393 #else
3394 // To return true on Windows you must read the _interrupted field
3395 // and check the the event state i.e. take the slow path.
3396 #endif // TARGET_OS_FAMILY_windows
3397
3398 // (d) Otherwise, go to the slow path.
3399 slow_region->add_req(control());
3400 set_control( _gvn.transform(slow_region));
3401
3402 if (stopped()) {
3403 // There is no slow path.
3404 result_rgn->init_req(slow_result_path, top());
3405 result_val->init_req(slow_result_path, top());
3406 } else {
3407 // non-virtual because it is a private non-static
3408 CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_isInterrupted);
3409
3410 Node* slow_val = set_results_for_java_call(slow_call);
3411 // this->control() comes from set_results_for_java_call
3412
3413 Node* fast_io = slow_call->in(TypeFunc::I_O);
3414 Node* fast_mem = slow_call->in(TypeFunc::Memory);
3415
3416 // These two phis are pre-filled with copies of of the fast IO and Memory
3417 PhiNode* result_mem = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM);
3418 PhiNode* result_io = PhiNode::make(result_rgn, fast_io, Type::ABIO);
3419
3420 result_rgn->init_req(slow_result_path, control());
3421 result_io ->init_req(slow_result_path, i_o());
3422 result_mem->init_req(slow_result_path, reset_memory());
3423 result_val->init_req(slow_result_path, slow_val);
3424
3425 set_all_memory(_gvn.transform(result_mem));
3426 set_i_o( _gvn.transform(result_io));
3427 }
3428
3429 C->set_has_split_ifs(true); // Has chance for split-if optimization
3430 set_result(result_rgn, result_val);
3431 return true;
3432 }
3433
3434 //---------------------------load_mirror_from_klass----------------------------
3435 // Given a klass oop, load its java mirror (a java.lang.Class oop).
3436 Node* LibraryCallKit::load_mirror_from_klass(Node* klass) {
3437 Node* p = basic_plus_adr(klass, in_bytes(Klass::java_mirror_offset()));
3438 return make_load(NULL, p, TypeInstPtr::MIRROR, T_OBJECT, MemNode::unordered);
3439 }
3440
3441 //-----------------------load_klass_from_mirror_common-------------------------
3442 // Given a java mirror (a java.lang.Class oop), load its corresponding klass oop.
3443 // Test the klass oop for null (signifying a primitive Class like Integer.TYPE),
3444 // and branch to the given path on the region.
3445 // If never_see_null, take an uncommon trap on null, so we can optimistically
3446 // compile for the non-null case.
3447 // If the region is NULL, force never_see_null = true.
3448 Node* LibraryCallKit::load_klass_from_mirror_common(Node* mirror,
3449 bool never_see_null,
3450 RegionNode* region,
3451 int null_path,
3452 int offset) {
3453 if (region == NULL) never_see_null = true;
3454 Node* p = basic_plus_adr(mirror, offset);
3455 const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL;
3456 Node* kls = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeRawPtr::BOTTOM, kls_type));
3457 Node* null_ctl = top();
3458 kls = null_check_oop(kls, &null_ctl, never_see_null);
3459 if (region != NULL) {
3460 // Set region->in(null_path) if the mirror is a primitive (e.g, int.class).
3461 region->init_req(null_path, null_ctl);
3462 } else {
3463 assert(null_ctl == top(), "no loose ends");
3464 }
3465 return kls;
3466 }
3467
3468 //--------------------(inline_native_Class_query helpers)---------------------
3469 // Use this for JVM_ACC_INTERFACE, JVM_ACC_IS_CLONEABLE, JVM_ACC_HAS_FINALIZER.
3470 // Fall through if (mods & mask) == bits, take the guard otherwise.
3471 Node* LibraryCallKit::generate_access_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region) {
3472 // Branch around if the given klass has the given modifier bit set.
3473 // Like generate_guard, adds a new path onto the region.
3474 Node* modp = basic_plus_adr(kls, in_bytes(Klass::access_flags_offset()));
3475 Node* mods = make_load(NULL, modp, TypeInt::INT, T_INT, MemNode::unordered);
3476 Node* mask = intcon(modifier_mask);
3477 Node* bits = intcon(modifier_bits);
3478 Node* mbit = _gvn.transform(new (C) AndINode(mods, mask));
3479 Node* cmp = _gvn.transform(new (C) CmpINode(mbit, bits));
3480 Node* bol = _gvn.transform(new (C) BoolNode(cmp, BoolTest::ne));
3481 return generate_fair_guard(bol, region);
3482 }
3483 Node* LibraryCallKit::generate_interface_guard(Node* kls, RegionNode* region) {
3484 return generate_access_flags_guard(kls, JVM_ACC_INTERFACE, 0, region);
3485 }
3486
3487 //-------------------------inline_native_Class_query-------------------
3488 bool LibraryCallKit::inline_native_Class_query(vmIntrinsics::ID id) {
3489 const Type* return_type = TypeInt::BOOL;
3490 Node* prim_return_value = top(); // what happens if it's a primitive class?
3491 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check);
3492 bool expect_prim = false; // most of these guys expect to work on refs
3493
3494 enum { _normal_path = 1, _prim_path = 2, PATH_LIMIT };
3495
3496 Node* mirror = argument(0);
3497 Node* obj = top();
3498
3499 switch (id) {
3500 case vmIntrinsics::_isInstance:
3501 // nothing is an instance of a primitive type
3502 prim_return_value = intcon(0);
3503 obj = argument(1);
3504 break;
3505 case vmIntrinsics::_getModifiers:
3506 prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC);
3507 assert(is_power_of_2((int)JVM_ACC_WRITTEN_FLAGS+1), "change next line");
3508 return_type = TypeInt::make(0, JVM_ACC_WRITTEN_FLAGS, Type::WidenMin);
3509 break;
3510 case vmIntrinsics::_isInterface:
3511 prim_return_value = intcon(0);
3512 break;
3513 case vmIntrinsics::_isArray:
3514 prim_return_value = intcon(0);
3515 expect_prim = true; // cf. ObjectStreamClass.getClassSignature
3516 break;
3517 case vmIntrinsics::_isPrimitive:
3518 prim_return_value = intcon(1);
3519 expect_prim = true; // obviously
3520 break;
3521 case vmIntrinsics::_getSuperclass:
3522 prim_return_value = null();
3523 return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR);
3524 break;
3525 case vmIntrinsics::_getComponentType:
3526 prim_return_value = null();
3527 return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR);
3528 break;
3529 case vmIntrinsics::_getClassAccessFlags:
3530 prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC);
3531 return_type = TypeInt::INT; // not bool! 6297094
3532 break;
3533 default:
3534 fatal_unexpected_iid(id);
3535 break;
3536 }
3537
3538 const TypeInstPtr* mirror_con = _gvn.type(mirror)->isa_instptr();
3539 if (mirror_con == NULL) return false; // cannot happen?
3540
3541 #ifndef PRODUCT
3542 if (C->print_intrinsics() || C->print_inlining()) {
3543 ciType* k = mirror_con->java_mirror_type();
3544 if (k) {
3545 tty->print("Inlining %s on constant Class ", vmIntrinsics::name_at(intrinsic_id()));
3546 k->print_name();
3547 tty->cr();
3548 }
3549 }
3550 #endif
3551
3552 // Null-check the mirror, and the mirror's klass ptr (in case it is a primitive).
3553 RegionNode* region = new (C) RegionNode(PATH_LIMIT);
3554 record_for_igvn(region);
3555 PhiNode* phi = new (C) PhiNode(region, return_type);
3556
3557 // The mirror will never be null of Reflection.getClassAccessFlags, however
3558 // it may be null for Class.isInstance or Class.getModifiers. Throw a NPE
3559 // if it is. See bug 4774291.
3560
3561 // For Reflection.getClassAccessFlags(), the null check occurs in
3562 // the wrong place; see inline_unsafe_access(), above, for a similar
3563 // situation.
3564 mirror = null_check(mirror);
3565 // If mirror or obj is dead, only null-path is taken.
3566 if (stopped()) return true;
3567
3568 if (expect_prim) never_see_null = false; // expect nulls (meaning prims)
3569
3570 // Now load the mirror's klass metaobject, and null-check it.
3571 // Side-effects region with the control path if the klass is null.
3572 Node* kls = load_klass_from_mirror(mirror, never_see_null, region, _prim_path);
3573 // If kls is null, we have a primitive mirror.
3574 phi->init_req(_prim_path, prim_return_value);
3575 if (stopped()) { set_result(region, phi); return true; }
3576 bool safe_for_replace = (region->in(_prim_path) == top());
3577
3578 Node* p; // handy temp
3579 Node* null_ctl;
3580
3581 // Now that we have the non-null klass, we can perform the real query.
3582 // For constant classes, the query will constant-fold in LoadNode::Value.
3583 Node* query_value = top();
3584 switch (id) {
3585 case vmIntrinsics::_isInstance:
3586 // nothing is an instance of a primitive type
3587 query_value = gen_instanceof(obj, kls, safe_for_replace);
3588 break;
3589
3590 case vmIntrinsics::_getModifiers:
3591 p = basic_plus_adr(kls, in_bytes(Klass::modifier_flags_offset()));
3592 query_value = make_load(NULL, p, TypeInt::INT, T_INT, MemNode::unordered);
3593 break;
3594
3595 case vmIntrinsics::_isInterface:
3596 // (To verify this code sequence, check the asserts in JVM_IsInterface.)
3597 if (generate_interface_guard(kls, region) != NULL)
3598 // A guard was added. If the guard is taken, it was an interface.
3599 phi->add_req(intcon(1));
3600 // If we fall through, it's a plain class.
3601 query_value = intcon(0);
3602 break;
3603
3604 case vmIntrinsics::_isArray:
3605 // (To verify this code sequence, check the asserts in JVM_IsArrayClass.)
3606 if (generate_array_guard(kls, region) != NULL)
3607 // A guard was added. If the guard is taken, it was an array.
3608 phi->add_req(intcon(1));
3609 // If we fall through, it's a plain class.
3610 query_value = intcon(0);
3611 break;
3612
3613 case vmIntrinsics::_isPrimitive:
3614 query_value = intcon(0); // "normal" path produces false
3615 break;
3616
3617 case vmIntrinsics::_getSuperclass:
3618 // The rules here are somewhat unfortunate, but we can still do better
3619 // with random logic than with a JNI call.
3620 // Interfaces store null or Object as _super, but must report null.
3621 // Arrays store an intermediate super as _super, but must report Object.
3622 // Other types can report the actual _super.
3623 // (To verify this code sequence, check the asserts in JVM_IsInterface.)
3624 if (generate_interface_guard(kls, region) != NULL)
3625 // A guard was added. If the guard is taken, it was an interface.
3626 phi->add_req(null());
3627 if (generate_array_guard(kls, region) != NULL)
3628 // A guard was added. If the guard is taken, it was an array.
3629 phi->add_req(makecon(TypeInstPtr::make(env()->Object_klass()->java_mirror())));
3630 // If we fall through, it's a plain class. Get its _super.
3631 p = basic_plus_adr(kls, in_bytes(Klass::super_offset()));
3632 kls = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeRawPtr::BOTTOM, TypeKlassPtr::OBJECT_OR_NULL));
3633 null_ctl = top();
3634 kls = null_check_oop(kls, &null_ctl);
3635 if (null_ctl != top()) {
3636 // If the guard is taken, Object.superClass is null (both klass and mirror).
3637 region->add_req(null_ctl);
3638 phi ->add_req(null());
3639 }
3640 if (!stopped()) {
3641 query_value = load_mirror_from_klass(kls);
3642 }
3643 break;
3644
3645 case vmIntrinsics::_getComponentType:
3646 if (generate_array_guard(kls, region) != NULL) {
3647 // Be sure to pin the oop load to the guard edge just created:
3648 Node* is_array_ctrl = region->in(region->req()-1);
3649 Node* cma = basic_plus_adr(kls, in_bytes(ArrayKlass::component_mirror_offset()));
3650 Node* cmo = make_load(is_array_ctrl, cma, TypeInstPtr::MIRROR, T_OBJECT, MemNode::unordered);
3651 phi->add_req(cmo);
3652 }
3653 query_value = null(); // non-array case is null
3654 break;
3655
3656 case vmIntrinsics::_getClassAccessFlags:
3657 p = basic_plus_adr(kls, in_bytes(Klass::access_flags_offset()));
3658 query_value = make_load(NULL, p, TypeInt::INT, T_INT, MemNode::unordered);
3659 break;
3660
3661 default:
3662 fatal_unexpected_iid(id);
3663 break;
3664 }
3665
3666 // Fall-through is the normal case of a query to a real class.
3667 phi->init_req(1, query_value);
3668 region->init_req(1, control());
3669
3670 C->set_has_split_ifs(true); // Has chance for split-if optimization
3671 set_result(region, phi);
3672 return true;
3673 }
3674
3675 //--------------------------inline_native_subtype_check------------------------
3676 // This intrinsic takes the JNI calls out of the heart of
3677 // UnsafeFieldAccessorImpl.set, which improves Field.set, readObject, etc.
3678 bool LibraryCallKit::inline_native_subtype_check() {
3679 // Pull both arguments off the stack.
3680 Node* args[2]; // two java.lang.Class mirrors: superc, subc
3681 args[0] = argument(0);
3682 args[1] = argument(1);
3683 Node* klasses[2]; // corresponding Klasses: superk, subk
3684 klasses[0] = klasses[1] = top();
3685
3686 enum {
3687 // A full decision tree on {superc is prim, subc is prim}:
3688 _prim_0_path = 1, // {P,N} => false
3689 // {P,P} & superc!=subc => false
3690 _prim_same_path, // {P,P} & superc==subc => true
3691 _prim_1_path, // {N,P} => false
3692 _ref_subtype_path, // {N,N} & subtype check wins => true
3693 _both_ref_path, // {N,N} & subtype check loses => false
3694 PATH_LIMIT
3695 };
3696
3697 RegionNode* region = new (C) RegionNode(PATH_LIMIT);
3698 Node* phi = new (C) PhiNode(region, TypeInt::BOOL);
3699 record_for_igvn(region);
3700
3701 const TypePtr* adr_type = TypeRawPtr::BOTTOM; // memory type of loads
3702 const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL;
3703 int class_klass_offset = java_lang_Class::klass_offset_in_bytes();
3704
3705 // First null-check both mirrors and load each mirror's klass metaobject.
3706 int which_arg;
3707 for (which_arg = 0; which_arg <= 1; which_arg++) {
3708 Node* arg = args[which_arg];
3709 arg = null_check(arg);
3710 if (stopped()) break;
3711 args[which_arg] = arg;
3712
3713 Node* p = basic_plus_adr(arg, class_klass_offset);
3714 Node* kls = LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, adr_type, kls_type);
3715 klasses[which_arg] = _gvn.transform(kls);
3716 }
3717
3718 // Having loaded both klasses, test each for null.
3719 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check);
3720 for (which_arg = 0; which_arg <= 1; which_arg++) {
3721 Node* kls = klasses[which_arg];
3722 Node* null_ctl = top();
3723 kls = null_check_oop(kls, &null_ctl, never_see_null);
3724 int prim_path = (which_arg == 0 ? _prim_0_path : _prim_1_path);
3725 region->init_req(prim_path, null_ctl);
3726 if (stopped()) break;
3727 klasses[which_arg] = kls;
3728 }
3729
3730 if (!stopped()) {
3731 // now we have two reference types, in klasses[0..1]
3732 Node* subk = klasses[1]; // the argument to isAssignableFrom
3733 Node* superk = klasses[0]; // the receiver
3734 region->set_req(_both_ref_path, gen_subtype_check(subk, superk));
3735 // now we have a successful reference subtype check
3736 region->set_req(_ref_subtype_path, control());
3737 }
3738
3739 // If both operands are primitive (both klasses null), then
3740 // we must return true when they are identical primitives.
3741 // It is convenient to test this after the first null klass check.
3742 set_control(region->in(_prim_0_path)); // go back to first null check
3743 if (!stopped()) {
3744 // Since superc is primitive, make a guard for the superc==subc case.
3745 Node* cmp_eq = _gvn.transform(new (C) CmpPNode(args[0], args[1]));
3746 Node* bol_eq = _gvn.transform(new (C) BoolNode(cmp_eq, BoolTest::eq));
3747 generate_guard(bol_eq, region, PROB_FAIR);
3748 if (region->req() == PATH_LIMIT+1) {
3749 // A guard was added. If the added guard is taken, superc==subc.
3750 region->swap_edges(PATH_LIMIT, _prim_same_path);
3751 region->del_req(PATH_LIMIT);
3752 }
3753 region->set_req(_prim_0_path, control()); // Not equal after all.
3754 }
3755
3756 // these are the only paths that produce 'true':
3757 phi->set_req(_prim_same_path, intcon(1));
3758 phi->set_req(_ref_subtype_path, intcon(1));
3759
3760 // pull together the cases:
3761 assert(region->req() == PATH_LIMIT, "sane region");
3762 for (uint i = 1; i < region->req(); i++) {
3763 Node* ctl = region->in(i);
3764 if (ctl == NULL || ctl == top()) {
3765 region->set_req(i, top());
3766 phi ->set_req(i, top());
3767 } else if (phi->in(i) == NULL) {
3768 phi->set_req(i, intcon(0)); // all other paths produce 'false'
3769 }
3770 }
3771
3772 set_control(_gvn.transform(region));
3773 set_result(_gvn.transform(phi));
3774 return true;
3775 }
3776
3777 //---------------------generate_array_guard_common------------------------
3778 Node* LibraryCallKit::generate_array_guard_common(Node* kls, RegionNode* region,
3779 bool obj_array, bool not_array) {
3780 // If obj_array/non_array==false/false:
3781 // Branch around if the given klass is in fact an array (either obj or prim).
3782 // If obj_array/non_array==false/true:
3783 // Branch around if the given klass is not an array klass of any kind.
3784 // If obj_array/non_array==true/true:
3785 // Branch around if the kls is not an oop array (kls is int[], String, etc.)
3786 // If obj_array/non_array==true/false:
3787 // Branch around if the kls is an oop array (Object[] or subtype)
3788 //
3789 // Like generate_guard, adds a new path onto the region.
3790 jint layout_con = 0;
3791 Node* layout_val = get_layout_helper(kls, layout_con);
3792 if (layout_val == NULL) {
3793 bool query = (obj_array
3794 ? Klass::layout_helper_is_objArray(layout_con)
3795 : Klass::layout_helper_is_array(layout_con));
3796 if (query == not_array) {
3797 return NULL; // never a branch
3798 } else { // always a branch
3799 Node* always_branch = control();
3800 if (region != NULL)
3801 region->add_req(always_branch);
3802 set_control(top());
3803 return always_branch;
3804 }
3805 }
3806 // Now test the correct condition.
3807 jint nval = (obj_array
3808 ? ((jint)Klass::_lh_array_tag_type_value
3809 << Klass::_lh_array_tag_shift)
3810 : Klass::_lh_neutral_value);
3811 Node* cmp = _gvn.transform(new(C) CmpINode(layout_val, intcon(nval)));
3812 BoolTest::mask btest = BoolTest::lt; // correct for testing is_[obj]array
3813 // invert the test if we are looking for a non-array
3814 if (not_array) btest = BoolTest(btest).negate();
3815 Node* bol = _gvn.transform(new(C) BoolNode(cmp, btest));
3816 return generate_fair_guard(bol, region);
3817 }
3818
3819
3820 //-----------------------inline_native_newArray--------------------------
3821 // private static native Object java.lang.reflect.newArray(Class<?> componentType, int length);
3822 bool LibraryCallKit::inline_native_newArray() {
3823 Node* mirror = argument(0);
3824 Node* count_val = argument(1);
3825
3826 mirror = null_check(mirror);
3827 // If mirror or obj is dead, only null-path is taken.
3828 if (stopped()) return true;
3829
3830 enum { _normal_path = 1, _slow_path = 2, PATH_LIMIT };
3831 RegionNode* result_reg = new(C) RegionNode(PATH_LIMIT);
3832 PhiNode* result_val = new(C) PhiNode(result_reg,
3833 TypeInstPtr::NOTNULL);
3834 PhiNode* result_io = new(C) PhiNode(result_reg, Type::ABIO);
3835 PhiNode* result_mem = new(C) PhiNode(result_reg, Type::MEMORY,
3836 TypePtr::BOTTOM);
3837
3838 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check);
3839 Node* klass_node = load_array_klass_from_mirror(mirror, never_see_null,
3840 result_reg, _slow_path);
3841 Node* normal_ctl = control();
3842 Node* no_array_ctl = result_reg->in(_slow_path);
3843
3844 // Generate code for the slow case. We make a call to newArray().
3845 set_control(no_array_ctl);
3846 if (!stopped()) {
3847 // Either the input type is void.class, or else the
3848 // array klass has not yet been cached. Either the
3849 // ensuing call will throw an exception, or else it
3850 // will cache the array klass for next time.
3851 PreserveJVMState pjvms(this);
3852 CallJavaNode* slow_call = generate_method_call_static(vmIntrinsics::_newArray);
3853 Node* slow_result = set_results_for_java_call(slow_call);
3854 // this->control() comes from set_results_for_java_call
3855 result_reg->set_req(_slow_path, control());
3856 result_val->set_req(_slow_path, slow_result);
3857 result_io ->set_req(_slow_path, i_o());
3858 result_mem->set_req(_slow_path, reset_memory());
3859 }
3860
3861 set_control(normal_ctl);
3862 if (!stopped()) {
3863 // Normal case: The array type has been cached in the java.lang.Class.
3864 // The following call works fine even if the array type is polymorphic.
3865 // It could be a dynamic mix of int[], boolean[], Object[], etc.
3866 Node* obj = new_array(klass_node, count_val, 0); // no arguments to push
3867 result_reg->init_req(_normal_path, control());
3868 result_val->init_req(_normal_path, obj);
3869 result_io ->init_req(_normal_path, i_o());
3870 result_mem->init_req(_normal_path, reset_memory());
3871 }
3872
3873 // Return the combined state.
3874 set_i_o( _gvn.transform(result_io) );
3875 set_all_memory( _gvn.transform(result_mem));
3876
3877 C->set_has_split_ifs(true); // Has chance for split-if optimization
3878 set_result(result_reg, result_val);
3879 return true;
3880 }
3881
3882 //----------------------inline_native_getLength--------------------------
3883 // public static native int java.lang.reflect.Array.getLength(Object array);
3884 bool LibraryCallKit::inline_native_getLength() {
3885 if (too_many_traps(Deoptimization::Reason_intrinsic)) return false;
3886
3887 Node* array = null_check(argument(0));
3888 // If array is dead, only null-path is taken.
3889 if (stopped()) return true;
3890
3891 // Deoptimize if it is a non-array.
3892 Node* non_array = generate_non_array_guard(load_object_klass(array), NULL);
3893
3894 if (non_array != NULL) {
3895 PreserveJVMState pjvms(this);
3896 set_control(non_array);
3897 uncommon_trap(Deoptimization::Reason_intrinsic,
3898 Deoptimization::Action_maybe_recompile);
3899 }
3900
3901 // If control is dead, only non-array-path is taken.
3902 if (stopped()) return true;
3903
3904 // The works fine even if the array type is polymorphic.
3905 // It could be a dynamic mix of int[], boolean[], Object[], etc.
3906 Node* result = load_array_length(array);
3907
3908 C->set_has_split_ifs(true); // Has chance for split-if optimization
3909 set_result(result);
3910 return true;
3911 }
3912
3913 //------------------------inline_array_copyOf----------------------------
3914 // public static <T,U> T[] java.util.Arrays.copyOf( U[] original, int newLength, Class<? extends T[]> newType);
3915 // public static <T,U> T[] java.util.Arrays.copyOfRange(U[] original, int from, int to, Class<? extends T[]> newType);
3916 bool LibraryCallKit::inline_array_copyOf(bool is_copyOfRange) {
3917 if (too_many_traps(Deoptimization::Reason_intrinsic)) return false;
3918
3919 // Get the arguments.
3920 Node* original = argument(0);
3921 Node* start = is_copyOfRange? argument(1): intcon(0);
3922 Node* end = is_copyOfRange? argument(2): argument(1);
3923 Node* array_type_mirror = is_copyOfRange? argument(3): argument(2);
3924
3925 Node* newcopy = NULL;
3926
3927 // Set the original stack and the reexecute bit for the interpreter to reexecute
3928 // the bytecode that invokes Arrays.copyOf if deoptimization happens.
3929 { PreserveReexecuteState preexecs(this);
3930 jvms()->set_should_reexecute(true);
3931
3932 array_type_mirror = null_check(array_type_mirror);
3933 original = null_check(original);
3934
3935 // Check if a null path was taken unconditionally.
3936 if (stopped()) return true;
3937
3938 Node* orig_length = load_array_length(original);
3939
3940 Node* klass_node = load_klass_from_mirror(array_type_mirror, false, NULL, 0);
3941 klass_node = null_check(klass_node);
3942
3943 RegionNode* bailout = new (C) RegionNode(1);
3944 record_for_igvn(bailout);
3945
3946 // Despite the generic type of Arrays.copyOf, the mirror might be int, int[], etc.
3947 // Bail out if that is so.
3948 Node* not_objArray = generate_non_objArray_guard(klass_node, bailout);
3949 if (not_objArray != NULL) {
3950 // Improve the klass node's type from the new optimistic assumption:
3951 ciKlass* ak = ciArrayKlass::make(env()->Object_klass());
3952 const Type* akls = TypeKlassPtr::make(TypePtr::NotNull, ak, 0/*offset*/);
3953 Node* cast = new (C) CastPPNode(klass_node, akls);
3954 cast->init_req(0, control());
3955 klass_node = _gvn.transform(cast);
3956 }
3957
3958 // Bail out if either start or end is negative.
3959 generate_negative_guard(start, bailout, &start);
3960 generate_negative_guard(end, bailout, &end);
3961
3962 Node* length = end;
3963 if (_gvn.type(start) != TypeInt::ZERO) {
3964 length = _gvn.transform(new (C) SubINode(end, start));
3965 }
3966
3967 // Bail out if length is negative.
3968 // Without this the new_array would throw
3969 // NegativeArraySizeException but IllegalArgumentException is what
3970 // should be thrown
3971 generate_negative_guard(length, bailout, &length);
3972
3973 if (bailout->req() > 1) {
3974 PreserveJVMState pjvms(this);
3975 set_control(_gvn.transform(bailout));
3976 uncommon_trap(Deoptimization::Reason_intrinsic,
3977 Deoptimization::Action_maybe_recompile);
3978 }
3979
3980 if (!stopped()) {
3981 // How many elements will we copy from the original?
3982 // The answer is MinI(orig_length - start, length).
3983 Node* orig_tail = _gvn.transform(new (C) SubINode(orig_length, start));
3984 Node* moved = generate_min_max(vmIntrinsics::_min, orig_tail, length);
3985
3986 newcopy = new_array(klass_node, length, 0); // no argments to push
3987
3988 // Generate a direct call to the right arraycopy function(s).
3989 // We know the copy is disjoint but we might not know if the
3990 // oop stores need checking.
3991 // Extreme case: Arrays.copyOf((Integer[])x, 10, String[].class).
3992 // This will fail a store-check if x contains any non-nulls.
3993 bool disjoint_bases = true;
3994 // if start > orig_length then the length of the copy may be
3995 // negative.
3996 bool length_never_negative = !is_copyOfRange;
3997 generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT,
3998 original, start, newcopy, intcon(0), moved,
3999 disjoint_bases, length_never_negative);
4000 }
4001 } // original reexecute is set back here
4002
4003 C->set_has_split_ifs(true); // Has chance for split-if optimization
4004 if (!stopped()) {
4005 set_result(newcopy);
4006 }
4007 return true;
4008 }
4009
4010
4011 //----------------------generate_virtual_guard---------------------------
4012 // Helper for hashCode and clone. Peeks inside the vtable to avoid a call.
4013 Node* LibraryCallKit::generate_virtual_guard(Node* obj_klass,
4014 RegionNode* slow_region) {
4015 ciMethod* method = callee();
4016 int vtable_index = method->vtable_index();
4017 assert(vtable_index >= 0 || vtable_index == Method::nonvirtual_vtable_index,
4018 err_msg_res("bad index %d", vtable_index));
4019 // Get the Method* out of the appropriate vtable entry.
4020 int entry_offset = (InstanceKlass::vtable_start_offset() +
4021 vtable_index*vtableEntry::size()) * wordSize +
4022 vtableEntry::method_offset_in_bytes();
4023 Node* entry_addr = basic_plus_adr(obj_klass, entry_offset);
4024 Node* target_call = make_load(NULL, entry_addr, TypePtr::NOTNULL, T_ADDRESS, MemNode::unordered);
4025
4026 // Compare the target method with the expected method (e.g., Object.hashCode).
4027 const TypePtr* native_call_addr = TypeMetadataPtr::make(method);
4028
4029 Node* native_call = makecon(native_call_addr);
4030 Node* chk_native = _gvn.transform(new(C) CmpPNode(target_call, native_call));
4031 Node* test_native = _gvn.transform(new(C) BoolNode(chk_native, BoolTest::ne));
4032
4033 return generate_slow_guard(test_native, slow_region);
4034 }
4035
4036 //-----------------------generate_method_call----------------------------
4037 // Use generate_method_call to make a slow-call to the real
4038 // method if the fast path fails. An alternative would be to
4039 // use a stub like OptoRuntime::slow_arraycopy_Java.
4040 // This only works for expanding the current library call,
4041 // not another intrinsic. (E.g., don't use this for making an
4042 // arraycopy call inside of the copyOf intrinsic.)
4043 CallJavaNode*
4044 LibraryCallKit::generate_method_call(vmIntrinsics::ID method_id, bool is_virtual, bool is_static) {
4045 // When compiling the intrinsic method itself, do not use this technique.
4046 guarantee(callee() != C->method(), "cannot make slow-call to self");
4047
4048 ciMethod* method = callee();
4049 // ensure the JVMS we have will be correct for this call
4050 guarantee(method_id == method->intrinsic_id(), "must match");
4051
4052 const TypeFunc* tf = TypeFunc::make(method);
4053 CallJavaNode* slow_call;
4054 if (is_static) {
4055 assert(!is_virtual, "");
4056 slow_call = new(C) CallStaticJavaNode(C, tf,
4057 SharedRuntime::get_resolve_static_call_stub(),
4058 method, bci());
4059 } else if (is_virtual) {
4060 null_check_receiver();
4061 int vtable_index = Method::invalid_vtable_index;
4062 if (UseInlineCaches) {
4063 // Suppress the vtable call
4064 } else {
4065 // hashCode and clone are not a miranda methods,
4066 // so the vtable index is fixed.
4067 // No need to use the linkResolver to get it.
4068 vtable_index = method->vtable_index();
4069 assert(vtable_index >= 0 || vtable_index == Method::nonvirtual_vtable_index,
4070 err_msg_res("bad index %d", vtable_index));
4071 }
4072 slow_call = new(C) CallDynamicJavaNode(tf,
4073 SharedRuntime::get_resolve_virtual_call_stub(),
4074 method, vtable_index, bci());
4075 } else { // neither virtual nor static: opt_virtual
4076 null_check_receiver();
4077 slow_call = new(C) CallStaticJavaNode(C, tf,
4078 SharedRuntime::get_resolve_opt_virtual_call_stub(),
4079 method, bci());
4080 slow_call->set_optimized_virtual(true);
4081 }
4082 set_arguments_for_java_call(slow_call);
4083 set_edges_for_java_call(slow_call);
4084 return slow_call;
4085 }
4086
4087
4088 /**
4089 * Build special case code for calls to hashCode on an object. This call may
4090 * be virtual (invokevirtual) or bound (invokespecial). For each case we generate
4091 * slightly different code.
4092 */
4093 bool LibraryCallKit::inline_native_hashcode(bool is_virtual, bool is_static) {
4094 assert(is_static == callee()->is_static(), "correct intrinsic selection");
4095 assert(!(is_virtual && is_static), "either virtual, special, or static");
4096
4097 enum { _slow_path = 1, _fast_path, _null_path, PATH_LIMIT };
4098
4099 RegionNode* result_reg = new(C) RegionNode(PATH_LIMIT);
4100 PhiNode* result_val = new(C) PhiNode(result_reg, TypeInt::INT);
4101 PhiNode* result_io = new(C) PhiNode(result_reg, Type::ABIO);
4102 PhiNode* result_mem = new(C) PhiNode(result_reg, Type::MEMORY, TypePtr::BOTTOM);
4103 Node* obj = NULL;
4104 if (!is_static) {
4105 // Check for hashing null object
4106 obj = null_check_receiver();
4107 if (stopped()) return true; // unconditionally null
4108 result_reg->init_req(_null_path, top());
4109 result_val->init_req(_null_path, top());
4110 } else {
4111 // Do a null check, and return zero if null.
4112 // System.identityHashCode(null) == 0
4113 obj = argument(0);
4114 Node* null_ctl = top();
4115 obj = null_check_oop(obj, &null_ctl);
4116 result_reg->init_req(_null_path, null_ctl);
4117 result_val->init_req(_null_path, _gvn.intcon(0));
4118 }
4119
4120 // Unconditionally null? Then return right away.
4121 if (stopped()) {
4122 set_control( result_reg->in(_null_path));
4123 if (!stopped())
4124 set_result(result_val->in(_null_path));
4125 return true;
4126 }
4127
4128 // We only go to the fast case code if we pass a number of guards. The
4129 // paths which do not pass are accumulated in the slow_region.
4130 RegionNode* slow_region = new (C) RegionNode(1);
4131 record_for_igvn(slow_region);
4132
4133 // If this is a virtual call, we generate a funny guard. We pull out
4134 // the vtable entry corresponding to hashCode() from the target object.
4135 // If the target method which we are calling happens to be the native
4136 // Object hashCode() method, we pass the guard. We do not need this
4137 // guard for non-virtual calls -- the caller is known to be the native
4138 // Object hashCode().
4139 if (is_virtual) {
4140 // After null check, get the object's klass.
4141 Node* obj_klass = load_object_klass(obj);
4142 generate_virtual_guard(obj_klass, slow_region);
4143 }
4144
4145 // Get the header out of the object, use LoadMarkNode when available
4146 Node* header_addr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes());
4147 // The control of the load must be NULL. Otherwise, the load can move before
4148 // the null check after castPP removal.
4149 Node* no_ctrl = NULL;
4150 Node* header = make_load(no_ctrl, header_addr, TypeX_X, TypeX_X->basic_type(), MemNode::unordered);
4151
4152 // Test the header to see if it is unlocked.
4153 Node* lock_mask = _gvn.MakeConX(markOopDesc::biased_lock_mask_in_place);
4154 Node* lmasked_header = _gvn.transform(new (C) AndXNode(header, lock_mask));
4155 Node* unlocked_val = _gvn.MakeConX(markOopDesc::unlocked_value);
4156 Node* chk_unlocked = _gvn.transform(new (C) CmpXNode( lmasked_header, unlocked_val));
4157 Node* test_unlocked = _gvn.transform(new (C) BoolNode( chk_unlocked, BoolTest::ne));
4158
4159 generate_slow_guard(test_unlocked, slow_region);
4160
4161 // Get the hash value and check to see that it has been properly assigned.
4162 // We depend on hash_mask being at most 32 bits and avoid the use of
4163 // hash_mask_in_place because it could be larger than 32 bits in a 64-bit
4164 // vm: see markOop.hpp.
4165 Node* hash_mask = _gvn.intcon(markOopDesc::hash_mask);
4166 Node* hash_shift = _gvn.intcon(markOopDesc::hash_shift);
4167 Node* hshifted_header= _gvn.transform(new (C) URShiftXNode(header, hash_shift));
4168 // This hack lets the hash bits live anywhere in the mark object now, as long
4169 // as the shift drops the relevant bits into the low 32 bits. Note that
4170 // Java spec says that HashCode is an int so there's no point in capturing
4171 // an 'X'-sized hashcode (32 in 32-bit build or 64 in 64-bit build).
4172 hshifted_header = ConvX2I(hshifted_header);
4173 Node* hash_val = _gvn.transform(new (C) AndINode(hshifted_header, hash_mask));
4174
4175 Node* no_hash_val = _gvn.intcon(markOopDesc::no_hash);
4176 Node* chk_assigned = _gvn.transform(new (C) CmpINode( hash_val, no_hash_val));
4177 Node* test_assigned = _gvn.transform(new (C) BoolNode( chk_assigned, BoolTest::eq));
4178
4179 generate_slow_guard(test_assigned, slow_region);
4180
4181 Node* init_mem = reset_memory();
4182 // fill in the rest of the null path:
4183 result_io ->init_req(_null_path, i_o());
4184 result_mem->init_req(_null_path, init_mem);
4185
4186 result_val->init_req(_fast_path, hash_val);
4187 result_reg->init_req(_fast_path, control());
4188 result_io ->init_req(_fast_path, i_o());
4189 result_mem->init_req(_fast_path, init_mem);
4190
4191 // Generate code for the slow case. We make a call to hashCode().
4192 set_control(_gvn.transform(slow_region));
4193 if (!stopped()) {
4194 // No need for PreserveJVMState, because we're using up the present state.
4195 set_all_memory(init_mem);
4196 vmIntrinsics::ID hashCode_id = is_static ? vmIntrinsics::_identityHashCode : vmIntrinsics::_hashCode;
4197 CallJavaNode* slow_call = generate_method_call(hashCode_id, is_virtual, is_static);
4198 Node* slow_result = set_results_for_java_call(slow_call);
4199 // this->control() comes from set_results_for_java_call
4200 result_reg->init_req(_slow_path, control());
4201 result_val->init_req(_slow_path, slow_result);
4202 result_io ->set_req(_slow_path, i_o());
4203 result_mem ->set_req(_slow_path, reset_memory());
4204 }
4205
4206 // Return the combined state.
4207 set_i_o( _gvn.transform(result_io) );
4208 set_all_memory( _gvn.transform(result_mem));
4209
4210 set_result(result_reg, result_val);
4211 return true;
4212 }
4213
4214 //---------------------------inline_native_getClass----------------------------
4215 // public final native Class<?> java.lang.Object.getClass();
4216 //
4217 // Build special case code for calls to getClass on an object.
4218 bool LibraryCallKit::inline_native_getClass() {
4219 Node* obj = null_check_receiver();
4220 if (stopped()) return true;
4221 set_result(load_mirror_from_klass(load_object_klass(obj)));
4222 return true;
4223 }
4224
4225 //-----------------inline_native_Reflection_getCallerClass---------------------
4226 // public static native Class<?> sun.reflect.Reflection.getCallerClass();
4227 //
4228 // In the presence of deep enough inlining, getCallerClass() becomes a no-op.
4229 //
4230 // NOTE: This code must perform the same logic as JVM_GetCallerClass
4231 // in that it must skip particular security frames and checks for
4232 // caller sensitive methods.
4233 bool LibraryCallKit::inline_native_Reflection_getCallerClass() {
4234 #ifndef PRODUCT
4235 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
4236 tty->print_cr("Attempting to inline sun.reflect.Reflection.getCallerClass");
4237 }
4238 #endif
4239
4240 if (!jvms()->has_method()) {
4241 #ifndef PRODUCT
4242 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
4243 tty->print_cr(" Bailing out because intrinsic was inlined at top level");
4244 }
4245 #endif
4246 return false;
4247 }
4248
4249 // Walk back up the JVM state to find the caller at the required
4250 // depth.
4251 JVMState* caller_jvms = jvms();
4252
4253 // Cf. JVM_GetCallerClass
4254 // NOTE: Start the loop at depth 1 because the current JVM state does
4255 // not include the Reflection.getCallerClass() frame.
4256 for (int n = 1; caller_jvms != NULL; caller_jvms = caller_jvms->caller(), n++) {
4257 ciMethod* m = caller_jvms->method();
4258 switch (n) {
4259 case 0:
4260 fatal("current JVM state does not include the Reflection.getCallerClass frame");
4261 break;
4262 case 1:
4263 // Frame 0 and 1 must be caller sensitive (see JVM_GetCallerClass).
4264 if (!m->caller_sensitive()) {
4265 #ifndef PRODUCT
4266 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
4267 tty->print_cr(" Bailing out: CallerSensitive annotation expected at frame %d", n);
4268 }
4269 #endif
4270 return false; // bail-out; let JVM_GetCallerClass do the work
4271 }
4272 break;
4273 default:
4274 if (!m->is_ignored_by_security_stack_walk()) {
4275 // We have reached the desired frame; return the holder class.
4276 // Acquire method holder as java.lang.Class and push as constant.
4277 ciInstanceKlass* caller_klass = caller_jvms->method()->holder();
4278 ciInstance* caller_mirror = caller_klass->java_mirror();
4279 set_result(makecon(TypeInstPtr::make(caller_mirror)));
4280
4281 #ifndef PRODUCT
4282 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
4283 tty->print_cr(" Succeeded: caller = %d) %s.%s, JVMS depth = %d", n, caller_klass->name()->as_utf8(), caller_jvms->method()->name()->as_utf8(), jvms()->depth());
4284 tty->print_cr(" JVM state at this point:");
4285 for (int i = jvms()->depth(), n = 1; i >= 1; i--, n++) {
4286 ciMethod* m = jvms()->of_depth(i)->method();
4287 tty->print_cr(" %d) %s.%s", n, m->holder()->name()->as_utf8(), m->name()->as_utf8());
4288 }
4289 }
4290 #endif
4291 return true;
4292 }
4293 break;
4294 }
4295 }
4296
4297 #ifndef PRODUCT
4298 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
4299 tty->print_cr(" Bailing out because caller depth exceeded inlining depth = %d", jvms()->depth());
4300 tty->print_cr(" JVM state at this point:");
4301 for (int i = jvms()->depth(), n = 1; i >= 1; i--, n++) {
4302 ciMethod* m = jvms()->of_depth(i)->method();
4303 tty->print_cr(" %d) %s.%s", n, m->holder()->name()->as_utf8(), m->name()->as_utf8());
4304 }
4305 }
4306 #endif
4307
4308 return false; // bail-out; let JVM_GetCallerClass do the work
4309 }
4310
4311 bool LibraryCallKit::inline_fp_conversions(vmIntrinsics::ID id) {
4312 Node* arg = argument(0);
4313 Node* result = NULL;
4314
4315 switch (id) {
4316 case vmIntrinsics::_floatToRawIntBits: result = new (C) MoveF2INode(arg); break;
4317 case vmIntrinsics::_intBitsToFloat: result = new (C) MoveI2FNode(arg); break;
4318 case vmIntrinsics::_doubleToRawLongBits: result = new (C) MoveD2LNode(arg); break;
4319 case vmIntrinsics::_longBitsToDouble: result = new (C) MoveL2DNode(arg); break;
4320
4321 case vmIntrinsics::_doubleToLongBits: {
4322 // two paths (plus control) merge in a wood
4323 RegionNode *r = new (C) RegionNode(3);
4324 Node *phi = new (C) PhiNode(r, TypeLong::LONG);
4325
4326 Node *cmpisnan = _gvn.transform(new (C) CmpDNode(arg, arg));
4327 // Build the boolean node
4328 Node *bolisnan = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::ne));
4329
4330 // Branch either way.
4331 // NaN case is less traveled, which makes all the difference.
4332 IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
4333 Node *opt_isnan = _gvn.transform(ifisnan);
4334 assert( opt_isnan->is_If(), "Expect an IfNode");
4335 IfNode *opt_ifisnan = (IfNode*)opt_isnan;
4336 Node *iftrue = _gvn.transform(new (C) IfTrueNode(opt_ifisnan));
4337
4338 set_control(iftrue);
4339
4340 static const jlong nan_bits = CONST64(0x7ff8000000000000);
4341 Node *slow_result = longcon(nan_bits); // return NaN
4342 phi->init_req(1, _gvn.transform( slow_result ));
4343 r->init_req(1, iftrue);
4344
4345 // Else fall through
4346 Node *iffalse = _gvn.transform(new (C) IfFalseNode(opt_ifisnan));
4347 set_control(iffalse);
4348
4349 phi->init_req(2, _gvn.transform(new (C) MoveD2LNode(arg)));
4350 r->init_req(2, iffalse);
4351
4352 // Post merge
4353 set_control(_gvn.transform(r));
4354 record_for_igvn(r);
4355
4356 C->set_has_split_ifs(true); // Has chance for split-if optimization
4357 result = phi;
4358 assert(result->bottom_type()->isa_long(), "must be");
4359 break;
4360 }
4361
4362 case vmIntrinsics::_floatToIntBits: {
4363 // two paths (plus control) merge in a wood
4364 RegionNode *r = new (C) RegionNode(3);
4365 Node *phi = new (C) PhiNode(r, TypeInt::INT);
4366
4367 Node *cmpisnan = _gvn.transform(new (C) CmpFNode(arg, arg));
4368 // Build the boolean node
4369 Node *bolisnan = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::ne));
4370
4371 // Branch either way.
4372 // NaN case is less traveled, which makes all the difference.
4373 IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
4374 Node *opt_isnan = _gvn.transform(ifisnan);
4375 assert( opt_isnan->is_If(), "Expect an IfNode");
4376 IfNode *opt_ifisnan = (IfNode*)opt_isnan;
4377 Node *iftrue = _gvn.transform(new (C) IfTrueNode(opt_ifisnan));
4378
4379 set_control(iftrue);
4380
4381 static const jint nan_bits = 0x7fc00000;
4382 Node *slow_result = makecon(TypeInt::make(nan_bits)); // return NaN
4383 phi->init_req(1, _gvn.transform( slow_result ));
4384 r->init_req(1, iftrue);
4385
4386 // Else fall through
4387 Node *iffalse = _gvn.transform(new (C) IfFalseNode(opt_ifisnan));
4388 set_control(iffalse);
4389
4390 phi->init_req(2, _gvn.transform(new (C) MoveF2INode(arg)));
4391 r->init_req(2, iffalse);
4392
4393 // Post merge
4394 set_control(_gvn.transform(r));
4395 record_for_igvn(r);
4396
4397 C->set_has_split_ifs(true); // Has chance for split-if optimization
4398 result = phi;
4399 assert(result->bottom_type()->isa_int(), "must be");
4400 break;
4401 }
4402
4403 default:
4404 fatal_unexpected_iid(id);
4405 break;
4406 }
4407 set_result(_gvn.transform(result));
4408 return true;
4409 }
4410
4411 #ifdef _LP64
4412 #define XTOP ,top() /*additional argument*/
4413 #else //_LP64
4414 #define XTOP /*no additional argument*/
4415 #endif //_LP64
4416
4417 //----------------------inline_unsafe_copyMemory-------------------------
4418 // public native void sun.misc.Unsafe.copyMemory(Object srcBase, long srcOffset, Object destBase, long destOffset, long bytes);
4419 bool LibraryCallKit::inline_unsafe_copyMemory() {
4420 if (callee()->is_static()) return false; // caller must have the capability!
4421 null_check_receiver(); // null-check receiver
4422 if (stopped()) return true;
4423
4424 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe".
4425
4426 Node* src_ptr = argument(1); // type: oop
4427 Node* src_off = ConvL2X(argument(2)); // type: long
4428 Node* dst_ptr = argument(4); // type: oop
4429 Node* dst_off = ConvL2X(argument(5)); // type: long
4430 Node* size = ConvL2X(argument(7)); // type: long
4431
4432 assert(Unsafe_field_offset_to_byte_offset(11) == 11,
4433 "fieldOffset must be byte-scaled");
4434
4435 Node* src = make_unsafe_address(src_ptr, src_off);
4436 Node* dst = make_unsafe_address(dst_ptr, dst_off);
4437
4438 // Conservatively insert a memory barrier on all memory slices.
4439 // Do not let writes of the copy source or destination float below the copy.
4440 insert_mem_bar(Op_MemBarCPUOrder);
4441
4442 // Call it. Note that the length argument is not scaled.
4443 make_runtime_call(RC_LEAF|RC_NO_FP,
4444 OptoRuntime::fast_arraycopy_Type(),
4445 StubRoutines::unsafe_arraycopy(),
4446 "unsafe_arraycopy",
4447 TypeRawPtr::BOTTOM,
4448 src, dst, size XTOP);
4449
4450 // Do not let reads of the copy destination float above the copy.
4451 insert_mem_bar(Op_MemBarCPUOrder);
4452
4453 return true;
4454 }
4455
4456 //------------------------clone_coping-----------------------------------
4457 // Helper function for inline_native_clone.
4458 void LibraryCallKit::copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array, bool card_mark) {
4459 assert(obj_size != NULL, "");
4460 Node* raw_obj = alloc_obj->in(1);
4461 assert(alloc_obj->is_CheckCastPP() && raw_obj->is_Proj() && raw_obj->in(0)->is_Allocate(), "");
4462
4463 AllocateNode* alloc = NULL;
4464 if (ReduceBulkZeroing) {
4465 // We will be completely responsible for initializing this object -
4466 // mark Initialize node as complete.
4467 alloc = AllocateNode::Ideal_allocation(alloc_obj, &_gvn);
4468 // The object was just allocated - there should be no any stores!
4469 guarantee(alloc != NULL && alloc->maybe_set_complete(&_gvn), "");
4470 // Mark as complete_with_arraycopy so that on AllocateNode
4471 // expansion, we know this AllocateNode is initialized by an array
4472 // copy and a StoreStore barrier exists after the array copy.
4473 alloc->initialization()->set_complete_with_arraycopy();
4474 }
4475
4476 // Copy the fastest available way.
4477 // TODO: generate fields copies for small objects instead.
4478 Node* src = obj;
4479 Node* dest = alloc_obj;
4480 Node* size = _gvn.transform(obj_size);
4481
4482 // Exclude the header but include array length to copy by 8 bytes words.
4483 // Can't use base_offset_in_bytes(bt) since basic type is unknown.
4484 int base_off = is_array ? arrayOopDesc::length_offset_in_bytes() :
4485 instanceOopDesc::base_offset_in_bytes();
4486 // base_off:
4487 // 8 - 32-bit VM
4488 // 12 - 64-bit VM, compressed klass
4489 // 16 - 64-bit VM, normal klass
4490 if (base_off % BytesPerLong != 0) {
4491 assert(UseCompressedClassPointers, "");
4492 if (is_array) {
4493 // Exclude length to copy by 8 bytes words.
4494 base_off += sizeof(int);
4495 } else {
4496 // Include klass to copy by 8 bytes words.
4497 base_off = instanceOopDesc::klass_offset_in_bytes();
4498 }
4499 assert(base_off % BytesPerLong == 0, "expect 8 bytes alignment");
4500 }
4501 src = basic_plus_adr(src, base_off);
4502 dest = basic_plus_adr(dest, base_off);
4503
4504 // Compute the length also, if needed:
4505 Node* countx = size;
4506 countx = _gvn.transform(new (C) SubXNode(countx, MakeConX(base_off)));
4507 countx = _gvn.transform(new (C) URShiftXNode(countx, intcon(LogBytesPerLong) ));
4508
4509 const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
4510 bool disjoint_bases = true;
4511 generate_unchecked_arraycopy(raw_adr_type, T_LONG, disjoint_bases,
4512 src, NULL, dest, NULL, countx,
4513 /*dest_uninitialized*/true);
4514
4515 // If necessary, emit some card marks afterwards. (Non-arrays only.)
4516 if (card_mark) {
4517 assert(!is_array, "");
4518 // Put in store barrier for any and all oops we are sticking
4519 // into this object. (We could avoid this if we could prove
4520 // that the object type contains no oop fields at all.)
4521 Node* no_particular_value = NULL;
4522 Node* no_particular_field = NULL;
4523 int raw_adr_idx = Compile::AliasIdxRaw;
4524 post_barrier(control(),
4525 memory(raw_adr_type),
4526 alloc_obj,
4527 no_particular_field,
4528 raw_adr_idx,
4529 no_particular_value,
4530 T_OBJECT,
4531 false);
4532 }
4533
4534 // Do not let reads from the cloned object float above the arraycopy.
4535 if (alloc != NULL) {
4536 // Do not let stores that initialize this object be reordered with
4537 // a subsequent store that would make this object accessible by
4538 // other threads.
4539 // Record what AllocateNode this StoreStore protects so that
4540 // escape analysis can go from the MemBarStoreStoreNode to the
4541 // AllocateNode and eliminate the MemBarStoreStoreNode if possible
4542 // based on the escape status of the AllocateNode.
4543 insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out(AllocateNode::RawAddress));
4544 } else {
4545 insert_mem_bar(Op_MemBarCPUOrder);
4546 }
4547 }
4548
4549 //------------------------inline_native_clone----------------------------
4550 // protected native Object java.lang.Object.clone();
4551 //
4552 // Here are the simple edge cases:
4553 // null receiver => normal trap
4554 // virtual and clone was overridden => slow path to out-of-line clone
4555 // not cloneable or finalizer => slow path to out-of-line Object.clone
4556 //
4557 // The general case has two steps, allocation and copying.
4558 // Allocation has two cases, and uses GraphKit::new_instance or new_array.
4559 //
4560 // Copying also has two cases, oop arrays and everything else.
4561 // Oop arrays use arrayof_oop_arraycopy (same as System.arraycopy).
4562 // Everything else uses the tight inline loop supplied by CopyArrayNode.
4563 //
4564 // These steps fold up nicely if and when the cloned object's klass
4565 // can be sharply typed as an object array, a type array, or an instance.
4566 //
4567 bool LibraryCallKit::inline_native_clone(bool is_virtual) {
4568 PhiNode* result_val;
4569
4570 // Set the reexecute bit for the interpreter to reexecute
4571 // the bytecode that invokes Object.clone if deoptimization happens.
4572 { PreserveReexecuteState preexecs(this);
4573 jvms()->set_should_reexecute(true);
4574
4575 Node* obj = null_check_receiver();
4576 if (stopped()) return true;
4577
4578 Node* obj_klass = load_object_klass(obj);
4579 const TypeKlassPtr* tklass = _gvn.type(obj_klass)->isa_klassptr();
4580 const TypeOopPtr* toop = ((tklass != NULL)
4581 ? tklass->as_instance_type()
4582 : TypeInstPtr::NOTNULL);
4583
4584 // Conservatively insert a memory barrier on all memory slices.
4585 // Do not let writes into the original float below the clone.
4586 insert_mem_bar(Op_MemBarCPUOrder);
4587
4588 // paths into result_reg:
4589 enum {
4590 _slow_path = 1, // out-of-line call to clone method (virtual or not)
4591 _objArray_path, // plain array allocation, plus arrayof_oop_arraycopy
4592 _array_path, // plain array allocation, plus arrayof_long_arraycopy
4593 _instance_path, // plain instance allocation, plus arrayof_long_arraycopy
4594 PATH_LIMIT
4595 };
4596 RegionNode* result_reg = new(C) RegionNode(PATH_LIMIT);
4597 result_val = new(C) PhiNode(result_reg,
4598 TypeInstPtr::NOTNULL);
4599 PhiNode* result_i_o = new(C) PhiNode(result_reg, Type::ABIO);
4600 PhiNode* result_mem = new(C) PhiNode(result_reg, Type::MEMORY,
4601 TypePtr::BOTTOM);
4602 record_for_igvn(result_reg);
4603
4604 const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
4605 int raw_adr_idx = Compile::AliasIdxRaw;
4606
4607 Node* array_ctl = generate_array_guard(obj_klass, (RegionNode*)NULL);
4608 if (array_ctl != NULL) {
4609 // It's an array.
4610 PreserveJVMState pjvms(this);
4611 set_control(array_ctl);
4612 Node* obj_length = load_array_length(obj);
4613 Node* obj_size = NULL;
4614 Node* alloc_obj = new_array(obj_klass, obj_length, 0, &obj_size); // no arguments to push
4615
4616 if (!use_ReduceInitialCardMarks()) {
4617 // If it is an oop array, it requires very special treatment,
4618 // because card marking is required on each card of the array.
4619 Node* is_obja = generate_objArray_guard(obj_klass, (RegionNode*)NULL);
4620 if (is_obja != NULL) {
4621 PreserveJVMState pjvms2(this);
4622 set_control(is_obja);
4623 // Generate a direct call to the right arraycopy function(s).
4624 bool disjoint_bases = true;
4625 bool length_never_negative = true;
4626 generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT,
4627 obj, intcon(0), alloc_obj, intcon(0),
4628 obj_length,
4629 disjoint_bases, length_never_negative);
4630 result_reg->init_req(_objArray_path, control());
4631 result_val->init_req(_objArray_path, alloc_obj);
4632 result_i_o ->set_req(_objArray_path, i_o());
4633 result_mem ->set_req(_objArray_path, reset_memory());
4634 }
4635 }
4636 // Otherwise, there are no card marks to worry about.
4637 // (We can dispense with card marks if we know the allocation
4638 // comes out of eden (TLAB)... In fact, ReduceInitialCardMarks
4639 // causes the non-eden paths to take compensating steps to
4640 // simulate a fresh allocation, so that no further
4641 // card marks are required in compiled code to initialize
4642 // the object.)
4643
4644 if (!stopped()) {
4645 copy_to_clone(obj, alloc_obj, obj_size, true, false);
4646
4647 // Present the results of the copy.
4648 result_reg->init_req(_array_path, control());
4649 result_val->init_req(_array_path, alloc_obj);
4650 result_i_o ->set_req(_array_path, i_o());
4651 result_mem ->set_req(_array_path, reset_memory());
4652 }
4653 }
4654
4655 // We only go to the instance fast case code if we pass a number of guards.
4656 // The paths which do not pass are accumulated in the slow_region.
4657 RegionNode* slow_region = new (C) RegionNode(1);
4658 record_for_igvn(slow_region);
4659 if (!stopped()) {
4660 // It's an instance (we did array above). Make the slow-path tests.
4661 // If this is a virtual call, we generate a funny guard. We grab
4662 // the vtable entry corresponding to clone() from the target object.
4663 // If the target method which we are calling happens to be the
4664 // Object clone() method, we pass the guard. We do not need this
4665 // guard for non-virtual calls; the caller is known to be the native
4666 // Object clone().
4667 if (is_virtual) {
4668 generate_virtual_guard(obj_klass, slow_region);
4669 }
4670
4671 // The object must be cloneable and must not have a finalizer.
4672 // Both of these conditions may be checked in a single test.
4673 // We could optimize the cloneable test further, but we don't care.
4674 generate_access_flags_guard(obj_klass,
4675 // Test both conditions:
4676 JVM_ACC_IS_CLONEABLE | JVM_ACC_HAS_FINALIZER,
4677 // Must be cloneable but not finalizer:
4678 JVM_ACC_IS_CLONEABLE,
4679 slow_region);
4680 }
4681
4682 if (!stopped()) {
4683 // It's an instance, and it passed the slow-path tests.
4684 PreserveJVMState pjvms(this);
4685 Node* obj_size = NULL;
4686 // Need to deoptimize on exception from allocation since Object.clone intrinsic
4687 // is reexecuted if deoptimization occurs and there could be problems when merging
4688 // exception state between multiple Object.clone versions (reexecute=true vs reexecute=false).
4689 Node* alloc_obj = new_instance(obj_klass, NULL, &obj_size, /*deoptimize_on_exception=*/true);
4690
4691 copy_to_clone(obj, alloc_obj, obj_size, false, !use_ReduceInitialCardMarks());
4692
4693 // Present the results of the slow call.
4694 result_reg->init_req(_instance_path, control());
4695 result_val->init_req(_instance_path, alloc_obj);
4696 result_i_o ->set_req(_instance_path, i_o());
4697 result_mem ->set_req(_instance_path, reset_memory());
4698 }
4699
4700 // Generate code for the slow case. We make a call to clone().
4701 set_control(_gvn.transform(slow_region));
4702 if (!stopped()) {
4703 PreserveJVMState pjvms(this);
4704 CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_clone, is_virtual);
4705 Node* slow_result = set_results_for_java_call(slow_call);
4706 // this->control() comes from set_results_for_java_call
4707 result_reg->init_req(_slow_path, control());
4708 result_val->init_req(_slow_path, slow_result);
4709 result_i_o ->set_req(_slow_path, i_o());
4710 result_mem ->set_req(_slow_path, reset_memory());
4711 }
4712
4713 // Return the combined state.
4714 set_control( _gvn.transform(result_reg));
4715 set_i_o( _gvn.transform(result_i_o));
4716 set_all_memory( _gvn.transform(result_mem));
4717 } // original reexecute is set back here
4718
4719 set_result(_gvn.transform(result_val));
4720 return true;
4721 }
4722
4723 //------------------------------basictype2arraycopy----------------------------
4724 address LibraryCallKit::basictype2arraycopy(BasicType t,
4725 Node* src_offset,
4726 Node* dest_offset,
4727 bool disjoint_bases,
4728 const char* &name,
4729 bool dest_uninitialized) {
4730 const TypeInt* src_offset_inttype = gvn().find_int_type(src_offset);;
4731 const TypeInt* dest_offset_inttype = gvn().find_int_type(dest_offset);;
4732
4733 bool aligned = false;
4734 bool disjoint = disjoint_bases;
4735
4736 // if the offsets are the same, we can treat the memory regions as
4737 // disjoint, because either the memory regions are in different arrays,
4738 // or they are identical (which we can treat as disjoint.) We can also
4739 // treat a copy with a destination index less that the source index
4740 // as disjoint since a low->high copy will work correctly in this case.
4741 if (src_offset_inttype != NULL && src_offset_inttype->is_con() &&
4742 dest_offset_inttype != NULL && dest_offset_inttype->is_con()) {
4743 // both indices are constants
4744 int s_offs = src_offset_inttype->get_con();
4745 int d_offs = dest_offset_inttype->get_con();
4746 int element_size = type2aelembytes(t);
4747 aligned = ((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) &&
4748 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0);
4749 if (s_offs >= d_offs) disjoint = true;
4750 } else if (src_offset == dest_offset && src_offset != NULL) {
4751 // This can occur if the offsets are identical non-constants.
4752 disjoint = true;
4753 }
4754
4755 return StubRoutines::select_arraycopy_function(t, aligned, disjoint, name, dest_uninitialized);
4756 }
4757
4758
4759 //------------------------------inline_arraycopy-----------------------
4760 // public static native void java.lang.System.arraycopy(Object src, int srcPos,
4761 // Object dest, int destPos,
4762 // int length);
4763 bool LibraryCallKit::inline_arraycopy() {
4764 // Get the arguments.
4765 Node* src = argument(0); // type: oop
4766 Node* src_offset = argument(1); // type: int
4767 Node* dest = argument(2); // type: oop
4768 Node* dest_offset = argument(3); // type: int
4769 Node* length = argument(4); // type: int
4770
4771 // Compile time checks. If any of these checks cannot be verified at compile time,
4772 // we do not make a fast path for this call. Instead, we let the call remain as it
4773 // is. The checks we choose to mandate at compile time are:
4774 //
4775 // (1) src and dest are arrays.
4776 const Type* src_type = src->Value(&_gvn);
4777 const Type* dest_type = dest->Value(&_gvn);
4778 const TypeAryPtr* top_src = src_type->isa_aryptr();
4779 const TypeAryPtr* top_dest = dest_type->isa_aryptr();
4780
4781 // Do we have the type of src?
4782 bool has_src = (top_src != NULL && top_src->klass() != NULL);
4783 // Do we have the type of dest?
4784 bool has_dest = (top_dest != NULL && top_dest->klass() != NULL);
4785 // Is the type for src from speculation?
4786 bool src_spec = false;
4787 // Is the type for dest from speculation?
4788 bool dest_spec = false;
4789
4790 if (!has_src || !has_dest) {
4791 // We don't have sufficient type information, let's see if
4792 // speculative types can help. We need to have types for both src
4793 // and dest so that it pays off.
4794
4795 // Do we already have or could we have type information for src
4796 bool could_have_src = has_src;
4797 // Do we already have or could we have type information for dest
4798 bool could_have_dest = has_dest;
4799
4800 ciKlass* src_k = NULL;
4801 if (!has_src) {
4802 src_k = src_type->speculative_type();
4803 if (src_k != NULL && src_k->is_array_klass()) {
4804 could_have_src = true;
4805 }
4806 }
4807
4808 ciKlass* dest_k = NULL;
4809 if (!has_dest) {
4810 dest_k = dest_type->speculative_type();
4811 if (dest_k != NULL && dest_k->is_array_klass()) {
4812 could_have_dest = true;
4813 }
4814 }
4815
4816 if (could_have_src && could_have_dest) {
4817 // This is going to pay off so emit the required guards
4818 if (!has_src) {
4819 src = maybe_cast_profiled_obj(src, src_k);
4820 src_type = _gvn.type(src);
4821 top_src = src_type->isa_aryptr();
4822 has_src = (top_src != NULL && top_src->klass() != NULL);
4823 src_spec = true;
4824 }
4825 if (!has_dest) {
4826 dest = maybe_cast_profiled_obj(dest, dest_k);
4827 dest_type = _gvn.type(dest);
4828 top_dest = dest_type->isa_aryptr();
4829 has_dest = (top_dest != NULL && top_dest->klass() != NULL);
4830 dest_spec = true;
4831 }
4832 }
4833 }
4834
4835 if (!has_src || !has_dest) {
4836 // Conservatively insert a memory barrier on all memory slices.
4837 // Do not let writes into the source float below the arraycopy.
4838 insert_mem_bar(Op_MemBarCPUOrder);
4839
4840 // Call StubRoutines::generic_arraycopy stub.
4841 generate_arraycopy(TypeRawPtr::BOTTOM, T_CONFLICT,
4842 src, src_offset, dest, dest_offset, length);
4843
4844 // Do not let reads from the destination float above the arraycopy.
4845 // Since we cannot type the arrays, we don't know which slices
4846 // might be affected. We could restrict this barrier only to those
4847 // memory slices which pertain to array elements--but don't bother.
4848 if (!InsertMemBarAfterArraycopy)
4849 // (If InsertMemBarAfterArraycopy, there is already one in place.)
4850 insert_mem_bar(Op_MemBarCPUOrder);
4851 return true;
4852 }
4853
4854 // (2) src and dest arrays must have elements of the same BasicType
4855 // Figure out the size and type of the elements we will be copying.
4856 BasicType src_elem = top_src->klass()->as_array_klass()->element_type()->basic_type();
4857 BasicType dest_elem = top_dest->klass()->as_array_klass()->element_type()->basic_type();
4858 if (src_elem == T_ARRAY) src_elem = T_OBJECT;
4859 if (dest_elem == T_ARRAY) dest_elem = T_OBJECT;
4860
4861 if (src_elem != dest_elem || dest_elem == T_VOID) {
4862 // The component types are not the same or are not recognized. Punt.
4863 // (But, avoid the native method wrapper to JVM_ArrayCopy.)
4864 generate_slow_arraycopy(TypePtr::BOTTOM,
4865 src, src_offset, dest, dest_offset, length,
4866 /*dest_uninitialized*/false);
4867 return true;
4868 }
4869
4870 if (src_elem == T_OBJECT) {
4871 // If both arrays are object arrays then having the exact types
4872 // for both will remove the need for a subtype check at runtime
4873 // before the call and may make it possible to pick a faster copy
4874 // routine (without a subtype check on every element)
4875 // Do we have the exact type of src?
4876 bool could_have_src = src_spec;
4877 // Do we have the exact type of dest?
4878 bool could_have_dest = dest_spec;
4879 ciKlass* src_k = top_src->klass();
4880 ciKlass* dest_k = top_dest->klass();
4881 if (!src_spec) {
4882 src_k = src_type->speculative_type();
4883 if (src_k != NULL && src_k->is_array_klass()) {
4884 could_have_src = true;
4885 }
4886 }
4887 if (!dest_spec) {
4888 dest_k = dest_type->speculative_type();
4889 if (dest_k != NULL && dest_k->is_array_klass()) {
4890 could_have_dest = true;
4891 }
4892 }
4893 if (could_have_src && could_have_dest) {
4894 // If we can have both exact types, emit the missing guards
4895 if (could_have_src && !src_spec) {
4896 src = maybe_cast_profiled_obj(src, src_k);
4897 }
4898 if (could_have_dest && !dest_spec) {
4899 dest = maybe_cast_profiled_obj(dest, dest_k);
4900 }
4901 }
4902 }
4903
4904 //---------------------------------------------------------------------------
4905 // We will make a fast path for this call to arraycopy.
4906
4907 // We have the following tests left to perform:
4908 //
4909 // (3) src and dest must not be null.
4910 // (4) src_offset must not be negative.
4911 // (5) dest_offset must not be negative.
4912 // (6) length must not be negative.
4913 // (7) src_offset + length must not exceed length of src.
4914 // (8) dest_offset + length must not exceed length of dest.
4915 // (9) each element of an oop array must be assignable
4916
4917 RegionNode* slow_region = new (C) RegionNode(1);
4918 record_for_igvn(slow_region);
4919
4920 // (3) operands must not be null
4921 // We currently perform our null checks with the null_check routine.
4922 // This means that the null exceptions will be reported in the caller
4923 // rather than (correctly) reported inside of the native arraycopy call.
4924 // This should be corrected, given time. We do our null check with the
4925 // stack pointer restored.
4926 src = null_check(src, T_ARRAY);
4927 dest = null_check(dest, T_ARRAY);
4928
4929 // (4) src_offset must not be negative.
4930 generate_negative_guard(src_offset, slow_region);
4931
4932 // (5) dest_offset must not be negative.
4933 generate_negative_guard(dest_offset, slow_region);
4934
4935 // (6) length must not be negative (moved to generate_arraycopy()).
4936 // generate_negative_guard(length, slow_region);
4937
4938 // (7) src_offset + length must not exceed length of src.
4939 generate_limit_guard(src_offset, length,
4940 load_array_length(src),
4941 slow_region);
4942
4943 // (8) dest_offset + length must not exceed length of dest.
4944 generate_limit_guard(dest_offset, length,
4945 load_array_length(dest),
4946 slow_region);
4947
4948 // (9) each element of an oop array must be assignable
4949 // The generate_arraycopy subroutine checks this.
4950
4951 // This is where the memory effects are placed:
4952 const TypePtr* adr_type = TypeAryPtr::get_array_body_type(dest_elem);
4953 generate_arraycopy(adr_type, dest_elem,
4954 src, src_offset, dest, dest_offset, length,
4955 false, false, slow_region);
4956
4957 return true;
4958 }
4959
4960 //-----------------------------generate_arraycopy----------------------
4961 // Generate an optimized call to arraycopy.
4962 // Caller must guard against non-arrays.
4963 // Caller must determine a common array basic-type for both arrays.
4964 // Caller must validate offsets against array bounds.
4965 // The slow_region has already collected guard failure paths
4966 // (such as out of bounds length or non-conformable array types).
4967 // The generated code has this shape, in general:
4968 //
4969 // if (length == 0) return // via zero_path
4970 // slowval = -1
4971 // if (types unknown) {
4972 // slowval = call generic copy loop
4973 // if (slowval == 0) return // via checked_path
4974 // } else if (indexes in bounds) {
4975 // if ((is object array) && !(array type check)) {
4976 // slowval = call checked copy loop
4977 // if (slowval == 0) return // via checked_path
4978 // } else {
4979 // call bulk copy loop
4980 // return // via fast_path
4981 // }
4982 // }
4983 // // adjust params for remaining work:
4984 // if (slowval != -1) {
4985 // n = -1^slowval; src_offset += n; dest_offset += n; length -= n
4986 // }
4987 // slow_region:
4988 // call slow arraycopy(src, src_offset, dest, dest_offset, length)
4989 // return // via slow_call_path
4990 //
4991 // This routine is used from several intrinsics: System.arraycopy,
4992 // Object.clone (the array subcase), and Arrays.copyOf[Range].
4993 //
4994 void
4995 LibraryCallKit::generate_arraycopy(const TypePtr* adr_type,
4996 BasicType basic_elem_type,
4997 Node* src, Node* src_offset,
4998 Node* dest, Node* dest_offset,
4999 Node* copy_length,
5000 bool disjoint_bases,
5001 bool length_never_negative,
5002 RegionNode* slow_region) {
5003
5004 if (slow_region == NULL) {
5005 slow_region = new(C) RegionNode(1);
5006 record_for_igvn(slow_region);
5007 }
5008
5009 Node* original_dest = dest;
5010 AllocateArrayNode* alloc = NULL; // used for zeroing, if needed
5011 bool dest_uninitialized = false;
5012
5013 // See if this is the initialization of a newly-allocated array.
5014 // If so, we will take responsibility here for initializing it to zero.
5015 // (Note: Because tightly_coupled_allocation performs checks on the
5016 // out-edges of the dest, we need to avoid making derived pointers
5017 // from it until we have checked its uses.)
5018 if (ReduceBulkZeroing
5019 && !ZeroTLAB // pointless if already zeroed
5020 && basic_elem_type != T_CONFLICT // avoid corner case
5021 && !src->eqv_uncast(dest)
5022 && ((alloc = tightly_coupled_allocation(dest, slow_region))
5023 != NULL)
5024 && _gvn.find_int_con(alloc->in(AllocateNode::ALength), 1) > 0
5025 && alloc->maybe_set_complete(&_gvn)) {
5026 // "You break it, you buy it."
5027 InitializeNode* init = alloc->initialization();
5028 assert(init->is_complete(), "we just did this");
5029 init->set_complete_with_arraycopy();
5030 assert(dest->is_CheckCastPP(), "sanity");
5031 assert(dest->in(0)->in(0) == init, "dest pinned");
5032 adr_type = TypeRawPtr::BOTTOM; // all initializations are into raw memory
5033 // From this point on, every exit path is responsible for
5034 // initializing any non-copied parts of the object to zero.
5035 // Also, if this flag is set we make sure that arraycopy interacts properly
5036 // with G1, eliding pre-barriers. See CR 6627983.
5037 dest_uninitialized = true;
5038 } else {
5039 // No zeroing elimination here.
5040 alloc = NULL;
5041 //original_dest = dest;
5042 //dest_uninitialized = false;
5043 }
5044
5045 // Results are placed here:
5046 enum { fast_path = 1, // normal void-returning assembly stub
5047 checked_path = 2, // special assembly stub with cleanup
5048 slow_call_path = 3, // something went wrong; call the VM
5049 zero_path = 4, // bypass when length of copy is zero
5050 bcopy_path = 5, // copy primitive array by 64-bit blocks
5051 PATH_LIMIT = 6
5052 };
5053 RegionNode* result_region = new(C) RegionNode(PATH_LIMIT);
5054 PhiNode* result_i_o = new(C) PhiNode(result_region, Type::ABIO);
5055 PhiNode* result_memory = new(C) PhiNode(result_region, Type::MEMORY, adr_type);
5056 record_for_igvn(result_region);
5057 _gvn.set_type_bottom(result_i_o);
5058 _gvn.set_type_bottom(result_memory);
5059 assert(adr_type != TypePtr::BOTTOM, "must be RawMem or a T[] slice");
5060
5061 // The slow_control path:
5062 Node* slow_control;
5063 Node* slow_i_o = i_o();
5064 Node* slow_mem = memory(adr_type);
5065 debug_only(slow_control = (Node*) badAddress);
5066
5067 // Checked control path:
5068 Node* checked_control = top();
5069 Node* checked_mem = NULL;
5070 Node* checked_i_o = NULL;
5071 Node* checked_value = NULL;
5072
5073 if (basic_elem_type == T_CONFLICT) {
5074 assert(!dest_uninitialized, "");
5075 Node* cv = generate_generic_arraycopy(adr_type,
5076 src, src_offset, dest, dest_offset,
5077 copy_length, dest_uninitialized);
5078 if (cv == NULL) cv = intcon(-1); // failure (no stub available)
5079 checked_control = control();
5080 checked_i_o = i_o();
5081 checked_mem = memory(adr_type);
5082 checked_value = cv;
5083 set_control(top()); // no fast path
5084 }
5085
5086 Node* not_pos = generate_nonpositive_guard(copy_length, length_never_negative);
5087 if (not_pos != NULL) {
5088 PreserveJVMState pjvms(this);
5089 set_control(not_pos);
5090
5091 // (6) length must not be negative.
5092 if (!length_never_negative) {
5093 generate_negative_guard(copy_length, slow_region);
5094 }
5095
5096 // copy_length is 0.
5097 if (!stopped() && dest_uninitialized) {
5098 Node* dest_length = alloc->in(AllocateNode::ALength);
5099 if (copy_length->eqv_uncast(dest_length)
5100 || _gvn.find_int_con(dest_length, 1) <= 0) {
5101 // There is no zeroing to do. No need for a secondary raw memory barrier.
5102 } else {
5103 // Clear the whole thing since there are no source elements to copy.
5104 generate_clear_array(adr_type, dest, basic_elem_type,
5105 intcon(0), NULL,
5106 alloc->in(AllocateNode::AllocSize));
5107 // Use a secondary InitializeNode as raw memory barrier.
5108 // Currently it is needed only on this path since other
5109 // paths have stub or runtime calls as raw memory barriers.
5110 InitializeNode* init = insert_mem_bar_volatile(Op_Initialize,
5111 Compile::AliasIdxRaw,
5112 top())->as_Initialize();
5113 init->set_complete(&_gvn); // (there is no corresponding AllocateNode)
5114 }
5115 }
5116
5117 // Present the results of the fast call.
5118 result_region->init_req(zero_path, control());
5119 result_i_o ->init_req(zero_path, i_o());
5120 result_memory->init_req(zero_path, memory(adr_type));
5121 }
5122
5123 if (!stopped() && dest_uninitialized) {
5124 // We have to initialize the *uncopied* part of the array to zero.
5125 // The copy destination is the slice dest[off..off+len]. The other slices
5126 // are dest_head = dest[0..off] and dest_tail = dest[off+len..dest.length].
5127 Node* dest_size = alloc->in(AllocateNode::AllocSize);
5128 Node* dest_length = alloc->in(AllocateNode::ALength);
5129 Node* dest_tail = _gvn.transform(new(C) AddINode(dest_offset,
5130 copy_length));
5131
5132 // If there is a head section that needs zeroing, do it now.
5133 if (find_int_con(dest_offset, -1) != 0) {
5134 generate_clear_array(adr_type, dest, basic_elem_type,
5135 intcon(0), dest_offset,
5136 NULL);
5137 }
5138
5139 // Next, perform a dynamic check on the tail length.
5140 // It is often zero, and we can win big if we prove this.
5141 // There are two wins: Avoid generating the ClearArray
5142 // with its attendant messy index arithmetic, and upgrade
5143 // the copy to a more hardware-friendly word size of 64 bits.
5144 Node* tail_ctl = NULL;
5145 if (!stopped() && !dest_tail->eqv_uncast(dest_length)) {
5146 Node* cmp_lt = _gvn.transform(new(C) CmpINode(dest_tail, dest_length));
5147 Node* bol_lt = _gvn.transform(new(C) BoolNode(cmp_lt, BoolTest::lt));
5148 tail_ctl = generate_slow_guard(bol_lt, NULL);
5149 assert(tail_ctl != NULL || !stopped(), "must be an outcome");
5150 }
5151
5152 // At this point, let's assume there is no tail.
5153 if (!stopped() && alloc != NULL && basic_elem_type != T_OBJECT) {
5154 // There is no tail. Try an upgrade to a 64-bit copy.
5155 bool didit = false;
5156 { PreserveJVMState pjvms(this);
5157 didit = generate_block_arraycopy(adr_type, basic_elem_type, alloc,
5158 src, src_offset, dest, dest_offset,
5159 dest_size, dest_uninitialized);
5160 if (didit) {
5161 // Present the results of the block-copying fast call.
5162 result_region->init_req(bcopy_path, control());
5163 result_i_o ->init_req(bcopy_path, i_o());
5164 result_memory->init_req(bcopy_path, memory(adr_type));
5165 }
5166 }
5167 if (didit)
5168 set_control(top()); // no regular fast path
5169 }
5170
5171 // Clear the tail, if any.
5172 if (tail_ctl != NULL) {
5173 Node* notail_ctl = stopped() ? NULL : control();
5174 set_control(tail_ctl);
5175 if (notail_ctl == NULL) {
5176 generate_clear_array(adr_type, dest, basic_elem_type,
5177 dest_tail, NULL,
5178 dest_size);
5179 } else {
5180 // Make a local merge.
5181 Node* done_ctl = new(C) RegionNode(3);
5182 Node* done_mem = new(C) PhiNode(done_ctl, Type::MEMORY, adr_type);
5183 done_ctl->init_req(1, notail_ctl);
5184 done_mem->init_req(1, memory(adr_type));
5185 generate_clear_array(adr_type, dest, basic_elem_type,
5186 dest_tail, NULL,
5187 dest_size);
5188 done_ctl->init_req(2, control());
5189 done_mem->init_req(2, memory(adr_type));
5190 set_control( _gvn.transform(done_ctl));
5191 set_memory( _gvn.transform(done_mem), adr_type );
5192 }
5193 }
5194 }
5195
5196 BasicType copy_type = basic_elem_type;
5197 assert(basic_elem_type != T_ARRAY, "caller must fix this");
5198 if (!stopped() && copy_type == T_OBJECT) {
5199 // If src and dest have compatible element types, we can copy bits.
5200 // Types S[] and D[] are compatible if D is a supertype of S.
5201 //
5202 // If they are not, we will use checked_oop_disjoint_arraycopy,
5203 // which performs a fast optimistic per-oop check, and backs off
5204 // further to JVM_ArrayCopy on the first per-oop check that fails.
5205 // (Actually, we don't move raw bits only; the GC requires card marks.)
5206
5207 // Get the Klass* for both src and dest
5208 Node* src_klass = load_object_klass(src);
5209 Node* dest_klass = load_object_klass(dest);
5210
5211 // Generate the subtype check.
5212 // This might fold up statically, or then again it might not.
5213 //
5214 // Non-static example: Copying List<String>.elements to a new String[].
5215 // The backing store for a List<String> is always an Object[],
5216 // but its elements are always type String, if the generic types
5217 // are correct at the source level.
5218 //
5219 // Test S[] against D[], not S against D, because (probably)
5220 // the secondary supertype cache is less busy for S[] than S.
5221 // This usually only matters when D is an interface.
5222 Node* not_subtype_ctrl = gen_subtype_check(src_klass, dest_klass);
5223 // Plug failing path into checked_oop_disjoint_arraycopy
5224 if (not_subtype_ctrl != top()) {
5225 PreserveJVMState pjvms(this);
5226 set_control(not_subtype_ctrl);
5227 // (At this point we can assume disjoint_bases, since types differ.)
5228 int ek_offset = in_bytes(ObjArrayKlass::element_klass_offset());
5229 Node* p1 = basic_plus_adr(dest_klass, ek_offset);
5230 Node* n1 = LoadKlassNode::make(_gvn, NULL, immutable_memory(), p1, TypeRawPtr::BOTTOM);
5231 Node* dest_elem_klass = _gvn.transform(n1);
5232 Node* cv = generate_checkcast_arraycopy(adr_type,
5233 dest_elem_klass,
5234 src, src_offset, dest, dest_offset,
5235 ConvI2X(copy_length), dest_uninitialized);
5236 if (cv == NULL) cv = intcon(-1); // failure (no stub available)
5237 checked_control = control();
5238 checked_i_o = i_o();
5239 checked_mem = memory(adr_type);
5240 checked_value = cv;
5241 }
5242 // At this point we know we do not need type checks on oop stores.
5243
5244 // Let's see if we need card marks:
5245 if (alloc != NULL && use_ReduceInitialCardMarks()) {
5246 // If we do not need card marks, copy using the jint or jlong stub.
5247 copy_type = LP64_ONLY(UseCompressedOops ? T_INT : T_LONG) NOT_LP64(T_INT);
5248 assert(type2aelembytes(basic_elem_type) == type2aelembytes(copy_type),
5249 "sizes agree");
5250 }
5251 }
5252
5253 if (!stopped()) {
5254 // Generate the fast path, if possible.
5255 PreserveJVMState pjvms(this);
5256 generate_unchecked_arraycopy(adr_type, copy_type, disjoint_bases,
5257 src, src_offset, dest, dest_offset,
5258 ConvI2X(copy_length), dest_uninitialized);
5259
5260 // Present the results of the fast call.
5261 result_region->init_req(fast_path, control());
5262 result_i_o ->init_req(fast_path, i_o());
5263 result_memory->init_req(fast_path, memory(adr_type));
5264 }
5265
5266 // Here are all the slow paths up to this point, in one bundle:
5267 slow_control = top();
5268 if (slow_region != NULL)
5269 slow_control = _gvn.transform(slow_region);
5270 DEBUG_ONLY(slow_region = (RegionNode*)badAddress);
5271
5272 set_control(checked_control);
5273 if (!stopped()) {
5274 // Clean up after the checked call.
5275 // The returned value is either 0 or -1^K,
5276 // where K = number of partially transferred array elements.
5277 Node* cmp = _gvn.transform(new(C) CmpINode(checked_value, intcon(0)));
5278 Node* bol = _gvn.transform(new(C) BoolNode(cmp, BoolTest::eq));
5279 IfNode* iff = create_and_map_if(control(), bol, PROB_MAX, COUNT_UNKNOWN);
5280
5281 // If it is 0, we are done, so transfer to the end.
5282 Node* checks_done = _gvn.transform(new(C) IfTrueNode(iff));
5283 result_region->init_req(checked_path, checks_done);
5284 result_i_o ->init_req(checked_path, checked_i_o);
5285 result_memory->init_req(checked_path, checked_mem);
5286
5287 // If it is not zero, merge into the slow call.
5288 set_control( _gvn.transform(new(C) IfFalseNode(iff) ));
5289 RegionNode* slow_reg2 = new(C) RegionNode(3);
5290 PhiNode* slow_i_o2 = new(C) PhiNode(slow_reg2, Type::ABIO);
5291 PhiNode* slow_mem2 = new(C) PhiNode(slow_reg2, Type::MEMORY, adr_type);
5292 record_for_igvn(slow_reg2);
5293 slow_reg2 ->init_req(1, slow_control);
5294 slow_i_o2 ->init_req(1, slow_i_o);
5295 slow_mem2 ->init_req(1, slow_mem);
5296 slow_reg2 ->init_req(2, control());
5297 slow_i_o2 ->init_req(2, checked_i_o);
5298 slow_mem2 ->init_req(2, checked_mem);
5299
5300 slow_control = _gvn.transform(slow_reg2);
5301 slow_i_o = _gvn.transform(slow_i_o2);
5302 slow_mem = _gvn.transform(slow_mem2);
5303
5304 if (alloc != NULL) {
5305 // We'll restart from the very beginning, after zeroing the whole thing.
5306 // This can cause double writes, but that's OK since dest is brand new.
5307 // So we ignore the low 31 bits of the value returned from the stub.
5308 } else {
5309 // We must continue the copy exactly where it failed, or else
5310 // another thread might see the wrong number of writes to dest.
5311 Node* checked_offset = _gvn.transform(new(C) XorINode(checked_value, intcon(-1)));
5312 Node* slow_offset = new(C) PhiNode(slow_reg2, TypeInt::INT);
5313 slow_offset->init_req(1, intcon(0));
5314 slow_offset->init_req(2, checked_offset);
5315 slow_offset = _gvn.transform(slow_offset);
5316
5317 // Adjust the arguments by the conditionally incoming offset.
5318 Node* src_off_plus = _gvn.transform(new(C) AddINode(src_offset, slow_offset));
5319 Node* dest_off_plus = _gvn.transform(new(C) AddINode(dest_offset, slow_offset));
5320 Node* length_minus = _gvn.transform(new(C) SubINode(copy_length, slow_offset));
5321
5322 // Tweak the node variables to adjust the code produced below:
5323 src_offset = src_off_plus;
5324 dest_offset = dest_off_plus;
5325 copy_length = length_minus;
5326 }
5327 }
5328
5329 set_control(slow_control);
5330 if (!stopped()) {
5331 // Generate the slow path, if needed.
5332 PreserveJVMState pjvms(this); // replace_in_map may trash the map
5333
5334 set_memory(slow_mem, adr_type);
5335 set_i_o(slow_i_o);
5336
5337 if (dest_uninitialized) {
5338 generate_clear_array(adr_type, dest, basic_elem_type,
5339 intcon(0), NULL,
5340 alloc->in(AllocateNode::AllocSize));
5341 }
5342
5343 generate_slow_arraycopy(adr_type,
5344 src, src_offset, dest, dest_offset,
5345 copy_length, /*dest_uninitialized*/false);
5346
5347 result_region->init_req(slow_call_path, control());
5348 result_i_o ->init_req(slow_call_path, i_o());
5349 result_memory->init_req(slow_call_path, memory(adr_type));
5350 }
5351
5352 // Remove unused edges.
5353 for (uint i = 1; i < result_region->req(); i++) {
5354 if (result_region->in(i) == NULL)
5355 result_region->init_req(i, top());
5356 }
5357
5358 // Finished; return the combined state.
5359 set_control( _gvn.transform(result_region));
5360 set_i_o( _gvn.transform(result_i_o) );
5361 set_memory( _gvn.transform(result_memory), adr_type );
5362
5363 // The memory edges above are precise in order to model effects around
5364 // array copies accurately to allow value numbering of field loads around
5365 // arraycopy. Such field loads, both before and after, are common in Java
5366 // collections and similar classes involving header/array data structures.
5367 //
5368 // But with low number of register or when some registers are used or killed
5369 // by arraycopy calls it causes registers spilling on stack. See 6544710.
5370 // The next memory barrier is added to avoid it. If the arraycopy can be
5371 // optimized away (which it can, sometimes) then we can manually remove
5372 // the membar also.
5373 //
5374 // Do not let reads from the cloned object float above the arraycopy.
5375 if (alloc != NULL) {
5376 // Do not let stores that initialize this object be reordered with
5377 // a subsequent store that would make this object accessible by
5378 // other threads.
5379 // Record what AllocateNode this StoreStore protects so that
5380 // escape analysis can go from the MemBarStoreStoreNode to the
5381 // AllocateNode and eliminate the MemBarStoreStoreNode if possible
5382 // based on the escape status of the AllocateNode.
5383 insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out(AllocateNode::RawAddress));
5384 } else if (InsertMemBarAfterArraycopy)
5385 insert_mem_bar(Op_MemBarCPUOrder);
5386 }
5387
5388
5389 // Helper function which determines if an arraycopy immediately follows
5390 // an allocation, with no intervening tests or other escapes for the object.
5391 AllocateArrayNode*
5392 LibraryCallKit::tightly_coupled_allocation(Node* ptr,
5393 RegionNode* slow_region) {
5394 if (stopped()) return NULL; // no fast path
5395 if (C->AliasLevel() == 0) return NULL; // no MergeMems around
5396
5397 AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(ptr, &_gvn);
5398 if (alloc == NULL) return NULL;
5399
5400 Node* rawmem = memory(Compile::AliasIdxRaw);
5401 // Is the allocation's memory state untouched?
5402 if (!(rawmem->is_Proj() && rawmem->in(0)->is_Initialize())) {
5403 // Bail out if there have been raw-memory effects since the allocation.
5404 // (Example: There might have been a call or safepoint.)
5405 return NULL;
5406 }
5407 rawmem = rawmem->in(0)->as_Initialize()->memory(Compile::AliasIdxRaw);
5408 if (!(rawmem->is_Proj() && rawmem->in(0) == alloc)) {
5409 return NULL;
5410 }
5411
5412 // There must be no unexpected observers of this allocation.
5413 for (DUIterator_Fast imax, i = ptr->fast_outs(imax); i < imax; i++) {
5414 Node* obs = ptr->fast_out(i);
5415 if (obs != this->map()) {
5416 return NULL;
5417 }
5418 }
5419
5420 // This arraycopy must unconditionally follow the allocation of the ptr.
5421 Node* alloc_ctl = ptr->in(0);
5422 assert(just_allocated_object(alloc_ctl) == ptr, "most recent allo");
5423
5424 Node* ctl = control();
5425 while (ctl != alloc_ctl) {
5426 // There may be guards which feed into the slow_region.
5427 // Any other control flow means that we might not get a chance
5428 // to finish initializing the allocated object.
5429 if ((ctl->is_IfFalse() || ctl->is_IfTrue()) && ctl->in(0)->is_If()) {
5430 IfNode* iff = ctl->in(0)->as_If();
5431 Node* not_ctl = iff->proj_out(1 - ctl->as_Proj()->_con);
5432 assert(not_ctl != NULL && not_ctl != ctl, "found alternate");
5433 if (slow_region != NULL && slow_region->find_edge(not_ctl) >= 1) {
5434 ctl = iff->in(0); // This test feeds the known slow_region.
5435 continue;
5436 }
5437 // One more try: Various low-level checks bottom out in
5438 // uncommon traps. If the debug-info of the trap omits
5439 // any reference to the allocation, as we've already
5440 // observed, then there can be no objection to the trap.
5441 bool found_trap = false;
5442 for (DUIterator_Fast jmax, j = not_ctl->fast_outs(jmax); j < jmax; j++) {
5443 Node* obs = not_ctl->fast_out(j);
5444 if (obs->in(0) == not_ctl && obs->is_Call() &&
5445 (obs->as_Call()->entry_point() == SharedRuntime::uncommon_trap_blob()->entry_point())) {
5446 found_trap = true; break;
5447 }
5448 }
5449 if (found_trap) {
5450 ctl = iff->in(0); // This test feeds a harmless uncommon trap.
5451 continue;
5452 }
5453 }
5454 return NULL;
5455 }
5456
5457 // If we get this far, we have an allocation which immediately
5458 // precedes the arraycopy, and we can take over zeroing the new object.
5459 // The arraycopy will finish the initialization, and provide
5460 // a new control state to which we will anchor the destination pointer.
5461
5462 return alloc;
5463 }
5464
5465 // Helper for initialization of arrays, creating a ClearArray.
5466 // It writes zero bits in [start..end), within the body of an array object.
5467 // The memory effects are all chained onto the 'adr_type' alias category.
5468 //
5469 // Since the object is otherwise uninitialized, we are free
5470 // to put a little "slop" around the edges of the cleared area,
5471 // as long as it does not go back into the array's header,
5472 // or beyond the array end within the heap.
5473 //
5474 // The lower edge can be rounded down to the nearest jint and the
5475 // upper edge can be rounded up to the nearest MinObjAlignmentInBytes.
5476 //
5477 // Arguments:
5478 // adr_type memory slice where writes are generated
5479 // dest oop of the destination array
5480 // basic_elem_type element type of the destination
5481 // slice_idx array index of first element to store
5482 // slice_len number of elements to store (or NULL)
5483 // dest_size total size in bytes of the array object
5484 //
5485 // Exactly one of slice_len or dest_size must be non-NULL.
5486 // If dest_size is non-NULL, zeroing extends to the end of the object.
5487 // If slice_len is non-NULL, the slice_idx value must be a constant.
5488 void
5489 LibraryCallKit::generate_clear_array(const TypePtr* adr_type,
5490 Node* dest,
5491 BasicType basic_elem_type,
5492 Node* slice_idx,
5493 Node* slice_len,
5494 Node* dest_size) {
5495 // one or the other but not both of slice_len and dest_size:
5496 assert((slice_len != NULL? 1: 0) + (dest_size != NULL? 1: 0) == 1, "");
5497 if (slice_len == NULL) slice_len = top();
5498 if (dest_size == NULL) dest_size = top();
5499
5500 // operate on this memory slice:
5501 Node* mem = memory(adr_type); // memory slice to operate on
5502
5503 // scaling and rounding of indexes:
5504 int scale = exact_log2(type2aelembytes(basic_elem_type));
5505 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
5506 int clear_low = (-1 << scale) & (BytesPerInt - 1);
5507 int bump_bit = (-1 << scale) & BytesPerInt;
5508
5509 // determine constant starts and ends
5510 const intptr_t BIG_NEG = -128;
5511 assert(BIG_NEG + 2*abase < 0, "neg enough");
5512 intptr_t slice_idx_con = (intptr_t) find_int_con(slice_idx, BIG_NEG);
5513 intptr_t slice_len_con = (intptr_t) find_int_con(slice_len, BIG_NEG);
5514 if (slice_len_con == 0) {
5515 return; // nothing to do here
5516 }
5517 intptr_t start_con = (abase + (slice_idx_con << scale)) & ~clear_low;
5518 intptr_t end_con = find_intptr_t_con(dest_size, -1);
5519 if (slice_idx_con >= 0 && slice_len_con >= 0) {
5520 assert(end_con < 0, "not two cons");
5521 end_con = round_to(abase + ((slice_idx_con + slice_len_con) << scale),
5522 BytesPerLong);
5523 }
5524
5525 if (start_con >= 0 && end_con >= 0) {
5526 // Constant start and end. Simple.
5527 mem = ClearArrayNode::clear_memory(control(), mem, dest,
5528 start_con, end_con, &_gvn);
5529 } else if (start_con >= 0 && dest_size != top()) {
5530 // Constant start, pre-rounded end after the tail of the array.
5531 Node* end = dest_size;
5532 mem = ClearArrayNode::clear_memory(control(), mem, dest,
5533 start_con, end, &_gvn);
5534 } else if (start_con >= 0 && slice_len != top()) {
5535 // Constant start, non-constant end. End needs rounding up.
5536 // End offset = round_up(abase + ((slice_idx_con + slice_len) << scale), 8)
5537 intptr_t end_base = abase + (slice_idx_con << scale);
5538 int end_round = (-1 << scale) & (BytesPerLong - 1);
5539 Node* end = ConvI2X(slice_len);
5540 if (scale != 0)
5541 end = _gvn.transform(new(C) LShiftXNode(end, intcon(scale) ));
5542 end_base += end_round;
5543 end = _gvn.transform(new(C) AddXNode(end, MakeConX(end_base)));
5544 end = _gvn.transform(new(C) AndXNode(end, MakeConX(~end_round)));
5545 mem = ClearArrayNode::clear_memory(control(), mem, dest,
5546 start_con, end, &_gvn);
5547 } else if (start_con < 0 && dest_size != top()) {
5548 // Non-constant start, pre-rounded end after the tail of the array.
5549 // This is almost certainly a "round-to-end" operation.
5550 Node* start = slice_idx;
5551 start = ConvI2X(start);
5552 if (scale != 0)
5553 start = _gvn.transform(new(C) LShiftXNode( start, intcon(scale) ));
5554 start = _gvn.transform(new(C) AddXNode(start, MakeConX(abase)));
5555 if ((bump_bit | clear_low) != 0) {
5556 int to_clear = (bump_bit | clear_low);
5557 // Align up mod 8, then store a jint zero unconditionally
5558 // just before the mod-8 boundary.
5559 if (((abase + bump_bit) & ~to_clear) - bump_bit
5560 < arrayOopDesc::length_offset_in_bytes() + BytesPerInt) {
5561 bump_bit = 0;
5562 assert((abase & to_clear) == 0, "array base must be long-aligned");
5563 } else {
5564 // Bump 'start' up to (or past) the next jint boundary:
5565 start = _gvn.transform(new(C) AddXNode(start, MakeConX(bump_bit)));
5566 assert((abase & clear_low) == 0, "array base must be int-aligned");
5567 }
5568 // Round bumped 'start' down to jlong boundary in body of array.
5569 start = _gvn.transform(new(C) AndXNode(start, MakeConX(~to_clear)));
5570 if (bump_bit != 0) {
5571 // Store a zero to the immediately preceding jint:
5572 Node* x1 = _gvn.transform(new(C) AddXNode(start, MakeConX(-bump_bit)));
5573 Node* p1 = basic_plus_adr(dest, x1);
5574 mem = StoreNode::make(_gvn, control(), mem, p1, adr_type, intcon(0), T_INT, MemNode::unordered);
5575 mem = _gvn.transform(mem);
5576 }
5577 }
5578 Node* end = dest_size; // pre-rounded
5579 mem = ClearArrayNode::clear_memory(control(), mem, dest,
5580 start, end, &_gvn);
5581 } else {
5582 // Non-constant start, unrounded non-constant end.
5583 // (Nobody zeroes a random midsection of an array using this routine.)
5584 ShouldNotReachHere(); // fix caller
5585 }
5586
5587 // Done.
5588 set_memory(mem, adr_type);
5589 }
5590
5591
5592 bool
5593 LibraryCallKit::generate_block_arraycopy(const TypePtr* adr_type,
5594 BasicType basic_elem_type,
5595 AllocateNode* alloc,
5596 Node* src, Node* src_offset,
5597 Node* dest, Node* dest_offset,
5598 Node* dest_size, bool dest_uninitialized) {
5599 // See if there is an advantage from block transfer.
5600 int scale = exact_log2(type2aelembytes(basic_elem_type));
5601 if (scale >= LogBytesPerLong)
5602 return false; // it is already a block transfer
5603
5604 // Look at the alignment of the starting offsets.
5605 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
5606
5607 intptr_t src_off_con = (intptr_t) find_int_con(src_offset, -1);
5608 intptr_t dest_off_con = (intptr_t) find_int_con(dest_offset, -1);
5609 if (src_off_con < 0 || dest_off_con < 0)
5610 // At present, we can only understand constants.
5611 return false;
5612
5613 intptr_t src_off = abase + (src_off_con << scale);
5614 intptr_t dest_off = abase + (dest_off_con << scale);
5615
5616 if (((src_off | dest_off) & (BytesPerLong-1)) != 0) {
5617 // Non-aligned; too bad.
5618 // One more chance: Pick off an initial 32-bit word.
5619 // This is a common case, since abase can be odd mod 8.
5620 if (((src_off | dest_off) & (BytesPerLong-1)) == BytesPerInt &&
5621 ((src_off ^ dest_off) & (BytesPerLong-1)) == 0) {
5622 Node* sptr = basic_plus_adr(src, src_off);
5623 Node* dptr = basic_plus_adr(dest, dest_off);
5624 Node* sval = make_load(control(), sptr, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
5625 store_to_memory(control(), dptr, sval, T_INT, adr_type, MemNode::unordered);
5626 src_off += BytesPerInt;
5627 dest_off += BytesPerInt;
5628 } else {
5629 return false;
5630 }
5631 }
5632 assert(src_off % BytesPerLong == 0, "");
5633 assert(dest_off % BytesPerLong == 0, "");
5634
5635 // Do this copy by giant steps.
5636 Node* sptr = basic_plus_adr(src, src_off);
5637 Node* dptr = basic_plus_adr(dest, dest_off);
5638 Node* countx = dest_size;
5639 countx = _gvn.transform(new (C) SubXNode(countx, MakeConX(dest_off)));
5640 countx = _gvn.transform(new (C) URShiftXNode(countx, intcon(LogBytesPerLong)));
5641
5642 bool disjoint_bases = true; // since alloc != NULL
5643 generate_unchecked_arraycopy(adr_type, T_LONG, disjoint_bases,
5644 sptr, NULL, dptr, NULL, countx, dest_uninitialized);
5645
5646 return true;
5647 }
5648
5649
5650 // Helper function; generates code for the slow case.
5651 // We make a call to a runtime method which emulates the native method,
5652 // but without the native wrapper overhead.
5653 void
5654 LibraryCallKit::generate_slow_arraycopy(const TypePtr* adr_type,
5655 Node* src, Node* src_offset,
5656 Node* dest, Node* dest_offset,
5657 Node* copy_length, bool dest_uninitialized) {
5658 assert(!dest_uninitialized, "Invariant");
5659 Node* call = make_runtime_call(RC_NO_LEAF | RC_UNCOMMON,
5660 OptoRuntime::slow_arraycopy_Type(),
5661 OptoRuntime::slow_arraycopy_Java(),
5662 "slow_arraycopy", adr_type,
5663 src, src_offset, dest, dest_offset,
5664 copy_length);
5665
5666 // Handle exceptions thrown by this fellow:
5667 make_slow_call_ex(call, env()->Throwable_klass(), false);
5668 }
5669
5670 // Helper function; generates code for cases requiring runtime checks.
5671 Node*
5672 LibraryCallKit::generate_checkcast_arraycopy(const TypePtr* adr_type,
5673 Node* dest_elem_klass,
5674 Node* src, Node* src_offset,
5675 Node* dest, Node* dest_offset,
5676 Node* copy_length, bool dest_uninitialized) {
5677 if (stopped()) return NULL;
5678
5679 address copyfunc_addr = StubRoutines::checkcast_arraycopy(dest_uninitialized);
5680 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path.
5681 return NULL;
5682 }
5683
5684 // Pick out the parameters required to perform a store-check
5685 // for the target array. This is an optimistic check. It will
5686 // look in each non-null element's class, at the desired klass's
5687 // super_check_offset, for the desired klass.
5688 int sco_offset = in_bytes(Klass::super_check_offset_offset());
5689 Node* p3 = basic_plus_adr(dest_elem_klass, sco_offset);
5690 Node* n3 = new(C) LoadINode(NULL, memory(p3), p3, _gvn.type(p3)->is_ptr(), TypeInt::INT, MemNode::unordered);
5691 Node* check_offset = ConvI2X(_gvn.transform(n3));
5692 Node* check_value = dest_elem_klass;
5693
5694 Node* src_start = array_element_address(src, src_offset, T_OBJECT);
5695 Node* dest_start = array_element_address(dest, dest_offset, T_OBJECT);
5696
5697 // (We know the arrays are never conjoint, because their types differ.)
5698 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
5699 OptoRuntime::checkcast_arraycopy_Type(),
5700 copyfunc_addr, "checkcast_arraycopy", adr_type,
5701 // five arguments, of which two are
5702 // intptr_t (jlong in LP64)
5703 src_start, dest_start,
5704 copy_length XTOP,
5705 check_offset XTOP,
5706 check_value);
5707
5708 return _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms));
5709 }
5710
5711
5712 // Helper function; generates code for cases requiring runtime checks.
5713 Node*
5714 LibraryCallKit::generate_generic_arraycopy(const TypePtr* adr_type,
5715 Node* src, Node* src_offset,
5716 Node* dest, Node* dest_offset,
5717 Node* copy_length, bool dest_uninitialized) {
5718 assert(!dest_uninitialized, "Invariant");
5719 if (stopped()) return NULL;
5720 address copyfunc_addr = StubRoutines::generic_arraycopy();
5721 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path.
5722 return NULL;
5723 }
5724
5725 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
5726 OptoRuntime::generic_arraycopy_Type(),
5727 copyfunc_addr, "generic_arraycopy", adr_type,
5728 src, src_offset, dest, dest_offset, copy_length);
5729
5730 return _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms));
5731 }
5732
5733 // Helper function; generates the fast out-of-line call to an arraycopy stub.
5734 void
5735 LibraryCallKit::generate_unchecked_arraycopy(const TypePtr* adr_type,
5736 BasicType basic_elem_type,
5737 bool disjoint_bases,
5738 Node* src, Node* src_offset,
5739 Node* dest, Node* dest_offset,
5740 Node* copy_length, bool dest_uninitialized) {
5741 if (stopped()) return; // nothing to do
5742
5743 Node* src_start = src;
5744 Node* dest_start = dest;
5745 if (src_offset != NULL || dest_offset != NULL) {
5746 assert(src_offset != NULL && dest_offset != NULL, "");
5747 src_start = array_element_address(src, src_offset, basic_elem_type);
5748 dest_start = array_element_address(dest, dest_offset, basic_elem_type);
5749 }
5750
5751 // Figure out which arraycopy runtime method to call.
5752 const char* copyfunc_name = "arraycopy";
5753 address copyfunc_addr =
5754 basictype2arraycopy(basic_elem_type, src_offset, dest_offset,
5755 disjoint_bases, copyfunc_name, dest_uninitialized);
5756
5757 // Call it. Note that the count_ix value is not scaled to a byte-size.
5758 make_runtime_call(RC_LEAF|RC_NO_FP,
5759 OptoRuntime::fast_arraycopy_Type(),
5760 copyfunc_addr, copyfunc_name, adr_type,
5761 src_start, dest_start, copy_length XTOP);
5762 }
5763
5764 //-------------inline_encodeISOArray-----------------------------------
5765 // encode char[] to byte[] in ISO_8859_1
5766 bool LibraryCallKit::inline_encodeISOArray() {
5767 assert(callee()->signature()->size() == 5, "encodeISOArray has 5 parameters");
5768 // no receiver since it is static method
5769 Node *src = argument(0);
5770 Node *src_offset = argument(1);
5771 Node *dst = argument(2);
5772 Node *dst_offset = argument(3);
5773 Node *length = argument(4);
5774
5775 const Type* src_type = src->Value(&_gvn);
5776 const Type* dst_type = dst->Value(&_gvn);
5777 const TypeAryPtr* top_src = src_type->isa_aryptr();
5778 const TypeAryPtr* top_dest = dst_type->isa_aryptr();
5779 if (top_src == NULL || top_src->klass() == NULL ||
5780 top_dest == NULL || top_dest->klass() == NULL) {
5781 // failed array check
5782 return false;
5783 }
5784
5785 // Figure out the size and type of the elements we will be copying.
5786 BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5787 BasicType dst_elem = dst_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5788 if (src_elem != T_CHAR || dst_elem != T_BYTE) {
5789 return false;
5790 }
5791 Node* src_start = array_element_address(src, src_offset, src_elem);
5792 Node* dst_start = array_element_address(dst, dst_offset, dst_elem);
5793 // 'src_start' points to src array + scaled offset
5794 // 'dst_start' points to dst array + scaled offset
5795
5796 const TypeAryPtr* mtype = TypeAryPtr::BYTES;
5797 Node* enc = new (C) EncodeISOArrayNode(control(), memory(mtype), src_start, dst_start, length);
5798 enc = _gvn.transform(enc);
5799 Node* res_mem = _gvn.transform(new (C) SCMemProjNode(enc));
5800 set_memory(res_mem, mtype);
5801 set_result(enc);
5802 return true;
5803 }
5804
5805 //-------------inline_multiplyToLen-----------------------------------
5806 bool LibraryCallKit::inline_multiplyToLen() {
5807 assert(UseMultiplyToLenIntrinsic, "not implementated on this platform");
5808
5809 address stubAddr = StubRoutines::multiplyToLen();
5810 if (stubAddr == NULL) {
5811 return false; // Intrinsic's stub is not implemented on this platform
5812 }
5813 const char* stubName = "multiplyToLen";
5814
5815 assert(callee()->signature()->size() == 5, "multiplyToLen has 5 parameters");
5816
5817 // no receiver because it is a static method
5818 Node* x = argument(0);
5819 Node* xlen = argument(1);
5820 Node* y = argument(2);
5821 Node* ylen = argument(3);
5822 Node* z = argument(4);
5823
5824 const Type* x_type = x->Value(&_gvn);
5825 const Type* y_type = y->Value(&_gvn);
5826 const TypeAryPtr* top_x = x_type->isa_aryptr();
5827 const TypeAryPtr* top_y = y_type->isa_aryptr();
5828 if (top_x == NULL || top_x->klass() == NULL ||
5829 top_y == NULL || top_y->klass() == NULL) {
5830 // failed array check
5831 return false;
5832 }
5833
5834 BasicType x_elem = x_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5835 BasicType y_elem = y_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5836 if (x_elem != T_INT || y_elem != T_INT) {
5837 return false;
5838 }
5839
5840 // Set the original stack and the reexecute bit for the interpreter to reexecute
5841 // the bytecode that invokes BigInteger.multiplyToLen() if deoptimization happens
5842 // on the return from z array allocation in runtime.
5843 { PreserveReexecuteState preexecs(this);
5844 jvms()->set_should_reexecute(true);
5845
5846 Node* x_start = array_element_address(x, intcon(0), x_elem);
5847 Node* y_start = array_element_address(y, intcon(0), y_elem);
5848 // 'x_start' points to x array + scaled xlen
5849 // 'y_start' points to y array + scaled ylen
5850
5851 // Allocate the result array
5852 Node* zlen = _gvn.transform(new(C) AddINode(xlen, ylen));
5853 ciKlass* klass = ciTypeArrayKlass::make(T_INT);
5854 Node* klass_node = makecon(TypeKlassPtr::make(klass));
5855
5856 IdealKit ideal(this);
5857
5858 #define __ ideal.
5859 Node* one = __ ConI(1);
5860 Node* zero = __ ConI(0);
5861 IdealVariable need_alloc(ideal), z_alloc(ideal); __ declarations_done();
5862 __ set(need_alloc, zero);
5863 __ set(z_alloc, z);
5864 __ if_then(z, BoolTest::eq, null()); {
5865 __ increment (need_alloc, one);
5866 } __ else_(); {
5867 // Update graphKit memory and control from IdealKit.
5868 sync_kit(ideal);
5869 Node* zlen_arg = load_array_length(z);
5870 // Update IdealKit memory and control from graphKit.
5871 __ sync_kit(this);
5872 __ if_then(zlen_arg, BoolTest::lt, zlen); {
5873 __ increment (need_alloc, one);
5874 } __ end_if();
5875 } __ end_if();
5876
5877 __ if_then(__ value(need_alloc), BoolTest::ne, zero); {
5878 // Update graphKit memory and control from IdealKit.
5879 sync_kit(ideal);
5880 Node * narr = new_array(klass_node, zlen, 1);
5881 // Update IdealKit memory and control from graphKit.
5882 __ sync_kit(this);
5883 __ set(z_alloc, narr);
5884 } __ end_if();
5885
5886 sync_kit(ideal);
5887 z = __ value(z_alloc);
5888 // Can't use TypeAryPtr::INTS which uses Bottom offset.
5889 _gvn.set_type(z, TypeOopPtr::make_from_klass(klass));
5890 // Final sync IdealKit and GraphKit.
5891 final_sync(ideal);
5892 #undef __
5893
5894 Node* z_start = array_element_address(z, intcon(0), T_INT);
5895
5896 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
5897 OptoRuntime::multiplyToLen_Type(),
5898 stubAddr, stubName, TypePtr::BOTTOM,
5899 x_start, xlen, y_start, ylen, z_start, zlen);
5900 } // original reexecute is set back here
5901
5902 C->set_has_split_ifs(true); // Has chance for split-if optimization
5903 set_result(z);
5904 return true;
5905 }
5906
5907 //-------------inline_squareToLen------------------------------------
5908 bool LibraryCallKit::inline_squareToLen() {
5909 assert(UseSquareToLenIntrinsic, "not implementated on this platform");
5910
5911 address stubAddr = StubRoutines::squareToLen();
5912 if (stubAddr == NULL) {
5913 return false; // Intrinsic's stub is not implemented on this platform
5914 }
5915 const char* stubName = "squareToLen";
5916
5917 assert(callee()->signature()->size() == 4, "implSquareToLen has 4 parameters");
5918
5919 Node* x = argument(0);
5920 Node* len = argument(1);
5921 Node* z = argument(2);
5922 Node* zlen = argument(3);
5923
5924 const Type* x_type = x->Value(&_gvn);
5925 const Type* z_type = z->Value(&_gvn);
5926 const TypeAryPtr* top_x = x_type->isa_aryptr();
5927 const TypeAryPtr* top_z = z_type->isa_aryptr();
5928 if (top_x == NULL || top_x->klass() == NULL ||
5929 top_z == NULL || top_z->klass() == NULL) {
5930 // failed array check
5931 return false;
5932 }
5933
5934 BasicType x_elem = x_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5935 BasicType z_elem = z_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5936 if (x_elem != T_INT || z_elem != T_INT) {
5937 return false;
5938 }
5939
5940
5941 Node* x_start = array_element_address(x, intcon(0), x_elem);
5942 Node* z_start = array_element_address(z, intcon(0), z_elem);
5943
5944 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
5945 OptoRuntime::squareToLen_Type(),
5946 stubAddr, stubName, TypePtr::BOTTOM,
5947 x_start, len, z_start, zlen);
5948
5949 set_result(z);
5950 return true;
5951 }
5952
5953 //-------------inline_mulAdd------------------------------------------
5954 bool LibraryCallKit::inline_mulAdd() {
5955 assert(UseMulAddIntrinsic, "not implementated on this platform");
5956
5957 address stubAddr = StubRoutines::mulAdd();
5958 if (stubAddr == NULL) {
5959 return false; // Intrinsic's stub is not implemented on this platform
5960 }
5961 const char* stubName = "mulAdd";
5962
5963 assert(callee()->signature()->size() == 5, "mulAdd has 5 parameters");
5964
5965 Node* out = argument(0);
5966 Node* in = argument(1);
5967 Node* offset = argument(2);
5968 Node* len = argument(3);
5969 Node* k = argument(4);
5970
5971 const Type* out_type = out->Value(&_gvn);
5972 const Type* in_type = in->Value(&_gvn);
5973 const TypeAryPtr* top_out = out_type->isa_aryptr();
5974 const TypeAryPtr* top_in = in_type->isa_aryptr();
5975 if (top_out == NULL || top_out->klass() == NULL ||
5976 top_in == NULL || top_in->klass() == NULL) {
5977 // failed array check
5978 return false;
5979 }
5980
5981 BasicType out_elem = out_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5982 BasicType in_elem = in_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5983 if (out_elem != T_INT || in_elem != T_INT) {
5984 return false;
5985 }
5986
5987 Node* outlen = load_array_length(out);
5988 Node* new_offset = _gvn.transform(new (C) SubINode(outlen, offset));
5989 Node* out_start = array_element_address(out, intcon(0), out_elem);
5990 Node* in_start = array_element_address(in, intcon(0), in_elem);
5991
5992 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
5993 OptoRuntime::mulAdd_Type(),
5994 stubAddr, stubName, TypePtr::BOTTOM,
5995 out_start,in_start, new_offset, len, k);
5996 Node* result = _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms));
5997 set_result(result);
5998 return true;
5999 }
6000
6001 //-------------inline_montgomeryMultiply-----------------------------------
6002 bool LibraryCallKit::inline_montgomeryMultiply() {
6003 address stubAddr = StubRoutines::montgomeryMultiply();
6004 if (stubAddr == NULL) {
6005 return false; // Intrinsic's stub is not implemented on this platform
6006 }
6007
6008 assert(UseMontgomeryMultiplyIntrinsic, "not implemented on this platform");
6009 const char* stubName = "montgomery_square";
6010
6011 assert(callee()->signature()->size() == 7, "montgomeryMultiply has 7 parameters");
6012
6013 Node* a = argument(0);
6014 Node* b = argument(1);
6015 Node* n = argument(2);
6016 Node* len = argument(3);
6017 Node* inv = argument(4);
6018 Node* m = argument(6);
6019
6020 const Type* a_type = a->Value(&_gvn);
6021 const TypeAryPtr* top_a = a_type->isa_aryptr();
6022 const Type* b_type = b->Value(&_gvn);
6023 const TypeAryPtr* top_b = b_type->isa_aryptr();
6024 const Type* n_type = a->Value(&_gvn);
6025 const TypeAryPtr* top_n = n_type->isa_aryptr();
6026 const Type* m_type = a->Value(&_gvn);
6027 const TypeAryPtr* top_m = m_type->isa_aryptr();
6028 if (top_a == NULL || top_a->klass() == NULL ||
6029 top_b == NULL || top_b->klass() == NULL ||
6030 top_n == NULL || top_n->klass() == NULL ||
6031 top_m == NULL || top_m->klass() == NULL) {
6032 // failed array check
6033 return false;
6034 }
6035
6036 BasicType a_elem = a_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6037 BasicType b_elem = b_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6038 BasicType n_elem = n_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6039 BasicType m_elem = m_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6040 if (a_elem != T_INT || b_elem != T_INT || n_elem != T_INT || m_elem != T_INT) {
6041 return false;
6042 }
6043
6044 // Make the call
6045 {
6046 Node* a_start = array_element_address(a, intcon(0), a_elem);
6047 Node* b_start = array_element_address(b, intcon(0), b_elem);
6048 Node* n_start = array_element_address(n, intcon(0), n_elem);
6049 Node* m_start = array_element_address(m, intcon(0), m_elem);
6050
6051 Node* call = make_runtime_call(RC_LEAF,
6052 OptoRuntime::montgomeryMultiply_Type(),
6053 stubAddr, stubName, TypePtr::BOTTOM,
6054 a_start, b_start, n_start, len, inv, top(),
6055 m_start);
6056 set_result(m);
6057 }
6058
6059 return true;
6060 }
6061
6062 bool LibraryCallKit::inline_montgomerySquare() {
6063 address stubAddr = StubRoutines::montgomerySquare();
6064 if (stubAddr == NULL) {
6065 return false; // Intrinsic's stub is not implemented on this platform
6066 }
6067
6068 assert(UseMontgomerySquareIntrinsic, "not implemented on this platform");
6069 const char* stubName = "montgomery_square";
6070
6071 assert(callee()->signature()->size() == 6, "montgomerySquare has 6 parameters");
6072
6073 Node* a = argument(0);
6074 Node* n = argument(1);
6075 Node* len = argument(2);
6076 Node* inv = argument(3);
6077 Node* m = argument(5);
6078
6079 const Type* a_type = a->Value(&_gvn);
6080 const TypeAryPtr* top_a = a_type->isa_aryptr();
6081 const Type* n_type = a->Value(&_gvn);
6082 const TypeAryPtr* top_n = n_type->isa_aryptr();
6083 const Type* m_type = a->Value(&_gvn);
6084 const TypeAryPtr* top_m = m_type->isa_aryptr();
6085 if (top_a == NULL || top_a->klass() == NULL ||
6086 top_n == NULL || top_n->klass() == NULL ||
6087 top_m == NULL || top_m->klass() == NULL) {
6088 // failed array check
6089 return false;
6090 }
6091
6092 BasicType a_elem = a_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6093 BasicType n_elem = n_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6094 BasicType m_elem = m_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6095 if (a_elem != T_INT || n_elem != T_INT || m_elem != T_INT) {
6096 return false;
6097 }
6098
6099 // Make the call
6100 {
6101 Node* a_start = array_element_address(a, intcon(0), a_elem);
6102 Node* n_start = array_element_address(n, intcon(0), n_elem);
6103 Node* m_start = array_element_address(m, intcon(0), m_elem);
6104
6105 Node* call = make_runtime_call(RC_LEAF,
6106 OptoRuntime::montgomerySquare_Type(),
6107 stubAddr, stubName, TypePtr::BOTTOM,
6108 a_start, n_start, len, inv, top(),
6109 m_start);
6110 set_result(m);
6111 }
6112
6113 return true;
6114 }
6115
6116
6117 /**
6118 * Calculate CRC32 for byte.
6119 * int java.util.zip.CRC32.update(int crc, int b)
6120 */
6121 bool LibraryCallKit::inline_updateCRC32() {
6122 assert(UseCRC32Intrinsics, "need AVX and LCMUL instructions support");
6123 assert(callee()->signature()->size() == 2, "update has 2 parameters");
6124 // no receiver since it is static method
6125 Node* crc = argument(0); // type: int
6126 Node* b = argument(1); // type: int
6127
6128 /*
6129 * int c = ~ crc;
6130 * b = timesXtoThe32[(b ^ c) & 0xFF];
6131 * b = b ^ (c >>> 8);
6132 * crc = ~b;
6133 */
6134
6135 Node* M1 = intcon(-1);
6136 crc = _gvn.transform(new (C) XorINode(crc, M1));
6137 Node* result = _gvn.transform(new (C) XorINode(crc, b));
6138 result = _gvn.transform(new (C) AndINode(result, intcon(0xFF)));
6139
6140 Node* base = makecon(TypeRawPtr::make(StubRoutines::crc_table_addr()));
6141 Node* offset = _gvn.transform(new (C) LShiftINode(result, intcon(0x2)));
6142 Node* adr = basic_plus_adr(top(), base, ConvI2X(offset));
6143 result = make_load(control(), adr, TypeInt::INT, T_INT, MemNode::unordered);
6144
6145 crc = _gvn.transform(new (C) URShiftINode(crc, intcon(8)));
6146 result = _gvn.transform(new (C) XorINode(crc, result));
6147 result = _gvn.transform(new (C) XorINode(result, M1));
6148 set_result(result);
6149 return true;
6150 }
6151
6152 /**
6153 * Calculate CRC32 for byte[] array.
6154 * int java.util.zip.CRC32.updateBytes(int crc, byte[] buf, int off, int len)
6155 */
6156 bool LibraryCallKit::inline_updateBytesCRC32() {
6157 assert(UseCRC32Intrinsics, "need AVX and LCMUL instructions support");
6158 assert(callee()->signature()->size() == 4, "updateBytes has 4 parameters");
6159 // no receiver since it is static method
6160 Node* crc = argument(0); // type: int
6161 Node* src = argument(1); // type: oop
6162 Node* offset = argument(2); // type: int
6163 Node* length = argument(3); // type: int
6164
6165 const Type* src_type = src->Value(&_gvn);
6166 const TypeAryPtr* top_src = src_type->isa_aryptr();
6167 if (top_src == NULL || top_src->klass() == NULL) {
6168 // failed array check
6169 return false;
6170 }
6171
6172 // Figure out the size and type of the elements we will be copying.
6173 BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6174 if (src_elem != T_BYTE) {
6175 return false;
6176 }
6177
6178 // 'src_start' points to src array + scaled offset
6179 Node* src_start = array_element_address(src, offset, src_elem);
6180
6181 // We assume that range check is done by caller.
6182 // TODO: generate range check (offset+length < src.length) in debug VM.
6183
6184 // Call the stub.
6185 address stubAddr = StubRoutines::updateBytesCRC32();
6186 const char *stubName = "updateBytesCRC32";
6187
6188 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::updateBytesCRC32_Type(),
6189 stubAddr, stubName, TypePtr::BOTTOM,
6190 crc, src_start, length);
6191 Node* result = _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms));
6192 set_result(result);
6193 return true;
6194 }
6195
6196 /**
6197 * Calculate CRC32 for ByteBuffer.
6198 * int java.util.zip.CRC32.updateByteBuffer(int crc, long buf, int off, int len)
6199 */
6200 bool LibraryCallKit::inline_updateByteBufferCRC32() {
6201 assert(UseCRC32Intrinsics, "need AVX and LCMUL instructions support");
6202 assert(callee()->signature()->size() == 5, "updateByteBuffer has 4 parameters and one is long");
6203 // no receiver since it is static method
6204 Node* crc = argument(0); // type: int
6205 Node* src = argument(1); // type: long
6206 Node* offset = argument(3); // type: int
6207 Node* length = argument(4); // type: int
6208
6209 src = ConvL2X(src); // adjust Java long to machine word
6210 Node* base = _gvn.transform(new (C) CastX2PNode(src));
6211 offset = ConvI2X(offset);
6212
6213 // 'src_start' points to src array + scaled offset
6214 Node* src_start = basic_plus_adr(top(), base, offset);
6215
6216 // Call the stub.
6217 address stubAddr = StubRoutines::updateBytesCRC32();
6218 const char *stubName = "updateBytesCRC32";
6219
6220 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::updateBytesCRC32_Type(),
6221 stubAddr, stubName, TypePtr::BOTTOM,
6222 crc, src_start, length);
6223 Node* result = _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms));
6224 set_result(result);
6225 return true;
6226 }
6227
6228 //----------------------------inline_reference_get----------------------------
6229 // public T java.lang.ref.Reference.get();
6230 bool LibraryCallKit::inline_reference_get() {
6231 const int referent_offset = java_lang_ref_Reference::referent_offset;
6232 guarantee(referent_offset > 0, "should have already been set");
6233
6234 // Get the argument:
6235 Node* reference_obj = null_check_receiver();
6236 if (stopped()) return true;
6237
6238 Node* adr = basic_plus_adr(reference_obj, reference_obj, referent_offset);
6239
6240 ciInstanceKlass* klass = env()->Object_klass();
6241 const TypeOopPtr* object_type = TypeOopPtr::make_from_klass(klass);
6242
6243 Node* no_ctrl = NULL;
6244 Node* result = make_load(no_ctrl, adr, object_type, T_OBJECT, MemNode::unordered);
6245
6246 // Use the pre-barrier to record the value in the referent field
6247 pre_barrier(false /* do_load */,
6248 control(),
6249 NULL /* obj */, NULL /* adr */, max_juint /* alias_idx */, NULL /* val */, NULL /* val_type */,
6250 result /* pre_val */,
6251 T_OBJECT);
6252
6253 // Add memory barrier to prevent commoning reads from this field
6254 // across safepoint since GC can change its value.
6255 insert_mem_bar(Op_MemBarCPUOrder);
6256
6257 set_result(result);
6258 return true;
6259 }
6260
6261
6262 Node * LibraryCallKit::load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString,
6263 bool is_exact=true, bool is_static=false) {
6264
6265 const TypeInstPtr* tinst = _gvn.type(fromObj)->isa_instptr();
6266 assert(tinst != NULL, "obj is null");
6267 assert(tinst->klass()->is_loaded(), "obj is not loaded");
6268 assert(!is_exact || tinst->klass_is_exact(), "klass not exact");
6269
6270 ciField* field = tinst->klass()->as_instance_klass()->get_field_by_name(ciSymbol::make(fieldName),
6271 ciSymbol::make(fieldTypeString),
6272 is_static);
6273 if (field == NULL) return (Node *) NULL;
6274 assert (field != NULL, "undefined field");
6275
6276 // Next code copied from Parse::do_get_xxx():
6277
6278 // Compute address and memory type.
6279 int offset = field->offset_in_bytes();
6280 bool is_vol = field->is_volatile();
6281 ciType* field_klass = field->type();
6282 assert(field_klass->is_loaded(), "should be loaded");
6283 const TypePtr* adr_type = C->alias_type(field)->adr_type();
6284 Node *adr = basic_plus_adr(fromObj, fromObj, offset);
6285 BasicType bt = field->layout_type();
6286
6287 // Build the resultant type of the load
6288 const Type *type;
6289 if (bt == T_OBJECT) {
6290 type = TypeOopPtr::make_from_klass(field_klass->as_klass());
6291 } else {
6292 type = Type::get_const_basic_type(bt);
6293 }
6294
6295 if (support_IRIW_for_not_multiple_copy_atomic_cpu && is_vol) {
6296 insert_mem_bar(Op_MemBarVolatile); // StoreLoad barrier
6297 }
6298 // Build the load.
6299 MemNode::MemOrd mo = is_vol ? MemNode::acquire : MemNode::unordered;
6300 Node* loadedField = make_load(NULL, adr, type, bt, adr_type, mo, LoadNode::DependsOnlyOnTest, is_vol);
6301 // If reference is volatile, prevent following memory ops from
6302 // floating up past the volatile read. Also prevents commoning
6303 // another volatile read.
6304 if (is_vol) {
6305 // Memory barrier includes bogus read of value to force load BEFORE membar
6306 insert_mem_bar(Op_MemBarAcquire, loadedField);
6307 }
6308 return loadedField;
6309 }
6310
6311
6312 //------------------------------inline_aescrypt_Block-----------------------
6313 bool LibraryCallKit::inline_aescrypt_Block(vmIntrinsics::ID id) {
6314 address stubAddr = NULL;
6315 const char *stubName;
6316 assert(UseAES, "need AES instruction support");
6317
6318 switch(id) {
6319 case vmIntrinsics::_aescrypt_encryptBlock:
6320 stubAddr = StubRoutines::aescrypt_encryptBlock();
6321 stubName = "aescrypt_encryptBlock";
6322 break;
6323 case vmIntrinsics::_aescrypt_decryptBlock:
6324 stubAddr = StubRoutines::aescrypt_decryptBlock();
6325 stubName = "aescrypt_decryptBlock";
6326 break;
6327 }
6328 if (stubAddr == NULL) return false;
6329
6330 Node* aescrypt_object = argument(0);
6331 Node* src = argument(1);
6332 Node* src_offset = argument(2);
6333 Node* dest = argument(3);
6334 Node* dest_offset = argument(4);
6335
6336 // (1) src and dest are arrays.
6337 const Type* src_type = src->Value(&_gvn);
6338 const Type* dest_type = dest->Value(&_gvn);
6339 const TypeAryPtr* top_src = src_type->isa_aryptr();
6340 const TypeAryPtr* top_dest = dest_type->isa_aryptr();
6341 assert (top_src != NULL && top_src->klass() != NULL && top_dest != NULL && top_dest->klass() != NULL, "args are strange");
6342
6343 // for the quick and dirty code we will skip all the checks.
6344 // we are just trying to get the call to be generated.
6345 Node* src_start = src;
6346 Node* dest_start = dest;
6347 if (src_offset != NULL || dest_offset != NULL) {
6348 assert(src_offset != NULL && dest_offset != NULL, "");
6349 src_start = array_element_address(src, src_offset, T_BYTE);
6350 dest_start = array_element_address(dest, dest_offset, T_BYTE);
6351 }
6352
6353 // now need to get the start of its expanded key array
6354 // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java
6355 Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object);
6356 if (k_start == NULL) return false;
6357
6358 if (Matcher::pass_original_key_for_aes()) {
6359 // on SPARC we need to pass the original key since key expansion needs to happen in intrinsics due to
6360 // compatibility issues between Java key expansion and SPARC crypto instructions
6361 Node* original_k_start = get_original_key_start_from_aescrypt_object(aescrypt_object);
6362 if (original_k_start == NULL) return false;
6363
6364 // Call the stub.
6365 make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::aescrypt_block_Type(),
6366 stubAddr, stubName, TypePtr::BOTTOM,
6367 src_start, dest_start, k_start, original_k_start);
6368 } else {
6369 // Call the stub.
6370 make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::aescrypt_block_Type(),
6371 stubAddr, stubName, TypePtr::BOTTOM,
6372 src_start, dest_start, k_start);
6373 }
6374
6375 return true;
6376 }
6377
6378 //------------------------------inline_cipherBlockChaining_AESCrypt-----------------------
6379 bool LibraryCallKit::inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id) {
6380 address stubAddr = NULL;
6381 const char *stubName = NULL;
6382
6383 assert(UseAES, "need AES instruction support");
6384
6385 switch(id) {
6386 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt:
6387 stubAddr = StubRoutines::cipherBlockChaining_encryptAESCrypt();
6388 stubName = "cipherBlockChaining_encryptAESCrypt";
6389 break;
6390 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt:
6391 stubAddr = StubRoutines::cipherBlockChaining_decryptAESCrypt();
6392 stubName = "cipherBlockChaining_decryptAESCrypt";
6393 break;
6394 }
6395 if (stubAddr == NULL) return false;
6396
6397 Node* cipherBlockChaining_object = argument(0);
6398 Node* src = argument(1);
6399 Node* src_offset = argument(2);
6400 Node* len = argument(3);
6401 Node* dest = argument(4);
6402 Node* dest_offset = argument(5);
6403
6404 // (1) src and dest are arrays.
6405 const Type* src_type = src->Value(&_gvn);
6406 const Type* dest_type = dest->Value(&_gvn);
6407 const TypeAryPtr* top_src = src_type->isa_aryptr();
6408 const TypeAryPtr* top_dest = dest_type->isa_aryptr();
6409 assert (top_src != NULL && top_src->klass() != NULL
6410 && top_dest != NULL && top_dest->klass() != NULL, "args are strange");
6411
6412 // checks are the responsibility of the caller
6413 Node* src_start = src;
6414 Node* dest_start = dest;
6415 if (src_offset != NULL || dest_offset != NULL) {
6416 assert(src_offset != NULL && dest_offset != NULL, "");
6417 src_start = array_element_address(src, src_offset, T_BYTE);
6418 dest_start = array_element_address(dest, dest_offset, T_BYTE);
6419 }
6420
6421 // if we are in this set of code, we "know" the embeddedCipher is an AESCrypt object
6422 // (because of the predicated logic executed earlier).
6423 // so we cast it here safely.
6424 // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java
6425
6426 Node* embeddedCipherObj = load_field_from_object(cipherBlockChaining_object, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false);
6427 if (embeddedCipherObj == NULL) return false;
6428
6429 // cast it to what we know it will be at runtime
6430 const TypeInstPtr* tinst = _gvn.type(cipherBlockChaining_object)->isa_instptr();
6431 assert(tinst != NULL, "CBC obj is null");
6432 assert(tinst->klass()->is_loaded(), "CBC obj is not loaded");
6433 ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt"));
6434 assert(klass_AESCrypt->is_loaded(), "predicate checks that this class is loaded");
6435
6436 ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass();
6437 const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_AESCrypt);
6438 const TypeOopPtr* xtype = aklass->as_instance_type();
6439 Node* aescrypt_object = new(C) CheckCastPPNode(control(), embeddedCipherObj, xtype);
6440 aescrypt_object = _gvn.transform(aescrypt_object);
6441
6442 // we need to get the start of the aescrypt_object's expanded key array
6443 Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object);
6444 if (k_start == NULL) return false;
6445
6446 // similarly, get the start address of the r vector
6447 Node* objRvec = load_field_from_object(cipherBlockChaining_object, "r", "[B", /*is_exact*/ false);
6448 if (objRvec == NULL) return false;
6449 Node* r_start = array_element_address(objRvec, intcon(0), T_BYTE);
6450
6451 Node* cbcCrypt;
6452 if (Matcher::pass_original_key_for_aes()) {
6453 // on SPARC we need to pass the original key since key expansion needs to happen in intrinsics due to
6454 // compatibility issues between Java key expansion and SPARC crypto instructions
6455 Node* original_k_start = get_original_key_start_from_aescrypt_object(aescrypt_object);
6456 if (original_k_start == NULL) return false;
6457
6458 // Call the stub, passing src_start, dest_start, k_start, r_start, src_len and original_k_start
6459 cbcCrypt = make_runtime_call(RC_LEAF|RC_NO_FP,
6460 OptoRuntime::cipherBlockChaining_aescrypt_Type(),
6461 stubAddr, stubName, TypePtr::BOTTOM,
6462 src_start, dest_start, k_start, r_start, len, original_k_start);
6463 } else {
6464 // Call the stub, passing src_start, dest_start, k_start, r_start and src_len
6465 cbcCrypt = make_runtime_call(RC_LEAF|RC_NO_FP,
6466 OptoRuntime::cipherBlockChaining_aescrypt_Type(),
6467 stubAddr, stubName, TypePtr::BOTTOM,
6468 src_start, dest_start, k_start, r_start, len);
6469 }
6470
6471 // return cipher length (int)
6472 Node* retvalue = _gvn.transform(new (C) ProjNode(cbcCrypt, TypeFunc::Parms));
6473 set_result(retvalue);
6474 return true;
6475 }
6476
6477 //------------------------------get_key_start_from_aescrypt_object-----------------------
6478 Node * LibraryCallKit::get_key_start_from_aescrypt_object(Node *aescrypt_object) {
6479 #ifdef PPC64
6480 // MixColumns for decryption can be reduced by preprocessing MixColumns with round keys.
6481 // Intel's extention is based on this optimization and AESCrypt generates round keys by preprocessing MixColumns.
6482 // However, ppc64 vncipher processes MixColumns and requires the same round keys with encryption.
6483 // The ppc64 stubs of encryption and decryption use the same round keys (sessionK[0]).
6484 Node* objSessionK = load_field_from_object(aescrypt_object, "sessionK", "[[I", /*is_exact*/ false);
6485 assert (objSessionK != NULL, "wrong version of com.sun.crypto.provider.AESCrypt");
6486 if (objSessionK == NULL) {
6487 return (Node *) NULL;
6488 }
6489 Node* objAESCryptKey = load_array_element(control(), objSessionK, intcon(0), TypeAryPtr::OOPS);
6490 #else
6491 Node* objAESCryptKey = load_field_from_object(aescrypt_object, "K", "[I", /*is_exact*/ false);
6492 #endif // PPC64
6493 assert (objAESCryptKey != NULL, "wrong version of com.sun.crypto.provider.AESCrypt");
6494 if (objAESCryptKey == NULL) return (Node *) NULL;
6495
6496 // now have the array, need to get the start address of the K array
6497 Node* k_start = array_element_address(objAESCryptKey, intcon(0), T_INT);
6498 return k_start;
6499 }
6500
6501 //------------------------------get_original_key_start_from_aescrypt_object-----------------------
6502 Node * LibraryCallKit::get_original_key_start_from_aescrypt_object(Node *aescrypt_object) {
6503 Node* objAESCryptKey = load_field_from_object(aescrypt_object, "lastKey", "[B", /*is_exact*/ false);
6504 assert (objAESCryptKey != NULL, "wrong version of com.sun.crypto.provider.AESCrypt");
6505 if (objAESCryptKey == NULL) return (Node *) NULL;
6506
6507 // now have the array, need to get the start address of the lastKey array
6508 Node* original_k_start = array_element_address(objAESCryptKey, intcon(0), T_BYTE);
6509 return original_k_start;
6510 }
6511
6512 //----------------------------inline_cipherBlockChaining_AESCrypt_predicate----------------------------
6513 // Return node representing slow path of predicate check.
6514 // the pseudo code we want to emulate with this predicate is:
6515 // for encryption:
6516 // if (embeddedCipherObj instanceof AESCrypt) do_intrinsic, else do_javapath
6517 // for decryption:
6518 // if ((embeddedCipherObj instanceof AESCrypt) && (cipher!=plain)) do_intrinsic, else do_javapath
6519 // note cipher==plain is more conservative than the original java code but that's OK
6520 //
6521 Node* LibraryCallKit::inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting) {
6522 // The receiver was checked for NULL already.
6523 Node* objCBC = argument(0);
6524
6525 // Load embeddedCipher field of CipherBlockChaining object.
6526 Node* embeddedCipherObj = load_field_from_object(objCBC, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false);
6527
6528 // get AESCrypt klass for instanceOf check
6529 // AESCrypt might not be loaded yet if some other SymmetricCipher got us to this compile point
6530 // will have same classloader as CipherBlockChaining object
6531 const TypeInstPtr* tinst = _gvn.type(objCBC)->isa_instptr();
6532 assert(tinst != NULL, "CBCobj is null");
6533 assert(tinst->klass()->is_loaded(), "CBCobj is not loaded");
6534
6535 // we want to do an instanceof comparison against the AESCrypt class
6536 ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt"));
6537 if (!klass_AESCrypt->is_loaded()) {
6538 // if AESCrypt is not even loaded, we never take the intrinsic fast path
6539 Node* ctrl = control();
6540 set_control(top()); // no regular fast path
6541 return ctrl;
6542 }
6543 ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass();
6544
6545 Node* instof = gen_instanceof(embeddedCipherObj, makecon(TypeKlassPtr::make(instklass_AESCrypt)));
6546 Node* cmp_instof = _gvn.transform(new (C) CmpINode(instof, intcon(1)));
6547 Node* bool_instof = _gvn.transform(new (C) BoolNode(cmp_instof, BoolTest::ne));
6548
6549 Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN);
6550
6551 // for encryption, we are done
6552 if (!decrypting)
6553 return instof_false; // even if it is NULL
6554
6555 // for decryption, we need to add a further check to avoid
6556 // taking the intrinsic path when cipher and plain are the same
6557 // see the original java code for why.
6558 RegionNode* region = new(C) RegionNode(3);
6559 region->init_req(1, instof_false);
6560 Node* src = argument(1);
6561 Node* dest = argument(4);
6562 Node* cmp_src_dest = _gvn.transform(new (C) CmpPNode(src, dest));
6563 Node* bool_src_dest = _gvn.transform(new (C) BoolNode(cmp_src_dest, BoolTest::eq));
6564 Node* src_dest_conjoint = generate_guard(bool_src_dest, NULL, PROB_MIN);
6565 region->init_req(2, src_dest_conjoint);
6566
6567 record_for_igvn(region);
6568 return _gvn.transform(region);
6569 }
6570
6571 //------------------------------inline_sha_implCompress-----------------------
6572 //
6573 // Calculate SHA (i.e., SHA-1) for single-block byte[] array.
6574 // void com.sun.security.provider.SHA.implCompress(byte[] buf, int ofs)
6575 //
6576 // Calculate SHA2 (i.e., SHA-244 or SHA-256) for single-block byte[] array.
6577 // void com.sun.security.provider.SHA2.implCompress(byte[] buf, int ofs)
6578 //
6579 // Calculate SHA5 (i.e., SHA-384 or SHA-512) for single-block byte[] array.
6580 // void com.sun.security.provider.SHA5.implCompress(byte[] buf, int ofs)
6581 //
6582 bool LibraryCallKit::inline_sha_implCompress(vmIntrinsics::ID id) {
6583 assert(callee()->signature()->size() == 2, "sha_implCompress has 2 parameters");
6584
6585 Node* sha_obj = argument(0);
6586 Node* src = argument(1); // type oop
6587 Node* ofs = argument(2); // type int
6588
6589 const Type* src_type = src->Value(&_gvn);
6590 const TypeAryPtr* top_src = src_type->isa_aryptr();
6591 if (top_src == NULL || top_src->klass() == NULL) {
6592 // failed array check
6593 return false;
6594 }
6595 // Figure out the size and type of the elements we will be copying.
6596 BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6597 if (src_elem != T_BYTE) {
6598 return false;
6599 }
6600 // 'src_start' points to src array + offset
6601 Node* src_start = array_element_address(src, ofs, src_elem);
6602 Node* state = NULL;
6603 address stubAddr;
6604 const char *stubName;
6605
6606 switch(id) {
6607 case vmIntrinsics::_sha_implCompress:
6608 assert(UseSHA1Intrinsics, "need SHA1 instruction support");
6609 state = get_state_from_sha_object(sha_obj);
6610 stubAddr = StubRoutines::sha1_implCompress();
6611 stubName = "sha1_implCompress";
6612 break;
6613 case vmIntrinsics::_sha2_implCompress:
6614 assert(UseSHA256Intrinsics, "need SHA256 instruction support");
6615 state = get_state_from_sha_object(sha_obj);
6616 stubAddr = StubRoutines::sha256_implCompress();
6617 stubName = "sha256_implCompress";
6618 break;
6619 case vmIntrinsics::_sha5_implCompress:
6620 assert(UseSHA512Intrinsics, "need SHA512 instruction support");
6621 state = get_state_from_sha5_object(sha_obj);
6622 stubAddr = StubRoutines::sha512_implCompress();
6623 stubName = "sha512_implCompress";
6624 break;
6625 default:
6626 fatal_unexpected_iid(id);
6627 return false;
6628 }
6629 if (state == NULL) return false;
6630
6631 // Call the stub.
6632 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::sha_implCompress_Type(),
6633 stubAddr, stubName, TypePtr::BOTTOM,
6634 src_start, state);
6635
6636 return true;
6637 }
6638
6639 //------------------------------inline_digestBase_implCompressMB-----------------------
6640 //
6641 // Calculate SHA/SHA2/SHA5 for multi-block byte[] array.
6642 // int com.sun.security.provider.DigestBase.implCompressMultiBlock(byte[] b, int ofs, int limit)
6643 //
6644 bool LibraryCallKit::inline_digestBase_implCompressMB(int predicate) {
6645 assert(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics,
6646 "need SHA1/SHA256/SHA512 instruction support");
6647 assert((uint)predicate < 3, "sanity");
6648 assert(callee()->signature()->size() == 3, "digestBase_implCompressMB has 3 parameters");
6649
6650 Node* digestBase_obj = argument(0); // The receiver was checked for NULL already.
6651 Node* src = argument(1); // byte[] array
6652 Node* ofs = argument(2); // type int
6653 Node* limit = argument(3); // type int
6654
6655 const Type* src_type = src->Value(&_gvn);
6656 const TypeAryPtr* top_src = src_type->isa_aryptr();
6657 if (top_src == NULL || top_src->klass() == NULL) {
6658 // failed array check
6659 return false;
6660 }
6661 // Figure out the size and type of the elements we will be copying.
6662 BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6663 if (src_elem != T_BYTE) {
6664 return false;
6665 }
6666 // 'src_start' points to src array + offset
6667 Node* src_start = array_element_address(src, ofs, src_elem);
6668
6669 const char* klass_SHA_name = NULL;
6670 const char* stub_name = NULL;
6671 address stub_addr = NULL;
6672 bool long_state = false;
6673
6674 switch (predicate) {
6675 case 0:
6676 if (UseSHA1Intrinsics) {
6677 klass_SHA_name = "sun/security/provider/SHA";
6678 stub_name = "sha1_implCompressMB";
6679 stub_addr = StubRoutines::sha1_implCompressMB();
6680 }
6681 break;
6682 case 1:
6683 if (UseSHA256Intrinsics) {
6684 klass_SHA_name = "sun/security/provider/SHA2";
6685 stub_name = "sha256_implCompressMB";
6686 stub_addr = StubRoutines::sha256_implCompressMB();
6687 }
6688 break;
6689 case 2:
6690 if (UseSHA512Intrinsics) {
6691 klass_SHA_name = "sun/security/provider/SHA5";
6692 stub_name = "sha512_implCompressMB";
6693 stub_addr = StubRoutines::sha512_implCompressMB();
6694 long_state = true;
6695 }
6696 break;
6697 default:
6698 fatal(err_msg_res("unknown SHA intrinsic predicate: %d", predicate));
6699 }
6700 if (klass_SHA_name != NULL) {
6701 // get DigestBase klass to lookup for SHA klass
6702 const TypeInstPtr* tinst = _gvn.type(digestBase_obj)->isa_instptr();
6703 assert(tinst != NULL, "digestBase_obj is not instance???");
6704 assert(tinst->klass()->is_loaded(), "DigestBase is not loaded");
6705
6706 ciKlass* klass_SHA = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make(klass_SHA_name));
6707 assert(klass_SHA->is_loaded(), "predicate checks that this class is loaded");
6708 ciInstanceKlass* instklass_SHA = klass_SHA->as_instance_klass();
6709 return inline_sha_implCompressMB(digestBase_obj, instklass_SHA, long_state, stub_addr, stub_name, src_start, ofs, limit);
6710 }
6711 return false;
6712 }
6713 //------------------------------inline_sha_implCompressMB-----------------------
6714 bool LibraryCallKit::inline_sha_implCompressMB(Node* digestBase_obj, ciInstanceKlass* instklass_SHA,
6715 bool long_state, address stubAddr, const char *stubName,
6716 Node* src_start, Node* ofs, Node* limit) {
6717 const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_SHA);
6718 const TypeOopPtr* xtype = aklass->as_instance_type();
6719 Node* sha_obj = new (C) CheckCastPPNode(control(), digestBase_obj, xtype);
6720 sha_obj = _gvn.transform(sha_obj);
6721
6722 Node* state;
6723 if (long_state) {
6724 state = get_state_from_sha5_object(sha_obj);
6725 } else {
6726 state = get_state_from_sha_object(sha_obj);
6727 }
6728 if (state == NULL) return false;
6729
6730 // Call the stub.
6731 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
6732 OptoRuntime::digestBase_implCompressMB_Type(),
6733 stubAddr, stubName, TypePtr::BOTTOM,
6734 src_start, state, ofs, limit);
6735 // return ofs (int)
6736 Node* result = _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms));
6737 set_result(result);
6738
6739 return true;
6740 }
6741
6742 //------------------------------get_state_from_sha_object-----------------------
6743 Node * LibraryCallKit::get_state_from_sha_object(Node *sha_object) {
6744 Node* sha_state = load_field_from_object(sha_object, "state", "[I", /*is_exact*/ false);
6745 assert (sha_state != NULL, "wrong version of sun.security.provider.SHA/SHA2");
6746 if (sha_state == NULL) return (Node *) NULL;
6747
6748 // now have the array, need to get the start address of the state array
6749 Node* state = array_element_address(sha_state, intcon(0), T_INT);
6750 return state;
6751 }
6752
6753 //------------------------------get_state_from_sha5_object-----------------------
6754 Node * LibraryCallKit::get_state_from_sha5_object(Node *sha_object) {
6755 Node* sha_state = load_field_from_object(sha_object, "state", "[J", /*is_exact*/ false);
6756 assert (sha_state != NULL, "wrong version of sun.security.provider.SHA5");
6757 if (sha_state == NULL) return (Node *) NULL;
6758
6759 // now have the array, need to get the start address of the state array
6760 Node* state = array_element_address(sha_state, intcon(0), T_LONG);
6761 return state;
6762 }
6763
6764 //----------------------------inline_digestBase_implCompressMB_predicate----------------------------
6765 // Return node representing slow path of predicate check.
6766 // the pseudo code we want to emulate with this predicate is:
6767 // if (digestBaseObj instanceof SHA/SHA2/SHA5) do_intrinsic, else do_javapath
6768 //
6769 Node* LibraryCallKit::inline_digestBase_implCompressMB_predicate(int predicate) {
6770 assert(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics,
6771 "need SHA1/SHA256/SHA512 instruction support");
6772 assert((uint)predicate < 3, "sanity");
6773
6774 // The receiver was checked for NULL already.
6775 Node* digestBaseObj = argument(0);
6776
6777 // get DigestBase klass for instanceOf check
6778 const TypeInstPtr* tinst = _gvn.type(digestBaseObj)->isa_instptr();
6779 assert(tinst != NULL, "digestBaseObj is null");
6780 assert(tinst->klass()->is_loaded(), "DigestBase is not loaded");
6781
6782 const char* klass_SHA_name = NULL;
6783 switch (predicate) {
6784 case 0:
6785 if (UseSHA1Intrinsics) {
6786 // we want to do an instanceof comparison against the SHA class
6787 klass_SHA_name = "sun/security/provider/SHA";
6788 }
6789 break;
6790 case 1:
6791 if (UseSHA256Intrinsics) {
6792 // we want to do an instanceof comparison against the SHA2 class
6793 klass_SHA_name = "sun/security/provider/SHA2";
6794 }
6795 break;
6796 case 2:
6797 if (UseSHA512Intrinsics) {
6798 // we want to do an instanceof comparison against the SHA5 class
6799 klass_SHA_name = "sun/security/provider/SHA5";
6800 }
6801 break;
6802 default:
6803 fatal(err_msg_res("unknown SHA intrinsic predicate: %d", predicate));
6804 }
6805
6806 ciKlass* klass_SHA = NULL;
6807 if (klass_SHA_name != NULL) {
6808 klass_SHA = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make(klass_SHA_name));
6809 }
6810 if ((klass_SHA == NULL) || !klass_SHA->is_loaded()) {
6811 // if none of SHA/SHA2/SHA5 is loaded, we never take the intrinsic fast path
6812 Node* ctrl = control();
6813 set_control(top()); // no intrinsic path
6814 return ctrl;
6815 }
6816 ciInstanceKlass* instklass_SHA = klass_SHA->as_instance_klass();
6817
6818 Node* instofSHA = gen_instanceof(digestBaseObj, makecon(TypeKlassPtr::make(instklass_SHA)));
6819 Node* cmp_instof = _gvn.transform(new (C) CmpINode(instofSHA, intcon(1)));
6820 Node* bool_instof = _gvn.transform(new (C) BoolNode(cmp_instof, BoolTest::ne));
6821 Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN);
6822
6823 return instof_false; // even if it is NULL
6824 }
6825
6826 bool LibraryCallKit::inline_profileBoolean() {
6827 Node* counts = argument(1);
6828 const TypeAryPtr* ary = NULL;
6829 ciArray* aobj = NULL;
6830 if (counts->is_Con()
6831 && (ary = counts->bottom_type()->isa_aryptr()) != NULL
6832 && (aobj = ary->const_oop()->as_array()) != NULL
6833 && (aobj->length() == 2)) {
6834 // Profile is int[2] where [0] and [1] correspond to false and true value occurrences respectively.
6835 jint false_cnt = aobj->element_value(0).as_int();
6836 jint true_cnt = aobj->element_value(1).as_int();
6837
6838 if (C->log() != NULL) {
6839 C->log()->elem("observe source='profileBoolean' false='%d' true='%d'",
6840 false_cnt, true_cnt);
6841 }
6842
6843 if (false_cnt + true_cnt == 0) {
6844 // According to profile, never executed.
6845 uncommon_trap_exact(Deoptimization::Reason_intrinsic,
6846 Deoptimization::Action_reinterpret);
6847 return true;
6848 }
6849
6850 // result is a boolean (0 or 1) and its profile (false_cnt & true_cnt)
6851 // is a number of each value occurrences.
6852 Node* result = argument(0);
6853 if (false_cnt == 0 || true_cnt == 0) {
6854 // According to profile, one value has been never seen.
6855 int expected_val = (false_cnt == 0) ? 1 : 0;
6856
6857 Node* cmp = _gvn.transform(new (C) CmpINode(result, intcon(expected_val)));
6858 Node* test = _gvn.transform(new (C) BoolNode(cmp, BoolTest::eq));
6859
6860 IfNode* check = create_and_map_if(control(), test, PROB_ALWAYS, COUNT_UNKNOWN);
6861 Node* fast_path = _gvn.transform(new (C) IfTrueNode(check));
6862 Node* slow_path = _gvn.transform(new (C) IfFalseNode(check));
6863
6864 { // Slow path: uncommon trap for never seen value and then reexecute
6865 // MethodHandleImpl::profileBoolean() to bump the count, so JIT knows
6866 // the value has been seen at least once.
6867 PreserveJVMState pjvms(this);
6868 PreserveReexecuteState preexecs(this);
6869 jvms()->set_should_reexecute(true);
6870
6871 set_control(slow_path);
6872 set_i_o(i_o());
6873
6874 uncommon_trap_exact(Deoptimization::Reason_intrinsic,
6875 Deoptimization::Action_reinterpret);
6876 }
6877 // The guard for never seen value enables sharpening of the result and
6878 // returning a constant. It allows to eliminate branches on the same value
6879 // later on.
6880 set_control(fast_path);
6881 result = intcon(expected_val);
6882 }
6883 // Stop profiling.
6884 // MethodHandleImpl::profileBoolean() has profiling logic in its bytecode.
6885 // By replacing method body with profile data (represented as ProfileBooleanNode
6886 // on IR level) we effectively disable profiling.
6887 // It enables full speed execution once optimized code is generated.
6888 Node* profile = _gvn.transform(new (C) ProfileBooleanNode(result, false_cnt, true_cnt));
6889 C->record_for_igvn(profile);
6890 set_result(profile);
6891 return true;
6892 } else {
6893 // Continue profiling.
6894 // Profile data isn't available at the moment. So, execute method's bytecode version.
6895 // Usually, when GWT LambdaForms are profiled it means that a stand-alone nmethod
6896 // is compiled and counters aren't available since corresponding MethodHandle
6897 // isn't a compile-time constant.
6898 return false;
6899 }
6900 }