Mercurial > hg > graal-jvmci-8
annotate src/share/vm/opto/library_call.cpp @ 23886:5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
Reviewed-by: kvn, mdoerr
author | vkempik |
---|---|
date | Fri, 04 Mar 2016 16:15:48 +0300 |
parents | 51c505229e71 |
children | a96cf90239c6 |
rev | line source |
---|---|
0 | 1 /* |
10405 | 2 * Copyright (c) 1999, 2013, Oracle and/or its affiliates. All rights reserved. |
0 | 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 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1513
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1513
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1513
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "classfile/systemDictionary.hpp" | |
27 #include "classfile/vmSymbols.hpp" | |
2405
3d58a4983660
7022998: JSR 292 recursive method handle calls inline themselves infinitely
twisti
parents:
2385
diff
changeset
|
28 #include "compiler/compileBroker.hpp" |
1972 | 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" | |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
34 #include "opto/connode.hpp" |
1972 | 35 #include "opto/idealKit.hpp" |
12323 | 36 #include "opto/mathexactnode.hpp" |
1972 | 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" | |
10405 | 43 #include "trace/traceMacros.hpp" |
0 | 44 |
45 class LibraryIntrinsic : public InlineCallGenerator { | |
46 // Extend the set of intrinsics known to the runtime: | |
47 public: | |
48 private: | |
49 bool _is_virtual; | |
12330
29bdcf12457c
8014447: Object.hashCode intrinsic breaks inline caches
shade
parents:
12323
diff
changeset
|
50 bool _does_virtual_dispatch; |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
51 int8_t _predicates_count; // Intrinsic is predicated by several conditions |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
52 int8_t _last_predicate; // Last generated predicate |
0 | 53 vmIntrinsics::ID _intrinsic_id; |
54 | |
55 public: | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
56 LibraryIntrinsic(ciMethod* m, bool is_virtual, int predicates_count, bool does_virtual_dispatch, vmIntrinsics::ID id) |
0 | 57 : InlineCallGenerator(m), |
58 _is_virtual(is_virtual), | |
12330
29bdcf12457c
8014447: Object.hashCode intrinsic breaks inline caches
shade
parents:
12323
diff
changeset
|
59 _does_virtual_dispatch(does_virtual_dispatch), |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
60 _predicates_count((int8_t)predicates_count), |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
61 _last_predicate((int8_t)-1), |
0 | 62 _intrinsic_id(id) |
63 { | |
64 } | |
65 virtual bool is_intrinsic() const { return true; } | |
66 virtual bool is_virtual() const { return _is_virtual; } | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
67 virtual bool is_predicated() const { return _predicates_count > 0; } |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
68 virtual int predicates_count() const { return _predicates_count; } |
12330
29bdcf12457c
8014447: Object.hashCode intrinsic breaks inline caches
shade
parents:
12323
diff
changeset
|
69 virtual bool does_virtual_dispatch() const { return _does_virtual_dispatch; } |
20327
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
20313
diff
changeset
|
70 virtual JVMState* generate(JVMState* jvms); |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
71 virtual Node* generate_predicate(JVMState* jvms, int predicate); |
0 | 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: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
79 LibraryIntrinsic* _intrinsic; // the library intrinsic being called |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
80 Node* _result; // the result node, if any |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
81 int _reexecute_sp; // the stack pointer when bytecode needs to be reexecuted |
0 | 82 |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
83 const TypeOopPtr* sharpen_unsafe_type(Compile::AliasType* alias_type, const TypePtr *adr_type, bool is_native_ptr = false); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
84 |
0 | 85 public: |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
86 LibraryCallKit(JVMState* jvms, LibraryIntrinsic* intrinsic) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
87 : GraphKit(jvms), |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
88 _intrinsic(intrinsic), |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
89 _result(NULL) |
0 | 90 { |
7200
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
91 // Check if this is a root compile. In that case we don't have a caller. |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
92 if (!jvms->has_method()) { |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
93 _reexecute_sp = sp(); |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
94 } else { |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
95 // Find out how many arguments the interpreter needs when deoptimizing |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
96 // and save the stack pointer value so it can used by uncommon_trap. |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
97 // We find the argument count by looking at the declared signature. |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
98 bool ignored_will_link; |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
99 ciSignature* declared_signature = NULL; |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
100 ciMethod* ignored_callee = caller()->get_method_at_bci(bci(), ignored_will_link, &declared_signature); |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
101 const int nargs = declared_signature->arg_size_for_bc(caller()->java_code_at_bci(bci())); |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
102 _reexecute_sp = sp() + nargs; // "push" arguments back on stack |
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
103 } |
0 | 104 } |
105 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
106 virtual LibraryCallKit* is_LibraryCallKit() const { return (LibraryCallKit*)this; } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
107 |
0 | 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 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
114 bool try_to_inline(int predicate); |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
115 Node* try_to_predicate(int predicate); |
0 | 116 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
117 void push_result() { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
118 // Push the result onto the stack. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
119 if (!stopped() && result() != NULL) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
120 BasicType bt = result()->bottom_type()->basic_type(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
121 push_node(bt, result()); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
122 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
123 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
124 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
125 private: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
126 void fatal_unexpected_iid(vmIntrinsics::ID iid) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
127 fatal(err_msg_res("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid))); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
128 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
129 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
130 void set_result(Node* n) { assert(_result == NULL, "only set once"); _result = n; } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
131 void set_result(RegionNode* region, PhiNode* value); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
132 Node* result() { return _result; } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
133 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
134 virtual int reexecute_sp() { return _reexecute_sp; } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
135 |
0 | 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, | |
2324 | 151 bool disjoint_bases, const char* &name, bool dest_uninitialized); |
0 | 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); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
156 Node* load_klass_from_mirror(Node* mirror, bool never_see_null, |
0 | 157 RegionNode* region, int null_path) { |
158 int offset = java_lang_Class::klass_offset_in_bytes(); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
159 return load_klass_from_mirror_common(mirror, never_see_null, |
0 | 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(); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
166 return load_klass_from_mirror_common(mirror, never_see_null, |
0 | 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 } | |
6894 | 197 Node * load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString, bool is_exact, bool is_static); |
0 | 198 |
6057 | 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); | |
0 | 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); | |
681 | 204 bool inline_string_equals(); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
205 Node* round_double_node(Node* n); |
0 | 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); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
209 bool inline_math(vmIntrinsics::ID id); |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
210 template <typename OverflowOp> |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
211 bool inline_math_overflow(Node* arg1, Node* arg2); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
212 void inline_math_mathExact(Node* math, Node* test); |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
213 bool inline_math_addExactI(bool is_increment); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
214 bool inline_math_addExactL(bool is_increment); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
215 bool inline_math_multiplyExactI(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
216 bool inline_math_multiplyExactL(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
217 bool inline_math_negateExactI(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
218 bool inline_math_negateExactL(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
219 bool inline_math_subtractExactI(bool is_decrement); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
220 bool inline_math_subtractExactL(bool is_decrement); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
221 bool inline_exp(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
222 bool inline_pow(); |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
223 Node* finish_pow_exp(Node* result, Node* x, Node* y, const TypeFunc* call_type, address funcAddr, const char* funcName); |
0 | 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); | |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
229 // Helper for inline_unsafe_access. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
230 // Generates the guards that check whether the result of |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
231 // Unsafe.getObject should be recorded in an SATB log buffer. |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
232 void insert_pre_barrier(Node* base_oop, Node* offset, Node* pre_val, bool need_mem_bar); |
0 | 233 bool inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile); |
234 bool inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static); | |
12078 | 235 static bool klass_needs_init_guard(Node* kls); |
0 | 236 bool inline_unsafe_allocate(); |
237 bool inline_unsafe_copyMemory(); | |
238 bool inline_native_currentThread(); | |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
239 #ifdef TRACE_HAVE_INTRINSICS |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
240 bool inline_native_classID(); |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
241 bool inline_native_threadID(); |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
242 #endif |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
243 bool inline_native_time_funcs(address method, const char* funcName); |
0 | 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); | |
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
251 bool inline_array_equals(); |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
252 void copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array, bool card_mark); |
0 | 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, | |
2324 | 282 Node* dest_size, bool dest_uninitialized); |
0 | 283 void generate_slow_arraycopy(const TypePtr* adr_type, |
284 Node* src, Node* src_offset, | |
285 Node* dest, Node* dest_offset, | |
2324 | 286 Node* copy_length, bool dest_uninitialized); |
0 | 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, | |
2324 | 291 Node* copy_length, bool dest_uninitialized); |
0 | 292 Node* generate_generic_arraycopy(const TypePtr* adr_type, |
293 Node* src, Node* src_offset, | |
294 Node* dest, Node* dest_offset, | |
2324 | 295 Node* copy_length, bool dest_uninitialized); |
0 | 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, | |
2324 | 301 Node* copy_length, bool dest_uninitialized); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
302 typedef enum { LS_xadd, LS_xchg, LS_cmpxchg } LoadStoreKind; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
303 bool inline_unsafe_load_store(BasicType type, LoadStoreKind kind); |
0 | 304 bool inline_unsafe_ordered_store(BasicType type); |
7425 | 305 bool inline_unsafe_fence(vmIntrinsics::ID id); |
0 | 306 bool inline_fp_conversions(vmIntrinsics::ID id); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
307 bool inline_number_methods(vmIntrinsics::ID id); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
308 bool inline_reference_get(); |
6894 | 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); | |
17670 | 313 Node* get_original_key_start_from_aescrypt_object(Node* aescrypt_object); |
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
314 bool inline_sha_implCompress(vmIntrinsics::ID id); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
315 bool inline_digestBase_implCompressMB(int predicate); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
316 bool inline_sha_implCompressMB(Node* digestBaseObj, ciInstanceKlass* instklass_SHA, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
317 bool long_state, address stubAddr, const char *stubName, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
318 Node* src_start, Node* ofs, Node* limit); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
319 Node* get_state_from_sha_object(Node *sha_object); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
320 Node* get_state_from_sha5_object(Node *sha_object); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
321 Node* inline_digestBase_implCompressMB_predicate(int predicate); |
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
322 bool inline_encodeISOArray(); |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
323 bool inline_updateCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
324 bool inline_updateBytesCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
325 bool inline_updateByteBufferCRC32(); |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
326 bool inline_multiplyToLen(); |
23885
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
327 bool inline_squareToLen(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
328 bool inline_mulAdd(); |
23886
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
329 bool inline_montgomeryMultiply(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
330 bool inline_montgomerySquare(); |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
331 |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
332 bool inline_profileBoolean(); |
0 | 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 | |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
341 ccstr disable_intr = NULL; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
342 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
343 if ((DisableIntrinsic[0] != '\0' |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
344 && strstr(DisableIntrinsic, vmIntrinsics::name_at(id)) != NULL) || |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
345 (method_has_option_value("DisableIntrinsic", disable_intr) |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
346 && strstr(disable_intr, vmIntrinsics::name_at(id)) != NULL)) { |
0 | 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: | |
681 | 375 case vmIntrinsics::_equals: |
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
376 case vmIntrinsics::_equalsC: |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
377 case vmIntrinsics::_getAndAddInt: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
378 case vmIntrinsics::_getAndAddLong: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
379 case vmIntrinsics::_getAndSetInt: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
380 case vmIntrinsics::_getAndSetLong: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
381 case vmIntrinsics::_getAndSetObject: |
7425 | 382 case vmIntrinsics::_loadFence: |
383 case vmIntrinsics::_storeFence: | |
384 case vmIntrinsics::_fullFence: | |
0 | 385 break; // InlineNatives does not control String.compareTo |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
386 case vmIntrinsics::_Reference_get: |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
387 break; // InlineNatives does not control Reference.get |
0 | 388 default: |
389 return NULL; | |
390 } | |
391 } | |
392 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
393 int predicates = 0; |
12330
29bdcf12457c
8014447: Object.hashCode intrinsic breaks inline caches
shade
parents:
12323
diff
changeset
|
394 bool does_virtual_dispatch = false; |
6894 | 395 |
0 | 396 switch (id) { |
397 case vmIntrinsics::_compareTo: | |
398 if (!SpecialStringCompareTo) return NULL; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
399 if (!Matcher::match_rule_supported(Op_StrComp)) return NULL; |
0 | 400 break; |
401 case vmIntrinsics::_indexOf: | |
402 if (!SpecialStringIndexOf) return NULL; | |
403 break; | |
681 | 404 case vmIntrinsics::_equals: |
405 if (!SpecialStringEquals) return NULL; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
406 if (!Matcher::match_rule_supported(Op_StrEquals)) return NULL; |
681 | 407 break; |
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
408 case vmIntrinsics::_equalsC: |
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
409 if (!SpecialArraysEquals) return NULL; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
410 if (!Matcher::match_rule_supported(Op_AryEq)) return NULL; |
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
411 break; |
0 | 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; | |
12330
29bdcf12457c
8014447: Object.hashCode intrinsic breaks inline caches
shade
parents:
12323
diff
changeset
|
421 does_virtual_dispatch = true; |
0 | 422 break; |
423 case vmIntrinsics::_clone: | |
12330
29bdcf12457c
8014447: Object.hashCode intrinsic breaks inline caches
shade
parents:
12323
diff
changeset
|
424 does_virtual_dispatch = true; |
0 | 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; | |
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
431 case vmIntrinsics::_encodeISOArray: |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
432 if (!SpecialEncodeISOArray) return NULL; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
433 if (!Matcher::match_rule_supported(Op_EncodeISOArray)) return NULL; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
434 break; |
0 | 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; | |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
442 if (SystemDictionary::reflect_CallerSensitive_klass() == NULL) return NULL; |
0 | 443 break; |
444 | |
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
445 case vmIntrinsics::_bitCount_i: |
5934
61b82be3b1ff
7152957: VM crashes with assert(false) failed: bad AD file
never
parents:
5927
diff
changeset
|
446 if (!Matcher::match_rule_supported(Op_PopCountI)) return NULL; |
5927
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
447 break; |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
448 |
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
449 case vmIntrinsics::_bitCount_l: |
5934
61b82be3b1ff
7152957: VM crashes with assert(false) failed: bad AD file
never
parents:
5927
diff
changeset
|
450 if (!Matcher::match_rule_supported(Op_PopCountL)) return NULL; |
5927
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
451 break; |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
452 |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
453 case vmIntrinsics::_numberOfLeadingZeros_i: |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
454 if (!Matcher::match_rule_supported(Op_CountLeadingZerosI)) return NULL; |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
455 break; |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
456 |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
457 case vmIntrinsics::_numberOfLeadingZeros_l: |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
458 if (!Matcher::match_rule_supported(Op_CountLeadingZerosL)) return NULL; |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
459 break; |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
460 |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
461 case vmIntrinsics::_numberOfTrailingZeros_i: |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
462 if (!Matcher::match_rule_supported(Op_CountTrailingZerosI)) return NULL; |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
463 break; |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
464 |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
465 case vmIntrinsics::_numberOfTrailingZeros_l: |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
466 if (!Matcher::match_rule_supported(Op_CountTrailingZerosL)) return NULL; |
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
467 break; |
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
468 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
469 case vmIntrinsics::_reverseBytes_c: |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
470 if (!Matcher::match_rule_supported(Op_ReverseBytesUS)) return NULL; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
471 break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
472 case vmIntrinsics::_reverseBytes_s: |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
473 if (!Matcher::match_rule_supported(Op_ReverseBytesS)) return NULL; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
474 break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
475 case vmIntrinsics::_reverseBytes_i: |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
476 if (!Matcher::match_rule_supported(Op_ReverseBytesI)) return NULL; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
477 break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
478 case vmIntrinsics::_reverseBytes_l: |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
479 if (!Matcher::match_rule_supported(Op_ReverseBytesL)) return NULL; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
480 break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
481 |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
482 case vmIntrinsics::_Reference_get: |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
483 // Use the intrinsic version of Reference.get() so that the value in |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
484 // the referent field can be registered by the G1 pre-barrier code. |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
485 // Also add memory barrier to prevent commoning reads from this field |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
486 // across safepoint since GC can change it value. |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
487 break; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
488 |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
489 case vmIntrinsics::_compareAndSwapObject: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
490 #ifdef _LP64 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
491 if (!UseCompressedOops && !Matcher::match_rule_supported(Op_CompareAndSwapP)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
492 #endif |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
493 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
494 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
495 case vmIntrinsics::_compareAndSwapLong: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
496 if (!Matcher::match_rule_supported(Op_CompareAndSwapL)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
497 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
498 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
499 case vmIntrinsics::_getAndAddInt: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
500 if (!Matcher::match_rule_supported(Op_GetAndAddI)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
501 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
502 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
503 case vmIntrinsics::_getAndAddLong: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
504 if (!Matcher::match_rule_supported(Op_GetAndAddL)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
505 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
506 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
507 case vmIntrinsics::_getAndSetInt: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
508 if (!Matcher::match_rule_supported(Op_GetAndSetI)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
509 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
510 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
511 case vmIntrinsics::_getAndSetLong: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
512 if (!Matcher::match_rule_supported(Op_GetAndSetL)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
513 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
514 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
515 case vmIntrinsics::_getAndSetObject: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
516 #ifdef _LP64 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
517 if (!UseCompressedOops && !Matcher::match_rule_supported(Op_GetAndSetP)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
518 if (UseCompressedOops && !Matcher::match_rule_supported(Op_GetAndSetN)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
519 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
520 #else |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
521 if (!Matcher::match_rule_supported(Op_GetAndSetP)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
522 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
523 #endif |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
524 |
6894 | 525 case vmIntrinsics::_aescrypt_encryptBlock: |
526 case vmIntrinsics::_aescrypt_decryptBlock: | |
527 if (!UseAESIntrinsics) return NULL; | |
528 break; | |
529 | |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
530 case vmIntrinsics::_multiplyToLen: |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
531 if (!UseMultiplyToLenIntrinsic) return NULL; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
532 break; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
533 |
23885
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
534 case vmIntrinsics::_squareToLen: |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
535 if (!UseSquareToLenIntrinsic) return NULL; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
536 break; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
537 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
538 case vmIntrinsics::_mulAdd: |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
539 if (!UseMulAddIntrinsic) return NULL; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
540 break; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
541 |
23886
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
542 case vmIntrinsics::_montgomeryMultiply: |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
543 if (!UseMontgomeryMultiplyIntrinsic) return NULL; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
544 break; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
545 case vmIntrinsics::_montgomerySquare: |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
546 if (!UseMontgomerySquareIntrinsic) return NULL; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
547 break; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
548 |
6894 | 549 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: |
550 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
551 if (!UseAESIntrinsics) return NULL; | |
552 // these two require the predicated logic | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
553 predicates = 1; |
6894 | 554 break; |
555 | |
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
556 case vmIntrinsics::_sha_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
557 if (!UseSHA1Intrinsics) return NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
558 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
559 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
560 case vmIntrinsics::_sha2_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
561 if (!UseSHA256Intrinsics) return NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
562 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
563 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
564 case vmIntrinsics::_sha5_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
565 if (!UseSHA512Intrinsics) return NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
566 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
567 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
568 case vmIntrinsics::_digestBase_implCompressMB: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
569 if (!(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics)) return NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
570 predicates = 3; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
571 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
572 |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
573 case vmIntrinsics::_updateCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
574 case vmIntrinsics::_updateBytesCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
575 case vmIntrinsics::_updateByteBufferCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
576 if (!UseCRC32Intrinsics) return NULL; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
577 break; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
578 |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
579 case vmIntrinsics::_incrementExactI: |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
580 case vmIntrinsics::_addExactI: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
581 if (!Matcher::match_rule_supported(Op_OverflowAddI) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
582 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
583 case vmIntrinsics::_incrementExactL: |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
584 case vmIntrinsics::_addExactL: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
585 if (!Matcher::match_rule_supported(Op_OverflowAddL) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
586 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
587 case vmIntrinsics::_decrementExactI: |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
588 case vmIntrinsics::_subtractExactI: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
589 if (!Matcher::match_rule_supported(Op_OverflowSubI) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
590 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
591 case vmIntrinsics::_decrementExactL: |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
592 case vmIntrinsics::_subtractExactL: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
593 if (!Matcher::match_rule_supported(Op_OverflowSubL) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
594 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
595 case vmIntrinsics::_negateExactI: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
596 if (!Matcher::match_rule_supported(Op_OverflowSubI) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
597 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
598 case vmIntrinsics::_negateExactL: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
599 if (!Matcher::match_rule_supported(Op_OverflowSubL) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
600 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
601 case vmIntrinsics::_multiplyExactI: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
602 if (!Matcher::match_rule_supported(Op_OverflowMulI) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
603 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
604 case vmIntrinsics::_multiplyExactL: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
605 if (!Matcher::match_rule_supported(Op_OverflowMulL) || !UseMathExactIntrinsics) return NULL; |
12323 | 606 break; |
607 | |
0 | 608 default: |
856
75596850f863
6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents:
851
diff
changeset
|
609 assert(id <= vmIntrinsics::LAST_COMPILER_INLINE, "caller responsibility"); |
75596850f863
6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents:
851
diff
changeset
|
610 assert(id != vmIntrinsics::_Object_init && id != vmIntrinsics::_invoke, "enum out of order?"); |
0 | 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 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
639 return new LibraryIntrinsic(m, is_virtual, predicates, does_virtual_dispatch, (vmIntrinsics::ID) id); |
0 | 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 | |
20327
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
20313
diff
changeset
|
648 JVMState* LibraryIntrinsic::generate(JVMState* jvms) { |
0 | 649 LibraryCallKit kit(jvms, this); |
650 Compile* C = kit.C; | |
651 int nodes = C->unique(); | |
652 #ifndef PRODUCT | |
12295 | 653 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
0 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
659 ciMethod* callee = kit.callee(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
660 const int bci = kit.bci(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
661 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
662 // Try to inline the intrinsic. |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
663 if (kit.try_to_inline(_last_predicate)) { |
12295 | 664 if (C->print_intrinsics() || C->print_inlining()) { |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
665 C->print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual)" : "(intrinsic)"); |
0 | 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 } | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
674 // Push the result from the inlined method onto the stack. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
675 kit.push_result(); |
0 | 676 return kit.transfer_exceptions_into_jvms(); |
677 } | |
678 | |
5927
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
679 // The intrinsic bailed out |
12295 | 680 if (C->print_intrinsics() || C->print_inlining()) { |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
681 if (jvms->has_method()) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
682 // Not a root compile. |
5927
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
683 const char* msg = is_virtual() ? "failed to inline (intrinsic, virtual)" : "failed to inline (intrinsic)"; |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
684 C->print_inlining(callee, jvms->depth() - 1, bci, msg); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
685 } else { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
686 // Root compile |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
687 tty->print("Did not generate intrinsic %s%s at bci:%d in", |
856
75596850f863
6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents:
851
diff
changeset
|
688 vmIntrinsics::name_at(intrinsic_id()), |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
689 (is_virtual() ? " (virtual)" : ""), bci); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
690 } |
0 | 691 } |
692 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed); | |
693 return NULL; | |
694 } | |
695 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
696 Node* LibraryIntrinsic::generate_predicate(JVMState* jvms, int predicate) { |
6894 | 697 LibraryCallKit kit(jvms, this); |
698 Compile* C = kit.C; | |
699 int nodes = C->unique(); | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
700 _last_predicate = predicate; |
6894 | 701 #ifndef PRODUCT |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
702 assert(is_predicated() && predicate < predicates_count(), "sanity"); |
12295 | 703 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
6894 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
709 ciMethod* callee = kit.callee(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
710 const int bci = kit.bci(); |
6894 | 711 |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
712 Node* slow_ctl = kit.try_to_predicate(predicate); |
6894 | 713 if (!kit.failing()) { |
12295 | 714 if (C->print_intrinsics() || C->print_inlining()) { |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
715 C->print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual, predicate)" : "(intrinsic, predicate)"); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
716 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
717 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked); |
6894 | 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 | |
12295 | 728 if (C->print_intrinsics() || C->print_inlining()) { |
6894 | 729 if (jvms->has_method()) { |
730 // Not a root compile. | |
731 const char* msg = "failed to generate predicate for intrinsic"; | |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
732 C->print_inlining(kit.callee(), jvms->depth() - 1, bci, msg); |
6894 | 733 } else { |
734 // Root compile | |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
735 C->print_inlining_stream()->print("Did not generate predicate for intrinsic %s%s at bci:%d in", |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
736 vmIntrinsics::name_at(intrinsic_id()), |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
737 (is_virtual() ? " (virtual)" : ""), bci); |
6894 | 738 } |
739 } | |
740 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed); | |
741 return NULL; | |
742 } | |
743 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
744 bool LibraryCallKit::try_to_inline(int predicate) { |
0 | 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; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
749 const bool is_volatile = true; |
0 | 750 |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
751 if (!jvms()->has_method()) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
752 // Root JVMState has a null method. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
753 assert(map()->memory()->Opcode() == Op_Parm, ""); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
754 // Insert the memory aliasing node |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
755 set_all_memory(reset_memory()); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
756 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
757 assert(merged_memory(), ""); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
758 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
759 |
0 | 760 switch (intrinsic_id()) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
761 case vmIntrinsics::_hashCode: return inline_native_hashcode(intrinsic()->is_virtual(), !is_static); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
762 case vmIntrinsics::_identityHashCode: return inline_native_hashcode(/*!virtual*/ false, is_static); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
763 case vmIntrinsics::_getClass: return inline_native_getClass(); |
0 | 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: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
774 case vmIntrinsics::_dpow: return inline_math_native(intrinsic_id()); |
0 | 775 |
776 case vmIntrinsics::_min: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
777 case vmIntrinsics::_max: return inline_min_max(intrinsic_id()); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
778 |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
779 case vmIntrinsics::_addExactI: return inline_math_addExactI(false /* add */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
780 case vmIntrinsics::_addExactL: return inline_math_addExactL(false /* add */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
781 case vmIntrinsics::_decrementExactI: return inline_math_subtractExactI(true /* decrement */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
782 case vmIntrinsics::_decrementExactL: return inline_math_subtractExactL(true /* decrement */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
783 case vmIntrinsics::_incrementExactI: return inline_math_addExactI(true /* increment */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
784 case vmIntrinsics::_incrementExactL: return inline_math_addExactL(true /* increment */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
785 case vmIntrinsics::_multiplyExactI: return inline_math_multiplyExactI(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
786 case vmIntrinsics::_multiplyExactL: return inline_math_multiplyExactL(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
787 case vmIntrinsics::_negateExactI: return inline_math_negateExactI(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
788 case vmIntrinsics::_negateExactL: return inline_math_negateExactL(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
789 case vmIntrinsics::_subtractExactI: return inline_math_subtractExactI(false /* subtract */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
790 case vmIntrinsics::_subtractExactL: return inline_math_subtractExactL(false /* subtract */); |
12323 | 791 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
792 case vmIntrinsics::_arraycopy: return inline_arraycopy(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
793 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
794 case vmIntrinsics::_compareTo: return inline_string_compareTo(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
795 case vmIntrinsics::_indexOf: return inline_string_indexOf(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
796 case vmIntrinsics::_equals: return inline_string_equals(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
797 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
798 case vmIntrinsics::_getObject: return inline_unsafe_access(!is_native_ptr, !is_store, T_OBJECT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
799 case vmIntrinsics::_getBoolean: return inline_unsafe_access(!is_native_ptr, !is_store, T_BOOLEAN, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
800 case vmIntrinsics::_getByte: return inline_unsafe_access(!is_native_ptr, !is_store, T_BYTE, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
801 case vmIntrinsics::_getShort: return inline_unsafe_access(!is_native_ptr, !is_store, T_SHORT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
802 case vmIntrinsics::_getChar: return inline_unsafe_access(!is_native_ptr, !is_store, T_CHAR, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
803 case vmIntrinsics::_getInt: return inline_unsafe_access(!is_native_ptr, !is_store, T_INT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
804 case vmIntrinsics::_getLong: return inline_unsafe_access(!is_native_ptr, !is_store, T_LONG, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
805 case vmIntrinsics::_getFloat: return inline_unsafe_access(!is_native_ptr, !is_store, T_FLOAT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
806 case vmIntrinsics::_getDouble: return inline_unsafe_access(!is_native_ptr, !is_store, T_DOUBLE, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
807 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
808 case vmIntrinsics::_putObject: return inline_unsafe_access(!is_native_ptr, is_store, T_OBJECT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
809 case vmIntrinsics::_putBoolean: return inline_unsafe_access(!is_native_ptr, is_store, T_BOOLEAN, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
810 case vmIntrinsics::_putByte: return inline_unsafe_access(!is_native_ptr, is_store, T_BYTE, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
811 case vmIntrinsics::_putShort: return inline_unsafe_access(!is_native_ptr, is_store, T_SHORT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
812 case vmIntrinsics::_putChar: return inline_unsafe_access(!is_native_ptr, is_store, T_CHAR, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
813 case vmIntrinsics::_putInt: return inline_unsafe_access(!is_native_ptr, is_store, T_INT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
814 case vmIntrinsics::_putLong: return inline_unsafe_access(!is_native_ptr, is_store, T_LONG, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
815 case vmIntrinsics::_putFloat: return inline_unsafe_access(!is_native_ptr, is_store, T_FLOAT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
816 case vmIntrinsics::_putDouble: return inline_unsafe_access(!is_native_ptr, is_store, T_DOUBLE, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
817 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
818 case vmIntrinsics::_getByte_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_BYTE, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
819 case vmIntrinsics::_getShort_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_SHORT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
820 case vmIntrinsics::_getChar_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_CHAR, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
821 case vmIntrinsics::_getInt_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_INT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
822 case vmIntrinsics::_getLong_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_LONG, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
823 case vmIntrinsics::_getFloat_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_FLOAT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
824 case vmIntrinsics::_getDouble_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_DOUBLE, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
825 case vmIntrinsics::_getAddress_raw: return inline_unsafe_access( is_native_ptr, !is_store, T_ADDRESS, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
826 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
827 case vmIntrinsics::_putByte_raw: return inline_unsafe_access( is_native_ptr, is_store, T_BYTE, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
828 case vmIntrinsics::_putShort_raw: return inline_unsafe_access( is_native_ptr, is_store, T_SHORT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
829 case vmIntrinsics::_putChar_raw: return inline_unsafe_access( is_native_ptr, is_store, T_CHAR, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
830 case vmIntrinsics::_putInt_raw: return inline_unsafe_access( is_native_ptr, is_store, T_INT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
831 case vmIntrinsics::_putLong_raw: return inline_unsafe_access( is_native_ptr, is_store, T_LONG, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
832 case vmIntrinsics::_putFloat_raw: return inline_unsafe_access( is_native_ptr, is_store, T_FLOAT, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
833 case vmIntrinsics::_putDouble_raw: return inline_unsafe_access( is_native_ptr, is_store, T_DOUBLE, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
834 case vmIntrinsics::_putAddress_raw: return inline_unsafe_access( is_native_ptr, is_store, T_ADDRESS, !is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
835 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
836 case vmIntrinsics::_getObjectVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_OBJECT, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
837 case vmIntrinsics::_getBooleanVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_BOOLEAN, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
838 case vmIntrinsics::_getByteVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_BYTE, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
839 case vmIntrinsics::_getShortVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_SHORT, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
840 case vmIntrinsics::_getCharVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_CHAR, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
841 case vmIntrinsics::_getIntVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_INT, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
842 case vmIntrinsics::_getLongVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_LONG, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
843 case vmIntrinsics::_getFloatVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_FLOAT, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
844 case vmIntrinsics::_getDoubleVolatile: return inline_unsafe_access(!is_native_ptr, !is_store, T_DOUBLE, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
845 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
846 case vmIntrinsics::_putObjectVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_OBJECT, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
847 case vmIntrinsics::_putBooleanVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_BOOLEAN, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
848 case vmIntrinsics::_putByteVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_BYTE, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
849 case vmIntrinsics::_putShortVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_SHORT, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
850 case vmIntrinsics::_putCharVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_CHAR, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
851 case vmIntrinsics::_putIntVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_INT, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
852 case vmIntrinsics::_putLongVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_LONG, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
853 case vmIntrinsics::_putFloatVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_FLOAT, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
854 case vmIntrinsics::_putDoubleVolatile: return inline_unsafe_access(!is_native_ptr, is_store, T_DOUBLE, is_volatile); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
855 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
856 case vmIntrinsics::_prefetchRead: return inline_unsafe_prefetch(!is_native_ptr, !is_store, !is_static); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
857 case vmIntrinsics::_prefetchWrite: return inline_unsafe_prefetch(!is_native_ptr, is_store, !is_static); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
858 case vmIntrinsics::_prefetchReadStatic: return inline_unsafe_prefetch(!is_native_ptr, !is_store, is_static); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
859 case vmIntrinsics::_prefetchWriteStatic: return inline_unsafe_prefetch(!is_native_ptr, is_store, is_static); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
860 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
861 case vmIntrinsics::_compareAndSwapObject: return inline_unsafe_load_store(T_OBJECT, LS_cmpxchg); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
862 case vmIntrinsics::_compareAndSwapInt: return inline_unsafe_load_store(T_INT, LS_cmpxchg); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
863 case vmIntrinsics::_compareAndSwapLong: return inline_unsafe_load_store(T_LONG, LS_cmpxchg); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
864 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
865 case vmIntrinsics::_putOrderedObject: return inline_unsafe_ordered_store(T_OBJECT); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
866 case vmIntrinsics::_putOrderedInt: return inline_unsafe_ordered_store(T_INT); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
867 case vmIntrinsics::_putOrderedLong: return inline_unsafe_ordered_store(T_LONG); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
868 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
869 case vmIntrinsics::_getAndAddInt: return inline_unsafe_load_store(T_INT, LS_xadd); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
870 case vmIntrinsics::_getAndAddLong: return inline_unsafe_load_store(T_LONG, LS_xadd); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
871 case vmIntrinsics::_getAndSetInt: return inline_unsafe_load_store(T_INT, LS_xchg); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
872 case vmIntrinsics::_getAndSetLong: return inline_unsafe_load_store(T_LONG, LS_xchg); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
873 case vmIntrinsics::_getAndSetObject: return inline_unsafe_load_store(T_OBJECT, LS_xchg); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
874 |
7425 | 875 case vmIntrinsics::_loadFence: |
876 case vmIntrinsics::_storeFence: | |
877 case vmIntrinsics::_fullFence: return inline_unsafe_fence(intrinsic_id()); | |
878 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
879 case vmIntrinsics::_currentThread: return inline_native_currentThread(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
880 case vmIntrinsics::_isInterrupted: return inline_native_isInterrupted(); |
0 | 881 |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
882 #ifdef TRACE_HAVE_INTRINSICS |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
883 case vmIntrinsics::_classID: return inline_native_classID(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
884 case vmIntrinsics::_threadID: return inline_native_threadID(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
885 case vmIntrinsics::_counterTime: return inline_native_time_funcs(CAST_FROM_FN_PTR(address, TRACE_TIME_METHOD), "counterTime"); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
886 #endif |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
887 case vmIntrinsics::_currentTimeMillis: return inline_native_time_funcs(CAST_FROM_FN_PTR(address, os::javaTimeMillis), "currentTimeMillis"); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
888 case vmIntrinsics::_nanoTime: return inline_native_time_funcs(CAST_FROM_FN_PTR(address, os::javaTimeNanos), "nanoTime"); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
889 case vmIntrinsics::_allocateInstance: return inline_unsafe_allocate(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
890 case vmIntrinsics::_copyMemory: return inline_unsafe_copyMemory(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
891 case vmIntrinsics::_newArray: return inline_native_newArray(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
892 case vmIntrinsics::_getLength: return inline_native_getLength(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
893 case vmIntrinsics::_copyOf: return inline_array_copyOf(false); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
894 case vmIntrinsics::_copyOfRange: return inline_array_copyOf(true); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
895 case vmIntrinsics::_equalsC: return inline_array_equals(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
896 case vmIntrinsics::_clone: return inline_native_clone(intrinsic()->is_virtual()); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
897 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
898 case vmIntrinsics::_isAssignableFrom: return inline_native_subtype_check(); |
0 | 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: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
907 case vmIntrinsics::_getClassAccessFlags: return inline_native_Class_query(intrinsic_id()); |
0 | 908 |
909 case vmIntrinsics::_floatToRawIntBits: | |
910 case vmIntrinsics::_floatToIntBits: | |
911 case vmIntrinsics::_intBitsToFloat: | |
912 case vmIntrinsics::_doubleToRawLongBits: | |
913 case vmIntrinsics::_doubleToLongBits: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
914 case vmIntrinsics::_longBitsToDouble: return inline_fp_conversions(intrinsic_id()); |
0 | 915 |
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
916 case vmIntrinsics::_numberOfLeadingZeros_i: |
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
917 case vmIntrinsics::_numberOfLeadingZeros_l: |
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
918 case vmIntrinsics::_numberOfTrailingZeros_i: |
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
919 case vmIntrinsics::_numberOfTrailingZeros_l: |
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
920 case vmIntrinsics::_bitCount_i: |
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
921 case vmIntrinsics::_bitCount_l: |
0 | 922 case vmIntrinsics::_reverseBytes_i: |
923 case vmIntrinsics::_reverseBytes_l: | |
1396
d7f654633cfe
6946040: add intrinsic for short and char reverseBytes
never
parents:
1152
diff
changeset
|
924 case vmIntrinsics::_reverseBytes_s: |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
925 case vmIntrinsics::_reverseBytes_c: return inline_number_methods(intrinsic_id()); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
926 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
927 case vmIntrinsics::_getCallerClass: return inline_native_Reflection_getCallerClass(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
928 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
929 case vmIntrinsics::_Reference_get: return inline_reference_get(); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
930 |
6894 | 931 case vmIntrinsics::_aescrypt_encryptBlock: |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
932 case vmIntrinsics::_aescrypt_decryptBlock: return inline_aescrypt_Block(intrinsic_id()); |
6894 | 933 |
934 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
935 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
936 return inline_cipherBlockChaining_AESCrypt(intrinsic_id()); | |
937 | |
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
938 case vmIntrinsics::_sha_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
939 case vmIntrinsics::_sha2_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
940 case vmIntrinsics::_sha5_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
941 return inline_sha_implCompress(intrinsic_id()); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
942 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
943 case vmIntrinsics::_digestBase_implCompressMB: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
944 return inline_digestBase_implCompressMB(predicate); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
945 |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
946 case vmIntrinsics::_multiplyToLen: |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
947 return inline_multiplyToLen(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
948 |
23885
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
949 case vmIntrinsics::_squareToLen: |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
950 return inline_squareToLen(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
951 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
952 case vmIntrinsics::_mulAdd: |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
953 return inline_mulAdd(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
954 |
23886
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
955 case vmIntrinsics::_montgomeryMultiply: |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
956 return inline_montgomeryMultiply(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
957 case vmIntrinsics::_montgomerySquare: |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
958 return inline_montgomerySquare(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
959 |
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
960 case vmIntrinsics::_encodeISOArray: |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
961 return inline_encodeISOArray(); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
962 |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
963 case vmIntrinsics::_updateCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
964 return inline_updateCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
965 case vmIntrinsics::_updateBytesCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
966 return inline_updateBytesCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
967 case vmIntrinsics::_updateByteBufferCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
968 return inline_updateByteBufferCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
969 |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
970 case vmIntrinsics::_profileBoolean: |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
971 return inline_profileBoolean(); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
972 |
0 | 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 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
986 Node* LibraryCallKit::try_to_predicate(int predicate) { |
6894 | 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); | |
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
1000 case vmIntrinsics::_digestBase_implCompressMB: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
1001 return inline_digestBase_implCompressMB_predicate(predicate); |
6894 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1018 //------------------------------set_result------------------------------- |
0 | 1019 // Helper function for finishing intrinsics. |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1020 void LibraryCallKit::set_result(RegionNode* region, PhiNode* value) { |
0 | 1021 record_for_igvn(region); |
1022 set_control(_gvn.transform(region)); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1023 set_result( _gvn.transform(value)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1024 assert(value->type()->basic_type() == result()->bottom_type()->basic_type(), "sanity"); |
0 | 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 | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1052 Node* if_slow = _gvn.transform(new (C) IfTrueNode(iff)); |
0 | 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 | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1061 Node* if_fast = _gvn.transform(new (C) IfFalseNode(iff)); |
0 | 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 | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1080 Node* cmp_lt = _gvn.transform(new (C) CmpINode(index, intcon(0))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1081 Node* bol_lt = _gvn.transform(new (C) BoolNode(cmp_lt, BoolTest::lt)); |
0 | 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. | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1085 Node* ccast = new (C) CastIINode(index, TypeInt::POS); |
0 | 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 | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1098 Node* cmp_le = _gvn.transform(new (C) CmpINode(index, intcon(0))); |
0 | 1099 BoolTest::mask le_or_eq = (never_negative ? BoolTest::eq : BoolTest::le); |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1100 Node* bol_le = _gvn.transform(new (C) BoolNode(cmp_le, le_or_eq)); |
0 | 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. | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1104 Node* ccast = new (C) CastIINode(index, TypeInt::POS1); |
0 | 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; | |
4778 | 1132 if (zero_offset && subseq_length->eqv_uncast(array_length)) |
0 | 1133 return NULL; // common case of whole-array copy |
1134 Node* last = subseq_length; | |
1135 if (!zero_offset) // last += offset | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1136 last = _gvn.transform(new (C) AddINode(last, offset)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1137 Node* cmp_lt = _gvn.transform(new (C) CmpUNode(array_length, last)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1138 Node* bol_lt = _gvn.transform(new (C) BoolNode(cmp_lt, BoolTest::lt)); |
0 | 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); | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1148 Node* thread = _gvn.transform(new (C) ThreadLocalNode()); |
0 | 1149 Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(JavaThread::threadObj_offset())); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
1150 Node* threadObj = make_load(NULL, p, thread_type, T_OBJECT, MemNode::unordered); |
0 | 1151 tls_output = thread; |
1152 return threadObj; | |
1153 } | |
1154 | |
1155 | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1156 //------------------------------make_string_method_node------------------------ |
6057 | 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) { | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1161 Node* no_ctrl = NULL; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1162 |
6057 | 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); | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1166 Node* str1_start = array_element_address(str1_value, str1_offset, T_CHAR); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1167 |
6057 | 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); | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1173 Node* str2_start = array_element_address(str2_value, str2_offset, T_CHAR); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1174 |
6057 | 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 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1183 result = new (C) StrIndexOfNode(control(), memory(TypeAryPtr::CHARS), |
6057 | 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 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1190 result = new (C) StrCompNode(control(), memory(TypeAryPtr::CHARS), |
6057 | 1191 str1_start, str1_len, str2_start, str2_len); |
1192 break; | |
1193 case Op_StrEquals: | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1194 result = new (C) StrEqualsNode(control(), memory(TypeAryPtr::CHARS), |
6057 | 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) { | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1213 Node* result = NULL; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1214 switch (opcode) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1215 case Op_StrIndexOf: |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1216 result = new (C) StrIndexOfNode(control(), memory(TypeAryPtr::CHARS), |
6057 | 1217 str1_start, cnt1, str2_start, cnt2); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1218 break; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1219 case Op_StrComp: |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1220 result = new (C) StrCompNode(control(), memory(TypeAryPtr::CHARS), |
6057 | 1221 str1_start, cnt1, str2_start, cnt2); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1222 break; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1223 case Op_StrEquals: |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1224 result = new (C) StrEqualsNode(control(), memory(TypeAryPtr::CHARS), |
6057 | 1225 str1_start, str2_start, cnt1); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1226 break; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1227 default: |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1228 ShouldNotReachHere(); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1229 return NULL; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1230 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1231 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1232 // All these intrinsics have checks. |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1233 C->set_has_split_ifs(true); // Has chance for split-if optimization |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1234 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1235 return _gvn.transform(result); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1236 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1237 |
0 | 1238 //------------------------------inline_string_compareTo------------------------ |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1239 // public int java.lang.String.compareTo(String anotherString); |
0 | 1240 bool LibraryCallKit::inline_string_compareTo() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1241 Node* receiver = null_check(argument(0)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1242 Node* arg = null_check(argument(1)); |
0 | 1243 if (stopped()) { |
1244 return true; | |
1245 } | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1246 set_result(make_string_method_node(Op_StrComp, receiver, arg)); |
0 | 1247 return true; |
1248 } | |
1249 | |
681 | 1250 //------------------------------inline_string_equals------------------------ |
1251 bool LibraryCallKit::inline_string_equals() { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1252 Node* receiver = null_check_receiver(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1253 // NOTE: Do not null check argument for String.equals() because spec |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1254 // allows to specify NULL as argument. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1255 Node* argument = this->argument(1); |
681 | 1256 if (stopped()) { |
1257 return true; | |
1258 } | |
1259 | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1260 // paths (plus control) merge |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1261 RegionNode* region = new (C) RegionNode(5); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1262 Node* phi = new (C) PhiNode(region, TypeInt::BOOL); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1263 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1264 // does source == target string? |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1265 Node* cmp = _gvn.transform(new (C) CmpPNode(receiver, argument)); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1266 Node* bol = _gvn.transform(new (C) BoolNode(cmp, BoolTest::eq)); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1267 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1268 Node* if_eq = generate_slow_guard(bol, NULL); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1269 if (if_eq != NULL) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1270 // receiver == argument |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1271 phi->init_req(2, intcon(1)); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1272 region->init_req(2, if_eq); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1273 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1274 |
681 | 1275 // get String klass for instanceOf |
1276 ciInstanceKlass* klass = env()->String_klass(); | |
1277 | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1278 if (!stopped()) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1279 Node* inst = gen_instanceof(argument, makecon(TypeKlassPtr::make(klass))); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1280 Node* cmp = _gvn.transform(new (C) CmpINode(inst, intcon(1))); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1281 Node* bol = _gvn.transform(new (C) BoolNode(cmp, BoolTest::ne)); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1282 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1283 Node* inst_false = generate_guard(bol, NULL, PROB_MIN); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1284 //instanceOf == true, fallthrough |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1285 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1286 if (inst_false != NULL) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1287 phi->init_req(3, intcon(0)); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1288 region->init_req(3, inst_false); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1289 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1290 } |
681 | 1291 |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1292 if (!stopped()) { |
6057 | 1293 const TypeOopPtr* string_type = TypeOopPtr::make_from_klass(klass); |
1294 | |
1496
e8e83be27dd7
6951190: assert(!klass_is_exact(),"only non-exact klass") while building JDK
never
parents:
1396
diff
changeset
|
1295 // Properly cast the argument to String |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1296 argument = _gvn.transform(new (C) CheckCastPPNode(control(), argument, string_type)); |
3337
e6d7eed3330c
7041100: The load in String.equals intrinsic executed before null check
kvn
parents:
3284
diff
changeset
|
1297 // This path is taken only when argument's type is String:NotNull. |
e6d7eed3330c
7041100: The load in String.equals intrinsic executed before null check
kvn
parents:
3284
diff
changeset
|
1298 argument = cast_not_null(argument, false); |
1496
e8e83be27dd7
6951190: assert(!klass_is_exact(),"only non-exact klass") while building JDK
never
parents:
1396
diff
changeset
|
1299 |
6057 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1311 Node* argument_val = load_String_value(no_ctrl, argument); |
6057 | 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); | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1317 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1318 // Check for receiver count != argument count |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1319 Node* cmp = _gvn.transform(new(C) CmpINode(receiver_cnt, argument_cnt)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1320 Node* bol = _gvn.transform(new(C) BoolNode(cmp, BoolTest::ne)); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1321 Node* if_ne = generate_slow_guard(bol, NULL); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1322 if (if_ne != NULL) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1323 phi->init_req(4, intcon(0)); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1324 region->init_req(4, if_ne); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1325 } |
6057 | 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 } | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1334 } |
681 | 1335 |
1336 // post merge | |
1337 set_control(_gvn.transform(region)); | |
1338 record_for_igvn(region); | |
1339 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1340 set_result(_gvn.transform(phi)); |
681 | 1341 return true; |
1342 } | |
1343 | |
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1344 //------------------------------inline_array_equals---------------------------- |
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1345 bool LibraryCallKit::inline_array_equals() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1346 Node* arg1 = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1347 Node* arg2 = argument(1); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1348 set_result(_gvn.transform(new (C) AryEqNode(control(), memory(TypeAryPtr::CHARS), arg1, arg2))); |
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1349 return true; |
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1350 } |
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1351 |
0 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1420 const int nargs = 0; // no arguments to push back for uncommon trap in predicate |
2383
9dc311b8473e
7008866: Missing loop predicate for loop with multiple entries
kvn
parents:
2324
diff
changeset
|
1421 |
6057 | 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); | |
0 | 1425 |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1426 Node* target = _gvn.transform( makecon(TypeOopPtr::make_from_constant(target_array, true))); |
0 | 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 | |
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12169
diff
changeset
|
1431 // String.value field is known to be @Stable. |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12169
diff
changeset
|
1432 if (UseImplicitStableValues) { |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12169
diff
changeset
|
1433 target = cast_array_to_stable(target, target_type); |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12169
diff
changeset
|
1434 } |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12169
diff
changeset
|
1435 |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
1436 IdealKit kit(this, false, true); |
0 | 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 | |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1448 IdealVariable rtn(kit), i(kit), j(kit); __ declarations_done(); |
0 | 1449 Node* outer_loop = __ make_label(2 /* goto */); |
1450 Node* return_ = __ make_label(1); | |
1451 | |
1452 __ set(rtn,__ ConI(-1)); | |
2383
9dc311b8473e
7008866: Missing loop predicate for loop with multiple entries
kvn
parents:
2324
diff
changeset
|
1453 __ loop(this, nargs, i, sourceOffset, BoolTest::lt, sourceEnd); { |
0 | 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); { | |
2383
9dc311b8473e
7008866: Missing loop predicate for loop with multiple entries
kvn
parents:
2324
diff
changeset
|
1458 __ loop(this, nargs, j, zero, BoolTest::lt, targetCountLess1); { |
0 | 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_); | |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1485 |
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1486 // Final sync IdealKit and GraphKit. |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
1487 final_sync(kit); |
0 | 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() { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1496 Node* receiver = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1497 Node* arg = argument(1); |
681 | 1498 |
1499 Node* result; | |
1504
ae8f909e5fc7
6948602: Disable use of SSE4.2 in String.indexOf intrinsic until 6942326 is fixed
iveresov
parents:
1396
diff
changeset
|
1500 // Disable the use of pcmpestri until it can be guaranteed that |
ae8f909e5fc7
6948602: Disable use of SSE4.2 in String.indexOf intrinsic until 6942326 is fixed
iveresov
parents:
1396
diff
changeset
|
1501 // the load doesn't cross into the uncommited space. |
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1502 if (Matcher::has_match_rule(Op_StrIndexOf) && |
681 | 1503 UseSSE42Intrinsics) { |
1504 // Generate SSE4.2 version of indexOf | |
1505 // We currently only have match rules that use SSE4.2 | |
1506 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1507 receiver = null_check(receiver); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1508 arg = null_check(arg); |
681 | 1509 if (stopped()) { |
1510 return true; | |
1511 } | |
1512 | |
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1513 ciInstanceKlass* str_klass = env()->String_klass(); |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1514 const TypeOopPtr* string_type = TypeOopPtr::make_from_klass(str_klass); |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1515 |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1516 // Make the merge point |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1517 RegionNode* result_rgn = new (C) RegionNode(4); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1518 Node* result_phi = new (C) PhiNode(result_rgn, TypeInt::INT); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1519 Node* no_ctrl = NULL; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1520 |
6057 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1530 Node* substr = load_String_value(no_ctrl, arg); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1531 Node* substr_offset = load_String_offset(no_ctrl, arg); |
6057 | 1532 Node* substr_start = array_element_address(substr, substr_offset, T_CHAR); |
1533 | |
1534 // Get length of source string | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1535 Node* substr_cnt = load_String_length(no_ctrl, arg); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1536 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1537 // Check for substr count > string count |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1538 Node* cmp = _gvn.transform(new(C) CmpINode(substr_cnt, source_cnt)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1539 Node* bol = _gvn.transform(new(C) BoolNode(cmp, BoolTest::gt)); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1540 Node* if_gt = generate_slow_guard(bol, NULL); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1541 if (if_gt != NULL) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1542 result_phi->init_req(2, intcon(-1)); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1543 result_rgn->init_req(2, if_gt); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1544 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1545 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1546 if (!stopped()) { |
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1547 // Check for substr count == 0 |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1548 cmp = _gvn.transform(new(C) CmpINode(substr_cnt, intcon(0))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1549 bol = _gvn.transform(new(C) BoolNode(cmp, BoolTest::eq)); |
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1550 Node* if_zero = generate_slow_guard(bol, NULL); |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1551 if (if_zero != NULL) { |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1552 result_phi->init_req(3, intcon(0)); |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1553 result_rgn->init_req(3, if_zero); |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1554 } |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1555 } |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1556 |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1557 if (!stopped()) { |
6057 | 1558 result = make_string_method_node(Op_StrIndexOf, source_start, source_cnt, substr_start, substr_cnt); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1559 result_phi->init_req(1, result); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1560 result_rgn->init_req(1, control()); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1561 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1562 set_control(_gvn.transform(result_rgn)); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1563 record_for_igvn(result_rgn); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1564 result = _gvn.transform(result_phi); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1565 |
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1566 } else { // Use LibraryCallKit::string_indexOf |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1567 // don't intrinsify if argument isn't a constant string. |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1568 if (!arg->is_Con()) { |
681 | 1569 return false; |
1570 } | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1571 const TypeOopPtr* str_type = _gvn.type(arg)->isa_oopptr(); |
681 | 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 | |
6057 | 1583 ciObject* v = str->field_value_by_offset(java_lang_String::value_offset_in_bytes()).as_object(); |
681 | 1584 ciTypeArray* pat = v->as_type_array(); // pattern (argument) character array |
1585 | |
6057 | 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 | |
681 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1602 receiver = null_check(receiver, T_OBJECT); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1603 // NOTE: No null check on the argument is needed since it's a constant String oop. |
681 | 1604 if (stopped()) { |
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1605 return true; |
681 | 1606 } |
1607 | |
1608 // The null string as a pattern always returns 0 (match at beginning of string) | |
1609 if (c == 0) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1610 set_result(intcon(0)); |
681 | 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); | |
0 | 1632 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1633 set_result(result); |
0 | 1634 return true; |
1635 } | |
1636 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1637 //--------------------------round_double_node-------------------------------- |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1638 // Round a double node if necessary. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1639 Node* LibraryCallKit::round_double_node(Node* n) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1640 if (Matcher::strict_fp_requires_explicit_rounding && UseSSE <= 1) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1641 n = _gvn.transform(new (C) RoundDoubleNode(0, n)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1642 return n; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1643 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1644 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1645 //------------------------------inline_math----------------------------------- |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1646 // public static double Math.abs(double) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1647 // public static double Math.sqrt(double) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1648 // public static double Math.log(double) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1649 // public static double Math.log10(double) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1650 bool LibraryCallKit::inline_math(vmIntrinsics::ID id) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1651 Node* arg = round_double_node(argument(0)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1652 Node* n; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1653 switch (id) { |
8076
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1654 case vmIntrinsics::_dabs: n = new (C) AbsDNode( arg); break; |
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1655 case vmIntrinsics::_dsqrt: n = new (C) SqrtDNode(C, control(), arg); break; |
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1656 case vmIntrinsics::_dlog: n = new (C) LogDNode(C, control(), arg); break; |
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1657 case vmIntrinsics::_dlog10: n = new (C) Log10DNode(C, control(), arg); break; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1658 default: fatal_unexpected_iid(id); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1659 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1660 set_result(_gvn.transform(n)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1661 return true; |
0 | 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) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1668 Node* arg = round_double_node(argument(0)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1669 Node* n = NULL; |
0 | 1670 |
1671 switch (id) { | |
8076
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1672 case vmIntrinsics::_dsin: n = new (C) SinDNode(C, control(), arg); break; |
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1673 case vmIntrinsics::_dcos: n = new (C) CosDNode(C, control(), arg); break; |
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1674 case vmIntrinsics::_dtan: n = new (C) TanDNode(C, control(), arg); break; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1675 default: fatal_unexpected_iid(id); break; |
0 | 1676 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1677 n = _gvn.transform(n); |
0 | 1678 |
1679 // Rounding required? Check for argument reduction! | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1680 if (Matcher::strict_fp_requires_explicit_rounding) { |
0 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1715 RegionNode* r = new (C) RegionNode(3); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1716 Node* phi = new (C) PhiNode(r, Type::DOUBLE); |
0 | 1717 |
1718 // Flatten arg so we need only 1 test | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1719 Node *abs = _gvn.transform(new (C) AbsDNode(arg)); |
0 | 1720 // Node for PI/4 constant |
1721 Node *pi4 = makecon(TypeD::make(pi_4)); | |
1722 // Check PI/4 : abs(arg) | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1723 Node *cmp = _gvn.transform(new (C) CmpDNode(pi4,abs)); |
0 | 1724 // Check: If PI/4 < abs(arg) then go slow |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1725 Node *bol = _gvn.transform(new (C) BoolNode( cmp, BoolTest::lt )); |
0 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1731 phi->init_req(2, n); |
0 | 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, ""); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1753 Node* slow_result = _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1754 r->init_req(1, control()); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1755 phi->init_req(1, slow_result); |
0 | 1756 |
1757 // Post-merge | |
1758 set_control(_gvn.transform(r)); | |
1759 record_for_igvn(r); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1760 n = _gvn.transform(phi); |
0 | 1761 |
1762 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
1763 } | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1764 set_result(n); |
0 | 1765 return true; |
1766 } | |
1767 | |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1768 Node* LibraryCallKit::finish_pow_exp(Node* result, Node* x, Node* y, const TypeFunc* call_type, address funcAddr, const char* funcName) { |
6205 | 1769 //------------------- |
1770 //result=(result.isNaN())? funcAddr():result; | |
1771 // Check: If isNaN() by checking result!=result? then either trap | |
1772 // or go to runtime | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1773 Node* cmpisnan = _gvn.transform(new (C) CmpDNode(result, result)); |
6205 | 1774 // Build the boolean node |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1775 Node* bolisnum = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::eq)); |
6205 | 1776 |
1777 if (!too_many_traps(Deoptimization::Reason_intrinsic)) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1778 { BuildCutout unless(this, bolisnum, PROB_STATIC_FREQUENT); |
6205 | 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 } | |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1784 return result; |
6205 | 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); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1790 Node* if_slow = _gvn.transform(new (C) IfFalseNode(iff)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1791 Node* if_fast = _gvn.transform(new (C) IfTrueNode(iff)); |
6205 | 1792 |
1793 if (!if_slow->is_top()) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1794 RegionNode* result_region = new (C) RegionNode(3); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1795 PhiNode* result_val = new (C) PhiNode(result_region, Type::DOUBLE); |
6205 | 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); | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1806 Node* value = _gvn.transform(new (C) ProjNode(rt, TypeFunc::Parms+0)); |
6205 | 1807 #ifdef ASSERT |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1808 Node* value_top = _gvn.transform(new (C) ProjNode(rt, TypeFunc::Parms+1)); |
6205 | 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); | |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1814 set_control(_gvn.transform(result_region)); |
17923
a062c3691003
8042052: assert(t != NULL) failed: must set before get
anoll
parents:
17922
diff
changeset
|
1815 return _gvn.transform(result_val); |
6205 | 1816 } else { |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1817 return result; |
6205 | 1818 } |
1819 } | |
1820 } | |
1821 | |
0 | 1822 //------------------------------inline_exp------------------------------------- |
1823 // Inline exp instructions, if possible. The Intel hardware only misses | |
1824 // really odd corner cases (+/- Infinity). Just uncommon-trap them. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1825 bool LibraryCallKit::inline_exp() { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1826 Node* arg = round_double_node(argument(0)); |
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7637
diff
changeset
|
1827 Node* n = _gvn.transform(new (C) ExpDNode(C, control(), arg)); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1828 |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1829 n = finish_pow_exp(n, arg, NULL, OptoRuntime::Math_D_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dexp), "EXP"); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1830 set_result(n); |
0 | 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. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1838 bool LibraryCallKit::inline_pow() { |
0 | 1839 // Pseudocode for pow |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1840 // if (y == 2) { |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1841 // return x * x; |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1842 // } else { |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1843 // if (x <= 0.0) { |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1844 // long longy = (long)y; |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1845 // if ((double)longy == y) { // if y is long |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1846 // if (y + 1 == y) longy = 0; // huge number: even |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1847 // result = ((1&longy) == 0)?-DPow(abs(x), y):DPow(abs(x), y); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1848 // } else { |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1849 // result = NaN; |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1850 // } |
0 | 1851 // } else { |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1852 // result = DPow(x,y); |
0 | 1853 // } |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1854 // if (result != result)? { |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1855 // result = uncommon_trap() or runtime_call(); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1856 // } |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1857 // return result; |
0 | 1858 // } |
1859 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1860 Node* x = round_double_node(argument(0)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1861 Node* y = round_double_node(argument(2)); |
0 | 1862 |
6205 | 1863 Node* result = NULL; |
1864 | |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1865 Node* const_two_node = makecon(TypeD::make(2.0)); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1866 Node* cmp_node = _gvn.transform(new (C) CmpDNode(y, const_two_node)); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1867 Node* bool_node = _gvn.transform(new (C) BoolNode(cmp_node, BoolTest::eq)); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1868 IfNode* if_node = create_and_xform_if(control(), bool_node, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1869 Node* if_true = _gvn.transform(new (C) IfTrueNode(if_node)); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1870 Node* if_false = _gvn.transform(new (C) IfFalseNode(if_node)); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1871 |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1872 RegionNode* region_node = new (C) RegionNode(3); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1873 region_node->init_req(1, if_true); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1874 |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1875 Node* phi_node = new (C) PhiNode(region_node, Type::DOUBLE); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1876 // special case for x^y where y == 2, we can convert it to x * x |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1877 phi_node->init_req(1, _gvn.transform(new (C) MulDNode(x, x))); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1878 |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1879 // set control to if_false since we will now process the false branch |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1880 set_control(if_false); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1881 |
6205 | 1882 if (!too_many_traps(Deoptimization::Reason_intrinsic)) { |
1883 // Short form: skip the fancy tests and just check for NaN result. | |
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7637
diff
changeset
|
1884 result = _gvn.transform(new (C) PowDNode(C, control(), x, y)); |
0 | 1885 } else { |
6205 | 1886 // If this inlining ever returned NaN in the past, include all |
1887 // checks + call to the runtime. | |
0 | 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 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1891 RegionNode *r = new (C) RegionNode(4); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1892 Node *phi = new (C) PhiNode(r, Type::DOUBLE); |
0 | 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 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1898 Node *cmp = _gvn.transform(new (C) CmpDNode(x, zeronode)); |
0 | 1899 // Check: If (x<=0) then go complex path |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1900 Node *bol1 = _gvn.transform(new (C) BoolNode( cmp, BoolTest::le )); |
0 | 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 | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1904 Node *fast_taken = _gvn.transform(new (C) IfFalseNode(if1)); |
0 | 1905 r->init_req(3,fast_taken); // Capture fast-control |
1906 | |
1907 // Fast path not-taken, i.e. slow path | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1908 Node *complex_path = _gvn.transform(new (C) IfTrueNode(if1)); |
0 | 1909 |
1910 // Set fast path result | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1911 Node *fast_result = _gvn.transform(new (C) PowDNode(C, control(), x, y)); |
0 | 1912 phi->init_req(3, fast_result); |
1913 | |
1914 // Complex path | |
6205 | 1915 // Build the second if node (if y is long) |
1916 // Node for (long)y | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1917 Node *longy = _gvn.transform(new (C) ConvD2LNode(y)); |
6205 | 1918 // Node for (double)((long) y) |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1919 Node *doublelongy= _gvn.transform(new (C) ConvL2DNode(longy)); |
6205 | 1920 // Check (double)((long) y) : y |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1921 Node *cmplongy= _gvn.transform(new (C) CmpDNode(doublelongy, y)); |
6205 | 1922 // Check if (y isn't long) then go to slow path |
1923 | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1924 Node *bol2 = _gvn.transform(new (C) BoolNode( cmplongy, BoolTest::ne )); |
605 | 1925 // Branch either way |
0 | 1926 IfNode *if2 = create_and_xform_if(complex_path,bol2, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN); |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1927 Node* ylong_path = _gvn.transform(new (C) IfFalseNode(if2)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1928 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1929 Node *slow_path = _gvn.transform(new (C) IfTrueNode(if2)); |
6205 | 1930 |
1931 // Calculate DPow(abs(x), y)*(1 & (long)y) | |
0 | 1932 // Node for constant 1 |
6205 | 1933 Node *conone = longcon(1); |
1934 // 1& (long)y | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1935 Node *signnode= _gvn.transform(new (C) AndLNode(conone, longy)); |
6205 | 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 | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1943 Node* yplus1 = _gvn.transform(new (C) AddDNode(y, makecon(TypeD::make(1)))); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1944 Node *cmpyplus1= _gvn.transform(new (C) CmpDNode(yplus1, y)); |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1945 Node *bolyplus1 = _gvn.transform(new (C) BoolNode( cmpyplus1, BoolTest::eq )); |
6205 | 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); | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1951 RegionNode *r = new (C) RegionNode(3); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1952 Node *phi = new (C) PhiNode(r, TypeLong::LONG); |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1953 r->init_req(1, _gvn.transform(new (C) IfFalseNode(ifyplus1))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1954 r->init_req(2, _gvn.transform(new (C) IfTrueNode(ifyplus1))); |
6205 | 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 | |
0 | 1962 // zero node |
6205 | 1963 Node *conzero = longcon(0); |
1964 // Check (1&(long)y)==0? | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1965 Node *cmpeq1 = _gvn.transform(new (C) CmpLNode(correctedsign, conzero)); |
6205 | 1966 // Check if (1&(long)y)!=0?, if so the result is negative |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1967 Node *bol3 = _gvn.transform(new (C) BoolNode( cmpeq1, BoolTest::ne )); |
0 | 1968 // abs(x) |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1969 Node *absx=_gvn.transform(new (C) AbsDNode(x)); |
0 | 1970 // abs(x)^y |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1971 Node *absxpowy = _gvn.transform(new (C) PowDNode(C, control(), absx, y)); |
0 | 1972 // -abs(x)^y |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1973 Node *negabsxpowy = _gvn.transform(new (C) NegDNode (absxpowy)); |
6205 | 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); | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1980 RegionNode *r = new (C) RegionNode(3); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1981 Node *phi = new (C) PhiNode(r, Type::DOUBLE); |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1982 r->init_req(1, _gvn.transform(new (C) IfFalseNode(ifyeven))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1983 r->init_req(2, _gvn.transform(new (C) IfTrueNode(ifyeven))); |
6205 | 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 } | |
0 | 1990 // Set complex path fast result |
6205 | 1991 r->init_req(2, ylong_path); |
0 | 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); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2002 result = _gvn.transform(phi); |
0 | 2003 } |
2004 | |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
2005 result = finish_pow_exp(result, x, y, OptoRuntime::Math_DD_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dpow), "POW"); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
2006 |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
2007 // control from finish_pow_exp is now input to the region node |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
2008 region_node->set_req(2, control()); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
2009 // the result from finish_pow_exp is now input to the phi node |
17923
a062c3691003
8042052: assert(t != NULL) failed: must set before get
anoll
parents:
17922
diff
changeset
|
2010 phi_node->init_req(2, result); |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
2011 set_control(_gvn.transform(region_node)); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
2012 record_for_igvn(region_node); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
2013 set_result(_gvn.transform(phi_node)); |
0 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2025 Node* a = round_double_node(argument(0)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2026 Node* b = (call_type == OptoRuntime::Math_DD_D_Type()) ? round_double_node(argument(2)) : NULL; |
0 | 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); | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2032 Node* value = _gvn.transform(new (C) ProjNode(trig, TypeFunc::Parms+0)); |
0 | 2033 #ifdef ASSERT |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2034 Node* value_top = _gvn.transform(new (C) ProjNode(trig, TypeFunc::Parms+1)); |
0 | 2035 assert(value_top == top(), "second value must be top"); |
2036 #endif | |
2037 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2038 set_result(value); |
0 | 2039 return true; |
2040 } | |
2041 | |
2042 //------------------------------inline_math_native----------------------------- | |
2043 bool LibraryCallKit::inline_math_native(vmIntrinsics::ID id) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2044 #define FN_PTR(f) CAST_FROM_FN_PTR(address, f) |
0 | 2045 switch (id) { |
2046 // These intrinsics are not properly supported on all hardware | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2047 case vmIntrinsics::_dcos: return Matcher::has_match_rule(Op_CosD) ? inline_trig(id) : |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2048 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dcos), "COS"); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2049 case vmIntrinsics::_dsin: return Matcher::has_match_rule(Op_SinD) ? inline_trig(id) : |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2050 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dsin), "SIN"); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2051 case vmIntrinsics::_dtan: return Matcher::has_match_rule(Op_TanD) ? inline_trig(id) : |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2052 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dtan), "TAN"); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2053 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2054 case vmIntrinsics::_dlog: return Matcher::has_match_rule(Op_LogD) ? inline_math(id) : |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2055 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dlog), "LOG"); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2056 case vmIntrinsics::_dlog10: return Matcher::has_match_rule(Op_Log10D) ? inline_math(id) : |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2057 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dlog10), "LOG10"); |
0 | 2058 |
2059 // These intrinsics are supported on all hardware | |
17802
7c462558a08a
8035394: PPC64: Make usage of intrinsic dsqrt depend on processor recognition.
goetz
parents:
17799
diff
changeset
|
2060 case vmIntrinsics::_dsqrt: return Matcher::match_rule_supported(Op_SqrtD) ? inline_math(id) : false; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2061 case vmIntrinsics::_dabs: return Matcher::has_match_rule(Op_AbsD) ? inline_math(id) : false; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2062 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2063 case vmIntrinsics::_dexp: return Matcher::has_match_rule(Op_ExpD) ? inline_exp() : |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2064 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dexp), "EXP"); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2065 case vmIntrinsics::_dpow: return Matcher::has_match_rule(Op_PowD) ? inline_pow() : |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2066 runtime_math(OptoRuntime::Math_DD_D_Type(), FN_PTR(SharedRuntime::dpow), "POW"); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2067 #undef FN_PTR |
0 | 2068 |
2069 // These intrinsics are not yet correctly implemented | |
2070 case vmIntrinsics::_datan2: | |
2071 return false; | |
2072 | |
2073 default: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2074 fatal_unexpected_iid(id); |
0 | 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) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2089 set_result(generate_min_max(id, argument(0), argument(1))); |
0 | 2090 return true; |
2091 } | |
2092 | |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2093 void LibraryCallKit::inline_math_mathExact(Node* math, Node *test) { |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2094 Node* bol = _gvn.transform( new (C) BoolNode(test, BoolTest::overflow) ); |
12323 | 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); | |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2112 set_result(math); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2113 } |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2114 |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2115 template <typename OverflowOp> |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2116 bool LibraryCallKit::inline_math_overflow(Node* arg1, Node* arg2) { |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2117 typedef typename OverflowOp::MathOp MathOp; |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2118 |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2119 MathOp* mathOp = new(C) MathOp(arg1, arg2); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2120 Node* operation = _gvn.transform( mathOp ); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2121 Node* ofcheck = _gvn.transform( new(C) OverflowOp(arg1, arg2) ); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2122 inline_math_mathExact(operation, ofcheck); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2123 return true; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2124 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2125 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2126 bool LibraryCallKit::inline_math_addExactI(bool is_increment) { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2127 return inline_math_overflow<OverflowAddINode>(argument(0), is_increment ? intcon(1) : argument(1)); |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2128 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2129 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2130 bool LibraryCallKit::inline_math_addExactL(bool is_increment) { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2131 return inline_math_overflow<OverflowAddLNode>(argument(0), is_increment ? longcon(1) : argument(2)); |
12323 | 2132 } |
2133 | |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2134 bool LibraryCallKit::inline_math_subtractExactI(bool is_decrement) { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2135 return inline_math_overflow<OverflowSubINode>(argument(0), is_decrement ? intcon(1) : argument(1)); |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2136 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2137 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2138 bool LibraryCallKit::inline_math_subtractExactL(bool is_decrement) { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2139 return inline_math_overflow<OverflowSubLNode>(argument(0), is_decrement ? longcon(1) : argument(2)); |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2140 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2141 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2142 bool LibraryCallKit::inline_math_negateExactI() { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2143 return inline_math_overflow<OverflowSubINode>(intcon(0), argument(0)); |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2144 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2145 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2146 bool LibraryCallKit::inline_math_negateExactL() { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2147 return inline_math_overflow<OverflowSubLNode>(longcon(0), argument(0)); |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2148 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2149 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2150 bool LibraryCallKit::inline_math_multiplyExactI() { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2151 return inline_math_overflow<OverflowMulINode>(argument(0), argument(1)); |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2152 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2153 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2154 bool LibraryCallKit::inline_math_multiplyExactL() { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2155 return inline_math_overflow<OverflowMulLNode>(argument(0), argument(2)); |
12323 | 2156 } |
2157 | |
0 | 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; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
2189 Node* ideal_cmpxy = _gvn.transform(new(C) CmpINode(xkey, ykey)); |
0 | 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; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
2282 best_bol = _gvn.transform(new(C) BoolNode(cmpxy, BoolTest::lt)); |
0 | 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. | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
2342 base = _gvn.transform(new (C) CastX2PNode(offset)); |
0 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2377 //--------------------------inline_number_methods----------------------------- |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2378 // inline int Integer.numberOfLeadingZeros(int) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2379 // inline int Long.numberOfLeadingZeros(long) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2380 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2381 // inline int Integer.numberOfTrailingZeros(int) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2382 // inline int Long.numberOfTrailingZeros(long) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2383 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2384 // inline int Integer.bitCount(int) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2385 // inline int Long.bitCount(long) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2386 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2387 // inline char Character.reverseBytes(char) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2388 // inline short Short.reverseBytes(short) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2389 // inline int Integer.reverseBytes(int) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2390 // inline long Long.reverseBytes(long) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2391 bool LibraryCallKit::inline_number_methods(vmIntrinsics::ID id) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2392 Node* arg = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2393 Node* n; |
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
2394 switch (id) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2395 case vmIntrinsics::_numberOfLeadingZeros_i: n = new (C) CountLeadingZerosINode( arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2396 case vmIntrinsics::_numberOfLeadingZeros_l: n = new (C) CountLeadingZerosLNode( arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2397 case vmIntrinsics::_numberOfTrailingZeros_i: n = new (C) CountTrailingZerosINode(arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2398 case vmIntrinsics::_numberOfTrailingZeros_l: n = new (C) CountTrailingZerosLNode(arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2399 case vmIntrinsics::_bitCount_i: n = new (C) PopCountINode( arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2400 case vmIntrinsics::_bitCount_l: n = new (C) PopCountLNode( arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2401 case vmIntrinsics::_reverseBytes_c: n = new (C) ReverseBytesUSNode(0, arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2402 case vmIntrinsics::_reverseBytes_s: n = new (C) ReverseBytesSNode( 0, arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2403 case vmIntrinsics::_reverseBytes_i: n = new (C) ReverseBytesINode( 0, arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2404 case vmIntrinsics::_reverseBytes_l: n = new (C) ReverseBytesLNode( 0, arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2405 default: fatal_unexpected_iid(id); break; |
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
2406 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2407 set_result(_gvn.transform(n)); |
0 | 2408 return true; |
2409 } | |
2410 | |
2411 //----------------------------inline_unsafe_access---------------------------- | |
2412 | |
2413 const static BasicType T_ADDRESS_HOLDER = T_LONG; | |
2414 | |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2415 // Helper that guards and inserts a pre-barrier. |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2416 void LibraryCallKit::insert_pre_barrier(Node* base_oop, Node* offset, |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2417 Node* pre_val, bool need_mem_bar) { |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2418 // We could be accessing the referent field of a reference object. If so, when G1 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2419 // is enabled, we need to log the value in the referent field in an SATB buffer. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2420 // This routine performs some compile time filters and generates suitable |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2421 // runtime filters that guard the pre-barrier code. |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2422 // Also add memory barrier for non volatile load from the referent field |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2423 // to prevent commoning of loads across safepoint. |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2424 if (!UseG1GC && !need_mem_bar) |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2425 return; |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2426 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2427 // Some compile time checks. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2428 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2429 // If offset is a constant, is it java_lang_ref_Reference::_reference_offset? |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2430 const TypeX* otype = offset->find_intptr_t_type(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2431 if (otype != NULL && otype->is_con() && |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2432 otype->get_con() != java_lang_ref_Reference::referent_offset) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2433 // Constant offset but not the reference_offset so just return |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2434 return; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2435 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2436 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2437 // We only need to generate the runtime guards for instances. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2438 const TypeOopPtr* btype = base_oop->bottom_type()->isa_oopptr(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2439 if (btype != NULL) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2440 if (btype->isa_aryptr()) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2441 // Array type so nothing to do |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2442 return; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2443 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2444 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2445 const TypeInstPtr* itype = btype->isa_instptr(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2446 if (itype != NULL) { |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2447 // Can the klass of base_oop be statically determined to be |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2448 // _not_ a sub-class of Reference and _not_ Object? |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2449 ciKlass* klass = itype->klass(); |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2450 if ( klass->is_loaded() && |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2451 !klass->is_subtype_of(env()->Reference_klass()) && |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2452 !env()->Object_klass()->is_subtype_of(klass)) { |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2453 return; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2454 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2455 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2456 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2457 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2458 // The compile time filters did not reject base_oop/offset so |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2459 // we need to generate the following runtime filters |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2460 // |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2461 // if (offset == java_lang_ref_Reference::_reference_offset) { |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2462 // if (instance_of(base, java.lang.ref.Reference)) { |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2463 // pre_barrier(_, pre_val, ...); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2464 // } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2465 // } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2466 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2467 float likely = PROB_LIKELY( 0.999); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2468 float unlikely = PROB_UNLIKELY(0.999); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2469 |
3255 | 2470 IdealKit ideal(this); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2471 #define __ ideal. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2472 |
3254
59766fd005ff
7035117: G1: nsk/stress/jni/jnistress002 fails with assertion failure
johnc
parents:
3252
diff
changeset
|
2473 Node* referent_off = __ ConX(java_lang_ref_Reference::referent_offset); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2474 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2475 __ if_then(offset, BoolTest::eq, referent_off, unlikely); { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2476 // Update graphKit memory and control from IdealKit. |
3255 | 2477 sync_kit(ideal); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2478 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2479 Node* ref_klass_con = makecon(TypeKlassPtr::make(env()->Reference_klass())); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2480 Node* is_instof = gen_instanceof(base_oop, ref_klass_con); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2481 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2482 // Update IdealKit memory and control from graphKit. |
3255 | 2483 __ sync_kit(this); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2484 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2485 Node* one = __ ConI(1); |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2486 // is_instof == 0 if base_oop == NULL |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2487 __ if_then(is_instof, BoolTest::eq, one, unlikely); { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2488 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2489 // Update graphKit from IdeakKit. |
3255 | 2490 sync_kit(ideal); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2491 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2492 // Use the pre-barrier to record the value in the referent field |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2493 pre_barrier(false /* do_load */, |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2494 __ ctrl(), |
3258
edd9b016deb6
7036021: G1: build failure on win64 and linux with hs21 in jdk6 build environment
johnc
parents:
3255
diff
changeset
|
2495 NULL /* obj */, NULL /* adr */, max_juint /* alias_idx */, NULL /* val */, NULL /* val_type */, |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2496 pre_val /* pre_val */, |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2497 T_OBJECT); |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2498 if (need_mem_bar) { |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2499 // Add memory barrier to prevent commoning reads from this field |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2500 // across safepoint since GC can change its value. |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2501 insert_mem_bar(Op_MemBarCPUOrder); |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2502 } |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2503 // Update IdealKit from graphKit. |
3255 | 2504 __ sync_kit(this); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2505 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2506 } __ end_if(); // _ref_type != ref_none |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2507 } __ end_if(); // offset == referent_offset |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2508 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2509 // Final sync IdealKit and GraphKit. |
3255 | 2510 final_sync(ideal); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2511 #undef __ |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2512 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2513 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2514 |
0 | 2515 // Interpret Unsafe.fieldOffset cookies correctly: |
2516 extern jlong Unsafe_field_offset_to_byte_offset(jlong field_offset); | |
2517 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2518 const TypeOopPtr* LibraryCallKit::sharpen_unsafe_type(Compile::AliasType* alias_type, const TypePtr *adr_type, bool is_native_ptr) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2519 // Attempt to infer a sharper value type from the offset and base type. |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2520 ciKlass* sharpened_klass = NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2521 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2522 // See if it is an instance field, with an object type. |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2523 if (alias_type->field() != NULL) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2524 assert(!is_native_ptr, "native pointer op cannot use a java address"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2525 if (alias_type->field()->type()->is_klass()) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2526 sharpened_klass = alias_type->field()->type()->as_klass(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2527 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2528 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2529 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2530 // See if it is a narrow oop array. |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2531 if (adr_type->isa_aryptr()) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2532 if (adr_type->offset() >= objArrayOopDesc::base_offset_in_bytes()) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2533 const TypeOopPtr *elem_type = adr_type->is_aryptr()->elem()->isa_oopptr(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2534 if (elem_type != NULL) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2535 sharpened_klass = elem_type->klass(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2536 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2537 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2538 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2539 |
6847
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2540 // The sharpened class might be unloaded if there is no class loader |
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2541 // contraint in place. |
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2542 if (sharpened_klass != NULL && sharpened_klass->is_loaded()) { |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2543 const TypeOopPtr* tjp = TypeOopPtr::make_from_klass(sharpened_klass); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2544 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2545 #ifndef PRODUCT |
12295 | 2546 if (C->print_intrinsics() || C->print_inlining()) { |
6847
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2547 tty->print(" from base type: "); adr_type->dump(); |
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2548 tty->print(" sharpened value: "); tjp->dump(); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2549 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2550 #endif |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2551 // Sharpen the value type. |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2552 return tjp; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2553 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2554 return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2555 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2556 |
0 | 2557 bool LibraryCallKit::inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile) { |
2558 if (callee()->is_static()) return false; // caller must have the capability! | |
2559 | |
2560 #ifndef PRODUCT | |
2561 { | |
2562 ResourceMark rm; | |
2563 // Check the signatures. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2564 ciSignature* sig = callee()->signature(); |
0 | 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 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2602 Node* receiver = argument(0); // type: oop |
0 | 2603 |
2604 // Build address expression. See the code in inline_unsafe_prefetch. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2605 Node* adr; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2606 Node* heap_base_oop = top(); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2607 Node* offset = top(); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2608 Node* val; |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2609 |
0 | 2610 if (!is_native_ptr) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2611 // The base is either a Java object or a value produced by Unsafe.staticFieldBase |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2612 Node* base = argument(1); // type: oop |
0 | 2613 // The offset is a value produced by Unsafe.staticFieldOffset or Unsafe.objectFieldOffset |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2614 offset = argument(2); // type: long |
0 | 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; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2624 val = is_store ? argument(4) : NULL; |
0 | 2625 } else { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2626 Node* ptr = argument(1); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2627 ptr = ConvL2X(ptr); // adjust Java long to machine word |
0 | 2628 adr = make_unsafe_address(NULL, ptr); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2629 val = is_store ? argument(3) : NULL; |
0 | 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 | |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2649 // If we are reading the value of the referent field of a Reference |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2650 // object (either by using Unsafe directly or through reflection) |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2651 // then, if G1 is enabled, we need to record the referent in an |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2652 // SATB log buffer using the pre-barrier mechanism. |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2653 // Also we need to add memory barrier to prevent commoning reads |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2654 // from this field across safepoint since GC can change its value. |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2655 bool need_read_barrier = !is_native_ptr && !is_store && |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2656 offset != top() && heap_base_oop != top(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2657 |
0 | 2658 if (!is_store && type == T_OBJECT) { |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2659 const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type, is_native_ptr); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2660 if (tjp != NULL) { |
0 | 2661 value_type = tjp; |
2662 } | |
2663 } | |
2664 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2665 receiver = null_check(receiver); |
0 | 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 | |
605 | 2679 // we cannot do effectively here because we probably only have a |
0 | 2680 // rough approximation of type. |
2681 need_mem_bar = true; | |
2682 // For Stores, place a memory ordering barrier now. | |
17794
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2683 if (is_store) { |
0 | 2684 insert_mem_bar(Op_MemBarRelease); |
17794
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2685 } else { |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2686 if (support_IRIW_for_not_multiple_copy_atomic_cpu) { |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2687 insert_mem_bar(Op_MemBarVolatile); |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2688 } |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2689 } |
0 | 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 if (!is_store) { | |
20420
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
2701 MemNode::MemOrd mo = is_volatile ? MemNode::acquire : MemNode::unordered; |
23055
c1c199dde5c9
8077504: Unsafe load can loose control dependency and cause crash
roland
parents:
22986
diff
changeset
|
2702 // To be valid, unsafe loads may depend on other conditions than |
c1c199dde5c9
8077504: Unsafe load can loose control dependency and cause crash
roland
parents:
22986
diff
changeset
|
2703 // the one that guards them: pin the Load node |
c1c199dde5c9
8077504: Unsafe load can loose control dependency and cause crash
roland
parents:
22986
diff
changeset
|
2704 Node* p = make_load(control(), adr, value_type, type, adr_type, mo, LoadNode::Pinned, is_volatile); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2705 // load value |
0 | 2706 switch (type) { |
2707 case T_BOOLEAN: | |
2708 case T_CHAR: | |
2709 case T_BYTE: | |
2710 case T_SHORT: | |
2711 case T_INT: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2712 case T_LONG: |
0 | 2713 case T_FLOAT: |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2714 case T_DOUBLE: |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2715 break; |
0 | 2716 case T_OBJECT: |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2717 if (need_read_barrier) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2718 insert_pre_barrier(heap_base_oop, offset, p, !(is_volatile || need_mem_bar)); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2719 } |
0 | 2720 break; |
2721 case T_ADDRESS: | |
2722 // Cast to an int type. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2723 p = _gvn.transform(new (C) CastP2XNode(NULL, p)); |
17776
9ab9f254cfe2
6653795: C2 intrinsic for Unsafe.getAddress performs pointer sign extension on 32-bit systems
poonam
parents:
17726
diff
changeset
|
2724 p = ConvX2UL(p); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2725 break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2726 default: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2727 fatal(err_msg_res("unexpected type %d: %s", type, type2name(type))); |
0 | 2728 break; |
2729 } | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2730 // The load node has the control of the preceding MemBarCPUOrder. All |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2731 // following nodes will have the control of the MemBarCPUOrder inserted at |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2732 // the end of this method. So, pushing the load onto the stack at a later |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2733 // point is fine. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2734 set_result(p); |
0 | 2735 } else { |
2736 // place effect of store into memory | |
2737 switch (type) { | |
2738 case T_DOUBLE: | |
2739 val = dstore_rounding(val); | |
2740 break; | |
2741 case T_ADDRESS: | |
2742 // Repackage the long as a pointer. | |
2743 val = ConvL2X(val); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
2744 val = _gvn.transform(new (C) CastX2PNode(val)); |
0 | 2745 break; |
2746 } | |
2747 | |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
2748 MemNode::MemOrd mo = is_volatile ? MemNode::release : MemNode::unordered; |
0 | 2749 if (type != T_OBJECT ) { |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
2750 (void) store_to_memory(control(), adr, val, type, adr_type, mo, is_volatile); |
0 | 2751 } else { |
2752 // Possibly an oop being stored to Java heap or native memory | |
2753 if (!TypePtr::NULL_PTR->higher_equal(_gvn.type(heap_base_oop))) { | |
2754 // oop to Java heap. | |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
2755 (void) store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type, mo); |
0 | 2756 } else { |
2757 // We can't tell at compile time if we are storing in the Java heap or outside | |
2758 // of it. So we need to emit code to conditionally do the proper type of | |
2759 // store. | |
2760 | |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2761 IdealKit ideal(this); |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2762 #define __ ideal. |
0 | 2763 // QQQ who knows what probability is here?? |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2764 __ if_then(heap_base_oop, BoolTest::ne, null(), PROB_UNLIKELY(0.999)); { |
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2765 // Sync IdealKit and graphKit. |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2766 sync_kit(ideal); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
2767 Node* st = store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type, mo); |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2768 // Update IdealKit memory. |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2769 __ sync_kit(this); |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2770 } __ else_(); { |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
2771 __ store(__ ctrl(), adr, val, type, alias_type->index(), mo, is_volatile); |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2772 } __ end_if(); |
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2773 // Final sync IdealKit and GraphKit. |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2774 final_sync(ideal); |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2775 #undef __ |
0 | 2776 } |
2777 } | |
2778 } | |
2779 | |
2780 if (is_volatile) { | |
17794
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2781 if (!is_store) { |
0 | 2782 insert_mem_bar(Op_MemBarAcquire); |
17794
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2783 } else { |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2784 if (!support_IRIW_for_not_multiple_copy_atomic_cpu) { |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2785 insert_mem_bar(Op_MemBarVolatile); |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2786 } |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2787 } |
0 | 2788 } |
2789 | |
2790 if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder); | |
2791 | |
2792 return true; | |
2793 } | |
2794 | |
2795 //----------------------------inline_unsafe_prefetch---------------------------- | |
2796 | |
2797 bool LibraryCallKit::inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static) { | |
2798 #ifndef PRODUCT | |
2799 { | |
2800 ResourceMark rm; | |
2801 // Check the signatures. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2802 ciSignature* sig = callee()->signature(); |
0 | 2803 #ifdef ASSERT |
2804 // Object getObject(Object base, int/long offset), etc. | |
2805 BasicType rtype = sig->return_type()->basic_type(); | |
2806 if (!is_native_ptr) { | |
2807 assert(sig->count() == 2, "oop prefetch has 2 arguments"); | |
2808 assert(sig->type_at(0)->basic_type() == T_OBJECT, "prefetch base is object"); | |
2809 assert(sig->type_at(1)->basic_type() == T_LONG, "prefetcha offset is correct"); | |
2810 } else { | |
2811 assert(sig->count() == 1, "native prefetch has 1 argument"); | |
2812 assert(sig->type_at(0)->basic_type() == T_LONG, "prefetch base is long"); | |
2813 } | |
2814 #endif // ASSERT | |
2815 } | |
2816 #endif // !PRODUCT | |
2817 | |
2818 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
2819 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2820 const int idx = is_static ? 0 : 1; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2821 if (!is_static) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2822 null_check_receiver(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2823 if (stopped()) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2824 return true; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2825 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2826 } |
0 | 2827 |
2828 // Build address expression. See the code in inline_unsafe_access. | |
2829 Node *adr; | |
2830 if (!is_native_ptr) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2831 // The base is either a Java object or a value produced by Unsafe.staticFieldBase |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2832 Node* base = argument(idx + 0); // type: oop |
0 | 2833 // The offset is a value produced by Unsafe.staticFieldOffset or Unsafe.objectFieldOffset |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2834 Node* offset = argument(idx + 1); // type: long |
0 | 2835 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset |
2836 // to be plain byte offsets, which are also the same as those accepted | |
2837 // by oopDesc::field_base. | |
2838 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
2839 "fieldOffset must be byte-scaled"); | |
2840 // 32-bit machines ignore the high half! | |
2841 offset = ConvL2X(offset); | |
2842 adr = make_unsafe_address(base, offset); | |
2843 } else { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2844 Node* ptr = argument(idx + 0); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2845 ptr = ConvL2X(ptr); // adjust Java long to machine word |
0 | 2846 adr = make_unsafe_address(NULL, ptr); |
2847 } | |
2848 | |
2849 // Generate the read or write prefetch | |
2850 Node *prefetch; | |
2851 if (is_store) { | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2852 prefetch = new (C) PrefetchWriteNode(i_o(), adr); |
0 | 2853 } else { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2854 prefetch = new (C) PrefetchReadNode(i_o(), adr); |
0 | 2855 } |
2856 prefetch->init_req(0, control()); | |
2857 set_i_o(_gvn.transform(prefetch)); | |
2858 | |
2859 return true; | |
2860 } | |
2861 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2862 //----------------------------inline_unsafe_load_store---------------------------- |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2863 // This method serves a couple of different customers (depending on LoadStoreKind): |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2864 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2865 // LS_cmpxchg: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2866 // public final native boolean compareAndSwapObject(Object o, long offset, Object expected, Object x); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2867 // public final native boolean compareAndSwapInt( Object o, long offset, int expected, int x); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2868 // public final native boolean compareAndSwapLong( Object o, long offset, long expected, long x); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2869 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2870 // LS_xadd: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2871 // public int getAndAddInt( Object o, long offset, int delta) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2872 // public long getAndAddLong(Object o, long offset, long delta) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2873 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2874 // LS_xchg: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2875 // int getAndSet(Object o, long offset, int newValue) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2876 // long getAndSet(Object o, long offset, long newValue) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2877 // Object getAndSet(Object o, long offset, Object newValue) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2878 // |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2879 bool LibraryCallKit::inline_unsafe_load_store(BasicType type, LoadStoreKind kind) { |
0 | 2880 // This basic scheme here is the same as inline_unsafe_access, but |
2881 // differs in enough details that combining them would make the code | |
2882 // overly confusing. (This is a true fact! I originally combined | |
2883 // them, but even I was confused by it!) As much code/comments as | |
2884 // possible are retained from inline_unsafe_access though to make | |
605 | 2885 // the correspondences clearer. - dl |
0 | 2886 |
2887 if (callee()->is_static()) return false; // caller must have the capability! | |
2888 | |
2889 #ifndef PRODUCT | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2890 BasicType rtype; |
0 | 2891 { |
2892 ResourceMark rm; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2893 // Check the signatures. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2894 ciSignature* sig = callee()->signature(); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2895 rtype = sig->return_type()->basic_type(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2896 if (kind == LS_xadd || kind == LS_xchg) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2897 // Check the signatures. |
0 | 2898 #ifdef ASSERT |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2899 assert(rtype == type, "get and set must return the expected type"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2900 assert(sig->count() == 3, "get and set has 3 arguments"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2901 assert(sig->type_at(0)->basic_type() == T_OBJECT, "get and set base is object"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2902 assert(sig->type_at(1)->basic_type() == T_LONG, "get and set offset is long"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2903 assert(sig->type_at(2)->basic_type() == type, "get and set must take expected type as new value/delta"); |
0 | 2904 #endif // ASSERT |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2905 } else if (kind == LS_cmpxchg) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2906 // Check the signatures. |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2907 #ifdef ASSERT |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2908 assert(rtype == T_BOOLEAN, "CAS must return boolean"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2909 assert(sig->count() == 4, "CAS has 4 arguments"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2910 assert(sig->type_at(0)->basic_type() == T_OBJECT, "CAS base is object"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2911 assert(sig->type_at(1)->basic_type() == T_LONG, "CAS offset is long"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2912 #endif // ASSERT |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2913 } else { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2914 ShouldNotReachHere(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2915 } |
0 | 2916 } |
2917 #endif //PRODUCT | |
2918 | |
2919 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
2920 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2921 // Get arguments: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2922 Node* receiver = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2923 Node* base = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2924 Node* offset = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2925 Node* oldval = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2926 Node* newval = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2927 if (kind == LS_cmpxchg) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2928 const bool two_slot_type = type2size[type] == 2; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2929 receiver = argument(0); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2930 base = argument(1); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2931 offset = argument(2); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2932 oldval = argument(4); // type: oop, int, or long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2933 newval = argument(two_slot_type ? 6 : 5); // type: oop, int, or long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2934 } else if (kind == LS_xadd || kind == LS_xchg){ |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2935 receiver = argument(0); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2936 base = argument(1); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2937 offset = argument(2); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2938 oldval = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2939 newval = argument(4); // type: oop, int, or long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2940 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2941 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2942 // Null check receiver. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2943 receiver = null_check(receiver); |
0 | 2944 if (stopped()) { |
2945 return true; | |
2946 } | |
2947 | |
2948 // Build field offset expression. | |
2949 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset | |
2950 // to be plain byte offsets, which are also the same as those accepted | |
2951 // by oopDesc::field_base. | |
2952 assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled"); | |
2953 // 32-bit machines ignore the high half of long offsets | |
2954 offset = ConvL2X(offset); | |
2955 Node* adr = make_unsafe_address(base, offset); | |
2956 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
2957 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2958 // For CAS, unlike inline_unsafe_access, there seems no point in |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2959 // trying to refine types. Just use the coarse types here. |
0 | 2960 const Type *value_type = Type::get_const_basic_type(type); |
2961 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
2962 assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here"); | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2963 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2964 if (kind == LS_xchg && type == T_OBJECT) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2965 const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2966 if (tjp != NULL) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2967 value_type = tjp; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2968 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2969 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2970 |
0 | 2971 int alias_idx = C->get_alias_index(adr_type); |
2972 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2973 // Memory-model-wise, a LoadStore acts like a little synchronized |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2974 // block, so needs barriers on each side. These don't translate |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2975 // into actual barriers on most machines, but we still need rest of |
0 | 2976 // compiler to respect ordering. |
2977 | |
2978 insert_mem_bar(Op_MemBarRelease); | |
2979 insert_mem_bar(Op_MemBarCPUOrder); | |
2980 | |
2981 // 4984716: MemBars must be inserted before this | |
2982 // memory node in order to avoid a false | |
2983 // dependency which will confuse the scheduler. | |
2984 Node *mem = memory(alias_idx); | |
2985 | |
2986 // For now, we handle only those cases that actually exist: ints, | |
2987 // longs, and Object. Adding others should be straightforward. | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2988 Node* load_store; |
0 | 2989 switch(type) { |
2990 case T_INT: | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2991 if (kind == LS_xadd) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2992 load_store = _gvn.transform(new (C) GetAndAddINode(control(), mem, adr, newval, adr_type)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2993 } else if (kind == LS_xchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2994 load_store = _gvn.transform(new (C) GetAndSetINode(control(), mem, adr, newval, adr_type)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2995 } else if (kind == LS_cmpxchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2996 load_store = _gvn.transform(new (C) CompareAndSwapINode(control(), mem, adr, newval, oldval)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2997 } else { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2998 ShouldNotReachHere(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2999 } |
0 | 3000 break; |
3001 case T_LONG: | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3002 if (kind == LS_xadd) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3003 load_store = _gvn.transform(new (C) GetAndAddLNode(control(), mem, adr, newval, adr_type)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3004 } else if (kind == LS_xchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3005 load_store = _gvn.transform(new (C) GetAndSetLNode(control(), mem, adr, newval, adr_type)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3006 } else if (kind == LS_cmpxchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3007 load_store = _gvn.transform(new (C) CompareAndSwapLNode(control(), mem, adr, newval, oldval)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3008 } else { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3009 ShouldNotReachHere(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3010 } |
0 | 3011 break; |
3012 case T_OBJECT: | |
4894
b9bc6cae88f2
7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes
kvn
parents:
4778
diff
changeset
|
3013 // Transformation of a value which could be NULL pointer (CastPP #NULL) |
b9bc6cae88f2
7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes
kvn
parents:
4778
diff
changeset
|
3014 // could be delayed during Parse (for example, in adjust_map_after_if()). |
b9bc6cae88f2
7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes
kvn
parents:
4778
diff
changeset
|
3015 // Execute transformation here to avoid barrier generation in such case. |
b9bc6cae88f2
7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes
kvn
parents:
4778
diff
changeset
|
3016 if (_gvn.type(newval) == TypePtr::NULL_PTR) |
b9bc6cae88f2
7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes
kvn
parents:
4778
diff
changeset
|
3017 newval = _gvn.makecon(TypePtr::NULL_PTR); |
b9bc6cae88f2
7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes
kvn
parents:
4778
diff
changeset
|
3018 |
b9bc6cae88f2
7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes
kvn
parents:
4778
diff
changeset
|
3019 // Reference stores need a store barrier. |
12169
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3020 if (kind == LS_xchg) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3021 // If pre-barrier must execute before the oop store, old value will require do_load here. |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3022 if (!can_move_pre_barrier()) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3023 pre_barrier(true /* do_load*/, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3024 control(), base, adr, alias_idx, newval, value_type->make_oopptr(), |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3025 NULL /* pre_val*/, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3026 T_OBJECT); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3027 } // Else move pre_barrier to use load_store value, see below. |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3028 } else if (kind == LS_cmpxchg) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3029 // Same as for newval above: |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3030 if (_gvn.type(oldval) == TypePtr::NULL_PTR) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3031 oldval = _gvn.makecon(TypePtr::NULL_PTR); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3032 } |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3033 // The only known value which might get overwritten is oldval. |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3034 pre_barrier(false /* do_load */, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3035 control(), NULL, NULL, max_juint, NULL, NULL, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3036 oldval /* pre_val */, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3037 T_OBJECT); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3038 } else { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3039 ShouldNotReachHere(); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3040 } |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3041 |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
3042 #ifdef _LP64 |
163 | 3043 if (adr->bottom_type()->is_ptr_to_narrowoop()) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3044 Node *newval_enc = _gvn.transform(new (C) EncodePNode(newval, newval->bottom_type()->make_narrowoop())); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3045 if (kind == LS_xchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3046 load_store = _gvn.transform(new (C) GetAndSetNNode(control(), mem, adr, |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3047 newval_enc, adr_type, value_type->make_narrowoop())); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3048 } else { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3049 assert(kind == LS_cmpxchg, "wrong LoadStore operation"); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3050 Node *oldval_enc = _gvn.transform(new (C) EncodePNode(oldval, oldval->bottom_type()->make_narrowoop())); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3051 load_store = _gvn.transform(new (C) CompareAndSwapNNode(control(), mem, adr, |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3052 newval_enc, oldval_enc)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3053 } |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
3054 } else |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
3055 #endif |
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
174
diff
changeset
|
3056 { |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3057 if (kind == LS_xchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3058 load_store = _gvn.transform(new (C) GetAndSetPNode(control(), mem, adr, newval, adr_type, value_type->is_oopptr())); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3059 } else { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3060 assert(kind == LS_cmpxchg, "wrong LoadStore operation"); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3061 load_store = _gvn.transform(new (C) CompareAndSwapPNode(control(), mem, adr, newval, oldval)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3062 } |
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
174
diff
changeset
|
3063 } |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3064 post_barrier(control(), load_store, base, adr, alias_idx, newval, T_OBJECT, true); |
0 | 3065 break; |
3066 default: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3067 fatal(err_msg_res("unexpected type %d: %s", type, type2name(type))); |
0 | 3068 break; |
3069 } | |
3070 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3071 // SCMemProjNodes represent the memory state of a LoadStore. Their |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3072 // main role is to prevent LoadStore nodes from being optimized away |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3073 // when their results aren't used. |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3074 Node* proj = _gvn.transform(new (C) SCMemProjNode(load_store)); |
0 | 3075 set_memory(proj, alias_idx); |
3076 | |
12169
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3077 if (type == T_OBJECT && kind == LS_xchg) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3078 #ifdef _LP64 |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3079 if (adr->bottom_type()->is_ptr_to_narrowoop()) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3080 load_store = _gvn.transform(new (C) DecodeNNode(load_store, load_store->get_ptr_type())); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3081 } |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3082 #endif |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3083 if (can_move_pre_barrier()) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3084 // Don't need to load pre_val. The old value is returned by load_store. |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3085 // The pre_barrier can execute after the xchg as long as no safepoint |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3086 // gets inserted between them. |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3087 pre_barrier(false /* do_load */, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3088 control(), NULL, NULL, max_juint, NULL, NULL, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3089 load_store /* pre_val */, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3090 T_OBJECT); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3091 } |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3092 } |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3093 |
0 | 3094 // Add the trailing membar surrounding the access |
3095 insert_mem_bar(Op_MemBarCPUOrder); | |
3096 insert_mem_bar(Op_MemBarAcquire); | |
3097 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3098 assert(type2size[load_store->bottom_type()->basic_type()] == type2size[rtype], "result type should match"); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3099 set_result(load_store); |
0 | 3100 return true; |
3101 } | |
3102 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3103 //----------------------------inline_unsafe_ordered_store---------------------- |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3104 // public native void sun.misc.Unsafe.putOrderedObject(Object o, long offset, Object x); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3105 // public native void sun.misc.Unsafe.putOrderedInt(Object o, long offset, int x); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3106 // public native void sun.misc.Unsafe.putOrderedLong(Object o, long offset, long x); |
0 | 3107 bool LibraryCallKit::inline_unsafe_ordered_store(BasicType type) { |
3108 // This is another variant of inline_unsafe_access, differing in | |
3109 // that it always issues store-store ("release") barrier and ensures | |
3110 // store-atomicity (which only matters for "long"). | |
3111 | |
3112 if (callee()->is_static()) return false; // caller must have the capability! | |
3113 | |
3114 #ifndef PRODUCT | |
3115 { | |
3116 ResourceMark rm; | |
3117 // Check the signatures. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3118 ciSignature* sig = callee()->signature(); |
0 | 3119 #ifdef ASSERT |
3120 BasicType rtype = sig->return_type()->basic_type(); | |
3121 assert(rtype == T_VOID, "must return void"); | |
3122 assert(sig->count() == 3, "has 3 arguments"); | |
3123 assert(sig->type_at(0)->basic_type() == T_OBJECT, "base is object"); | |
3124 assert(sig->type_at(1)->basic_type() == T_LONG, "offset is long"); | |
3125 #endif // ASSERT | |
3126 } | |
3127 #endif //PRODUCT | |
3128 | |
3129 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
3130 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3131 // Get arguments: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3132 Node* receiver = argument(0); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3133 Node* base = argument(1); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3134 Node* offset = argument(2); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3135 Node* val = argument(4); // type: oop, int, or long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3136 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3137 // Null check receiver. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3138 receiver = null_check(receiver); |
0 | 3139 if (stopped()) { |
3140 return true; | |
3141 } | |
3142 | |
3143 // Build field offset expression. | |
3144 assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled"); | |
3145 // 32-bit machines ignore the high half of long offsets | |
3146 offset = ConvL2X(offset); | |
3147 Node* adr = make_unsafe_address(base, offset); | |
3148 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
3149 const Type *value_type = Type::get_const_basic_type(type); | |
3150 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
3151 | |
3152 insert_mem_bar(Op_MemBarRelease); | |
3153 insert_mem_bar(Op_MemBarCPUOrder); | |
3154 // Ensure that the store is atomic for longs: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3155 const bool require_atomic_access = true; |
0 | 3156 Node* store; |
3157 if (type == T_OBJECT) // reference stores need a store barrier. | |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3158 store = store_oop_to_unknown(control(), base, adr, adr_type, val, type, MemNode::release); |
0 | 3159 else { |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3160 store = store_to_memory(control(), adr, val, type, adr_type, MemNode::release, require_atomic_access); |
0 | 3161 } |
3162 insert_mem_bar(Op_MemBarCPUOrder); | |
3163 return true; | |
3164 } | |
3165 | |
7425 | 3166 bool LibraryCallKit::inline_unsafe_fence(vmIntrinsics::ID id) { |
3167 // Regardless of form, don't allow previous ld/st to move down, | |
3168 // then issue acquire, release, or volatile mem_bar. | |
3169 insert_mem_bar(Op_MemBarCPUOrder); | |
3170 switch(id) { | |
3171 case vmIntrinsics::_loadFence: | |
14439
50fdb38839eb
8028515: PPPC64 (part 113.2): opto: Introduce LoadFence/StoreFence.
goetz
parents:
14429
diff
changeset
|
3172 insert_mem_bar(Op_LoadFence); |
7425 | 3173 return true; |
3174 case vmIntrinsics::_storeFence: | |
14439
50fdb38839eb
8028515: PPPC64 (part 113.2): opto: Introduce LoadFence/StoreFence.
goetz
parents:
14429
diff
changeset
|
3175 insert_mem_bar(Op_StoreFence); |
7425 | 3176 return true; |
3177 case vmIntrinsics::_fullFence: | |
3178 insert_mem_bar(Op_MemBarVolatile); | |
3179 return true; | |
3180 default: | |
3181 fatal_unexpected_iid(id); | |
3182 return false; | |
3183 } | |
3184 } | |
3185 | |
12078 | 3186 bool LibraryCallKit::klass_needs_init_guard(Node* kls) { |
3187 if (!kls->is_Con()) { | |
3188 return true; | |
3189 } | |
3190 const TypeKlassPtr* klsptr = kls->bottom_type()->isa_klassptr(); | |
3191 if (klsptr == NULL) { | |
3192 return true; | |
3193 } | |
3194 ciInstanceKlass* ik = klsptr->klass()->as_instance_klass(); | |
3195 // don't need a guard for a klass that is already initialized | |
3196 return !ik->is_initialized(); | |
3197 } | |
3198 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3199 //----------------------------inline_unsafe_allocate--------------------------- |
12078 | 3200 // public native Object sun.misc.Unsafe.allocateInstance(Class<?> cls); |
0 | 3201 bool LibraryCallKit::inline_unsafe_allocate() { |
3202 if (callee()->is_static()) return false; // caller must have the capability! | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3203 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3204 null_check_receiver(); // null-check, then ignore |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3205 Node* cls = null_check(argument(1)); |
0 | 3206 if (stopped()) return true; |
3207 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3208 Node* kls = load_klass_from_mirror(cls, false, NULL, 0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3209 kls = null_check(kls); |
0 | 3210 if (stopped()) return true; // argument was like int.class |
3211 | |
12078 | 3212 Node* test = NULL; |
3213 if (LibraryCallKit::klass_needs_init_guard(kls)) { | |
3214 // Note: The argument might still be an illegal value like | |
3215 // Serializable.class or Object[].class. The runtime will handle it. | |
3216 // But we must make an explicit check for initialization. | |
3217 Node* insp = basic_plus_adr(kls, in_bytes(InstanceKlass::init_state_offset())); | |
3218 // Use T_BOOLEAN for InstanceKlass::_init_state so the compiler | |
3219 // can generate code to load it as unsigned byte. | |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3220 Node* inst = make_load(NULL, insp, TypeInt::UBYTE, T_BOOLEAN, MemNode::unordered); |
12078 | 3221 Node* bits = intcon(InstanceKlass::fully_initialized); |
3222 test = _gvn.transform(new (C) SubINode(inst, bits)); | |
3223 // The 'test' is non-zero if we need to take a slow path. | |
3224 } | |
0 | 3225 |
3226 Node* obj = new_instance(kls, test); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3227 set_result(obj); |
0 | 3228 return true; |
3229 } | |
3230 | |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3231 #ifdef TRACE_HAVE_INTRINSICS |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3232 /* |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3233 * oop -> myklass |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3234 * myklass->trace_id |= USED |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3235 * return myklass->trace_id & ~0x3 |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3236 */ |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3237 bool LibraryCallKit::inline_native_classID() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3238 null_check_receiver(); // null-check, then ignore |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3239 Node* cls = null_check(argument(1), T_OBJECT); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3240 Node* kls = load_klass_from_mirror(cls, false, NULL, 0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3241 kls = null_check(kls, T_OBJECT); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3242 ByteSize offset = TRACE_ID_OFFSET; |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3243 Node* insp = basic_plus_adr(kls, in_bytes(offset)); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3244 Node* tvalue = make_load(NULL, insp, TypeLong::LONG, T_LONG, MemNode::unordered); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3245 Node* bits = longcon(~0x03l); // ignore bit 0 & 1 |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3246 Node* andl = _gvn.transform(new (C) AndLNode(tvalue, bits)); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3247 Node* clsused = longcon(0x01l); // set the class bit |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3248 Node* orl = _gvn.transform(new (C) OrLNode(tvalue, clsused)); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3249 |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3250 const TypePtr *adr_type = _gvn.type(insp)->isa_ptr(); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3251 store_to_memory(control(), insp, orl, T_LONG, adr_type, MemNode::unordered); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3252 set_result(andl); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3253 return true; |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3254 } |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3255 |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3256 bool LibraryCallKit::inline_native_threadID() { |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3257 Node* tls_ptr = NULL; |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3258 Node* cur_thr = generate_current_thread(tls_ptr); |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3259 Node* p = basic_plus_adr(top()/*!oop*/, tls_ptr, in_bytes(JavaThread::osthread_offset())); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3260 Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS, MemNode::unordered); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3261 p = basic_plus_adr(top()/*!oop*/, osthread, in_bytes(OSThread::thread_id_offset())); |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3262 |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3263 Node* threadid = NULL; |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3264 size_t thread_id_size = OSThread::thread_id_size(); |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3265 if (thread_id_size == (size_t) BytesPerLong) { |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3266 threadid = ConvL2I(make_load(control(), p, TypeLong::LONG, T_LONG, MemNode::unordered)); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3267 } else if (thread_id_size == (size_t) BytesPerInt) { |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3268 threadid = make_load(control(), p, TypeInt::INT, T_INT, MemNode::unordered); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3269 } else { |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3270 ShouldNotReachHere(); |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3271 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3272 set_result(threadid); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3273 return true; |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3274 } |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3275 #endif |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3276 |
0 | 3277 //------------------------inline_native_time_funcs-------------- |
3278 // inline code for System.currentTimeMillis() and System.nanoTime() | |
3279 // these have the same type and signature | |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3280 bool LibraryCallKit::inline_native_time_funcs(address funcAddr, const char* funcName) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3281 const TypeFunc* tf = OptoRuntime::void_long_Type(); |
0 | 3282 const TypePtr* no_memory_effects = NULL; |
3283 Node* time = make_runtime_call(RC_LEAF, tf, funcAddr, funcName, no_memory_effects); | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3284 Node* value = _gvn.transform(new (C) ProjNode(time, TypeFunc::Parms+0)); |
0 | 3285 #ifdef ASSERT |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3286 Node* value_top = _gvn.transform(new (C) ProjNode(time, TypeFunc::Parms+1)); |
0 | 3287 assert(value_top == top(), "second value must be top"); |
3288 #endif | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3289 set_result(value); |
0 | 3290 return true; |
3291 } | |
3292 | |
3293 //------------------------inline_native_currentThread------------------ | |
3294 bool LibraryCallKit::inline_native_currentThread() { | |
3295 Node* junk = NULL; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3296 set_result(generate_current_thread(junk)); |
0 | 3297 return true; |
3298 } | |
3299 | |
3300 //------------------------inline_native_isInterrupted------------------ | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3301 // private native boolean java.lang.Thread.isInterrupted(boolean ClearInterrupted); |
0 | 3302 bool LibraryCallKit::inline_native_isInterrupted() { |
3303 // Add a fast path to t.isInterrupted(clear_int): | |
17716
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3304 // (t == Thread.current() && |
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3305 // (!TLS._osthread._interrupted || WINDOWS_ONLY(false) NOT_WINDOWS(!clear_int))) |
0 | 3306 // ? TLS._osthread._interrupted : /*slow path:*/ t.isInterrupted(clear_int) |
3307 // So, in the common case that the interrupt bit is false, | |
3308 // we avoid making a call into the VM. Even if the interrupt bit | |
3309 // is true, if the clear_int argument is false, we avoid the VM call. | |
3310 // However, if the receiver is not currentThread, we must call the VM, | |
3311 // because there must be some locking done around the operation. | |
3312 | |
3313 // We only go to the fast case code if we pass two guards. | |
3314 // Paths which do not pass are accumulated in the slow_region. | |
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3315 |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3316 enum { |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3317 no_int_result_path = 1, // t == Thread.current() && !TLS._osthread._interrupted |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3318 no_clear_result_path = 2, // t == Thread.current() && TLS._osthread._interrupted && !clear_int |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3319 slow_result_path = 3, // slow path: t.isInterrupted(clear_int) |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3320 PATH_LIMIT |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3321 }; |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3322 |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3323 // Ensure that it's not possible to move the load of TLS._osthread._interrupted flag |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3324 // out of the function. |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3325 insert_mem_bar(Op_MemBarCPUOrder); |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3326 |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3327 RegionNode* result_rgn = new (C) RegionNode(PATH_LIMIT); |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3328 PhiNode* result_val = new (C) PhiNode(result_rgn, TypeInt::BOOL); |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3329 |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3330 RegionNode* slow_region = new (C) RegionNode(1); |
0 | 3331 record_for_igvn(slow_region); |
3332 | |
3333 // (a) Receiving thread must be the current thread. | |
3334 Node* rec_thr = argument(0); | |
3335 Node* tls_ptr = NULL; | |
3336 Node* cur_thr = generate_current_thread(tls_ptr); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3337 Node* cmp_thr = _gvn.transform(new (C) CmpPNode(cur_thr, rec_thr)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3338 Node* bol_thr = _gvn.transform(new (C) BoolNode(cmp_thr, BoolTest::ne)); |
0 | 3339 |
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3340 generate_slow_guard(bol_thr, slow_region); |
0 | 3341 |
3342 // (b) Interrupt bit on TLS must be false. | |
3343 Node* p = basic_plus_adr(top()/*!oop*/, tls_ptr, in_bytes(JavaThread::osthread_offset())); | |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3344 Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS, MemNode::unordered); |
0 | 3345 p = basic_plus_adr(top()/*!oop*/, osthread, in_bytes(OSThread::interrupted_offset())); |
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3346 |
787
aabd393cf1ee
6772683: Thread.isInterrupted() fails to return true on multiprocessor PC
kvn
parents:
775
diff
changeset
|
3347 // Set the control input on the field _interrupted read to prevent it floating up. |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3348 Node* int_bit = make_load(control(), p, TypeInt::BOOL, T_INT, MemNode::unordered); |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3349 Node* cmp_bit = _gvn.transform(new (C) CmpINode(int_bit, intcon(0))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3350 Node* bol_bit = _gvn.transform(new (C) BoolNode(cmp_bit, BoolTest::ne)); |
0 | 3351 |
3352 IfNode* iff_bit = create_and_map_if(control(), bol_bit, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN); | |
3353 | |
3354 // First fast path: if (!TLS._interrupted) return false; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3355 Node* false_bit = _gvn.transform(new (C) IfFalseNode(iff_bit)); |
0 | 3356 result_rgn->init_req(no_int_result_path, false_bit); |
3357 result_val->init_req(no_int_result_path, intcon(0)); | |
3358 | |
3359 // drop through to next case | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3360 set_control( _gvn.transform(new (C) IfTrueNode(iff_bit))); |
0 | 3361 |
17716
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3362 #ifndef TARGET_OS_FAMILY_windows |
0 | 3363 // (c) Or, if interrupt bit is set and clear_int is false, use 2nd fast path. |
3364 Node* clr_arg = argument(1); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3365 Node* cmp_arg = _gvn.transform(new (C) CmpINode(clr_arg, intcon(0))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3366 Node* bol_arg = _gvn.transform(new (C) BoolNode(cmp_arg, BoolTest::ne)); |
0 | 3367 IfNode* iff_arg = create_and_map_if(control(), bol_arg, PROB_FAIR, COUNT_UNKNOWN); |
3368 | |
3369 // Second fast path: ... else if (!clear_int) return true; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3370 Node* false_arg = _gvn.transform(new (C) IfFalseNode(iff_arg)); |
0 | 3371 result_rgn->init_req(no_clear_result_path, false_arg); |
3372 result_val->init_req(no_clear_result_path, intcon(1)); | |
3373 | |
3374 // drop through to next case | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3375 set_control( _gvn.transform(new (C) IfTrueNode(iff_arg))); |
17716
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3376 #else |
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3377 // To return true on Windows you must read the _interrupted field |
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3378 // and check the the event state i.e. take the slow path. |
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3379 #endif // TARGET_OS_FAMILY_windows |
0 | 3380 |
3381 // (d) Otherwise, go to the slow path. | |
3382 slow_region->add_req(control()); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3383 set_control( _gvn.transform(slow_region)); |
0 | 3384 |
3385 if (stopped()) { | |
3386 // There is no slow path. | |
3387 result_rgn->init_req(slow_result_path, top()); | |
3388 result_val->init_req(slow_result_path, top()); | |
3389 } else { | |
3390 // non-virtual because it is a private non-static | |
3391 CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_isInterrupted); | |
3392 | |
3393 Node* slow_val = set_results_for_java_call(slow_call); | |
3394 // this->control() comes from set_results_for_java_call | |
3395 | |
3396 Node* fast_io = slow_call->in(TypeFunc::I_O); | |
3397 Node* fast_mem = slow_call->in(TypeFunc::Memory); | |
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3398 |
0 | 3399 // These two phis are pre-filled with copies of of the fast IO and Memory |
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3400 PhiNode* result_mem = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM); |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3401 PhiNode* result_io = PhiNode::make(result_rgn, fast_io, Type::ABIO); |
0 | 3402 |
3403 result_rgn->init_req(slow_result_path, control()); | |
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3404 result_io ->init_req(slow_result_path, i_o()); |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3405 result_mem->init_req(slow_result_path, reset_memory()); |
0 | 3406 result_val->init_req(slow_result_path, slow_val); |
3407 | |
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3408 set_all_memory(_gvn.transform(result_mem)); |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3409 set_i_o( _gvn.transform(result_io)); |
0 | 3410 } |
3411 | |
3412 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3413 set_result(result_rgn, result_val); |
0 | 3414 return true; |
3415 } | |
3416 | |
3417 //---------------------------load_mirror_from_klass---------------------------- | |
3418 // Given a klass oop, load its java mirror (a java.lang.Class oop). | |
3419 Node* LibraryCallKit::load_mirror_from_klass(Node* klass) { | |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3420 Node* p = basic_plus_adr(klass, in_bytes(Klass::java_mirror_offset())); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3421 return make_load(NULL, p, TypeInstPtr::MIRROR, T_OBJECT, MemNode::unordered); |
0 | 3422 } |
3423 | |
3424 //-----------------------load_klass_from_mirror_common------------------------- | |
3425 // Given a java mirror (a java.lang.Class oop), load its corresponding klass oop. | |
3426 // Test the klass oop for null (signifying a primitive Class like Integer.TYPE), | |
3427 // and branch to the given path on the region. | |
3428 // If never_see_null, take an uncommon trap on null, so we can optimistically | |
3429 // compile for the non-null case. | |
3430 // If the region is NULL, force never_see_null = true. | |
3431 Node* LibraryCallKit::load_klass_from_mirror_common(Node* mirror, | |
3432 bool never_see_null, | |
3433 RegionNode* region, | |
3434 int null_path, | |
3435 int offset) { | |
3436 if (region == NULL) never_see_null = true; | |
3437 Node* p = basic_plus_adr(mirror, offset); | |
3438 const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL; | |
20627
e7b3d177adda
8057622: java/util/stream/test/org/openjdk/tests/java/util/stream/InfiniteStreamWithLimitOpTest: SEGV inside compiled code (sparc)
zmajo
parents:
20441
diff
changeset
|
3439 Node* kls = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeRawPtr::BOTTOM, kls_type)); |
0 | 3440 Node* null_ctl = top(); |
3441 kls = null_check_oop(kls, &null_ctl, never_see_null); | |
3442 if (region != NULL) { | |
3443 // Set region->in(null_path) if the mirror is a primitive (e.g, int.class). | |
3444 region->init_req(null_path, null_ctl); | |
3445 } else { | |
3446 assert(null_ctl == top(), "no loose ends"); | |
3447 } | |
3448 return kls; | |
3449 } | |
3450 | |
3451 //--------------------(inline_native_Class_query helpers)--------------------- | |
3452 // Use this for JVM_ACC_INTERFACE, JVM_ACC_IS_CLONEABLE, JVM_ACC_HAS_FINALIZER. | |
3453 // Fall through if (mods & mask) == bits, take the guard otherwise. | |
3454 Node* LibraryCallKit::generate_access_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region) { | |
3455 // Branch around if the given klass has the given modifier bit set. | |
3456 // Like generate_guard, adds a new path onto the region. | |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3457 Node* modp = basic_plus_adr(kls, in_bytes(Klass::access_flags_offset())); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3458 Node* mods = make_load(NULL, modp, TypeInt::INT, T_INT, MemNode::unordered); |
0 | 3459 Node* mask = intcon(modifier_mask); |
3460 Node* bits = intcon(modifier_bits); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3461 Node* mbit = _gvn.transform(new (C) AndINode(mods, mask)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3462 Node* cmp = _gvn.transform(new (C) CmpINode(mbit, bits)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3463 Node* bol = _gvn.transform(new (C) BoolNode(cmp, BoolTest::ne)); |
0 | 3464 return generate_fair_guard(bol, region); |
3465 } | |
3466 Node* LibraryCallKit::generate_interface_guard(Node* kls, RegionNode* region) { | |
3467 return generate_access_flags_guard(kls, JVM_ACC_INTERFACE, 0, region); | |
3468 } | |
3469 | |
3470 //-------------------------inline_native_Class_query------------------- | |
3471 bool LibraryCallKit::inline_native_Class_query(vmIntrinsics::ID id) { | |
3472 const Type* return_type = TypeInt::BOOL; | |
3473 Node* prim_return_value = top(); // what happens if it's a primitive class? | |
3474 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
3475 bool expect_prim = false; // most of these guys expect to work on refs | |
3476 | |
3477 enum { _normal_path = 1, _prim_path = 2, PATH_LIMIT }; | |
3478 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3479 Node* mirror = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3480 Node* obj = top(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3481 |
0 | 3482 switch (id) { |
3483 case vmIntrinsics::_isInstance: | |
3484 // nothing is an instance of a primitive type | |
3485 prim_return_value = intcon(0); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3486 obj = argument(1); |
0 | 3487 break; |
3488 case vmIntrinsics::_getModifiers: | |
3489 prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC); | |
3490 assert(is_power_of_2((int)JVM_ACC_WRITTEN_FLAGS+1), "change next line"); | |
3491 return_type = TypeInt::make(0, JVM_ACC_WRITTEN_FLAGS, Type::WidenMin); | |
3492 break; | |
3493 case vmIntrinsics::_isInterface: | |
3494 prim_return_value = intcon(0); | |
3495 break; | |
3496 case vmIntrinsics::_isArray: | |
3497 prim_return_value = intcon(0); | |
3498 expect_prim = true; // cf. ObjectStreamClass.getClassSignature | |
3499 break; | |
3500 case vmIntrinsics::_isPrimitive: | |
3501 prim_return_value = intcon(1); | |
3502 expect_prim = true; // obviously | |
3503 break; | |
3504 case vmIntrinsics::_getSuperclass: | |
3505 prim_return_value = null(); | |
3506 return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR); | |
3507 break; | |
3508 case vmIntrinsics::_getComponentType: | |
3509 prim_return_value = null(); | |
3510 return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR); | |
3511 break; | |
3512 case vmIntrinsics::_getClassAccessFlags: | |
3513 prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC); | |
3514 return_type = TypeInt::INT; // not bool! 6297094 | |
3515 break; | |
3516 default: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3517 fatal_unexpected_iid(id); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3518 break; |
0 | 3519 } |
3520 | |
3521 const TypeInstPtr* mirror_con = _gvn.type(mirror)->isa_instptr(); | |
3522 if (mirror_con == NULL) return false; // cannot happen? | |
3523 | |
3524 #ifndef PRODUCT | |
12295 | 3525 if (C->print_intrinsics() || C->print_inlining()) { |
0 | 3526 ciType* k = mirror_con->java_mirror_type(); |
3527 if (k) { | |
3528 tty->print("Inlining %s on constant Class ", vmIntrinsics::name_at(intrinsic_id())); | |
3529 k->print_name(); | |
3530 tty->cr(); | |
3531 } | |
3532 } | |
3533 #endif | |
3534 | |
3535 // Null-check the mirror, and the mirror's klass ptr (in case it is a primitive). | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3536 RegionNode* region = new (C) RegionNode(PATH_LIMIT); |
0 | 3537 record_for_igvn(region); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3538 PhiNode* phi = new (C) PhiNode(region, return_type); |
0 | 3539 |
3540 // The mirror will never be null of Reflection.getClassAccessFlags, however | |
3541 // it may be null for Class.isInstance or Class.getModifiers. Throw a NPE | |
3542 // if it is. See bug 4774291. | |
3543 | |
3544 // For Reflection.getClassAccessFlags(), the null check occurs in | |
3545 // the wrong place; see inline_unsafe_access(), above, for a similar | |
3546 // situation. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3547 mirror = null_check(mirror); |
0 | 3548 // If mirror or obj is dead, only null-path is taken. |
3549 if (stopped()) return true; | |
3550 | |
3551 if (expect_prim) never_see_null = false; // expect nulls (meaning prims) | |
3552 | |
3553 // Now load the mirror's klass metaobject, and null-check it. | |
3554 // Side-effects region with the control path if the klass is null. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3555 Node* kls = load_klass_from_mirror(mirror, never_see_null, region, _prim_path); |
0 | 3556 // If kls is null, we have a primitive mirror. |
3557 phi->init_req(_prim_path, prim_return_value); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3558 if (stopped()) { set_result(region, phi); return true; } |
12966 | 3559 bool safe_for_replace = (region->in(_prim_path) == top()); |
0 | 3560 |
3561 Node* p; // handy temp | |
3562 Node* null_ctl; | |
3563 | |
3564 // Now that we have the non-null klass, we can perform the real query. | |
3565 // For constant classes, the query will constant-fold in LoadNode::Value. | |
3566 Node* query_value = top(); | |
3567 switch (id) { | |
3568 case vmIntrinsics::_isInstance: | |
3569 // nothing is an instance of a primitive type | |
12966 | 3570 query_value = gen_instanceof(obj, kls, safe_for_replace); |
0 | 3571 break; |
3572 | |
3573 case vmIntrinsics::_getModifiers: | |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3574 p = basic_plus_adr(kls, in_bytes(Klass::modifier_flags_offset())); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3575 query_value = make_load(NULL, p, TypeInt::INT, T_INT, MemNode::unordered); |
0 | 3576 break; |
3577 | |
3578 case vmIntrinsics::_isInterface: | |
3579 // (To verify this code sequence, check the asserts in JVM_IsInterface.) | |
3580 if (generate_interface_guard(kls, region) != NULL) | |
3581 // A guard was added. If the guard is taken, it was an interface. | |
3582 phi->add_req(intcon(1)); | |
3583 // If we fall through, it's a plain class. | |
3584 query_value = intcon(0); | |
3585 break; | |
3586 | |
3587 case vmIntrinsics::_isArray: | |
3588 // (To verify this code sequence, check the asserts in JVM_IsArrayClass.) | |
3589 if (generate_array_guard(kls, region) != NULL) | |
3590 // A guard was added. If the guard is taken, it was an array. | |
3591 phi->add_req(intcon(1)); | |
3592 // If we fall through, it's a plain class. | |
3593 query_value = intcon(0); | |
3594 break; | |
3595 | |
3596 case vmIntrinsics::_isPrimitive: | |
3597 query_value = intcon(0); // "normal" path produces false | |
3598 break; | |
3599 | |
3600 case vmIntrinsics::_getSuperclass: | |
3601 // The rules here are somewhat unfortunate, but we can still do better | |
3602 // with random logic than with a JNI call. | |
3603 // Interfaces store null or Object as _super, but must report null. | |
3604 // Arrays store an intermediate super as _super, but must report Object. | |
3605 // Other types can report the actual _super. | |
3606 // (To verify this code sequence, check the asserts in JVM_IsInterface.) | |
3607 if (generate_interface_guard(kls, region) != NULL) | |
3608 // A guard was added. If the guard is taken, it was an interface. | |
3609 phi->add_req(null()); | |
3610 if (generate_array_guard(kls, region) != NULL) | |
3611 // A guard was added. If the guard is taken, it was an array. | |
3612 phi->add_req(makecon(TypeInstPtr::make(env()->Object_klass()->java_mirror()))); | |
3613 // If we fall through, it's a plain class. Get its _super. | |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3614 p = basic_plus_adr(kls, in_bytes(Klass::super_offset())); |
20627
e7b3d177adda
8057622: java/util/stream/test/org/openjdk/tests/java/util/stream/InfiniteStreamWithLimitOpTest: SEGV inside compiled code (sparc)
zmajo
parents:
20441
diff
changeset
|
3615 kls = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeRawPtr::BOTTOM, TypeKlassPtr::OBJECT_OR_NULL)); |
0 | 3616 null_ctl = top(); |
3617 kls = null_check_oop(kls, &null_ctl); | |
3618 if (null_ctl != top()) { | |
3619 // If the guard is taken, Object.superClass is null (both klass and mirror). | |
3620 region->add_req(null_ctl); | |
3621 phi ->add_req(null()); | |
3622 } | |
3623 if (!stopped()) { | |
3624 query_value = load_mirror_from_klass(kls); | |
3625 } | |
3626 break; | |
3627 | |
3628 case vmIntrinsics::_getComponentType: | |
3629 if (generate_array_guard(kls, region) != NULL) { | |
3630 // Be sure to pin the oop load to the guard edge just created: | |
3631 Node* is_array_ctrl = region->in(region->req()-1); | |
6831
d8ce2825b193
8000213: NPG: Should have renamed arrayKlass and typeArrayKlass
coleenp
parents:
6804
diff
changeset
|
3632 Node* cma = basic_plus_adr(kls, in_bytes(ArrayKlass::component_mirror_offset())); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3633 Node* cmo = make_load(is_array_ctrl, cma, TypeInstPtr::MIRROR, T_OBJECT, MemNode::unordered); |
0 | 3634 phi->add_req(cmo); |
3635 } | |
3636 query_value = null(); // non-array case is null | |
3637 break; | |
3638 | |
3639 case vmIntrinsics::_getClassAccessFlags: | |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3640 p = basic_plus_adr(kls, in_bytes(Klass::access_flags_offset())); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3641 query_value = make_load(NULL, p, TypeInt::INT, T_INT, MemNode::unordered); |
0 | 3642 break; |
3643 | |
3644 default: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3645 fatal_unexpected_iid(id); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3646 break; |
0 | 3647 } |
3648 | |
3649 // Fall-through is the normal case of a query to a real class. | |
3650 phi->init_req(1, query_value); | |
3651 region->init_req(1, control()); | |
3652 | |
3653 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3654 set_result(region, phi); |
0 | 3655 return true; |
3656 } | |
3657 | |
3658 //--------------------------inline_native_subtype_check------------------------ | |
3659 // This intrinsic takes the JNI calls out of the heart of | |
3660 // UnsafeFieldAccessorImpl.set, which improves Field.set, readObject, etc. | |
3661 bool LibraryCallKit::inline_native_subtype_check() { | |
3662 // Pull both arguments off the stack. | |
3663 Node* args[2]; // two java.lang.Class mirrors: superc, subc | |
3664 args[0] = argument(0); | |
3665 args[1] = argument(1); | |
3666 Node* klasses[2]; // corresponding Klasses: superk, subk | |
3667 klasses[0] = klasses[1] = top(); | |
3668 | |
3669 enum { | |
3670 // A full decision tree on {superc is prim, subc is prim}: | |
3671 _prim_0_path = 1, // {P,N} => false | |
3672 // {P,P} & superc!=subc => false | |
3673 _prim_same_path, // {P,P} & superc==subc => true | |
3674 _prim_1_path, // {N,P} => false | |
3675 _ref_subtype_path, // {N,N} & subtype check wins => true | |
3676 _both_ref_path, // {N,N} & subtype check loses => false | |
3677 PATH_LIMIT | |
3678 }; | |
3679 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3680 RegionNode* region = new (C) RegionNode(PATH_LIMIT); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3681 Node* phi = new (C) PhiNode(region, TypeInt::BOOL); |
0 | 3682 record_for_igvn(region); |
3683 | |
3684 const TypePtr* adr_type = TypeRawPtr::BOTTOM; // memory type of loads | |
3685 const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL; | |
3686 int class_klass_offset = java_lang_Class::klass_offset_in_bytes(); | |
3687 | |
3688 // First null-check both mirrors and load each mirror's klass metaobject. | |
3689 int which_arg; | |
3690 for (which_arg = 0; which_arg <= 1; which_arg++) { | |
3691 Node* arg = args[which_arg]; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3692 arg = null_check(arg); |
0 | 3693 if (stopped()) break; |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
3694 args[which_arg] = arg; |
0 | 3695 |
3696 Node* p = basic_plus_adr(arg, class_klass_offset); | |
20627
e7b3d177adda
8057622: java/util/stream/test/org/openjdk/tests/java/util/stream/InfiniteStreamWithLimitOpTest: SEGV inside compiled code (sparc)
zmajo
parents:
20441
diff
changeset
|
3697 Node* kls = LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, adr_type, kls_type); |
0 | 3698 klasses[which_arg] = _gvn.transform(kls); |
3699 } | |
3700 | |
3701 // Having loaded both klasses, test each for null. | |
3702 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
3703 for (which_arg = 0; which_arg <= 1; which_arg++) { | |
3704 Node* kls = klasses[which_arg]; | |
3705 Node* null_ctl = top(); | |
3706 kls = null_check_oop(kls, &null_ctl, never_see_null); | |
3707 int prim_path = (which_arg == 0 ? _prim_0_path : _prim_1_path); | |
3708 region->init_req(prim_path, null_ctl); | |
3709 if (stopped()) break; | |
3710 klasses[which_arg] = kls; | |
3711 } | |
3712 | |
3713 if (!stopped()) { | |
3714 // now we have two reference types, in klasses[0..1] | |
3715 Node* subk = klasses[1]; // the argument to isAssignableFrom | |
3716 Node* superk = klasses[0]; // the receiver | |
3717 region->set_req(_both_ref_path, gen_subtype_check(subk, superk)); | |
3718 // now we have a successful reference subtype check | |
3719 region->set_req(_ref_subtype_path, control()); | |
3720 } | |
3721 | |
3722 // If both operands are primitive (both klasses null), then | |
3723 // we must return true when they are identical primitives. | |
3724 // It is convenient to test this after the first null klass check. | |
3725 set_control(region->in(_prim_0_path)); // go back to first null check | |
3726 if (!stopped()) { | |
3727 // Since superc is primitive, make a guard for the superc==subc case. | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3728 Node* cmp_eq = _gvn.transform(new (C) CmpPNode(args[0], args[1])); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3729 Node* bol_eq = _gvn.transform(new (C) BoolNode(cmp_eq, BoolTest::eq)); |
0 | 3730 generate_guard(bol_eq, region, PROB_FAIR); |
3731 if (region->req() == PATH_LIMIT+1) { | |
3732 // A guard was added. If the added guard is taken, superc==subc. | |
3733 region->swap_edges(PATH_LIMIT, _prim_same_path); | |
3734 region->del_req(PATH_LIMIT); | |
3735 } | |
3736 region->set_req(_prim_0_path, control()); // Not equal after all. | |
3737 } | |
3738 | |
3739 // these are the only paths that produce 'true': | |
3740 phi->set_req(_prim_same_path, intcon(1)); | |
3741 phi->set_req(_ref_subtype_path, intcon(1)); | |
3742 | |
3743 // pull together the cases: | |
3744 assert(region->req() == PATH_LIMIT, "sane region"); | |
3745 for (uint i = 1; i < region->req(); i++) { | |
3746 Node* ctl = region->in(i); | |
3747 if (ctl == NULL || ctl == top()) { | |
3748 region->set_req(i, top()); | |
3749 phi ->set_req(i, top()); | |
3750 } else if (phi->in(i) == NULL) { | |
3751 phi->set_req(i, intcon(0)); // all other paths produce 'false' | |
3752 } | |
3753 } | |
3754 | |
3755 set_control(_gvn.transform(region)); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3756 set_result(_gvn.transform(phi)); |
0 | 3757 return true; |
3758 } | |
3759 | |
3760 //---------------------generate_array_guard_common------------------------ | |
3761 Node* LibraryCallKit::generate_array_guard_common(Node* kls, RegionNode* region, | |
3762 bool obj_array, bool not_array) { | |
3763 // If obj_array/non_array==false/false: | |
3764 // Branch around if the given klass is in fact an array (either obj or prim). | |
3765 // If obj_array/non_array==false/true: | |
3766 // Branch around if the given klass is not an array klass of any kind. | |
3767 // If obj_array/non_array==true/true: | |
3768 // Branch around if the kls is not an oop array (kls is int[], String, etc.) | |
3769 // If obj_array/non_array==true/false: | |
3770 // Branch around if the kls is an oop array (Object[] or subtype) | |
3771 // | |
3772 // Like generate_guard, adds a new path onto the region. | |
3773 jint layout_con = 0; | |
3774 Node* layout_val = get_layout_helper(kls, layout_con); | |
3775 if (layout_val == NULL) { | |
3776 bool query = (obj_array | |
3777 ? Klass::layout_helper_is_objArray(layout_con) | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
3778 : Klass::layout_helper_is_array(layout_con)); |
0 | 3779 if (query == not_array) { |
3780 return NULL; // never a branch | |
3781 } else { // always a branch | |
3782 Node* always_branch = control(); | |
3783 if (region != NULL) | |
3784 region->add_req(always_branch); | |
3785 set_control(top()); | |
3786 return always_branch; | |
3787 } | |
3788 } | |
3789 // Now test the correct condition. | |
3790 jint nval = (obj_array | |
3791 ? ((jint)Klass::_lh_array_tag_type_value | |
3792 << Klass::_lh_array_tag_shift) | |
3793 : Klass::_lh_neutral_value); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3794 Node* cmp = _gvn.transform(new(C) CmpINode(layout_val, intcon(nval))); |
0 | 3795 BoolTest::mask btest = BoolTest::lt; // correct for testing is_[obj]array |
3796 // invert the test if we are looking for a non-array | |
3797 if (not_array) btest = BoolTest(btest).negate(); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3798 Node* bol = _gvn.transform(new(C) BoolNode(cmp, btest)); |
0 | 3799 return generate_fair_guard(bol, region); |
3800 } | |
3801 | |
3802 | |
3803 //-----------------------inline_native_newArray-------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3804 // private static native Object java.lang.reflect.newArray(Class<?> componentType, int length); |
0 | 3805 bool LibraryCallKit::inline_native_newArray() { |
3806 Node* mirror = argument(0); | |
3807 Node* count_val = argument(1); | |
3808 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3809 mirror = null_check(mirror); |
163 | 3810 // If mirror or obj is dead, only null-path is taken. |
3811 if (stopped()) return true; | |
0 | 3812 |
3813 enum { _normal_path = 1, _slow_path = 2, PATH_LIMIT }; | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3814 RegionNode* result_reg = new(C) RegionNode(PATH_LIMIT); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3815 PhiNode* result_val = new(C) PhiNode(result_reg, |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3816 TypeInstPtr::NOTNULL); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3817 PhiNode* result_io = new(C) PhiNode(result_reg, Type::ABIO); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3818 PhiNode* result_mem = new(C) PhiNode(result_reg, Type::MEMORY, |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3819 TypePtr::BOTTOM); |
0 | 3820 |
3821 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
3822 Node* klass_node = load_array_klass_from_mirror(mirror, never_see_null, | |
3823 result_reg, _slow_path); | |
3824 Node* normal_ctl = control(); | |
3825 Node* no_array_ctl = result_reg->in(_slow_path); | |
3826 | |
3827 // Generate code for the slow case. We make a call to newArray(). | |
3828 set_control(no_array_ctl); | |
3829 if (!stopped()) { | |
3830 // Either the input type is void.class, or else the | |
3831 // array klass has not yet been cached. Either the | |
3832 // ensuing call will throw an exception, or else it | |
3833 // will cache the array klass for next time. | |
3834 PreserveJVMState pjvms(this); | |
3835 CallJavaNode* slow_call = generate_method_call_static(vmIntrinsics::_newArray); | |
3836 Node* slow_result = set_results_for_java_call(slow_call); | |
3837 // this->control() comes from set_results_for_java_call | |
3838 result_reg->set_req(_slow_path, control()); | |
3839 result_val->set_req(_slow_path, slow_result); | |
3840 result_io ->set_req(_slow_path, i_o()); | |
3841 result_mem->set_req(_slow_path, reset_memory()); | |
3842 } | |
3843 | |
3844 set_control(normal_ctl); | |
3845 if (!stopped()) { | |
3846 // Normal case: The array type has been cached in the java.lang.Class. | |
3847 // The following call works fine even if the array type is polymorphic. | |
3848 // It could be a dynamic mix of int[], boolean[], Object[], etc. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3849 Node* obj = new_array(klass_node, count_val, 0); // no arguments to push |
0 | 3850 result_reg->init_req(_normal_path, control()); |
3851 result_val->init_req(_normal_path, obj); | |
3852 result_io ->init_req(_normal_path, i_o()); | |
3853 result_mem->init_req(_normal_path, reset_memory()); | |
3854 } | |
3855 | |
3856 // Return the combined state. | |
3857 set_i_o( _gvn.transform(result_io) ); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3858 set_all_memory( _gvn.transform(result_mem)); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3859 |
0 | 3860 C->set_has_split_ifs(true); // Has chance for split-if optimization |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3861 set_result(result_reg, result_val); |
0 | 3862 return true; |
3863 } | |
3864 | |
3865 //----------------------inline_native_getLength-------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3866 // public static native int java.lang.reflect.Array.getLength(Object array); |
0 | 3867 bool LibraryCallKit::inline_native_getLength() { |
3868 if (too_many_traps(Deoptimization::Reason_intrinsic)) return false; | |
3869 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3870 Node* array = null_check(argument(0)); |
0 | 3871 // If array is dead, only null-path is taken. |
3872 if (stopped()) return true; | |
3873 | |
3874 // Deoptimize if it is a non-array. | |
3875 Node* non_array = generate_non_array_guard(load_object_klass(array), NULL); | |
3876 | |
3877 if (non_array != NULL) { | |
3878 PreserveJVMState pjvms(this); | |
3879 set_control(non_array); | |
3880 uncommon_trap(Deoptimization::Reason_intrinsic, | |
3881 Deoptimization::Action_maybe_recompile); | |
3882 } | |
3883 | |
3884 // If control is dead, only non-array-path is taken. | |
3885 if (stopped()) return true; | |
3886 | |
3887 // The works fine even if the array type is polymorphic. | |
3888 // It could be a dynamic mix of int[], boolean[], Object[], etc. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3889 Node* result = load_array_length(array); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3890 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3891 C->set_has_split_ifs(true); // Has chance for split-if optimization |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3892 set_result(result); |
0 | 3893 return true; |
3894 } | |
3895 | |
3896 //------------------------inline_array_copyOf---------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3897 // public static <T,U> T[] java.util.Arrays.copyOf( U[] original, int newLength, Class<? extends T[]> newType); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3898 // public static <T,U> T[] java.util.Arrays.copyOfRange(U[] original, int from, int to, Class<? extends T[]> newType); |
0 | 3899 bool LibraryCallKit::inline_array_copyOf(bool is_copyOfRange) { |
3900 if (too_many_traps(Deoptimization::Reason_intrinsic)) return false; | |
3901 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3902 // Get the arguments. |
0 | 3903 Node* original = argument(0); |
3904 Node* start = is_copyOfRange? argument(1): intcon(0); | |
3905 Node* end = is_copyOfRange? argument(2): argument(1); | |
3906 Node* array_type_mirror = is_copyOfRange? argument(3): argument(2); | |
3907 | |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3908 Node* newcopy; |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3909 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3910 // Set the original stack and the reexecute bit for the interpreter to reexecute |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3911 // the bytecode that invokes Arrays.copyOf if deoptimization happens. |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3912 { PreserveReexecuteState preexecs(this); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3913 jvms()->set_should_reexecute(true); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3914 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3915 array_type_mirror = null_check(array_type_mirror); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3916 original = null_check(original); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3917 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3918 // Check if a null path was taken unconditionally. |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3919 if (stopped()) return true; |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3920 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3921 Node* orig_length = load_array_length(original); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3922 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3923 Node* klass_node = load_klass_from_mirror(array_type_mirror, false, NULL, 0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3924 klass_node = null_check(klass_node); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3925 |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3926 RegionNode* bailout = new (C) RegionNode(1); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3927 record_for_igvn(bailout); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3928 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3929 // Despite the generic type of Arrays.copyOf, the mirror might be int, int[], etc. |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3930 // Bail out if that is so. |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3931 Node* not_objArray = generate_non_objArray_guard(klass_node, bailout); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3932 if (not_objArray != NULL) { |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3933 // Improve the klass node's type from the new optimistic assumption: |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3934 ciKlass* ak = ciArrayKlass::make(env()->Object_klass()); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3935 const Type* akls = TypeKlassPtr::make(TypePtr::NotNull, ak, 0/*offset*/); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3936 Node* cast = new (C) CastPPNode(klass_node, akls); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3937 cast->init_req(0, control()); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3938 klass_node = _gvn.transform(cast); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3939 } |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3940 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3941 // Bail out if either start or end is negative. |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3942 generate_negative_guard(start, bailout, &start); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3943 generate_negative_guard(end, bailout, &end); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3944 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3945 Node* length = end; |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3946 if (_gvn.type(start) != TypeInt::ZERO) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3947 length = _gvn.transform(new (C) SubINode(end, start)); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3948 } |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3949 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3950 // Bail out if length is negative. |
6180
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3951 // Without this the new_array would throw |
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3952 // NegativeArraySizeException but IllegalArgumentException is what |
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3953 // should be thrown |
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3954 generate_negative_guard(length, bailout, &length); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3955 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3956 if (bailout->req() > 1) { |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3957 PreserveJVMState pjvms(this); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3958 set_control(_gvn.transform(bailout)); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3959 uncommon_trap(Deoptimization::Reason_intrinsic, |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3960 Deoptimization::Action_maybe_recompile); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3961 } |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3962 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3963 if (!stopped()) { |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3964 // How many elements will we copy from the original? |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3965 // The answer is MinI(orig_length - start, length). |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3966 Node* orig_tail = _gvn.transform(new (C) SubINode(orig_length, start)); |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3967 Node* moved = generate_min_max(vmIntrinsics::_min, orig_tail, length); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3968 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3969 newcopy = new_array(klass_node, length, 0); // no argments to push |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3970 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3971 // Generate a direct call to the right arraycopy function(s). |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3972 // We know the copy is disjoint but we might not know if the |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3973 // oop stores need checking. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3974 // Extreme case: Arrays.copyOf((Integer[])x, 10, String[].class). |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3975 // This will fail a store-check if x contains any non-nulls. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3976 bool disjoint_bases = true; |
6180
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3977 // if start > orig_length then the length of the copy may be |
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3978 // negative. |
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3979 bool length_never_negative = !is_copyOfRange; |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3980 generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3981 original, start, newcopy, intcon(0), moved, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3982 disjoint_bases, length_never_negative); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3983 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3984 } // original reexecute is set back here |
0 | 3985 |
3986 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3987 if (!stopped()) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3988 set_result(newcopy); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3989 } |
0 | 3990 return true; |
3991 } | |
3992 | |
3993 | |
3994 //----------------------generate_virtual_guard--------------------------- | |
3995 // Helper for hashCode and clone. Peeks inside the vtable to avoid a call. | |
3996 Node* LibraryCallKit::generate_virtual_guard(Node* obj_klass, | |
3997 RegionNode* slow_region) { | |
3998 ciMethod* method = callee(); | |
3999 int vtable_index = method->vtable_index(); | |
12264
b2e698d2276c
8014013: CallInfo structure no longer accurately reports the result of a LinkResolver operation
drchase
parents:
12190
diff
changeset
|
4000 assert(vtable_index >= 0 || vtable_index == Method::nonvirtual_vtable_index, |
b2e698d2276c
8014013: CallInfo structure no longer accurately reports the result of a LinkResolver operation
drchase
parents:
12190
diff
changeset
|
4001 err_msg_res("bad index %d", vtable_index)); |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4002 // Get the Method* out of the appropriate vtable entry. |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4003 int entry_offset = (InstanceKlass::vtable_start_offset() + |
0 | 4004 vtable_index*vtableEntry::size()) * wordSize + |
4005 vtableEntry::method_offset_in_bytes(); | |
4006 Node* entry_addr = basic_plus_adr(obj_klass, entry_offset); | |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
4007 Node* target_call = make_load(NULL, entry_addr, TypePtr::NOTNULL, T_ADDRESS, MemNode::unordered); |
0 | 4008 |
4009 // Compare the target method with the expected method (e.g., Object.hashCode). | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4010 const TypePtr* native_call_addr = TypeMetadataPtr::make(method); |
0 | 4011 |
4012 Node* native_call = makecon(native_call_addr); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4013 Node* chk_native = _gvn.transform(new(C) CmpPNode(target_call, native_call)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4014 Node* test_native = _gvn.transform(new(C) BoolNode(chk_native, BoolTest::ne)); |
0 | 4015 |
4016 return generate_slow_guard(test_native, slow_region); | |
4017 } | |
4018 | |
4019 //-----------------------generate_method_call---------------------------- | |
4020 // Use generate_method_call to make a slow-call to the real | |
4021 // method if the fast path fails. An alternative would be to | |
4022 // use a stub like OptoRuntime::slow_arraycopy_Java. | |
4023 // This only works for expanding the current library call, | |
4024 // not another intrinsic. (E.g., don't use this for making an | |
4025 // arraycopy call inside of the copyOf intrinsic.) | |
4026 CallJavaNode* | |
4027 LibraryCallKit::generate_method_call(vmIntrinsics::ID method_id, bool is_virtual, bool is_static) { | |
4028 // When compiling the intrinsic method itself, do not use this technique. | |
4029 guarantee(callee() != C->method(), "cannot make slow-call to self"); | |
4030 | |
4031 ciMethod* method = callee(); | |
4032 // ensure the JVMS we have will be correct for this call | |
4033 guarantee(method_id == method->intrinsic_id(), "must match"); | |
4034 | |
4035 const TypeFunc* tf = TypeFunc::make(method); | |
4036 CallJavaNode* slow_call; | |
4037 if (is_static) { | |
4038 assert(!is_virtual, ""); | |
10278 | 4039 slow_call = new(C) CallStaticJavaNode(C, tf, |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4040 SharedRuntime::get_resolve_static_call_stub(), |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4041 method, bci()); |
0 | 4042 } else if (is_virtual) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4043 null_check_receiver(); |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4044 int vtable_index = Method::invalid_vtable_index; |
0 | 4045 if (UseInlineCaches) { |
4046 // Suppress the vtable call | |
4047 } else { | |
4048 // hashCode and clone are not a miranda methods, | |
4049 // so the vtable index is fixed. | |
4050 // No need to use the linkResolver to get it. | |
4051 vtable_index = method->vtable_index(); | |
12264
b2e698d2276c
8014013: CallInfo structure no longer accurately reports the result of a LinkResolver operation
drchase
parents:
12190
diff
changeset
|
4052 assert(vtable_index >= 0 || vtable_index == Method::nonvirtual_vtable_index, |
b2e698d2276c
8014013: CallInfo structure no longer accurately reports the result of a LinkResolver operation
drchase
parents:
12190
diff
changeset
|
4053 err_msg_res("bad index %d", vtable_index)); |
0 | 4054 } |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4055 slow_call = new(C) CallDynamicJavaNode(tf, |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4056 SharedRuntime::get_resolve_virtual_call_stub(), |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4057 method, vtable_index, bci()); |
0 | 4058 } else { // neither virtual nor static: opt_virtual |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4059 null_check_receiver(); |
10278 | 4060 slow_call = new(C) CallStaticJavaNode(C, tf, |
0 | 4061 SharedRuntime::get_resolve_opt_virtual_call_stub(), |
4062 method, bci()); | |
4063 slow_call->set_optimized_virtual(true); | |
4064 } | |
4065 set_arguments_for_java_call(slow_call); | |
4066 set_edges_for_java_call(slow_call); | |
4067 return slow_call; | |
4068 } | |
4069 | |
4070 | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4071 /** |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4072 * Build special case code for calls to hashCode on an object. This call may |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4073 * be virtual (invokevirtual) or bound (invokespecial). For each case we generate |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4074 * slightly different code. |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4075 */ |
0 | 4076 bool LibraryCallKit::inline_native_hashcode(bool is_virtual, bool is_static) { |
4077 assert(is_static == callee()->is_static(), "correct intrinsic selection"); | |
4078 assert(!(is_virtual && is_static), "either virtual, special, or static"); | |
4079 | |
4080 enum { _slow_path = 1, _fast_path, _null_path, PATH_LIMIT }; | |
4081 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4082 RegionNode* result_reg = new(C) RegionNode(PATH_LIMIT); |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4083 PhiNode* result_val = new(C) PhiNode(result_reg, TypeInt::INT); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4084 PhiNode* result_io = new(C) PhiNode(result_reg, Type::ABIO); |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4085 PhiNode* result_mem = new(C) PhiNode(result_reg, Type::MEMORY, TypePtr::BOTTOM); |
0 | 4086 Node* obj = NULL; |
4087 if (!is_static) { | |
4088 // Check for hashing null object | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4089 obj = null_check_receiver(); |
0 | 4090 if (stopped()) return true; // unconditionally null |
4091 result_reg->init_req(_null_path, top()); | |
4092 result_val->init_req(_null_path, top()); | |
4093 } else { | |
4094 // Do a null check, and return zero if null. | |
4095 // System.identityHashCode(null) == 0 | |
4096 obj = argument(0); | |
4097 Node* null_ctl = top(); | |
4098 obj = null_check_oop(obj, &null_ctl); | |
4099 result_reg->init_req(_null_path, null_ctl); | |
4100 result_val->init_req(_null_path, _gvn.intcon(0)); | |
4101 } | |
4102 | |
4103 // Unconditionally null? Then return right away. | |
4104 if (stopped()) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4105 set_control( result_reg->in(_null_path)); |
0 | 4106 if (!stopped()) |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4107 set_result(result_val->in(_null_path)); |
0 | 4108 return true; |
4109 } | |
4110 | |
4111 // We only go to the fast case code if we pass a number of guards. The | |
4112 // paths which do not pass are accumulated in the slow_region. | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4113 RegionNode* slow_region = new (C) RegionNode(1); |
0 | 4114 record_for_igvn(slow_region); |
4115 | |
4116 // If this is a virtual call, we generate a funny guard. We pull out | |
4117 // the vtable entry corresponding to hashCode() from the target object. | |
4118 // If the target method which we are calling happens to be the native | |
4119 // Object hashCode() method, we pass the guard. We do not need this | |
4120 // guard for non-virtual calls -- the caller is known to be the native | |
4121 // Object hashCode(). | |
4122 if (is_virtual) { | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4123 // After null check, get the object's klass. |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4124 Node* obj_klass = load_object_klass(obj); |
0 | 4125 generate_virtual_guard(obj_klass, slow_region); |
4126 } | |
4127 | |
4128 // Get the header out of the object, use LoadMarkNode when available | |
4129 Node* header_addr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes()); | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4130 // The control of the load must be NULL. Otherwise, the load can move before |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4131 // the null check after castPP removal. |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4132 Node* no_ctrl = NULL; |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4133 Node* header = make_load(no_ctrl, header_addr, TypeX_X, TypeX_X->basic_type(), MemNode::unordered); |
0 | 4134 |
4135 // Test the header to see if it is unlocked. | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4136 Node* lock_mask = _gvn.MakeConX(markOopDesc::biased_lock_mask_in_place); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4137 Node* lmasked_header = _gvn.transform(new (C) AndXNode(header, lock_mask)); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4138 Node* unlocked_val = _gvn.MakeConX(markOopDesc::unlocked_value); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4139 Node* chk_unlocked = _gvn.transform(new (C) CmpXNode( lmasked_header, unlocked_val)); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4140 Node* test_unlocked = _gvn.transform(new (C) BoolNode( chk_unlocked, BoolTest::ne)); |
0 | 4141 |
4142 generate_slow_guard(test_unlocked, slow_region); | |
4143 | |
4144 // Get the hash value and check to see that it has been properly assigned. | |
4145 // We depend on hash_mask being at most 32 bits and avoid the use of | |
4146 // hash_mask_in_place because it could be larger than 32 bits in a 64-bit | |
4147 // vm: see markOop.hpp. | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4148 Node* hash_mask = _gvn.intcon(markOopDesc::hash_mask); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4149 Node* hash_shift = _gvn.intcon(markOopDesc::hash_shift); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4150 Node* hshifted_header= _gvn.transform(new (C) URShiftXNode(header, hash_shift)); |
0 | 4151 // This hack lets the hash bits live anywhere in the mark object now, as long |
605 | 4152 // as the shift drops the relevant bits into the low 32 bits. Note that |
0 | 4153 // Java spec says that HashCode is an int so there's no point in capturing |
4154 // an 'X'-sized hashcode (32 in 32-bit build or 64 in 64-bit build). | |
4155 hshifted_header = ConvX2I(hshifted_header); | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4156 Node* hash_val = _gvn.transform(new (C) AndINode(hshifted_header, hash_mask)); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4157 |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4158 Node* no_hash_val = _gvn.intcon(markOopDesc::no_hash); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4159 Node* chk_assigned = _gvn.transform(new (C) CmpINode( hash_val, no_hash_val)); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4160 Node* test_assigned = _gvn.transform(new (C) BoolNode( chk_assigned, BoolTest::eq)); |
0 | 4161 |
4162 generate_slow_guard(test_assigned, slow_region); | |
4163 | |
4164 Node* init_mem = reset_memory(); | |
4165 // fill in the rest of the null path: | |
4166 result_io ->init_req(_null_path, i_o()); | |
4167 result_mem->init_req(_null_path, init_mem); | |
4168 | |
4169 result_val->init_req(_fast_path, hash_val); | |
4170 result_reg->init_req(_fast_path, control()); | |
4171 result_io ->init_req(_fast_path, i_o()); | |
4172 result_mem->init_req(_fast_path, init_mem); | |
4173 | |
4174 // Generate code for the slow case. We make a call to hashCode(). | |
4175 set_control(_gvn.transform(slow_region)); | |
4176 if (!stopped()) { | |
4177 // No need for PreserveJVMState, because we're using up the present state. | |
4178 set_all_memory(init_mem); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4179 vmIntrinsics::ID hashCode_id = is_static ? vmIntrinsics::_identityHashCode : vmIntrinsics::_hashCode; |
0 | 4180 CallJavaNode* slow_call = generate_method_call(hashCode_id, is_virtual, is_static); |
4181 Node* slow_result = set_results_for_java_call(slow_call); | |
4182 // this->control() comes from set_results_for_java_call | |
4183 result_reg->init_req(_slow_path, control()); | |
4184 result_val->init_req(_slow_path, slow_result); | |
4185 result_io ->set_req(_slow_path, i_o()); | |
4186 result_mem ->set_req(_slow_path, reset_memory()); | |
4187 } | |
4188 | |
4189 // Return the combined state. | |
4190 set_i_o( _gvn.transform(result_io) ); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4191 set_all_memory( _gvn.transform(result_mem)); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4192 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4193 set_result(result_reg, result_val); |
0 | 4194 return true; |
4195 } | |
4196 | |
4197 //---------------------------inline_native_getClass---------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4198 // public final native Class<?> java.lang.Object.getClass(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4199 // |
605 | 4200 // Build special case code for calls to getClass on an object. |
0 | 4201 bool LibraryCallKit::inline_native_getClass() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4202 Node* obj = null_check_receiver(); |
0 | 4203 if (stopped()) return true; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4204 set_result(load_mirror_from_klass(load_object_klass(obj))); |
0 | 4205 return true; |
4206 } | |
4207 | |
4208 //-----------------inline_native_Reflection_getCallerClass--------------------- | |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4209 // public static native Class<?> sun.reflect.Reflection.getCallerClass(); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4210 // |
0 | 4211 // In the presence of deep enough inlining, getCallerClass() becomes a no-op. |
4212 // | |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4213 // NOTE: This code must perform the same logic as JVM_GetCallerClass |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4214 // in that it must skip particular security frames and checks for |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4215 // caller sensitive methods. |
0 | 4216 bool LibraryCallKit::inline_native_Reflection_getCallerClass() { |
4217 #ifndef PRODUCT | |
12295 | 4218 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
0 | 4219 tty->print_cr("Attempting to inline sun.reflect.Reflection.getCallerClass"); |
4220 } | |
4221 #endif | |
4222 | |
4223 if (!jvms()->has_method()) { | |
4224 #ifndef PRODUCT | |
12295 | 4225 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
0 | 4226 tty->print_cr(" Bailing out because intrinsic was inlined at top level"); |
4227 } | |
4228 #endif | |
4229 return false; | |
4230 } | |
4231 | |
4232 // Walk back up the JVM state to find the caller at the required | |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4233 // depth. |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4234 JVMState* caller_jvms = jvms(); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4235 |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4236 // Cf. JVM_GetCallerClass |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4237 // NOTE: Start the loop at depth 1 because the current JVM state does |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4238 // not include the Reflection.getCallerClass() frame. |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4239 for (int n = 1; caller_jvms != NULL; caller_jvms = caller_jvms->caller(), n++) { |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4240 ciMethod* m = caller_jvms->method(); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4241 switch (n) { |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4242 case 0: |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4243 fatal("current JVM state does not include the Reflection.getCallerClass frame"); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4244 break; |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4245 case 1: |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4246 // Frame 0 and 1 must be caller sensitive (see JVM_GetCallerClass). |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4247 if (!m->caller_sensitive()) { |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4248 #ifndef PRODUCT |
12295 | 4249 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4250 tty->print_cr(" Bailing out: CallerSensitive annotation expected at frame %d", n); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4251 } |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4252 #endif |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4253 return false; // bail-out; let JVM_GetCallerClass do the work |
0 | 4254 } |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4255 break; |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4256 default: |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4257 if (!m->is_ignored_by_security_stack_walk()) { |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4258 // We have reached the desired frame; return the holder class. |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4259 // Acquire method holder as java.lang.Class and push as constant. |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4260 ciInstanceKlass* caller_klass = caller_jvms->method()->holder(); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4261 ciInstance* caller_mirror = caller_klass->java_mirror(); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4262 set_result(makecon(TypeInstPtr::make(caller_mirror))); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4263 |
0 | 4264 #ifndef PRODUCT |
12295 | 4265 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4266 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()); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4267 tty->print_cr(" JVM state at this point:"); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4268 for (int i = jvms()->depth(), n = 1; i >= 1; i--, n++) { |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4269 ciMethod* m = jvms()->of_depth(i)->method(); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4270 tty->print_cr(" %d) %s.%s", n, m->holder()->name()->as_utf8(), m->name()->as_utf8()); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4271 } |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4272 } |
0 | 4273 #endif |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4274 return true; |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4275 } |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4276 break; |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4277 } |
0 | 4278 } |
4279 | |
4280 #ifndef PRODUCT | |
12295 | 4281 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4282 tty->print_cr(" Bailing out because caller depth exceeded inlining depth = %d", jvms()->depth()); |
0 | 4283 tty->print_cr(" JVM state at this point:"); |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4284 for (int i = jvms()->depth(), n = 1; i >= 1; i--, n++) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4285 ciMethod* m = jvms()->of_depth(i)->method(); |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4286 tty->print_cr(" %d) %s.%s", n, m->holder()->name()->as_utf8(), m->name()->as_utf8()); |
0 | 4287 } |
4288 } | |
4289 #endif | |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4290 |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4291 return false; // bail-out; let JVM_GetCallerClass do the work |
0 | 4292 } |
4293 | |
4294 bool LibraryCallKit::inline_fp_conversions(vmIntrinsics::ID id) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4295 Node* arg = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4296 Node* result; |
0 | 4297 |
4298 switch (id) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4299 case vmIntrinsics::_floatToRawIntBits: result = new (C) MoveF2INode(arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4300 case vmIntrinsics::_intBitsToFloat: result = new (C) MoveI2FNode(arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4301 case vmIntrinsics::_doubleToRawLongBits: result = new (C) MoveD2LNode(arg); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4302 case vmIntrinsics::_longBitsToDouble: result = new (C) MoveL2DNode(arg); break; |
0 | 4303 |
4304 case vmIntrinsics::_doubleToLongBits: { | |
4305 // two paths (plus control) merge in a wood | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4306 RegionNode *r = new (C) RegionNode(3); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4307 Node *phi = new (C) PhiNode(r, TypeLong::LONG); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4308 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4309 Node *cmpisnan = _gvn.transform(new (C) CmpDNode(arg, arg)); |
0 | 4310 // Build the boolean node |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4311 Node *bolisnan = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::ne)); |
0 | 4312 |
4313 // Branch either way. | |
4314 // NaN case is less traveled, which makes all the difference. | |
4315 IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
4316 Node *opt_isnan = _gvn.transform(ifisnan); | |
4317 assert( opt_isnan->is_If(), "Expect an IfNode"); | |
4318 IfNode *opt_ifisnan = (IfNode*)opt_isnan; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4319 Node *iftrue = _gvn.transform(new (C) IfTrueNode(opt_ifisnan)); |
0 | 4320 |
4321 set_control(iftrue); | |
4322 | |
4323 static const jlong nan_bits = CONST64(0x7ff8000000000000); | |
4324 Node *slow_result = longcon(nan_bits); // return NaN | |
4325 phi->init_req(1, _gvn.transform( slow_result )); | |
4326 r->init_req(1, iftrue); | |
4327 | |
4328 // Else fall through | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4329 Node *iffalse = _gvn.transform(new (C) IfFalseNode(opt_ifisnan)); |
0 | 4330 set_control(iffalse); |
4331 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4332 phi->init_req(2, _gvn.transform(new (C) MoveD2LNode(arg))); |
0 | 4333 r->init_req(2, iffalse); |
4334 | |
4335 // Post merge | |
4336 set_control(_gvn.transform(r)); | |
4337 record_for_igvn(r); | |
4338 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4339 C->set_has_split_ifs(true); // Has chance for split-if optimization |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4340 result = phi; |
0 | 4341 assert(result->bottom_type()->isa_long(), "must be"); |
4342 break; | |
4343 } | |
4344 | |
4345 case vmIntrinsics::_floatToIntBits: { | |
4346 // two paths (plus control) merge in a wood | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4347 RegionNode *r = new (C) RegionNode(3); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4348 Node *phi = new (C) PhiNode(r, TypeInt::INT); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4349 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4350 Node *cmpisnan = _gvn.transform(new (C) CmpFNode(arg, arg)); |
0 | 4351 // Build the boolean node |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4352 Node *bolisnan = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::ne)); |
0 | 4353 |
4354 // Branch either way. | |
4355 // NaN case is less traveled, which makes all the difference. | |
4356 IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
4357 Node *opt_isnan = _gvn.transform(ifisnan); | |
4358 assert( opt_isnan->is_If(), "Expect an IfNode"); | |
4359 IfNode *opt_ifisnan = (IfNode*)opt_isnan; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4360 Node *iftrue = _gvn.transform(new (C) IfTrueNode(opt_ifisnan)); |
0 | 4361 |
4362 set_control(iftrue); | |
4363 | |
4364 static const jint nan_bits = 0x7fc00000; | |
4365 Node *slow_result = makecon(TypeInt::make(nan_bits)); // return NaN | |
4366 phi->init_req(1, _gvn.transform( slow_result )); | |
4367 r->init_req(1, iftrue); | |
4368 | |
4369 // Else fall through | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4370 Node *iffalse = _gvn.transform(new (C) IfFalseNode(opt_ifisnan)); |
0 | 4371 set_control(iffalse); |
4372 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4373 phi->init_req(2, _gvn.transform(new (C) MoveF2INode(arg))); |
0 | 4374 r->init_req(2, iffalse); |
4375 | |
4376 // Post merge | |
4377 set_control(_gvn.transform(r)); | |
4378 record_for_igvn(r); | |
4379 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4380 C->set_has_split_ifs(true); // Has chance for split-if optimization |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4381 result = phi; |
0 | 4382 assert(result->bottom_type()->isa_int(), "must be"); |
4383 break; | |
4384 } | |
4385 | |
4386 default: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4387 fatal_unexpected_iid(id); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4388 break; |
0 | 4389 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4390 set_result(_gvn.transform(result)); |
0 | 4391 return true; |
4392 } | |
4393 | |
4394 #ifdef _LP64 | |
4395 #define XTOP ,top() /*additional argument*/ | |
4396 #else //_LP64 | |
4397 #define XTOP /*no additional argument*/ | |
4398 #endif //_LP64 | |
4399 | |
4400 //----------------------inline_unsafe_copyMemory------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4401 // public native void sun.misc.Unsafe.copyMemory(Object srcBase, long srcOffset, Object destBase, long destOffset, long bytes); |
0 | 4402 bool LibraryCallKit::inline_unsafe_copyMemory() { |
4403 if (callee()->is_static()) return false; // caller must have the capability! | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4404 null_check_receiver(); // null-check receiver |
0 | 4405 if (stopped()) return true; |
4406 | |
4407 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
4408 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4409 Node* src_ptr = argument(1); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4410 Node* src_off = ConvL2X(argument(2)); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4411 Node* dst_ptr = argument(4); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4412 Node* dst_off = ConvL2X(argument(5)); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4413 Node* size = ConvL2X(argument(7)); // type: long |
0 | 4414 |
4415 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
4416 "fieldOffset must be byte-scaled"); | |
4417 | |
4418 Node* src = make_unsafe_address(src_ptr, src_off); | |
4419 Node* dst = make_unsafe_address(dst_ptr, dst_off); | |
4420 | |
4421 // Conservatively insert a memory barrier on all memory slices. | |
4422 // Do not let writes of the copy source or destination float below the copy. | |
4423 insert_mem_bar(Op_MemBarCPUOrder); | |
4424 | |
4425 // Call it. Note that the length argument is not scaled. | |
4426 make_runtime_call(RC_LEAF|RC_NO_FP, | |
4427 OptoRuntime::fast_arraycopy_Type(), | |
4428 StubRoutines::unsafe_arraycopy(), | |
4429 "unsafe_arraycopy", | |
4430 TypeRawPtr::BOTTOM, | |
4431 src, dst, size XTOP); | |
4432 | |
4433 // Do not let reads of the copy destination float above the copy. | |
4434 insert_mem_bar(Op_MemBarCPUOrder); | |
4435 | |
4436 return true; | |
4437 } | |
4438 | |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4439 //------------------------clone_coping----------------------------------- |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4440 // Helper function for inline_native_clone. |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4441 void LibraryCallKit::copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array, bool card_mark) { |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4442 assert(obj_size != NULL, ""); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4443 Node* raw_obj = alloc_obj->in(1); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4444 assert(alloc_obj->is_CheckCastPP() && raw_obj->is_Proj() && raw_obj->in(0)->is_Allocate(), ""); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4445 |
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4446 AllocateNode* alloc = NULL; |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4447 if (ReduceBulkZeroing) { |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4448 // We will be completely responsible for initializing this object - |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4449 // mark Initialize node as complete. |
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4450 alloc = AllocateNode::Ideal_allocation(alloc_obj, &_gvn); |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4451 // The object was just allocated - there should be no any stores! |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4452 guarantee(alloc != NULL && alloc->maybe_set_complete(&_gvn), ""); |
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4453 // Mark as complete_with_arraycopy so that on AllocateNode |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4454 // expansion, we know this AllocateNode is initialized by an array |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4455 // copy and a StoreStore barrier exists after the array copy. |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4456 alloc->initialization()->set_complete_with_arraycopy(); |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4457 } |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4458 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4459 // Copy the fastest available way. |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4460 // TODO: generate fields copies for small objects instead. |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4461 Node* src = obj; |
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4462 Node* dest = alloc_obj; |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4463 Node* size = _gvn.transform(obj_size); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4464 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4465 // Exclude the header but include array length to copy by 8 bytes words. |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4466 // Can't use base_offset_in_bytes(bt) since basic type is unknown. |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4467 int base_off = is_array ? arrayOopDesc::length_offset_in_bytes() : |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4468 instanceOopDesc::base_offset_in_bytes(); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4469 // base_off: |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4470 // 8 - 32-bit VM |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4471 // 12 - 64-bit VM, compressed klass |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4472 // 16 - 64-bit VM, normal klass |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4473 if (base_off % BytesPerLong != 0) { |
12226
7944aba7ba41
8015107: NPG: Use consistent naming for metaspace concepts
ehelin
parents:
12169
diff
changeset
|
4474 assert(UseCompressedClassPointers, ""); |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4475 if (is_array) { |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4476 // Exclude length to copy by 8 bytes words. |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4477 base_off += sizeof(int); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4478 } else { |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4479 // Include klass to copy by 8 bytes words. |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4480 base_off = instanceOopDesc::klass_offset_in_bytes(); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4481 } |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4482 assert(base_off % BytesPerLong == 0, "expect 8 bytes alignment"); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4483 } |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4484 src = basic_plus_adr(src, base_off); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4485 dest = basic_plus_adr(dest, base_off); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4486 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4487 // Compute the length also, if needed: |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4488 Node* countx = size; |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4489 countx = _gvn.transform(new (C) SubXNode(countx, MakeConX(base_off))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4490 countx = _gvn.transform(new (C) URShiftXNode(countx, intcon(LogBytesPerLong) )); |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4491 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4492 const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM; |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4493 bool disjoint_bases = true; |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4494 generate_unchecked_arraycopy(raw_adr_type, T_LONG, disjoint_bases, |
2324 | 4495 src, NULL, dest, NULL, countx, |
4496 /*dest_uninitialized*/true); | |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4497 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4498 // If necessary, emit some card marks afterwards. (Non-arrays only.) |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4499 if (card_mark) { |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4500 assert(!is_array, ""); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4501 // Put in store barrier for any and all oops we are sticking |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4502 // into this object. (We could avoid this if we could prove |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4503 // that the object type contains no oop fields at all.) |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4504 Node* no_particular_value = NULL; |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4505 Node* no_particular_field = NULL; |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4506 int raw_adr_idx = Compile::AliasIdxRaw; |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4507 post_barrier(control(), |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4508 memory(raw_adr_type), |
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4509 alloc_obj, |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4510 no_particular_field, |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4511 raw_adr_idx, |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4512 no_particular_value, |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4513 T_OBJECT, |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4514 false); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4515 } |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4516 |
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4517 // Do not let reads from the cloned object float above the arraycopy. |
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4518 if (alloc != NULL) { |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4519 // Do not let stores that initialize this object be reordered with |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4520 // a subsequent store that would make this object accessible by |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4521 // other threads. |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4522 // Record what AllocateNode this StoreStore protects so that |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4523 // escape analysis can go from the MemBarStoreStoreNode to the |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4524 // AllocateNode and eliminate the MemBarStoreStoreNode if possible |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4525 // based on the escape status of the AllocateNode. |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4526 insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out(AllocateNode::RawAddress)); |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4527 } else { |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4528 insert_mem_bar(Op_MemBarCPUOrder); |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4529 } |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4530 } |
0 | 4531 |
4532 //------------------------inline_native_clone---------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4533 // protected native Object java.lang.Object.clone(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4534 // |
0 | 4535 // Here are the simple edge cases: |
4536 // null receiver => normal trap | |
4537 // virtual and clone was overridden => slow path to out-of-line clone | |
4538 // not cloneable or finalizer => slow path to out-of-line Object.clone | |
4539 // | |
4540 // The general case has two steps, allocation and copying. | |
4541 // Allocation has two cases, and uses GraphKit::new_instance or new_array. | |
4542 // | |
4543 // Copying also has two cases, oop arrays and everything else. | |
4544 // Oop arrays use arrayof_oop_arraycopy (same as System.arraycopy). | |
4545 // Everything else uses the tight inline loop supplied by CopyArrayNode. | |
4546 // | |
4547 // These steps fold up nicely if and when the cloned object's klass | |
4548 // can be sharply typed as an object array, a type array, or an instance. | |
4549 // | |
4550 bool LibraryCallKit::inline_native_clone(bool is_virtual) { | |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4551 PhiNode* result_val; |
0 | 4552 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4553 // Set the reexecute bit for the interpreter to reexecute |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4554 // the bytecode that invokes Object.clone if deoptimization happens. |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4555 { PreserveReexecuteState preexecs(this); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4556 jvms()->set_should_reexecute(true); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4557 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4558 Node* obj = null_check_receiver(); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4559 if (stopped()) return true; |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4560 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4561 Node* obj_klass = load_object_klass(obj); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4562 const TypeKlassPtr* tklass = _gvn.type(obj_klass)->isa_klassptr(); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4563 const TypeOopPtr* toop = ((tklass != NULL) |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4564 ? tklass->as_instance_type() |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4565 : TypeInstPtr::NOTNULL); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4566 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4567 // Conservatively insert a memory barrier on all memory slices. |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4568 // Do not let writes into the original float below the clone. |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4569 insert_mem_bar(Op_MemBarCPUOrder); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4570 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4571 // paths into result_reg: |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4572 enum { |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4573 _slow_path = 1, // out-of-line call to clone method (virtual or not) |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4574 _objArray_path, // plain array allocation, plus arrayof_oop_arraycopy |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4575 _array_path, // plain array allocation, plus arrayof_long_arraycopy |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4576 _instance_path, // plain instance allocation, plus arrayof_long_arraycopy |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4577 PATH_LIMIT |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4578 }; |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4579 RegionNode* result_reg = new(C) RegionNode(PATH_LIMIT); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4580 result_val = new(C) PhiNode(result_reg, |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4581 TypeInstPtr::NOTNULL); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4582 PhiNode* result_i_o = new(C) PhiNode(result_reg, Type::ABIO); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4583 PhiNode* result_mem = new(C) PhiNode(result_reg, Type::MEMORY, |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4584 TypePtr::BOTTOM); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4585 record_for_igvn(result_reg); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4586 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4587 const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM; |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4588 int raw_adr_idx = Compile::AliasIdxRaw; |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4589 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4590 Node* array_ctl = generate_array_guard(obj_klass, (RegionNode*)NULL); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4591 if (array_ctl != NULL) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4592 // It's an array. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4593 PreserveJVMState pjvms(this); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4594 set_control(array_ctl); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4595 Node* obj_length = load_array_length(obj); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4596 Node* obj_size = NULL; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4597 Node* alloc_obj = new_array(obj_klass, obj_length, 0, &obj_size); // no arguments to push |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4598 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4599 if (!use_ReduceInitialCardMarks()) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4600 // If it is an oop array, it requires very special treatment, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4601 // because card marking is required on each card of the array. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4602 Node* is_obja = generate_objArray_guard(obj_klass, (RegionNode*)NULL); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4603 if (is_obja != NULL) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4604 PreserveJVMState pjvms2(this); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4605 set_control(is_obja); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4606 // Generate a direct call to the right arraycopy function(s). |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4607 bool disjoint_bases = true; |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4608 bool length_never_negative = true; |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4609 generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4610 obj, intcon(0), alloc_obj, intcon(0), |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4611 obj_length, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4612 disjoint_bases, length_never_negative); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4613 result_reg->init_req(_objArray_path, control()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4614 result_val->init_req(_objArray_path, alloc_obj); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4615 result_i_o ->set_req(_objArray_path, i_o()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4616 result_mem ->set_req(_objArray_path, reset_memory()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4617 } |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4618 } |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4619 // Otherwise, there are no card marks to worry about. |
1027
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4620 // (We can dispense with card marks if we know the allocation |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4621 // comes out of eden (TLAB)... In fact, ReduceInitialCardMarks |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4622 // causes the non-eden paths to take compensating steps to |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4623 // simulate a fresh allocation, so that no further |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4624 // card marks are required in compiled code to initialize |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4625 // the object.) |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4626 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4627 if (!stopped()) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4628 copy_to_clone(obj, alloc_obj, obj_size, true, false); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4629 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4630 // Present the results of the copy. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4631 result_reg->init_req(_array_path, control()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4632 result_val->init_req(_array_path, alloc_obj); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4633 result_i_o ->set_req(_array_path, i_o()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4634 result_mem ->set_req(_array_path, reset_memory()); |
0 | 4635 } |
4636 } | |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4637 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4638 // We only go to the instance fast case code if we pass a number of guards. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4639 // The paths which do not pass are accumulated in the slow_region. |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4640 RegionNode* slow_region = new (C) RegionNode(1); |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4641 record_for_igvn(slow_region); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4642 if (!stopped()) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4643 // It's an instance (we did array above). Make the slow-path tests. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4644 // If this is a virtual call, we generate a funny guard. We grab |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4645 // the vtable entry corresponding to clone() from the target object. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4646 // If the target method which we are calling happens to be the |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4647 // Object clone() method, we pass the guard. We do not need this |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4648 // guard for non-virtual calls; the caller is known to be the native |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4649 // Object clone(). |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4650 if (is_virtual) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4651 generate_virtual_guard(obj_klass, slow_region); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4652 } |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4653 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4654 // The object must be cloneable and must not have a finalizer. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4655 // Both of these conditions may be checked in a single test. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4656 // We could optimize the cloneable test further, but we don't care. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4657 generate_access_flags_guard(obj_klass, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4658 // Test both conditions: |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4659 JVM_ACC_IS_CLONEABLE | JVM_ACC_HAS_FINALIZER, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4660 // Must be cloneable but not finalizer: |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4661 JVM_ACC_IS_CLONEABLE, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4662 slow_region); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4663 } |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4664 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4665 if (!stopped()) { |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4666 // It's an instance, and it passed the slow-path tests. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4667 PreserveJVMState pjvms(this); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4668 Node* obj_size = NULL; |
17990
00c8a1255912
8033626: assert(ex_map->jvms()->same_calls_as(_exceptions->jvms())) failed: all collected exceptions must come from the same place
vlivanov
parents:
17968
diff
changeset
|
4669 // Need to deoptimize on exception from allocation since Object.clone intrinsic |
00c8a1255912
8033626: assert(ex_map->jvms()->same_calls_as(_exceptions->jvms())) failed: all collected exceptions must come from the same place
vlivanov
parents:
17968
diff
changeset
|
4670 // is reexecuted if deoptimization occurs and there could be problems when merging |
00c8a1255912
8033626: assert(ex_map->jvms()->same_calls_as(_exceptions->jvms())) failed: all collected exceptions must come from the same place
vlivanov
parents:
17968
diff
changeset
|
4671 // exception state between multiple Object.clone versions (reexecute=true vs reexecute=false). |
00c8a1255912
8033626: assert(ex_map->jvms()->same_calls_as(_exceptions->jvms())) failed: all collected exceptions must come from the same place
vlivanov
parents:
17968
diff
changeset
|
4672 Node* alloc_obj = new_instance(obj_klass, NULL, &obj_size, /*deoptimize_on_exception=*/true); |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4673 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4674 copy_to_clone(obj, alloc_obj, obj_size, false, !use_ReduceInitialCardMarks()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4675 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4676 // Present the results of the slow call. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4677 result_reg->init_req(_instance_path, control()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4678 result_val->init_req(_instance_path, alloc_obj); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4679 result_i_o ->set_req(_instance_path, i_o()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4680 result_mem ->set_req(_instance_path, reset_memory()); |
0 | 4681 } |
4682 | |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4683 // Generate code for the slow case. We make a call to clone(). |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4684 set_control(_gvn.transform(slow_region)); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4685 if (!stopped()) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4686 PreserveJVMState pjvms(this); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4687 CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_clone, is_virtual); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4688 Node* slow_result = set_results_for_java_call(slow_call); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4689 // this->control() comes from set_results_for_java_call |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4690 result_reg->init_req(_slow_path, control()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4691 result_val->init_req(_slow_path, slow_result); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4692 result_i_o ->set_req(_slow_path, i_o()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4693 result_mem ->set_req(_slow_path, reset_memory()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4694 } |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4695 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4696 // Return the combined state. |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4697 set_control( _gvn.transform(result_reg)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4698 set_i_o( _gvn.transform(result_i_o)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4699 set_all_memory( _gvn.transform(result_mem)); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4700 } // original reexecute is set back here |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4701 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4702 set_result(_gvn.transform(result_val)); |
0 | 4703 return true; |
4704 } | |
4705 | |
4706 //------------------------------basictype2arraycopy---------------------------- | |
4707 address LibraryCallKit::basictype2arraycopy(BasicType t, | |
4708 Node* src_offset, | |
4709 Node* dest_offset, | |
4710 bool disjoint_bases, | |
2324 | 4711 const char* &name, |
4712 bool dest_uninitialized) { | |
0 | 4713 const TypeInt* src_offset_inttype = gvn().find_int_type(src_offset);; |
4714 const TypeInt* dest_offset_inttype = gvn().find_int_type(dest_offset);; | |
4715 | |
4716 bool aligned = false; | |
4717 bool disjoint = disjoint_bases; | |
4718 | |
4719 // if the offsets are the same, we can treat the memory regions as | |
4720 // disjoint, because either the memory regions are in different arrays, | |
4721 // or they are identical (which we can treat as disjoint.) We can also | |
4722 // treat a copy with a destination index less that the source index | |
4723 // as disjoint since a low->high copy will work correctly in this case. | |
4724 if (src_offset_inttype != NULL && src_offset_inttype->is_con() && | |
4725 dest_offset_inttype != NULL && dest_offset_inttype->is_con()) { | |
4726 // both indices are constants | |
4727 int s_offs = src_offset_inttype->get_con(); | |
4728 int d_offs = dest_offset_inttype->get_con(); | |
29
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
0
diff
changeset
|
4729 int element_size = type2aelembytes(t); |
0 | 4730 aligned = ((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) && |
4731 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0); | |
4732 if (s_offs >= d_offs) disjoint = true; | |
4733 } else if (src_offset == dest_offset && src_offset != NULL) { | |
4734 // This can occur if the offsets are identical non-constants. | |
4735 disjoint = true; | |
4736 } | |
4737 | |
2446 | 4738 return StubRoutines::select_arraycopy_function(t, aligned, disjoint, name, dest_uninitialized); |
0 | 4739 } |
4740 | |
4741 | |
4742 //------------------------------inline_arraycopy----------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4743 // public static native void java.lang.System.arraycopy(Object src, int srcPos, |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4744 // Object dest, int destPos, |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4745 // int length); |
0 | 4746 bool LibraryCallKit::inline_arraycopy() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4747 // Get the arguments. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4748 Node* src = argument(0); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4749 Node* src_offset = argument(1); // type: int |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4750 Node* dest = argument(2); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4751 Node* dest_offset = argument(3); // type: int |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4752 Node* length = argument(4); // type: int |
0 | 4753 |
4754 // Compile time checks. If any of these checks cannot be verified at compile time, | |
4755 // we do not make a fast path for this call. Instead, we let the call remain as it | |
4756 // is. The checks we choose to mandate at compile time are: | |
4757 // | |
4758 // (1) src and dest are arrays. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4759 const Type* src_type = src->Value(&_gvn); |
0 | 4760 const Type* dest_type = dest->Value(&_gvn); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4761 const TypeAryPtr* top_src = src_type->isa_aryptr(); |
0 | 4762 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); |
12966 | 4763 |
4764 // Do we have the type of src? | |
4765 bool has_src = (top_src != NULL && top_src->klass() != NULL); | |
4766 // Do we have the type of dest? | |
4767 bool has_dest = (top_dest != NULL && top_dest->klass() != NULL); | |
4768 // Is the type for src from speculation? | |
4769 bool src_spec = false; | |
4770 // Is the type for dest from speculation? | |
4771 bool dest_spec = false; | |
4772 | |
4773 if (!has_src || !has_dest) { | |
4774 // We don't have sufficient type information, let's see if | |
4775 // speculative types can help. We need to have types for both src | |
4776 // and dest so that it pays off. | |
4777 | |
4778 // Do we already have or could we have type information for src | |
4779 bool could_have_src = has_src; | |
4780 // Do we already have or could we have type information for dest | |
4781 bool could_have_dest = has_dest; | |
4782 | |
4783 ciKlass* src_k = NULL; | |
4784 if (!has_src) { | |
4785 src_k = src_type->speculative_type(); | |
4786 if (src_k != NULL && src_k->is_array_klass()) { | |
4787 could_have_src = true; | |
4788 } | |
4789 } | |
4790 | |
4791 ciKlass* dest_k = NULL; | |
4792 if (!has_dest) { | |
4793 dest_k = dest_type->speculative_type(); | |
4794 if (dest_k != NULL && dest_k->is_array_klass()) { | |
4795 could_have_dest = true; | |
4796 } | |
4797 } | |
4798 | |
4799 if (could_have_src && could_have_dest) { | |
4800 // This is going to pay off so emit the required guards | |
4801 if (!has_src) { | |
4802 src = maybe_cast_profiled_obj(src, src_k); | |
4803 src_type = _gvn.type(src); | |
4804 top_src = src_type->isa_aryptr(); | |
4805 has_src = (top_src != NULL && top_src->klass() != NULL); | |
4806 src_spec = true; | |
4807 } | |
4808 if (!has_dest) { | |
4809 dest = maybe_cast_profiled_obj(dest, dest_k); | |
4810 dest_type = _gvn.type(dest); | |
4811 top_dest = dest_type->isa_aryptr(); | |
4812 has_dest = (top_dest != NULL && top_dest->klass() != NULL); | |
4813 dest_spec = true; | |
4814 } | |
4815 } | |
4816 } | |
4817 | |
4818 if (!has_src || !has_dest) { | |
0 | 4819 // Conservatively insert a memory barrier on all memory slices. |
4820 // Do not let writes into the source float below the arraycopy. | |
4821 insert_mem_bar(Op_MemBarCPUOrder); | |
4822 | |
4823 // Call StubRoutines::generic_arraycopy stub. | |
4824 generate_arraycopy(TypeRawPtr::BOTTOM, T_CONFLICT, | |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4825 src, src_offset, dest, dest_offset, length); |
0 | 4826 |
4827 // Do not let reads from the destination float above the arraycopy. | |
4828 // Since we cannot type the arrays, we don't know which slices | |
4829 // might be affected. We could restrict this barrier only to those | |
4830 // memory slices which pertain to array elements--but don't bother. | |
4831 if (!InsertMemBarAfterArraycopy) | |
4832 // (If InsertMemBarAfterArraycopy, there is already one in place.) | |
4833 insert_mem_bar(Op_MemBarCPUOrder); | |
4834 return true; | |
4835 } | |
4836 | |
4837 // (2) src and dest arrays must have elements of the same BasicType | |
4838 // Figure out the size and type of the elements we will be copying. | |
4839 BasicType src_elem = top_src->klass()->as_array_klass()->element_type()->basic_type(); | |
4840 BasicType dest_elem = top_dest->klass()->as_array_klass()->element_type()->basic_type(); | |
4841 if (src_elem == T_ARRAY) src_elem = T_OBJECT; | |
4842 if (dest_elem == T_ARRAY) dest_elem = T_OBJECT; | |
4843 | |
4844 if (src_elem != dest_elem || dest_elem == T_VOID) { | |
4845 // The component types are not the same or are not recognized. Punt. | |
4846 // (But, avoid the native method wrapper to JVM_ArrayCopy.) | |
4847 generate_slow_arraycopy(TypePtr::BOTTOM, | |
2324 | 4848 src, src_offset, dest, dest_offset, length, |
4849 /*dest_uninitialized*/false); | |
0 | 4850 return true; |
4851 } | |
4852 | |
12966 | 4853 if (src_elem == T_OBJECT) { |
4854 // If both arrays are object arrays then having the exact types | |
4855 // for both will remove the need for a subtype check at runtime | |
4856 // before the call and may make it possible to pick a faster copy | |
4857 // routine (without a subtype check on every element) | |
4858 // Do we have the exact type of src? | |
4859 bool could_have_src = src_spec; | |
4860 // Do we have the exact type of dest? | |
4861 bool could_have_dest = dest_spec; | |
4862 ciKlass* src_k = top_src->klass(); | |
4863 ciKlass* dest_k = top_dest->klass(); | |
4864 if (!src_spec) { | |
4865 src_k = src_type->speculative_type(); | |
4866 if (src_k != NULL && src_k->is_array_klass()) { | |
4867 could_have_src = true; | |
4868 } | |
4869 } | |
4870 if (!dest_spec) { | |
4871 dest_k = dest_type->speculative_type(); | |
4872 if (dest_k != NULL && dest_k->is_array_klass()) { | |
4873 could_have_dest = true; | |
4874 } | |
4875 } | |
4876 if (could_have_src && could_have_dest) { | |
4877 // If we can have both exact types, emit the missing guards | |
4878 if (could_have_src && !src_spec) { | |
4879 src = maybe_cast_profiled_obj(src, src_k); | |
4880 } | |
4881 if (could_have_dest && !dest_spec) { | |
4882 dest = maybe_cast_profiled_obj(dest, dest_k); | |
4883 } | |
4884 } | |
4885 } | |
4886 | |
0 | 4887 //--------------------------------------------------------------------------- |
4888 // We will make a fast path for this call to arraycopy. | |
4889 | |
4890 // We have the following tests left to perform: | |
4891 // | |
4892 // (3) src and dest must not be null. | |
4893 // (4) src_offset must not be negative. | |
4894 // (5) dest_offset must not be negative. | |
4895 // (6) length must not be negative. | |
4896 // (7) src_offset + length must not exceed length of src. | |
4897 // (8) dest_offset + length must not exceed length of dest. | |
4898 // (9) each element of an oop array must be assignable | |
4899 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4900 RegionNode* slow_region = new (C) RegionNode(1); |
0 | 4901 record_for_igvn(slow_region); |
4902 | |
4903 // (3) operands must not be null | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4904 // We currently perform our null checks with the null_check routine. |
0 | 4905 // This means that the null exceptions will be reported in the caller |
4906 // rather than (correctly) reported inside of the native arraycopy call. | |
4907 // This should be corrected, given time. We do our null check with the | |
4908 // stack pointer restored. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4909 src = null_check(src, T_ARRAY); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4910 dest = null_check(dest, T_ARRAY); |
0 | 4911 |
4912 // (4) src_offset must not be negative. | |
4913 generate_negative_guard(src_offset, slow_region); | |
4914 | |
4915 // (5) dest_offset must not be negative. | |
4916 generate_negative_guard(dest_offset, slow_region); | |
4917 | |
4918 // (6) length must not be negative (moved to generate_arraycopy()). | |
4919 // generate_negative_guard(length, slow_region); | |
4920 | |
4921 // (7) src_offset + length must not exceed length of src. | |
4922 generate_limit_guard(src_offset, length, | |
4923 load_array_length(src), | |
4924 slow_region); | |
4925 | |
4926 // (8) dest_offset + length must not exceed length of dest. | |
4927 generate_limit_guard(dest_offset, length, | |
4928 load_array_length(dest), | |
4929 slow_region); | |
4930 | |
4931 // (9) each element of an oop array must be assignable | |
4932 // The generate_arraycopy subroutine checks this. | |
4933 | |
4934 // This is where the memory effects are placed: | |
4935 const TypePtr* adr_type = TypeAryPtr::get_array_body_type(dest_elem); | |
4936 generate_arraycopy(adr_type, dest_elem, | |
4937 src, src_offset, dest, dest_offset, length, | |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4938 false, false, slow_region); |
0 | 4939 |
4940 return true; | |
4941 } | |
4942 | |
4943 //-----------------------------generate_arraycopy---------------------- | |
4944 // Generate an optimized call to arraycopy. | |
4945 // Caller must guard against non-arrays. | |
4946 // Caller must determine a common array basic-type for both arrays. | |
4947 // Caller must validate offsets against array bounds. | |
4948 // The slow_region has already collected guard failure paths | |
4949 // (such as out of bounds length or non-conformable array types). | |
4950 // The generated code has this shape, in general: | |
4951 // | |
4952 // if (length == 0) return // via zero_path | |
4953 // slowval = -1 | |
4954 // if (types unknown) { | |
4955 // slowval = call generic copy loop | |
4956 // if (slowval == 0) return // via checked_path | |
4957 // } else if (indexes in bounds) { | |
4958 // if ((is object array) && !(array type check)) { | |
4959 // slowval = call checked copy loop | |
4960 // if (slowval == 0) return // via checked_path | |
4961 // } else { | |
4962 // call bulk copy loop | |
4963 // return // via fast_path | |
4964 // } | |
4965 // } | |
4966 // // adjust params for remaining work: | |
4967 // if (slowval != -1) { | |
4968 // n = -1^slowval; src_offset += n; dest_offset += n; length -= n | |
4969 // } | |
4970 // slow_region: | |
4971 // call slow arraycopy(src, src_offset, dest, dest_offset, length) | |
4972 // return // via slow_call_path | |
4973 // | |
4974 // This routine is used from several intrinsics: System.arraycopy, | |
4975 // Object.clone (the array subcase), and Arrays.copyOf[Range]. | |
4976 // | |
4977 void | |
4978 LibraryCallKit::generate_arraycopy(const TypePtr* adr_type, | |
4979 BasicType basic_elem_type, | |
4980 Node* src, Node* src_offset, | |
4981 Node* dest, Node* dest_offset, | |
4982 Node* copy_length, | |
4983 bool disjoint_bases, | |
4984 bool length_never_negative, | |
4985 RegionNode* slow_region) { | |
4986 | |
4987 if (slow_region == NULL) { | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4988 slow_region = new(C) RegionNode(1); |
0 | 4989 record_for_igvn(slow_region); |
4990 } | |
4991 | |
4992 Node* original_dest = dest; | |
4993 AllocateArrayNode* alloc = NULL; // used for zeroing, if needed | |
2324 | 4994 bool dest_uninitialized = false; |
0 | 4995 |
4996 // See if this is the initialization of a newly-allocated array. | |
4997 // If so, we will take responsibility here for initializing it to zero. | |
4998 // (Note: Because tightly_coupled_allocation performs checks on the | |
4999 // out-edges of the dest, we need to avoid making derived pointers | |
5000 // from it until we have checked its uses.) | |
5001 if (ReduceBulkZeroing | |
5002 && !ZeroTLAB // pointless if already zeroed | |
5003 && basic_elem_type != T_CONFLICT // avoid corner case | |
4778 | 5004 && !src->eqv_uncast(dest) |
0 | 5005 && ((alloc = tightly_coupled_allocation(dest, slow_region)) |
5006 != NULL) | |
34
545c277a3ecf
6667581: Don't generate initialization (by 0) code for arrays with size 0
kvn
parents:
29
diff
changeset
|
5007 && _gvn.find_int_con(alloc->in(AllocateNode::ALength), 1) > 0 |
0 | 5008 && alloc->maybe_set_complete(&_gvn)) { |
5009 // "You break it, you buy it." | |
5010 InitializeNode* init = alloc->initialization(); | |
5011 assert(init->is_complete(), "we just did this"); | |
3961
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3742
diff
changeset
|
5012 init->set_complete_with_arraycopy(); |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
5013 assert(dest->is_CheckCastPP(), "sanity"); |
0 | 5014 assert(dest->in(0)->in(0) == init, "dest pinned"); |
5015 adr_type = TypeRawPtr::BOTTOM; // all initializations are into raw memory | |
5016 // From this point on, every exit path is responsible for | |
5017 // initializing any non-copied parts of the object to zero. | |
2324 | 5018 // Also, if this flag is set we make sure that arraycopy interacts properly |
5019 // with G1, eliding pre-barriers. See CR 6627983. | |
5020 dest_uninitialized = true; | |
0 | 5021 } else { |
5022 // No zeroing elimination here. | |
5023 alloc = NULL; | |
5024 //original_dest = dest; | |
2324 | 5025 //dest_uninitialized = false; |
0 | 5026 } |
5027 | |
5028 // Results are placed here: | |
5029 enum { fast_path = 1, // normal void-returning assembly stub | |
5030 checked_path = 2, // special assembly stub with cleanup | |
5031 slow_call_path = 3, // something went wrong; call the VM | |
5032 zero_path = 4, // bypass when length of copy is zero | |
5033 bcopy_path = 5, // copy primitive array by 64-bit blocks | |
5034 PATH_LIMIT = 6 | |
5035 }; | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5036 RegionNode* result_region = new(C) RegionNode(PATH_LIMIT); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5037 PhiNode* result_i_o = new(C) PhiNode(result_region, Type::ABIO); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5038 PhiNode* result_memory = new(C) PhiNode(result_region, Type::MEMORY, adr_type); |
0 | 5039 record_for_igvn(result_region); |
5040 _gvn.set_type_bottom(result_i_o); | |
5041 _gvn.set_type_bottom(result_memory); | |
5042 assert(adr_type != TypePtr::BOTTOM, "must be RawMem or a T[] slice"); | |
5043 | |
5044 // The slow_control path: | |
5045 Node* slow_control; | |
5046 Node* slow_i_o = i_o(); | |
5047 Node* slow_mem = memory(adr_type); | |
5048 debug_only(slow_control = (Node*) badAddress); | |
5049 | |
5050 // Checked control path: | |
5051 Node* checked_control = top(); | |
5052 Node* checked_mem = NULL; | |
5053 Node* checked_i_o = NULL; | |
5054 Node* checked_value = NULL; | |
5055 | |
5056 if (basic_elem_type == T_CONFLICT) { | |
2324 | 5057 assert(!dest_uninitialized, ""); |
0 | 5058 Node* cv = generate_generic_arraycopy(adr_type, |
5059 src, src_offset, dest, dest_offset, | |
2324 | 5060 copy_length, dest_uninitialized); |
0 | 5061 if (cv == NULL) cv = intcon(-1); // failure (no stub available) |
5062 checked_control = control(); | |
5063 checked_i_o = i_o(); | |
5064 checked_mem = memory(adr_type); | |
5065 checked_value = cv; | |
5066 set_control(top()); // no fast path | |
5067 } | |
5068 | |
5069 Node* not_pos = generate_nonpositive_guard(copy_length, length_never_negative); | |
5070 if (not_pos != NULL) { | |
5071 PreserveJVMState pjvms(this); | |
5072 set_control(not_pos); | |
5073 | |
5074 // (6) length must not be negative. | |
5075 if (!length_never_negative) { | |
5076 generate_negative_guard(copy_length, slow_region); | |
5077 } | |
5078 | |
836
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5079 // copy_length is 0. |
2324 | 5080 if (!stopped() && dest_uninitialized) { |
0 | 5081 Node* dest_length = alloc->in(AllocateNode::ALength); |
4778 | 5082 if (copy_length->eqv_uncast(dest_length) |
0 | 5083 || _gvn.find_int_con(dest_length, 1) <= 0) { |
836
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5084 // There is no zeroing to do. No need for a secondary raw memory barrier. |
0 | 5085 } else { |
5086 // Clear the whole thing since there are no source elements to copy. | |
5087 generate_clear_array(adr_type, dest, basic_elem_type, | |
5088 intcon(0), NULL, | |
5089 alloc->in(AllocateNode::AllocSize)); | |
836
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5090 // Use a secondary InitializeNode as raw memory barrier. |
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5091 // Currently it is needed only on this path since other |
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5092 // paths have stub or runtime calls as raw memory barriers. |
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5093 InitializeNode* init = insert_mem_bar_volatile(Op_Initialize, |
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5094 Compile::AliasIdxRaw, |
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5095 top())->as_Initialize(); |
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5096 init->set_complete(&_gvn); // (there is no corresponding AllocateNode) |
0 | 5097 } |
5098 } | |
5099 | |
5100 // Present the results of the fast call. | |
5101 result_region->init_req(zero_path, control()); | |
5102 result_i_o ->init_req(zero_path, i_o()); | |
5103 result_memory->init_req(zero_path, memory(adr_type)); | |
5104 } | |
5105 | |
2324 | 5106 if (!stopped() && dest_uninitialized) { |
0 | 5107 // We have to initialize the *uncopied* part of the array to zero. |
5108 // The copy destination is the slice dest[off..off+len]. The other slices | |
5109 // are dest_head = dest[0..off] and dest_tail = dest[off+len..dest.length]. | |
5110 Node* dest_size = alloc->in(AllocateNode::AllocSize); | |
5111 Node* dest_length = alloc->in(AllocateNode::ALength); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5112 Node* dest_tail = _gvn.transform(new(C) AddINode(dest_offset, |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5113 copy_length)); |
0 | 5114 |
5115 // If there is a head section that needs zeroing, do it now. | |
5116 if (find_int_con(dest_offset, -1) != 0) { | |
5117 generate_clear_array(adr_type, dest, basic_elem_type, | |
5118 intcon(0), dest_offset, | |
5119 NULL); | |
5120 } | |
5121 | |
5122 // Next, perform a dynamic check on the tail length. | |
5123 // It is often zero, and we can win big if we prove this. | |
5124 // There are two wins: Avoid generating the ClearArray | |
5125 // with its attendant messy index arithmetic, and upgrade | |
5126 // the copy to a more hardware-friendly word size of 64 bits. | |
5127 Node* tail_ctl = NULL; | |
4778 | 5128 if (!stopped() && !dest_tail->eqv_uncast(dest_length)) { |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5129 Node* cmp_lt = _gvn.transform(new(C) CmpINode(dest_tail, dest_length)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5130 Node* bol_lt = _gvn.transform(new(C) BoolNode(cmp_lt, BoolTest::lt)); |
0 | 5131 tail_ctl = generate_slow_guard(bol_lt, NULL); |
5132 assert(tail_ctl != NULL || !stopped(), "must be an outcome"); | |
5133 } | |
5134 | |
5135 // At this point, let's assume there is no tail. | |
5136 if (!stopped() && alloc != NULL && basic_elem_type != T_OBJECT) { | |
5137 // There is no tail. Try an upgrade to a 64-bit copy. | |
5138 bool didit = false; | |
5139 { PreserveJVMState pjvms(this); | |
5140 didit = generate_block_arraycopy(adr_type, basic_elem_type, alloc, | |
5141 src, src_offset, dest, dest_offset, | |
2324 | 5142 dest_size, dest_uninitialized); |
0 | 5143 if (didit) { |
5144 // Present the results of the block-copying fast call. | |
5145 result_region->init_req(bcopy_path, control()); | |
5146 result_i_o ->init_req(bcopy_path, i_o()); | |
5147 result_memory->init_req(bcopy_path, memory(adr_type)); | |
5148 } | |
5149 } | |
5150 if (didit) | |
5151 set_control(top()); // no regular fast path | |
5152 } | |
5153 | |
5154 // Clear the tail, if any. | |
5155 if (tail_ctl != NULL) { | |
5156 Node* notail_ctl = stopped() ? NULL : control(); | |
5157 set_control(tail_ctl); | |
5158 if (notail_ctl == NULL) { | |
5159 generate_clear_array(adr_type, dest, basic_elem_type, | |
5160 dest_tail, NULL, | |
5161 dest_size); | |
5162 } else { | |
5163 // Make a local merge. | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5164 Node* done_ctl = new(C) RegionNode(3); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5165 Node* done_mem = new(C) PhiNode(done_ctl, Type::MEMORY, adr_type); |
0 | 5166 done_ctl->init_req(1, notail_ctl); |
5167 done_mem->init_req(1, memory(adr_type)); | |
5168 generate_clear_array(adr_type, dest, basic_elem_type, | |
5169 dest_tail, NULL, | |
5170 dest_size); | |
5171 done_ctl->init_req(2, control()); | |
5172 done_mem->init_req(2, memory(adr_type)); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5173 set_control( _gvn.transform(done_ctl)); |
0 | 5174 set_memory( _gvn.transform(done_mem), adr_type ); |
5175 } | |
5176 } | |
5177 } | |
5178 | |
5179 BasicType copy_type = basic_elem_type; | |
5180 assert(basic_elem_type != T_ARRAY, "caller must fix this"); | |
5181 if (!stopped() && copy_type == T_OBJECT) { | |
5182 // If src and dest have compatible element types, we can copy bits. | |
5183 // Types S[] and D[] are compatible if D is a supertype of S. | |
5184 // | |
5185 // If they are not, we will use checked_oop_disjoint_arraycopy, | |
5186 // which performs a fast optimistic per-oop check, and backs off | |
5187 // further to JVM_ArrayCopy on the first per-oop check that fails. | |
5188 // (Actually, we don't move raw bits only; the GC requires card marks.) | |
5189 | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
5190 // Get the Klass* for both src and dest |
0 | 5191 Node* src_klass = load_object_klass(src); |
5192 Node* dest_klass = load_object_klass(dest); | |
5193 | |
5194 // Generate the subtype check. | |
5195 // This might fold up statically, or then again it might not. | |
5196 // | |
5197 // Non-static example: Copying List<String>.elements to a new String[]. | |
5198 // The backing store for a List<String> is always an Object[], | |
5199 // but its elements are always type String, if the generic types | |
5200 // are correct at the source level. | |
5201 // | |
5202 // Test S[] against D[], not S against D, because (probably) | |
5203 // the secondary supertype cache is less busy for S[] than S. | |
5204 // This usually only matters when D is an interface. | |
5205 Node* not_subtype_ctrl = gen_subtype_check(src_klass, dest_klass); | |
5206 // Plug failing path into checked_oop_disjoint_arraycopy | |
5207 if (not_subtype_ctrl != top()) { | |
5208 PreserveJVMState pjvms(this); | |
5209 set_control(not_subtype_ctrl); | |
5210 // (At this point we can assume disjoint_bases, since types differ.) | |
6831
d8ce2825b193
8000213: NPG: Should have renamed arrayKlass and typeArrayKlass
coleenp
parents:
6804
diff
changeset
|
5211 int ek_offset = in_bytes(ObjArrayKlass::element_klass_offset()); |
0 | 5212 Node* p1 = basic_plus_adr(dest_klass, ek_offset); |
20627
e7b3d177adda
8057622: java/util/stream/test/org/openjdk/tests/java/util/stream/InfiniteStreamWithLimitOpTest: SEGV inside compiled code (sparc)
zmajo
parents:
20441
diff
changeset
|
5213 Node* n1 = LoadKlassNode::make(_gvn, NULL, immutable_memory(), p1, TypeRawPtr::BOTTOM); |
0 | 5214 Node* dest_elem_klass = _gvn.transform(n1); |
5215 Node* cv = generate_checkcast_arraycopy(adr_type, | |
5216 dest_elem_klass, | |
5217 src, src_offset, dest, dest_offset, | |
2324 | 5218 ConvI2X(copy_length), dest_uninitialized); |
0 | 5219 if (cv == NULL) cv = intcon(-1); // failure (no stub available) |
5220 checked_control = control(); | |
5221 checked_i_o = i_o(); | |
5222 checked_mem = memory(adr_type); | |
5223 checked_value = cv; | |
5224 } | |
5225 // At this point we know we do not need type checks on oop stores. | |
5226 | |
5227 // Let's see if we need card marks: | |
5228 if (alloc != NULL && use_ReduceInitialCardMarks()) { | |
5229 // If we do not need card marks, copy using the jint or jlong stub. | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5230 copy_type = LP64_ONLY(UseCompressedOops ? T_INT : T_LONG) NOT_LP64(T_INT); |
29
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
0
diff
changeset
|
5231 assert(type2aelembytes(basic_elem_type) == type2aelembytes(copy_type), |
0 | 5232 "sizes agree"); |
5233 } | |
5234 } | |
5235 | |
5236 if (!stopped()) { | |
5237 // Generate the fast path, if possible. | |
5238 PreserveJVMState pjvms(this); | |
5239 generate_unchecked_arraycopy(adr_type, copy_type, disjoint_bases, | |
5240 src, src_offset, dest, dest_offset, | |
2324 | 5241 ConvI2X(copy_length), dest_uninitialized); |
0 | 5242 |
5243 // Present the results of the fast call. | |
5244 result_region->init_req(fast_path, control()); | |
5245 result_i_o ->init_req(fast_path, i_o()); | |
5246 result_memory->init_req(fast_path, memory(adr_type)); | |
5247 } | |
5248 | |
5249 // Here are all the slow paths up to this point, in one bundle: | |
5250 slow_control = top(); | |
5251 if (slow_region != NULL) | |
5252 slow_control = _gvn.transform(slow_region); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5253 DEBUG_ONLY(slow_region = (RegionNode*)badAddress); |
0 | 5254 |
5255 set_control(checked_control); | |
5256 if (!stopped()) { | |
5257 // Clean up after the checked call. | |
5258 // The returned value is either 0 or -1^K, | |
5259 // where K = number of partially transferred array elements. | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5260 Node* cmp = _gvn.transform(new(C) CmpINode(checked_value, intcon(0))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5261 Node* bol = _gvn.transform(new(C) BoolNode(cmp, BoolTest::eq)); |
0 | 5262 IfNode* iff = create_and_map_if(control(), bol, PROB_MAX, COUNT_UNKNOWN); |
5263 | |
5264 // If it is 0, we are done, so transfer to the end. | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5265 Node* checks_done = _gvn.transform(new(C) IfTrueNode(iff)); |
0 | 5266 result_region->init_req(checked_path, checks_done); |
5267 result_i_o ->init_req(checked_path, checked_i_o); | |
5268 result_memory->init_req(checked_path, checked_mem); | |
5269 | |
5270 // If it is not zero, merge into the slow call. | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5271 set_control( _gvn.transform(new(C) IfFalseNode(iff) )); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5272 RegionNode* slow_reg2 = new(C) RegionNode(3); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5273 PhiNode* slow_i_o2 = new(C) PhiNode(slow_reg2, Type::ABIO); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5274 PhiNode* slow_mem2 = new(C) PhiNode(slow_reg2, Type::MEMORY, adr_type); |
0 | 5275 record_for_igvn(slow_reg2); |
5276 slow_reg2 ->init_req(1, slow_control); | |
5277 slow_i_o2 ->init_req(1, slow_i_o); | |
5278 slow_mem2 ->init_req(1, slow_mem); | |
5279 slow_reg2 ->init_req(2, control()); | |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
5280 slow_i_o2 ->init_req(2, checked_i_o); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
5281 slow_mem2 ->init_req(2, checked_mem); |
0 | 5282 |
5283 slow_control = _gvn.transform(slow_reg2); | |
5284 slow_i_o = _gvn.transform(slow_i_o2); | |
5285 slow_mem = _gvn.transform(slow_mem2); | |
5286 | |
5287 if (alloc != NULL) { | |
5288 // We'll restart from the very beginning, after zeroing the whole thing. | |
5289 // This can cause double writes, but that's OK since dest is brand new. | |
5290 // So we ignore the low 31 bits of the value returned from the stub. | |
5291 } else { | |
5292 // We must continue the copy exactly where it failed, or else | |
5293 // another thread might see the wrong number of writes to dest. | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5294 Node* checked_offset = _gvn.transform(new(C) XorINode(checked_value, intcon(-1))); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5295 Node* slow_offset = new(C) PhiNode(slow_reg2, TypeInt::INT); |
0 | 5296 slow_offset->init_req(1, intcon(0)); |
5297 slow_offset->init_req(2, checked_offset); | |
5298 slow_offset = _gvn.transform(slow_offset); | |
5299 | |
5300 // Adjust the arguments by the conditionally incoming offset. | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5301 Node* src_off_plus = _gvn.transform(new(C) AddINode(src_offset, slow_offset)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5302 Node* dest_off_plus = _gvn.transform(new(C) AddINode(dest_offset, slow_offset)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5303 Node* length_minus = _gvn.transform(new(C) SubINode(copy_length, slow_offset)); |
0 | 5304 |
5305 // Tweak the node variables to adjust the code produced below: | |
5306 src_offset = src_off_plus; | |
5307 dest_offset = dest_off_plus; | |
5308 copy_length = length_minus; | |
5309 } | |
5310 } | |
5311 | |
5312 set_control(slow_control); | |
5313 if (!stopped()) { | |
5314 // Generate the slow path, if needed. | |
5315 PreserveJVMState pjvms(this); // replace_in_map may trash the map | |
5316 | |
5317 set_memory(slow_mem, adr_type); | |
5318 set_i_o(slow_i_o); | |
5319 | |
2324 | 5320 if (dest_uninitialized) { |
0 | 5321 generate_clear_array(adr_type, dest, basic_elem_type, |
5322 intcon(0), NULL, | |
5323 alloc->in(AllocateNode::AllocSize)); | |
5324 } | |
5325 | |
5326 generate_slow_arraycopy(adr_type, | |
5327 src, src_offset, dest, dest_offset, | |
2324 | 5328 copy_length, /*dest_uninitialized*/false); |
0 | 5329 |
5330 result_region->init_req(slow_call_path, control()); | |
5331 result_i_o ->init_req(slow_call_path, i_o()); | |
5332 result_memory->init_req(slow_call_path, memory(adr_type)); | |
5333 } | |
5334 | |
5335 // Remove unused edges. | |
5336 for (uint i = 1; i < result_region->req(); i++) { | |
5337 if (result_region->in(i) == NULL) | |
5338 result_region->init_req(i, top()); | |
5339 } | |
5340 | |
5341 // Finished; return the combined state. | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5342 set_control( _gvn.transform(result_region)); |
0 | 5343 set_i_o( _gvn.transform(result_i_o) ); |
5344 set_memory( _gvn.transform(result_memory), adr_type ); | |
5345 | |
5346 // The memory edges above are precise in order to model effects around | |
605 | 5347 // array copies accurately to allow value numbering of field loads around |
0 | 5348 // arraycopy. Such field loads, both before and after, are common in Java |
5349 // collections and similar classes involving header/array data structures. | |
5350 // | |
5351 // But with low number of register or when some registers are used or killed | |
5352 // by arraycopy calls it causes registers spilling on stack. See 6544710. | |
5353 // The next memory barrier is added to avoid it. If the arraycopy can be | |
5354 // optimized away (which it can, sometimes) then we can manually remove | |
5355 // the membar also. | |
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
5356 // |
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
5357 // Do not let reads from the cloned object float above the arraycopy. |
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5358 if (alloc != NULL) { |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5359 // Do not let stores that initialize this object be reordered with |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5360 // a subsequent store that would make this object accessible by |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5361 // other threads. |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5362 // Record what AllocateNode this StoreStore protects so that |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5363 // escape analysis can go from the MemBarStoreStoreNode to the |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5364 // AllocateNode and eliminate the MemBarStoreStoreNode if possible |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5365 // based on the escape status of the AllocateNode. |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5366 insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out(AllocateNode::RawAddress)); |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5367 } else if (InsertMemBarAfterArraycopy) |
0 | 5368 insert_mem_bar(Op_MemBarCPUOrder); |
5369 } | |
5370 | |
5371 | |
5372 // Helper function which determines if an arraycopy immediately follows | |
5373 // an allocation, with no intervening tests or other escapes for the object. | |
5374 AllocateArrayNode* | |
5375 LibraryCallKit::tightly_coupled_allocation(Node* ptr, | |
5376 RegionNode* slow_region) { | |
5377 if (stopped()) return NULL; // no fast path | |
5378 if (C->AliasLevel() == 0) return NULL; // no MergeMems around | |
5379 | |
5380 AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(ptr, &_gvn); | |
5381 if (alloc == NULL) return NULL; | |
5382 | |
5383 Node* rawmem = memory(Compile::AliasIdxRaw); | |
5384 // Is the allocation's memory state untouched? | |
5385 if (!(rawmem->is_Proj() && rawmem->in(0)->is_Initialize())) { | |
5386 // Bail out if there have been raw-memory effects since the allocation. | |
5387 // (Example: There might have been a call or safepoint.) | |
5388 return NULL; | |
5389 } | |
5390 rawmem = rawmem->in(0)->as_Initialize()->memory(Compile::AliasIdxRaw); | |
5391 if (!(rawmem->is_Proj() && rawmem->in(0) == alloc)) { | |
5392 return NULL; | |
5393 } | |
5394 | |
5395 // There must be no unexpected observers of this allocation. | |
5396 for (DUIterator_Fast imax, i = ptr->fast_outs(imax); i < imax; i++) { | |
5397 Node* obs = ptr->fast_out(i); | |
5398 if (obs != this->map()) { | |
5399 return NULL; | |
5400 } | |
5401 } | |
5402 | |
5403 // This arraycopy must unconditionally follow the allocation of the ptr. | |
5404 Node* alloc_ctl = ptr->in(0); | |
5405 assert(just_allocated_object(alloc_ctl) == ptr, "most recent allo"); | |
5406 | |
5407 Node* ctl = control(); | |
5408 while (ctl != alloc_ctl) { | |
5409 // There may be guards which feed into the slow_region. | |
5410 // Any other control flow means that we might not get a chance | |
5411 // to finish initializing the allocated object. | |
5412 if ((ctl->is_IfFalse() || ctl->is_IfTrue()) && ctl->in(0)->is_If()) { | |
5413 IfNode* iff = ctl->in(0)->as_If(); | |
5414 Node* not_ctl = iff->proj_out(1 - ctl->as_Proj()->_con); | |
5415 assert(not_ctl != NULL && not_ctl != ctl, "found alternate"); | |
5416 if (slow_region != NULL && slow_region->find_edge(not_ctl) >= 1) { | |
5417 ctl = iff->in(0); // This test feeds the known slow_region. | |
5418 continue; | |
5419 } | |
5420 // One more try: Various low-level checks bottom out in | |
5421 // uncommon traps. If the debug-info of the trap omits | |
5422 // any reference to the allocation, as we've already | |
5423 // observed, then there can be no objection to the trap. | |
5424 bool found_trap = false; | |
5425 for (DUIterator_Fast jmax, j = not_ctl->fast_outs(jmax); j < jmax; j++) { | |
5426 Node* obs = not_ctl->fast_out(j); | |
5427 if (obs->in(0) == not_ctl && obs->is_Call() && | |
1748 | 5428 (obs->as_Call()->entry_point() == SharedRuntime::uncommon_trap_blob()->entry_point())) { |
0 | 5429 found_trap = true; break; |
5430 } | |
5431 } | |
5432 if (found_trap) { | |
5433 ctl = iff->in(0); // This test feeds a harmless uncommon trap. | |
5434 continue; | |
5435 } | |
5436 } | |
5437 return NULL; | |
5438 } | |
5439 | |
5440 // If we get this far, we have an allocation which immediately | |
5441 // precedes the arraycopy, and we can take over zeroing the new object. | |
5442 // The arraycopy will finish the initialization, and provide | |
5443 // a new control state to which we will anchor the destination pointer. | |
5444 | |
5445 return alloc; | |
5446 } | |
5447 | |
5448 // Helper for initialization of arrays, creating a ClearArray. | |
5449 // It writes zero bits in [start..end), within the body of an array object. | |
5450 // The memory effects are all chained onto the 'adr_type' alias category. | |
5451 // | |
5452 // Since the object is otherwise uninitialized, we are free | |
5453 // to put a little "slop" around the edges of the cleared area, | |
5454 // as long as it does not go back into the array's header, | |
5455 // or beyond the array end within the heap. | |
5456 // | |
5457 // The lower edge can be rounded down to the nearest jint and the | |
5458 // upper edge can be rounded up to the nearest MinObjAlignmentInBytes. | |
5459 // | |
5460 // Arguments: | |
5461 // adr_type memory slice where writes are generated | |
5462 // dest oop of the destination array | |
5463 // basic_elem_type element type of the destination | |
5464 // slice_idx array index of first element to store | |
5465 // slice_len number of elements to store (or NULL) | |
5466 // dest_size total size in bytes of the array object | |
5467 // | |
5468 // Exactly one of slice_len or dest_size must be non-NULL. | |
5469 // If dest_size is non-NULL, zeroing extends to the end of the object. | |
5470 // If slice_len is non-NULL, the slice_idx value must be a constant. | |
5471 void | |
5472 LibraryCallKit::generate_clear_array(const TypePtr* adr_type, | |
5473 Node* dest, | |
5474 BasicType basic_elem_type, | |
5475 Node* slice_idx, | |
5476 Node* slice_len, | |
5477 Node* dest_size) { | |
5478 // one or the other but not both of slice_len and dest_size: | |
5479 assert((slice_len != NULL? 1: 0) + (dest_size != NULL? 1: 0) == 1, ""); | |
5480 if (slice_len == NULL) slice_len = top(); | |
5481 if (dest_size == NULL) dest_size = top(); | |
5482 | |
5483 // operate on this memory slice: | |
5484 Node* mem = memory(adr_type); // memory slice to operate on | |
5485 | |
5486 // scaling and rounding of indexes: | |
29
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
0
diff
changeset
|
5487 int scale = exact_log2(type2aelembytes(basic_elem_type)); |
0 | 5488 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type); |
5489 int clear_low = (-1 << scale) & (BytesPerInt - 1); | |
5490 int bump_bit = (-1 << scale) & BytesPerInt; | |
5491 | |
5492 // determine constant starts and ends | |
5493 const intptr_t BIG_NEG = -128; | |
5494 assert(BIG_NEG + 2*abase < 0, "neg enough"); | |
5495 intptr_t slice_idx_con = (intptr_t) find_int_con(slice_idx, BIG_NEG); | |
5496 intptr_t slice_len_con = (intptr_t) find_int_con(slice_len, BIG_NEG); | |
5497 if (slice_len_con == 0) { | |
5498 return; // nothing to do here | |
5499 } | |
5500 intptr_t start_con = (abase + (slice_idx_con << scale)) & ~clear_low; | |
5501 intptr_t end_con = find_intptr_t_con(dest_size, -1); | |
5502 if (slice_idx_con >= 0 && slice_len_con >= 0) { | |
5503 assert(end_con < 0, "not two cons"); | |
5504 end_con = round_to(abase + ((slice_idx_con + slice_len_con) << scale), | |
5505 BytesPerLong); | |
5506 } | |
5507 | |
5508 if (start_con >= 0 && end_con >= 0) { | |
5509 // Constant start and end. Simple. | |
5510 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
5511 start_con, end_con, &_gvn); | |
5512 } else if (start_con >= 0 && dest_size != top()) { | |
5513 // Constant start, pre-rounded end after the tail of the array. | |
5514 Node* end = dest_size; | |
5515 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
5516 start_con, end, &_gvn); | |
5517 } else if (start_con >= 0 && slice_len != top()) { | |
5518 // Constant start, non-constant end. End needs rounding up. | |
5519 // End offset = round_up(abase + ((slice_idx_con + slice_len) << scale), 8) | |
5520 intptr_t end_base = abase + (slice_idx_con << scale); | |
5521 int end_round = (-1 << scale) & (BytesPerLong - 1); | |
5522 Node* end = ConvI2X(slice_len); | |
5523 if (scale != 0) | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5524 end = _gvn.transform(new(C) LShiftXNode(end, intcon(scale) )); |
0 | 5525 end_base += end_round; |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5526 end = _gvn.transform(new(C) AddXNode(end, MakeConX(end_base))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5527 end = _gvn.transform(new(C) AndXNode(end, MakeConX(~end_round))); |
0 | 5528 mem = ClearArrayNode::clear_memory(control(), mem, dest, |
5529 start_con, end, &_gvn); | |
5530 } else if (start_con < 0 && dest_size != top()) { | |
5531 // Non-constant start, pre-rounded end after the tail of the array. | |
5532 // This is almost certainly a "round-to-end" operation. | |
5533 Node* start = slice_idx; | |
5534 start = ConvI2X(start); | |
5535 if (scale != 0) | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5536 start = _gvn.transform(new(C) LShiftXNode( start, intcon(scale) )); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5537 start = _gvn.transform(new(C) AddXNode(start, MakeConX(abase))); |
0 | 5538 if ((bump_bit | clear_low) != 0) { |
5539 int to_clear = (bump_bit | clear_low); | |
5540 // Align up mod 8, then store a jint zero unconditionally | |
5541 // just before the mod-8 boundary. | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5542 if (((abase + bump_bit) & ~to_clear) - bump_bit |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5543 < arrayOopDesc::length_offset_in_bytes() + BytesPerInt) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5544 bump_bit = 0; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5545 assert((abase & to_clear) == 0, "array base must be long-aligned"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5546 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5547 // Bump 'start' up to (or past) the next jint boundary: |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5548 start = _gvn.transform(new(C) AddXNode(start, MakeConX(bump_bit))); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5549 assert((abase & clear_low) == 0, "array base must be int-aligned"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5550 } |
0 | 5551 // Round bumped 'start' down to jlong boundary in body of array. |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5552 start = _gvn.transform(new(C) AndXNode(start, MakeConX(~to_clear))); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5553 if (bump_bit != 0) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5554 // Store a zero to the immediately preceding jint: |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5555 Node* x1 = _gvn.transform(new(C) AddXNode(start, MakeConX(-bump_bit))); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5556 Node* p1 = basic_plus_adr(dest, x1); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
5557 mem = StoreNode::make(_gvn, control(), mem, p1, adr_type, intcon(0), T_INT, MemNode::unordered); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5558 mem = _gvn.transform(mem); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5559 } |
0 | 5560 } |
5561 Node* end = dest_size; // pre-rounded | |
5562 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
5563 start, end, &_gvn); | |
5564 } else { | |
5565 // Non-constant start, unrounded non-constant end. | |
5566 // (Nobody zeroes a random midsection of an array using this routine.) | |
5567 ShouldNotReachHere(); // fix caller | |
5568 } | |
5569 | |
5570 // Done. | |
5571 set_memory(mem, adr_type); | |
5572 } | |
5573 | |
5574 | |
5575 bool | |
5576 LibraryCallKit::generate_block_arraycopy(const TypePtr* adr_type, | |
5577 BasicType basic_elem_type, | |
5578 AllocateNode* alloc, | |
5579 Node* src, Node* src_offset, | |
5580 Node* dest, Node* dest_offset, | |
2324 | 5581 Node* dest_size, bool dest_uninitialized) { |
0 | 5582 // See if there is an advantage from block transfer. |
29
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
0
diff
changeset
|
5583 int scale = exact_log2(type2aelembytes(basic_elem_type)); |
0 | 5584 if (scale >= LogBytesPerLong) |
5585 return false; // it is already a block transfer | |
5586 | |
5587 // Look at the alignment of the starting offsets. | |
5588 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type); | |
3742
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5589 |
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5590 intptr_t src_off_con = (intptr_t) find_int_con(src_offset, -1); |
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5591 intptr_t dest_off_con = (intptr_t) find_int_con(dest_offset, -1); |
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5592 if (src_off_con < 0 || dest_off_con < 0) |
0 | 5593 // At present, we can only understand constants. |
5594 return false; | |
5595 | |
3742
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5596 intptr_t src_off = abase + (src_off_con << scale); |
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5597 intptr_t dest_off = abase + (dest_off_con << scale); |
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5598 |
0 | 5599 if (((src_off | dest_off) & (BytesPerLong-1)) != 0) { |
5600 // Non-aligned; too bad. | |
5601 // One more chance: Pick off an initial 32-bit word. | |
5602 // This is a common case, since abase can be odd mod 8. | |
5603 if (((src_off | dest_off) & (BytesPerLong-1)) == BytesPerInt && | |
5604 ((src_off ^ dest_off) & (BytesPerLong-1)) == 0) { | |
5605 Node* sptr = basic_plus_adr(src, src_off); | |
5606 Node* dptr = basic_plus_adr(dest, dest_off); | |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
5607 Node* sval = make_load(control(), sptr, TypeInt::INT, T_INT, adr_type, MemNode::unordered); |
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
5608 store_to_memory(control(), dptr, sval, T_INT, adr_type, MemNode::unordered); |
0 | 5609 src_off += BytesPerInt; |
5610 dest_off += BytesPerInt; | |
5611 } else { | |
5612 return false; | |
5613 } | |
5614 } | |
5615 assert(src_off % BytesPerLong == 0, ""); | |
5616 assert(dest_off % BytesPerLong == 0, ""); | |
5617 | |
5618 // Do this copy by giant steps. | |
5619 Node* sptr = basic_plus_adr(src, src_off); | |
5620 Node* dptr = basic_plus_adr(dest, dest_off); | |
5621 Node* countx = dest_size; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5622 countx = _gvn.transform(new (C) SubXNode(countx, MakeConX(dest_off))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5623 countx = _gvn.transform(new (C) URShiftXNode(countx, intcon(LogBytesPerLong))); |
0 | 5624 |
5625 bool disjoint_bases = true; // since alloc != NULL | |
5626 generate_unchecked_arraycopy(adr_type, T_LONG, disjoint_bases, | |
2324 | 5627 sptr, NULL, dptr, NULL, countx, dest_uninitialized); |
0 | 5628 |
5629 return true; | |
5630 } | |
5631 | |
5632 | |
5633 // Helper function; generates code for the slow case. | |
5634 // We make a call to a runtime method which emulates the native method, | |
5635 // but without the native wrapper overhead. | |
5636 void | |
5637 LibraryCallKit::generate_slow_arraycopy(const TypePtr* adr_type, | |
5638 Node* src, Node* src_offset, | |
5639 Node* dest, Node* dest_offset, | |
2324 | 5640 Node* copy_length, bool dest_uninitialized) { |
5641 assert(!dest_uninitialized, "Invariant"); | |
0 | 5642 Node* call = make_runtime_call(RC_NO_LEAF | RC_UNCOMMON, |
5643 OptoRuntime::slow_arraycopy_Type(), | |
5644 OptoRuntime::slow_arraycopy_Java(), | |
5645 "slow_arraycopy", adr_type, | |
5646 src, src_offset, dest, dest_offset, | |
5647 copy_length); | |
5648 | |
5649 // Handle exceptions thrown by this fellow: | |
5650 make_slow_call_ex(call, env()->Throwable_klass(), false); | |
5651 } | |
5652 | |
5653 // Helper function; generates code for cases requiring runtime checks. | |
5654 Node* | |
5655 LibraryCallKit::generate_checkcast_arraycopy(const TypePtr* adr_type, | |
5656 Node* dest_elem_klass, | |
5657 Node* src, Node* src_offset, | |
5658 Node* dest, Node* dest_offset, | |
2324 | 5659 Node* copy_length, bool dest_uninitialized) { |
0 | 5660 if (stopped()) return NULL; |
5661 | |
2324 | 5662 address copyfunc_addr = StubRoutines::checkcast_arraycopy(dest_uninitialized); |
0 | 5663 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path. |
5664 return NULL; | |
5665 } | |
5666 | |
5667 // Pick out the parameters required to perform a store-check | |
5668 // for the target array. This is an optimistic check. It will | |
5669 // look in each non-null element's class, at the desired klass's | |
5670 // super_check_offset, for the desired klass. | |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
5671 int sco_offset = in_bytes(Klass::super_check_offset_offset()); |
0 | 5672 Node* p3 = basic_plus_adr(dest_elem_klass, sco_offset); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
5673 Node* n3 = new(C) LoadINode(NULL, memory(p3), p3, _gvn.type(p3)->is_ptr(), TypeInt::INT, MemNode::unordered); |
1844
75588558f1bf
6980792: Crash "exception happened outside interpreter, nmethods and vtable stubs (1)"
never
parents:
1748
diff
changeset
|
5674 Node* check_offset = ConvI2X(_gvn.transform(n3)); |
0 | 5675 Node* check_value = dest_elem_klass; |
5676 | |
5677 Node* src_start = array_element_address(src, src_offset, T_OBJECT); | |
5678 Node* dest_start = array_element_address(dest, dest_offset, T_OBJECT); | |
5679 | |
5680 // (We know the arrays are never conjoint, because their types differ.) | |
5681 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, | |
5682 OptoRuntime::checkcast_arraycopy_Type(), | |
5683 copyfunc_addr, "checkcast_arraycopy", adr_type, | |
5684 // five arguments, of which two are | |
5685 // intptr_t (jlong in LP64) | |
5686 src_start, dest_start, | |
5687 copy_length XTOP, | |
5688 check_offset XTOP, | |
5689 check_value); | |
5690 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5691 return _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
0 | 5692 } |
5693 | |
5694 | |
5695 // Helper function; generates code for cases requiring runtime checks. | |
5696 Node* | |
5697 LibraryCallKit::generate_generic_arraycopy(const TypePtr* adr_type, | |
5698 Node* src, Node* src_offset, | |
5699 Node* dest, Node* dest_offset, | |
2324 | 5700 Node* copy_length, bool dest_uninitialized) { |
5701 assert(!dest_uninitialized, "Invariant"); | |
0 | 5702 if (stopped()) return NULL; |
5703 address copyfunc_addr = StubRoutines::generic_arraycopy(); | |
5704 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path. | |
5705 return NULL; | |
5706 } | |
5707 | |
5708 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, | |
5709 OptoRuntime::generic_arraycopy_Type(), | |
5710 copyfunc_addr, "generic_arraycopy", adr_type, | |
5711 src, src_offset, dest, dest_offset, copy_length); | |
5712 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5713 return _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
0 | 5714 } |
5715 | |
5716 // Helper function; generates the fast out-of-line call to an arraycopy stub. | |
5717 void | |
5718 LibraryCallKit::generate_unchecked_arraycopy(const TypePtr* adr_type, | |
5719 BasicType basic_elem_type, | |
5720 bool disjoint_bases, | |
5721 Node* src, Node* src_offset, | |
5722 Node* dest, Node* dest_offset, | |
2324 | 5723 Node* copy_length, bool dest_uninitialized) { |
0 | 5724 if (stopped()) return; // nothing to do |
5725 | |
5726 Node* src_start = src; | |
5727 Node* dest_start = dest; | |
5728 if (src_offset != NULL || dest_offset != NULL) { | |
5729 assert(src_offset != NULL && dest_offset != NULL, ""); | |
5730 src_start = array_element_address(src, src_offset, basic_elem_type); | |
5731 dest_start = array_element_address(dest, dest_offset, basic_elem_type); | |
5732 } | |
5733 | |
5734 // Figure out which arraycopy runtime method to call. | |
5735 const char* copyfunc_name = "arraycopy"; | |
5736 address copyfunc_addr = | |
5737 basictype2arraycopy(basic_elem_type, src_offset, dest_offset, | |
2324 | 5738 disjoint_bases, copyfunc_name, dest_uninitialized); |
0 | 5739 |
5740 // Call it. Note that the count_ix value is not scaled to a byte-size. | |
5741 make_runtime_call(RC_LEAF|RC_NO_FP, | |
5742 OptoRuntime::fast_arraycopy_Type(), | |
5743 copyfunc_addr, copyfunc_name, adr_type, | |
5744 src_start, dest_start, copy_length XTOP); | |
5745 } | |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5746 |
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5747 //-------------inline_encodeISOArray----------------------------------- |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5748 // encode char[] to byte[] in ISO_8859_1 |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5749 bool LibraryCallKit::inline_encodeISOArray() { |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5750 assert(callee()->signature()->size() == 5, "encodeISOArray has 5 parameters"); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5751 // no receiver since it is static method |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5752 Node *src = argument(0); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5753 Node *src_offset = argument(1); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5754 Node *dst = argument(2); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5755 Node *dst_offset = argument(3); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5756 Node *length = argument(4); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5757 |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5758 const Type* src_type = src->Value(&_gvn); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5759 const Type* dst_type = dst->Value(&_gvn); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5760 const TypeAryPtr* top_src = src_type->isa_aryptr(); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5761 const TypeAryPtr* top_dest = dst_type->isa_aryptr(); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5762 if (top_src == NULL || top_src->klass() == NULL || |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5763 top_dest == NULL || top_dest->klass() == NULL) { |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5764 // failed array check |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5765 return false; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5766 } |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5767 |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5768 // Figure out the size and type of the elements we will be copying. |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5769 BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5770 BasicType dst_elem = dst_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5771 if (src_elem != T_CHAR || dst_elem != T_BYTE) { |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5772 return false; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5773 } |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5774 Node* src_start = array_element_address(src, src_offset, src_elem); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5775 Node* dst_start = array_element_address(dst, dst_offset, dst_elem); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5776 // 'src_start' points to src array + scaled offset |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5777 // 'dst_start' points to dst array + scaled offset |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5778 |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5779 const TypeAryPtr* mtype = TypeAryPtr::BYTES; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5780 Node* enc = new (C) EncodeISOArrayNode(control(), memory(mtype), src_start, dst_start, length); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5781 enc = _gvn.transform(enc); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5782 Node* res_mem = _gvn.transform(new (C) SCMemProjNode(enc)); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5783 set_memory(res_mem, mtype); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5784 set_result(enc); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5785 return true; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5786 } |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5787 |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5788 //-------------inline_multiplyToLen----------------------------------- |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5789 bool LibraryCallKit::inline_multiplyToLen() { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5790 assert(UseMultiplyToLenIntrinsic, "not implementated on this platform"); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5791 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5792 address stubAddr = StubRoutines::multiplyToLen(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5793 if (stubAddr == NULL) { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5794 return false; // Intrinsic's stub is not implemented on this platform |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5795 } |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5796 const char* stubName = "multiplyToLen"; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5797 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5798 assert(callee()->signature()->size() == 5, "multiplyToLen has 5 parameters"); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5799 |
23886
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5800 // no receiver because it is a static method |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5801 Node* x = argument(0); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5802 Node* xlen = argument(1); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5803 Node* y = argument(2); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5804 Node* ylen = argument(3); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5805 Node* z = argument(4); |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5806 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5807 const Type* x_type = x->Value(&_gvn); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5808 const Type* y_type = y->Value(&_gvn); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5809 const TypeAryPtr* top_x = x_type->isa_aryptr(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5810 const TypeAryPtr* top_y = y_type->isa_aryptr(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5811 if (top_x == NULL || top_x->klass() == NULL || |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5812 top_y == NULL || top_y->klass() == NULL) { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5813 // failed array check |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5814 return false; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5815 } |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5816 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5817 BasicType x_elem = x_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5818 BasicType y_elem = y_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5819 if (x_elem != T_INT || y_elem != T_INT) { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5820 return false; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5821 } |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5822 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5823 // Set the original stack and the reexecute bit for the interpreter to reexecute |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5824 // the bytecode that invokes BigInteger.multiplyToLen() if deoptimization happens |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5825 // on the return from z array allocation in runtime. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5826 { PreserveReexecuteState preexecs(this); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5827 jvms()->set_should_reexecute(true); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5828 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5829 Node* x_start = array_element_address(x, intcon(0), x_elem); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5830 Node* y_start = array_element_address(y, intcon(0), y_elem); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5831 // 'x_start' points to x array + scaled xlen |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5832 // 'y_start' points to y array + scaled ylen |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5833 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5834 // Allocate the result array |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5835 Node* zlen = _gvn.transform(new(C) AddINode(xlen, ylen)); |
20441
4874332f9799
8057758: Tests run TypeProfileLevel=222 crash with guarantee(0) failed: must find derived/base pair
roland
parents:
20438
diff
changeset
|
5836 ciKlass* klass = ciTypeArrayKlass::make(T_INT); |
4874332f9799
8057758: Tests run TypeProfileLevel=222 crash with guarantee(0) failed: must find derived/base pair
roland
parents:
20438
diff
changeset
|
5837 Node* klass_node = makecon(TypeKlassPtr::make(klass)); |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5838 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5839 IdealKit ideal(this); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5840 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5841 #define __ ideal. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5842 Node* one = __ ConI(1); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5843 Node* zero = __ ConI(0); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5844 IdealVariable need_alloc(ideal), z_alloc(ideal); __ declarations_done(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5845 __ set(need_alloc, zero); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5846 __ set(z_alloc, z); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5847 __ if_then(z, BoolTest::eq, null()); { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5848 __ increment (need_alloc, one); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5849 } __ else_(); { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5850 // Update graphKit memory and control from IdealKit. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5851 sync_kit(ideal); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5852 Node* zlen_arg = load_array_length(z); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5853 // Update IdealKit memory and control from graphKit. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5854 __ sync_kit(this); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5855 __ if_then(zlen_arg, BoolTest::lt, zlen); { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5856 __ increment (need_alloc, one); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5857 } __ end_if(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5858 } __ end_if(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5859 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5860 __ if_then(__ value(need_alloc), BoolTest::ne, zero); { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5861 // Update graphKit memory and control from IdealKit. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5862 sync_kit(ideal); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5863 Node * narr = new_array(klass_node, zlen, 1); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5864 // Update IdealKit memory and control from graphKit. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5865 __ sync_kit(this); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5866 __ set(z_alloc, narr); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5867 } __ end_if(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5868 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5869 sync_kit(ideal); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5870 z = __ value(z_alloc); |
20441
4874332f9799
8057758: Tests run TypeProfileLevel=222 crash with guarantee(0) failed: must find derived/base pair
roland
parents:
20438
diff
changeset
|
5871 // Can't use TypeAryPtr::INTS which uses Bottom offset. |
4874332f9799
8057758: Tests run TypeProfileLevel=222 crash with guarantee(0) failed: must find derived/base pair
roland
parents:
20438
diff
changeset
|
5872 _gvn.set_type(z, TypeOopPtr::make_from_klass(klass)); |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5873 // Final sync IdealKit and GraphKit. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5874 final_sync(ideal); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5875 #undef __ |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5876 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5877 Node* z_start = array_element_address(z, intcon(0), T_INT); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5878 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5879 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5880 OptoRuntime::multiplyToLen_Type(), |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5881 stubAddr, stubName, TypePtr::BOTTOM, |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5882 x_start, xlen, y_start, ylen, z_start, zlen); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5883 } // original reexecute is set back here |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5884 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5885 C->set_has_split_ifs(true); // Has chance for split-if optimization |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5886 set_result(z); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5887 return true; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5888 } |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5889 |
23885
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5890 //-------------inline_squareToLen------------------------------------ |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5891 bool LibraryCallKit::inline_squareToLen() { |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5892 assert(UseSquareToLenIntrinsic, "not implementated on this platform"); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5893 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5894 address stubAddr = StubRoutines::squareToLen(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5895 if (stubAddr == NULL) { |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5896 return false; // Intrinsic's stub is not implemented on this platform |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5897 } |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5898 const char* stubName = "squareToLen"; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5899 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5900 assert(callee()->signature()->size() == 4, "implSquareToLen has 4 parameters"); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5901 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5902 Node* x = argument(0); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5903 Node* len = argument(1); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5904 Node* z = argument(2); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5905 Node* zlen = argument(3); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5906 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5907 const Type* x_type = x->Value(&_gvn); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5908 const Type* z_type = z->Value(&_gvn); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5909 const TypeAryPtr* top_x = x_type->isa_aryptr(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5910 const TypeAryPtr* top_z = z_type->isa_aryptr(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5911 if (top_x == NULL || top_x->klass() == NULL || |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5912 top_z == NULL || top_z->klass() == NULL) { |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5913 // failed array check |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5914 return false; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5915 } |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5916 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5917 BasicType x_elem = x_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5918 BasicType z_elem = z_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5919 if (x_elem != T_INT || z_elem != T_INT) { |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5920 return false; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5921 } |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5922 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5923 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5924 Node* x_start = array_element_address(x, intcon(0), x_elem); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5925 Node* z_start = array_element_address(z, intcon(0), z_elem); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5926 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5927 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5928 OptoRuntime::squareToLen_Type(), |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5929 stubAddr, stubName, TypePtr::BOTTOM, |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5930 x_start, len, z_start, zlen); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5931 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5932 set_result(z); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5933 return true; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5934 } |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5935 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5936 //-------------inline_mulAdd------------------------------------------ |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5937 bool LibraryCallKit::inline_mulAdd() { |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5938 assert(UseMulAddIntrinsic, "not implementated on this platform"); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5939 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5940 address stubAddr = StubRoutines::mulAdd(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5941 if (stubAddr == NULL) { |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5942 return false; // Intrinsic's stub is not implemented on this platform |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5943 } |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5944 const char* stubName = "mulAdd"; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5945 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5946 assert(callee()->signature()->size() == 5, "mulAdd has 5 parameters"); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5947 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5948 Node* out = argument(0); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5949 Node* in = argument(1); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5950 Node* offset = argument(2); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5951 Node* len = argument(3); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5952 Node* k = argument(4); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5953 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5954 const Type* out_type = out->Value(&_gvn); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5955 const Type* in_type = in->Value(&_gvn); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5956 const TypeAryPtr* top_out = out_type->isa_aryptr(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5957 const TypeAryPtr* top_in = in_type->isa_aryptr(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5958 if (top_out == NULL || top_out->klass() == NULL || |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5959 top_in == NULL || top_in->klass() == NULL) { |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5960 // failed array check |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5961 return false; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5962 } |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5963 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5964 BasicType out_elem = out_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5965 BasicType in_elem = in_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5966 if (out_elem != T_INT || in_elem != T_INT) { |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5967 return false; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5968 } |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5969 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5970 Node* outlen = load_array_length(out); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5971 Node* new_offset = _gvn.transform(new (C) SubINode(outlen, offset)); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5972 Node* out_start = array_element_address(out, intcon(0), out_elem); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5973 Node* in_start = array_element_address(in, intcon(0), in_elem); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5974 |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5975 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5976 OptoRuntime::mulAdd_Type(), |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5977 stubAddr, stubName, TypePtr::BOTTOM, |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5978 out_start,in_start, new_offset, len, k); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5979 Node* result = _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5980 set_result(result); |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5981 return true; |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5982 } |
51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
igerasim
parents:
23086
diff
changeset
|
5983 |
23886
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5984 //-------------inline_montgomeryMultiply----------------------------------- |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5985 bool LibraryCallKit::inline_montgomeryMultiply() { |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5986 address stubAddr = StubRoutines::montgomeryMultiply(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5987 if (stubAddr == NULL) { |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5988 return false; // Intrinsic's stub is not implemented on this platform |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5989 } |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5990 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5991 assert(UseMontgomeryMultiplyIntrinsic, "not implemented on this platform"); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5992 const char* stubName = "montgomery_square"; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5993 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5994 assert(callee()->signature()->size() == 7, "montgomeryMultiply has 7 parameters"); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5995 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5996 Node* a = argument(0); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5997 Node* b = argument(1); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5998 Node* n = argument(2); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
5999 Node* len = argument(3); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6000 Node* inv = argument(4); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6001 Node* m = argument(6); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6002 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6003 const Type* a_type = a->Value(&_gvn); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6004 const TypeAryPtr* top_a = a_type->isa_aryptr(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6005 const Type* b_type = b->Value(&_gvn); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6006 const TypeAryPtr* top_b = b_type->isa_aryptr(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6007 const Type* n_type = a->Value(&_gvn); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6008 const TypeAryPtr* top_n = n_type->isa_aryptr(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6009 const Type* m_type = a->Value(&_gvn); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6010 const TypeAryPtr* top_m = m_type->isa_aryptr(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6011 if (top_a == NULL || top_a->klass() == NULL || |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6012 top_b == NULL || top_b->klass() == NULL || |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6013 top_n == NULL || top_n->klass() == NULL || |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6014 top_m == NULL || top_m->klass() == NULL) { |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6015 // failed array check |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6016 return false; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6017 } |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6018 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6019 BasicType a_elem = a_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6020 BasicType b_elem = b_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6021 BasicType n_elem = n_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6022 BasicType m_elem = m_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6023 if (a_elem != T_INT || b_elem != T_INT || n_elem != T_INT || m_elem != T_INT) { |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6024 return false; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6025 } |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6026 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6027 // Make the call |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6028 { |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6029 Node* a_start = array_element_address(a, intcon(0), a_elem); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6030 Node* b_start = array_element_address(b, intcon(0), b_elem); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6031 Node* n_start = array_element_address(n, intcon(0), n_elem); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6032 Node* m_start = array_element_address(m, intcon(0), m_elem); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6033 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6034 Node* call = make_runtime_call(RC_LEAF, |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6035 OptoRuntime::montgomeryMultiply_Type(), |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6036 stubAddr, stubName, TypePtr::BOTTOM, |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6037 a_start, b_start, n_start, len, inv, top(), |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6038 m_start); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6039 set_result(m); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6040 } |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6041 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6042 return true; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6043 } |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6044 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6045 bool LibraryCallKit::inline_montgomerySquare() { |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6046 address stubAddr = StubRoutines::montgomerySquare(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6047 if (stubAddr == NULL) { |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6048 return false; // Intrinsic's stub is not implemented on this platform |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6049 } |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6050 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6051 assert(UseMontgomerySquareIntrinsic, "not implemented on this platform"); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6052 const char* stubName = "montgomery_square"; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6053 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6054 assert(callee()->signature()->size() == 6, "montgomerySquare has 6 parameters"); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6055 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6056 Node* a = argument(0); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6057 Node* n = argument(1); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6058 Node* len = argument(2); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6059 Node* inv = argument(3); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6060 Node* m = argument(5); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6061 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6062 const Type* a_type = a->Value(&_gvn); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6063 const TypeAryPtr* top_a = a_type->isa_aryptr(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6064 const Type* n_type = a->Value(&_gvn); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6065 const TypeAryPtr* top_n = n_type->isa_aryptr(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6066 const Type* m_type = a->Value(&_gvn); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6067 const TypeAryPtr* top_m = m_type->isa_aryptr(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6068 if (top_a == NULL || top_a->klass() == NULL || |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6069 top_n == NULL || top_n->klass() == NULL || |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6070 top_m == NULL || top_m->klass() == NULL) { |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6071 // failed array check |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6072 return false; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6073 } |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6074 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6075 BasicType a_elem = a_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6076 BasicType n_elem = n_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6077 BasicType m_elem = m_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6078 if (a_elem != T_INT || n_elem != T_INT || m_elem != T_INT) { |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6079 return false; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6080 } |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6081 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6082 // Make the call |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6083 { |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6084 Node* a_start = array_element_address(a, intcon(0), a_elem); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6085 Node* n_start = array_element_address(n, intcon(0), n_elem); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6086 Node* m_start = array_element_address(m, intcon(0), m_elem); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6087 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6088 Node* call = make_runtime_call(RC_LEAF, |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6089 OptoRuntime::montgomerySquare_Type(), |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6090 stubAddr, stubName, TypePtr::BOTTOM, |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6091 a_start, n_start, len, inv, top(), |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6092 m_start); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6093 set_result(m); |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6094 } |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6095 |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6096 return true; |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6097 } |
5601e440e5e7
8130150: Implement BigInteger.montgomeryMultiply intrinsic
vkempik
parents:
23885
diff
changeset
|
6098 |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
6099 |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6100 /** |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6101 * Calculate CRC32 for byte. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6102 * int java.util.zip.CRC32.update(int crc, int b) |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6103 */ |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6104 bool LibraryCallKit::inline_updateCRC32() { |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6105 assert(UseCRC32Intrinsics, "need AVX and LCMUL instructions support"); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6106 assert(callee()->signature()->size() == 2, "update has 2 parameters"); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6107 // no receiver since it is static method |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6108 Node* crc = argument(0); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6109 Node* b = argument(1); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6110 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6111 /* |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6112 * int c = ~ crc; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6113 * b = timesXtoThe32[(b ^ c) & 0xFF]; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6114 * b = b ^ (c >>> 8); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6115 * crc = ~b; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6116 */ |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6117 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6118 Node* M1 = intcon(-1); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6119 crc = _gvn.transform(new (C) XorINode(crc, M1)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6120 Node* result = _gvn.transform(new (C) XorINode(crc, b)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6121 result = _gvn.transform(new (C) AndINode(result, intcon(0xFF))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6122 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6123 Node* base = makecon(TypeRawPtr::make(StubRoutines::crc_table_addr())); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6124 Node* offset = _gvn.transform(new (C) LShiftINode(result, intcon(0x2))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6125 Node* adr = basic_plus_adr(top(), base, ConvI2X(offset)); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
6126 result = make_load(control(), adr, TypeInt::INT, T_INT, MemNode::unordered); |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6127 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6128 crc = _gvn.transform(new (C) URShiftINode(crc, intcon(8))); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6129 result = _gvn.transform(new (C) XorINode(crc, result)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6130 result = _gvn.transform(new (C) XorINode(result, M1)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6131 set_result(result); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6132 return true; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6133 } |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6134 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6135 /** |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6136 * Calculate CRC32 for byte[] array. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6137 * int java.util.zip.CRC32.updateBytes(int crc, byte[] buf, int off, int len) |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6138 */ |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6139 bool LibraryCallKit::inline_updateBytesCRC32() { |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6140 assert(UseCRC32Intrinsics, "need AVX and LCMUL instructions support"); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6141 assert(callee()->signature()->size() == 4, "updateBytes has 4 parameters"); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6142 // no receiver since it is static method |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6143 Node* crc = argument(0); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6144 Node* src = argument(1); // type: oop |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6145 Node* offset = argument(2); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6146 Node* length = argument(3); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6147 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6148 const Type* src_type = src->Value(&_gvn); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6149 const TypeAryPtr* top_src = src_type->isa_aryptr(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6150 if (top_src == NULL || top_src->klass() == NULL) { |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6151 // failed array check |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6152 return false; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6153 } |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6154 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6155 // Figure out the size and type of the elements we will be copying. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6156 BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6157 if (src_elem != T_BYTE) { |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6158 return false; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6159 } |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6160 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6161 // 'src_start' points to src array + scaled offset |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6162 Node* src_start = array_element_address(src, offset, src_elem); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6163 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6164 // We assume that range check is done by caller. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6165 // TODO: generate range check (offset+length < src.length) in debug VM. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6166 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6167 // Call the stub. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6168 address stubAddr = StubRoutines::updateBytesCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6169 const char *stubName = "updateBytesCRC32"; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6170 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6171 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::updateBytesCRC32_Type(), |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6172 stubAddr, stubName, TypePtr::BOTTOM, |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6173 crc, src_start, length); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6174 Node* result = _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6175 set_result(result); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6176 return true; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6177 } |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6178 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6179 /** |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6180 * Calculate CRC32 for ByteBuffer. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6181 * int java.util.zip.CRC32.updateByteBuffer(int crc, long buf, int off, int len) |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6182 */ |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6183 bool LibraryCallKit::inline_updateByteBufferCRC32() { |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6184 assert(UseCRC32Intrinsics, "need AVX and LCMUL instructions support"); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6185 assert(callee()->signature()->size() == 5, "updateByteBuffer has 4 parameters and one is long"); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6186 // no receiver since it is static method |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6187 Node* crc = argument(0); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6188 Node* src = argument(1); // type: long |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6189 Node* offset = argument(3); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6190 Node* length = argument(4); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6191 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6192 src = ConvL2X(src); // adjust Java long to machine word |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6193 Node* base = _gvn.transform(new (C) CastX2PNode(src)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6194 offset = ConvI2X(offset); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6195 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6196 // 'src_start' points to src array + scaled offset |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6197 Node* src_start = basic_plus_adr(top(), base, offset); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6198 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6199 // Call the stub. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6200 address stubAddr = StubRoutines::updateBytesCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6201 const char *stubName = "updateBytesCRC32"; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6202 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6203 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::updateBytesCRC32_Type(), |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6204 stubAddr, stubName, TypePtr::BOTTOM, |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6205 crc, src_start, length); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6206 Node* result = _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6207 set_result(result); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6208 return true; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6209 } |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
6210 |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6211 //----------------------------inline_reference_get---------------------------- |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6212 // public T java.lang.ref.Reference.get(); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6213 bool LibraryCallKit::inline_reference_get() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6214 const int referent_offset = java_lang_ref_Reference::referent_offset; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6215 guarantee(referent_offset > 0, "should have already been set"); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6216 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6217 // Get the argument: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6218 Node* reference_obj = null_check_receiver(); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6219 if (stopped()) return true; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6220 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6221 Node* adr = basic_plus_adr(reference_obj, reference_obj, referent_offset); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6222 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6223 ciInstanceKlass* klass = env()->Object_klass(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6224 const TypeOopPtr* object_type = TypeOopPtr::make_from_klass(klass); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6225 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6226 Node* no_ctrl = NULL; |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
6227 Node* result = make_load(no_ctrl, adr, object_type, T_OBJECT, MemNode::unordered); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6228 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6229 // Use the pre-barrier to record the value in the referent field |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6230 pre_barrier(false /* do_load */, |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6231 control(), |
3258
edd9b016deb6
7036021: G1: build failure on win64 and linux with hs21 in jdk6 build environment
johnc
parents:
3255
diff
changeset
|
6232 NULL /* obj */, NULL /* adr */, max_juint /* alias_idx */, NULL /* val */, NULL /* val_type */, |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6233 result /* pre_val */, |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6234 T_OBJECT); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6235 |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
6236 // Add memory barrier to prevent commoning reads from this field |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
6237 // across safepoint since GC can change its value. |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
6238 insert_mem_bar(Op_MemBarCPUOrder); |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
6239 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6240 set_result(result); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6241 return true; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6242 } |
6894 | 6243 |
6244 | |
6245 Node * LibraryCallKit::load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString, | |
6246 bool is_exact=true, bool is_static=false) { | |
6247 | |
6248 const TypeInstPtr* tinst = _gvn.type(fromObj)->isa_instptr(); | |
6249 assert(tinst != NULL, "obj is null"); | |
6250 assert(tinst->klass()->is_loaded(), "obj is not loaded"); | |
6251 assert(!is_exact || tinst->klass_is_exact(), "klass not exact"); | |
6252 | |
6253 ciField* field = tinst->klass()->as_instance_klass()->get_field_by_name(ciSymbol::make(fieldName), | |
6254 ciSymbol::make(fieldTypeString), | |
6255 is_static); | |
6256 if (field == NULL) return (Node *) NULL; | |
6257 assert (field != NULL, "undefined field"); | |
6258 | |
6259 // Next code copied from Parse::do_get_xxx(): | |
6260 | |
6261 // Compute address and memory type. | |
6262 int offset = field->offset_in_bytes(); | |
6263 bool is_vol = field->is_volatile(); | |
6264 ciType* field_klass = field->type(); | |
6265 assert(field_klass->is_loaded(), "should be loaded"); | |
6266 const TypePtr* adr_type = C->alias_type(field)->adr_type(); | |
6267 Node *adr = basic_plus_adr(fromObj, fromObj, offset); | |
6268 BasicType bt = field->layout_type(); | |
6269 | |
6270 // Build the resultant type of the load | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6271 const Type *type; |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6272 if (bt == T_OBJECT) { |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6273 type = TypeOopPtr::make_from_klass(field_klass->as_klass()); |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6274 } else { |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6275 type = Type::get_const_basic_type(bt); |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6276 } |
6894 | 6277 |
20420
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6278 if (support_IRIW_for_not_multiple_copy_atomic_cpu && is_vol) { |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6279 insert_mem_bar(Op_MemBarVolatile); // StoreLoad barrier |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6280 } |
6894 | 6281 // Build the load. |
20420
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6282 MemNode::MemOrd mo = is_vol ? MemNode::acquire : MemNode::unordered; |
23055
c1c199dde5c9
8077504: Unsafe load can loose control dependency and cause crash
roland
parents:
22986
diff
changeset
|
6283 Node* loadedField = make_load(NULL, adr, type, bt, adr_type, mo, LoadNode::DependsOnlyOnTest, is_vol); |
20420
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6284 // If reference is volatile, prevent following memory ops from |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6285 // floating up past the volatile read. Also prevents commoning |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6286 // another volatile read. |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6287 if (is_vol) { |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6288 // Memory barrier includes bogus read of value to force load BEFORE membar |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6289 insert_mem_bar(Op_MemBarAcquire, loadedField); |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6290 } |
6894 | 6291 return loadedField; |
6292 } | |
6293 | |
6294 | |
6295 //------------------------------inline_aescrypt_Block----------------------- | |
6296 bool LibraryCallKit::inline_aescrypt_Block(vmIntrinsics::ID id) { | |
6297 address stubAddr; | |
6298 const char *stubName; | |
6299 assert(UseAES, "need AES instruction support"); | |
6300 | |
6301 switch(id) { | |
6302 case vmIntrinsics::_aescrypt_encryptBlock: | |
6303 stubAddr = StubRoutines::aescrypt_encryptBlock(); | |
6304 stubName = "aescrypt_encryptBlock"; | |
6305 break; | |
6306 case vmIntrinsics::_aescrypt_decryptBlock: | |
6307 stubAddr = StubRoutines::aescrypt_decryptBlock(); | |
6308 stubName = "aescrypt_decryptBlock"; | |
6309 break; | |
6310 } | |
6311 if (stubAddr == NULL) return false; | |
6312 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6313 Node* aescrypt_object = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6314 Node* src = argument(1); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6315 Node* src_offset = argument(2); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6316 Node* dest = argument(3); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6317 Node* dest_offset = argument(4); |
6894 | 6318 |
6319 // (1) src and dest are arrays. | |
6320 const Type* src_type = src->Value(&_gvn); | |
6321 const Type* dest_type = dest->Value(&_gvn); | |
6322 const TypeAryPtr* top_src = src_type->isa_aryptr(); | |
6323 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); | |
6324 assert (top_src != NULL && top_src->klass() != NULL && top_dest != NULL && top_dest->klass() != NULL, "args are strange"); | |
6325 | |
6326 // for the quick and dirty code we will skip all the checks. | |
6327 // we are just trying to get the call to be generated. | |
6328 Node* src_start = src; | |
6329 Node* dest_start = dest; | |
6330 if (src_offset != NULL || dest_offset != NULL) { | |
6331 assert(src_offset != NULL && dest_offset != NULL, ""); | |
6332 src_start = array_element_address(src, src_offset, T_BYTE); | |
6333 dest_start = array_element_address(dest, dest_offset, T_BYTE); | |
6334 } | |
6335 | |
6336 // now need to get the start of its expanded key array | |
6337 // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java | |
6338 Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object); | |
6339 if (k_start == NULL) return false; | |
6340 | |
17670 | 6341 if (Matcher::pass_original_key_for_aes()) { |
6342 // on SPARC we need to pass the original key since key expansion needs to happen in intrinsics due to | |
6343 // compatibility issues between Java key expansion and SPARC crypto instructions | |
6344 Node* original_k_start = get_original_key_start_from_aescrypt_object(aescrypt_object); | |
6345 if (original_k_start == NULL) return false; | |
6346 | |
6347 // Call the stub. | |
6348 make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::aescrypt_block_Type(), | |
6349 stubAddr, stubName, TypePtr::BOTTOM, | |
6350 src_start, dest_start, k_start, original_k_start); | |
6351 } else { | |
6352 // Call the stub. | |
6353 make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::aescrypt_block_Type(), | |
6354 stubAddr, stubName, TypePtr::BOTTOM, | |
6355 src_start, dest_start, k_start); | |
6356 } | |
6894 | 6357 |
6358 return true; | |
6359 } | |
6360 | |
6361 //------------------------------inline_cipherBlockChaining_AESCrypt----------------------- | |
6362 bool LibraryCallKit::inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id) { | |
6363 address stubAddr; | |
6364 const char *stubName; | |
6365 | |
6366 assert(UseAES, "need AES instruction support"); | |
6367 | |
6368 switch(id) { | |
6369 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
6370 stubAddr = StubRoutines::cipherBlockChaining_encryptAESCrypt(); | |
6371 stubName = "cipherBlockChaining_encryptAESCrypt"; | |
6372 break; | |
6373 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
6374 stubAddr = StubRoutines::cipherBlockChaining_decryptAESCrypt(); | |
6375 stubName = "cipherBlockChaining_decryptAESCrypt"; | |
6376 break; | |
6377 } | |
6378 if (stubAddr == NULL) return false; | |
6379 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6380 Node* cipherBlockChaining_object = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6381 Node* src = argument(1); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6382 Node* src_offset = argument(2); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6383 Node* len = argument(3); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6384 Node* dest = argument(4); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6385 Node* dest_offset = argument(5); |
6894 | 6386 |
6387 // (1) src and dest are arrays. | |
6388 const Type* src_type = src->Value(&_gvn); | |
6389 const Type* dest_type = dest->Value(&_gvn); | |
6390 const TypeAryPtr* top_src = src_type->isa_aryptr(); | |
6391 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); | |
6392 assert (top_src != NULL && top_src->klass() != NULL | |
6393 && top_dest != NULL && top_dest->klass() != NULL, "args are strange"); | |
6394 | |
6395 // checks are the responsibility of the caller | |
6396 Node* src_start = src; | |
6397 Node* dest_start = dest; | |
6398 if (src_offset != NULL || dest_offset != NULL) { | |
6399 assert(src_offset != NULL && dest_offset != NULL, ""); | |
6400 src_start = array_element_address(src, src_offset, T_BYTE); | |
6401 dest_start = array_element_address(dest, dest_offset, T_BYTE); | |
6402 } | |
6403 | |
6404 // if we are in this set of code, we "know" the embeddedCipher is an AESCrypt object | |
6405 // (because of the predicated logic executed earlier). | |
6406 // so we cast it here safely. | |
6407 // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java | |
6408 | |
6409 Node* embeddedCipherObj = load_field_from_object(cipherBlockChaining_object, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false); | |
6410 if (embeddedCipherObj == NULL) return false; | |
6411 | |
6412 // cast it to what we know it will be at runtime | |
6413 const TypeInstPtr* tinst = _gvn.type(cipherBlockChaining_object)->isa_instptr(); | |
6414 assert(tinst != NULL, "CBC obj is null"); | |
6415 assert(tinst->klass()->is_loaded(), "CBC obj is not loaded"); | |
6416 ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt")); | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6417 assert(klass_AESCrypt->is_loaded(), "predicate checks that this class is loaded"); |
6894 | 6418 |
6419 ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass(); | |
6420 const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_AESCrypt); | |
6421 const TypeOopPtr* xtype = aklass->as_instance_type(); | |
6422 Node* aescrypt_object = new(C) CheckCastPPNode(control(), embeddedCipherObj, xtype); | |
6423 aescrypt_object = _gvn.transform(aescrypt_object); | |
6424 | |
6425 // we need to get the start of the aescrypt_object's expanded key array | |
6426 Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object); | |
6427 if (k_start == NULL) return false; | |
6428 | |
6429 // similarly, get the start address of the r vector | |
6430 Node* objRvec = load_field_from_object(cipherBlockChaining_object, "r", "[B", /*is_exact*/ false); | |
6431 if (objRvec == NULL) return false; | |
6432 Node* r_start = array_element_address(objRvec, intcon(0), T_BYTE); | |
6433 | |
17670 | 6434 Node* cbcCrypt; |
6435 if (Matcher::pass_original_key_for_aes()) { | |
6436 // on SPARC we need to pass the original key since key expansion needs to happen in intrinsics due to | |
6437 // compatibility issues between Java key expansion and SPARC crypto instructions | |
6438 Node* original_k_start = get_original_key_start_from_aescrypt_object(aescrypt_object); | |
6439 if (original_k_start == NULL) return false; | |
6440 | |
6441 // Call the stub, passing src_start, dest_start, k_start, r_start, src_len and original_k_start | |
6442 cbcCrypt = make_runtime_call(RC_LEAF|RC_NO_FP, | |
6443 OptoRuntime::cipherBlockChaining_aescrypt_Type(), | |
6444 stubAddr, stubName, TypePtr::BOTTOM, | |
6445 src_start, dest_start, k_start, r_start, len, original_k_start); | |
6446 } else { | |
6447 // Call the stub, passing src_start, dest_start, k_start, r_start and src_len | |
6448 cbcCrypt = make_runtime_call(RC_LEAF|RC_NO_FP, | |
6449 OptoRuntime::cipherBlockChaining_aescrypt_Type(), | |
6450 stubAddr, stubName, TypePtr::BOTTOM, | |
6451 src_start, dest_start, k_start, r_start, len); | |
6452 } | |
6453 | |
6454 // return cipher length (int) | |
6455 Node* retvalue = _gvn.transform(new (C) ProjNode(cbcCrypt, TypeFunc::Parms)); | |
6456 set_result(retvalue); | |
6894 | 6457 return true; |
6458 } | |
6459 | |
6460 //------------------------------get_key_start_from_aescrypt_object----------------------- | |
6461 Node * LibraryCallKit::get_key_start_from_aescrypt_object(Node *aescrypt_object) { | |
6462 Node* objAESCryptKey = load_field_from_object(aescrypt_object, "K", "[I", /*is_exact*/ false); | |
6463 assert (objAESCryptKey != NULL, "wrong version of com.sun.crypto.provider.AESCrypt"); | |
6464 if (objAESCryptKey == NULL) return (Node *) NULL; | |
6465 | |
6466 // now have the array, need to get the start address of the K array | |
6467 Node* k_start = array_element_address(objAESCryptKey, intcon(0), T_INT); | |
6468 return k_start; | |
6469 } | |
6470 | |
17670 | 6471 //------------------------------get_original_key_start_from_aescrypt_object----------------------- |
6472 Node * LibraryCallKit::get_original_key_start_from_aescrypt_object(Node *aescrypt_object) { | |
6473 Node* objAESCryptKey = load_field_from_object(aescrypt_object, "lastKey", "[B", /*is_exact*/ false); | |
6474 assert (objAESCryptKey != NULL, "wrong version of com.sun.crypto.provider.AESCrypt"); | |
6475 if (objAESCryptKey == NULL) return (Node *) NULL; | |
6476 | |
6477 // now have the array, need to get the start address of the lastKey array | |
6478 Node* original_k_start = array_element_address(objAESCryptKey, intcon(0), T_BYTE); | |
6479 return original_k_start; | |
6480 } | |
6481 | |
6894 | 6482 //----------------------------inline_cipherBlockChaining_AESCrypt_predicate---------------------------- |
6483 // Return node representing slow path of predicate check. | |
6484 // the pseudo code we want to emulate with this predicate is: | |
6485 // for encryption: | |
6486 // if (embeddedCipherObj instanceof AESCrypt) do_intrinsic, else do_javapath | |
6487 // for decryption: | |
6488 // if ((embeddedCipherObj instanceof AESCrypt) && (cipher!=plain)) do_intrinsic, else do_javapath | |
6489 // note cipher==plain is more conservative than the original java code but that's OK | |
6490 // | |
6491 Node* LibraryCallKit::inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting) { | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6492 // The receiver was checked for NULL already. |
6894 | 6493 Node* objCBC = argument(0); |
6494 | |
6495 // Load embeddedCipher field of CipherBlockChaining object. | |
6496 Node* embeddedCipherObj = load_field_from_object(objCBC, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false); | |
6497 | |
6498 // get AESCrypt klass for instanceOf check | |
6499 // AESCrypt might not be loaded yet if some other SymmetricCipher got us to this compile point | |
6500 // will have same classloader as CipherBlockChaining object | |
6501 const TypeInstPtr* tinst = _gvn.type(objCBC)->isa_instptr(); | |
6502 assert(tinst != NULL, "CBCobj is null"); | |
6503 assert(tinst->klass()->is_loaded(), "CBCobj is not loaded"); | |
6504 | |
6505 // we want to do an instanceof comparison against the AESCrypt class | |
6506 ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt")); | |
6507 if (!klass_AESCrypt->is_loaded()) { | |
6508 // if AESCrypt is not even loaded, we never take the intrinsic fast path | |
6509 Node* ctrl = control(); | |
6510 set_control(top()); // no regular fast path | |
6511 return ctrl; | |
6512 } | |
6513 ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass(); | |
6514 | |
6515 Node* instof = gen_instanceof(embeddedCipherObj, makecon(TypeKlassPtr::make(instklass_AESCrypt))); | |
6516 Node* cmp_instof = _gvn.transform(new (C) CmpINode(instof, intcon(1))); | |
6517 Node* bool_instof = _gvn.transform(new (C) BoolNode(cmp_instof, BoolTest::ne)); | |
6518 | |
6519 Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN); | |
6520 | |
6521 // for encryption, we are done | |
6522 if (!decrypting) | |
6523 return instof_false; // even if it is NULL | |
6524 | |
6525 // for decryption, we need to add a further check to avoid | |
6526 // taking the intrinsic path when cipher and plain are the same | |
6527 // see the original java code for why. | |
6528 RegionNode* region = new(C) RegionNode(3); | |
6529 region->init_req(1, instof_false); | |
6530 Node* src = argument(1); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6531 Node* dest = argument(4); |
6894 | 6532 Node* cmp_src_dest = _gvn.transform(new (C) CmpPNode(src, dest)); |
6533 Node* bool_src_dest = _gvn.transform(new (C) BoolNode(cmp_src_dest, BoolTest::eq)); | |
6534 Node* src_dest_conjoint = generate_guard(bool_src_dest, NULL, PROB_MIN); | |
6535 region->init_req(2, src_dest_conjoint); | |
6536 | |
6537 record_for_igvn(region); | |
6538 return _gvn.transform(region); | |
6539 } | |
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6540 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6541 //------------------------------inline_sha_implCompress----------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6542 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6543 // Calculate SHA (i.e., SHA-1) for single-block byte[] array. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6544 // void com.sun.security.provider.SHA.implCompress(byte[] buf, int ofs) |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6545 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6546 // Calculate SHA2 (i.e., SHA-244 or SHA-256) for single-block byte[] array. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6547 // void com.sun.security.provider.SHA2.implCompress(byte[] buf, int ofs) |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6548 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6549 // Calculate SHA5 (i.e., SHA-384 or SHA-512) for single-block byte[] array. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6550 // void com.sun.security.provider.SHA5.implCompress(byte[] buf, int ofs) |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6551 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6552 bool LibraryCallKit::inline_sha_implCompress(vmIntrinsics::ID id) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6553 assert(callee()->signature()->size() == 2, "sha_implCompress has 2 parameters"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6554 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6555 Node* sha_obj = argument(0); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6556 Node* src = argument(1); // type oop |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6557 Node* ofs = argument(2); // type int |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6558 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6559 const Type* src_type = src->Value(&_gvn); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6560 const TypeAryPtr* top_src = src_type->isa_aryptr(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6561 if (top_src == NULL || top_src->klass() == NULL) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6562 // failed array check |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6563 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6564 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6565 // Figure out the size and type of the elements we will be copying. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6566 BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6567 if (src_elem != T_BYTE) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6568 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6569 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6570 // 'src_start' points to src array + offset |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6571 Node* src_start = array_element_address(src, ofs, src_elem); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6572 Node* state = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6573 address stubAddr; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6574 const char *stubName; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6575 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6576 switch(id) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6577 case vmIntrinsics::_sha_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6578 assert(UseSHA1Intrinsics, "need SHA1 instruction support"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6579 state = get_state_from_sha_object(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6580 stubAddr = StubRoutines::sha1_implCompress(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6581 stubName = "sha1_implCompress"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6582 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6583 case vmIntrinsics::_sha2_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6584 assert(UseSHA256Intrinsics, "need SHA256 instruction support"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6585 state = get_state_from_sha_object(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6586 stubAddr = StubRoutines::sha256_implCompress(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6587 stubName = "sha256_implCompress"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6588 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6589 case vmIntrinsics::_sha5_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6590 assert(UseSHA512Intrinsics, "need SHA512 instruction support"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6591 state = get_state_from_sha5_object(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6592 stubAddr = StubRoutines::sha512_implCompress(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6593 stubName = "sha512_implCompress"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6594 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6595 default: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6596 fatal_unexpected_iid(id); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6597 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6598 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6599 if (state == NULL) return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6600 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6601 // Call the stub. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6602 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::sha_implCompress_Type(), |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6603 stubAddr, stubName, TypePtr::BOTTOM, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6604 src_start, state); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6605 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6606 return true; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6607 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6608 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6609 //------------------------------inline_digestBase_implCompressMB----------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6610 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6611 // Calculate SHA/SHA2/SHA5 for multi-block byte[] array. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6612 // int com.sun.security.provider.DigestBase.implCompressMultiBlock(byte[] b, int ofs, int limit) |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6613 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6614 bool LibraryCallKit::inline_digestBase_implCompressMB(int predicate) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6615 assert(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6616 "need SHA1/SHA256/SHA512 instruction support"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6617 assert((uint)predicate < 3, "sanity"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6618 assert(callee()->signature()->size() == 3, "digestBase_implCompressMB has 3 parameters"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6619 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6620 Node* digestBase_obj = argument(0); // The receiver was checked for NULL already. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6621 Node* src = argument(1); // byte[] array |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6622 Node* ofs = argument(2); // type int |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6623 Node* limit = argument(3); // type int |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6624 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6625 const Type* src_type = src->Value(&_gvn); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6626 const TypeAryPtr* top_src = src_type->isa_aryptr(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6627 if (top_src == NULL || top_src->klass() == NULL) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6628 // failed array check |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6629 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6630 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6631 // Figure out the size and type of the elements we will be copying. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6632 BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6633 if (src_elem != T_BYTE) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6634 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6635 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6636 // 'src_start' points to src array + offset |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6637 Node* src_start = array_element_address(src, ofs, src_elem); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6638 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6639 const char* klass_SHA_name = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6640 const char* stub_name = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6641 address stub_addr = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6642 bool long_state = false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6643 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6644 switch (predicate) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6645 case 0: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6646 if (UseSHA1Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6647 klass_SHA_name = "sun/security/provider/SHA"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6648 stub_name = "sha1_implCompressMB"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6649 stub_addr = StubRoutines::sha1_implCompressMB(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6650 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6651 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6652 case 1: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6653 if (UseSHA256Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6654 klass_SHA_name = "sun/security/provider/SHA2"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6655 stub_name = "sha256_implCompressMB"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6656 stub_addr = StubRoutines::sha256_implCompressMB(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6657 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6658 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6659 case 2: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6660 if (UseSHA512Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6661 klass_SHA_name = "sun/security/provider/SHA5"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6662 stub_name = "sha512_implCompressMB"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6663 stub_addr = StubRoutines::sha512_implCompressMB(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6664 long_state = true; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6665 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6666 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6667 default: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6668 fatal(err_msg_res("unknown SHA intrinsic predicate: %d", predicate)); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6669 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6670 if (klass_SHA_name != NULL) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6671 // get DigestBase klass to lookup for SHA klass |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6672 const TypeInstPtr* tinst = _gvn.type(digestBase_obj)->isa_instptr(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6673 assert(tinst != NULL, "digestBase_obj is not instance???"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6674 assert(tinst->klass()->is_loaded(), "DigestBase is not loaded"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6675 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6676 ciKlass* klass_SHA = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make(klass_SHA_name)); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6677 assert(klass_SHA->is_loaded(), "predicate checks that this class is loaded"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6678 ciInstanceKlass* instklass_SHA = klass_SHA->as_instance_klass(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6679 return inline_sha_implCompressMB(digestBase_obj, instklass_SHA, long_state, stub_addr, stub_name, src_start, ofs, limit); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6680 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6681 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6682 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6683 //------------------------------inline_sha_implCompressMB----------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6684 bool LibraryCallKit::inline_sha_implCompressMB(Node* digestBase_obj, ciInstanceKlass* instklass_SHA, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6685 bool long_state, address stubAddr, const char *stubName, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6686 Node* src_start, Node* ofs, Node* limit) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6687 const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_SHA); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6688 const TypeOopPtr* xtype = aklass->as_instance_type(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6689 Node* sha_obj = new (C) CheckCastPPNode(control(), digestBase_obj, xtype); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6690 sha_obj = _gvn.transform(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6691 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6692 Node* state; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6693 if (long_state) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6694 state = get_state_from_sha5_object(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6695 } else { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6696 state = get_state_from_sha_object(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6697 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6698 if (state == NULL) return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6699 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6700 // Call the stub. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6701 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6702 OptoRuntime::digestBase_implCompressMB_Type(), |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6703 stubAddr, stubName, TypePtr::BOTTOM, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6704 src_start, state, ofs, limit); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6705 // return ofs (int) |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6706 Node* result = _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6707 set_result(result); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6708 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6709 return true; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6710 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6711 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6712 //------------------------------get_state_from_sha_object----------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6713 Node * LibraryCallKit::get_state_from_sha_object(Node *sha_object) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6714 Node* sha_state = load_field_from_object(sha_object, "state", "[I", /*is_exact*/ false); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6715 assert (sha_state != NULL, "wrong version of sun.security.provider.SHA/SHA2"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6716 if (sha_state == NULL) return (Node *) NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6717 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6718 // now have the array, need to get the start address of the state array |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6719 Node* state = array_element_address(sha_state, intcon(0), T_INT); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6720 return state; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6721 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6722 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6723 //------------------------------get_state_from_sha5_object----------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6724 Node * LibraryCallKit::get_state_from_sha5_object(Node *sha_object) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6725 Node* sha_state = load_field_from_object(sha_object, "state", "[J", /*is_exact*/ false); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6726 assert (sha_state != NULL, "wrong version of sun.security.provider.SHA5"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6727 if (sha_state == NULL) return (Node *) NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6728 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6729 // now have the array, need to get the start address of the state array |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6730 Node* state = array_element_address(sha_state, intcon(0), T_LONG); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6731 return state; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6732 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6733 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6734 //----------------------------inline_digestBase_implCompressMB_predicate---------------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6735 // Return node representing slow path of predicate check. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6736 // the pseudo code we want to emulate with this predicate is: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6737 // if (digestBaseObj instanceof SHA/SHA2/SHA5) do_intrinsic, else do_javapath |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6738 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6739 Node* LibraryCallKit::inline_digestBase_implCompressMB_predicate(int predicate) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6740 assert(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6741 "need SHA1/SHA256/SHA512 instruction support"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6742 assert((uint)predicate < 3, "sanity"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6743 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6744 // The receiver was checked for NULL already. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6745 Node* digestBaseObj = argument(0); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6746 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6747 // get DigestBase klass for instanceOf check |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6748 const TypeInstPtr* tinst = _gvn.type(digestBaseObj)->isa_instptr(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6749 assert(tinst != NULL, "digestBaseObj is null"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6750 assert(tinst->klass()->is_loaded(), "DigestBase is not loaded"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6751 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6752 const char* klass_SHA_name = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6753 switch (predicate) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6754 case 0: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6755 if (UseSHA1Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6756 // we want to do an instanceof comparison against the SHA class |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6757 klass_SHA_name = "sun/security/provider/SHA"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6758 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6759 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6760 case 1: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6761 if (UseSHA256Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6762 // we want to do an instanceof comparison against the SHA2 class |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6763 klass_SHA_name = "sun/security/provider/SHA2"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6764 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6765 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6766 case 2: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6767 if (UseSHA512Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6768 // we want to do an instanceof comparison against the SHA5 class |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6769 klass_SHA_name = "sun/security/provider/SHA5"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6770 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6771 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6772 default: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6773 fatal(err_msg_res("unknown SHA intrinsic predicate: %d", predicate)); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6774 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6775 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6776 ciKlass* klass_SHA = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6777 if (klass_SHA_name != NULL) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6778 klass_SHA = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make(klass_SHA_name)); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6779 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6780 if ((klass_SHA == NULL) || !klass_SHA->is_loaded()) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6781 // if none of SHA/SHA2/SHA5 is loaded, we never take the intrinsic fast path |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6782 Node* ctrl = control(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6783 set_control(top()); // no intrinsic path |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6784 return ctrl; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6785 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6786 ciInstanceKlass* instklass_SHA = klass_SHA->as_instance_klass(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6787 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6788 Node* instofSHA = gen_instanceof(digestBaseObj, makecon(TypeKlassPtr::make(instklass_SHA))); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6789 Node* cmp_instof = _gvn.transform(new (C) CmpINode(instofSHA, intcon(1))); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6790 Node* bool_instof = _gvn.transform(new (C) BoolNode(cmp_instof, BoolTest::ne)); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6791 Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6792 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6793 return instof_false; // even if it is NULL |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6794 } |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6795 |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6796 bool LibraryCallKit::inline_profileBoolean() { |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6797 Node* counts = argument(1); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6798 const TypeAryPtr* ary = NULL; |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6799 ciArray* aobj = NULL; |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6800 if (counts->is_Con() |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6801 && (ary = counts->bottom_type()->isa_aryptr()) != NULL |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6802 && (aobj = ary->const_oop()->as_array()) != NULL |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6803 && (aobj->length() == 2)) { |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6804 // Profile is int[2] where [0] and [1] correspond to false and true value occurrences respectively. |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6805 jint false_cnt = aobj->element_value(0).as_int(); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6806 jint true_cnt = aobj->element_value(1).as_int(); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6807 |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6808 if (C->log() != NULL) { |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6809 C->log()->elem("observe source='profileBoolean' false='%d' true='%d'", |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6810 false_cnt, true_cnt); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6811 } |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6812 |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6813 if (false_cnt + true_cnt == 0) { |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6814 // According to profile, never executed. |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6815 uncommon_trap_exact(Deoptimization::Reason_intrinsic, |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6816 Deoptimization::Action_reinterpret); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6817 return true; |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6818 } |
22986
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6819 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6820 // result is a boolean (0 or 1) and its profile (false_cnt & true_cnt) |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6821 // is a number of each value occurrences. |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6822 Node* result = argument(0); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6823 if (false_cnt == 0 || true_cnt == 0) { |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6824 // According to profile, one value has been never seen. |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6825 int expected_val = (false_cnt == 0) ? 1 : 0; |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6826 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6827 Node* cmp = _gvn.transform(new (C) CmpINode(result, intcon(expected_val))); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6828 Node* test = _gvn.transform(new (C) BoolNode(cmp, BoolTest::eq)); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6829 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6830 IfNode* check = create_and_map_if(control(), test, PROB_ALWAYS, COUNT_UNKNOWN); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6831 Node* fast_path = _gvn.transform(new (C) IfTrueNode(check)); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6832 Node* slow_path = _gvn.transform(new (C) IfFalseNode(check)); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6833 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6834 { // Slow path: uncommon trap for never seen value and then reexecute |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6835 // MethodHandleImpl::profileBoolean() to bump the count, so JIT knows |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6836 // the value has been seen at least once. |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6837 PreserveJVMState pjvms(this); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6838 PreserveReexecuteState preexecs(this); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6839 jvms()->set_should_reexecute(true); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6840 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6841 set_control(slow_path); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6842 set_i_o(i_o()); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6843 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6844 uncommon_trap_exact(Deoptimization::Reason_intrinsic, |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6845 Deoptimization::Action_reinterpret); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6846 } |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6847 // The guard for never seen value enables sharpening of the result and |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6848 // returning a constant. It allows to eliminate branches on the same value |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6849 // later on. |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6850 set_control(fast_path); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6851 result = intcon(expected_val); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6852 } |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6853 // Stop profiling. |
22986
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6854 // MethodHandleImpl::profileBoolean() has profiling logic in its bytecode. |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6855 // By replacing method body with profile data (represented as ProfileBooleanNode |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6856 // on IR level) we effectively disable profiling. |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6857 // It enables full speed execution once optimized code is generated. |
22986
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6858 Node* profile = _gvn.transform(new (C) ProfileBooleanNode(result, false_cnt, true_cnt)); |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6859 C->record_for_igvn(profile); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6860 set_result(profile); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6861 return true; |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6862 } else { |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6863 // Continue profiling. |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6864 // Profile data isn't available at the moment. So, execute method's bytecode version. |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6865 // Usually, when GWT LambdaForms are profiled it means that a stand-alone nmethod |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6866 // is compiled and counters aren't available since corresponding MethodHandle |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6867 // isn't a compile-time constant. |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6868 return false; |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6869 } |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6870 } |