Mercurial > hg > graal-jvmci-8
annotate src/share/vm/opto/library_call.cpp @ 23086:bf41eee321e5
8074551: GWT can be marked non-compilable due to deopt count pollution
Reviewed-by: kvn
author | vlivanov |
---|---|
date | Thu, 11 Jun 2015 14:19:40 +0300 |
parents | c1c199dde5c9 |
children | dd9cc155639c daaf806995b3 |
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(); |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
327 |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
328 bool inline_profileBoolean(); |
0 | 329 }; |
330 | |
331 | |
332 //---------------------------make_vm_intrinsic---------------------------- | |
333 CallGenerator* Compile::make_vm_intrinsic(ciMethod* m, bool is_virtual) { | |
334 vmIntrinsics::ID id = m->intrinsic_id(); | |
335 assert(id != vmIntrinsics::_none, "must be a VM intrinsic"); | |
336 | |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
337 ccstr disable_intr = NULL; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
338 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
339 if ((DisableIntrinsic[0] != '\0' |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
340 && strstr(DisableIntrinsic, vmIntrinsics::name_at(id)) != NULL) || |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
341 (method_has_option_value("DisableIntrinsic", disable_intr) |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
342 && strstr(disable_intr, vmIntrinsics::name_at(id)) != NULL)) { |
0 | 343 // disabled by a user request on the command line: |
344 // example: -XX:DisableIntrinsic=_hashCode,_getClass | |
345 return NULL; | |
346 } | |
347 | |
348 if (!m->is_loaded()) { | |
349 // do not attempt to inline unloaded methods | |
350 return NULL; | |
351 } | |
352 | |
353 // Only a few intrinsics implement a virtual dispatch. | |
354 // They are expensive calls which are also frequently overridden. | |
355 if (is_virtual) { | |
356 switch (id) { | |
357 case vmIntrinsics::_hashCode: | |
358 case vmIntrinsics::_clone: | |
359 // OK, Object.hashCode and Object.clone intrinsics come in both flavors | |
360 break; | |
361 default: | |
362 return NULL; | |
363 } | |
364 } | |
365 | |
366 // -XX:-InlineNatives disables nearly all intrinsics: | |
367 if (!InlineNatives) { | |
368 switch (id) { | |
369 case vmIntrinsics::_indexOf: | |
370 case vmIntrinsics::_compareTo: | |
681 | 371 case vmIntrinsics::_equals: |
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
372 case vmIntrinsics::_equalsC: |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
373 case vmIntrinsics::_getAndAddInt: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
374 case vmIntrinsics::_getAndAddLong: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
375 case vmIntrinsics::_getAndSetInt: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
376 case vmIntrinsics::_getAndSetLong: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
377 case vmIntrinsics::_getAndSetObject: |
7425 | 378 case vmIntrinsics::_loadFence: |
379 case vmIntrinsics::_storeFence: | |
380 case vmIntrinsics::_fullFence: | |
0 | 381 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
|
382 case vmIntrinsics::_Reference_get: |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
383 break; // InlineNatives does not control Reference.get |
0 | 384 default: |
385 return NULL; | |
386 } | |
387 } | |
388 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
389 int predicates = 0; |
12330
29bdcf12457c
8014447: Object.hashCode intrinsic breaks inline caches
shade
parents:
12323
diff
changeset
|
390 bool does_virtual_dispatch = false; |
6894 | 391 |
0 | 392 switch (id) { |
393 case vmIntrinsics::_compareTo: | |
394 if (!SpecialStringCompareTo) return NULL; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
395 if (!Matcher::match_rule_supported(Op_StrComp)) return NULL; |
0 | 396 break; |
397 case vmIntrinsics::_indexOf: | |
398 if (!SpecialStringIndexOf) return NULL; | |
399 break; | |
681 | 400 case vmIntrinsics::_equals: |
401 if (!SpecialStringEquals) return NULL; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
402 if (!Matcher::match_rule_supported(Op_StrEquals)) return NULL; |
681 | 403 break; |
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
404 case vmIntrinsics::_equalsC: |
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
405 if (!SpecialArraysEquals) 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_AryEq)) return NULL; |
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
407 break; |
0 | 408 case vmIntrinsics::_arraycopy: |
409 if (!InlineArrayCopy) return NULL; | |
410 break; | |
411 case vmIntrinsics::_copyMemory: | |
412 if (StubRoutines::unsafe_arraycopy() == NULL) return NULL; | |
413 if (!InlineArrayCopy) return NULL; | |
414 break; | |
415 case vmIntrinsics::_hashCode: | |
416 if (!InlineObjectHash) return NULL; | |
12330
29bdcf12457c
8014447: Object.hashCode intrinsic breaks inline caches
shade
parents:
12323
diff
changeset
|
417 does_virtual_dispatch = true; |
0 | 418 break; |
419 case vmIntrinsics::_clone: | |
12330
29bdcf12457c
8014447: Object.hashCode intrinsic breaks inline caches
shade
parents:
12323
diff
changeset
|
420 does_virtual_dispatch = true; |
0 | 421 case vmIntrinsics::_copyOf: |
422 case vmIntrinsics::_copyOfRange: | |
423 if (!InlineObjectCopy) return NULL; | |
424 // These also use the arraycopy intrinsic mechanism: | |
425 if (!InlineArrayCopy) return NULL; | |
426 break; | |
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
427 case vmIntrinsics::_encodeISOArray: |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
428 if (!SpecialEncodeISOArray) return NULL; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
429 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
|
430 break; |
0 | 431 case vmIntrinsics::_checkIndex: |
432 // We do not intrinsify this. The optimizer does fine with it. | |
433 return NULL; | |
434 | |
435 case vmIntrinsics::_getCallerClass: | |
436 if (!UseNewReflection) return NULL; | |
437 if (!InlineReflectionGetCallerClass) return NULL; | |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
438 if (SystemDictionary::reflect_CallerSensitive_klass() == NULL) return NULL; |
0 | 439 break; |
440 | |
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
441 case vmIntrinsics::_bitCount_i: |
5934
61b82be3b1ff
7152957: VM crashes with assert(false) failed: bad AD file
never
parents:
5927
diff
changeset
|
442 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
|
443 break; |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
444 |
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
445 case vmIntrinsics::_bitCount_l: |
5934
61b82be3b1ff
7152957: VM crashes with assert(false) failed: bad AD file
never
parents:
5927
diff
changeset
|
446 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
|
447 break; |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
448 |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
449 case vmIntrinsics::_numberOfLeadingZeros_i: |
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
450 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
|
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_l: |
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_CountLeadingZerosL)) 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::_numberOfTrailingZeros_i: |
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_CountTrailingZerosI)) 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_l: |
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_CountTrailingZerosL)) return NULL; |
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
463 break; |
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
464 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
465 case vmIntrinsics::_reverseBytes_c: |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
466 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
|
467 break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
468 case vmIntrinsics::_reverseBytes_s: |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
469 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
|
470 break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
471 case vmIntrinsics::_reverseBytes_i: |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
472 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
|
473 break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
474 case vmIntrinsics::_reverseBytes_l: |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
475 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
|
476 break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
477 |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
478 case vmIntrinsics::_Reference_get: |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
479 // 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
|
480 // 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
|
481 // 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
|
482 // 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
|
483 break; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
484 |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
485 case vmIntrinsics::_compareAndSwapObject: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
486 #ifdef _LP64 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
487 if (!UseCompressedOops && !Matcher::match_rule_supported(Op_CompareAndSwapP)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
488 #endif |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
489 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
490 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
491 case vmIntrinsics::_compareAndSwapLong: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
492 if (!Matcher::match_rule_supported(Op_CompareAndSwapL)) return NULL; |
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::_getAndAddInt: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
496 if (!Matcher::match_rule_supported(Op_GetAndAddI)) 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::_getAndAddLong: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
500 if (!Matcher::match_rule_supported(Op_GetAndAddL)) 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::_getAndSetInt: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
504 if (!Matcher::match_rule_supported(Op_GetAndSetI)) 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::_getAndSetLong: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
508 if (!Matcher::match_rule_supported(Op_GetAndSetL)) 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::_getAndSetObject: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
512 #ifdef _LP64 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
513 if (!UseCompressedOops && !Matcher::match_rule_supported(Op_GetAndSetP)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
514 if (UseCompressedOops && !Matcher::match_rule_supported(Op_GetAndSetN)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
515 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
516 #else |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
517 if (!Matcher::match_rule_supported(Op_GetAndSetP)) return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
518 break; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
519 #endif |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
520 |
6894 | 521 case vmIntrinsics::_aescrypt_encryptBlock: |
522 case vmIntrinsics::_aescrypt_decryptBlock: | |
523 if (!UseAESIntrinsics) return NULL; | |
524 break; | |
525 | |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
526 case vmIntrinsics::_multiplyToLen: |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
527 if (!UseMultiplyToLenIntrinsic) return NULL; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
528 break; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
529 |
6894 | 530 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: |
531 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
532 if (!UseAESIntrinsics) return NULL; | |
533 // these two require the predicated logic | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
534 predicates = 1; |
6894 | 535 break; |
536 | |
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
537 case vmIntrinsics::_sha_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
538 if (!UseSHA1Intrinsics) return NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
539 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
540 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
541 case vmIntrinsics::_sha2_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
542 if (!UseSHA256Intrinsics) return NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
543 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
544 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
545 case vmIntrinsics::_sha5_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
546 if (!UseSHA512Intrinsics) return NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
547 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
548 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
549 case vmIntrinsics::_digestBase_implCompressMB: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
550 if (!(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics)) return NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
551 predicates = 3; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
552 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
553 |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
554 case vmIntrinsics::_updateCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
555 case vmIntrinsics::_updateBytesCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
556 case vmIntrinsics::_updateByteBufferCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
557 if (!UseCRC32Intrinsics) return NULL; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
558 break; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
559 |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
560 case vmIntrinsics::_incrementExactI: |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
561 case vmIntrinsics::_addExactI: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
562 if (!Matcher::match_rule_supported(Op_OverflowAddI) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
563 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
564 case vmIntrinsics::_incrementExactL: |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
565 case vmIntrinsics::_addExactL: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
566 if (!Matcher::match_rule_supported(Op_OverflowAddL) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
567 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
568 case vmIntrinsics::_decrementExactI: |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
569 case vmIntrinsics::_subtractExactI: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
570 if (!Matcher::match_rule_supported(Op_OverflowSubI) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
571 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
572 case vmIntrinsics::_decrementExactL: |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
573 case vmIntrinsics::_subtractExactL: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
574 if (!Matcher::match_rule_supported(Op_OverflowSubL) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
575 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
576 case vmIntrinsics::_negateExactI: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
577 if (!Matcher::match_rule_supported(Op_OverflowSubI) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
578 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
579 case vmIntrinsics::_negateExactL: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
580 if (!Matcher::match_rule_supported(Op_OverflowSubL) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
581 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
582 case vmIntrinsics::_multiplyExactI: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
583 if (!Matcher::match_rule_supported(Op_OverflowMulI) || !UseMathExactIntrinsics) return NULL; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
584 break; |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
585 case vmIntrinsics::_multiplyExactL: |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
586 if (!Matcher::match_rule_supported(Op_OverflowMulL) || !UseMathExactIntrinsics) return NULL; |
12323 | 587 break; |
588 | |
0 | 589 default: |
856
75596850f863
6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents:
851
diff
changeset
|
590 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
|
591 assert(id != vmIntrinsics::_Object_init && id != vmIntrinsics::_invoke, "enum out of order?"); |
0 | 592 break; |
593 } | |
594 | |
595 // -XX:-InlineClassNatives disables natives from the Class class. | |
596 // The flag applies to all reflective calls, notably Array.newArray | |
597 // (visible to Java programmers as Array.newInstance). | |
598 if (m->holder()->name() == ciSymbol::java_lang_Class() || | |
599 m->holder()->name() == ciSymbol::java_lang_reflect_Array()) { | |
600 if (!InlineClassNatives) return NULL; | |
601 } | |
602 | |
603 // -XX:-InlineThreadNatives disables natives from the Thread class. | |
604 if (m->holder()->name() == ciSymbol::java_lang_Thread()) { | |
605 if (!InlineThreadNatives) return NULL; | |
606 } | |
607 | |
608 // -XX:-InlineMathNatives disables natives from the Math,Float and Double classes. | |
609 if (m->holder()->name() == ciSymbol::java_lang_Math() || | |
610 m->holder()->name() == ciSymbol::java_lang_Float() || | |
611 m->holder()->name() == ciSymbol::java_lang_Double()) { | |
612 if (!InlineMathNatives) return NULL; | |
613 } | |
614 | |
615 // -XX:-InlineUnsafeOps disables natives from the Unsafe class. | |
616 if (m->holder()->name() == ciSymbol::sun_misc_Unsafe()) { | |
617 if (!InlineUnsafeOps) return NULL; | |
618 } | |
619 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
620 return new LibraryIntrinsic(m, is_virtual, predicates, does_virtual_dispatch, (vmIntrinsics::ID) id); |
0 | 621 } |
622 | |
623 //----------------------register_library_intrinsics----------------------- | |
624 // Initialize this file's data structures, for each Compile instance. | |
625 void Compile::register_library_intrinsics() { | |
626 // Nothing to do here. | |
627 } | |
628 | |
20327
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
20313
diff
changeset
|
629 JVMState* LibraryIntrinsic::generate(JVMState* jvms) { |
0 | 630 LibraryCallKit kit(jvms, this); |
631 Compile* C = kit.C; | |
632 int nodes = C->unique(); | |
633 #ifndef PRODUCT | |
12295 | 634 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
0 | 635 char buf[1000]; |
636 const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf)); | |
637 tty->print_cr("Intrinsic %s", str); | |
638 } | |
639 #endif | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
640 ciMethod* callee = kit.callee(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
641 const int bci = kit.bci(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
642 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
643 // Try to inline the intrinsic. |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
644 if (kit.try_to_inline(_last_predicate)) { |
12295 | 645 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
|
646 C->print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual)" : "(intrinsic)"); |
0 | 647 } |
648 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked); | |
649 if (C->log()) { | |
650 C->log()->elem("intrinsic id='%s'%s nodes='%d'", | |
651 vmIntrinsics::name_at(intrinsic_id()), | |
652 (is_virtual() ? " virtual='1'" : ""), | |
653 C->unique() - nodes); | |
654 } | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
655 // 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
|
656 kit.push_result(); |
0 | 657 return kit.transfer_exceptions_into_jvms(); |
658 } | |
659 | |
5927
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
660 // The intrinsic bailed out |
12295 | 661 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
|
662 if (jvms->has_method()) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
663 // Not a root compile. |
5927
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
664 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
|
665 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
|
666 } else { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
667 // Root compile |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
668 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
|
669 vmIntrinsics::name_at(intrinsic_id()), |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
670 (is_virtual() ? " (virtual)" : ""), bci); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
671 } |
0 | 672 } |
673 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed); | |
674 return NULL; | |
675 } | |
676 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
677 Node* LibraryIntrinsic::generate_predicate(JVMState* jvms, int predicate) { |
6894 | 678 LibraryCallKit kit(jvms, this); |
679 Compile* C = kit.C; | |
680 int nodes = C->unique(); | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
681 _last_predicate = predicate; |
6894 | 682 #ifndef PRODUCT |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
683 assert(is_predicated() && predicate < predicates_count(), "sanity"); |
12295 | 684 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
6894 | 685 char buf[1000]; |
686 const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf)); | |
687 tty->print_cr("Predicate for intrinsic %s", str); | |
688 } | |
689 #endif | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
690 ciMethod* callee = kit.callee(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
691 const int bci = kit.bci(); |
6894 | 692 |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
693 Node* slow_ctl = kit.try_to_predicate(predicate); |
6894 | 694 if (!kit.failing()) { |
12295 | 695 if (C->print_intrinsics() || C->print_inlining()) { |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
696 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
|
697 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
698 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked); |
6894 | 699 if (C->log()) { |
700 C->log()->elem("predicate_intrinsic id='%s'%s nodes='%d'", | |
701 vmIntrinsics::name_at(intrinsic_id()), | |
702 (is_virtual() ? " virtual='1'" : ""), | |
703 C->unique() - nodes); | |
704 } | |
705 return slow_ctl; // Could be NULL if the check folds. | |
706 } | |
707 | |
708 // The intrinsic bailed out | |
12295 | 709 if (C->print_intrinsics() || C->print_inlining()) { |
6894 | 710 if (jvms->has_method()) { |
711 // Not a root compile. | |
712 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
|
713 C->print_inlining(kit.callee(), jvms->depth() - 1, bci, msg); |
6894 | 714 } else { |
715 // Root compile | |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
716 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
|
717 vmIntrinsics::name_at(intrinsic_id()), |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
718 (is_virtual() ? " (virtual)" : ""), bci); |
6894 | 719 } |
720 } | |
721 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed); | |
722 return NULL; | |
723 } | |
724 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
725 bool LibraryCallKit::try_to_inline(int predicate) { |
0 | 726 // Handle symbolic names for otherwise undistinguished boolean switches: |
727 const bool is_store = true; | |
728 const bool is_native_ptr = true; | |
729 const bool is_static = true; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
730 const bool is_volatile = true; |
0 | 731 |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
732 if (!jvms()->has_method()) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
733 // Root JVMState has a null method. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
734 assert(map()->memory()->Opcode() == Op_Parm, ""); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
735 // Insert the memory aliasing node |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
736 set_all_memory(reset_memory()); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
737 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
738 assert(merged_memory(), ""); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
739 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
740 |
0 | 741 switch (intrinsic_id()) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
742 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
|
743 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
|
744 case vmIntrinsics::_getClass: return inline_native_getClass(); |
0 | 745 |
746 case vmIntrinsics::_dsin: | |
747 case vmIntrinsics::_dcos: | |
748 case vmIntrinsics::_dtan: | |
749 case vmIntrinsics::_dabs: | |
750 case vmIntrinsics::_datan2: | |
751 case vmIntrinsics::_dsqrt: | |
752 case vmIntrinsics::_dexp: | |
753 case vmIntrinsics::_dlog: | |
754 case vmIntrinsics::_dlog10: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
755 case vmIntrinsics::_dpow: return inline_math_native(intrinsic_id()); |
0 | 756 |
757 case vmIntrinsics::_min: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
758 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
|
759 |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
760 case vmIntrinsics::_addExactI: return inline_math_addExactI(false /* add */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
761 case vmIntrinsics::_addExactL: return inline_math_addExactL(false /* add */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
762 case vmIntrinsics::_decrementExactI: return inline_math_subtractExactI(true /* decrement */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
763 case vmIntrinsics::_decrementExactL: return inline_math_subtractExactL(true /* decrement */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
764 case vmIntrinsics::_incrementExactI: return inline_math_addExactI(true /* increment */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
765 case vmIntrinsics::_incrementExactL: return inline_math_addExactL(true /* increment */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
766 case vmIntrinsics::_multiplyExactI: return inline_math_multiplyExactI(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
767 case vmIntrinsics::_multiplyExactL: return inline_math_multiplyExactL(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
768 case vmIntrinsics::_negateExactI: return inline_math_negateExactI(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
769 case vmIntrinsics::_negateExactL: return inline_math_negateExactL(); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
770 case vmIntrinsics::_subtractExactI: return inline_math_subtractExactI(false /* subtract */); |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
771 case vmIntrinsics::_subtractExactL: return inline_math_subtractExactL(false /* subtract */); |
12323 | 772 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
773 case vmIntrinsics::_arraycopy: return inline_arraycopy(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
774 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
775 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
|
776 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
|
777 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
|
778 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
779 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
|
780 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
|
781 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
|
782 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
|
783 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
|
784 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
|
785 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
|
786 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
|
787 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
|
788 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
789 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
|
790 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
|
791 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
|
792 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
|
793 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
|
794 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
|
795 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
|
796 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
|
797 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
|
798 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
799 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
|
800 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
|
801 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
|
802 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
|
803 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
|
804 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
|
805 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
|
806 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
|
807 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
808 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
|
809 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
|
810 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
|
811 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
|
812 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
|
813 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
|
814 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
|
815 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
|
816 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
817 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
|
818 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
|
819 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
|
820 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
|
821 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
|
822 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
|
823 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
|
824 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
|
825 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
|
826 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
827 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
|
828 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
|
829 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
|
830 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
|
831 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
|
832 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
|
833 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
|
834 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
|
835 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
|
836 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
837 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
|
838 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
|
839 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
|
840 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
|
841 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
842 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
|
843 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
|
844 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
|
845 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
846 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
|
847 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
|
848 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
|
849 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
850 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
|
851 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
|
852 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
|
853 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
|
854 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
|
855 |
7425 | 856 case vmIntrinsics::_loadFence: |
857 case vmIntrinsics::_storeFence: | |
858 case vmIntrinsics::_fullFence: return inline_unsafe_fence(intrinsic_id()); | |
859 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
860 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
|
861 case vmIntrinsics::_isInterrupted: return inline_native_isInterrupted(); |
0 | 862 |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
863 #ifdef TRACE_HAVE_INTRINSICS |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
864 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
|
865 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
|
866 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
|
867 #endif |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
868 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
|
869 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
|
870 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
|
871 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
|
872 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
|
873 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
|
874 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
|
875 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
|
876 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
|
877 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
|
878 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
879 case vmIntrinsics::_isAssignableFrom: return inline_native_subtype_check(); |
0 | 880 |
881 case vmIntrinsics::_isInstance: | |
882 case vmIntrinsics::_getModifiers: | |
883 case vmIntrinsics::_isInterface: | |
884 case vmIntrinsics::_isArray: | |
885 case vmIntrinsics::_isPrimitive: | |
886 case vmIntrinsics::_getSuperclass: | |
887 case vmIntrinsics::_getComponentType: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
888 case vmIntrinsics::_getClassAccessFlags: return inline_native_Class_query(intrinsic_id()); |
0 | 889 |
890 case vmIntrinsics::_floatToRawIntBits: | |
891 case vmIntrinsics::_floatToIntBits: | |
892 case vmIntrinsics::_intBitsToFloat: | |
893 case vmIntrinsics::_doubleToRawLongBits: | |
894 case vmIntrinsics::_doubleToLongBits: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
895 case vmIntrinsics::_longBitsToDouble: return inline_fp_conversions(intrinsic_id()); |
0 | 896 |
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
897 case vmIntrinsics::_numberOfLeadingZeros_i: |
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
898 case vmIntrinsics::_numberOfLeadingZeros_l: |
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
899 case vmIntrinsics::_numberOfTrailingZeros_i: |
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
900 case vmIntrinsics::_numberOfTrailingZeros_l: |
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
901 case vmIntrinsics::_bitCount_i: |
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
902 case vmIntrinsics::_bitCount_l: |
0 | 903 case vmIntrinsics::_reverseBytes_i: |
904 case vmIntrinsics::_reverseBytes_l: | |
1396
d7f654633cfe
6946040: add intrinsic for short and char reverseBytes
never
parents:
1152
diff
changeset
|
905 case vmIntrinsics::_reverseBytes_s: |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
906 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
|
907 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
908 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
|
909 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
910 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
|
911 |
6894 | 912 case vmIntrinsics::_aescrypt_encryptBlock: |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
913 case vmIntrinsics::_aescrypt_decryptBlock: return inline_aescrypt_Block(intrinsic_id()); |
6894 | 914 |
915 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
916 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
917 return inline_cipherBlockChaining_AESCrypt(intrinsic_id()); | |
918 | |
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
919 case vmIntrinsics::_sha_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
920 case vmIntrinsics::_sha2_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
921 case vmIntrinsics::_sha5_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
922 return inline_sha_implCompress(intrinsic_id()); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
923 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
924 case vmIntrinsics::_digestBase_implCompressMB: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
925 return inline_digestBase_implCompressMB(predicate); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
926 |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
927 case vmIntrinsics::_multiplyToLen: |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
928 return inline_multiplyToLen(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
929 |
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
930 case vmIntrinsics::_encodeISOArray: |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
931 return inline_encodeISOArray(); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
932 |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
933 case vmIntrinsics::_updateCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
934 return inline_updateCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
935 case vmIntrinsics::_updateBytesCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
936 return inline_updateBytesCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
937 case vmIntrinsics::_updateByteBufferCRC32: |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
938 return inline_updateByteBufferCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
939 |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
940 case vmIntrinsics::_profileBoolean: |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
941 return inline_profileBoolean(); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
942 |
0 | 943 default: |
944 // If you get here, it may be that someone has added a new intrinsic | |
945 // to the list in vmSymbols.hpp without implementing it here. | |
946 #ifndef PRODUCT | |
947 if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) { | |
948 tty->print_cr("*** Warning: Unimplemented intrinsic %s(%d)", | |
949 vmIntrinsics::name_at(intrinsic_id()), intrinsic_id()); | |
950 } | |
951 #endif | |
952 return false; | |
953 } | |
954 } | |
955 | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
956 Node* LibraryCallKit::try_to_predicate(int predicate) { |
6894 | 957 if (!jvms()->has_method()) { |
958 // Root JVMState has a null method. | |
959 assert(map()->memory()->Opcode() == Op_Parm, ""); | |
960 // Insert the memory aliasing node | |
961 set_all_memory(reset_memory()); | |
962 } | |
963 assert(merged_memory(), ""); | |
964 | |
965 switch (intrinsic_id()) { | |
966 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
967 return inline_cipherBlockChaining_AESCrypt_predicate(false); | |
968 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
969 return inline_cipherBlockChaining_AESCrypt_predicate(true); | |
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
970 case vmIntrinsics::_digestBase_implCompressMB: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
971 return inline_digestBase_implCompressMB_predicate(predicate); |
6894 | 972 |
973 default: | |
974 // If you get here, it may be that someone has added a new intrinsic | |
975 // to the list in vmSymbols.hpp without implementing it here. | |
976 #ifndef PRODUCT | |
977 if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) { | |
978 tty->print_cr("*** Warning: Unimplemented predicate for intrinsic %s(%d)", | |
979 vmIntrinsics::name_at(intrinsic_id()), intrinsic_id()); | |
980 } | |
981 #endif | |
982 Node* slow_ctl = control(); | |
983 set_control(top()); // No fast path instrinsic | |
984 return slow_ctl; | |
985 } | |
986 } | |
987 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
988 //------------------------------set_result------------------------------- |
0 | 989 // Helper function for finishing intrinsics. |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
990 void LibraryCallKit::set_result(RegionNode* region, PhiNode* value) { |
0 | 991 record_for_igvn(region); |
992 set_control(_gvn.transform(region)); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
993 set_result( _gvn.transform(value)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
994 assert(value->type()->basic_type() == result()->bottom_type()->basic_type(), "sanity"); |
0 | 995 } |
996 | |
997 //------------------------------generate_guard--------------------------- | |
998 // Helper function for generating guarded fast-slow graph structures. | |
999 // The given 'test', if true, guards a slow path. If the test fails | |
1000 // then a fast path can be taken. (We generally hope it fails.) | |
1001 // In all cases, GraphKit::control() is updated to the fast path. | |
1002 // The returned value represents the control for the slow path. | |
1003 // The return value is never 'top'; it is either a valid control | |
1004 // or NULL if it is obvious that the slow path can never be taken. | |
1005 // Also, if region and the slow control are not NULL, the slow edge | |
1006 // is appended to the region. | |
1007 Node* LibraryCallKit::generate_guard(Node* test, RegionNode* region, float true_prob) { | |
1008 if (stopped()) { | |
1009 // Already short circuited. | |
1010 return NULL; | |
1011 } | |
1012 | |
1013 // Build an if node and its projections. | |
1014 // If test is true we take the slow path, which we assume is uncommon. | |
1015 if (_gvn.type(test) == TypeInt::ZERO) { | |
1016 // The slow branch is never taken. No need to build this guard. | |
1017 return NULL; | |
1018 } | |
1019 | |
1020 IfNode* iff = create_and_map_if(control(), test, true_prob, COUNT_UNKNOWN); | |
1021 | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1022 Node* if_slow = _gvn.transform(new (C) IfTrueNode(iff)); |
0 | 1023 if (if_slow == top()) { |
1024 // The slow branch is never taken. No need to build this guard. | |
1025 return NULL; | |
1026 } | |
1027 | |
1028 if (region != NULL) | |
1029 region->add_req(if_slow); | |
1030 | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1031 Node* if_fast = _gvn.transform(new (C) IfFalseNode(iff)); |
0 | 1032 set_control(if_fast); |
1033 | |
1034 return if_slow; | |
1035 } | |
1036 | |
1037 inline Node* LibraryCallKit::generate_slow_guard(Node* test, RegionNode* region) { | |
1038 return generate_guard(test, region, PROB_UNLIKELY_MAG(3)); | |
1039 } | |
1040 inline Node* LibraryCallKit::generate_fair_guard(Node* test, RegionNode* region) { | |
1041 return generate_guard(test, region, PROB_FAIR); | |
1042 } | |
1043 | |
1044 inline Node* LibraryCallKit::generate_negative_guard(Node* index, RegionNode* region, | |
1045 Node* *pos_index) { | |
1046 if (stopped()) | |
1047 return NULL; // already stopped | |
1048 if (_gvn.type(index)->higher_equal(TypeInt::POS)) // [0,maxint] | |
1049 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
|
1050 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
|
1051 Node* bol_lt = _gvn.transform(new (C) BoolNode(cmp_lt, BoolTest::lt)); |
0 | 1052 Node* is_neg = generate_guard(bol_lt, region, PROB_MIN); |
1053 if (is_neg != NULL && pos_index != NULL) { | |
1054 // 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
|
1055 Node* ccast = new (C) CastIINode(index, TypeInt::POS); |
0 | 1056 ccast->set_req(0, control()); |
1057 (*pos_index) = _gvn.transform(ccast); | |
1058 } | |
1059 return is_neg; | |
1060 } | |
1061 | |
1062 inline Node* LibraryCallKit::generate_nonpositive_guard(Node* index, bool never_negative, | |
1063 Node* *pos_index) { | |
1064 if (stopped()) | |
1065 return NULL; // already stopped | |
1066 if (_gvn.type(index)->higher_equal(TypeInt::POS1)) // [1,maxint] | |
1067 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
|
1068 Node* cmp_le = _gvn.transform(new (C) CmpINode(index, intcon(0))); |
0 | 1069 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
|
1070 Node* bol_le = _gvn.transform(new (C) BoolNode(cmp_le, le_or_eq)); |
0 | 1071 Node* is_notp = generate_guard(bol_le, NULL, PROB_MIN); |
1072 if (is_notp != NULL && pos_index != NULL) { | |
1073 // 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
|
1074 Node* ccast = new (C) CastIINode(index, TypeInt::POS1); |
0 | 1075 ccast->set_req(0, control()); |
1076 (*pos_index) = _gvn.transform(ccast); | |
1077 } | |
1078 return is_notp; | |
1079 } | |
1080 | |
1081 // Make sure that 'position' is a valid limit index, in [0..length]. | |
1082 // There are two equivalent plans for checking this: | |
1083 // A. (offset + copyLength) unsigned<= arrayLength | |
1084 // B. offset <= (arrayLength - copyLength) | |
1085 // We require that all of the values above, except for the sum and | |
1086 // difference, are already known to be non-negative. | |
1087 // Plan A is robust in the face of overflow, if offset and copyLength | |
1088 // are both hugely positive. | |
1089 // | |
1090 // Plan B is less direct and intuitive, but it does not overflow at | |
1091 // all, since the difference of two non-negatives is always | |
1092 // representable. Whenever Java methods must perform the equivalent | |
1093 // check they generally use Plan B instead of Plan A. | |
1094 // For the moment we use Plan A. | |
1095 inline Node* LibraryCallKit::generate_limit_guard(Node* offset, | |
1096 Node* subseq_length, | |
1097 Node* array_length, | |
1098 RegionNode* region) { | |
1099 if (stopped()) | |
1100 return NULL; // already stopped | |
1101 bool zero_offset = _gvn.type(offset) == TypeInt::ZERO; | |
4778 | 1102 if (zero_offset && subseq_length->eqv_uncast(array_length)) |
0 | 1103 return NULL; // common case of whole-array copy |
1104 Node* last = subseq_length; | |
1105 if (!zero_offset) // last += offset | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1106 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
|
1107 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
|
1108 Node* bol_lt = _gvn.transform(new (C) BoolNode(cmp_lt, BoolTest::lt)); |
0 | 1109 Node* is_over = generate_guard(bol_lt, region, PROB_MIN); |
1110 return is_over; | |
1111 } | |
1112 | |
1113 | |
1114 //--------------------------generate_current_thread-------------------- | |
1115 Node* LibraryCallKit::generate_current_thread(Node* &tls_output) { | |
1116 ciKlass* thread_klass = env()->Thread_klass(); | |
1117 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
|
1118 Node* thread = _gvn.transform(new (C) ThreadLocalNode()); |
0 | 1119 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
|
1120 Node* threadObj = make_load(NULL, p, thread_type, T_OBJECT, MemNode::unordered); |
0 | 1121 tls_output = thread; |
1122 return threadObj; | |
1123 } | |
1124 | |
1125 | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1126 //------------------------------make_string_method_node------------------------ |
6057 | 1127 // Helper method for String intrinsic functions. This version is called |
1128 // with str1 and str2 pointing to String object nodes. | |
1129 // | |
1130 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
|
1131 Node* no_ctrl = NULL; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1132 |
6057 | 1133 // Get start addr of string |
1134 Node* str1_value = load_String_value(no_ctrl, str1); | |
1135 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
|
1136 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
|
1137 |
6057 | 1138 // Get length of string 1 |
1139 Node* str1_len = load_String_length(no_ctrl, str1); | |
1140 | |
1141 Node* str2_value = load_String_value(no_ctrl, str2); | |
1142 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
|
1143 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
|
1144 |
6057 | 1145 Node* str2_len = NULL; |
1146 Node* result = NULL; | |
1147 | |
1148 switch (opcode) { | |
1149 case Op_StrIndexOf: | |
1150 // Get length of string 2 | |
1151 str2_len = load_String_length(no_ctrl, str2); | |
1152 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1153 result = new (C) StrIndexOfNode(control(), memory(TypeAryPtr::CHARS), |
6057 | 1154 str1_start, str1_len, str2_start, str2_len); |
1155 break; | |
1156 case Op_StrComp: | |
1157 // Get length of string 2 | |
1158 str2_len = load_String_length(no_ctrl, str2); | |
1159 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1160 result = new (C) StrCompNode(control(), memory(TypeAryPtr::CHARS), |
6057 | 1161 str1_start, str1_len, str2_start, str2_len); |
1162 break; | |
1163 case Op_StrEquals: | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1164 result = new (C) StrEqualsNode(control(), memory(TypeAryPtr::CHARS), |
6057 | 1165 str1_start, str2_start, str1_len); |
1166 break; | |
1167 default: | |
1168 ShouldNotReachHere(); | |
1169 return NULL; | |
1170 } | |
1171 | |
1172 // All these intrinsics have checks. | |
1173 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
1174 | |
1175 return _gvn.transform(result); | |
1176 } | |
1177 | |
1178 // Helper method for String intrinsic functions. This version is called | |
1179 // with str1 and str2 pointing to char[] nodes, with cnt1 and cnt2 pointing | |
1180 // to Int nodes containing the lenghts of str1 and str2. | |
1181 // | |
1182 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
|
1183 Node* result = NULL; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1184 switch (opcode) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1185 case Op_StrIndexOf: |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1186 result = new (C) StrIndexOfNode(control(), memory(TypeAryPtr::CHARS), |
6057 | 1187 str1_start, cnt1, str2_start, cnt2); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1188 break; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1189 case Op_StrComp: |
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, cnt1, str2_start, cnt2); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1192 break; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
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, cnt1); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1196 break; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1197 default: |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1198 ShouldNotReachHere(); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1199 return NULL; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1200 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1201 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1202 // All these intrinsics have checks. |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1203 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
|
1204 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1205 return _gvn.transform(result); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1206 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1207 |
0 | 1208 //------------------------------inline_string_compareTo------------------------ |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1209 // public int java.lang.String.compareTo(String anotherString); |
0 | 1210 bool LibraryCallKit::inline_string_compareTo() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1211 Node* receiver = null_check(argument(0)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1212 Node* arg = null_check(argument(1)); |
0 | 1213 if (stopped()) { |
1214 return true; | |
1215 } | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1216 set_result(make_string_method_node(Op_StrComp, receiver, arg)); |
0 | 1217 return true; |
1218 } | |
1219 | |
681 | 1220 //------------------------------inline_string_equals------------------------ |
1221 bool LibraryCallKit::inline_string_equals() { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1222 Node* receiver = null_check_receiver(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1223 // 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
|
1224 // allows to specify NULL as argument. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1225 Node* argument = this->argument(1); |
681 | 1226 if (stopped()) { |
1227 return true; | |
1228 } | |
1229 | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1230 // paths (plus control) merge |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1231 RegionNode* region = new (C) RegionNode(5); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1232 Node* phi = new (C) PhiNode(region, TypeInt::BOOL); |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1233 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1234 // does source == target string? |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1235 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
|
1236 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
|
1237 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1238 Node* if_eq = generate_slow_guard(bol, NULL); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1239 if (if_eq != NULL) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1240 // receiver == argument |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1241 phi->init_req(2, intcon(1)); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1242 region->init_req(2, if_eq); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1243 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1244 |
681 | 1245 // get String klass for instanceOf |
1246 ciInstanceKlass* klass = env()->String_klass(); | |
1247 | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1248 if (!stopped()) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1249 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
|
1250 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
|
1251 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
|
1252 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1253 Node* inst_false = generate_guard(bol, NULL, PROB_MIN); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1254 //instanceOf == true, fallthrough |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1255 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1256 if (inst_false != NULL) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1257 phi->init_req(3, intcon(0)); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1258 region->init_req(3, inst_false); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1259 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1260 } |
681 | 1261 |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1262 if (!stopped()) { |
6057 | 1263 const TypeOopPtr* string_type = TypeOopPtr::make_from_klass(klass); |
1264 | |
1496
e8e83be27dd7
6951190: assert(!klass_is_exact(),"only non-exact klass") while building JDK
never
parents:
1396
diff
changeset
|
1265 // 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
|
1266 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
|
1267 // 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
|
1268 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
|
1269 |
6057 | 1270 Node* no_ctrl = NULL; |
1271 | |
1272 // Get start addr of receiver | |
1273 Node* receiver_val = load_String_value(no_ctrl, receiver); | |
1274 Node* receiver_offset = load_String_offset(no_ctrl, receiver); | |
1275 Node* receiver_start = array_element_address(receiver_val, receiver_offset, T_CHAR); | |
1276 | |
1277 // Get length of receiver | |
1278 Node* receiver_cnt = load_String_length(no_ctrl, receiver); | |
1279 | |
1280 // Get start addr of argument | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1281 Node* argument_val = load_String_value(no_ctrl, argument); |
6057 | 1282 Node* argument_offset = load_String_offset(no_ctrl, argument); |
1283 Node* argument_start = array_element_address(argument_val, argument_offset, T_CHAR); | |
1284 | |
1285 // Get length of argument | |
1286 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
|
1287 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1288 // Check for receiver count != argument count |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1289 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
|
1290 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
|
1291 Node* if_ne = generate_slow_guard(bol, NULL); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1292 if (if_ne != NULL) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1293 phi->init_req(4, intcon(0)); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1294 region->init_req(4, if_ne); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1295 } |
6057 | 1296 |
1297 // Check for count == 0 is done by assembler code for StrEquals. | |
1298 | |
1299 if (!stopped()) { | |
1300 Node* equals = make_string_method_node(Op_StrEquals, receiver_start, receiver_cnt, argument_start, argument_cnt); | |
1301 phi->init_req(1, equals); | |
1302 region->init_req(1, control()); | |
1303 } | |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1304 } |
681 | 1305 |
1306 // post merge | |
1307 set_control(_gvn.transform(region)); | |
1308 record_for_igvn(region); | |
1309 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1310 set_result(_gvn.transform(phi)); |
681 | 1311 return true; |
1312 } | |
1313 | |
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1314 //------------------------------inline_array_equals---------------------------- |
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1315 bool LibraryCallKit::inline_array_equals() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1316 Node* arg1 = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1317 Node* arg2 = argument(1); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1318 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
|
1319 return true; |
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1320 } |
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1321 |
0 | 1322 // Java version of String.indexOf(constant string) |
1323 // class StringDecl { | |
1324 // StringDecl(char[] ca) { | |
1325 // offset = 0; | |
1326 // count = ca.length; | |
1327 // value = ca; | |
1328 // } | |
1329 // int offset; | |
1330 // int count; | |
1331 // char[] value; | |
1332 // } | |
1333 // | |
1334 // static int string_indexOf_J(StringDecl string_object, char[] target_object, | |
1335 // int targetOffset, int cache_i, int md2) { | |
1336 // int cache = cache_i; | |
1337 // int sourceOffset = string_object.offset; | |
1338 // int sourceCount = string_object.count; | |
1339 // int targetCount = target_object.length; | |
1340 // | |
1341 // int targetCountLess1 = targetCount - 1; | |
1342 // int sourceEnd = sourceOffset + sourceCount - targetCountLess1; | |
1343 // | |
1344 // char[] source = string_object.value; | |
1345 // char[] target = target_object; | |
1346 // int lastChar = target[targetCountLess1]; | |
1347 // | |
1348 // outer_loop: | |
1349 // for (int i = sourceOffset; i < sourceEnd; ) { | |
1350 // int src = source[i + targetCountLess1]; | |
1351 // if (src == lastChar) { | |
1352 // // With random strings and a 4-character alphabet, | |
1353 // // reverse matching at this point sets up 0.8% fewer | |
1354 // // frames, but (paradoxically) makes 0.3% more probes. | |
1355 // // Since those probes are nearer the lastChar probe, | |
1356 // // there is may be a net D$ win with reverse matching. | |
1357 // // But, reversing loop inhibits unroll of inner loop | |
1358 // // for unknown reason. So, does running outer loop from | |
1359 // // (sourceOffset - targetCountLess1) to (sourceOffset + sourceCount) | |
1360 // for (int j = 0; j < targetCountLess1; j++) { | |
1361 // if (target[targetOffset + j] != source[i+j]) { | |
1362 // if ((cache & (1 << source[i+j])) == 0) { | |
1363 // if (md2 < j+1) { | |
1364 // i += j+1; | |
1365 // continue outer_loop; | |
1366 // } | |
1367 // } | |
1368 // i += md2; | |
1369 // continue outer_loop; | |
1370 // } | |
1371 // } | |
1372 // return i - sourceOffset; | |
1373 // } | |
1374 // if ((cache & (1 << src)) == 0) { | |
1375 // i += targetCountLess1; | |
1376 // } // using "i += targetCount;" and an "else i++;" causes a jump to jump. | |
1377 // i++; | |
1378 // } | |
1379 // return -1; | |
1380 // } | |
1381 | |
1382 //------------------------------string_indexOf------------------------ | |
1383 Node* LibraryCallKit::string_indexOf(Node* string_object, ciTypeArray* target_array, jint targetOffset_i, | |
1384 jint cache_i, jint md2_i) { | |
1385 | |
1386 Node* no_ctrl = NULL; | |
1387 float likely = PROB_LIKELY(0.9); | |
1388 float unlikely = PROB_UNLIKELY(0.9); | |
1389 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1390 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
|
1391 |
6057 | 1392 Node* source = load_String_value(no_ctrl, string_object); |
1393 Node* sourceOffset = load_String_offset(no_ctrl, string_object); | |
1394 Node* sourceCount = load_String_length(no_ctrl, string_object); | |
0 | 1395 |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1396 Node* target = _gvn.transform( makecon(TypeOopPtr::make_from_constant(target_array, true))); |
0 | 1397 jint target_length = target_array->length(); |
1398 const TypeAry* target_array_type = TypeAry::make(TypeInt::CHAR, TypeInt::make(0, target_length, Type::WidenMin)); | |
1399 const TypeAryPtr* target_type = TypeAryPtr::make(TypePtr::BotPTR, target_array_type, target_array->klass(), true, Type::OffsetBot); | |
1400 | |
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12169
diff
changeset
|
1401 // String.value field is known to be @Stable. |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12169
diff
changeset
|
1402 if (UseImplicitStableValues) { |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12169
diff
changeset
|
1403 target = cast_array_to_stable(target, target_type); |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12169
diff
changeset
|
1404 } |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12169
diff
changeset
|
1405 |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
1406 IdealKit kit(this, false, true); |
0 | 1407 #define __ kit. |
1408 Node* zero = __ ConI(0); | |
1409 Node* one = __ ConI(1); | |
1410 Node* cache = __ ConI(cache_i); | |
1411 Node* md2 = __ ConI(md2_i); | |
1412 Node* lastChar = __ ConI(target_array->char_at(target_length - 1)); | |
1413 Node* targetCount = __ ConI(target_length); | |
1414 Node* targetCountLess1 = __ ConI(target_length - 1); | |
1415 Node* targetOffset = __ ConI(targetOffset_i); | |
1416 Node* sourceEnd = __ SubI(__ AddI(sourceOffset, sourceCount), targetCountLess1); | |
1417 | |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1418 IdealVariable rtn(kit), i(kit), j(kit); __ declarations_done(); |
0 | 1419 Node* outer_loop = __ make_label(2 /* goto */); |
1420 Node* return_ = __ make_label(1); | |
1421 | |
1422 __ set(rtn,__ ConI(-1)); | |
2383
9dc311b8473e
7008866: Missing loop predicate for loop with multiple entries
kvn
parents:
2324
diff
changeset
|
1423 __ loop(this, nargs, i, sourceOffset, BoolTest::lt, sourceEnd); { |
0 | 1424 Node* i2 = __ AddI(__ value(i), targetCountLess1); |
1425 // pin to prohibit loading of "next iteration" value which may SEGV (rare) | |
1426 Node* src = load_array_element(__ ctrl(), source, i2, TypeAryPtr::CHARS); | |
1427 __ if_then(src, BoolTest::eq, lastChar, unlikely); { | |
2383
9dc311b8473e
7008866: Missing loop predicate for loop with multiple entries
kvn
parents:
2324
diff
changeset
|
1428 __ loop(this, nargs, j, zero, BoolTest::lt, targetCountLess1); { |
0 | 1429 Node* tpj = __ AddI(targetOffset, __ value(j)); |
1430 Node* targ = load_array_element(no_ctrl, target, tpj, target_type); | |
1431 Node* ipj = __ AddI(__ value(i), __ value(j)); | |
1432 Node* src2 = load_array_element(no_ctrl, source, ipj, TypeAryPtr::CHARS); | |
1433 __ if_then(targ, BoolTest::ne, src2); { | |
1434 __ if_then(__ AndI(cache, __ LShiftI(one, src2)), BoolTest::eq, zero); { | |
1435 __ if_then(md2, BoolTest::lt, __ AddI(__ value(j), one)); { | |
1436 __ increment(i, __ AddI(__ value(j), one)); | |
1437 __ goto_(outer_loop); | |
1438 } __ end_if(); __ dead(j); | |
1439 }__ end_if(); __ dead(j); | |
1440 __ increment(i, md2); | |
1441 __ goto_(outer_loop); | |
1442 }__ end_if(); | |
1443 __ increment(j, one); | |
1444 }__ end_loop(); __ dead(j); | |
1445 __ set(rtn, __ SubI(__ value(i), sourceOffset)); __ dead(i); | |
1446 __ goto_(return_); | |
1447 }__ end_if(); | |
1448 __ if_then(__ AndI(cache, __ LShiftI(one, src)), BoolTest::eq, zero, likely); { | |
1449 __ increment(i, targetCountLess1); | |
1450 }__ end_if(); | |
1451 __ increment(i, one); | |
1452 __ bind(outer_loop); | |
1453 }__ end_loop(); __ dead(i); | |
1454 __ bind(return_); | |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1455 |
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1456 // Final sync IdealKit and GraphKit. |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
1457 final_sync(kit); |
0 | 1458 Node* result = __ value(rtn); |
1459 #undef __ | |
1460 C->set_has_loops(true); | |
1461 return result; | |
1462 } | |
1463 | |
1464 //------------------------------inline_string_indexOf------------------------ | |
1465 bool LibraryCallKit::inline_string_indexOf() { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1466 Node* receiver = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1467 Node* arg = argument(1); |
681 | 1468 |
1469 Node* result; | |
1504
ae8f909e5fc7
6948602: Disable use of SSE4.2 in String.indexOf intrinsic until 6942326 is fixed
iveresov
parents:
1396
diff
changeset
|
1470 // 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
|
1471 // 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
|
1472 if (Matcher::has_match_rule(Op_StrIndexOf) && |
681 | 1473 UseSSE42Intrinsics) { |
1474 // Generate SSE4.2 version of indexOf | |
1475 // We currently only have match rules that use SSE4.2 | |
1476 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1477 receiver = null_check(receiver); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1478 arg = null_check(arg); |
681 | 1479 if (stopped()) { |
1480 return true; | |
1481 } | |
1482 | |
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1483 ciInstanceKlass* str_klass = env()->String_klass(); |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1484 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
|
1485 |
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1486 // Make the merge point |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1487 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
|
1488 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
|
1489 Node* no_ctrl = NULL; |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1490 |
6057 | 1491 // Get start addr of source string |
1492 Node* source = load_String_value(no_ctrl, receiver); | |
1493 Node* source_offset = load_String_offset(no_ctrl, receiver); | |
1494 Node* source_start = array_element_address(source, source_offset, T_CHAR); | |
1495 | |
1496 // Get length of source string | |
1497 Node* source_cnt = load_String_length(no_ctrl, receiver); | |
1498 | |
1499 // Get start addr of substring | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1500 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
|
1501 Node* substr_offset = load_String_offset(no_ctrl, arg); |
6057 | 1502 Node* substr_start = array_element_address(substr, substr_offset, T_CHAR); |
1503 | |
1504 // Get length of source string | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1505 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
|
1506 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1507 // Check for substr count > string count |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1508 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
|
1509 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
|
1510 Node* if_gt = generate_slow_guard(bol, NULL); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1511 if (if_gt != NULL) { |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1512 result_phi->init_req(2, intcon(-1)); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1513 result_rgn->init_req(2, if_gt); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1514 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1515 |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1516 if (!stopped()) { |
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1517 // Check for substr count == 0 |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1518 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
|
1519 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
|
1520 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
|
1521 if (if_zero != NULL) { |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1522 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
|
1523 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
|
1524 } |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1525 } |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1526 |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1527 if (!stopped()) { |
6057 | 1528 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
|
1529 result_phi->init_req(1, result); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1530 result_rgn->init_req(1, control()); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1531 } |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1532 set_control(_gvn.transform(result_rgn)); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1533 record_for_igvn(result_rgn); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1534 result = _gvn.transform(result_phi); |
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1535 |
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1536 } else { // Use LibraryCallKit::string_indexOf |
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1537 // 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
|
1538 if (!arg->is_Con()) { |
681 | 1539 return false; |
1540 } | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1541 const TypeOopPtr* str_type = _gvn.type(arg)->isa_oopptr(); |
681 | 1542 if (str_type == NULL) { |
1543 return false; | |
1544 } | |
1545 ciInstanceKlass* klass = env()->String_klass(); | |
1546 ciObject* str_const = str_type->const_oop(); | |
1547 if (str_const == NULL || str_const->klass() != klass) { | |
1548 return false; | |
1549 } | |
1550 ciInstance* str = str_const->as_instance(); | |
1551 assert(str != NULL, "must be instance"); | |
1552 | |
6057 | 1553 ciObject* v = str->field_value_by_offset(java_lang_String::value_offset_in_bytes()).as_object(); |
681 | 1554 ciTypeArray* pat = v->as_type_array(); // pattern (argument) character array |
1555 | |
6057 | 1556 int o; |
1557 int c; | |
1558 if (java_lang_String::has_offset_field()) { | |
1559 o = str->field_value_by_offset(java_lang_String::offset_offset_in_bytes()).as_int(); | |
1560 c = str->field_value_by_offset(java_lang_String::count_offset_in_bytes()).as_int(); | |
1561 } else { | |
1562 o = 0; | |
1563 c = pat->length(); | |
1564 } | |
1565 | |
681 | 1566 // constant strings have no offset and count == length which |
1567 // simplifies the resulting code somewhat so lets optimize for that. | |
1568 if (o != 0 || c != pat->length()) { | |
1569 return false; | |
1570 } | |
1571 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1572 receiver = null_check(receiver, T_OBJECT); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1573 // NOTE: No null check on the argument is needed since it's a constant String oop. |
681 | 1574 if (stopped()) { |
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1575 return true; |
681 | 1576 } |
1577 | |
1578 // The null string as a pattern always returns 0 (match at beginning of string) | |
1579 if (c == 0) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1580 set_result(intcon(0)); |
681 | 1581 return true; |
1582 } | |
1583 | |
1584 // Generate default indexOf | |
1585 jchar lastChar = pat->char_at(o + (c - 1)); | |
1586 int cache = 0; | |
1587 int i; | |
1588 for (i = 0; i < c - 1; i++) { | |
1589 assert(i < pat->length(), "out of range"); | |
1590 cache |= (1 << (pat->char_at(o + i) & (sizeof(cache) * BitsPerByte - 1))); | |
1591 } | |
1592 | |
1593 int md2 = c; | |
1594 for (i = 0; i < c - 1; i++) { | |
1595 assert(i < pat->length(), "out of range"); | |
1596 if (pat->char_at(o + i) == lastChar) { | |
1597 md2 = (c - 1) - i; | |
1598 } | |
1599 } | |
1600 | |
1601 result = string_indexOf(receiver, pat, o, cache, md2); | |
0 | 1602 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1603 set_result(result); |
0 | 1604 return true; |
1605 } | |
1606 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1607 //--------------------------round_double_node-------------------------------- |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1608 // Round a double node if necessary. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1609 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
|
1610 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
|
1611 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
|
1612 return n; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1613 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1614 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1615 //------------------------------inline_math----------------------------------- |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1616 // public static double Math.abs(double) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1617 // public static double Math.sqrt(double) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1618 // public static double Math.log(double) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1619 // public static double Math.log10(double) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1620 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
|
1621 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
|
1622 Node* n; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1623 switch (id) { |
8076
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1624 case vmIntrinsics::_dabs: n = new (C) AbsDNode( arg); break; |
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1625 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
|
1626 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
|
1627 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
|
1628 default: fatal_unexpected_iid(id); break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1629 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1630 set_result(_gvn.transform(n)); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1631 return true; |
0 | 1632 } |
1633 | |
1634 //------------------------------inline_trig---------------------------------- | |
1635 // Inline sin/cos/tan instructions, if possible. If rounding is required, do | |
1636 // argument reduction which will turn into a fast/slow diamond. | |
1637 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
|
1638 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
|
1639 Node* n = NULL; |
0 | 1640 |
1641 switch (id) { | |
8076
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1642 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
|
1643 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
|
1644 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
|
1645 default: fatal_unexpected_iid(id); break; |
0 | 1646 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1647 n = _gvn.transform(n); |
0 | 1648 |
1649 // 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
|
1650 if (Matcher::strict_fp_requires_explicit_rounding) { |
0 | 1651 static const double pi_4 = 0.7853981633974483; |
1652 static const double neg_pi_4 = -0.7853981633974483; | |
1653 // pi/2 in 80-bit extended precision | |
1654 // static const unsigned char pi_2_bits_x[] = {0x35,0xc2,0x68,0x21,0xa2,0xda,0x0f,0xc9,0xff,0x3f,0x00,0x00,0x00,0x00,0x00,0x00}; | |
1655 // -pi/2 in 80-bit extended precision | |
1656 // 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}; | |
1657 // Cutoff value for using this argument reduction technique | |
1658 //static const double pi_2_minus_epsilon = 1.564660403643354; | |
1659 //static const double neg_pi_2_plus_epsilon = -1.564660403643354; | |
1660 | |
1661 // Pseudocode for sin: | |
1662 // if (x <= Math.PI / 4.0) { | |
1663 // if (x >= -Math.PI / 4.0) return fsin(x); | |
1664 // if (x >= -Math.PI / 2.0) return -fcos(x + Math.PI / 2.0); | |
1665 // } else { | |
1666 // if (x <= Math.PI / 2.0) return fcos(x - Math.PI / 2.0); | |
1667 // } | |
1668 // return StrictMath.sin(x); | |
1669 | |
1670 // Pseudocode for cos: | |
1671 // if (x <= Math.PI / 4.0) { | |
1672 // if (x >= -Math.PI / 4.0) return fcos(x); | |
1673 // if (x >= -Math.PI / 2.0) return fsin(x + Math.PI / 2.0); | |
1674 // } else { | |
1675 // if (x <= Math.PI / 2.0) return -fsin(x - Math.PI / 2.0); | |
1676 // } | |
1677 // return StrictMath.cos(x); | |
1678 | |
1679 // Actually, sticking in an 80-bit Intel value into C2 will be tough; it | |
1680 // requires a special machine instruction to load it. Instead we'll try | |
1681 // the 'easy' case. If we really need the extra range +/- PI/2 we'll | |
1682 // probably do the math inside the SIN encoding. | |
1683 | |
1684 // Make the merge point | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1685 RegionNode* r = new (C) RegionNode(3); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1686 Node* phi = new (C) PhiNode(r, Type::DOUBLE); |
0 | 1687 |
1688 // 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
|
1689 Node *abs = _gvn.transform(new (C) AbsDNode(arg)); |
0 | 1690 // Node for PI/4 constant |
1691 Node *pi4 = makecon(TypeD::make(pi_4)); | |
1692 // Check PI/4 : abs(arg) | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1693 Node *cmp = _gvn.transform(new (C) CmpDNode(pi4,abs)); |
0 | 1694 // 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
|
1695 Node *bol = _gvn.transform(new (C) BoolNode( cmp, BoolTest::lt )); |
0 | 1696 // Branch either way |
1697 IfNode *iff = create_and_xform_if(control(),bol, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
1698 set_control(opt_iff(r,iff)); | |
1699 | |
1700 // Set fast path result | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1701 phi->init_req(2, n); |
0 | 1702 |
1703 // Slow path - non-blocking leaf call | |
1704 Node* call = NULL; | |
1705 switch (id) { | |
1706 case vmIntrinsics::_dsin: | |
1707 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(), | |
1708 CAST_FROM_FN_PTR(address, SharedRuntime::dsin), | |
1709 "Sin", NULL, arg, top()); | |
1710 break; | |
1711 case vmIntrinsics::_dcos: | |
1712 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(), | |
1713 CAST_FROM_FN_PTR(address, SharedRuntime::dcos), | |
1714 "Cos", NULL, arg, top()); | |
1715 break; | |
1716 case vmIntrinsics::_dtan: | |
1717 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(), | |
1718 CAST_FROM_FN_PTR(address, SharedRuntime::dtan), | |
1719 "Tan", NULL, arg, top()); | |
1720 break; | |
1721 } | |
1722 assert(control()->in(0) == call, ""); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1723 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
|
1724 r->init_req(1, control()); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1725 phi->init_req(1, slow_result); |
0 | 1726 |
1727 // Post-merge | |
1728 set_control(_gvn.transform(r)); | |
1729 record_for_igvn(r); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1730 n = _gvn.transform(phi); |
0 | 1731 |
1732 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
1733 } | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1734 set_result(n); |
0 | 1735 return true; |
1736 } | |
1737 | |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1738 Node* LibraryCallKit::finish_pow_exp(Node* result, Node* x, Node* y, const TypeFunc* call_type, address funcAddr, const char* funcName) { |
6205 | 1739 //------------------- |
1740 //result=(result.isNaN())? funcAddr():result; | |
1741 // Check: If isNaN() by checking result!=result? then either trap | |
1742 // or go to runtime | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1743 Node* cmpisnan = _gvn.transform(new (C) CmpDNode(result, result)); |
6205 | 1744 // Build the boolean node |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1745 Node* bolisnum = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::eq)); |
6205 | 1746 |
1747 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
|
1748 { BuildCutout unless(this, bolisnum, PROB_STATIC_FREQUENT); |
6205 | 1749 // The pow or exp intrinsic returned a NaN, which requires a call |
1750 // to the runtime. Recompile with the runtime call. | |
1751 uncommon_trap(Deoptimization::Reason_intrinsic, | |
1752 Deoptimization::Action_make_not_entrant); | |
1753 } | |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1754 return result; |
6205 | 1755 } else { |
1756 // If this inlining ever returned NaN in the past, we compile a call | |
1757 // to the runtime to properly handle corner cases | |
1758 | |
1759 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
|
1760 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
|
1761 Node* if_fast = _gvn.transform(new (C) IfTrueNode(iff)); |
6205 | 1762 |
1763 if (!if_slow->is_top()) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1764 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
|
1765 PhiNode* result_val = new (C) PhiNode(result_region, Type::DOUBLE); |
6205 | 1766 |
1767 result_region->init_req(1, if_fast); | |
1768 result_val->init_req(1, result); | |
1769 | |
1770 set_control(if_slow); | |
1771 | |
1772 const TypePtr* no_memory_effects = NULL; | |
1773 Node* rt = make_runtime_call(RC_LEAF, call_type, funcAddr, funcName, | |
1774 no_memory_effects, | |
1775 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
|
1776 Node* value = _gvn.transform(new (C) ProjNode(rt, TypeFunc::Parms+0)); |
6205 | 1777 #ifdef ASSERT |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1778 Node* value_top = _gvn.transform(new (C) ProjNode(rt, TypeFunc::Parms+1)); |
6205 | 1779 assert(value_top == top(), "second value must be top"); |
1780 #endif | |
1781 | |
1782 result_region->init_req(2, control()); | |
1783 result_val->init_req(2, value); | |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1784 set_control(_gvn.transform(result_region)); |
17923
a062c3691003
8042052: assert(t != NULL) failed: must set before get
anoll
parents:
17922
diff
changeset
|
1785 return _gvn.transform(result_val); |
6205 | 1786 } else { |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1787 return result; |
6205 | 1788 } |
1789 } | |
1790 } | |
1791 | |
0 | 1792 //------------------------------inline_exp------------------------------------- |
1793 // Inline exp instructions, if possible. The Intel hardware only misses | |
1794 // 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
|
1795 bool LibraryCallKit::inline_exp() { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1796 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
|
1797 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
|
1798 |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1799 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
|
1800 set_result(n); |
0 | 1801 |
1802 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
1803 return true; | |
1804 } | |
1805 | |
1806 //------------------------------inline_pow------------------------------------- | |
1807 // Inline power instructions, if possible. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1808 bool LibraryCallKit::inline_pow() { |
0 | 1809 // Pseudocode for pow |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1810 // if (y == 2) { |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1811 // return x * x; |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1812 // } else { |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1813 // if (x <= 0.0) { |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1814 // long longy = (long)y; |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1815 // if ((double)longy == y) { // if y is long |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1816 // if (y + 1 == y) longy = 0; // huge number: even |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1817 // 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
|
1818 // } else { |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1819 // result = NaN; |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1820 // } |
0 | 1821 // } else { |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1822 // result = DPow(x,y); |
0 | 1823 // } |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1824 // if (result != result)? { |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1825 // result = uncommon_trap() or runtime_call(); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1826 // } |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1827 // return result; |
0 | 1828 // } |
1829 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1830 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
|
1831 Node* y = round_double_node(argument(2)); |
0 | 1832 |
6205 | 1833 Node* result = NULL; |
1834 | |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1835 Node* const_two_node = makecon(TypeD::make(2.0)); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1836 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
|
1837 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
|
1838 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
|
1839 Node* if_true = _gvn.transform(new (C) IfTrueNode(if_node)); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1840 Node* if_false = _gvn.transform(new (C) IfFalseNode(if_node)); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1841 |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1842 RegionNode* region_node = new (C) RegionNode(3); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1843 region_node->init_req(1, if_true); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1844 |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1845 Node* phi_node = new (C) PhiNode(region_node, Type::DOUBLE); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1846 // 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
|
1847 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
|
1848 |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1849 // 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
|
1850 set_control(if_false); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1851 |
6205 | 1852 if (!too_many_traps(Deoptimization::Reason_intrinsic)) { |
1853 // 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
|
1854 result = _gvn.transform(new (C) PowDNode(C, control(), x, y)); |
0 | 1855 } else { |
6205 | 1856 // If this inlining ever returned NaN in the past, include all |
1857 // checks + call to the runtime. | |
0 | 1858 |
1859 // Set the merge point for If node with condition of (x <= 0.0) | |
1860 // 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
|
1861 RegionNode *r = new (C) RegionNode(4); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1862 Node *phi = new (C) PhiNode(r, Type::DOUBLE); |
0 | 1863 |
1864 // Build the first if node: if (x <= 0.0) | |
1865 // Node for 0 constant | |
1866 Node *zeronode = makecon(TypeD::ZERO); | |
1867 // Check x:0 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1868 Node *cmp = _gvn.transform(new (C) CmpDNode(x, zeronode)); |
0 | 1869 // 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
|
1870 Node *bol1 = _gvn.transform(new (C) BoolNode( cmp, BoolTest::le )); |
0 | 1871 // Branch either way |
1872 IfNode *if1 = create_and_xform_if(control(),bol1, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN); | |
1873 // 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
|
1874 Node *fast_taken = _gvn.transform(new (C) IfFalseNode(if1)); |
0 | 1875 r->init_req(3,fast_taken); // Capture fast-control |
1876 | |
1877 // 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
|
1878 Node *complex_path = _gvn.transform(new (C) IfTrueNode(if1)); |
0 | 1879 |
1880 // Set fast path result | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1881 Node *fast_result = _gvn.transform(new (C) PowDNode(C, control(), x, y)); |
0 | 1882 phi->init_req(3, fast_result); |
1883 | |
1884 // Complex path | |
6205 | 1885 // Build the second if node (if y is long) |
1886 // Node for (long)y | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1887 Node *longy = _gvn.transform(new (C) ConvD2LNode(y)); |
6205 | 1888 // Node for (double)((long) y) |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1889 Node *doublelongy= _gvn.transform(new (C) ConvL2DNode(longy)); |
6205 | 1890 // Check (double)((long) y) : y |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1891 Node *cmplongy= _gvn.transform(new (C) CmpDNode(doublelongy, y)); |
6205 | 1892 // Check if (y isn't long) then go to slow path |
1893 | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1894 Node *bol2 = _gvn.transform(new (C) BoolNode( cmplongy, BoolTest::ne )); |
605 | 1895 // Branch either way |
0 | 1896 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
|
1897 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
|
1898 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1899 Node *slow_path = _gvn.transform(new (C) IfTrueNode(if2)); |
6205 | 1900 |
1901 // Calculate DPow(abs(x), y)*(1 & (long)y) | |
0 | 1902 // Node for constant 1 |
6205 | 1903 Node *conone = longcon(1); |
1904 // 1& (long)y | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1905 Node *signnode= _gvn.transform(new (C) AndLNode(conone, longy)); |
6205 | 1906 |
1907 // A huge number is always even. Detect a huge number by checking | |
1908 // if y + 1 == y and set integer to be tested for parity to 0. | |
1909 // Required for corner case: | |
1910 // (long)9.223372036854776E18 = max_jlong | |
1911 // (double)(long)9.223372036854776E18 = 9.223372036854776E18 | |
1912 // 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
|
1913 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
|
1914 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
|
1915 Node *bolyplus1 = _gvn.transform(new (C) BoolNode( cmpyplus1, BoolTest::eq )); |
6205 | 1916 Node* correctedsign = NULL; |
1917 if (ConditionalMoveLimit != 0) { | |
1918 correctedsign = _gvn.transform( CMoveNode::make(C, NULL, bolyplus1, signnode, longcon(0), TypeLong::LONG)); | |
1919 } else { | |
1920 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
|
1921 RegionNode *r = new (C) RegionNode(3); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1922 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
|
1923 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
|
1924 r->init_req(2, _gvn.transform(new (C) IfTrueNode(ifyplus1))); |
6205 | 1925 phi->init_req(1, signnode); |
1926 phi->init_req(2, longcon(0)); | |
1927 correctedsign = _gvn.transform(phi); | |
1928 ylong_path = _gvn.transform(r); | |
1929 record_for_igvn(r); | |
1930 } | |
1931 | |
0 | 1932 // zero node |
6205 | 1933 Node *conzero = longcon(0); |
1934 // Check (1&(long)y)==0? | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1935 Node *cmpeq1 = _gvn.transform(new (C) CmpLNode(correctedsign, conzero)); |
6205 | 1936 // 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
|
1937 Node *bol3 = _gvn.transform(new (C) BoolNode( cmpeq1, BoolTest::ne )); |
0 | 1938 // abs(x) |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1939 Node *absx=_gvn.transform(new (C) AbsDNode(x)); |
0 | 1940 // abs(x)^y |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1941 Node *absxpowy = _gvn.transform(new (C) PowDNode(C, control(), absx, y)); |
0 | 1942 // -abs(x)^y |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1943 Node *negabsxpowy = _gvn.transform(new (C) NegDNode (absxpowy)); |
6205 | 1944 // (1&(long)y)==1?-DPow(abs(x), y):DPow(abs(x), y) |
1945 Node *signresult = NULL; | |
1946 if (ConditionalMoveLimit != 0) { | |
1947 signresult = _gvn.transform( CMoveNode::make(C, NULL, bol3, absxpowy, negabsxpowy, Type::DOUBLE)); | |
1948 } else { | |
1949 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
|
1950 RegionNode *r = new (C) RegionNode(3); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1951 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
|
1952 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
|
1953 r->init_req(2, _gvn.transform(new (C) IfTrueNode(ifyeven))); |
6205 | 1954 phi->init_req(1, absxpowy); |
1955 phi->init_req(2, negabsxpowy); | |
1956 signresult = _gvn.transform(phi); | |
1957 ylong_path = _gvn.transform(r); | |
1958 record_for_igvn(r); | |
1959 } | |
0 | 1960 // Set complex path fast result |
6205 | 1961 r->init_req(2, ylong_path); |
0 | 1962 phi->init_req(2, signresult); |
1963 | |
1964 static const jlong nan_bits = CONST64(0x7ff8000000000000); | |
1965 Node *slow_result = makecon(TypeD::make(*(double*)&nan_bits)); // return NaN | |
1966 r->init_req(1,slow_path); | |
1967 phi->init_req(1,slow_result); | |
1968 | |
1969 // Post merge | |
1970 set_control(_gvn.transform(r)); | |
1971 record_for_igvn(r); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1972 result = _gvn.transform(phi); |
0 | 1973 } |
1974 | |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1975 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
|
1976 |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1977 // 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
|
1978 region_node->set_req(2, control()); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1979 // 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
|
1980 phi_node->init_req(2, result); |
17922
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1981 set_control(_gvn.transform(region_node)); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1982 record_for_igvn(region_node); |
400709e275c1
8029302: Performance regression in Math.pow intrinsic
adlertz
parents:
17810
diff
changeset
|
1983 set_result(_gvn.transform(phi_node)); |
0 | 1984 |
1985 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
1986 return true; | |
1987 } | |
1988 | |
1989 //------------------------------runtime_math----------------------------- | |
1990 bool LibraryCallKit::runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName) { | |
1991 assert(call_type == OptoRuntime::Math_DD_D_Type() || call_type == OptoRuntime::Math_D_D_Type(), | |
1992 "must be (DD)D or (D)D type"); | |
1993 | |
1994 // Inputs | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1995 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
|
1996 Node* b = (call_type == OptoRuntime::Math_DD_D_Type()) ? round_double_node(argument(2)) : NULL; |
0 | 1997 |
1998 const TypePtr* no_memory_effects = NULL; | |
1999 Node* trig = make_runtime_call(RC_LEAF, call_type, funcAddr, funcName, | |
2000 no_memory_effects, | |
2001 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
|
2002 Node* value = _gvn.transform(new (C) ProjNode(trig, TypeFunc::Parms+0)); |
0 | 2003 #ifdef ASSERT |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2004 Node* value_top = _gvn.transform(new (C) ProjNode(trig, TypeFunc::Parms+1)); |
0 | 2005 assert(value_top == top(), "second value must be top"); |
2006 #endif | |
2007 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2008 set_result(value); |
0 | 2009 return true; |
2010 } | |
2011 | |
2012 //------------------------------inline_math_native----------------------------- | |
2013 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
|
2014 #define FN_PTR(f) CAST_FROM_FN_PTR(address, f) |
0 | 2015 switch (id) { |
2016 // 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
|
2017 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
|
2018 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
|
2019 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
|
2020 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
|
2021 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
|
2022 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
|
2023 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2024 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
|
2025 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
|
2026 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
|
2027 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dlog10), "LOG10"); |
0 | 2028 |
2029 // 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
|
2030 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
|
2031 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
|
2032 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2033 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
|
2034 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
|
2035 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
|
2036 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
|
2037 #undef FN_PTR |
0 | 2038 |
2039 // These intrinsics are not yet correctly implemented | |
2040 case vmIntrinsics::_datan2: | |
2041 return false; | |
2042 | |
2043 default: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2044 fatal_unexpected_iid(id); |
0 | 2045 return false; |
2046 } | |
2047 } | |
2048 | |
2049 static bool is_simple_name(Node* n) { | |
2050 return (n->req() == 1 // constant | |
2051 || (n->is_Type() && n->as_Type()->type()->singleton()) | |
2052 || n->is_Proj() // parameter or return value | |
2053 || n->is_Phi() // local of some sort | |
2054 ); | |
2055 } | |
2056 | |
2057 //----------------------------inline_min_max----------------------------------- | |
2058 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
|
2059 set_result(generate_min_max(id, argument(0), argument(1))); |
0 | 2060 return true; |
2061 } | |
2062 | |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2063 void LibraryCallKit::inline_math_mathExact(Node* math, Node *test) { |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2064 Node* bol = _gvn.transform( new (C) BoolNode(test, BoolTest::overflow) ); |
12323 | 2065 IfNode* check = create_and_map_if(control(), bol, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN); |
2066 Node* fast_path = _gvn.transform( new (C) IfFalseNode(check)); | |
2067 Node* slow_path = _gvn.transform( new (C) IfTrueNode(check) ); | |
2068 | |
2069 { | |
2070 PreserveJVMState pjvms(this); | |
2071 PreserveReexecuteState preexecs(this); | |
2072 jvms()->set_should_reexecute(true); | |
2073 | |
2074 set_control(slow_path); | |
2075 set_i_o(i_o()); | |
2076 | |
2077 uncommon_trap(Deoptimization::Reason_intrinsic, | |
2078 Deoptimization::Action_none); | |
2079 } | |
2080 | |
2081 set_control(fast_path); | |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2082 set_result(math); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2083 } |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2084 |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2085 template <typename OverflowOp> |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2086 bool LibraryCallKit::inline_math_overflow(Node* arg1, Node* arg2) { |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2087 typedef typename OverflowOp::MathOp MathOp; |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2088 |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2089 MathOp* mathOp = new(C) MathOp(arg1, arg2); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2090 Node* operation = _gvn.transform( mathOp ); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2091 Node* ofcheck = _gvn.transform( new(C) OverflowOp(arg1, arg2) ); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2092 inline_math_mathExact(operation, ofcheck); |
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2093 return true; |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2094 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2095 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2096 bool LibraryCallKit::inline_math_addExactI(bool is_increment) { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2097 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
|
2098 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2099 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2100 bool LibraryCallKit::inline_math_addExactL(bool is_increment) { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2101 return inline_math_overflow<OverflowAddLNode>(argument(0), is_increment ? longcon(1) : argument(2)); |
12323 | 2102 } |
2103 | |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2104 bool LibraryCallKit::inline_math_subtractExactI(bool is_decrement) { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2105 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
|
2106 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2107 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2108 bool LibraryCallKit::inline_math_subtractExactL(bool is_decrement) { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2109 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
|
2110 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2111 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2112 bool LibraryCallKit::inline_math_negateExactI() { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2113 return inline_math_overflow<OverflowSubINode>(intcon(0), argument(0)); |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2114 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2115 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2116 bool LibraryCallKit::inline_math_negateExactL() { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2117 return inline_math_overflow<OverflowSubLNode>(longcon(0), argument(0)); |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2118 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2119 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2120 bool LibraryCallKit::inline_math_multiplyExactI() { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2121 return inline_math_overflow<OverflowMulINode>(argument(0), argument(1)); |
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2122 } |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2123 |
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
2124 bool LibraryCallKit::inline_math_multiplyExactL() { |
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
17716
diff
changeset
|
2125 return inline_math_overflow<OverflowMulLNode>(argument(0), argument(2)); |
12323 | 2126 } |
2127 | |
0 | 2128 Node* |
2129 LibraryCallKit::generate_min_max(vmIntrinsics::ID id, Node* x0, Node* y0) { | |
2130 // These are the candidate return value: | |
2131 Node* xvalue = x0; | |
2132 Node* yvalue = y0; | |
2133 | |
2134 if (xvalue == yvalue) { | |
2135 return xvalue; | |
2136 } | |
2137 | |
2138 bool want_max = (id == vmIntrinsics::_max); | |
2139 | |
2140 const TypeInt* txvalue = _gvn.type(xvalue)->isa_int(); | |
2141 const TypeInt* tyvalue = _gvn.type(yvalue)->isa_int(); | |
2142 if (txvalue == NULL || tyvalue == NULL) return top(); | |
2143 // This is not really necessary, but it is consistent with a | |
2144 // hypothetical MaxINode::Value method: | |
2145 int widen = MAX2(txvalue->_widen, tyvalue->_widen); | |
2146 | |
2147 // %%% This folding logic should (ideally) be in a different place. | |
2148 // Some should be inside IfNode, and there to be a more reliable | |
2149 // transformation of ?: style patterns into cmoves. We also want | |
2150 // more powerful optimizations around cmove and min/max. | |
2151 | |
2152 // Try to find a dominating comparison of these guys. | |
2153 // It can simplify the index computation for Arrays.copyOf | |
2154 // and similar uses of System.arraycopy. | |
2155 // First, compute the normalized version of CmpI(x, y). | |
2156 int cmp_op = Op_CmpI; | |
2157 Node* xkey = xvalue; | |
2158 Node* ykey = yvalue; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
2159 Node* ideal_cmpxy = _gvn.transform(new(C) CmpINode(xkey, ykey)); |
0 | 2160 if (ideal_cmpxy->is_Cmp()) { |
2161 // E.g., if we have CmpI(length - offset, count), | |
2162 // it might idealize to CmpI(length, count + offset) | |
2163 cmp_op = ideal_cmpxy->Opcode(); | |
2164 xkey = ideal_cmpxy->in(1); | |
2165 ykey = ideal_cmpxy->in(2); | |
2166 } | |
2167 | |
2168 // Start by locating any relevant comparisons. | |
2169 Node* start_from = (xkey->outcnt() < ykey->outcnt()) ? xkey : ykey; | |
2170 Node* cmpxy = NULL; | |
2171 Node* cmpyx = NULL; | |
2172 for (DUIterator_Fast kmax, k = start_from->fast_outs(kmax); k < kmax; k++) { | |
2173 Node* cmp = start_from->fast_out(k); | |
2174 if (cmp->outcnt() > 0 && // must have prior uses | |
2175 cmp->in(0) == NULL && // must be context-independent | |
2176 cmp->Opcode() == cmp_op) { // right kind of compare | |
2177 if (cmp->in(1) == xkey && cmp->in(2) == ykey) cmpxy = cmp; | |
2178 if (cmp->in(1) == ykey && cmp->in(2) == xkey) cmpyx = cmp; | |
2179 } | |
2180 } | |
2181 | |
2182 const int NCMPS = 2; | |
2183 Node* cmps[NCMPS] = { cmpxy, cmpyx }; | |
2184 int cmpn; | |
2185 for (cmpn = 0; cmpn < NCMPS; cmpn++) { | |
2186 if (cmps[cmpn] != NULL) break; // find a result | |
2187 } | |
2188 if (cmpn < NCMPS) { | |
2189 // Look for a dominating test that tells us the min and max. | |
2190 int depth = 0; // Limit search depth for speed | |
2191 Node* dom = control(); | |
2192 for (; dom != NULL; dom = IfNode::up_one_dom(dom, true)) { | |
2193 if (++depth >= 100) break; | |
2194 Node* ifproj = dom; | |
2195 if (!ifproj->is_Proj()) continue; | |
2196 Node* iff = ifproj->in(0); | |
2197 if (!iff->is_If()) continue; | |
2198 Node* bol = iff->in(1); | |
2199 if (!bol->is_Bool()) continue; | |
2200 Node* cmp = bol->in(1); | |
2201 if (cmp == NULL) continue; | |
2202 for (cmpn = 0; cmpn < NCMPS; cmpn++) | |
2203 if (cmps[cmpn] == cmp) break; | |
2204 if (cmpn == NCMPS) continue; | |
2205 BoolTest::mask btest = bol->as_Bool()->_test._test; | |
2206 if (ifproj->is_IfFalse()) btest = BoolTest(btest).negate(); | |
2207 if (cmp->in(1) == ykey) btest = BoolTest(btest).commute(); | |
2208 // At this point, we know that 'x btest y' is true. | |
2209 switch (btest) { | |
2210 case BoolTest::eq: | |
2211 // They are proven equal, so we can collapse the min/max. | |
2212 // Either value is the answer. Choose the simpler. | |
2213 if (is_simple_name(yvalue) && !is_simple_name(xvalue)) | |
2214 return yvalue; | |
2215 return xvalue; | |
2216 case BoolTest::lt: // x < y | |
2217 case BoolTest::le: // x <= y | |
2218 return (want_max ? yvalue : xvalue); | |
2219 case BoolTest::gt: // x > y | |
2220 case BoolTest::ge: // x >= y | |
2221 return (want_max ? xvalue : yvalue); | |
2222 } | |
2223 } | |
2224 } | |
2225 | |
2226 // We failed to find a dominating test. | |
2227 // Let's pick a test that might GVN with prior tests. | |
2228 Node* best_bol = NULL; | |
2229 BoolTest::mask best_btest = BoolTest::illegal; | |
2230 for (cmpn = 0; cmpn < NCMPS; cmpn++) { | |
2231 Node* cmp = cmps[cmpn]; | |
2232 if (cmp == NULL) continue; | |
2233 for (DUIterator_Fast jmax, j = cmp->fast_outs(jmax); j < jmax; j++) { | |
2234 Node* bol = cmp->fast_out(j); | |
2235 if (!bol->is_Bool()) continue; | |
2236 BoolTest::mask btest = bol->as_Bool()->_test._test; | |
2237 if (btest == BoolTest::eq || btest == BoolTest::ne) continue; | |
2238 if (cmp->in(1) == ykey) btest = BoolTest(btest).commute(); | |
2239 if (bol->outcnt() > (best_bol == NULL ? 0 : best_bol->outcnt())) { | |
2240 best_bol = bol->as_Bool(); | |
2241 best_btest = btest; | |
2242 } | |
2243 } | |
2244 } | |
2245 | |
2246 Node* answer_if_true = NULL; | |
2247 Node* answer_if_false = NULL; | |
2248 switch (best_btest) { | |
2249 default: | |
2250 if (cmpxy == NULL) | |
2251 cmpxy = ideal_cmpxy; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
2252 best_bol = _gvn.transform(new(C) BoolNode(cmpxy, BoolTest::lt)); |
0 | 2253 // and fall through: |
2254 case BoolTest::lt: // x < y | |
2255 case BoolTest::le: // x <= y | |
2256 answer_if_true = (want_max ? yvalue : xvalue); | |
2257 answer_if_false = (want_max ? xvalue : yvalue); | |
2258 break; | |
2259 case BoolTest::gt: // x > y | |
2260 case BoolTest::ge: // x >= y | |
2261 answer_if_true = (want_max ? xvalue : yvalue); | |
2262 answer_if_false = (want_max ? yvalue : xvalue); | |
2263 break; | |
2264 } | |
2265 | |
2266 jint hi, lo; | |
2267 if (want_max) { | |
2268 // We can sharpen the minimum. | |
2269 hi = MAX2(txvalue->_hi, tyvalue->_hi); | |
2270 lo = MAX2(txvalue->_lo, tyvalue->_lo); | |
2271 } else { | |
2272 // We can sharpen the maximum. | |
2273 hi = MIN2(txvalue->_hi, tyvalue->_hi); | |
2274 lo = MIN2(txvalue->_lo, tyvalue->_lo); | |
2275 } | |
2276 | |
2277 // Use a flow-free graph structure, to avoid creating excess control edges | |
2278 // which could hinder other optimizations. | |
2279 // Since Math.min/max is often used with arraycopy, we want | |
2280 // tightly_coupled_allocation to be able to see beyond min/max expressions. | |
2281 Node* cmov = CMoveNode::make(C, NULL, best_bol, | |
2282 answer_if_false, answer_if_true, | |
2283 TypeInt::make(lo, hi, widen)); | |
2284 | |
2285 return _gvn.transform(cmov); | |
2286 | |
2287 /* | |
2288 // This is not as desirable as it may seem, since Min and Max | |
2289 // nodes do not have a full set of optimizations. | |
2290 // And they would interfere, anyway, with 'if' optimizations | |
2291 // and with CMoveI canonical forms. | |
2292 switch (id) { | |
2293 case vmIntrinsics::_min: | |
2294 result_val = _gvn.transform(new (C, 3) MinINode(x,y)); break; | |
2295 case vmIntrinsics::_max: | |
2296 result_val = _gvn.transform(new (C, 3) MaxINode(x,y)); break; | |
2297 default: | |
2298 ShouldNotReachHere(); | |
2299 } | |
2300 */ | |
2301 } | |
2302 | |
2303 inline int | |
2304 LibraryCallKit::classify_unsafe_addr(Node* &base, Node* &offset) { | |
2305 const TypePtr* base_type = TypePtr::NULL_PTR; | |
2306 if (base != NULL) base_type = _gvn.type(base)->isa_ptr(); | |
2307 if (base_type == NULL) { | |
2308 // Unknown type. | |
2309 return Type::AnyPtr; | |
2310 } else if (base_type == TypePtr::NULL_PTR) { | |
2311 // 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
|
2312 base = _gvn.transform(new (C) CastX2PNode(offset)); |
0 | 2313 offset = MakeConX(0); |
2314 return Type::RawPtr; | |
2315 } else if (base_type->base() == Type::RawPtr) { | |
2316 return Type::RawPtr; | |
2317 } else if (base_type->isa_oopptr()) { | |
2318 // Base is never null => always a heap address. | |
2319 if (base_type->ptr() == TypePtr::NotNull) { | |
2320 return Type::OopPtr; | |
2321 } | |
2322 // Offset is small => always a heap address. | |
2323 const TypeX* offset_type = _gvn.type(offset)->isa_intptr_t(); | |
2324 if (offset_type != NULL && | |
2325 base_type->offset() == 0 && // (should always be?) | |
2326 offset_type->_lo >= 0 && | |
2327 !MacroAssembler::needs_explicit_null_check(offset_type->_hi)) { | |
2328 return Type::OopPtr; | |
2329 } | |
2330 // Otherwise, it might either be oop+off or NULL+addr. | |
2331 return Type::AnyPtr; | |
2332 } else { | |
2333 // No information: | |
2334 return Type::AnyPtr; | |
2335 } | |
2336 } | |
2337 | |
2338 inline Node* LibraryCallKit::make_unsafe_address(Node* base, Node* offset) { | |
2339 int kind = classify_unsafe_addr(base, offset); | |
2340 if (kind == Type::RawPtr) { | |
2341 return basic_plus_adr(top(), base, offset); | |
2342 } else { | |
2343 return basic_plus_adr(base, offset); | |
2344 } | |
2345 } | |
2346 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2347 //--------------------------inline_number_methods----------------------------- |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2348 // inline int Integer.numberOfLeadingZeros(int) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2349 // inline int Long.numberOfLeadingZeros(long) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2350 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2351 // inline int Integer.numberOfTrailingZeros(int) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2352 // inline int Long.numberOfTrailingZeros(long) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2353 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2354 // inline int Integer.bitCount(int) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2355 // inline int Long.bitCount(long) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2356 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2357 // inline char Character.reverseBytes(char) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2358 // inline short Short.reverseBytes(short) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2359 // inline int Integer.reverseBytes(int) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2360 // inline long Long.reverseBytes(long) |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2361 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
|
2362 Node* arg = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2363 Node* n; |
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
2364 switch (id) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2365 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
|
2366 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
|
2367 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
|
2368 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
|
2369 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
|
2370 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
|
2371 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
|
2372 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
|
2373 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
|
2374 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
|
2375 default: fatal_unexpected_iid(id); break; |
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
2376 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2377 set_result(_gvn.transform(n)); |
0 | 2378 return true; |
2379 } | |
2380 | |
2381 //----------------------------inline_unsafe_access---------------------------- | |
2382 | |
2383 const static BasicType T_ADDRESS_HOLDER = T_LONG; | |
2384 | |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2385 // 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
|
2386 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
|
2387 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
|
2388 // 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
|
2389 // 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
|
2390 // 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
|
2391 // 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
|
2392 // 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
|
2393 // 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
|
2394 if (!UseG1GC && !need_mem_bar) |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2395 return; |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2396 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2397 // Some compile time checks. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2398 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2399 // 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
|
2400 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
|
2401 if (otype != NULL && otype->is_con() && |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2402 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
|
2403 // 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
|
2404 return; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2405 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2406 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2407 // 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
|
2408 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
|
2409 if (btype != NULL) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2410 if (btype->isa_aryptr()) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2411 // Array type so nothing to do |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2412 return; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2413 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2414 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2415 const TypeInstPtr* itype = btype->isa_instptr(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2416 if (itype != NULL) { |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2417 // 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
|
2418 // _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
|
2419 ciKlass* klass = itype->klass(); |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2420 if ( klass->is_loaded() && |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2421 !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
|
2422 !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
|
2423 return; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2424 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2425 } |
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 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2428 // 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
|
2429 // 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
|
2430 // |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2431 // 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
|
2432 // 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
|
2433 // pre_barrier(_, pre_val, ...); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2434 // } |
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 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2437 float likely = PROB_LIKELY( 0.999); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2438 float unlikely = PROB_UNLIKELY(0.999); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2439 |
3255 | 2440 IdealKit ideal(this); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2441 #define __ ideal. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2442 |
3254
59766fd005ff
7035117: G1: nsk/stress/jni/jnistress002 fails with assertion failure
johnc
parents:
3252
diff
changeset
|
2443 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
|
2444 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2445 __ 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
|
2446 // Update graphKit memory and control from IdealKit. |
3255 | 2447 sync_kit(ideal); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2448 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2449 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
|
2450 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
|
2451 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2452 // Update IdealKit memory and control from graphKit. |
3255 | 2453 __ sync_kit(this); |
3249
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 Node* one = __ ConI(1); |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2456 // 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
|
2457 __ 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
|
2458 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2459 // Update graphKit from IdeakKit. |
3255 | 2460 sync_kit(ideal); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2461 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2462 // 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
|
2463 pre_barrier(false /* do_load */, |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2464 __ ctrl(), |
3258
edd9b016deb6
7036021: G1: build failure on win64 and linux with hs21 in jdk6 build environment
johnc
parents:
3255
diff
changeset
|
2465 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
|
2466 pre_val /* pre_val */, |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2467 T_OBJECT); |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2468 if (need_mem_bar) { |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2469 // 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
|
2470 // 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
|
2471 insert_mem_bar(Op_MemBarCPUOrder); |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2472 } |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2473 // Update IdealKit from graphKit. |
3255 | 2474 __ sync_kit(this); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2475 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2476 } __ end_if(); // _ref_type != ref_none |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2477 } __ end_if(); // offset == referent_offset |
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 // Final sync IdealKit and GraphKit. |
3255 | 2480 final_sync(ideal); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2481 #undef __ |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2482 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2483 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2484 |
0 | 2485 // Interpret Unsafe.fieldOffset cookies correctly: |
2486 extern jlong Unsafe_field_offset_to_byte_offset(jlong field_offset); | |
2487 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2488 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
|
2489 // Attempt to infer a sharper value type from the offset and base type. |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2490 ciKlass* sharpened_klass = NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2491 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2492 // See if it is an instance field, with an object type. |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2493 if (alias_type->field() != NULL) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2494 assert(!is_native_ptr, "native pointer op cannot use a java address"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2495 if (alias_type->field()->type()->is_klass()) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2496 sharpened_klass = alias_type->field()->type()->as_klass(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2497 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2498 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2499 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2500 // See if it is a narrow oop array. |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2501 if (adr_type->isa_aryptr()) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2502 if (adr_type->offset() >= objArrayOopDesc::base_offset_in_bytes()) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2503 const TypeOopPtr *elem_type = adr_type->is_aryptr()->elem()->isa_oopptr(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2504 if (elem_type != NULL) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2505 sharpened_klass = elem_type->klass(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2506 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2507 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2508 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2509 |
6847
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2510 // 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
|
2511 // contraint in place. |
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2512 if (sharpened_klass != NULL && sharpened_klass->is_loaded()) { |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2513 const TypeOopPtr* tjp = TypeOopPtr::make_from_klass(sharpened_klass); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2514 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2515 #ifndef PRODUCT |
12295 | 2516 if (C->print_intrinsics() || C->print_inlining()) { |
6847
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2517 tty->print(" from base type: "); adr_type->dump(); |
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2518 tty->print(" sharpened value: "); tjp->dump(); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2519 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2520 #endif |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2521 // Sharpen the value type. |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2522 return tjp; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2523 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2524 return NULL; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2525 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2526 |
0 | 2527 bool LibraryCallKit::inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile) { |
2528 if (callee()->is_static()) return false; // caller must have the capability! | |
2529 | |
2530 #ifndef PRODUCT | |
2531 { | |
2532 ResourceMark rm; | |
2533 // Check the signatures. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2534 ciSignature* sig = callee()->signature(); |
0 | 2535 #ifdef ASSERT |
2536 if (!is_store) { | |
2537 // Object getObject(Object base, int/long offset), etc. | |
2538 BasicType rtype = sig->return_type()->basic_type(); | |
2539 if (rtype == T_ADDRESS_HOLDER && callee()->name() == ciSymbol::getAddress_name()) | |
2540 rtype = T_ADDRESS; // it is really a C void* | |
2541 assert(rtype == type, "getter must return the expected value"); | |
2542 if (!is_native_ptr) { | |
2543 assert(sig->count() == 2, "oop getter has 2 arguments"); | |
2544 assert(sig->type_at(0)->basic_type() == T_OBJECT, "getter base is object"); | |
2545 assert(sig->type_at(1)->basic_type() == T_LONG, "getter offset is correct"); | |
2546 } else { | |
2547 assert(sig->count() == 1, "native getter has 1 argument"); | |
2548 assert(sig->type_at(0)->basic_type() == T_LONG, "getter base is long"); | |
2549 } | |
2550 } else { | |
2551 // void putObject(Object base, int/long offset, Object x), etc. | |
2552 assert(sig->return_type()->basic_type() == T_VOID, "putter must not return a value"); | |
2553 if (!is_native_ptr) { | |
2554 assert(sig->count() == 3, "oop putter has 3 arguments"); | |
2555 assert(sig->type_at(0)->basic_type() == T_OBJECT, "putter base is object"); | |
2556 assert(sig->type_at(1)->basic_type() == T_LONG, "putter offset is correct"); | |
2557 } else { | |
2558 assert(sig->count() == 2, "native putter has 2 arguments"); | |
2559 assert(sig->type_at(0)->basic_type() == T_LONG, "putter base is long"); | |
2560 } | |
2561 BasicType vtype = sig->type_at(sig->count()-1)->basic_type(); | |
2562 if (vtype == T_ADDRESS_HOLDER && callee()->name() == ciSymbol::putAddress_name()) | |
2563 vtype = T_ADDRESS; // it is really a C void* | |
2564 assert(vtype == type, "putter must accept the expected value"); | |
2565 } | |
2566 #endif // ASSERT | |
2567 } | |
2568 #endif //PRODUCT | |
2569 | |
2570 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
2571 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2572 Node* receiver = argument(0); // type: oop |
0 | 2573 |
2574 // 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
|
2575 Node* adr; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2576 Node* heap_base_oop = top(); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2577 Node* offset = top(); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2578 Node* val; |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2579 |
0 | 2580 if (!is_native_ptr) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2581 // 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
|
2582 Node* base = argument(1); // type: oop |
0 | 2583 // 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
|
2584 offset = argument(2); // type: long |
0 | 2585 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset |
2586 // to be plain byte offsets, which are also the same as those accepted | |
2587 // by oopDesc::field_base. | |
2588 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
2589 "fieldOffset must be byte-scaled"); | |
2590 // 32-bit machines ignore the high half! | |
2591 offset = ConvL2X(offset); | |
2592 adr = make_unsafe_address(base, offset); | |
2593 heap_base_oop = base; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2594 val = is_store ? argument(4) : NULL; |
0 | 2595 } else { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2596 Node* ptr = argument(1); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2597 ptr = ConvL2X(ptr); // adjust Java long to machine word |
0 | 2598 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
|
2599 val = is_store ? argument(3) : NULL; |
0 | 2600 } |
2601 | |
2602 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
2603 | |
2604 // First guess at the value type. | |
2605 const Type *value_type = Type::get_const_basic_type(type); | |
2606 | |
2607 // Try to categorize the address. If it comes up as TypeJavaPtr::BOTTOM, | |
2608 // there was not enough information to nail it down. | |
2609 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
2610 assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here"); | |
2611 | |
2612 // We will need memory barriers unless we can determine a unique | |
2613 // alias category for this reference. (Note: If for some reason | |
2614 // the barriers get omitted and the unsafe reference begins to "pollute" | |
2615 // the alias analysis of the rest of the graph, either Compile::can_alias | |
2616 // or Compile::must_alias will throw a diagnostic assert.) | |
2617 bool need_mem_bar = (alias_type->adr_type() == TypeOopPtr::BOTTOM); | |
2618 | |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2619 // 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
|
2620 // 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
|
2621 // 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
|
2622 // 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
|
2623 // 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
|
2624 // 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
|
2625 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
|
2626 offset != top() && heap_base_oop != top(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2627 |
0 | 2628 if (!is_store && type == T_OBJECT) { |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2629 const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type, is_native_ptr); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2630 if (tjp != NULL) { |
0 | 2631 value_type = tjp; |
2632 } | |
2633 } | |
2634 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2635 receiver = null_check(receiver); |
0 | 2636 if (stopped()) { |
2637 return true; | |
2638 } | |
2639 // Heap pointers get a null-check from the interpreter, | |
2640 // as a courtesy. However, this is not guaranteed by Unsafe, | |
2641 // and it is not possible to fully distinguish unintended nulls | |
2642 // from intended ones in this API. | |
2643 | |
2644 if (is_volatile) { | |
2645 // We need to emit leading and trailing CPU membars (see below) in | |
2646 // addition to memory membars when is_volatile. This is a little | |
2647 // too strong, but avoids the need to insert per-alias-type | |
2648 // volatile membars (for stores; compare Parse::do_put_xxx), which | |
605 | 2649 // we cannot do effectively here because we probably only have a |
0 | 2650 // rough approximation of type. |
2651 need_mem_bar = true; | |
2652 // 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
|
2653 if (is_store) { |
0 | 2654 insert_mem_bar(Op_MemBarRelease); |
17794
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2655 } else { |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2656 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
|
2657 insert_mem_bar(Op_MemBarVolatile); |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2658 } |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2659 } |
0 | 2660 } |
2661 | |
2662 // Memory barrier to prevent normal and 'unsafe' accesses from | |
2663 // bypassing each other. Happens after null checks, so the | |
2664 // exception paths do not take memory state from the memory barrier, | |
2665 // so there's no problems making a strong assert about mixing users | |
2666 // of safe & unsafe memory. Otherwise fails in a CTW of rt.jar | |
2667 // around 5701, class sun/reflect/UnsafeBooleanFieldAccessorImpl. | |
2668 if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder); | |
2669 | |
2670 if (!is_store) { | |
20420
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
2671 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
|
2672 // 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
|
2673 // 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
|
2674 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
|
2675 // load value |
0 | 2676 switch (type) { |
2677 case T_BOOLEAN: | |
2678 case T_CHAR: | |
2679 case T_BYTE: | |
2680 case T_SHORT: | |
2681 case T_INT: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2682 case T_LONG: |
0 | 2683 case T_FLOAT: |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2684 case T_DOUBLE: |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2685 break; |
0 | 2686 case T_OBJECT: |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2687 if (need_read_barrier) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2688 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
|
2689 } |
0 | 2690 break; |
2691 case T_ADDRESS: | |
2692 // Cast to an int type. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2693 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
|
2694 p = ConvX2UL(p); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2695 break; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2696 default: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2697 fatal(err_msg_res("unexpected type %d: %s", type, type2name(type))); |
0 | 2698 break; |
2699 } | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2700 // 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
|
2701 // 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
|
2702 // 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
|
2703 // point is fine. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2704 set_result(p); |
0 | 2705 } else { |
2706 // place effect of store into memory | |
2707 switch (type) { | |
2708 case T_DOUBLE: | |
2709 val = dstore_rounding(val); | |
2710 break; | |
2711 case T_ADDRESS: | |
2712 // Repackage the long as a pointer. | |
2713 val = ConvL2X(val); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
2714 val = _gvn.transform(new (C) CastX2PNode(val)); |
0 | 2715 break; |
2716 } | |
2717 | |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
2718 MemNode::MemOrd mo = is_volatile ? MemNode::release : MemNode::unordered; |
0 | 2719 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
|
2720 (void) store_to_memory(control(), adr, val, type, adr_type, mo, is_volatile); |
0 | 2721 } else { |
2722 // Possibly an oop being stored to Java heap or native memory | |
2723 if (!TypePtr::NULL_PTR->higher_equal(_gvn.type(heap_base_oop))) { | |
2724 // 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
|
2725 (void) store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type, mo); |
0 | 2726 } else { |
2727 // We can't tell at compile time if we are storing in the Java heap or outside | |
2728 // of it. So we need to emit code to conditionally do the proper type of | |
2729 // store. | |
2730 | |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2731 IdealKit ideal(this); |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2732 #define __ ideal. |
0 | 2733 // QQQ who knows what probability is here?? |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2734 __ 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
|
2735 // Sync IdealKit and graphKit. |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2736 sync_kit(ideal); |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
2737 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
|
2738 // Update IdealKit memory. |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2739 __ sync_kit(this); |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2740 } __ else_(); { |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
2741 __ 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
|
2742 } __ end_if(); |
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2743 // Final sync IdealKit and GraphKit. |
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2744 final_sync(ideal); |
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2745 #undef __ |
0 | 2746 } |
2747 } | |
2748 } | |
2749 | |
2750 if (is_volatile) { | |
17794
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2751 if (!is_store) { |
0 | 2752 insert_mem_bar(Op_MemBarAcquire); |
17794
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2753 } else { |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2754 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
|
2755 insert_mem_bar(Op_MemBarVolatile); |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2756 } |
3514ee402842
8029101: PPC64 (part 211): ordering of Independent Reads of Independent Writes
goetz
parents:
14439
diff
changeset
|
2757 } |
0 | 2758 } |
2759 | |
2760 if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder); | |
2761 | |
2762 return true; | |
2763 } | |
2764 | |
2765 //----------------------------inline_unsafe_prefetch---------------------------- | |
2766 | |
2767 bool LibraryCallKit::inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static) { | |
2768 #ifndef PRODUCT | |
2769 { | |
2770 ResourceMark rm; | |
2771 // Check the signatures. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2772 ciSignature* sig = callee()->signature(); |
0 | 2773 #ifdef ASSERT |
2774 // Object getObject(Object base, int/long offset), etc. | |
2775 BasicType rtype = sig->return_type()->basic_type(); | |
2776 if (!is_native_ptr) { | |
2777 assert(sig->count() == 2, "oop prefetch has 2 arguments"); | |
2778 assert(sig->type_at(0)->basic_type() == T_OBJECT, "prefetch base is object"); | |
2779 assert(sig->type_at(1)->basic_type() == T_LONG, "prefetcha offset is correct"); | |
2780 } else { | |
2781 assert(sig->count() == 1, "native prefetch has 1 argument"); | |
2782 assert(sig->type_at(0)->basic_type() == T_LONG, "prefetch base is long"); | |
2783 } | |
2784 #endif // ASSERT | |
2785 } | |
2786 #endif // !PRODUCT | |
2787 | |
2788 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
2789 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2790 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
|
2791 if (!is_static) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2792 null_check_receiver(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2793 if (stopped()) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2794 return true; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2795 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2796 } |
0 | 2797 |
2798 // Build address expression. See the code in inline_unsafe_access. | |
2799 Node *adr; | |
2800 if (!is_native_ptr) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2801 // 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
|
2802 Node* base = argument(idx + 0); // type: oop |
0 | 2803 // 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
|
2804 Node* offset = argument(idx + 1); // type: long |
0 | 2805 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset |
2806 // to be plain byte offsets, which are also the same as those accepted | |
2807 // by oopDesc::field_base. | |
2808 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
2809 "fieldOffset must be byte-scaled"); | |
2810 // 32-bit machines ignore the high half! | |
2811 offset = ConvL2X(offset); | |
2812 adr = make_unsafe_address(base, offset); | |
2813 } else { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2814 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
|
2815 ptr = ConvL2X(ptr); // adjust Java long to machine word |
0 | 2816 adr = make_unsafe_address(NULL, ptr); |
2817 } | |
2818 | |
2819 // Generate the read or write prefetch | |
2820 Node *prefetch; | |
2821 if (is_store) { | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2822 prefetch = new (C) PrefetchWriteNode(i_o(), adr); |
0 | 2823 } else { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2824 prefetch = new (C) PrefetchReadNode(i_o(), adr); |
0 | 2825 } |
2826 prefetch->init_req(0, control()); | |
2827 set_i_o(_gvn.transform(prefetch)); | |
2828 | |
2829 return true; | |
2830 } | |
2831 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2832 //----------------------------inline_unsafe_load_store---------------------------- |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2833 // 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
|
2834 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2835 // LS_cmpxchg: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2836 // 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
|
2837 // 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
|
2838 // 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
|
2839 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2840 // LS_xadd: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2841 // 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
|
2842 // 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
|
2843 // |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2844 // LS_xchg: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2845 // 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
|
2846 // 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
|
2847 // 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
|
2848 // |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2849 bool LibraryCallKit::inline_unsafe_load_store(BasicType type, LoadStoreKind kind) { |
0 | 2850 // This basic scheme here is the same as inline_unsafe_access, but |
2851 // differs in enough details that combining them would make the code | |
2852 // overly confusing. (This is a true fact! I originally combined | |
2853 // them, but even I was confused by it!) As much code/comments as | |
2854 // possible are retained from inline_unsafe_access though to make | |
605 | 2855 // the correspondences clearer. - dl |
0 | 2856 |
2857 if (callee()->is_static()) return false; // caller must have the capability! | |
2858 | |
2859 #ifndef PRODUCT | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2860 BasicType rtype; |
0 | 2861 { |
2862 ResourceMark rm; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2863 // Check the signatures. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2864 ciSignature* sig = callee()->signature(); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2865 rtype = sig->return_type()->basic_type(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2866 if (kind == LS_xadd || kind == LS_xchg) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2867 // Check the signatures. |
0 | 2868 #ifdef ASSERT |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2869 assert(rtype == type, "get and set must return the expected type"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2870 assert(sig->count() == 3, "get and set has 3 arguments"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2871 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
|
2872 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
|
2873 assert(sig->type_at(2)->basic_type() == type, "get and set must take expected type as new value/delta"); |
0 | 2874 #endif // ASSERT |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2875 } else if (kind == LS_cmpxchg) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2876 // Check the signatures. |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2877 #ifdef ASSERT |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2878 assert(rtype == T_BOOLEAN, "CAS must return boolean"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2879 assert(sig->count() == 4, "CAS has 4 arguments"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2880 assert(sig->type_at(0)->basic_type() == T_OBJECT, "CAS base is object"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2881 assert(sig->type_at(1)->basic_type() == T_LONG, "CAS offset is long"); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2882 #endif // ASSERT |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2883 } else { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2884 ShouldNotReachHere(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2885 } |
0 | 2886 } |
2887 #endif //PRODUCT | |
2888 | |
2889 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
2890 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2891 // Get arguments: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2892 Node* receiver = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2893 Node* base = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2894 Node* offset = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2895 Node* oldval = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2896 Node* newval = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2897 if (kind == LS_cmpxchg) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2898 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
|
2899 receiver = argument(0); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2900 base = argument(1); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2901 offset = argument(2); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2902 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
|
2903 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
|
2904 } 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
|
2905 receiver = argument(0); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2906 base = argument(1); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2907 offset = argument(2); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2908 oldval = NULL; |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2909 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
|
2910 } |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2911 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2912 // Null check receiver. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2913 receiver = null_check(receiver); |
0 | 2914 if (stopped()) { |
2915 return true; | |
2916 } | |
2917 | |
2918 // Build field offset expression. | |
2919 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset | |
2920 // to be plain byte offsets, which are also the same as those accepted | |
2921 // by oopDesc::field_base. | |
2922 assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled"); | |
2923 // 32-bit machines ignore the high half of long offsets | |
2924 offset = ConvL2X(offset); | |
2925 Node* adr = make_unsafe_address(base, offset); | |
2926 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
2927 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2928 // For CAS, unlike inline_unsafe_access, there seems no point in |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2929 // trying to refine types. Just use the coarse types here. |
0 | 2930 const Type *value_type = Type::get_const_basic_type(type); |
2931 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
2932 assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here"); | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2933 |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2934 if (kind == LS_xchg && type == T_OBJECT) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2935 const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2936 if (tjp != NULL) { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2937 value_type = tjp; |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2938 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2939 } |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2940 |
0 | 2941 int alias_idx = C->get_alias_index(adr_type); |
2942 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2943 // Memory-model-wise, a LoadStore acts like a little synchronized |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2944 // block, so needs barriers on each side. These don't translate |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2945 // into actual barriers on most machines, but we still need rest of |
0 | 2946 // compiler to respect ordering. |
2947 | |
2948 insert_mem_bar(Op_MemBarRelease); | |
2949 insert_mem_bar(Op_MemBarCPUOrder); | |
2950 | |
2951 // 4984716: MemBars must be inserted before this | |
2952 // memory node in order to avoid a false | |
2953 // dependency which will confuse the scheduler. | |
2954 Node *mem = memory(alias_idx); | |
2955 | |
2956 // For now, we handle only those cases that actually exist: ints, | |
2957 // longs, and Object. Adding others should be straightforward. | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2958 Node* load_store; |
0 | 2959 switch(type) { |
2960 case T_INT: | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2961 if (kind == LS_xadd) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2962 load_store = _gvn.transform(new (C) GetAndAddINode(control(), mem, adr, newval, adr_type)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2963 } else if (kind == LS_xchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2964 load_store = _gvn.transform(new (C) GetAndSetINode(control(), mem, adr, newval, adr_type)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2965 } else if (kind == LS_cmpxchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2966 load_store = _gvn.transform(new (C) CompareAndSwapINode(control(), mem, adr, newval, oldval)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2967 } else { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2968 ShouldNotReachHere(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2969 } |
0 | 2970 break; |
2971 case T_LONG: | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2972 if (kind == LS_xadd) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2973 load_store = _gvn.transform(new (C) GetAndAddLNode(control(), mem, adr, newval, adr_type)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2974 } else if (kind == LS_xchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2975 load_store = _gvn.transform(new (C) GetAndSetLNode(control(), mem, adr, newval, adr_type)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2976 } else if (kind == LS_cmpxchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2977 load_store = _gvn.transform(new (C) CompareAndSwapLNode(control(), mem, adr, newval, oldval)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2978 } else { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2979 ShouldNotReachHere(); |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2980 } |
0 | 2981 break; |
2982 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
|
2983 // 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
|
2984 // 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
|
2985 // 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
|
2986 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
|
2987 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
|
2988 |
b9bc6cae88f2
7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes
kvn
parents:
4778
diff
changeset
|
2989 // Reference stores need a store barrier. |
12169
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2990 if (kind == LS_xchg) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2991 // 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
|
2992 if (!can_move_pre_barrier()) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2993 pre_barrier(true /* do_load*/, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2994 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
|
2995 NULL /* pre_val*/, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2996 T_OBJECT); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2997 } // 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
|
2998 } else if (kind == LS_cmpxchg) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2999 // Same as for newval above: |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3000 if (_gvn.type(oldval) == TypePtr::NULL_PTR) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3001 oldval = _gvn.makecon(TypePtr::NULL_PTR); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3002 } |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3003 // 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
|
3004 pre_barrier(false /* do_load */, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3005 control(), NULL, NULL, max_juint, NULL, NULL, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3006 oldval /* pre_val */, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3007 T_OBJECT); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3008 } else { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3009 ShouldNotReachHere(); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3010 } |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3011 |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
3012 #ifdef _LP64 |
163 | 3013 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
|
3014 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
|
3015 if (kind == LS_xchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3016 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
|
3017 newval_enc, adr_type, value_type->make_narrowoop())); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3018 } else { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3019 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
|
3020 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
|
3021 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
|
3022 newval_enc, oldval_enc)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3023 } |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
3024 } else |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
3025 #endif |
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
174
diff
changeset
|
3026 { |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3027 if (kind == LS_xchg) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3028 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
|
3029 } else { |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3030 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
|
3031 load_store = _gvn.transform(new (C) CompareAndSwapPNode(control(), mem, adr, newval, oldval)); |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3032 } |
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
174
diff
changeset
|
3033 } |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3034 post_barrier(control(), load_store, base, adr, alias_idx, newval, T_OBJECT, true); |
0 | 3035 break; |
3036 default: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3037 fatal(err_msg_res("unexpected type %d: %s", type, type2name(type))); |
0 | 3038 break; |
3039 } | |
3040 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3041 // SCMemProjNodes represent the memory state of a LoadStore. Their |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3042 // main role is to prevent LoadStore nodes from being optimized away |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3043 // when their results aren't used. |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3044 Node* proj = _gvn.transform(new (C) SCMemProjNode(load_store)); |
0 | 3045 set_memory(proj, alias_idx); |
3046 | |
12169
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3047 if (type == T_OBJECT && kind == LS_xchg) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3048 #ifdef _LP64 |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3049 if (adr->bottom_type()->is_ptr_to_narrowoop()) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3050 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
|
3051 } |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3052 #endif |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3053 if (can_move_pre_barrier()) { |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3054 // 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
|
3055 // 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
|
3056 // gets inserted between them. |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3057 pre_barrier(false /* do_load */, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3058 control(), NULL, NULL, max_juint, NULL, NULL, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3059 load_store /* pre_val */, |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3060 T_OBJECT); |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3061 } |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3062 } |
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
3063 |
0 | 3064 // Add the trailing membar surrounding the access |
3065 insert_mem_bar(Op_MemBarCPUOrder); | |
3066 insert_mem_bar(Op_MemBarAcquire); | |
3067 | |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
3068 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
|
3069 set_result(load_store); |
0 | 3070 return true; |
3071 } | |
3072 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3073 //----------------------------inline_unsafe_ordered_store---------------------- |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3074 // 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
|
3075 // 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
|
3076 // public native void sun.misc.Unsafe.putOrderedLong(Object o, long offset, long x); |
0 | 3077 bool LibraryCallKit::inline_unsafe_ordered_store(BasicType type) { |
3078 // This is another variant of inline_unsafe_access, differing in | |
3079 // that it always issues store-store ("release") barrier and ensures | |
3080 // store-atomicity (which only matters for "long"). | |
3081 | |
3082 if (callee()->is_static()) return false; // caller must have the capability! | |
3083 | |
3084 #ifndef PRODUCT | |
3085 { | |
3086 ResourceMark rm; | |
3087 // Check the signatures. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3088 ciSignature* sig = callee()->signature(); |
0 | 3089 #ifdef ASSERT |
3090 BasicType rtype = sig->return_type()->basic_type(); | |
3091 assert(rtype == T_VOID, "must return void"); | |
3092 assert(sig->count() == 3, "has 3 arguments"); | |
3093 assert(sig->type_at(0)->basic_type() == T_OBJECT, "base is object"); | |
3094 assert(sig->type_at(1)->basic_type() == T_LONG, "offset is long"); | |
3095 #endif // ASSERT | |
3096 } | |
3097 #endif //PRODUCT | |
3098 | |
3099 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
3100 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3101 // Get arguments: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3102 Node* receiver = argument(0); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3103 Node* base = argument(1); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3104 Node* offset = argument(2); // type: long |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3105 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
|
3106 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3107 // Null check receiver. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3108 receiver = null_check(receiver); |
0 | 3109 if (stopped()) { |
3110 return true; | |
3111 } | |
3112 | |
3113 // Build field offset expression. | |
3114 assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled"); | |
3115 // 32-bit machines ignore the high half of long offsets | |
3116 offset = ConvL2X(offset); | |
3117 Node* adr = make_unsafe_address(base, offset); | |
3118 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
3119 const Type *value_type = Type::get_const_basic_type(type); | |
3120 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
3121 | |
3122 insert_mem_bar(Op_MemBarRelease); | |
3123 insert_mem_bar(Op_MemBarCPUOrder); | |
3124 // 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
|
3125 const bool require_atomic_access = true; |
0 | 3126 Node* store; |
3127 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
|
3128 store = store_oop_to_unknown(control(), base, adr, adr_type, val, type, MemNode::release); |
0 | 3129 else { |
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
13019
diff
changeset
|
3130 store = store_to_memory(control(), adr, val, type, adr_type, MemNode::release, require_atomic_access); |
0 | 3131 } |
3132 insert_mem_bar(Op_MemBarCPUOrder); | |
3133 return true; | |
3134 } | |
3135 | |
7425 | 3136 bool LibraryCallKit::inline_unsafe_fence(vmIntrinsics::ID id) { |
3137 // Regardless of form, don't allow previous ld/st to move down, | |
3138 // then issue acquire, release, or volatile mem_bar. | |
3139 insert_mem_bar(Op_MemBarCPUOrder); | |
3140 switch(id) { | |
3141 case vmIntrinsics::_loadFence: | |
14439
50fdb38839eb
8028515: PPPC64 (part 113.2): opto: Introduce LoadFence/StoreFence.
goetz
parents:
14429
diff
changeset
|
3142 insert_mem_bar(Op_LoadFence); |
7425 | 3143 return true; |
3144 case vmIntrinsics::_storeFence: | |
14439
50fdb38839eb
8028515: PPPC64 (part 113.2): opto: Introduce LoadFence/StoreFence.
goetz
parents:
14429
diff
changeset
|
3145 insert_mem_bar(Op_StoreFence); |
7425 | 3146 return true; |
3147 case vmIntrinsics::_fullFence: | |
3148 insert_mem_bar(Op_MemBarVolatile); | |
3149 return true; | |
3150 default: | |
3151 fatal_unexpected_iid(id); | |
3152 return false; | |
3153 } | |
3154 } | |
3155 | |
12078 | 3156 bool LibraryCallKit::klass_needs_init_guard(Node* kls) { |
3157 if (!kls->is_Con()) { | |
3158 return true; | |
3159 } | |
3160 const TypeKlassPtr* klsptr = kls->bottom_type()->isa_klassptr(); | |
3161 if (klsptr == NULL) { | |
3162 return true; | |
3163 } | |
3164 ciInstanceKlass* ik = klsptr->klass()->as_instance_klass(); | |
3165 // don't need a guard for a klass that is already initialized | |
3166 return !ik->is_initialized(); | |
3167 } | |
3168 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3169 //----------------------------inline_unsafe_allocate--------------------------- |
12078 | 3170 // public native Object sun.misc.Unsafe.allocateInstance(Class<?> cls); |
0 | 3171 bool LibraryCallKit::inline_unsafe_allocate() { |
3172 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
|
3173 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3174 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
|
3175 Node* cls = null_check(argument(1)); |
0 | 3176 if (stopped()) return true; |
3177 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3178 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
|
3179 kls = null_check(kls); |
0 | 3180 if (stopped()) return true; // argument was like int.class |
3181 | |
12078 | 3182 Node* test = NULL; |
3183 if (LibraryCallKit::klass_needs_init_guard(kls)) { | |
3184 // Note: The argument might still be an illegal value like | |
3185 // Serializable.class or Object[].class. The runtime will handle it. | |
3186 // But we must make an explicit check for initialization. | |
3187 Node* insp = basic_plus_adr(kls, in_bytes(InstanceKlass::init_state_offset())); | |
3188 // Use T_BOOLEAN for InstanceKlass::_init_state so the compiler | |
3189 // 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
|
3190 Node* inst = make_load(NULL, insp, TypeInt::UBYTE, T_BOOLEAN, MemNode::unordered); |
12078 | 3191 Node* bits = intcon(InstanceKlass::fully_initialized); |
3192 test = _gvn.transform(new (C) SubINode(inst, bits)); | |
3193 // The 'test' is non-zero if we need to take a slow path. | |
3194 } | |
0 | 3195 |
3196 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
|
3197 set_result(obj); |
0 | 3198 return true; |
3199 } | |
3200 | |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3201 #ifdef TRACE_HAVE_INTRINSICS |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3202 /* |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3203 * oop -> myklass |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3204 * myklass->trace_id |= USED |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3205 * return myklass->trace_id & ~0x3 |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3206 */ |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3207 bool LibraryCallKit::inline_native_classID() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3208 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
|
3209 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
|
3210 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
|
3211 kls = null_check(kls, T_OBJECT); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3212 ByteSize offset = TRACE_ID_OFFSET; |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3213 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
|
3214 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
|
3215 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
|
3216 Node* andl = _gvn.transform(new (C) AndLNode(tvalue, bits)); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3217 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
|
3218 Node* orl = _gvn.transform(new (C) OrLNode(tvalue, clsused)); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3219 |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3220 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
|
3221 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
|
3222 set_result(andl); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3223 return true; |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3224 } |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3225 |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3226 bool LibraryCallKit::inline_native_threadID() { |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3227 Node* tls_ptr = NULL; |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3228 Node* cur_thr = generate_current_thread(tls_ptr); |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3229 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
|
3230 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
|
3231 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
|
3232 |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3233 Node* threadid = NULL; |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3234 size_t thread_id_size = OSThread::thread_id_size(); |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3235 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
|
3236 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
|
3237 } 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
|
3238 threadid = make_load(control(), p, TypeInt::INT, T_INT, MemNode::unordered); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3239 } else { |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3240 ShouldNotReachHere(); |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3241 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3242 set_result(threadid); |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3243 return true; |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3244 } |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3245 #endif |
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3246 |
0 | 3247 //------------------------inline_native_time_funcs-------------- |
3248 // inline code for System.currentTimeMillis() and System.nanoTime() | |
3249 // these have the same type and signature | |
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3250 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
|
3251 const TypeFunc* tf = OptoRuntime::void_long_Type(); |
0 | 3252 const TypePtr* no_memory_effects = NULL; |
3253 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
|
3254 Node* value = _gvn.transform(new (C) ProjNode(time, TypeFunc::Parms+0)); |
0 | 3255 #ifdef ASSERT |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3256 Node* value_top = _gvn.transform(new (C) ProjNode(time, TypeFunc::Parms+1)); |
0 | 3257 assert(value_top == top(), "second value must be top"); |
3258 #endif | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3259 set_result(value); |
0 | 3260 return true; |
3261 } | |
3262 | |
3263 //------------------------inline_native_currentThread------------------ | |
3264 bool LibraryCallKit::inline_native_currentThread() { | |
3265 Node* junk = NULL; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3266 set_result(generate_current_thread(junk)); |
0 | 3267 return true; |
3268 } | |
3269 | |
3270 //------------------------inline_native_isInterrupted------------------ | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3271 // private native boolean java.lang.Thread.isInterrupted(boolean ClearInterrupted); |
0 | 3272 bool LibraryCallKit::inline_native_isInterrupted() { |
3273 // Add a fast path to t.isInterrupted(clear_int): | |
17716
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3274 // (t == Thread.current() && |
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3275 // (!TLS._osthread._interrupted || WINDOWS_ONLY(false) NOT_WINDOWS(!clear_int))) |
0 | 3276 // ? TLS._osthread._interrupted : /*slow path:*/ t.isInterrupted(clear_int) |
3277 // So, in the common case that the interrupt bit is false, | |
3278 // we avoid making a call into the VM. Even if the interrupt bit | |
3279 // is true, if the clear_int argument is false, we avoid the VM call. | |
3280 // However, if the receiver is not currentThread, we must call the VM, | |
3281 // because there must be some locking done around the operation. | |
3282 | |
3283 // We only go to the fast case code if we pass two guards. | |
3284 // 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
|
3285 |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3286 enum { |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3287 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
|
3288 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
|
3289 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
|
3290 PATH_LIMIT |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3291 }; |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3292 |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3293 // 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
|
3294 // out of the function. |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3295 insert_mem_bar(Op_MemBarCPUOrder); |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3296 |
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3297 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
|
3298 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
|
3299 |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3300 RegionNode* slow_region = new (C) RegionNode(1); |
0 | 3301 record_for_igvn(slow_region); |
3302 | |
3303 // (a) Receiving thread must be the current thread. | |
3304 Node* rec_thr = argument(0); | |
3305 Node* tls_ptr = NULL; | |
3306 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
|
3307 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
|
3308 Node* bol_thr = _gvn.transform(new (C) BoolNode(cmp_thr, BoolTest::ne)); |
0 | 3309 |
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3310 generate_slow_guard(bol_thr, slow_region); |
0 | 3311 |
3312 // (b) Interrupt bit on TLS must be false. | |
3313 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
|
3314 Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS, MemNode::unordered); |
0 | 3315 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
|
3316 |
787
aabd393cf1ee
6772683: Thread.isInterrupted() fails to return true on multiprocessor PC
kvn
parents:
775
diff
changeset
|
3317 // 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
|
3318 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
|
3319 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
|
3320 Node* bol_bit = _gvn.transform(new (C) BoolNode(cmp_bit, BoolTest::ne)); |
0 | 3321 |
3322 IfNode* iff_bit = create_and_map_if(control(), bol_bit, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN); | |
3323 | |
3324 // 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
|
3325 Node* false_bit = _gvn.transform(new (C) IfFalseNode(iff_bit)); |
0 | 3326 result_rgn->init_req(no_int_result_path, false_bit); |
3327 result_val->init_req(no_int_result_path, intcon(0)); | |
3328 | |
3329 // drop through to next case | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3330 set_control( _gvn.transform(new (C) IfTrueNode(iff_bit))); |
0 | 3331 |
17716
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3332 #ifndef TARGET_OS_FAMILY_windows |
0 | 3333 // (c) Or, if interrupt bit is set and clear_int is false, use 2nd fast path. |
3334 Node* clr_arg = argument(1); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3335 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
|
3336 Node* bol_arg = _gvn.transform(new (C) BoolNode(cmp_arg, BoolTest::ne)); |
0 | 3337 IfNode* iff_arg = create_and_map_if(control(), bol_arg, PROB_FAIR, COUNT_UNKNOWN); |
3338 | |
3339 // 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
|
3340 Node* false_arg = _gvn.transform(new (C) IfFalseNode(iff_arg)); |
0 | 3341 result_rgn->init_req(no_clear_result_path, false_arg); |
3342 result_val->init_req(no_clear_result_path, intcon(1)); | |
3343 | |
3344 // drop through to next case | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3345 set_control( _gvn.transform(new (C) IfTrueNode(iff_arg))); |
17716
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3346 #else |
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3347 // To return true on Windows you must read the _interrupted field |
cdb71841f4bc
6498581: ThreadInterruptTest3 produces wrong output on Windows
minqi
parents:
17670
diff
changeset
|
3348 // 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
|
3349 #endif // TARGET_OS_FAMILY_windows |
0 | 3350 |
3351 // (d) Otherwise, go to the slow path. | |
3352 slow_region->add_req(control()); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3353 set_control( _gvn.transform(slow_region)); |
0 | 3354 |
3355 if (stopped()) { | |
3356 // There is no slow path. | |
3357 result_rgn->init_req(slow_result_path, top()); | |
3358 result_val->init_req(slow_result_path, top()); | |
3359 } else { | |
3360 // non-virtual because it is a private non-static | |
3361 CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_isInterrupted); | |
3362 | |
3363 Node* slow_val = set_results_for_java_call(slow_call); | |
3364 // this->control() comes from set_results_for_java_call | |
3365 | |
3366 Node* fast_io = slow_call->in(TypeFunc::I_O); | |
3367 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
|
3368 |
0 | 3369 // 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
|
3370 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
|
3371 PhiNode* result_io = PhiNode::make(result_rgn, fast_io, Type::ABIO); |
0 | 3372 |
3373 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
|
3374 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
|
3375 result_mem->init_req(slow_result_path, reset_memory()); |
0 | 3376 result_val->init_req(slow_result_path, slow_val); |
3377 | |
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3378 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
|
3379 set_i_o( _gvn.transform(result_io)); |
0 | 3380 } |
3381 | |
3382 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
|
3383 set_result(result_rgn, result_val); |
0 | 3384 return true; |
3385 } | |
3386 | |
3387 //---------------------------load_mirror_from_klass---------------------------- | |
3388 // Given a klass oop, load its java mirror (a java.lang.Class oop). | |
3389 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
|
3390 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
|
3391 return make_load(NULL, p, TypeInstPtr::MIRROR, T_OBJECT, MemNode::unordered); |
0 | 3392 } |
3393 | |
3394 //-----------------------load_klass_from_mirror_common------------------------- | |
3395 // Given a java mirror (a java.lang.Class oop), load its corresponding klass oop. | |
3396 // Test the klass oop for null (signifying a primitive Class like Integer.TYPE), | |
3397 // and branch to the given path on the region. | |
3398 // If never_see_null, take an uncommon trap on null, so we can optimistically | |
3399 // compile for the non-null case. | |
3400 // If the region is NULL, force never_see_null = true. | |
3401 Node* LibraryCallKit::load_klass_from_mirror_common(Node* mirror, | |
3402 bool never_see_null, | |
3403 RegionNode* region, | |
3404 int null_path, | |
3405 int offset) { | |
3406 if (region == NULL) never_see_null = true; | |
3407 Node* p = basic_plus_adr(mirror, offset); | |
3408 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
|
3409 Node* kls = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeRawPtr::BOTTOM, kls_type)); |
0 | 3410 Node* null_ctl = top(); |
3411 kls = null_check_oop(kls, &null_ctl, never_see_null); | |
3412 if (region != NULL) { | |
3413 // Set region->in(null_path) if the mirror is a primitive (e.g, int.class). | |
3414 region->init_req(null_path, null_ctl); | |
3415 } else { | |
3416 assert(null_ctl == top(), "no loose ends"); | |
3417 } | |
3418 return kls; | |
3419 } | |
3420 | |
3421 //--------------------(inline_native_Class_query helpers)--------------------- | |
3422 // Use this for JVM_ACC_INTERFACE, JVM_ACC_IS_CLONEABLE, JVM_ACC_HAS_FINALIZER. | |
3423 // Fall through if (mods & mask) == bits, take the guard otherwise. | |
3424 Node* LibraryCallKit::generate_access_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region) { | |
3425 // Branch around if the given klass has the given modifier bit set. | |
3426 // 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
|
3427 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
|
3428 Node* mods = make_load(NULL, modp, TypeInt::INT, T_INT, MemNode::unordered); |
0 | 3429 Node* mask = intcon(modifier_mask); |
3430 Node* bits = intcon(modifier_bits); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3431 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
|
3432 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
|
3433 Node* bol = _gvn.transform(new (C) BoolNode(cmp, BoolTest::ne)); |
0 | 3434 return generate_fair_guard(bol, region); |
3435 } | |
3436 Node* LibraryCallKit::generate_interface_guard(Node* kls, RegionNode* region) { | |
3437 return generate_access_flags_guard(kls, JVM_ACC_INTERFACE, 0, region); | |
3438 } | |
3439 | |
3440 //-------------------------inline_native_Class_query------------------- | |
3441 bool LibraryCallKit::inline_native_Class_query(vmIntrinsics::ID id) { | |
3442 const Type* return_type = TypeInt::BOOL; | |
3443 Node* prim_return_value = top(); // what happens if it's a primitive class? | |
3444 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
3445 bool expect_prim = false; // most of these guys expect to work on refs | |
3446 | |
3447 enum { _normal_path = 1, _prim_path = 2, PATH_LIMIT }; | |
3448 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3449 Node* mirror = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3450 Node* obj = top(); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3451 |
0 | 3452 switch (id) { |
3453 case vmIntrinsics::_isInstance: | |
3454 // nothing is an instance of a primitive type | |
3455 prim_return_value = intcon(0); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3456 obj = argument(1); |
0 | 3457 break; |
3458 case vmIntrinsics::_getModifiers: | |
3459 prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC); | |
3460 assert(is_power_of_2((int)JVM_ACC_WRITTEN_FLAGS+1), "change next line"); | |
3461 return_type = TypeInt::make(0, JVM_ACC_WRITTEN_FLAGS, Type::WidenMin); | |
3462 break; | |
3463 case vmIntrinsics::_isInterface: | |
3464 prim_return_value = intcon(0); | |
3465 break; | |
3466 case vmIntrinsics::_isArray: | |
3467 prim_return_value = intcon(0); | |
3468 expect_prim = true; // cf. ObjectStreamClass.getClassSignature | |
3469 break; | |
3470 case vmIntrinsics::_isPrimitive: | |
3471 prim_return_value = intcon(1); | |
3472 expect_prim = true; // obviously | |
3473 break; | |
3474 case vmIntrinsics::_getSuperclass: | |
3475 prim_return_value = null(); | |
3476 return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR); | |
3477 break; | |
3478 case vmIntrinsics::_getComponentType: | |
3479 prim_return_value = null(); | |
3480 return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR); | |
3481 break; | |
3482 case vmIntrinsics::_getClassAccessFlags: | |
3483 prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC); | |
3484 return_type = TypeInt::INT; // not bool! 6297094 | |
3485 break; | |
3486 default: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3487 fatal_unexpected_iid(id); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3488 break; |
0 | 3489 } |
3490 | |
3491 const TypeInstPtr* mirror_con = _gvn.type(mirror)->isa_instptr(); | |
3492 if (mirror_con == NULL) return false; // cannot happen? | |
3493 | |
3494 #ifndef PRODUCT | |
12295 | 3495 if (C->print_intrinsics() || C->print_inlining()) { |
0 | 3496 ciType* k = mirror_con->java_mirror_type(); |
3497 if (k) { | |
3498 tty->print("Inlining %s on constant Class ", vmIntrinsics::name_at(intrinsic_id())); | |
3499 k->print_name(); | |
3500 tty->cr(); | |
3501 } | |
3502 } | |
3503 #endif | |
3504 | |
3505 // 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
|
3506 RegionNode* region = new (C) RegionNode(PATH_LIMIT); |
0 | 3507 record_for_igvn(region); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3508 PhiNode* phi = new (C) PhiNode(region, return_type); |
0 | 3509 |
3510 // The mirror will never be null of Reflection.getClassAccessFlags, however | |
3511 // it may be null for Class.isInstance or Class.getModifiers. Throw a NPE | |
3512 // if it is. See bug 4774291. | |
3513 | |
3514 // For Reflection.getClassAccessFlags(), the null check occurs in | |
3515 // the wrong place; see inline_unsafe_access(), above, for a similar | |
3516 // situation. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3517 mirror = null_check(mirror); |
0 | 3518 // If mirror or obj is dead, only null-path is taken. |
3519 if (stopped()) return true; | |
3520 | |
3521 if (expect_prim) never_see_null = false; // expect nulls (meaning prims) | |
3522 | |
3523 // Now load the mirror's klass metaobject, and null-check it. | |
3524 // 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
|
3525 Node* kls = load_klass_from_mirror(mirror, never_see_null, region, _prim_path); |
0 | 3526 // If kls is null, we have a primitive mirror. |
3527 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
|
3528 if (stopped()) { set_result(region, phi); return true; } |
12966 | 3529 bool safe_for_replace = (region->in(_prim_path) == top()); |
0 | 3530 |
3531 Node* p; // handy temp | |
3532 Node* null_ctl; | |
3533 | |
3534 // Now that we have the non-null klass, we can perform the real query. | |
3535 // For constant classes, the query will constant-fold in LoadNode::Value. | |
3536 Node* query_value = top(); | |
3537 switch (id) { | |
3538 case vmIntrinsics::_isInstance: | |
3539 // nothing is an instance of a primitive type | |
12966 | 3540 query_value = gen_instanceof(obj, kls, safe_for_replace); |
0 | 3541 break; |
3542 | |
3543 case vmIntrinsics::_getModifiers: | |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3544 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
|
3545 query_value = make_load(NULL, p, TypeInt::INT, T_INT, MemNode::unordered); |
0 | 3546 break; |
3547 | |
3548 case vmIntrinsics::_isInterface: | |
3549 // (To verify this code sequence, check the asserts in JVM_IsInterface.) | |
3550 if (generate_interface_guard(kls, region) != NULL) | |
3551 // A guard was added. If the guard is taken, it was an interface. | |
3552 phi->add_req(intcon(1)); | |
3553 // If we fall through, it's a plain class. | |
3554 query_value = intcon(0); | |
3555 break; | |
3556 | |
3557 case vmIntrinsics::_isArray: | |
3558 // (To verify this code sequence, check the asserts in JVM_IsArrayClass.) | |
3559 if (generate_array_guard(kls, region) != NULL) | |
3560 // A guard was added. If the guard is taken, it was an array. | |
3561 phi->add_req(intcon(1)); | |
3562 // If we fall through, it's a plain class. | |
3563 query_value = intcon(0); | |
3564 break; | |
3565 | |
3566 case vmIntrinsics::_isPrimitive: | |
3567 query_value = intcon(0); // "normal" path produces false | |
3568 break; | |
3569 | |
3570 case vmIntrinsics::_getSuperclass: | |
3571 // The rules here are somewhat unfortunate, but we can still do better | |
3572 // with random logic than with a JNI call. | |
3573 // Interfaces store null or Object as _super, but must report null. | |
3574 // Arrays store an intermediate super as _super, but must report Object. | |
3575 // Other types can report the actual _super. | |
3576 // (To verify this code sequence, check the asserts in JVM_IsInterface.) | |
3577 if (generate_interface_guard(kls, region) != NULL) | |
3578 // A guard was added. If the guard is taken, it was an interface. | |
3579 phi->add_req(null()); | |
3580 if (generate_array_guard(kls, region) != NULL) | |
3581 // A guard was added. If the guard is taken, it was an array. | |
3582 phi->add_req(makecon(TypeInstPtr::make(env()->Object_klass()->java_mirror()))); | |
3583 // 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
|
3584 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
|
3585 kls = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeRawPtr::BOTTOM, TypeKlassPtr::OBJECT_OR_NULL)); |
0 | 3586 null_ctl = top(); |
3587 kls = null_check_oop(kls, &null_ctl); | |
3588 if (null_ctl != top()) { | |
3589 // If the guard is taken, Object.superClass is null (both klass and mirror). | |
3590 region->add_req(null_ctl); | |
3591 phi ->add_req(null()); | |
3592 } | |
3593 if (!stopped()) { | |
3594 query_value = load_mirror_from_klass(kls); | |
3595 } | |
3596 break; | |
3597 | |
3598 case vmIntrinsics::_getComponentType: | |
3599 if (generate_array_guard(kls, region) != NULL) { | |
3600 // Be sure to pin the oop load to the guard edge just created: | |
3601 Node* is_array_ctrl = region->in(region->req()-1); | |
6831
d8ce2825b193
8000213: NPG: Should have renamed arrayKlass and typeArrayKlass
coleenp
parents:
6804
diff
changeset
|
3602 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
|
3603 Node* cmo = make_load(is_array_ctrl, cma, TypeInstPtr::MIRROR, T_OBJECT, MemNode::unordered); |
0 | 3604 phi->add_req(cmo); |
3605 } | |
3606 query_value = null(); // non-array case is null | |
3607 break; | |
3608 | |
3609 case vmIntrinsics::_getClassAccessFlags: | |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3610 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
|
3611 query_value = make_load(NULL, p, TypeInt::INT, T_INT, MemNode::unordered); |
0 | 3612 break; |
3613 | |
3614 default: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3615 fatal_unexpected_iid(id); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3616 break; |
0 | 3617 } |
3618 | |
3619 // Fall-through is the normal case of a query to a real class. | |
3620 phi->init_req(1, query_value); | |
3621 region->init_req(1, control()); | |
3622 | |
3623 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
|
3624 set_result(region, phi); |
0 | 3625 return true; |
3626 } | |
3627 | |
3628 //--------------------------inline_native_subtype_check------------------------ | |
3629 // This intrinsic takes the JNI calls out of the heart of | |
3630 // UnsafeFieldAccessorImpl.set, which improves Field.set, readObject, etc. | |
3631 bool LibraryCallKit::inline_native_subtype_check() { | |
3632 // Pull both arguments off the stack. | |
3633 Node* args[2]; // two java.lang.Class mirrors: superc, subc | |
3634 args[0] = argument(0); | |
3635 args[1] = argument(1); | |
3636 Node* klasses[2]; // corresponding Klasses: superk, subk | |
3637 klasses[0] = klasses[1] = top(); | |
3638 | |
3639 enum { | |
3640 // A full decision tree on {superc is prim, subc is prim}: | |
3641 _prim_0_path = 1, // {P,N} => false | |
3642 // {P,P} & superc!=subc => false | |
3643 _prim_same_path, // {P,P} & superc==subc => true | |
3644 _prim_1_path, // {N,P} => false | |
3645 _ref_subtype_path, // {N,N} & subtype check wins => true | |
3646 _both_ref_path, // {N,N} & subtype check loses => false | |
3647 PATH_LIMIT | |
3648 }; | |
3649 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3650 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
|
3651 Node* phi = new (C) PhiNode(region, TypeInt::BOOL); |
0 | 3652 record_for_igvn(region); |
3653 | |
3654 const TypePtr* adr_type = TypeRawPtr::BOTTOM; // memory type of loads | |
3655 const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL; | |
3656 int class_klass_offset = java_lang_Class::klass_offset_in_bytes(); | |
3657 | |
3658 // First null-check both mirrors and load each mirror's klass metaobject. | |
3659 int which_arg; | |
3660 for (which_arg = 0; which_arg <= 1; which_arg++) { | |
3661 Node* arg = args[which_arg]; | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3662 arg = null_check(arg); |
0 | 3663 if (stopped()) break; |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
3664 args[which_arg] = arg; |
0 | 3665 |
3666 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
|
3667 Node* kls = LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, adr_type, kls_type); |
0 | 3668 klasses[which_arg] = _gvn.transform(kls); |
3669 } | |
3670 | |
3671 // Having loaded both klasses, test each for null. | |
3672 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
3673 for (which_arg = 0; which_arg <= 1; which_arg++) { | |
3674 Node* kls = klasses[which_arg]; | |
3675 Node* null_ctl = top(); | |
3676 kls = null_check_oop(kls, &null_ctl, never_see_null); | |
3677 int prim_path = (which_arg == 0 ? _prim_0_path : _prim_1_path); | |
3678 region->init_req(prim_path, null_ctl); | |
3679 if (stopped()) break; | |
3680 klasses[which_arg] = kls; | |
3681 } | |
3682 | |
3683 if (!stopped()) { | |
3684 // now we have two reference types, in klasses[0..1] | |
3685 Node* subk = klasses[1]; // the argument to isAssignableFrom | |
3686 Node* superk = klasses[0]; // the receiver | |
3687 region->set_req(_both_ref_path, gen_subtype_check(subk, superk)); | |
3688 // now we have a successful reference subtype check | |
3689 region->set_req(_ref_subtype_path, control()); | |
3690 } | |
3691 | |
3692 // If both operands are primitive (both klasses null), then | |
3693 // we must return true when they are identical primitives. | |
3694 // It is convenient to test this after the first null klass check. | |
3695 set_control(region->in(_prim_0_path)); // go back to first null check | |
3696 if (!stopped()) { | |
3697 // 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
|
3698 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
|
3699 Node* bol_eq = _gvn.transform(new (C) BoolNode(cmp_eq, BoolTest::eq)); |
0 | 3700 generate_guard(bol_eq, region, PROB_FAIR); |
3701 if (region->req() == PATH_LIMIT+1) { | |
3702 // A guard was added. If the added guard is taken, superc==subc. | |
3703 region->swap_edges(PATH_LIMIT, _prim_same_path); | |
3704 region->del_req(PATH_LIMIT); | |
3705 } | |
3706 region->set_req(_prim_0_path, control()); // Not equal after all. | |
3707 } | |
3708 | |
3709 // these are the only paths that produce 'true': | |
3710 phi->set_req(_prim_same_path, intcon(1)); | |
3711 phi->set_req(_ref_subtype_path, intcon(1)); | |
3712 | |
3713 // pull together the cases: | |
3714 assert(region->req() == PATH_LIMIT, "sane region"); | |
3715 for (uint i = 1; i < region->req(); i++) { | |
3716 Node* ctl = region->in(i); | |
3717 if (ctl == NULL || ctl == top()) { | |
3718 region->set_req(i, top()); | |
3719 phi ->set_req(i, top()); | |
3720 } else if (phi->in(i) == NULL) { | |
3721 phi->set_req(i, intcon(0)); // all other paths produce 'false' | |
3722 } | |
3723 } | |
3724 | |
3725 set_control(_gvn.transform(region)); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3726 set_result(_gvn.transform(phi)); |
0 | 3727 return true; |
3728 } | |
3729 | |
3730 //---------------------generate_array_guard_common------------------------ | |
3731 Node* LibraryCallKit::generate_array_guard_common(Node* kls, RegionNode* region, | |
3732 bool obj_array, bool not_array) { | |
3733 // If obj_array/non_array==false/false: | |
3734 // Branch around if the given klass is in fact an array (either obj or prim). | |
3735 // If obj_array/non_array==false/true: | |
3736 // Branch around if the given klass is not an array klass of any kind. | |
3737 // If obj_array/non_array==true/true: | |
3738 // Branch around if the kls is not an oop array (kls is int[], String, etc.) | |
3739 // If obj_array/non_array==true/false: | |
3740 // Branch around if the kls is an oop array (Object[] or subtype) | |
3741 // | |
3742 // Like generate_guard, adds a new path onto the region. | |
3743 jint layout_con = 0; | |
3744 Node* layout_val = get_layout_helper(kls, layout_con); | |
3745 if (layout_val == NULL) { | |
3746 bool query = (obj_array | |
3747 ? Klass::layout_helper_is_objArray(layout_con) | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
3748 : Klass::layout_helper_is_array(layout_con)); |
0 | 3749 if (query == not_array) { |
3750 return NULL; // never a branch | |
3751 } else { // always a branch | |
3752 Node* always_branch = control(); | |
3753 if (region != NULL) | |
3754 region->add_req(always_branch); | |
3755 set_control(top()); | |
3756 return always_branch; | |
3757 } | |
3758 } | |
3759 // Now test the correct condition. | |
3760 jint nval = (obj_array | |
3761 ? ((jint)Klass::_lh_array_tag_type_value | |
3762 << Klass::_lh_array_tag_shift) | |
3763 : Klass::_lh_neutral_value); | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3764 Node* cmp = _gvn.transform(new(C) CmpINode(layout_val, intcon(nval))); |
0 | 3765 BoolTest::mask btest = BoolTest::lt; // correct for testing is_[obj]array |
3766 // invert the test if we are looking for a non-array | |
3767 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
|
3768 Node* bol = _gvn.transform(new(C) BoolNode(cmp, btest)); |
0 | 3769 return generate_fair_guard(bol, region); |
3770 } | |
3771 | |
3772 | |
3773 //-----------------------inline_native_newArray-------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3774 // private static native Object java.lang.reflect.newArray(Class<?> componentType, int length); |
0 | 3775 bool LibraryCallKit::inline_native_newArray() { |
3776 Node* mirror = argument(0); | |
3777 Node* count_val = argument(1); | |
3778 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3779 mirror = null_check(mirror); |
163 | 3780 // If mirror or obj is dead, only null-path is taken. |
3781 if (stopped()) return true; | |
0 | 3782 |
3783 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
|
3784 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
|
3785 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
|
3786 TypeInstPtr::NOTNULL); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3787 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
|
3788 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
|
3789 TypePtr::BOTTOM); |
0 | 3790 |
3791 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
3792 Node* klass_node = load_array_klass_from_mirror(mirror, never_see_null, | |
3793 result_reg, _slow_path); | |
3794 Node* normal_ctl = control(); | |
3795 Node* no_array_ctl = result_reg->in(_slow_path); | |
3796 | |
3797 // Generate code for the slow case. We make a call to newArray(). | |
3798 set_control(no_array_ctl); | |
3799 if (!stopped()) { | |
3800 // Either the input type is void.class, or else the | |
3801 // array klass has not yet been cached. Either the | |
3802 // ensuing call will throw an exception, or else it | |
3803 // will cache the array klass for next time. | |
3804 PreserveJVMState pjvms(this); | |
3805 CallJavaNode* slow_call = generate_method_call_static(vmIntrinsics::_newArray); | |
3806 Node* slow_result = set_results_for_java_call(slow_call); | |
3807 // this->control() comes from set_results_for_java_call | |
3808 result_reg->set_req(_slow_path, control()); | |
3809 result_val->set_req(_slow_path, slow_result); | |
3810 result_io ->set_req(_slow_path, i_o()); | |
3811 result_mem->set_req(_slow_path, reset_memory()); | |
3812 } | |
3813 | |
3814 set_control(normal_ctl); | |
3815 if (!stopped()) { | |
3816 // Normal case: The array type has been cached in the java.lang.Class. | |
3817 // The following call works fine even if the array type is polymorphic. | |
3818 // 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
|
3819 Node* obj = new_array(klass_node, count_val, 0); // no arguments to push |
0 | 3820 result_reg->init_req(_normal_path, control()); |
3821 result_val->init_req(_normal_path, obj); | |
3822 result_io ->init_req(_normal_path, i_o()); | |
3823 result_mem->init_req(_normal_path, reset_memory()); | |
3824 } | |
3825 | |
3826 // Return the combined state. | |
3827 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
|
3828 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
|
3829 |
0 | 3830 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
|
3831 set_result(result_reg, result_val); |
0 | 3832 return true; |
3833 } | |
3834 | |
3835 //----------------------inline_native_getLength-------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3836 // public static native int java.lang.reflect.Array.getLength(Object array); |
0 | 3837 bool LibraryCallKit::inline_native_getLength() { |
3838 if (too_many_traps(Deoptimization::Reason_intrinsic)) return false; | |
3839 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3840 Node* array = null_check(argument(0)); |
0 | 3841 // If array is dead, only null-path is taken. |
3842 if (stopped()) return true; | |
3843 | |
3844 // Deoptimize if it is a non-array. | |
3845 Node* non_array = generate_non_array_guard(load_object_klass(array), NULL); | |
3846 | |
3847 if (non_array != NULL) { | |
3848 PreserveJVMState pjvms(this); | |
3849 set_control(non_array); | |
3850 uncommon_trap(Deoptimization::Reason_intrinsic, | |
3851 Deoptimization::Action_maybe_recompile); | |
3852 } | |
3853 | |
3854 // If control is dead, only non-array-path is taken. | |
3855 if (stopped()) return true; | |
3856 | |
3857 // The works fine even if the array type is polymorphic. | |
3858 // 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
|
3859 Node* result = load_array_length(array); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3860 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3861 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
|
3862 set_result(result); |
0 | 3863 return true; |
3864 } | |
3865 | |
3866 //------------------------inline_array_copyOf---------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3867 // 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
|
3868 // public static <T,U> T[] java.util.Arrays.copyOfRange(U[] original, int from, int to, Class<? extends T[]> newType); |
0 | 3869 bool LibraryCallKit::inline_array_copyOf(bool is_copyOfRange) { |
3870 if (too_many_traps(Deoptimization::Reason_intrinsic)) return false; | |
3871 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3872 // Get the arguments. |
0 | 3873 Node* original = argument(0); |
3874 Node* start = is_copyOfRange? argument(1): intcon(0); | |
3875 Node* end = is_copyOfRange? argument(2): argument(1); | |
3876 Node* array_type_mirror = is_copyOfRange? argument(3): argument(2); | |
3877 | |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3878 Node* newcopy; |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3879 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3880 // 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
|
3881 // 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
|
3882 { PreserveReexecuteState preexecs(this); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3883 jvms()->set_should_reexecute(true); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3884 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3885 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
|
3886 original = null_check(original); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3887 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3888 // Check if a null path was taken unconditionally. |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3889 if (stopped()) return true; |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3890 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3891 Node* orig_length = load_array_length(original); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3892 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3893 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
|
3894 klass_node = null_check(klass_node); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3895 |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3896 RegionNode* bailout = new (C) RegionNode(1); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3897 record_for_igvn(bailout); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3898 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3899 // 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
|
3900 // Bail out if that is so. |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3901 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
|
3902 if (not_objArray != NULL) { |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3903 // 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
|
3904 ciKlass* ak = ciArrayKlass::make(env()->Object_klass()); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3905 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
|
3906 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
|
3907 cast->init_req(0, control()); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3908 klass_node = _gvn.transform(cast); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3909 } |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3910 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3911 // 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
|
3912 generate_negative_guard(start, bailout, &start); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3913 generate_negative_guard(end, bailout, &end); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3914 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3915 Node* length = end; |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3916 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
|
3917 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
|
3918 } |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3919 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3920 // 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
|
3921 // 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
|
3922 // 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
|
3923 // should be thrown |
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3924 generate_negative_guard(length, bailout, &length); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3925 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3926 if (bailout->req() > 1) { |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3927 PreserveJVMState pjvms(this); |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3928 set_control(_gvn.transform(bailout)); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3929 uncommon_trap(Deoptimization::Reason_intrinsic, |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3930 Deoptimization::Action_maybe_recompile); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3931 } |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3932 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3933 if (!stopped()) { |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3934 // 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
|
3935 // 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
|
3936 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
|
3937 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
|
3938 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3939 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
|
3940 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3941 // 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
|
3942 // 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
|
3943 // oop stores need checking. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3944 // 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
|
3945 // 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
|
3946 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
|
3947 // 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
|
3948 // negative. |
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3949 bool length_never_negative = !is_copyOfRange; |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3950 generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3951 original, start, newcopy, intcon(0), moved, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3952 disjoint_bases, length_never_negative); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3953 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3954 } // original reexecute is set back here |
0 | 3955 |
3956 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
|
3957 if (!stopped()) { |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3958 set_result(newcopy); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3959 } |
0 | 3960 return true; |
3961 } | |
3962 | |
3963 | |
3964 //----------------------generate_virtual_guard--------------------------- | |
3965 // Helper for hashCode and clone. Peeks inside the vtable to avoid a call. | |
3966 Node* LibraryCallKit::generate_virtual_guard(Node* obj_klass, | |
3967 RegionNode* slow_region) { | |
3968 ciMethod* method = callee(); | |
3969 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
|
3970 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
|
3971 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
|
3972 // 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
|
3973 int entry_offset = (InstanceKlass::vtable_start_offset() + |
0 | 3974 vtable_index*vtableEntry::size()) * wordSize + |
3975 vtableEntry::method_offset_in_bytes(); | |
3976 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
|
3977 Node* target_call = make_load(NULL, entry_addr, TypePtr::NOTNULL, T_ADDRESS, MemNode::unordered); |
0 | 3978 |
3979 // 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
|
3980 const TypePtr* native_call_addr = TypeMetadataPtr::make(method); |
0 | 3981 |
3982 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
|
3983 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
|
3984 Node* test_native = _gvn.transform(new(C) BoolNode(chk_native, BoolTest::ne)); |
0 | 3985 |
3986 return generate_slow_guard(test_native, slow_region); | |
3987 } | |
3988 | |
3989 //-----------------------generate_method_call---------------------------- | |
3990 // Use generate_method_call to make a slow-call to the real | |
3991 // method if the fast path fails. An alternative would be to | |
3992 // use a stub like OptoRuntime::slow_arraycopy_Java. | |
3993 // This only works for expanding the current library call, | |
3994 // not another intrinsic. (E.g., don't use this for making an | |
3995 // arraycopy call inside of the copyOf intrinsic.) | |
3996 CallJavaNode* | |
3997 LibraryCallKit::generate_method_call(vmIntrinsics::ID method_id, bool is_virtual, bool is_static) { | |
3998 // When compiling the intrinsic method itself, do not use this technique. | |
3999 guarantee(callee() != C->method(), "cannot make slow-call to self"); | |
4000 | |
4001 ciMethod* method = callee(); | |
4002 // ensure the JVMS we have will be correct for this call | |
4003 guarantee(method_id == method->intrinsic_id(), "must match"); | |
4004 | |
4005 const TypeFunc* tf = TypeFunc::make(method); | |
4006 CallJavaNode* slow_call; | |
4007 if (is_static) { | |
4008 assert(!is_virtual, ""); | |
10278 | 4009 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
|
4010 SharedRuntime::get_resolve_static_call_stub(), |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4011 method, bci()); |
0 | 4012 } else if (is_virtual) { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4013 null_check_receiver(); |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4014 int vtable_index = Method::invalid_vtable_index; |
0 | 4015 if (UseInlineCaches) { |
4016 // Suppress the vtable call | |
4017 } else { | |
4018 // hashCode and clone are not a miranda methods, | |
4019 // so the vtable index is fixed. | |
4020 // No need to use the linkResolver to get it. | |
4021 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
|
4022 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
|
4023 err_msg_res("bad index %d", vtable_index)); |
0 | 4024 } |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4025 slow_call = new(C) CallDynamicJavaNode(tf, |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4026 SharedRuntime::get_resolve_virtual_call_stub(), |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4027 method, vtable_index, bci()); |
0 | 4028 } 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
|
4029 null_check_receiver(); |
10278 | 4030 slow_call = new(C) CallStaticJavaNode(C, tf, |
0 | 4031 SharedRuntime::get_resolve_opt_virtual_call_stub(), |
4032 method, bci()); | |
4033 slow_call->set_optimized_virtual(true); | |
4034 } | |
4035 set_arguments_for_java_call(slow_call); | |
4036 set_edges_for_java_call(slow_call); | |
4037 return slow_call; | |
4038 } | |
4039 | |
4040 | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4041 /** |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4042 * 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
|
4043 * 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
|
4044 * slightly different code. |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4045 */ |
0 | 4046 bool LibraryCallKit::inline_native_hashcode(bool is_virtual, bool is_static) { |
4047 assert(is_static == callee()->is_static(), "correct intrinsic selection"); | |
4048 assert(!(is_virtual && is_static), "either virtual, special, or static"); | |
4049 | |
4050 enum { _slow_path = 1, _fast_path, _null_path, PATH_LIMIT }; | |
4051 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4052 RegionNode* result_reg = new(C) RegionNode(PATH_LIMIT); |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4053 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
|
4054 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
|
4055 PhiNode* result_mem = new(C) PhiNode(result_reg, Type::MEMORY, TypePtr::BOTTOM); |
0 | 4056 Node* obj = NULL; |
4057 if (!is_static) { | |
4058 // Check for hashing null object | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4059 obj = null_check_receiver(); |
0 | 4060 if (stopped()) return true; // unconditionally null |
4061 result_reg->init_req(_null_path, top()); | |
4062 result_val->init_req(_null_path, top()); | |
4063 } else { | |
4064 // Do a null check, and return zero if null. | |
4065 // System.identityHashCode(null) == 0 | |
4066 obj = argument(0); | |
4067 Node* null_ctl = top(); | |
4068 obj = null_check_oop(obj, &null_ctl); | |
4069 result_reg->init_req(_null_path, null_ctl); | |
4070 result_val->init_req(_null_path, _gvn.intcon(0)); | |
4071 } | |
4072 | |
4073 // Unconditionally null? Then return right away. | |
4074 if (stopped()) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4075 set_control( result_reg->in(_null_path)); |
0 | 4076 if (!stopped()) |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4077 set_result(result_val->in(_null_path)); |
0 | 4078 return true; |
4079 } | |
4080 | |
4081 // We only go to the fast case code if we pass a number of guards. The | |
4082 // 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
|
4083 RegionNode* slow_region = new (C) RegionNode(1); |
0 | 4084 record_for_igvn(slow_region); |
4085 | |
4086 // If this is a virtual call, we generate a funny guard. We pull out | |
4087 // the vtable entry corresponding to hashCode() from the target object. | |
4088 // If the target method which we are calling happens to be the native | |
4089 // Object hashCode() method, we pass the guard. We do not need this | |
4090 // guard for non-virtual calls -- the caller is known to be the native | |
4091 // Object hashCode(). | |
4092 if (is_virtual) { | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4093 // After null check, get the object's klass. |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4094 Node* obj_klass = load_object_klass(obj); |
0 | 4095 generate_virtual_guard(obj_klass, slow_region); |
4096 } | |
4097 | |
4098 // Get the header out of the object, use LoadMarkNode when available | |
4099 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
|
4100 // 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
|
4101 // the null check after castPP removal. |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4102 Node* no_ctrl = NULL; |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4103 Node* header = make_load(no_ctrl, header_addr, TypeX_X, TypeX_X->basic_type(), MemNode::unordered); |
0 | 4104 |
4105 // Test the header to see if it is unlocked. | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4106 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
|
4107 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
|
4108 Node* unlocked_val = _gvn.MakeConX(markOopDesc::unlocked_value); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4109 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
|
4110 Node* test_unlocked = _gvn.transform(new (C) BoolNode( chk_unlocked, BoolTest::ne)); |
0 | 4111 |
4112 generate_slow_guard(test_unlocked, slow_region); | |
4113 | |
4114 // Get the hash value and check to see that it has been properly assigned. | |
4115 // We depend on hash_mask being at most 32 bits and avoid the use of | |
4116 // hash_mask_in_place because it could be larger than 32 bits in a 64-bit | |
4117 // vm: see markOop.hpp. | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4118 Node* hash_mask = _gvn.intcon(markOopDesc::hash_mask); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4119 Node* hash_shift = _gvn.intcon(markOopDesc::hash_shift); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4120 Node* hshifted_header= _gvn.transform(new (C) URShiftXNode(header, hash_shift)); |
0 | 4121 // This hack lets the hash bits live anywhere in the mark object now, as long |
605 | 4122 // as the shift drops the relevant bits into the low 32 bits. Note that |
0 | 4123 // Java spec says that HashCode is an int so there's no point in capturing |
4124 // an 'X'-sized hashcode (32 in 32-bit build or 64 in 64-bit build). | |
4125 hshifted_header = ConvX2I(hshifted_header); | |
17968
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4126 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
|
4127 |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4128 Node* no_hash_val = _gvn.intcon(markOopDesc::no_hash); |
dbf0d88d867d
8011646: SEGV in compiled code with loop predication
anoll
parents:
17923
diff
changeset
|
4129 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
|
4130 Node* test_assigned = _gvn.transform(new (C) BoolNode( chk_assigned, BoolTest::eq)); |
0 | 4131 |
4132 generate_slow_guard(test_assigned, slow_region); | |
4133 | |
4134 Node* init_mem = reset_memory(); | |
4135 // fill in the rest of the null path: | |
4136 result_io ->init_req(_null_path, i_o()); | |
4137 result_mem->init_req(_null_path, init_mem); | |
4138 | |
4139 result_val->init_req(_fast_path, hash_val); | |
4140 result_reg->init_req(_fast_path, control()); | |
4141 result_io ->init_req(_fast_path, i_o()); | |
4142 result_mem->init_req(_fast_path, init_mem); | |
4143 | |
4144 // Generate code for the slow case. We make a call to hashCode(). | |
4145 set_control(_gvn.transform(slow_region)); | |
4146 if (!stopped()) { | |
4147 // No need for PreserveJVMState, because we're using up the present state. | |
4148 set_all_memory(init_mem); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4149 vmIntrinsics::ID hashCode_id = is_static ? vmIntrinsics::_identityHashCode : vmIntrinsics::_hashCode; |
0 | 4150 CallJavaNode* slow_call = generate_method_call(hashCode_id, is_virtual, is_static); |
4151 Node* slow_result = set_results_for_java_call(slow_call); | |
4152 // this->control() comes from set_results_for_java_call | |
4153 result_reg->init_req(_slow_path, control()); | |
4154 result_val->init_req(_slow_path, slow_result); | |
4155 result_io ->set_req(_slow_path, i_o()); | |
4156 result_mem ->set_req(_slow_path, reset_memory()); | |
4157 } | |
4158 | |
4159 // Return the combined state. | |
4160 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
|
4161 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
|
4162 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4163 set_result(result_reg, result_val); |
0 | 4164 return true; |
4165 } | |
4166 | |
4167 //---------------------------inline_native_getClass---------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4168 // 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
|
4169 // |
605 | 4170 // Build special case code for calls to getClass on an object. |
0 | 4171 bool LibraryCallKit::inline_native_getClass() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4172 Node* obj = null_check_receiver(); |
0 | 4173 if (stopped()) return true; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4174 set_result(load_mirror_from_klass(load_object_klass(obj))); |
0 | 4175 return true; |
4176 } | |
4177 | |
4178 //-----------------inline_native_Reflection_getCallerClass--------------------- | |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4179 // 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
|
4180 // |
0 | 4181 // In the presence of deep enough inlining, getCallerClass() becomes a no-op. |
4182 // | |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4183 // 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
|
4184 // 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
|
4185 // caller sensitive methods. |
0 | 4186 bool LibraryCallKit::inline_native_Reflection_getCallerClass() { |
4187 #ifndef PRODUCT | |
12295 | 4188 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
0 | 4189 tty->print_cr("Attempting to inline sun.reflect.Reflection.getCallerClass"); |
4190 } | |
4191 #endif | |
4192 | |
4193 if (!jvms()->has_method()) { | |
4194 #ifndef PRODUCT | |
12295 | 4195 if ((C->print_intrinsics() || C->print_inlining()) && Verbose) { |
0 | 4196 tty->print_cr(" Bailing out because intrinsic was inlined at top level"); |
4197 } | |
4198 #endif | |
4199 return false; | |
4200 } | |
4201 | |
4202 // 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
|
4203 // depth. |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4204 JVMState* caller_jvms = jvms(); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4205 |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4206 // Cf. JVM_GetCallerClass |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4207 // 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
|
4208 // not include the Reflection.getCallerClass() frame. |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4209 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
|
4210 ciMethod* m = caller_jvms->method(); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4211 switch (n) { |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4212 case 0: |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4213 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
|
4214 break; |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4215 case 1: |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4216 // 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
|
4217 if (!m->caller_sensitive()) { |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4218 #ifndef PRODUCT |
12295 | 4219 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
|
4220 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
|
4221 } |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4222 #endif |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4223 return false; // bail-out; let JVM_GetCallerClass do the work |
0 | 4224 } |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4225 break; |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4226 default: |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4227 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
|
4228 // 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
|
4229 // 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
|
4230 ciInstanceKlass* caller_klass = caller_jvms->method()->holder(); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4231 ciInstance* caller_mirror = caller_klass->java_mirror(); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4232 set_result(makecon(TypeInstPtr::make(caller_mirror))); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4233 |
0 | 4234 #ifndef PRODUCT |
12295 | 4235 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
|
4236 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
|
4237 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
|
4238 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
|
4239 ciMethod* m = jvms()->of_depth(i)->method(); |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4240 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
|
4241 } |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4242 } |
0 | 4243 #endif |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4244 return true; |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4245 } |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4246 break; |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4247 } |
0 | 4248 } |
4249 | |
4250 #ifndef PRODUCT | |
12295 | 4251 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
|
4252 tty->print_cr(" Bailing out because caller depth exceeded inlining depth = %d", jvms()->depth()); |
0 | 4253 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
|
4254 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
|
4255 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
|
4256 tty->print_cr(" %d) %s.%s", n, m->holder()->name()->as_utf8(), m->name()->as_utf8()); |
0 | 4257 } |
4258 } | |
4259 #endif | |
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4260 |
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4261 return false; // bail-out; let JVM_GetCallerClass do the work |
0 | 4262 } |
4263 | |
4264 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
|
4265 Node* arg = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4266 Node* result; |
0 | 4267 |
4268 switch (id) { | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4269 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
|
4270 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
|
4271 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
|
4272 case vmIntrinsics::_longBitsToDouble: result = new (C) MoveL2DNode(arg); break; |
0 | 4273 |
4274 case vmIntrinsics::_doubleToLongBits: { | |
4275 // 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
|
4276 RegionNode *r = new (C) RegionNode(3); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4277 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
|
4278 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4279 Node *cmpisnan = _gvn.transform(new (C) CmpDNode(arg, arg)); |
0 | 4280 // Build the boolean node |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4281 Node *bolisnan = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::ne)); |
0 | 4282 |
4283 // Branch either way. | |
4284 // NaN case is less traveled, which makes all the difference. | |
4285 IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
4286 Node *opt_isnan = _gvn.transform(ifisnan); | |
4287 assert( opt_isnan->is_If(), "Expect an IfNode"); | |
4288 IfNode *opt_ifisnan = (IfNode*)opt_isnan; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4289 Node *iftrue = _gvn.transform(new (C) IfTrueNode(opt_ifisnan)); |
0 | 4290 |
4291 set_control(iftrue); | |
4292 | |
4293 static const jlong nan_bits = CONST64(0x7ff8000000000000); | |
4294 Node *slow_result = longcon(nan_bits); // return NaN | |
4295 phi->init_req(1, _gvn.transform( slow_result )); | |
4296 r->init_req(1, iftrue); | |
4297 | |
4298 // Else fall through | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4299 Node *iffalse = _gvn.transform(new (C) IfFalseNode(opt_ifisnan)); |
0 | 4300 set_control(iffalse); |
4301 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4302 phi->init_req(2, _gvn.transform(new (C) MoveD2LNode(arg))); |
0 | 4303 r->init_req(2, iffalse); |
4304 | |
4305 // Post merge | |
4306 set_control(_gvn.transform(r)); | |
4307 record_for_igvn(r); | |
4308 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4309 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
|
4310 result = phi; |
0 | 4311 assert(result->bottom_type()->isa_long(), "must be"); |
4312 break; | |
4313 } | |
4314 | |
4315 case vmIntrinsics::_floatToIntBits: { | |
4316 // 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
|
4317 RegionNode *r = new (C) RegionNode(3); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4318 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
|
4319 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4320 Node *cmpisnan = _gvn.transform(new (C) CmpFNode(arg, arg)); |
0 | 4321 // Build the boolean node |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4322 Node *bolisnan = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::ne)); |
0 | 4323 |
4324 // Branch either way. | |
4325 // NaN case is less traveled, which makes all the difference. | |
4326 IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
4327 Node *opt_isnan = _gvn.transform(ifisnan); | |
4328 assert( opt_isnan->is_If(), "Expect an IfNode"); | |
4329 IfNode *opt_ifisnan = (IfNode*)opt_isnan; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4330 Node *iftrue = _gvn.transform(new (C) IfTrueNode(opt_ifisnan)); |
0 | 4331 |
4332 set_control(iftrue); | |
4333 | |
4334 static const jint nan_bits = 0x7fc00000; | |
4335 Node *slow_result = makecon(TypeInt::make(nan_bits)); // return NaN | |
4336 phi->init_req(1, _gvn.transform( slow_result )); | |
4337 r->init_req(1, iftrue); | |
4338 | |
4339 // Else fall through | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4340 Node *iffalse = _gvn.transform(new (C) IfFalseNode(opt_ifisnan)); |
0 | 4341 set_control(iffalse); |
4342 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4343 phi->init_req(2, _gvn.transform(new (C) MoveF2INode(arg))); |
0 | 4344 r->init_req(2, iffalse); |
4345 | |
4346 // Post merge | |
4347 set_control(_gvn.transform(r)); | |
4348 record_for_igvn(r); | |
4349 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4350 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
|
4351 result = phi; |
0 | 4352 assert(result->bottom_type()->isa_int(), "must be"); |
4353 break; | |
4354 } | |
4355 | |
4356 default: | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4357 fatal_unexpected_iid(id); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4358 break; |
0 | 4359 } |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4360 set_result(_gvn.transform(result)); |
0 | 4361 return true; |
4362 } | |
4363 | |
4364 #ifdef _LP64 | |
4365 #define XTOP ,top() /*additional argument*/ | |
4366 #else //_LP64 | |
4367 #define XTOP /*no additional argument*/ | |
4368 #endif //_LP64 | |
4369 | |
4370 //----------------------inline_unsafe_copyMemory------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4371 // public native void sun.misc.Unsafe.copyMemory(Object srcBase, long srcOffset, Object destBase, long destOffset, long bytes); |
0 | 4372 bool LibraryCallKit::inline_unsafe_copyMemory() { |
4373 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
|
4374 null_check_receiver(); // null-check receiver |
0 | 4375 if (stopped()) return true; |
4376 | |
4377 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
4378 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4379 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
|
4380 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
|
4381 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
|
4382 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
|
4383 Node* size = ConvL2X(argument(7)); // type: long |
0 | 4384 |
4385 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
4386 "fieldOffset must be byte-scaled"); | |
4387 | |
4388 Node* src = make_unsafe_address(src_ptr, src_off); | |
4389 Node* dst = make_unsafe_address(dst_ptr, dst_off); | |
4390 | |
4391 // Conservatively insert a memory barrier on all memory slices. | |
4392 // Do not let writes of the copy source or destination float below the copy. | |
4393 insert_mem_bar(Op_MemBarCPUOrder); | |
4394 | |
4395 // Call it. Note that the length argument is not scaled. | |
4396 make_runtime_call(RC_LEAF|RC_NO_FP, | |
4397 OptoRuntime::fast_arraycopy_Type(), | |
4398 StubRoutines::unsafe_arraycopy(), | |
4399 "unsafe_arraycopy", | |
4400 TypeRawPtr::BOTTOM, | |
4401 src, dst, size XTOP); | |
4402 | |
4403 // Do not let reads of the copy destination float above the copy. | |
4404 insert_mem_bar(Op_MemBarCPUOrder); | |
4405 | |
4406 return true; | |
4407 } | |
4408 | |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4409 //------------------------clone_coping----------------------------------- |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4410 // 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
|
4411 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
|
4412 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
|
4413 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
|
4414 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
|
4415 |
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4416 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
|
4417 if (ReduceBulkZeroing) { |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4418 // 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
|
4419 // mark Initialize node as complete. |
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4420 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
|
4421 // 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
|
4422 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
|
4423 // 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
|
4424 // 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
|
4425 // 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
|
4426 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
|
4427 } |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4428 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4429 // 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
|
4430 // 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
|
4431 Node* src = obj; |
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4432 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
|
4433 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
|
4434 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4435 // 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
|
4436 // 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
|
4437 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
|
4438 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
|
4439 // base_off: |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4440 // 8 - 32-bit VM |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4441 // 12 - 64-bit VM, compressed klass |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4442 // 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
|
4443 if (base_off % BytesPerLong != 0) { |
12226
7944aba7ba41
8015107: NPG: Use consistent naming for metaspace concepts
ehelin
parents:
12169
diff
changeset
|
4444 assert(UseCompressedClassPointers, ""); |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4445 if (is_array) { |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4446 // 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
|
4447 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
|
4448 } else { |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4449 // 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
|
4450 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
|
4451 } |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4452 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
|
4453 } |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4454 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
|
4455 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
|
4456 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4457 // 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
|
4458 Node* countx = size; |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4459 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
|
4460 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
|
4461 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4462 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
|
4463 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
|
4464 generate_unchecked_arraycopy(raw_adr_type, T_LONG, disjoint_bases, |
2324 | 4465 src, NULL, dest, NULL, countx, |
4466 /*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
|
4467 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4468 // 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
|
4469 if (card_mark) { |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4470 assert(!is_array, ""); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4471 // 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
|
4472 // 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
|
4473 // 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
|
4474 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
|
4475 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
|
4476 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
|
4477 post_barrier(control(), |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4478 memory(raw_adr_type), |
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4479 alloc_obj, |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4480 no_particular_field, |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4481 raw_adr_idx, |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4482 no_particular_value, |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4483 T_OBJECT, |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4484 false); |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4485 } |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4486 |
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4487 // 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
|
4488 if (alloc != NULL) { |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4489 // 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
|
4490 // 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
|
4491 // other threads. |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4492 // 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
|
4493 // 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
|
4494 // AllocateNode and eliminate the MemBarStoreStoreNode if possible |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4495 // 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
|
4496 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
|
4497 } else { |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4498 insert_mem_bar(Op_MemBarCPUOrder); |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4499 } |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4500 } |
0 | 4501 |
4502 //------------------------inline_native_clone---------------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4503 // 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
|
4504 // |
0 | 4505 // Here are the simple edge cases: |
4506 // null receiver => normal trap | |
4507 // virtual and clone was overridden => slow path to out-of-line clone | |
4508 // not cloneable or finalizer => slow path to out-of-line Object.clone | |
4509 // | |
4510 // The general case has two steps, allocation and copying. | |
4511 // Allocation has two cases, and uses GraphKit::new_instance or new_array. | |
4512 // | |
4513 // Copying also has two cases, oop arrays and everything else. | |
4514 // Oop arrays use arrayof_oop_arraycopy (same as System.arraycopy). | |
4515 // Everything else uses the tight inline loop supplied by CopyArrayNode. | |
4516 // | |
4517 // These steps fold up nicely if and when the cloned object's klass | |
4518 // can be sharply typed as an object array, a type array, or an instance. | |
4519 // | |
4520 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
|
4521 PhiNode* result_val; |
0 | 4522 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4523 // 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
|
4524 // 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
|
4525 { PreserveReexecuteState preexecs(this); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4526 jvms()->set_should_reexecute(true); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4527 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4528 Node* obj = null_check_receiver(); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4529 if (stopped()) return true; |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4530 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4531 Node* obj_klass = load_object_klass(obj); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4532 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
|
4533 const TypeOopPtr* toop = ((tklass != NULL) |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4534 ? tklass->as_instance_type() |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4535 : TypeInstPtr::NOTNULL); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4536 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4537 // 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
|
4538 // 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
|
4539 insert_mem_bar(Op_MemBarCPUOrder); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4540 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4541 // paths into result_reg: |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4542 enum { |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4543 _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
|
4544 _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
|
4545 _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
|
4546 _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
|
4547 PATH_LIMIT |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4548 }; |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4549 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
|
4550 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
|
4551 TypeInstPtr::NOTNULL); |
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4552 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
|
4553 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
|
4554 TypePtr::BOTTOM); |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4555 record_for_igvn(result_reg); |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4556 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4557 const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM; |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4558 int raw_adr_idx = Compile::AliasIdxRaw; |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4559 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4560 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
|
4561 if (array_ctl != NULL) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4562 // It's an array. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4563 PreserveJVMState pjvms(this); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4564 set_control(array_ctl); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4565 Node* obj_length = load_array_length(obj); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4566 Node* obj_size = NULL; |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4567 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
|
4568 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4569 if (!use_ReduceInitialCardMarks()) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4570 // 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
|
4571 // 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
|
4572 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
|
4573 if (is_obja != NULL) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4574 PreserveJVMState pjvms2(this); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4575 set_control(is_obja); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4576 // 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
|
4577 bool disjoint_bases = true; |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4578 bool length_never_negative = true; |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4579 generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4580 obj, intcon(0), alloc_obj, intcon(0), |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4581 obj_length, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4582 disjoint_bases, length_never_negative); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4583 result_reg->init_req(_objArray_path, control()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4584 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
|
4585 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
|
4586 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
|
4587 } |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4588 } |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4589 // 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
|
4590 // (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
|
4591 // comes out of eden (TLAB)... In fact, ReduceInitialCardMarks |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4592 // 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
|
4593 // simulate a fresh allocation, so that no further |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4594 // 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
|
4595 // the object.) |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4596 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4597 if (!stopped()) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4598 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
|
4599 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4600 // Present the results of the copy. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4601 result_reg->init_req(_array_path, control()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4602 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
|
4603 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
|
4604 result_mem ->set_req(_array_path, reset_memory()); |
0 | 4605 } |
4606 } | |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4607 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4608 // 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
|
4609 // 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
|
4610 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
|
4611 record_for_igvn(slow_region); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4612 if (!stopped()) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4613 // 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
|
4614 // 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
|
4615 // 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
|
4616 // 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
|
4617 // 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
|
4618 // 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
|
4619 // Object clone(). |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4620 if (is_virtual) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4621 generate_virtual_guard(obj_klass, slow_region); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4622 } |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4623 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4624 // 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
|
4625 // 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
|
4626 // 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
|
4627 generate_access_flags_guard(obj_klass, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4628 // Test both conditions: |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4629 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
|
4630 // Must be cloneable but not finalizer: |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4631 JVM_ACC_IS_CLONEABLE, |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4632 slow_region); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4633 } |
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4634 |
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4635 if (!stopped()) { |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4636 // 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
|
4637 PreserveJVMState pjvms(this); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4638 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
|
4639 // 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
|
4640 // 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
|
4641 // 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
|
4642 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
|
4643 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4644 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
|
4645 |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4646 // Present the results of the slow call. |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4647 result_reg->init_req(_instance_path, control()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4648 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
|
4649 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
|
4650 result_mem ->set_req(_instance_path, reset_memory()); |
0 | 4651 } |
4652 | |
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4653 // 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
|
4654 set_control(_gvn.transform(slow_region)); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4655 if (!stopped()) { |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4656 PreserveJVMState pjvms(this); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4657 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
|
4658 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
|
4659 // 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
|
4660 result_reg->init_req(_slow_path, control()); |
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4661 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
|
4662 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
|
4663 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
|
4664 } |
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4665 |
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4666 // Return the combined state. |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4667 set_control( _gvn.transform(result_reg)); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4668 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
|
4669 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
|
4670 } // original reexecute is set back here |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4671 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4672 set_result(_gvn.transform(result_val)); |
0 | 4673 return true; |
4674 } | |
4675 | |
4676 //------------------------------basictype2arraycopy---------------------------- | |
4677 address LibraryCallKit::basictype2arraycopy(BasicType t, | |
4678 Node* src_offset, | |
4679 Node* dest_offset, | |
4680 bool disjoint_bases, | |
2324 | 4681 const char* &name, |
4682 bool dest_uninitialized) { | |
0 | 4683 const TypeInt* src_offset_inttype = gvn().find_int_type(src_offset);; |
4684 const TypeInt* dest_offset_inttype = gvn().find_int_type(dest_offset);; | |
4685 | |
4686 bool aligned = false; | |
4687 bool disjoint = disjoint_bases; | |
4688 | |
4689 // if the offsets are the same, we can treat the memory regions as | |
4690 // disjoint, because either the memory regions are in different arrays, | |
4691 // or they are identical (which we can treat as disjoint.) We can also | |
4692 // treat a copy with a destination index less that the source index | |
4693 // as disjoint since a low->high copy will work correctly in this case. | |
4694 if (src_offset_inttype != NULL && src_offset_inttype->is_con() && | |
4695 dest_offset_inttype != NULL && dest_offset_inttype->is_con()) { | |
4696 // both indices are constants | |
4697 int s_offs = src_offset_inttype->get_con(); | |
4698 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
|
4699 int element_size = type2aelembytes(t); |
0 | 4700 aligned = ((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) && |
4701 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0); | |
4702 if (s_offs >= d_offs) disjoint = true; | |
4703 } else if (src_offset == dest_offset && src_offset != NULL) { | |
4704 // This can occur if the offsets are identical non-constants. | |
4705 disjoint = true; | |
4706 } | |
4707 | |
2446 | 4708 return StubRoutines::select_arraycopy_function(t, aligned, disjoint, name, dest_uninitialized); |
0 | 4709 } |
4710 | |
4711 | |
4712 //------------------------------inline_arraycopy----------------------- | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4713 // 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
|
4714 // Object dest, int destPos, |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4715 // int length); |
0 | 4716 bool LibraryCallKit::inline_arraycopy() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4717 // Get the arguments. |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4718 Node* src = argument(0); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4719 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
|
4720 Node* dest = argument(2); // type: oop |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4721 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
|
4722 Node* length = argument(4); // type: int |
0 | 4723 |
4724 // Compile time checks. If any of these checks cannot be verified at compile time, | |
4725 // we do not make a fast path for this call. Instead, we let the call remain as it | |
4726 // is. The checks we choose to mandate at compile time are: | |
4727 // | |
4728 // (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
|
4729 const Type* src_type = src->Value(&_gvn); |
0 | 4730 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
|
4731 const TypeAryPtr* top_src = src_type->isa_aryptr(); |
0 | 4732 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); |
12966 | 4733 |
4734 // Do we have the type of src? | |
4735 bool has_src = (top_src != NULL && top_src->klass() != NULL); | |
4736 // Do we have the type of dest? | |
4737 bool has_dest = (top_dest != NULL && top_dest->klass() != NULL); | |
4738 // Is the type for src from speculation? | |
4739 bool src_spec = false; | |
4740 // Is the type for dest from speculation? | |
4741 bool dest_spec = false; | |
4742 | |
4743 if (!has_src || !has_dest) { | |
4744 // We don't have sufficient type information, let's see if | |
4745 // speculative types can help. We need to have types for both src | |
4746 // and dest so that it pays off. | |
4747 | |
4748 // Do we already have or could we have type information for src | |
4749 bool could_have_src = has_src; | |
4750 // Do we already have or could we have type information for dest | |
4751 bool could_have_dest = has_dest; | |
4752 | |
4753 ciKlass* src_k = NULL; | |
4754 if (!has_src) { | |
4755 src_k = src_type->speculative_type(); | |
4756 if (src_k != NULL && src_k->is_array_klass()) { | |
4757 could_have_src = true; | |
4758 } | |
4759 } | |
4760 | |
4761 ciKlass* dest_k = NULL; | |
4762 if (!has_dest) { | |
4763 dest_k = dest_type->speculative_type(); | |
4764 if (dest_k != NULL && dest_k->is_array_klass()) { | |
4765 could_have_dest = true; | |
4766 } | |
4767 } | |
4768 | |
4769 if (could_have_src && could_have_dest) { | |
4770 // This is going to pay off so emit the required guards | |
4771 if (!has_src) { | |
4772 src = maybe_cast_profiled_obj(src, src_k); | |
4773 src_type = _gvn.type(src); | |
4774 top_src = src_type->isa_aryptr(); | |
4775 has_src = (top_src != NULL && top_src->klass() != NULL); | |
4776 src_spec = true; | |
4777 } | |
4778 if (!has_dest) { | |
4779 dest = maybe_cast_profiled_obj(dest, dest_k); | |
4780 dest_type = _gvn.type(dest); | |
4781 top_dest = dest_type->isa_aryptr(); | |
4782 has_dest = (top_dest != NULL && top_dest->klass() != NULL); | |
4783 dest_spec = true; | |
4784 } | |
4785 } | |
4786 } | |
4787 | |
4788 if (!has_src || !has_dest) { | |
0 | 4789 // Conservatively insert a memory barrier on all memory slices. |
4790 // Do not let writes into the source float below the arraycopy. | |
4791 insert_mem_bar(Op_MemBarCPUOrder); | |
4792 | |
4793 // Call StubRoutines::generic_arraycopy stub. | |
4794 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
|
4795 src, src_offset, dest, dest_offset, length); |
0 | 4796 |
4797 // Do not let reads from the destination float above the arraycopy. | |
4798 // Since we cannot type the arrays, we don't know which slices | |
4799 // might be affected. We could restrict this barrier only to those | |
4800 // memory slices which pertain to array elements--but don't bother. | |
4801 if (!InsertMemBarAfterArraycopy) | |
4802 // (If InsertMemBarAfterArraycopy, there is already one in place.) | |
4803 insert_mem_bar(Op_MemBarCPUOrder); | |
4804 return true; | |
4805 } | |
4806 | |
4807 // (2) src and dest arrays must have elements of the same BasicType | |
4808 // Figure out the size and type of the elements we will be copying. | |
4809 BasicType src_elem = top_src->klass()->as_array_klass()->element_type()->basic_type(); | |
4810 BasicType dest_elem = top_dest->klass()->as_array_klass()->element_type()->basic_type(); | |
4811 if (src_elem == T_ARRAY) src_elem = T_OBJECT; | |
4812 if (dest_elem == T_ARRAY) dest_elem = T_OBJECT; | |
4813 | |
4814 if (src_elem != dest_elem || dest_elem == T_VOID) { | |
4815 // The component types are not the same or are not recognized. Punt. | |
4816 // (But, avoid the native method wrapper to JVM_ArrayCopy.) | |
4817 generate_slow_arraycopy(TypePtr::BOTTOM, | |
2324 | 4818 src, src_offset, dest, dest_offset, length, |
4819 /*dest_uninitialized*/false); | |
0 | 4820 return true; |
4821 } | |
4822 | |
12966 | 4823 if (src_elem == T_OBJECT) { |
4824 // If both arrays are object arrays then having the exact types | |
4825 // for both will remove the need for a subtype check at runtime | |
4826 // before the call and may make it possible to pick a faster copy | |
4827 // routine (without a subtype check on every element) | |
4828 // Do we have the exact type of src? | |
4829 bool could_have_src = src_spec; | |
4830 // Do we have the exact type of dest? | |
4831 bool could_have_dest = dest_spec; | |
4832 ciKlass* src_k = top_src->klass(); | |
4833 ciKlass* dest_k = top_dest->klass(); | |
4834 if (!src_spec) { | |
4835 src_k = src_type->speculative_type(); | |
4836 if (src_k != NULL && src_k->is_array_klass()) { | |
4837 could_have_src = true; | |
4838 } | |
4839 } | |
4840 if (!dest_spec) { | |
4841 dest_k = dest_type->speculative_type(); | |
4842 if (dest_k != NULL && dest_k->is_array_klass()) { | |
4843 could_have_dest = true; | |
4844 } | |
4845 } | |
4846 if (could_have_src && could_have_dest) { | |
4847 // If we can have both exact types, emit the missing guards | |
4848 if (could_have_src && !src_spec) { | |
4849 src = maybe_cast_profiled_obj(src, src_k); | |
4850 } | |
4851 if (could_have_dest && !dest_spec) { | |
4852 dest = maybe_cast_profiled_obj(dest, dest_k); | |
4853 } | |
4854 } | |
4855 } | |
4856 | |
0 | 4857 //--------------------------------------------------------------------------- |
4858 // We will make a fast path for this call to arraycopy. | |
4859 | |
4860 // We have the following tests left to perform: | |
4861 // | |
4862 // (3) src and dest must not be null. | |
4863 // (4) src_offset must not be negative. | |
4864 // (5) dest_offset must not be negative. | |
4865 // (6) length must not be negative. | |
4866 // (7) src_offset + length must not exceed length of src. | |
4867 // (8) dest_offset + length must not exceed length of dest. | |
4868 // (9) each element of an oop array must be assignable | |
4869 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4870 RegionNode* slow_region = new (C) RegionNode(1); |
0 | 4871 record_for_igvn(slow_region); |
4872 | |
4873 // (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
|
4874 // We currently perform our null checks with the null_check routine. |
0 | 4875 // This means that the null exceptions will be reported in the caller |
4876 // rather than (correctly) reported inside of the native arraycopy call. | |
4877 // This should be corrected, given time. We do our null check with the | |
4878 // stack pointer restored. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4879 src = null_check(src, T_ARRAY); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4880 dest = null_check(dest, T_ARRAY); |
0 | 4881 |
4882 // (4) src_offset must not be negative. | |
4883 generate_negative_guard(src_offset, slow_region); | |
4884 | |
4885 // (5) dest_offset must not be negative. | |
4886 generate_negative_guard(dest_offset, slow_region); | |
4887 | |
4888 // (6) length must not be negative (moved to generate_arraycopy()). | |
4889 // generate_negative_guard(length, slow_region); | |
4890 | |
4891 // (7) src_offset + length must not exceed length of src. | |
4892 generate_limit_guard(src_offset, length, | |
4893 load_array_length(src), | |
4894 slow_region); | |
4895 | |
4896 // (8) dest_offset + length must not exceed length of dest. | |
4897 generate_limit_guard(dest_offset, length, | |
4898 load_array_length(dest), | |
4899 slow_region); | |
4900 | |
4901 // (9) each element of an oop array must be assignable | |
4902 // The generate_arraycopy subroutine checks this. | |
4903 | |
4904 // This is where the memory effects are placed: | |
4905 const TypePtr* adr_type = TypeAryPtr::get_array_body_type(dest_elem); | |
4906 generate_arraycopy(adr_type, dest_elem, | |
4907 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
|
4908 false, false, slow_region); |
0 | 4909 |
4910 return true; | |
4911 } | |
4912 | |
4913 //-----------------------------generate_arraycopy---------------------- | |
4914 // Generate an optimized call to arraycopy. | |
4915 // Caller must guard against non-arrays. | |
4916 // Caller must determine a common array basic-type for both arrays. | |
4917 // Caller must validate offsets against array bounds. | |
4918 // The slow_region has already collected guard failure paths | |
4919 // (such as out of bounds length or non-conformable array types). | |
4920 // The generated code has this shape, in general: | |
4921 // | |
4922 // if (length == 0) return // via zero_path | |
4923 // slowval = -1 | |
4924 // if (types unknown) { | |
4925 // slowval = call generic copy loop | |
4926 // if (slowval == 0) return // via checked_path | |
4927 // } else if (indexes in bounds) { | |
4928 // if ((is object array) && !(array type check)) { | |
4929 // slowval = call checked copy loop | |
4930 // if (slowval == 0) return // via checked_path | |
4931 // } else { | |
4932 // call bulk copy loop | |
4933 // return // via fast_path | |
4934 // } | |
4935 // } | |
4936 // // adjust params for remaining work: | |
4937 // if (slowval != -1) { | |
4938 // n = -1^slowval; src_offset += n; dest_offset += n; length -= n | |
4939 // } | |
4940 // slow_region: | |
4941 // call slow arraycopy(src, src_offset, dest, dest_offset, length) | |
4942 // return // via slow_call_path | |
4943 // | |
4944 // This routine is used from several intrinsics: System.arraycopy, | |
4945 // Object.clone (the array subcase), and Arrays.copyOf[Range]. | |
4946 // | |
4947 void | |
4948 LibraryCallKit::generate_arraycopy(const TypePtr* adr_type, | |
4949 BasicType basic_elem_type, | |
4950 Node* src, Node* src_offset, | |
4951 Node* dest, Node* dest_offset, | |
4952 Node* copy_length, | |
4953 bool disjoint_bases, | |
4954 bool length_never_negative, | |
4955 RegionNode* slow_region) { | |
4956 | |
4957 if (slow_region == NULL) { | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4958 slow_region = new(C) RegionNode(1); |
0 | 4959 record_for_igvn(slow_region); |
4960 } | |
4961 | |
4962 Node* original_dest = dest; | |
4963 AllocateArrayNode* alloc = NULL; // used for zeroing, if needed | |
2324 | 4964 bool dest_uninitialized = false; |
0 | 4965 |
4966 // See if this is the initialization of a newly-allocated array. | |
4967 // If so, we will take responsibility here for initializing it to zero. | |
4968 // (Note: Because tightly_coupled_allocation performs checks on the | |
4969 // out-edges of the dest, we need to avoid making derived pointers | |
4970 // from it until we have checked its uses.) | |
4971 if (ReduceBulkZeroing | |
4972 && !ZeroTLAB // pointless if already zeroed | |
4973 && basic_elem_type != T_CONFLICT // avoid corner case | |
4778 | 4974 && !src->eqv_uncast(dest) |
0 | 4975 && ((alloc = tightly_coupled_allocation(dest, slow_region)) |
4976 != NULL) | |
34
545c277a3ecf
6667581: Don't generate initialization (by 0) code for arrays with size 0
kvn
parents:
29
diff
changeset
|
4977 && _gvn.find_int_con(alloc->in(AllocateNode::ALength), 1) > 0 |
0 | 4978 && alloc->maybe_set_complete(&_gvn)) { |
4979 // "You break it, you buy it." | |
4980 InitializeNode* init = alloc->initialization(); | |
4981 assert(init->is_complete(), "we just did this"); | |
3961
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3742
diff
changeset
|
4982 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
|
4983 assert(dest->is_CheckCastPP(), "sanity"); |
0 | 4984 assert(dest->in(0)->in(0) == init, "dest pinned"); |
4985 adr_type = TypeRawPtr::BOTTOM; // all initializations are into raw memory | |
4986 // From this point on, every exit path is responsible for | |
4987 // initializing any non-copied parts of the object to zero. | |
2324 | 4988 // Also, if this flag is set we make sure that arraycopy interacts properly |
4989 // with G1, eliding pre-barriers. See CR 6627983. | |
4990 dest_uninitialized = true; | |
0 | 4991 } else { |
4992 // No zeroing elimination here. | |
4993 alloc = NULL; | |
4994 //original_dest = dest; | |
2324 | 4995 //dest_uninitialized = false; |
0 | 4996 } |
4997 | |
4998 // Results are placed here: | |
4999 enum { fast_path = 1, // normal void-returning assembly stub | |
5000 checked_path = 2, // special assembly stub with cleanup | |
5001 slow_call_path = 3, // something went wrong; call the VM | |
5002 zero_path = 4, // bypass when length of copy is zero | |
5003 bcopy_path = 5, // copy primitive array by 64-bit blocks | |
5004 PATH_LIMIT = 6 | |
5005 }; | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5006 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
|
5007 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
|
5008 PhiNode* result_memory = new(C) PhiNode(result_region, Type::MEMORY, adr_type); |
0 | 5009 record_for_igvn(result_region); |
5010 _gvn.set_type_bottom(result_i_o); | |
5011 _gvn.set_type_bottom(result_memory); | |
5012 assert(adr_type != TypePtr::BOTTOM, "must be RawMem or a T[] slice"); | |
5013 | |
5014 // The slow_control path: | |
5015 Node* slow_control; | |
5016 Node* slow_i_o = i_o(); | |
5017 Node* slow_mem = memory(adr_type); | |
5018 debug_only(slow_control = (Node*) badAddress); | |
5019 | |
5020 // Checked control path: | |
5021 Node* checked_control = top(); | |
5022 Node* checked_mem = NULL; | |
5023 Node* checked_i_o = NULL; | |
5024 Node* checked_value = NULL; | |
5025 | |
5026 if (basic_elem_type == T_CONFLICT) { | |
2324 | 5027 assert(!dest_uninitialized, ""); |
0 | 5028 Node* cv = generate_generic_arraycopy(adr_type, |
5029 src, src_offset, dest, dest_offset, | |
2324 | 5030 copy_length, dest_uninitialized); |
0 | 5031 if (cv == NULL) cv = intcon(-1); // failure (no stub available) |
5032 checked_control = control(); | |
5033 checked_i_o = i_o(); | |
5034 checked_mem = memory(adr_type); | |
5035 checked_value = cv; | |
5036 set_control(top()); // no fast path | |
5037 } | |
5038 | |
5039 Node* not_pos = generate_nonpositive_guard(copy_length, length_never_negative); | |
5040 if (not_pos != NULL) { | |
5041 PreserveJVMState pjvms(this); | |
5042 set_control(not_pos); | |
5043 | |
5044 // (6) length must not be negative. | |
5045 if (!length_never_negative) { | |
5046 generate_negative_guard(copy_length, slow_region); | |
5047 } | |
5048 | |
836
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5049 // copy_length is 0. |
2324 | 5050 if (!stopped() && dest_uninitialized) { |
0 | 5051 Node* dest_length = alloc->in(AllocateNode::ALength); |
4778 | 5052 if (copy_length->eqv_uncast(dest_length) |
0 | 5053 || _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
|
5054 // There is no zeroing to do. No need for a secondary raw memory barrier. |
0 | 5055 } else { |
5056 // Clear the whole thing since there are no source elements to copy. | |
5057 generate_clear_array(adr_type, dest, basic_elem_type, | |
5058 intcon(0), NULL, | |
5059 alloc->in(AllocateNode::AllocSize)); | |
836
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5060 // 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
|
5061 // 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
|
5062 // 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
|
5063 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
|
5064 Compile::AliasIdxRaw, |
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5065 top())->as_Initialize(); |
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
5066 init->set_complete(&_gvn); // (there is no corresponding AllocateNode) |
0 | 5067 } |
5068 } | |
5069 | |
5070 // Present the results of the fast call. | |
5071 result_region->init_req(zero_path, control()); | |
5072 result_i_o ->init_req(zero_path, i_o()); | |
5073 result_memory->init_req(zero_path, memory(adr_type)); | |
5074 } | |
5075 | |
2324 | 5076 if (!stopped() && dest_uninitialized) { |
0 | 5077 // We have to initialize the *uncopied* part of the array to zero. |
5078 // The copy destination is the slice dest[off..off+len]. The other slices | |
5079 // are dest_head = dest[0..off] and dest_tail = dest[off+len..dest.length]. | |
5080 Node* dest_size = alloc->in(AllocateNode::AllocSize); | |
5081 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
|
5082 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
|
5083 copy_length)); |
0 | 5084 |
5085 // If there is a head section that needs zeroing, do it now. | |
5086 if (find_int_con(dest_offset, -1) != 0) { | |
5087 generate_clear_array(adr_type, dest, basic_elem_type, | |
5088 intcon(0), dest_offset, | |
5089 NULL); | |
5090 } | |
5091 | |
5092 // Next, perform a dynamic check on the tail length. | |
5093 // It is often zero, and we can win big if we prove this. | |
5094 // There are two wins: Avoid generating the ClearArray | |
5095 // with its attendant messy index arithmetic, and upgrade | |
5096 // the copy to a more hardware-friendly word size of 64 bits. | |
5097 Node* tail_ctl = NULL; | |
4778 | 5098 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
|
5099 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
|
5100 Node* bol_lt = _gvn.transform(new(C) BoolNode(cmp_lt, BoolTest::lt)); |
0 | 5101 tail_ctl = generate_slow_guard(bol_lt, NULL); |
5102 assert(tail_ctl != NULL || !stopped(), "must be an outcome"); | |
5103 } | |
5104 | |
5105 // At this point, let's assume there is no tail. | |
5106 if (!stopped() && alloc != NULL && basic_elem_type != T_OBJECT) { | |
5107 // There is no tail. Try an upgrade to a 64-bit copy. | |
5108 bool didit = false; | |
5109 { PreserveJVMState pjvms(this); | |
5110 didit = generate_block_arraycopy(adr_type, basic_elem_type, alloc, | |
5111 src, src_offset, dest, dest_offset, | |
2324 | 5112 dest_size, dest_uninitialized); |
0 | 5113 if (didit) { |
5114 // Present the results of the block-copying fast call. | |
5115 result_region->init_req(bcopy_path, control()); | |
5116 result_i_o ->init_req(bcopy_path, i_o()); | |
5117 result_memory->init_req(bcopy_path, memory(adr_type)); | |
5118 } | |
5119 } | |
5120 if (didit) | |
5121 set_control(top()); // no regular fast path | |
5122 } | |
5123 | |
5124 // Clear the tail, if any. | |
5125 if (tail_ctl != NULL) { | |
5126 Node* notail_ctl = stopped() ? NULL : control(); | |
5127 set_control(tail_ctl); | |
5128 if (notail_ctl == NULL) { | |
5129 generate_clear_array(adr_type, dest, basic_elem_type, | |
5130 dest_tail, NULL, | |
5131 dest_size); | |
5132 } else { | |
5133 // Make a local merge. | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5134 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
|
5135 Node* done_mem = new(C) PhiNode(done_ctl, Type::MEMORY, adr_type); |
0 | 5136 done_ctl->init_req(1, notail_ctl); |
5137 done_mem->init_req(1, memory(adr_type)); | |
5138 generate_clear_array(adr_type, dest, basic_elem_type, | |
5139 dest_tail, NULL, | |
5140 dest_size); | |
5141 done_ctl->init_req(2, control()); | |
5142 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
|
5143 set_control( _gvn.transform(done_ctl)); |
0 | 5144 set_memory( _gvn.transform(done_mem), adr_type ); |
5145 } | |
5146 } | |
5147 } | |
5148 | |
5149 BasicType copy_type = basic_elem_type; | |
5150 assert(basic_elem_type != T_ARRAY, "caller must fix this"); | |
5151 if (!stopped() && copy_type == T_OBJECT) { | |
5152 // If src and dest have compatible element types, we can copy bits. | |
5153 // Types S[] and D[] are compatible if D is a supertype of S. | |
5154 // | |
5155 // If they are not, we will use checked_oop_disjoint_arraycopy, | |
5156 // which performs a fast optimistic per-oop check, and backs off | |
5157 // further to JVM_ArrayCopy on the first per-oop check that fails. | |
5158 // (Actually, we don't move raw bits only; the GC requires card marks.) | |
5159 | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
5160 // Get the Klass* for both src and dest |
0 | 5161 Node* src_klass = load_object_klass(src); |
5162 Node* dest_klass = load_object_klass(dest); | |
5163 | |
5164 // Generate the subtype check. | |
5165 // This might fold up statically, or then again it might not. | |
5166 // | |
5167 // Non-static example: Copying List<String>.elements to a new String[]. | |
5168 // The backing store for a List<String> is always an Object[], | |
5169 // but its elements are always type String, if the generic types | |
5170 // are correct at the source level. | |
5171 // | |
5172 // Test S[] against D[], not S against D, because (probably) | |
5173 // the secondary supertype cache is less busy for S[] than S. | |
5174 // This usually only matters when D is an interface. | |
5175 Node* not_subtype_ctrl = gen_subtype_check(src_klass, dest_klass); | |
5176 // Plug failing path into checked_oop_disjoint_arraycopy | |
5177 if (not_subtype_ctrl != top()) { | |
5178 PreserveJVMState pjvms(this); | |
5179 set_control(not_subtype_ctrl); | |
5180 // (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
|
5181 int ek_offset = in_bytes(ObjArrayKlass::element_klass_offset()); |
0 | 5182 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
|
5183 Node* n1 = LoadKlassNode::make(_gvn, NULL, immutable_memory(), p1, TypeRawPtr::BOTTOM); |
0 | 5184 Node* dest_elem_klass = _gvn.transform(n1); |
5185 Node* cv = generate_checkcast_arraycopy(adr_type, | |
5186 dest_elem_klass, | |
5187 src, src_offset, dest, dest_offset, | |
2324 | 5188 ConvI2X(copy_length), dest_uninitialized); |
0 | 5189 if (cv == NULL) cv = intcon(-1); // failure (no stub available) |
5190 checked_control = control(); | |
5191 checked_i_o = i_o(); | |
5192 checked_mem = memory(adr_type); | |
5193 checked_value = cv; | |
5194 } | |
5195 // At this point we know we do not need type checks on oop stores. | |
5196 | |
5197 // Let's see if we need card marks: | |
5198 if (alloc != NULL && use_ReduceInitialCardMarks()) { | |
5199 // 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
|
5200 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
|
5201 assert(type2aelembytes(basic_elem_type) == type2aelembytes(copy_type), |
0 | 5202 "sizes agree"); |
5203 } | |
5204 } | |
5205 | |
5206 if (!stopped()) { | |
5207 // Generate the fast path, if possible. | |
5208 PreserveJVMState pjvms(this); | |
5209 generate_unchecked_arraycopy(adr_type, copy_type, disjoint_bases, | |
5210 src, src_offset, dest, dest_offset, | |
2324 | 5211 ConvI2X(copy_length), dest_uninitialized); |
0 | 5212 |
5213 // Present the results of the fast call. | |
5214 result_region->init_req(fast_path, control()); | |
5215 result_i_o ->init_req(fast_path, i_o()); | |
5216 result_memory->init_req(fast_path, memory(adr_type)); | |
5217 } | |
5218 | |
5219 // Here are all the slow paths up to this point, in one bundle: | |
5220 slow_control = top(); | |
5221 if (slow_region != NULL) | |
5222 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
|
5223 DEBUG_ONLY(slow_region = (RegionNode*)badAddress); |
0 | 5224 |
5225 set_control(checked_control); | |
5226 if (!stopped()) { | |
5227 // Clean up after the checked call. | |
5228 // The returned value is either 0 or -1^K, | |
5229 // 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
|
5230 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
|
5231 Node* bol = _gvn.transform(new(C) BoolNode(cmp, BoolTest::eq)); |
0 | 5232 IfNode* iff = create_and_map_if(control(), bol, PROB_MAX, COUNT_UNKNOWN); |
5233 | |
5234 // 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
|
5235 Node* checks_done = _gvn.transform(new(C) IfTrueNode(iff)); |
0 | 5236 result_region->init_req(checked_path, checks_done); |
5237 result_i_o ->init_req(checked_path, checked_i_o); | |
5238 result_memory->init_req(checked_path, checked_mem); | |
5239 | |
5240 // 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
|
5241 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
|
5242 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
|
5243 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
|
5244 PhiNode* slow_mem2 = new(C) PhiNode(slow_reg2, Type::MEMORY, adr_type); |
0 | 5245 record_for_igvn(slow_reg2); |
5246 slow_reg2 ->init_req(1, slow_control); | |
5247 slow_i_o2 ->init_req(1, slow_i_o); | |
5248 slow_mem2 ->init_req(1, slow_mem); | |
5249 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
|
5250 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
|
5251 slow_mem2 ->init_req(2, checked_mem); |
0 | 5252 |
5253 slow_control = _gvn.transform(slow_reg2); | |
5254 slow_i_o = _gvn.transform(slow_i_o2); | |
5255 slow_mem = _gvn.transform(slow_mem2); | |
5256 | |
5257 if (alloc != NULL) { | |
5258 // We'll restart from the very beginning, after zeroing the whole thing. | |
5259 // This can cause double writes, but that's OK since dest is brand new. | |
5260 // So we ignore the low 31 bits of the value returned from the stub. | |
5261 } else { | |
5262 // We must continue the copy exactly where it failed, or else | |
5263 // 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
|
5264 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
|
5265 Node* slow_offset = new(C) PhiNode(slow_reg2, TypeInt::INT); |
0 | 5266 slow_offset->init_req(1, intcon(0)); |
5267 slow_offset->init_req(2, checked_offset); | |
5268 slow_offset = _gvn.transform(slow_offset); | |
5269 | |
5270 // 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
|
5271 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
|
5272 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
|
5273 Node* length_minus = _gvn.transform(new(C) SubINode(copy_length, slow_offset)); |
0 | 5274 |
5275 // Tweak the node variables to adjust the code produced below: | |
5276 src_offset = src_off_plus; | |
5277 dest_offset = dest_off_plus; | |
5278 copy_length = length_minus; | |
5279 } | |
5280 } | |
5281 | |
5282 set_control(slow_control); | |
5283 if (!stopped()) { | |
5284 // Generate the slow path, if needed. | |
5285 PreserveJVMState pjvms(this); // replace_in_map may trash the map | |
5286 | |
5287 set_memory(slow_mem, adr_type); | |
5288 set_i_o(slow_i_o); | |
5289 | |
2324 | 5290 if (dest_uninitialized) { |
0 | 5291 generate_clear_array(adr_type, dest, basic_elem_type, |
5292 intcon(0), NULL, | |
5293 alloc->in(AllocateNode::AllocSize)); | |
5294 } | |
5295 | |
5296 generate_slow_arraycopy(adr_type, | |
5297 src, src_offset, dest, dest_offset, | |
2324 | 5298 copy_length, /*dest_uninitialized*/false); |
0 | 5299 |
5300 result_region->init_req(slow_call_path, control()); | |
5301 result_i_o ->init_req(slow_call_path, i_o()); | |
5302 result_memory->init_req(slow_call_path, memory(adr_type)); | |
5303 } | |
5304 | |
5305 // Remove unused edges. | |
5306 for (uint i = 1; i < result_region->req(); i++) { | |
5307 if (result_region->in(i) == NULL) | |
5308 result_region->init_req(i, top()); | |
5309 } | |
5310 | |
5311 // Finished; return the combined state. | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5312 set_control( _gvn.transform(result_region)); |
0 | 5313 set_i_o( _gvn.transform(result_i_o) ); |
5314 set_memory( _gvn.transform(result_memory), adr_type ); | |
5315 | |
5316 // The memory edges above are precise in order to model effects around | |
605 | 5317 // array copies accurately to allow value numbering of field loads around |
0 | 5318 // arraycopy. Such field loads, both before and after, are common in Java |
5319 // collections and similar classes involving header/array data structures. | |
5320 // | |
5321 // But with low number of register or when some registers are used or killed | |
5322 // by arraycopy calls it causes registers spilling on stack. See 6544710. | |
5323 // The next memory barrier is added to avoid it. If the arraycopy can be | |
5324 // optimized away (which it can, sometimes) then we can manually remove | |
5325 // the membar also. | |
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
5326 // |
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
5327 // 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
|
5328 if (alloc != NULL) { |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5329 // 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
|
5330 // 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
|
5331 // other threads. |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5332 // 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
|
5333 // 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
|
5334 // AllocateNode and eliminate the MemBarStoreStoreNode if possible |
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5335 // 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
|
5336 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
|
5337 } else if (InsertMemBarAfterArraycopy) |
0 | 5338 insert_mem_bar(Op_MemBarCPUOrder); |
5339 } | |
5340 | |
5341 | |
5342 // Helper function which determines if an arraycopy immediately follows | |
5343 // an allocation, with no intervening tests or other escapes for the object. | |
5344 AllocateArrayNode* | |
5345 LibraryCallKit::tightly_coupled_allocation(Node* ptr, | |
5346 RegionNode* slow_region) { | |
5347 if (stopped()) return NULL; // no fast path | |
5348 if (C->AliasLevel() == 0) return NULL; // no MergeMems around | |
5349 | |
5350 AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(ptr, &_gvn); | |
5351 if (alloc == NULL) return NULL; | |
5352 | |
5353 Node* rawmem = memory(Compile::AliasIdxRaw); | |
5354 // Is the allocation's memory state untouched? | |
5355 if (!(rawmem->is_Proj() && rawmem->in(0)->is_Initialize())) { | |
5356 // Bail out if there have been raw-memory effects since the allocation. | |
5357 // (Example: There might have been a call or safepoint.) | |
5358 return NULL; | |
5359 } | |
5360 rawmem = rawmem->in(0)->as_Initialize()->memory(Compile::AliasIdxRaw); | |
5361 if (!(rawmem->is_Proj() && rawmem->in(0) == alloc)) { | |
5362 return NULL; | |
5363 } | |
5364 | |
5365 // There must be no unexpected observers of this allocation. | |
5366 for (DUIterator_Fast imax, i = ptr->fast_outs(imax); i < imax; i++) { | |
5367 Node* obs = ptr->fast_out(i); | |
5368 if (obs != this->map()) { | |
5369 return NULL; | |
5370 } | |
5371 } | |
5372 | |
5373 // This arraycopy must unconditionally follow the allocation of the ptr. | |
5374 Node* alloc_ctl = ptr->in(0); | |
5375 assert(just_allocated_object(alloc_ctl) == ptr, "most recent allo"); | |
5376 | |
5377 Node* ctl = control(); | |
5378 while (ctl != alloc_ctl) { | |
5379 // There may be guards which feed into the slow_region. | |
5380 // Any other control flow means that we might not get a chance | |
5381 // to finish initializing the allocated object. | |
5382 if ((ctl->is_IfFalse() || ctl->is_IfTrue()) && ctl->in(0)->is_If()) { | |
5383 IfNode* iff = ctl->in(0)->as_If(); | |
5384 Node* not_ctl = iff->proj_out(1 - ctl->as_Proj()->_con); | |
5385 assert(not_ctl != NULL && not_ctl != ctl, "found alternate"); | |
5386 if (slow_region != NULL && slow_region->find_edge(not_ctl) >= 1) { | |
5387 ctl = iff->in(0); // This test feeds the known slow_region. | |
5388 continue; | |
5389 } | |
5390 // One more try: Various low-level checks bottom out in | |
5391 // uncommon traps. If the debug-info of the trap omits | |
5392 // any reference to the allocation, as we've already | |
5393 // observed, then there can be no objection to the trap. | |
5394 bool found_trap = false; | |
5395 for (DUIterator_Fast jmax, j = not_ctl->fast_outs(jmax); j < jmax; j++) { | |
5396 Node* obs = not_ctl->fast_out(j); | |
5397 if (obs->in(0) == not_ctl && obs->is_Call() && | |
1748 | 5398 (obs->as_Call()->entry_point() == SharedRuntime::uncommon_trap_blob()->entry_point())) { |
0 | 5399 found_trap = true; break; |
5400 } | |
5401 } | |
5402 if (found_trap) { | |
5403 ctl = iff->in(0); // This test feeds a harmless uncommon trap. | |
5404 continue; | |
5405 } | |
5406 } | |
5407 return NULL; | |
5408 } | |
5409 | |
5410 // If we get this far, we have an allocation which immediately | |
5411 // precedes the arraycopy, and we can take over zeroing the new object. | |
5412 // The arraycopy will finish the initialization, and provide | |
5413 // a new control state to which we will anchor the destination pointer. | |
5414 | |
5415 return alloc; | |
5416 } | |
5417 | |
5418 // Helper for initialization of arrays, creating a ClearArray. | |
5419 // It writes zero bits in [start..end), within the body of an array object. | |
5420 // The memory effects are all chained onto the 'adr_type' alias category. | |
5421 // | |
5422 // Since the object is otherwise uninitialized, we are free | |
5423 // to put a little "slop" around the edges of the cleared area, | |
5424 // as long as it does not go back into the array's header, | |
5425 // or beyond the array end within the heap. | |
5426 // | |
5427 // The lower edge can be rounded down to the nearest jint and the | |
5428 // upper edge can be rounded up to the nearest MinObjAlignmentInBytes. | |
5429 // | |
5430 // Arguments: | |
5431 // adr_type memory slice where writes are generated | |
5432 // dest oop of the destination array | |
5433 // basic_elem_type element type of the destination | |
5434 // slice_idx array index of first element to store | |
5435 // slice_len number of elements to store (or NULL) | |
5436 // dest_size total size in bytes of the array object | |
5437 // | |
5438 // Exactly one of slice_len or dest_size must be non-NULL. | |
5439 // If dest_size is non-NULL, zeroing extends to the end of the object. | |
5440 // If slice_len is non-NULL, the slice_idx value must be a constant. | |
5441 void | |
5442 LibraryCallKit::generate_clear_array(const TypePtr* adr_type, | |
5443 Node* dest, | |
5444 BasicType basic_elem_type, | |
5445 Node* slice_idx, | |
5446 Node* slice_len, | |
5447 Node* dest_size) { | |
5448 // one or the other but not both of slice_len and dest_size: | |
5449 assert((slice_len != NULL? 1: 0) + (dest_size != NULL? 1: 0) == 1, ""); | |
5450 if (slice_len == NULL) slice_len = top(); | |
5451 if (dest_size == NULL) dest_size = top(); | |
5452 | |
5453 // operate on this memory slice: | |
5454 Node* mem = memory(adr_type); // memory slice to operate on | |
5455 | |
5456 // scaling and rounding of indexes: | |
29
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
0
diff
changeset
|
5457 int scale = exact_log2(type2aelembytes(basic_elem_type)); |
0 | 5458 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type); |
5459 int clear_low = (-1 << scale) & (BytesPerInt - 1); | |
5460 int bump_bit = (-1 << scale) & BytesPerInt; | |
5461 | |
5462 // determine constant starts and ends | |
5463 const intptr_t BIG_NEG = -128; | |
5464 assert(BIG_NEG + 2*abase < 0, "neg enough"); | |
5465 intptr_t slice_idx_con = (intptr_t) find_int_con(slice_idx, BIG_NEG); | |
5466 intptr_t slice_len_con = (intptr_t) find_int_con(slice_len, BIG_NEG); | |
5467 if (slice_len_con == 0) { | |
5468 return; // nothing to do here | |
5469 } | |
5470 intptr_t start_con = (abase + (slice_idx_con << scale)) & ~clear_low; | |
5471 intptr_t end_con = find_intptr_t_con(dest_size, -1); | |
5472 if (slice_idx_con >= 0 && slice_len_con >= 0) { | |
5473 assert(end_con < 0, "not two cons"); | |
5474 end_con = round_to(abase + ((slice_idx_con + slice_len_con) << scale), | |
5475 BytesPerLong); | |
5476 } | |
5477 | |
5478 if (start_con >= 0 && end_con >= 0) { | |
5479 // Constant start and end. Simple. | |
5480 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
5481 start_con, end_con, &_gvn); | |
5482 } else if (start_con >= 0 && dest_size != top()) { | |
5483 // Constant start, pre-rounded end after the tail of the array. | |
5484 Node* end = dest_size; | |
5485 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
5486 start_con, end, &_gvn); | |
5487 } else if (start_con >= 0 && slice_len != top()) { | |
5488 // Constant start, non-constant end. End needs rounding up. | |
5489 // End offset = round_up(abase + ((slice_idx_con + slice_len) << scale), 8) | |
5490 intptr_t end_base = abase + (slice_idx_con << scale); | |
5491 int end_round = (-1 << scale) & (BytesPerLong - 1); | |
5492 Node* end = ConvI2X(slice_len); | |
5493 if (scale != 0) | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5494 end = _gvn.transform(new(C) LShiftXNode(end, intcon(scale) )); |
0 | 5495 end_base += end_round; |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5496 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
|
5497 end = _gvn.transform(new(C) AndXNode(end, MakeConX(~end_round))); |
0 | 5498 mem = ClearArrayNode::clear_memory(control(), mem, dest, |
5499 start_con, end, &_gvn); | |
5500 } else if (start_con < 0 && dest_size != top()) { | |
5501 // Non-constant start, pre-rounded end after the tail of the array. | |
5502 // This is almost certainly a "round-to-end" operation. | |
5503 Node* start = slice_idx; | |
5504 start = ConvI2X(start); | |
5505 if (scale != 0) | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5506 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
|
5507 start = _gvn.transform(new(C) AddXNode(start, MakeConX(abase))); |
0 | 5508 if ((bump_bit | clear_low) != 0) { |
5509 int to_clear = (bump_bit | clear_low); | |
5510 // Align up mod 8, then store a jint zero unconditionally | |
5511 // 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
|
5512 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
|
5513 < 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
|
5514 bump_bit = 0; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5515 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
|
5516 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5517 // 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
|
5518 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
|
5519 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
|
5520 } |
0 | 5521 // 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
|
5522 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
|
5523 if (bump_bit != 0) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5524 // 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
|
5525 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
|
5526 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
|
5527 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
|
5528 mem = _gvn.transform(mem); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5529 } |
0 | 5530 } |
5531 Node* end = dest_size; // pre-rounded | |
5532 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
5533 start, end, &_gvn); | |
5534 } else { | |
5535 // Non-constant start, unrounded non-constant end. | |
5536 // (Nobody zeroes a random midsection of an array using this routine.) | |
5537 ShouldNotReachHere(); // fix caller | |
5538 } | |
5539 | |
5540 // Done. | |
5541 set_memory(mem, adr_type); | |
5542 } | |
5543 | |
5544 | |
5545 bool | |
5546 LibraryCallKit::generate_block_arraycopy(const TypePtr* adr_type, | |
5547 BasicType basic_elem_type, | |
5548 AllocateNode* alloc, | |
5549 Node* src, Node* src_offset, | |
5550 Node* dest, Node* dest_offset, | |
2324 | 5551 Node* dest_size, bool dest_uninitialized) { |
0 | 5552 // 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
|
5553 int scale = exact_log2(type2aelembytes(basic_elem_type)); |
0 | 5554 if (scale >= LogBytesPerLong) |
5555 return false; // it is already a block transfer | |
5556 | |
5557 // Look at the alignment of the starting offsets. | |
5558 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
|
5559 |
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5560 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
|
5561 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
|
5562 if (src_off_con < 0 || dest_off_con < 0) |
0 | 5563 // At present, we can only understand constants. |
5564 return false; | |
5565 | |
3742
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5566 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
|
5567 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
|
5568 |
0 | 5569 if (((src_off | dest_off) & (BytesPerLong-1)) != 0) { |
5570 // Non-aligned; too bad. | |
5571 // One more chance: Pick off an initial 32-bit word. | |
5572 // This is a common case, since abase can be odd mod 8. | |
5573 if (((src_off | dest_off) & (BytesPerLong-1)) == BytesPerInt && | |
5574 ((src_off ^ dest_off) & (BytesPerLong-1)) == 0) { | |
5575 Node* sptr = basic_plus_adr(src, src_off); | |
5576 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
|
5577 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
|
5578 store_to_memory(control(), dptr, sval, T_INT, adr_type, MemNode::unordered); |
0 | 5579 src_off += BytesPerInt; |
5580 dest_off += BytesPerInt; | |
5581 } else { | |
5582 return false; | |
5583 } | |
5584 } | |
5585 assert(src_off % BytesPerLong == 0, ""); | |
5586 assert(dest_off % BytesPerLong == 0, ""); | |
5587 | |
5588 // Do this copy by giant steps. | |
5589 Node* sptr = basic_plus_adr(src, src_off); | |
5590 Node* dptr = basic_plus_adr(dest, dest_off); | |
5591 Node* countx = dest_size; | |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5592 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
|
5593 countx = _gvn.transform(new (C) URShiftXNode(countx, intcon(LogBytesPerLong))); |
0 | 5594 |
5595 bool disjoint_bases = true; // since alloc != NULL | |
5596 generate_unchecked_arraycopy(adr_type, T_LONG, disjoint_bases, | |
2324 | 5597 sptr, NULL, dptr, NULL, countx, dest_uninitialized); |
0 | 5598 |
5599 return true; | |
5600 } | |
5601 | |
5602 | |
5603 // Helper function; generates code for the slow case. | |
5604 // We make a call to a runtime method which emulates the native method, | |
5605 // but without the native wrapper overhead. | |
5606 void | |
5607 LibraryCallKit::generate_slow_arraycopy(const TypePtr* adr_type, | |
5608 Node* src, Node* src_offset, | |
5609 Node* dest, Node* dest_offset, | |
2324 | 5610 Node* copy_length, bool dest_uninitialized) { |
5611 assert(!dest_uninitialized, "Invariant"); | |
0 | 5612 Node* call = make_runtime_call(RC_NO_LEAF | RC_UNCOMMON, |
5613 OptoRuntime::slow_arraycopy_Type(), | |
5614 OptoRuntime::slow_arraycopy_Java(), | |
5615 "slow_arraycopy", adr_type, | |
5616 src, src_offset, dest, dest_offset, | |
5617 copy_length); | |
5618 | |
5619 // Handle exceptions thrown by this fellow: | |
5620 make_slow_call_ex(call, env()->Throwable_klass(), false); | |
5621 } | |
5622 | |
5623 // Helper function; generates code for cases requiring runtime checks. | |
5624 Node* | |
5625 LibraryCallKit::generate_checkcast_arraycopy(const TypePtr* adr_type, | |
5626 Node* dest_elem_klass, | |
5627 Node* src, Node* src_offset, | |
5628 Node* dest, Node* dest_offset, | |
2324 | 5629 Node* copy_length, bool dest_uninitialized) { |
0 | 5630 if (stopped()) return NULL; |
5631 | |
2324 | 5632 address copyfunc_addr = StubRoutines::checkcast_arraycopy(dest_uninitialized); |
0 | 5633 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path. |
5634 return NULL; | |
5635 } | |
5636 | |
5637 // Pick out the parameters required to perform a store-check | |
5638 // for the target array. This is an optimistic check. It will | |
5639 // look in each non-null element's class, at the desired klass's | |
5640 // 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
|
5641 int sco_offset = in_bytes(Klass::super_check_offset_offset()); |
0 | 5642 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
|
5643 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
|
5644 Node* check_offset = ConvI2X(_gvn.transform(n3)); |
0 | 5645 Node* check_value = dest_elem_klass; |
5646 | |
5647 Node* src_start = array_element_address(src, src_offset, T_OBJECT); | |
5648 Node* dest_start = array_element_address(dest, dest_offset, T_OBJECT); | |
5649 | |
5650 // (We know the arrays are never conjoint, because their types differ.) | |
5651 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, | |
5652 OptoRuntime::checkcast_arraycopy_Type(), | |
5653 copyfunc_addr, "checkcast_arraycopy", adr_type, | |
5654 // five arguments, of which two are | |
5655 // intptr_t (jlong in LP64) | |
5656 src_start, dest_start, | |
5657 copy_length XTOP, | |
5658 check_offset XTOP, | |
5659 check_value); | |
5660 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5661 return _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
0 | 5662 } |
5663 | |
5664 | |
5665 // Helper function; generates code for cases requiring runtime checks. | |
5666 Node* | |
5667 LibraryCallKit::generate_generic_arraycopy(const TypePtr* adr_type, | |
5668 Node* src, Node* src_offset, | |
5669 Node* dest, Node* dest_offset, | |
2324 | 5670 Node* copy_length, bool dest_uninitialized) { |
5671 assert(!dest_uninitialized, "Invariant"); | |
0 | 5672 if (stopped()) return NULL; |
5673 address copyfunc_addr = StubRoutines::generic_arraycopy(); | |
5674 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path. | |
5675 return NULL; | |
5676 } | |
5677 | |
5678 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, | |
5679 OptoRuntime::generic_arraycopy_Type(), | |
5680 copyfunc_addr, "generic_arraycopy", adr_type, | |
5681 src, src_offset, dest, dest_offset, copy_length); | |
5682 | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5683 return _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
0 | 5684 } |
5685 | |
5686 // Helper function; generates the fast out-of-line call to an arraycopy stub. | |
5687 void | |
5688 LibraryCallKit::generate_unchecked_arraycopy(const TypePtr* adr_type, | |
5689 BasicType basic_elem_type, | |
5690 bool disjoint_bases, | |
5691 Node* src, Node* src_offset, | |
5692 Node* dest, Node* dest_offset, | |
2324 | 5693 Node* copy_length, bool dest_uninitialized) { |
0 | 5694 if (stopped()) return; // nothing to do |
5695 | |
5696 Node* src_start = src; | |
5697 Node* dest_start = dest; | |
5698 if (src_offset != NULL || dest_offset != NULL) { | |
5699 assert(src_offset != NULL && dest_offset != NULL, ""); | |
5700 src_start = array_element_address(src, src_offset, basic_elem_type); | |
5701 dest_start = array_element_address(dest, dest_offset, basic_elem_type); | |
5702 } | |
5703 | |
5704 // Figure out which arraycopy runtime method to call. | |
5705 const char* copyfunc_name = "arraycopy"; | |
5706 address copyfunc_addr = | |
5707 basictype2arraycopy(basic_elem_type, src_offset, dest_offset, | |
2324 | 5708 disjoint_bases, copyfunc_name, dest_uninitialized); |
0 | 5709 |
5710 // Call it. Note that the count_ix value is not scaled to a byte-size. | |
5711 make_runtime_call(RC_LEAF|RC_NO_FP, | |
5712 OptoRuntime::fast_arraycopy_Type(), | |
5713 copyfunc_addr, copyfunc_name, adr_type, | |
5714 src_start, dest_start, copy_length XTOP); | |
5715 } | |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5716 |
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5717 //-------------inline_encodeISOArray----------------------------------- |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5718 // 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
|
5719 bool LibraryCallKit::inline_encodeISOArray() { |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5720 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
|
5721 // 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
|
5722 Node *src = argument(0); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5723 Node *src_offset = argument(1); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5724 Node *dst = argument(2); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5725 Node *dst_offset = argument(3); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5726 Node *length = argument(4); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5727 |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5728 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
|
5729 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
|
5730 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
|
5731 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
|
5732 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
|
5733 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
|
5734 // failed array check |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5735 return false; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5736 } |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5737 |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5738 // 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
|
5739 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
|
5740 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
|
5741 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
|
5742 return false; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5743 } |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5744 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
|
5745 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
|
5746 // '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
|
5747 // '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
|
5748 |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5749 const TypeAryPtr* mtype = TypeAryPtr::BYTES; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5750 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
|
5751 enc = _gvn.transform(enc); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5752 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
|
5753 set_memory(res_mem, mtype); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5754 set_result(enc); |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5755 return true; |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5756 } |
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5757 |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5758 //-------------inline_multiplyToLen----------------------------------- |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5759 bool LibraryCallKit::inline_multiplyToLen() { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5760 assert(UseMultiplyToLenIntrinsic, "not implementated on this platform"); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5761 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5762 address stubAddr = StubRoutines::multiplyToLen(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5763 if (stubAddr == NULL) { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5764 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
|
5765 } |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5766 const char* stubName = "multiplyToLen"; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5767 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5768 assert(callee()->signature()->size() == 5, "multiplyToLen has 5 parameters"); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5769 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5770 Node* x = argument(1); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5771 Node* xlen = argument(2); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5772 Node* y = argument(3); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5773 Node* ylen = argument(4); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5774 Node* z = argument(5); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5775 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5776 const Type* x_type = x->Value(&_gvn); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5777 const Type* y_type = y->Value(&_gvn); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5778 const TypeAryPtr* top_x = x_type->isa_aryptr(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5779 const TypeAryPtr* top_y = y_type->isa_aryptr(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5780 if (top_x == NULL || top_x->klass() == NULL || |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5781 top_y == NULL || top_y->klass() == NULL) { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5782 // failed array check |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5783 return false; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5784 } |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5785 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5786 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
|
5787 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
|
5788 if (x_elem != T_INT || y_elem != T_INT) { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5789 return false; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5790 } |
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 // 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
|
5793 // the bytecode that invokes BigInteger.multiplyToLen() if deoptimization happens |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5794 // on the return from z array allocation in runtime. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5795 { PreserveReexecuteState preexecs(this); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5796 jvms()->set_should_reexecute(true); |
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 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
|
5799 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
|
5800 // 'x_start' points to x array + scaled xlen |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5801 // 'y_start' points to y array + scaled ylen |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5802 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5803 // Allocate the result array |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5804 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
|
5805 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
|
5806 Node* klass_node = makecon(TypeKlassPtr::make(klass)); |
20438
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5807 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5808 IdealKit ideal(this); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5809 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5810 #define __ ideal. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5811 Node* one = __ ConI(1); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5812 Node* zero = __ ConI(0); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5813 IdealVariable need_alloc(ideal), z_alloc(ideal); __ declarations_done(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5814 __ set(need_alloc, zero); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5815 __ set(z_alloc, z); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5816 __ if_then(z, BoolTest::eq, null()); { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5817 __ increment (need_alloc, one); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5818 } __ else_(); { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5819 // Update graphKit memory and control from IdealKit. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5820 sync_kit(ideal); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5821 Node* zlen_arg = load_array_length(z); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5822 // Update IdealKit memory and control from graphKit. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5823 __ sync_kit(this); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5824 __ if_then(zlen_arg, BoolTest::lt, zlen); { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5825 __ increment (need_alloc, one); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5826 } __ end_if(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5827 } __ end_if(); |
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 __ if_then(__ value(need_alloc), BoolTest::ne, zero); { |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5830 // Update graphKit memory and control from IdealKit. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5831 sync_kit(ideal); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5832 Node * narr = new_array(klass_node, zlen, 1); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5833 // Update IdealKit memory and control from graphKit. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5834 __ sync_kit(this); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5835 __ set(z_alloc, narr); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5836 } __ end_if(); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5837 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5838 sync_kit(ideal); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5839 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
|
5840 // 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
|
5841 _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
|
5842 // Final sync IdealKit and GraphKit. |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5843 final_sync(ideal); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5844 #undef __ |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5845 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5846 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
|
5847 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5848 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
|
5849 OptoRuntime::multiplyToLen_Type(), |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5850 stubAddr, stubName, TypePtr::BOTTOM, |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5851 x_start, xlen, y_start, ylen, z_start, zlen); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5852 } // original reexecute is set back here |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5853 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5854 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
|
5855 set_result(z); |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5856 return true; |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5857 } |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5858 |
166d744df0de
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
kvn
parents:
20420
diff
changeset
|
5859 |
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5860 /** |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5861 * Calculate CRC32 for byte. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5862 * 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
|
5863 */ |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5864 bool LibraryCallKit::inline_updateCRC32() { |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5865 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
|
5866 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
|
5867 // no receiver since it is static method |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5868 Node* crc = argument(0); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5869 Node* b = argument(1); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5870 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5871 /* |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5872 * int c = ~ crc; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5873 * b = timesXtoThe32[(b ^ c) & 0xFF]; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5874 * b = b ^ (c >>> 8); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5875 * crc = ~b; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5876 */ |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5877 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5878 Node* M1 = intcon(-1); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5879 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
|
5880 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
|
5881 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
|
5882 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5883 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
|
5884 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
|
5885 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
|
5886 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
|
5887 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5888 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
|
5889 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
|
5890 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
|
5891 set_result(result); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5892 return true; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5893 } |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5894 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5895 /** |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5896 * Calculate CRC32 for byte[] array. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5897 * 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
|
5898 */ |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5899 bool LibraryCallKit::inline_updateBytesCRC32() { |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5900 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
|
5901 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
|
5902 // no receiver since it is static method |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5903 Node* crc = argument(0); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5904 Node* src = argument(1); // type: oop |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5905 Node* offset = argument(2); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5906 Node* length = argument(3); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5907 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5908 const Type* src_type = src->Value(&_gvn); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5909 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
|
5910 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
|
5911 // failed array check |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5912 return false; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5913 } |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5914 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5915 // 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
|
5916 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
|
5917 if (src_elem != T_BYTE) { |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5918 return false; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5919 } |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5920 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5921 // '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
|
5922 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
|
5923 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5924 // 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
|
5925 // 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
|
5926 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5927 // Call the stub. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5928 address stubAddr = StubRoutines::updateBytesCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5929 const char *stubName = "updateBytesCRC32"; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5930 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5931 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
|
5932 stubAddr, stubName, TypePtr::BOTTOM, |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5933 crc, src_start, length); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5934 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
|
5935 set_result(result); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5936 return true; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5937 } |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5938 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5939 /** |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5940 * Calculate CRC32 for ByteBuffer. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5941 * 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
|
5942 */ |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5943 bool LibraryCallKit::inline_updateByteBufferCRC32() { |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5944 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
|
5945 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
|
5946 // no receiver since it is static method |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5947 Node* crc = argument(0); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5948 Node* src = argument(1); // type: long |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5949 Node* offset = argument(3); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5950 Node* length = argument(4); // type: int |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5951 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5952 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
|
5953 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
|
5954 offset = ConvI2X(offset); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5955 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5956 // '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
|
5957 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
|
5958 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5959 // Call the stub. |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5960 address stubAddr = StubRoutines::updateBytesCRC32(); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5961 const char *stubName = "updateBytesCRC32"; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5962 |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5963 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
|
5964 stubAddr, stubName, TypePtr::BOTTOM, |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5965 crc, src_start, length); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5966 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
|
5967 set_result(result); |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5968 return true; |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5969 } |
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5970 |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5971 //----------------------------inline_reference_get---------------------------- |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5972 // 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
|
5973 bool LibraryCallKit::inline_reference_get() { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5974 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
|
5975 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
|
5976 |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5977 // Get the argument: |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5978 Node* reference_obj = null_check_receiver(); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5979 if (stopped()) return true; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5980 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5981 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
|
5982 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5983 ciInstanceKlass* klass = env()->Object_klass(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5984 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
|
5985 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5986 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
|
5987 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
|
5988 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5989 // 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
|
5990 pre_barrier(false /* do_load */, |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5991 control(), |
3258
edd9b016deb6
7036021: G1: build failure on win64 and linux with hs21 in jdk6 build environment
johnc
parents:
3255
diff
changeset
|
5992 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
|
5993 result /* pre_val */, |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5994 T_OBJECT); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5995 |
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
5996 // 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
|
5997 // 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
|
5998 insert_mem_bar(Op_MemBarCPUOrder); |
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
5999 |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6000 set_result(result); |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6001 return true; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
6002 } |
6894 | 6003 |
6004 | |
6005 Node * LibraryCallKit::load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString, | |
6006 bool is_exact=true, bool is_static=false) { | |
6007 | |
6008 const TypeInstPtr* tinst = _gvn.type(fromObj)->isa_instptr(); | |
6009 assert(tinst != NULL, "obj is null"); | |
6010 assert(tinst->klass()->is_loaded(), "obj is not loaded"); | |
6011 assert(!is_exact || tinst->klass_is_exact(), "klass not exact"); | |
6012 | |
6013 ciField* field = tinst->klass()->as_instance_klass()->get_field_by_name(ciSymbol::make(fieldName), | |
6014 ciSymbol::make(fieldTypeString), | |
6015 is_static); | |
6016 if (field == NULL) return (Node *) NULL; | |
6017 assert (field != NULL, "undefined field"); | |
6018 | |
6019 // Next code copied from Parse::do_get_xxx(): | |
6020 | |
6021 // Compute address and memory type. | |
6022 int offset = field->offset_in_bytes(); | |
6023 bool is_vol = field->is_volatile(); | |
6024 ciType* field_klass = field->type(); | |
6025 assert(field_klass->is_loaded(), "should be loaded"); | |
6026 const TypePtr* adr_type = C->alias_type(field)->adr_type(); | |
6027 Node *adr = basic_plus_adr(fromObj, fromObj, offset); | |
6028 BasicType bt = field->layout_type(); | |
6029 | |
6030 // Build the resultant type of the load | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6031 const Type *type; |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6032 if (bt == T_OBJECT) { |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6033 type = TypeOopPtr::make_from_klass(field_klass->as_klass()); |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6034 } else { |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6035 type = Type::get_const_basic_type(bt); |
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6036 } |
6894 | 6037 |
20420
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6038 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
|
6039 insert_mem_bar(Op_MemBarVolatile); // StoreLoad barrier |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6040 } |
6894 | 6041 // Build the load. |
20420
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6042 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
|
6043 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
|
6044 // 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
|
6045 // 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
|
6046 // another volatile read. |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6047 if (is_vol) { |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6048 // 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
|
6049 insert_mem_bar(Op_MemBarAcquire, loadedField); |
d8847542f83a
8054927: Missing MemNode::acquire ordering in some volatile Load nodes
kvn
parents:
20327
diff
changeset
|
6050 } |
6894 | 6051 return loadedField; |
6052 } | |
6053 | |
6054 | |
6055 //------------------------------inline_aescrypt_Block----------------------- | |
6056 bool LibraryCallKit::inline_aescrypt_Block(vmIntrinsics::ID id) { | |
6057 address stubAddr; | |
6058 const char *stubName; | |
6059 assert(UseAES, "need AES instruction support"); | |
6060 | |
6061 switch(id) { | |
6062 case vmIntrinsics::_aescrypt_encryptBlock: | |
6063 stubAddr = StubRoutines::aescrypt_encryptBlock(); | |
6064 stubName = "aescrypt_encryptBlock"; | |
6065 break; | |
6066 case vmIntrinsics::_aescrypt_decryptBlock: | |
6067 stubAddr = StubRoutines::aescrypt_decryptBlock(); | |
6068 stubName = "aescrypt_decryptBlock"; | |
6069 break; | |
6070 } | |
6071 if (stubAddr == NULL) return false; | |
6072 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6073 Node* aescrypt_object = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6074 Node* src = argument(1); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6075 Node* src_offset = argument(2); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6076 Node* dest = argument(3); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6077 Node* dest_offset = argument(4); |
6894 | 6078 |
6079 // (1) src and dest are arrays. | |
6080 const Type* src_type = src->Value(&_gvn); | |
6081 const Type* dest_type = dest->Value(&_gvn); | |
6082 const TypeAryPtr* top_src = src_type->isa_aryptr(); | |
6083 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); | |
6084 assert (top_src != NULL && top_src->klass() != NULL && top_dest != NULL && top_dest->klass() != NULL, "args are strange"); | |
6085 | |
6086 // for the quick and dirty code we will skip all the checks. | |
6087 // we are just trying to get the call to be generated. | |
6088 Node* src_start = src; | |
6089 Node* dest_start = dest; | |
6090 if (src_offset != NULL || dest_offset != NULL) { | |
6091 assert(src_offset != NULL && dest_offset != NULL, ""); | |
6092 src_start = array_element_address(src, src_offset, T_BYTE); | |
6093 dest_start = array_element_address(dest, dest_offset, T_BYTE); | |
6094 } | |
6095 | |
6096 // now need to get the start of its expanded key array | |
6097 // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java | |
6098 Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object); | |
6099 if (k_start == NULL) return false; | |
6100 | |
17670 | 6101 if (Matcher::pass_original_key_for_aes()) { |
6102 // on SPARC we need to pass the original key since key expansion needs to happen in intrinsics due to | |
6103 // compatibility issues between Java key expansion and SPARC crypto instructions | |
6104 Node* original_k_start = get_original_key_start_from_aescrypt_object(aescrypt_object); | |
6105 if (original_k_start == NULL) return false; | |
6106 | |
6107 // Call the stub. | |
6108 make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::aescrypt_block_Type(), | |
6109 stubAddr, stubName, TypePtr::BOTTOM, | |
6110 src_start, dest_start, k_start, original_k_start); | |
6111 } else { | |
6112 // Call the stub. | |
6113 make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::aescrypt_block_Type(), | |
6114 stubAddr, stubName, TypePtr::BOTTOM, | |
6115 src_start, dest_start, k_start); | |
6116 } | |
6894 | 6117 |
6118 return true; | |
6119 } | |
6120 | |
6121 //------------------------------inline_cipherBlockChaining_AESCrypt----------------------- | |
6122 bool LibraryCallKit::inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id) { | |
6123 address stubAddr; | |
6124 const char *stubName; | |
6125 | |
6126 assert(UseAES, "need AES instruction support"); | |
6127 | |
6128 switch(id) { | |
6129 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
6130 stubAddr = StubRoutines::cipherBlockChaining_encryptAESCrypt(); | |
6131 stubName = "cipherBlockChaining_encryptAESCrypt"; | |
6132 break; | |
6133 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
6134 stubAddr = StubRoutines::cipherBlockChaining_decryptAESCrypt(); | |
6135 stubName = "cipherBlockChaining_decryptAESCrypt"; | |
6136 break; | |
6137 } | |
6138 if (stubAddr == NULL) return false; | |
6139 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6140 Node* cipherBlockChaining_object = argument(0); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6141 Node* src = argument(1); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6142 Node* src_offset = argument(2); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6143 Node* len = argument(3); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6144 Node* dest = argument(4); |
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6145 Node* dest_offset = argument(5); |
6894 | 6146 |
6147 // (1) src and dest are arrays. | |
6148 const Type* src_type = src->Value(&_gvn); | |
6149 const Type* dest_type = dest->Value(&_gvn); | |
6150 const TypeAryPtr* top_src = src_type->isa_aryptr(); | |
6151 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); | |
6152 assert (top_src != NULL && top_src->klass() != NULL | |
6153 && top_dest != NULL && top_dest->klass() != NULL, "args are strange"); | |
6154 | |
6155 // checks are the responsibility of the caller | |
6156 Node* src_start = src; | |
6157 Node* dest_start = dest; | |
6158 if (src_offset != NULL || dest_offset != NULL) { | |
6159 assert(src_offset != NULL && dest_offset != NULL, ""); | |
6160 src_start = array_element_address(src, src_offset, T_BYTE); | |
6161 dest_start = array_element_address(dest, dest_offset, T_BYTE); | |
6162 } | |
6163 | |
6164 // if we are in this set of code, we "know" the embeddedCipher is an AESCrypt object | |
6165 // (because of the predicated logic executed earlier). | |
6166 // so we cast it here safely. | |
6167 // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java | |
6168 | |
6169 Node* embeddedCipherObj = load_field_from_object(cipherBlockChaining_object, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false); | |
6170 if (embeddedCipherObj == NULL) return false; | |
6171 | |
6172 // cast it to what we know it will be at runtime | |
6173 const TypeInstPtr* tinst = _gvn.type(cipherBlockChaining_object)->isa_instptr(); | |
6174 assert(tinst != NULL, "CBC obj is null"); | |
6175 assert(tinst->klass()->is_loaded(), "CBC obj is not loaded"); | |
6176 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
|
6177 assert(klass_AESCrypt->is_loaded(), "predicate checks that this class is loaded"); |
6894 | 6178 |
6179 ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass(); | |
6180 const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_AESCrypt); | |
6181 const TypeOopPtr* xtype = aklass->as_instance_type(); | |
6182 Node* aescrypt_object = new(C) CheckCastPPNode(control(), embeddedCipherObj, xtype); | |
6183 aescrypt_object = _gvn.transform(aescrypt_object); | |
6184 | |
6185 // we need to get the start of the aescrypt_object's expanded key array | |
6186 Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object); | |
6187 if (k_start == NULL) return false; | |
6188 | |
6189 // similarly, get the start address of the r vector | |
6190 Node* objRvec = load_field_from_object(cipherBlockChaining_object, "r", "[B", /*is_exact*/ false); | |
6191 if (objRvec == NULL) return false; | |
6192 Node* r_start = array_element_address(objRvec, intcon(0), T_BYTE); | |
6193 | |
17670 | 6194 Node* cbcCrypt; |
6195 if (Matcher::pass_original_key_for_aes()) { | |
6196 // on SPARC we need to pass the original key since key expansion needs to happen in intrinsics due to | |
6197 // compatibility issues between Java key expansion and SPARC crypto instructions | |
6198 Node* original_k_start = get_original_key_start_from_aescrypt_object(aescrypt_object); | |
6199 if (original_k_start == NULL) return false; | |
6200 | |
6201 // Call the stub, passing src_start, dest_start, k_start, r_start, src_len and original_k_start | |
6202 cbcCrypt = make_runtime_call(RC_LEAF|RC_NO_FP, | |
6203 OptoRuntime::cipherBlockChaining_aescrypt_Type(), | |
6204 stubAddr, stubName, TypePtr::BOTTOM, | |
6205 src_start, dest_start, k_start, r_start, len, original_k_start); | |
6206 } else { | |
6207 // Call the stub, passing src_start, dest_start, k_start, r_start and src_len | |
6208 cbcCrypt = make_runtime_call(RC_LEAF|RC_NO_FP, | |
6209 OptoRuntime::cipherBlockChaining_aescrypt_Type(), | |
6210 stubAddr, stubName, TypePtr::BOTTOM, | |
6211 src_start, dest_start, k_start, r_start, len); | |
6212 } | |
6213 | |
6214 // return cipher length (int) | |
6215 Node* retvalue = _gvn.transform(new (C) ProjNode(cbcCrypt, TypeFunc::Parms)); | |
6216 set_result(retvalue); | |
6894 | 6217 return true; |
6218 } | |
6219 | |
6220 //------------------------------get_key_start_from_aescrypt_object----------------------- | |
6221 Node * LibraryCallKit::get_key_start_from_aescrypt_object(Node *aescrypt_object) { | |
6222 Node* objAESCryptKey = load_field_from_object(aescrypt_object, "K", "[I", /*is_exact*/ false); | |
6223 assert (objAESCryptKey != NULL, "wrong version of com.sun.crypto.provider.AESCrypt"); | |
6224 if (objAESCryptKey == NULL) return (Node *) NULL; | |
6225 | |
6226 // now have the array, need to get the start address of the K array | |
6227 Node* k_start = array_element_address(objAESCryptKey, intcon(0), T_INT); | |
6228 return k_start; | |
6229 } | |
6230 | |
17670 | 6231 //------------------------------get_original_key_start_from_aescrypt_object----------------------- |
6232 Node * LibraryCallKit::get_original_key_start_from_aescrypt_object(Node *aescrypt_object) { | |
6233 Node* objAESCryptKey = load_field_from_object(aescrypt_object, "lastKey", "[B", /*is_exact*/ false); | |
6234 assert (objAESCryptKey != NULL, "wrong version of com.sun.crypto.provider.AESCrypt"); | |
6235 if (objAESCryptKey == NULL) return (Node *) NULL; | |
6236 | |
6237 // now have the array, need to get the start address of the lastKey array | |
6238 Node* original_k_start = array_element_address(objAESCryptKey, intcon(0), T_BYTE); | |
6239 return original_k_start; | |
6240 } | |
6241 | |
6894 | 6242 //----------------------------inline_cipherBlockChaining_AESCrypt_predicate---------------------------- |
6243 // Return node representing slow path of predicate check. | |
6244 // the pseudo code we want to emulate with this predicate is: | |
6245 // for encryption: | |
6246 // if (embeddedCipherObj instanceof AESCrypt) do_intrinsic, else do_javapath | |
6247 // for decryption: | |
6248 // if ((embeddedCipherObj instanceof AESCrypt) && (cipher!=plain)) do_intrinsic, else do_javapath | |
6249 // note cipher==plain is more conservative than the original java code but that's OK | |
6250 // | |
6251 Node* LibraryCallKit::inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting) { | |
20312
922c87c9aed4
8035605: Expand functionality of PredictedIntrinsicGenerator
kvn
parents:
17990
diff
changeset
|
6252 // The receiver was checked for NULL already. |
6894 | 6253 Node* objCBC = argument(0); |
6254 | |
6255 // Load embeddedCipher field of CipherBlockChaining object. | |
6256 Node* embeddedCipherObj = load_field_from_object(objCBC, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false); | |
6257 | |
6258 // get AESCrypt klass for instanceOf check | |
6259 // AESCrypt might not be loaded yet if some other SymmetricCipher got us to this compile point | |
6260 // will have same classloader as CipherBlockChaining object | |
6261 const TypeInstPtr* tinst = _gvn.type(objCBC)->isa_instptr(); | |
6262 assert(tinst != NULL, "CBCobj is null"); | |
6263 assert(tinst->klass()->is_loaded(), "CBCobj is not loaded"); | |
6264 | |
6265 // we want to do an instanceof comparison against the AESCrypt class | |
6266 ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt")); | |
6267 if (!klass_AESCrypt->is_loaded()) { | |
6268 // if AESCrypt is not even loaded, we never take the intrinsic fast path | |
6269 Node* ctrl = control(); | |
6270 set_control(top()); // no regular fast path | |
6271 return ctrl; | |
6272 } | |
6273 ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass(); | |
6274 | |
6275 Node* instof = gen_instanceof(embeddedCipherObj, makecon(TypeKlassPtr::make(instklass_AESCrypt))); | |
6276 Node* cmp_instof = _gvn.transform(new (C) CmpINode(instof, intcon(1))); | |
6277 Node* bool_instof = _gvn.transform(new (C) BoolNode(cmp_instof, BoolTest::ne)); | |
6278 | |
6279 Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN); | |
6280 | |
6281 // for encryption, we are done | |
6282 if (!decrypting) | |
6283 return instof_false; // even if it is NULL | |
6284 | |
6285 // for decryption, we need to add a further check to avoid | |
6286 // taking the intrinsic path when cipher and plain are the same | |
6287 // see the original java code for why. | |
6288 RegionNode* region = new(C) RegionNode(3); | |
6289 region->init_req(1, instof_false); | |
6290 Node* src = argument(1); | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
6291 Node* dest = argument(4); |
6894 | 6292 Node* cmp_src_dest = _gvn.transform(new (C) CmpPNode(src, dest)); |
6293 Node* bool_src_dest = _gvn.transform(new (C) BoolNode(cmp_src_dest, BoolTest::eq)); | |
6294 Node* src_dest_conjoint = generate_guard(bool_src_dest, NULL, PROB_MIN); | |
6295 region->init_req(2, src_dest_conjoint); | |
6296 | |
6297 record_for_igvn(region); | |
6298 return _gvn.transform(region); | |
6299 } | |
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6300 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6301 //------------------------------inline_sha_implCompress----------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6302 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6303 // 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
|
6304 // 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
|
6305 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6306 // 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
|
6307 // 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
|
6308 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6309 // 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
|
6310 // 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
|
6311 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6312 bool LibraryCallKit::inline_sha_implCompress(vmIntrinsics::ID id) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6313 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
|
6314 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6315 Node* sha_obj = argument(0); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6316 Node* src = argument(1); // type oop |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6317 Node* ofs = argument(2); // type int |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6318 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6319 const Type* src_type = src->Value(&_gvn); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6320 const TypeAryPtr* top_src = src_type->isa_aryptr(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6321 if (top_src == NULL || top_src->klass() == NULL) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6322 // failed array check |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6323 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6324 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6325 // 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
|
6326 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
|
6327 if (src_elem != T_BYTE) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6328 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6329 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6330 // 'src_start' points to src array + offset |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6331 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
|
6332 Node* state = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6333 address stubAddr; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6334 const char *stubName; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6335 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6336 switch(id) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6337 case vmIntrinsics::_sha_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6338 assert(UseSHA1Intrinsics, "need SHA1 instruction support"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6339 state = get_state_from_sha_object(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6340 stubAddr = StubRoutines::sha1_implCompress(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6341 stubName = "sha1_implCompress"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6342 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6343 case vmIntrinsics::_sha2_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6344 assert(UseSHA256Intrinsics, "need SHA256 instruction support"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6345 state = get_state_from_sha_object(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6346 stubAddr = StubRoutines::sha256_implCompress(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6347 stubName = "sha256_implCompress"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6348 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6349 case vmIntrinsics::_sha5_implCompress: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6350 assert(UseSHA512Intrinsics, "need SHA512 instruction support"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6351 state = get_state_from_sha5_object(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6352 stubAddr = StubRoutines::sha512_implCompress(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6353 stubName = "sha512_implCompress"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6354 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6355 default: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6356 fatal_unexpected_iid(id); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6357 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6358 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6359 if (state == NULL) return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6360 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6361 // Call the stub. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6362 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
|
6363 stubAddr, stubName, TypePtr::BOTTOM, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6364 src_start, state); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6365 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6366 return true; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6367 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6368 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6369 //------------------------------inline_digestBase_implCompressMB----------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6370 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6371 // 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
|
6372 // 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
|
6373 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6374 bool LibraryCallKit::inline_digestBase_implCompressMB(int predicate) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6375 assert(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6376 "need SHA1/SHA256/SHA512 instruction support"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6377 assert((uint)predicate < 3, "sanity"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6378 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
|
6379 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6380 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
|
6381 Node* src = argument(1); // byte[] array |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6382 Node* ofs = argument(2); // type int |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6383 Node* limit = argument(3); // type int |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6384 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6385 const Type* src_type = src->Value(&_gvn); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6386 const TypeAryPtr* top_src = src_type->isa_aryptr(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6387 if (top_src == NULL || top_src->klass() == NULL) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6388 // failed array check |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6389 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6390 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6391 // 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
|
6392 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
|
6393 if (src_elem != T_BYTE) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6394 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6395 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6396 // 'src_start' points to src array + offset |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6397 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
|
6398 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6399 const char* klass_SHA_name = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6400 const char* stub_name = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6401 address stub_addr = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6402 bool long_state = false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6403 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6404 switch (predicate) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6405 case 0: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6406 if (UseSHA1Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6407 klass_SHA_name = "sun/security/provider/SHA"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6408 stub_name = "sha1_implCompressMB"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6409 stub_addr = StubRoutines::sha1_implCompressMB(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6410 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6411 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6412 case 1: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6413 if (UseSHA256Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6414 klass_SHA_name = "sun/security/provider/SHA2"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6415 stub_name = "sha256_implCompressMB"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6416 stub_addr = StubRoutines::sha256_implCompressMB(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6417 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6418 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6419 case 2: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6420 if (UseSHA512Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6421 klass_SHA_name = "sun/security/provider/SHA5"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6422 stub_name = "sha512_implCompressMB"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6423 stub_addr = StubRoutines::sha512_implCompressMB(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6424 long_state = true; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6425 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6426 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6427 default: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6428 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
|
6429 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6430 if (klass_SHA_name != NULL) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6431 // get DigestBase klass to lookup for SHA klass |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6432 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
|
6433 assert(tinst != NULL, "digestBase_obj is not instance???"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6434 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
|
6435 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6436 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
|
6437 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
|
6438 ciInstanceKlass* instklass_SHA = klass_SHA->as_instance_klass(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6439 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
|
6440 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6441 return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6442 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6443 //------------------------------inline_sha_implCompressMB----------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6444 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
|
6445 bool long_state, address stubAddr, const char *stubName, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6446 Node* src_start, Node* ofs, Node* limit) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6447 const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_SHA); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6448 const TypeOopPtr* xtype = aklass->as_instance_type(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6449 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
|
6450 sha_obj = _gvn.transform(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6451 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6452 Node* state; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6453 if (long_state) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6454 state = get_state_from_sha5_object(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6455 } else { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6456 state = get_state_from_sha_object(sha_obj); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6457 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6458 if (state == NULL) return false; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6459 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6460 // Call the stub. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6461 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
|
6462 OptoRuntime::digestBase_implCompressMB_Type(), |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6463 stubAddr, stubName, TypePtr::BOTTOM, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6464 src_start, state, ofs, limit); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6465 // return ofs (int) |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6466 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
|
6467 set_result(result); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6468 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6469 return true; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6470 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6471 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6472 //------------------------------get_state_from_sha_object----------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6473 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
|
6474 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
|
6475 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
|
6476 if (sha_state == NULL) return (Node *) NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6477 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6478 // 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
|
6479 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
|
6480 return state; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6481 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6482 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6483 //------------------------------get_state_from_sha5_object----------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6484 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
|
6485 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
|
6486 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
|
6487 if (sha_state == NULL) return (Node *) NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6488 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6489 // 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
|
6490 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
|
6491 return state; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6492 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6493 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6494 //----------------------------inline_digestBase_implCompressMB_predicate---------------------------- |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6495 // Return node representing slow path of predicate check. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6496 // 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
|
6497 // 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
|
6498 // |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6499 Node* LibraryCallKit::inline_digestBase_implCompressMB_predicate(int predicate) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6500 assert(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics, |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6501 "need SHA1/SHA256/SHA512 instruction support"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6502 assert((uint)predicate < 3, "sanity"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6503 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6504 // The receiver was checked for NULL already. |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6505 Node* digestBaseObj = argument(0); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6506 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6507 // get DigestBase klass for instanceOf check |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6508 const TypeInstPtr* tinst = _gvn.type(digestBaseObj)->isa_instptr(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6509 assert(tinst != NULL, "digestBaseObj is null"); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6510 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
|
6511 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6512 const char* klass_SHA_name = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6513 switch (predicate) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6514 case 0: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6515 if (UseSHA1Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6516 // 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
|
6517 klass_SHA_name = "sun/security/provider/SHA"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6518 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6519 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6520 case 1: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6521 if (UseSHA256Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6522 // 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
|
6523 klass_SHA_name = "sun/security/provider/SHA2"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6524 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6525 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6526 case 2: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6527 if (UseSHA512Intrinsics) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6528 // 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
|
6529 klass_SHA_name = "sun/security/provider/SHA5"; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6530 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6531 break; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6532 default: |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6533 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
|
6534 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6535 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6536 ciKlass* klass_SHA = NULL; |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6537 if (klass_SHA_name != NULL) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6538 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
|
6539 } |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6540 if ((klass_SHA == NULL) || !klass_SHA->is_loaded()) { |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6541 // 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
|
6542 Node* ctrl = control(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6543 set_control(top()); // no intrinsic path |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6544 return ctrl; |
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 ciInstanceKlass* instklass_SHA = klass_SHA->as_instance_klass(); |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6547 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6548 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
|
6549 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
|
6550 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
|
6551 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
|
6552 |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6553 return instof_false; // even if it is NULL |
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
20312
diff
changeset
|
6554 } |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6555 |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6556 bool LibraryCallKit::inline_profileBoolean() { |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6557 Node* counts = argument(1); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6558 const TypeAryPtr* ary = NULL; |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6559 ciArray* aobj = NULL; |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6560 if (counts->is_Con() |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6561 && (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
|
6562 && (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
|
6563 && (aobj->length() == 2)) { |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6564 // 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
|
6565 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
|
6566 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
|
6567 |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6568 if (C->log() != NULL) { |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6569 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
|
6570 false_cnt, true_cnt); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6571 } |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6572 |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6573 if (false_cnt + true_cnt == 0) { |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6574 // According to profile, never executed. |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6575 uncommon_trap_exact(Deoptimization::Reason_intrinsic, |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6576 Deoptimization::Action_reinterpret); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6577 return true; |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6578 } |
22986
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6579 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6580 // 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
|
6581 // is a number of each value occurrences. |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6582 Node* result = argument(0); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6583 if (false_cnt == 0 || true_cnt == 0) { |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6584 // 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
|
6585 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
|
6586 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6587 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
|
6588 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
|
6589 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6590 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
|
6591 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
|
6592 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
|
6593 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6594 { // 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
|
6595 // 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
|
6596 // 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
|
6597 PreserveJVMState pjvms(this); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6598 PreserveReexecuteState preexecs(this); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6599 jvms()->set_should_reexecute(true); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6600 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6601 set_control(slow_path); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6602 set_i_o(i_o()); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6603 |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6604 uncommon_trap_exact(Deoptimization::Reason_intrinsic, |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6605 Deoptimization::Action_reinterpret); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6606 } |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6607 // 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
|
6608 // 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
|
6609 // later on. |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6610 set_control(fast_path); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6611 result = intcon(expected_val); |
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6612 } |
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6613 // Stop profiling. |
22986
d9593687713d
8074548: Never-taken branches cause repeated deopts in MHs.GWT case
vlivanov
parents:
22985
diff
changeset
|
6614 // 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
|
6615 // 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
|
6616 // 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
|
6617 // 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
|
6618 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
|
6619 C->record_for_igvn(profile); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6620 set_result(profile); |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6621 return true; |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6622 } else { |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6623 // Continue profiling. |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6624 // 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
|
6625 // 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
|
6626 // 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
|
6627 // isn't a compile-time constant. |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6628 return false; |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6629 } |
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20627
diff
changeset
|
6630 } |