Mercurial > hg > truffle
annotate src/share/vm/opto/library_call.cpp @ 12226:7944aba7ba41
8015107: NPG: Use consistent naming for metaspace concepts
Reviewed-by: coleenp, mgerdin, hseigel
| author | ehelin |
|---|---|
| date | Mon, 12 Aug 2013 17:37:02 +0200 |
| parents | 29aa8936f03c |
| children | 884ed7a10f09 |
| 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" | |
| 34 #include "opto/idealKit.hpp" | |
| 35 #include "opto/mulnode.hpp" | |
| 36 #include "opto/parse.hpp" | |
| 37 #include "opto/runtime.hpp" | |
| 38 #include "opto/subnode.hpp" | |
| 39 #include "prims/nativeLookup.hpp" | |
| 40 #include "runtime/sharedRuntime.hpp" | |
| 10405 | 41 #include "trace/traceMacros.hpp" |
| 0 | 42 |
| 43 class LibraryIntrinsic : public InlineCallGenerator { | |
| 44 // Extend the set of intrinsics known to the runtime: | |
| 45 public: | |
| 46 private: | |
| 47 bool _is_virtual; | |
| 6894 | 48 bool _is_predicted; |
| 0 | 49 vmIntrinsics::ID _intrinsic_id; |
| 50 | |
| 51 public: | |
| 6894 | 52 LibraryIntrinsic(ciMethod* m, bool is_virtual, bool is_predicted, vmIntrinsics::ID id) |
| 0 | 53 : InlineCallGenerator(m), |
| 54 _is_virtual(is_virtual), | |
| 6894 | 55 _is_predicted(is_predicted), |
| 0 | 56 _intrinsic_id(id) |
| 57 { | |
| 58 } | |
| 59 virtual bool is_intrinsic() const { return true; } | |
| 60 virtual bool is_virtual() const { return _is_virtual; } | |
| 6894 | 61 virtual bool is_predicted() const { return _is_predicted; } |
| 0 | 62 virtual JVMState* generate(JVMState* jvms); |
| 6894 | 63 virtual Node* generate_predicate(JVMState* jvms); |
| 0 | 64 vmIntrinsics::ID intrinsic_id() const { return _intrinsic_id; } |
| 65 }; | |
| 66 | |
| 67 | |
| 68 // Local helper class for LibraryIntrinsic: | |
| 69 class LibraryCallKit : public GraphKit { | |
| 70 private: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
71 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
|
72 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
|
73 int _reexecute_sp; // the stack pointer when bytecode needs to be reexecuted |
| 0 | 74 |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
75 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
|
76 |
| 0 | 77 public: |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
78 LibraryCallKit(JVMState* jvms, LibraryIntrinsic* intrinsic) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
79 : GraphKit(jvms), |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
80 _intrinsic(intrinsic), |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
81 _result(NULL) |
| 0 | 82 { |
|
7200
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
83 // 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
|
84 if (!jvms->has_method()) { |
|
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
85 _reexecute_sp = sp(); |
|
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
86 } else { |
|
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
87 // 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
|
88 // 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
|
89 // 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
|
90 bool ignored_will_link; |
|
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
91 ciSignature* declared_signature = NULL; |
|
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
92 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
|
93 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
|
94 _reexecute_sp = sp() + nargs; // "push" arguments back on stack |
|
dd38cfd12c3a
8004319: test/gc/7168848/HumongousAlloc.java fails after 7172640
twisti
parents:
7194
diff
changeset
|
95 } |
| 0 | 96 } |
| 97 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
98 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
|
99 |
| 0 | 100 ciMethod* caller() const { return jvms()->method(); } |
| 101 int bci() const { return jvms()->bci(); } | |
| 102 LibraryIntrinsic* intrinsic() const { return _intrinsic; } | |
| 103 vmIntrinsics::ID intrinsic_id() const { return _intrinsic->intrinsic_id(); } | |
| 104 ciMethod* callee() const { return _intrinsic->method(); } | |
| 105 | |
| 106 bool try_to_inline(); | |
| 6894 | 107 Node* try_to_predicate(); |
| 0 | 108 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
109 void push_result() { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
110 // Push the result onto the stack. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
111 if (!stopped() && result() != NULL) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
112 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
|
113 push_node(bt, result()); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
114 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
115 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
116 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
117 private: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
118 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
|
119 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
|
120 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
121 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
122 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
|
123 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
|
124 Node* result() { return _result; } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
125 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
126 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
|
127 |
| 0 | 128 // Helper functions to inline natives |
| 129 Node* generate_guard(Node* test, RegionNode* region, float true_prob); | |
| 130 Node* generate_slow_guard(Node* test, RegionNode* region); | |
| 131 Node* generate_fair_guard(Node* test, RegionNode* region); | |
| 132 Node* generate_negative_guard(Node* index, RegionNode* region, | |
| 133 // resulting CastII of index: | |
| 134 Node* *pos_index = NULL); | |
| 135 Node* generate_nonpositive_guard(Node* index, bool never_negative, | |
| 136 // resulting CastII of index: | |
| 137 Node* *pos_index = NULL); | |
| 138 Node* generate_limit_guard(Node* offset, Node* subseq_length, | |
| 139 Node* array_length, | |
| 140 RegionNode* region); | |
| 141 Node* generate_current_thread(Node* &tls_output); | |
| 142 address basictype2arraycopy(BasicType t, Node *src_offset, Node *dest_offset, | |
| 2324 | 143 bool disjoint_bases, const char* &name, bool dest_uninitialized); |
| 0 | 144 Node* load_mirror_from_klass(Node* klass); |
| 145 Node* load_klass_from_mirror_common(Node* mirror, bool never_see_null, | |
| 146 RegionNode* region, int null_path, | |
| 147 int offset); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
148 Node* load_klass_from_mirror(Node* mirror, bool never_see_null, |
| 0 | 149 RegionNode* region, int null_path) { |
| 150 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
|
151 return load_klass_from_mirror_common(mirror, never_see_null, |
| 0 | 152 region, null_path, |
| 153 offset); | |
| 154 } | |
| 155 Node* load_array_klass_from_mirror(Node* mirror, bool never_see_null, | |
| 156 RegionNode* region, int null_path) { | |
| 157 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
|
158 return load_klass_from_mirror_common(mirror, never_see_null, |
| 0 | 159 region, null_path, |
| 160 offset); | |
| 161 } | |
| 162 Node* generate_access_flags_guard(Node* kls, | |
| 163 int modifier_mask, int modifier_bits, | |
| 164 RegionNode* region); | |
| 165 Node* generate_interface_guard(Node* kls, RegionNode* region); | |
| 166 Node* generate_array_guard(Node* kls, RegionNode* region) { | |
| 167 return generate_array_guard_common(kls, region, false, false); | |
| 168 } | |
| 169 Node* generate_non_array_guard(Node* kls, RegionNode* region) { | |
| 170 return generate_array_guard_common(kls, region, false, true); | |
| 171 } | |
| 172 Node* generate_objArray_guard(Node* kls, RegionNode* region) { | |
| 173 return generate_array_guard_common(kls, region, true, false); | |
| 174 } | |
| 175 Node* generate_non_objArray_guard(Node* kls, RegionNode* region) { | |
| 176 return generate_array_guard_common(kls, region, true, true); | |
| 177 } | |
| 178 Node* generate_array_guard_common(Node* kls, RegionNode* region, | |
| 179 bool obj_array, bool not_array); | |
| 180 Node* generate_virtual_guard(Node* obj_klass, RegionNode* slow_region); | |
| 181 CallJavaNode* generate_method_call(vmIntrinsics::ID method_id, | |
| 182 bool is_virtual = false, bool is_static = false); | |
| 183 CallJavaNode* generate_method_call_static(vmIntrinsics::ID method_id) { | |
| 184 return generate_method_call(method_id, false, true); | |
| 185 } | |
| 186 CallJavaNode* generate_method_call_virtual(vmIntrinsics::ID method_id) { | |
| 187 return generate_method_call(method_id, true, false); | |
| 188 } | |
| 6894 | 189 Node * load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString, bool is_exact, bool is_static); |
| 0 | 190 |
| 6057 | 191 Node* make_string_method_node(int opcode, Node* str1_start, Node* cnt1, Node* str2_start, Node* cnt2); |
| 192 Node* make_string_method_node(int opcode, Node* str1, Node* str2); | |
| 0 | 193 bool inline_string_compareTo(); |
| 194 bool inline_string_indexOf(); | |
| 195 Node* string_indexOf(Node* string_object, ciTypeArray* target_array, jint offset, jint cache_i, jint md2_i); | |
| 681 | 196 bool inline_string_equals(); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
197 Node* round_double_node(Node* n); |
| 0 | 198 bool runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName); |
| 199 bool inline_math_native(vmIntrinsics::ID id); | |
| 200 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
|
201 bool inline_math(vmIntrinsics::ID id); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
202 bool inline_exp(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
203 bool inline_pow(); |
| 6205 | 204 void finish_pow_exp(Node* result, Node* x, Node* y, const TypeFunc* call_type, address funcAddr, const char* funcName); |
| 0 | 205 bool inline_min_max(vmIntrinsics::ID id); |
| 206 Node* generate_min_max(vmIntrinsics::ID id, Node* x, Node* y); | |
| 207 // This returns Type::AnyPtr, RawPtr, or OopPtr. | |
| 208 int classify_unsafe_addr(Node* &base, Node* &offset); | |
| 209 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
|
210 // Helper for inline_unsafe_access. |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
211 // 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
|
212 // 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
|
213 void insert_pre_barrier(Node* base_oop, Node* offset, Node* pre_val, bool need_mem_bar); |
| 0 | 214 bool inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile); |
| 215 bool inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static); | |
| 12078 | 216 static bool klass_needs_init_guard(Node* kls); |
| 0 | 217 bool inline_unsafe_allocate(); |
| 218 bool inline_unsafe_copyMemory(); | |
| 219 bool inline_native_currentThread(); | |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
220 #ifdef TRACE_HAVE_INTRINSICS |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
221 bool inline_native_classID(); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
222 bool inline_native_threadID(); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
223 #endif |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
224 bool inline_native_time_funcs(address method, const char* funcName); |
| 0 | 225 bool inline_native_isInterrupted(); |
| 226 bool inline_native_Class_query(vmIntrinsics::ID id); | |
| 227 bool inline_native_subtype_check(); | |
| 228 | |
| 229 bool inline_native_newArray(); | |
| 230 bool inline_native_getLength(); | |
| 231 bool inline_array_copyOf(bool is_copyOfRange); | |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
232 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
|
233 void copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array, bool card_mark); |
| 0 | 234 bool inline_native_clone(bool is_virtual); |
| 235 bool inline_native_Reflection_getCallerClass(); | |
| 236 // Helper function for inlining native object hash method | |
| 237 bool inline_native_hashcode(bool is_virtual, bool is_static); | |
| 238 bool inline_native_getClass(); | |
| 239 | |
| 240 // Helper functions for inlining arraycopy | |
| 241 bool inline_arraycopy(); | |
| 242 void generate_arraycopy(const TypePtr* adr_type, | |
| 243 BasicType basic_elem_type, | |
| 244 Node* src, Node* src_offset, | |
| 245 Node* dest, Node* dest_offset, | |
| 246 Node* copy_length, | |
| 247 bool disjoint_bases = false, | |
| 248 bool length_never_negative = false, | |
| 249 RegionNode* slow_region = NULL); | |
| 250 AllocateArrayNode* tightly_coupled_allocation(Node* ptr, | |
| 251 RegionNode* slow_region); | |
| 252 void generate_clear_array(const TypePtr* adr_type, | |
| 253 Node* dest, | |
| 254 BasicType basic_elem_type, | |
| 255 Node* slice_off, | |
| 256 Node* slice_len, | |
| 257 Node* slice_end); | |
| 258 bool generate_block_arraycopy(const TypePtr* adr_type, | |
| 259 BasicType basic_elem_type, | |
| 260 AllocateNode* alloc, | |
| 261 Node* src, Node* src_offset, | |
| 262 Node* dest, Node* dest_offset, | |
| 2324 | 263 Node* dest_size, bool dest_uninitialized); |
| 0 | 264 void generate_slow_arraycopy(const TypePtr* adr_type, |
| 265 Node* src, Node* src_offset, | |
| 266 Node* dest, Node* dest_offset, | |
| 2324 | 267 Node* copy_length, bool dest_uninitialized); |
| 0 | 268 Node* generate_checkcast_arraycopy(const TypePtr* adr_type, |
| 269 Node* dest_elem_klass, | |
| 270 Node* src, Node* src_offset, | |
| 271 Node* dest, Node* dest_offset, | |
| 2324 | 272 Node* copy_length, bool dest_uninitialized); |
| 0 | 273 Node* generate_generic_arraycopy(const TypePtr* adr_type, |
| 274 Node* src, Node* src_offset, | |
| 275 Node* dest, Node* dest_offset, | |
| 2324 | 276 Node* copy_length, bool dest_uninitialized); |
| 0 | 277 void generate_unchecked_arraycopy(const TypePtr* adr_type, |
| 278 BasicType basic_elem_type, | |
| 279 bool disjoint_bases, | |
| 280 Node* src, Node* src_offset, | |
| 281 Node* dest, Node* dest_offset, | |
| 2324 | 282 Node* copy_length, bool dest_uninitialized); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
283 typedef enum { LS_xadd, LS_xchg, LS_cmpxchg } LoadStoreKind; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
284 bool inline_unsafe_load_store(BasicType type, LoadStoreKind kind); |
| 0 | 285 bool inline_unsafe_ordered_store(BasicType type); |
| 7425 | 286 bool inline_unsafe_fence(vmIntrinsics::ID id); |
| 0 | 287 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
|
288 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
|
289 bool inline_reference_get(); |
| 6894 | 290 bool inline_aescrypt_Block(vmIntrinsics::ID id); |
| 291 bool inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id); | |
| 292 Node* inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting); | |
| 293 Node* get_key_start_from_aescrypt_object(Node* aescrypt_object); | |
|
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
294 bool inline_encodeISOArray(); |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
295 bool inline_updateCRC32(); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
296 bool inline_updateBytesCRC32(); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
297 bool inline_updateByteBufferCRC32(); |
| 0 | 298 }; |
| 299 | |
| 300 | |
| 301 //---------------------------make_vm_intrinsic---------------------------- | |
| 302 CallGenerator* Compile::make_vm_intrinsic(ciMethod* m, bool is_virtual) { | |
| 303 vmIntrinsics::ID id = m->intrinsic_id(); | |
| 304 assert(id != vmIntrinsics::_none, "must be a VM intrinsic"); | |
| 305 | |
| 306 if (DisableIntrinsic[0] != '\0' | |
| 307 && strstr(DisableIntrinsic, vmIntrinsics::name_at(id)) != NULL) { | |
| 308 // disabled by a user request on the command line: | |
| 309 // example: -XX:DisableIntrinsic=_hashCode,_getClass | |
| 310 return NULL; | |
| 311 } | |
| 312 | |
| 313 if (!m->is_loaded()) { | |
| 314 // do not attempt to inline unloaded methods | |
| 315 return NULL; | |
| 316 } | |
| 317 | |
| 318 // Only a few intrinsics implement a virtual dispatch. | |
| 319 // They are expensive calls which are also frequently overridden. | |
| 320 if (is_virtual) { | |
| 321 switch (id) { | |
| 322 case vmIntrinsics::_hashCode: | |
| 323 case vmIntrinsics::_clone: | |
| 324 // OK, Object.hashCode and Object.clone intrinsics come in both flavors | |
| 325 break; | |
| 326 default: | |
| 327 return NULL; | |
| 328 } | |
| 329 } | |
| 330 | |
| 331 // -XX:-InlineNatives disables nearly all intrinsics: | |
| 332 if (!InlineNatives) { | |
| 333 switch (id) { | |
| 334 case vmIntrinsics::_indexOf: | |
| 335 case vmIntrinsics::_compareTo: | |
| 681 | 336 case vmIntrinsics::_equals: |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
337 case vmIntrinsics::_equalsC: |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
338 case vmIntrinsics::_getAndAddInt: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
339 case vmIntrinsics::_getAndAddLong: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
340 case vmIntrinsics::_getAndSetInt: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
341 case vmIntrinsics::_getAndSetLong: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
342 case vmIntrinsics::_getAndSetObject: |
| 7425 | 343 case vmIntrinsics::_loadFence: |
| 344 case vmIntrinsics::_storeFence: | |
| 345 case vmIntrinsics::_fullFence: | |
| 0 | 346 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
|
347 case vmIntrinsics::_Reference_get: |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
348 break; // InlineNatives does not control Reference.get |
| 0 | 349 default: |
| 350 return NULL; | |
| 351 } | |
| 352 } | |
| 353 | |
| 6894 | 354 bool is_predicted = false; |
| 355 | |
| 0 | 356 switch (id) { |
| 357 case vmIntrinsics::_compareTo: | |
| 358 if (!SpecialStringCompareTo) return NULL; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
359 if (!Matcher::match_rule_supported(Op_StrComp)) return NULL; |
| 0 | 360 break; |
| 361 case vmIntrinsics::_indexOf: | |
| 362 if (!SpecialStringIndexOf) return NULL; | |
| 363 break; | |
| 681 | 364 case vmIntrinsics::_equals: |
| 365 if (!SpecialStringEquals) return NULL; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
366 if (!Matcher::match_rule_supported(Op_StrEquals)) return NULL; |
| 681 | 367 break; |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
368 case vmIntrinsics::_equalsC: |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
369 if (!SpecialArraysEquals) return NULL; |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
370 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
|
371 break; |
| 0 | 372 case vmIntrinsics::_arraycopy: |
| 373 if (!InlineArrayCopy) return NULL; | |
| 374 break; | |
| 375 case vmIntrinsics::_copyMemory: | |
| 376 if (StubRoutines::unsafe_arraycopy() == NULL) return NULL; | |
| 377 if (!InlineArrayCopy) return NULL; | |
| 378 break; | |
| 379 case vmIntrinsics::_hashCode: | |
| 380 if (!InlineObjectHash) return NULL; | |
| 381 break; | |
| 382 case vmIntrinsics::_clone: | |
| 383 case vmIntrinsics::_copyOf: | |
| 384 case vmIntrinsics::_copyOfRange: | |
| 385 if (!InlineObjectCopy) return NULL; | |
| 386 // These also use the arraycopy intrinsic mechanism: | |
| 387 if (!InlineArrayCopy) return NULL; | |
| 388 break; | |
|
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
389 case vmIntrinsics::_encodeISOArray: |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
390 if (!SpecialEncodeISOArray) return NULL; |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
391 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
|
392 break; |
| 0 | 393 case vmIntrinsics::_checkIndex: |
| 394 // We do not intrinsify this. The optimizer does fine with it. | |
| 395 return NULL; | |
| 396 | |
| 397 case vmIntrinsics::_getCallerClass: | |
| 398 if (!UseNewReflection) return NULL; | |
| 399 if (!InlineReflectionGetCallerClass) return NULL; | |
|
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
400 if (SystemDictionary::reflect_CallerSensitive_klass() == NULL) return NULL; |
| 0 | 401 break; |
| 402 | |
|
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
403 case vmIntrinsics::_bitCount_i: |
|
5934
61b82be3b1ff
7152957: VM crashes with assert(false) failed: bad AD file
never
parents:
5927
diff
changeset
|
404 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
|
405 break; |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
406 |
|
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
407 case vmIntrinsics::_bitCount_l: |
|
5934
61b82be3b1ff
7152957: VM crashes with assert(false) failed: bad AD file
never
parents:
5927
diff
changeset
|
408 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
|
409 break; |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
410 |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
411 case vmIntrinsics::_numberOfLeadingZeros_i: |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
412 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
|
413 break; |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
414 |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
415 case vmIntrinsics::_numberOfLeadingZeros_l: |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
416 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
|
417 break; |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
418 |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
419 case vmIntrinsics::_numberOfTrailingZeros_i: |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
420 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
|
421 break; |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
422 |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
423 case vmIntrinsics::_numberOfTrailingZeros_l: |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
424 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
|
425 break; |
|
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
426 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
427 case vmIntrinsics::_reverseBytes_c: |
|
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
428 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
|
429 break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
430 case vmIntrinsics::_reverseBytes_s: |
|
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
431 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
|
432 break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
433 case vmIntrinsics::_reverseBytes_i: |
|
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
434 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
|
435 break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
436 case vmIntrinsics::_reverseBytes_l: |
|
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
437 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
|
438 break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
439 |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
440 case vmIntrinsics::_Reference_get: |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
441 // 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
|
442 // 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
|
443 // 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
|
444 // 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
|
445 break; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
446 |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
447 case vmIntrinsics::_compareAndSwapObject: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
448 #ifdef _LP64 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
449 if (!UseCompressedOops && !Matcher::match_rule_supported(Op_CompareAndSwapP)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
450 #endif |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
451 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
452 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
453 case vmIntrinsics::_compareAndSwapLong: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
454 if (!Matcher::match_rule_supported(Op_CompareAndSwapL)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
455 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
456 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
457 case vmIntrinsics::_getAndAddInt: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
458 if (!Matcher::match_rule_supported(Op_GetAndAddI)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
459 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
460 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
461 case vmIntrinsics::_getAndAddLong: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
462 if (!Matcher::match_rule_supported(Op_GetAndAddL)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
463 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
464 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
465 case vmIntrinsics::_getAndSetInt: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
466 if (!Matcher::match_rule_supported(Op_GetAndSetI)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
467 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
468 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
469 case vmIntrinsics::_getAndSetLong: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
470 if (!Matcher::match_rule_supported(Op_GetAndSetL)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
471 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
472 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
473 case vmIntrinsics::_getAndSetObject: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
474 #ifdef _LP64 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
475 if (!UseCompressedOops && !Matcher::match_rule_supported(Op_GetAndSetP)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
476 if (UseCompressedOops && !Matcher::match_rule_supported(Op_GetAndSetN)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
477 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
478 #else |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
479 if (!Matcher::match_rule_supported(Op_GetAndSetP)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
480 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
481 #endif |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
482 |
| 6894 | 483 case vmIntrinsics::_aescrypt_encryptBlock: |
| 484 case vmIntrinsics::_aescrypt_decryptBlock: | |
| 485 if (!UseAESIntrinsics) return NULL; | |
| 486 break; | |
| 487 | |
| 488 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
| 489 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
| 490 if (!UseAESIntrinsics) return NULL; | |
| 491 // these two require the predicated logic | |
| 492 is_predicted = true; | |
| 493 break; | |
| 494 | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
495 case vmIntrinsics::_updateCRC32: |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
496 case vmIntrinsics::_updateBytesCRC32: |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
497 case vmIntrinsics::_updateByteBufferCRC32: |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
498 if (!UseCRC32Intrinsics) return NULL; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
499 break; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
500 |
| 0 | 501 default: |
|
856
75596850f863
6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents:
851
diff
changeset
|
502 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
|
503 assert(id != vmIntrinsics::_Object_init && id != vmIntrinsics::_invoke, "enum out of order?"); |
| 0 | 504 break; |
| 505 } | |
| 506 | |
| 507 // -XX:-InlineClassNatives disables natives from the Class class. | |
| 508 // The flag applies to all reflective calls, notably Array.newArray | |
| 509 // (visible to Java programmers as Array.newInstance). | |
| 510 if (m->holder()->name() == ciSymbol::java_lang_Class() || | |
| 511 m->holder()->name() == ciSymbol::java_lang_reflect_Array()) { | |
| 512 if (!InlineClassNatives) return NULL; | |
| 513 } | |
| 514 | |
| 515 // -XX:-InlineThreadNatives disables natives from the Thread class. | |
| 516 if (m->holder()->name() == ciSymbol::java_lang_Thread()) { | |
| 517 if (!InlineThreadNatives) return NULL; | |
| 518 } | |
| 519 | |
| 520 // -XX:-InlineMathNatives disables natives from the Math,Float and Double classes. | |
| 521 if (m->holder()->name() == ciSymbol::java_lang_Math() || | |
| 522 m->holder()->name() == ciSymbol::java_lang_Float() || | |
| 523 m->holder()->name() == ciSymbol::java_lang_Double()) { | |
| 524 if (!InlineMathNatives) return NULL; | |
| 525 } | |
| 526 | |
| 527 // -XX:-InlineUnsafeOps disables natives from the Unsafe class. | |
| 528 if (m->holder()->name() == ciSymbol::sun_misc_Unsafe()) { | |
| 529 if (!InlineUnsafeOps) return NULL; | |
| 530 } | |
| 531 | |
| 6894 | 532 return new LibraryIntrinsic(m, is_virtual, is_predicted, (vmIntrinsics::ID) id); |
| 0 | 533 } |
| 534 | |
| 535 //----------------------register_library_intrinsics----------------------- | |
| 536 // Initialize this file's data structures, for each Compile instance. | |
| 537 void Compile::register_library_intrinsics() { | |
| 538 // Nothing to do here. | |
| 539 } | |
| 540 | |
| 541 JVMState* LibraryIntrinsic::generate(JVMState* jvms) { | |
| 542 LibraryCallKit kit(jvms, this); | |
| 543 Compile* C = kit.C; | |
| 544 int nodes = C->unique(); | |
| 545 #ifndef PRODUCT | |
| 546 if ((PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) && Verbose) { | |
| 547 char buf[1000]; | |
| 548 const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf)); | |
| 549 tty->print_cr("Intrinsic %s", str); | |
| 550 } | |
| 551 #endif | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
552 ciMethod* callee = kit.callee(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
553 const int bci = kit.bci(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
554 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
555 // Try to inline the intrinsic. |
| 0 | 556 if (kit.try_to_inline()) { |
| 557 if (PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) { | |
|
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
558 C->print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual)" : "(intrinsic)"); |
| 0 | 559 } |
| 560 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked); | |
| 561 if (C->log()) { | |
| 562 C->log()->elem("intrinsic id='%s'%s nodes='%d'", | |
| 563 vmIntrinsics::name_at(intrinsic_id()), | |
| 564 (is_virtual() ? " virtual='1'" : ""), | |
| 565 C->unique() - nodes); | |
| 566 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
567 // 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
|
568 kit.push_result(); |
| 0 | 569 return kit.transfer_exceptions_into_jvms(); |
| 570 } | |
| 571 | |
|
5927
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
572 // The intrinsic bailed out |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
573 if (PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) { |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
574 if (jvms->has_method()) { |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
575 // Not a root compile. |
|
5927
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
576 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
|
577 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
|
578 } else { |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
579 // Root compile |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
580 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
|
581 vmIntrinsics::name_at(intrinsic_id()), |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
582 (is_virtual() ? " (virtual)" : ""), bci); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
583 } |
| 0 | 584 } |
| 585 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed); | |
| 586 return NULL; | |
| 587 } | |
| 588 | |
| 6894 | 589 Node* LibraryIntrinsic::generate_predicate(JVMState* jvms) { |
| 590 LibraryCallKit kit(jvms, this); | |
| 591 Compile* C = kit.C; | |
| 592 int nodes = C->unique(); | |
| 593 #ifndef PRODUCT | |
| 594 assert(is_predicted(), "sanity"); | |
| 595 if ((PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) && Verbose) { | |
| 596 char buf[1000]; | |
| 597 const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf)); | |
| 598 tty->print_cr("Predicate for intrinsic %s", str); | |
| 599 } | |
| 600 #endif | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
601 ciMethod* callee = kit.callee(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
602 const int bci = kit.bci(); |
| 6894 | 603 |
| 604 Node* slow_ctl = kit.try_to_predicate(); | |
| 605 if (!kit.failing()) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
606 if (PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) { |
|
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
607 C->print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual)" : "(intrinsic)"); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
608 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
609 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked); |
| 6894 | 610 if (C->log()) { |
| 611 C->log()->elem("predicate_intrinsic id='%s'%s nodes='%d'", | |
| 612 vmIntrinsics::name_at(intrinsic_id()), | |
| 613 (is_virtual() ? " virtual='1'" : ""), | |
| 614 C->unique() - nodes); | |
| 615 } | |
| 616 return slow_ctl; // Could be NULL if the check folds. | |
| 617 } | |
| 618 | |
| 619 // The intrinsic bailed out | |
| 620 if (PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) { | |
| 621 if (jvms->has_method()) { | |
| 622 // Not a root compile. | |
| 623 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
|
624 C->print_inlining(kit.callee(), jvms->depth() - 1, bci, msg); |
| 6894 | 625 } else { |
| 626 // Root compile | |
|
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
627 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
|
628 vmIntrinsics::name_at(intrinsic_id()), |
|
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
629 (is_virtual() ? " (virtual)" : ""), bci); |
| 6894 | 630 } |
| 631 } | |
| 632 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed); | |
| 633 return NULL; | |
| 634 } | |
| 635 | |
| 0 | 636 bool LibraryCallKit::try_to_inline() { |
| 637 // Handle symbolic names for otherwise undistinguished boolean switches: | |
| 638 const bool is_store = true; | |
| 639 const bool is_native_ptr = true; | |
| 640 const bool is_static = true; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
641 const bool is_volatile = true; |
| 0 | 642 |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
643 if (!jvms()->has_method()) { |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
644 // Root JVMState has a null method. |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
645 assert(map()->memory()->Opcode() == Op_Parm, ""); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
646 // Insert the memory aliasing node |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
647 set_all_memory(reset_memory()); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
648 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
649 assert(merged_memory(), ""); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
650 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
651 |
| 0 | 652 switch (intrinsic_id()) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
653 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
|
654 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
|
655 case vmIntrinsics::_getClass: return inline_native_getClass(); |
| 0 | 656 |
| 657 case vmIntrinsics::_dsin: | |
| 658 case vmIntrinsics::_dcos: | |
| 659 case vmIntrinsics::_dtan: | |
| 660 case vmIntrinsics::_dabs: | |
| 661 case vmIntrinsics::_datan2: | |
| 662 case vmIntrinsics::_dsqrt: | |
| 663 case vmIntrinsics::_dexp: | |
| 664 case vmIntrinsics::_dlog: | |
| 665 case vmIntrinsics::_dlog10: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
666 case vmIntrinsics::_dpow: return inline_math_native(intrinsic_id()); |
| 0 | 667 |
| 668 case vmIntrinsics::_min: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
669 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
|
670 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
671 case vmIntrinsics::_arraycopy: return inline_arraycopy(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
672 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
673 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
|
674 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
|
675 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
|
676 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
677 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
|
678 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
|
679 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
|
680 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
|
681 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
|
682 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
|
683 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
|
684 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
|
685 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
|
686 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
687 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
|
688 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
|
689 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
|
690 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
|
691 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
|
692 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
|
693 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
|
694 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
|
695 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
|
696 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
697 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
|
698 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
|
699 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
|
700 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
|
701 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
|
702 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
|
703 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
|
704 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
|
705 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
706 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
|
707 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
|
708 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
|
709 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
|
710 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
|
711 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
|
712 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
|
713 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
|
714 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
715 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
|
716 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
|
717 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
|
718 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
|
719 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
|
720 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
|
721 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
|
722 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
|
723 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
|
724 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
725 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
|
726 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
|
727 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
|
728 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
|
729 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
|
730 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
|
731 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
|
732 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
|
733 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
|
734 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
735 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
|
736 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
|
737 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
|
738 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
|
739 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
740 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
|
741 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
|
742 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
|
743 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
744 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
|
745 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
|
746 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
|
747 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
748 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
|
749 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
|
750 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
|
751 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
|
752 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
|
753 |
| 7425 | 754 case vmIntrinsics::_loadFence: |
| 755 case vmIntrinsics::_storeFence: | |
| 756 case vmIntrinsics::_fullFence: return inline_unsafe_fence(intrinsic_id()); | |
| 757 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
758 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
|
759 case vmIntrinsics::_isInterrupted: return inline_native_isInterrupted(); |
| 0 | 760 |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
761 #ifdef TRACE_HAVE_INTRINSICS |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
762 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
|
763 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
|
764 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
|
765 #endif |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
766 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
|
767 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
|
768 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
|
769 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
|
770 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
|
771 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
|
772 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
|
773 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
|
774 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
|
775 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
|
776 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
777 case vmIntrinsics::_isAssignableFrom: return inline_native_subtype_check(); |
| 0 | 778 |
| 779 case vmIntrinsics::_isInstance: | |
| 780 case vmIntrinsics::_getModifiers: | |
| 781 case vmIntrinsics::_isInterface: | |
| 782 case vmIntrinsics::_isArray: | |
| 783 case vmIntrinsics::_isPrimitive: | |
| 784 case vmIntrinsics::_getSuperclass: | |
| 785 case vmIntrinsics::_getComponentType: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
786 case vmIntrinsics::_getClassAccessFlags: return inline_native_Class_query(intrinsic_id()); |
| 0 | 787 |
| 788 case vmIntrinsics::_floatToRawIntBits: | |
| 789 case vmIntrinsics::_floatToIntBits: | |
| 790 case vmIntrinsics::_intBitsToFloat: | |
| 791 case vmIntrinsics::_doubleToRawLongBits: | |
| 792 case vmIntrinsics::_doubleToLongBits: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
793 case vmIntrinsics::_longBitsToDouble: return inline_fp_conversions(intrinsic_id()); |
| 0 | 794 |
|
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
795 case vmIntrinsics::_numberOfLeadingZeros_i: |
|
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
796 case vmIntrinsics::_numberOfLeadingZeros_l: |
|
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
797 case vmIntrinsics::_numberOfTrailingZeros_i: |
|
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
798 case vmIntrinsics::_numberOfTrailingZeros_l: |
|
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
799 case vmIntrinsics::_bitCount_i: |
|
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
800 case vmIntrinsics::_bitCount_l: |
| 0 | 801 case vmIntrinsics::_reverseBytes_i: |
| 802 case vmIntrinsics::_reverseBytes_l: | |
|
1396
d7f654633cfe
6946040: add intrinsic for short and char reverseBytes
never
parents:
1152
diff
changeset
|
803 case vmIntrinsics::_reverseBytes_s: |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
804 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
|
805 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
806 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
|
807 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
808 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
|
809 |
| 6894 | 810 case vmIntrinsics::_aescrypt_encryptBlock: |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
811 case vmIntrinsics::_aescrypt_decryptBlock: return inline_aescrypt_Block(intrinsic_id()); |
| 6894 | 812 |
| 813 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
| 814 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
| 815 return inline_cipherBlockChaining_AESCrypt(intrinsic_id()); | |
| 816 | |
|
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
817 case vmIntrinsics::_encodeISOArray: |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
818 return inline_encodeISOArray(); |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
819 |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
820 case vmIntrinsics::_updateCRC32: |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
821 return inline_updateCRC32(); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
822 case vmIntrinsics::_updateBytesCRC32: |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
823 return inline_updateBytesCRC32(); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
824 case vmIntrinsics::_updateByteBufferCRC32: |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
825 return inline_updateByteBufferCRC32(); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
826 |
| 0 | 827 default: |
| 828 // If you get here, it may be that someone has added a new intrinsic | |
| 829 // to the list in vmSymbols.hpp without implementing it here. | |
| 830 #ifndef PRODUCT | |
| 831 if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) { | |
| 832 tty->print_cr("*** Warning: Unimplemented intrinsic %s(%d)", | |
| 833 vmIntrinsics::name_at(intrinsic_id()), intrinsic_id()); | |
| 834 } | |
| 835 #endif | |
| 836 return false; | |
| 837 } | |
| 838 } | |
| 839 | |
| 6894 | 840 Node* LibraryCallKit::try_to_predicate() { |
| 841 if (!jvms()->has_method()) { | |
| 842 // Root JVMState has a null method. | |
| 843 assert(map()->memory()->Opcode() == Op_Parm, ""); | |
| 844 // Insert the memory aliasing node | |
| 845 set_all_memory(reset_memory()); | |
| 846 } | |
| 847 assert(merged_memory(), ""); | |
| 848 | |
| 849 switch (intrinsic_id()) { | |
| 850 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
| 851 return inline_cipherBlockChaining_AESCrypt_predicate(false); | |
| 852 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
| 853 return inline_cipherBlockChaining_AESCrypt_predicate(true); | |
| 854 | |
| 855 default: | |
| 856 // If you get here, it may be that someone has added a new intrinsic | |
| 857 // to the list in vmSymbols.hpp without implementing it here. | |
| 858 #ifndef PRODUCT | |
| 859 if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) { | |
| 860 tty->print_cr("*** Warning: Unimplemented predicate for intrinsic %s(%d)", | |
| 861 vmIntrinsics::name_at(intrinsic_id()), intrinsic_id()); | |
| 862 } | |
| 863 #endif | |
| 864 Node* slow_ctl = control(); | |
| 865 set_control(top()); // No fast path instrinsic | |
| 866 return slow_ctl; | |
| 867 } | |
| 868 } | |
| 869 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
870 //------------------------------set_result------------------------------- |
| 0 | 871 // Helper function for finishing intrinsics. |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
872 void LibraryCallKit::set_result(RegionNode* region, PhiNode* value) { |
| 0 | 873 record_for_igvn(region); |
| 874 set_control(_gvn.transform(region)); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
875 set_result( _gvn.transform(value)); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
876 assert(value->type()->basic_type() == result()->bottom_type()->basic_type(), "sanity"); |
| 0 | 877 } |
| 878 | |
| 879 //------------------------------generate_guard--------------------------- | |
| 880 // Helper function for generating guarded fast-slow graph structures. | |
| 881 // The given 'test', if true, guards a slow path. If the test fails | |
| 882 // then a fast path can be taken. (We generally hope it fails.) | |
| 883 // In all cases, GraphKit::control() is updated to the fast path. | |
| 884 // The returned value represents the control for the slow path. | |
| 885 // The return value is never 'top'; it is either a valid control | |
| 886 // or NULL if it is obvious that the slow path can never be taken. | |
| 887 // Also, if region and the slow control are not NULL, the slow edge | |
| 888 // is appended to the region. | |
| 889 Node* LibraryCallKit::generate_guard(Node* test, RegionNode* region, float true_prob) { | |
| 890 if (stopped()) { | |
| 891 // Already short circuited. | |
| 892 return NULL; | |
| 893 } | |
| 894 | |
| 895 // Build an if node and its projections. | |
| 896 // If test is true we take the slow path, which we assume is uncommon. | |
| 897 if (_gvn.type(test) == TypeInt::ZERO) { | |
| 898 // The slow branch is never taken. No need to build this guard. | |
| 899 return NULL; | |
| 900 } | |
| 901 | |
| 902 IfNode* iff = create_and_map_if(control(), test, true_prob, COUNT_UNKNOWN); | |
| 903 | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
904 Node* if_slow = _gvn.transform(new (C) IfTrueNode(iff)); |
| 0 | 905 if (if_slow == top()) { |
| 906 // The slow branch is never taken. No need to build this guard. | |
| 907 return NULL; | |
| 908 } | |
| 909 | |
| 910 if (region != NULL) | |
| 911 region->add_req(if_slow); | |
| 912 | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
913 Node* if_fast = _gvn.transform(new (C) IfFalseNode(iff)); |
| 0 | 914 set_control(if_fast); |
| 915 | |
| 916 return if_slow; | |
| 917 } | |
| 918 | |
| 919 inline Node* LibraryCallKit::generate_slow_guard(Node* test, RegionNode* region) { | |
| 920 return generate_guard(test, region, PROB_UNLIKELY_MAG(3)); | |
| 921 } | |
| 922 inline Node* LibraryCallKit::generate_fair_guard(Node* test, RegionNode* region) { | |
| 923 return generate_guard(test, region, PROB_FAIR); | |
| 924 } | |
| 925 | |
| 926 inline Node* LibraryCallKit::generate_negative_guard(Node* index, RegionNode* region, | |
| 927 Node* *pos_index) { | |
| 928 if (stopped()) | |
| 929 return NULL; // already stopped | |
| 930 if (_gvn.type(index)->higher_equal(TypeInt::POS)) // [0,maxint] | |
| 931 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
|
932 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
|
933 Node* bol_lt = _gvn.transform(new (C) BoolNode(cmp_lt, BoolTest::lt)); |
| 0 | 934 Node* is_neg = generate_guard(bol_lt, region, PROB_MIN); |
| 935 if (is_neg != NULL && pos_index != NULL) { | |
| 936 // 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
|
937 Node* ccast = new (C) CastIINode(index, TypeInt::POS); |
| 0 | 938 ccast->set_req(0, control()); |
| 939 (*pos_index) = _gvn.transform(ccast); | |
| 940 } | |
| 941 return is_neg; | |
| 942 } | |
| 943 | |
| 944 inline Node* LibraryCallKit::generate_nonpositive_guard(Node* index, bool never_negative, | |
| 945 Node* *pos_index) { | |
| 946 if (stopped()) | |
| 947 return NULL; // already stopped | |
| 948 if (_gvn.type(index)->higher_equal(TypeInt::POS1)) // [1,maxint] | |
| 949 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
|
950 Node* cmp_le = _gvn.transform(new (C) CmpINode(index, intcon(0))); |
| 0 | 951 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
|
952 Node* bol_le = _gvn.transform(new (C) BoolNode(cmp_le, le_or_eq)); |
| 0 | 953 Node* is_notp = generate_guard(bol_le, NULL, PROB_MIN); |
| 954 if (is_notp != NULL && pos_index != NULL) { | |
| 955 // 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
|
956 Node* ccast = new (C) CastIINode(index, TypeInt::POS1); |
| 0 | 957 ccast->set_req(0, control()); |
| 958 (*pos_index) = _gvn.transform(ccast); | |
| 959 } | |
| 960 return is_notp; | |
| 961 } | |
| 962 | |
| 963 // Make sure that 'position' is a valid limit index, in [0..length]. | |
| 964 // There are two equivalent plans for checking this: | |
| 965 // A. (offset + copyLength) unsigned<= arrayLength | |
| 966 // B. offset <= (arrayLength - copyLength) | |
| 967 // We require that all of the values above, except for the sum and | |
| 968 // difference, are already known to be non-negative. | |
| 969 // Plan A is robust in the face of overflow, if offset and copyLength | |
| 970 // are both hugely positive. | |
| 971 // | |
| 972 // Plan B is less direct and intuitive, but it does not overflow at | |
| 973 // all, since the difference of two non-negatives is always | |
| 974 // representable. Whenever Java methods must perform the equivalent | |
| 975 // check they generally use Plan B instead of Plan A. | |
| 976 // For the moment we use Plan A. | |
| 977 inline Node* LibraryCallKit::generate_limit_guard(Node* offset, | |
| 978 Node* subseq_length, | |
| 979 Node* array_length, | |
| 980 RegionNode* region) { | |
| 981 if (stopped()) | |
| 982 return NULL; // already stopped | |
| 983 bool zero_offset = _gvn.type(offset) == TypeInt::ZERO; | |
| 4778 | 984 if (zero_offset && subseq_length->eqv_uncast(array_length)) |
| 0 | 985 return NULL; // common case of whole-array copy |
| 986 Node* last = subseq_length; | |
| 987 if (!zero_offset) // last += offset | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
988 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
|
989 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
|
990 Node* bol_lt = _gvn.transform(new (C) BoolNode(cmp_lt, BoolTest::lt)); |
| 0 | 991 Node* is_over = generate_guard(bol_lt, region, PROB_MIN); |
| 992 return is_over; | |
| 993 } | |
| 994 | |
| 995 | |
| 996 //--------------------------generate_current_thread-------------------- | |
| 997 Node* LibraryCallKit::generate_current_thread(Node* &tls_output) { | |
| 998 ciKlass* thread_klass = env()->Thread_klass(); | |
| 999 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
|
1000 Node* thread = _gvn.transform(new (C) ThreadLocalNode()); |
| 0 | 1001 Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(JavaThread::threadObj_offset())); |
| 1002 Node* threadObj = make_load(NULL, p, thread_type, T_OBJECT); | |
| 1003 tls_output = thread; | |
| 1004 return threadObj; | |
| 1005 } | |
| 1006 | |
| 1007 | |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1008 //------------------------------make_string_method_node------------------------ |
| 6057 | 1009 // Helper method for String intrinsic functions. This version is called |
| 1010 // with str1 and str2 pointing to String object nodes. | |
| 1011 // | |
| 1012 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
|
1013 Node* no_ctrl = NULL; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1014 |
| 6057 | 1015 // Get start addr of string |
| 1016 Node* str1_value = load_String_value(no_ctrl, str1); | |
| 1017 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
|
1018 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
|
1019 |
| 6057 | 1020 // Get length of string 1 |
| 1021 Node* str1_len = load_String_length(no_ctrl, str1); | |
| 1022 | |
| 1023 Node* str2_value = load_String_value(no_ctrl, str2); | |
| 1024 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
|
1025 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
|
1026 |
| 6057 | 1027 Node* str2_len = NULL; |
| 1028 Node* result = NULL; | |
| 1029 | |
| 1030 switch (opcode) { | |
| 1031 case Op_StrIndexOf: | |
| 1032 // Get length of string 2 | |
| 1033 str2_len = load_String_length(no_ctrl, str2); | |
| 1034 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1035 result = new (C) StrIndexOfNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1036 str1_start, str1_len, str2_start, str2_len); |
| 1037 break; | |
| 1038 case Op_StrComp: | |
| 1039 // Get length of string 2 | |
| 1040 str2_len = load_String_length(no_ctrl, str2); | |
| 1041 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1042 result = new (C) StrCompNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1043 str1_start, str1_len, str2_start, str2_len); |
| 1044 break; | |
| 1045 case Op_StrEquals: | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1046 result = new (C) StrEqualsNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1047 str1_start, str2_start, str1_len); |
| 1048 break; | |
| 1049 default: | |
| 1050 ShouldNotReachHere(); | |
| 1051 return NULL; | |
| 1052 } | |
| 1053 | |
| 1054 // All these intrinsics have checks. | |
| 1055 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
| 1056 | |
| 1057 return _gvn.transform(result); | |
| 1058 } | |
| 1059 | |
| 1060 // Helper method for String intrinsic functions. This version is called | |
| 1061 // with str1 and str2 pointing to char[] nodes, with cnt1 and cnt2 pointing | |
| 1062 // to Int nodes containing the lenghts of str1 and str2. | |
| 1063 // | |
| 1064 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
|
1065 Node* result = NULL; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1066 switch (opcode) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1067 case Op_StrIndexOf: |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1068 result = new (C) StrIndexOfNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1069 str1_start, cnt1, str2_start, cnt2); |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1070 break; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1071 case Op_StrComp: |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1072 result = new (C) StrCompNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1073 str1_start, cnt1, str2_start, cnt2); |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1074 break; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1075 case Op_StrEquals: |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1076 result = new (C) StrEqualsNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1077 str1_start, str2_start, cnt1); |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1078 break; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1079 default: |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1080 ShouldNotReachHere(); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1081 return NULL; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1082 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1083 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1084 // All these intrinsics have checks. |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1085 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
|
1086 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1087 return _gvn.transform(result); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1088 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1089 |
| 0 | 1090 //------------------------------inline_string_compareTo------------------------ |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1091 // public int java.lang.String.compareTo(String anotherString); |
| 0 | 1092 bool LibraryCallKit::inline_string_compareTo() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1093 Node* receiver = null_check(argument(0)); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1094 Node* arg = null_check(argument(1)); |
| 0 | 1095 if (stopped()) { |
| 1096 return true; | |
| 1097 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1098 set_result(make_string_method_node(Op_StrComp, receiver, arg)); |
| 0 | 1099 return true; |
| 1100 } | |
| 1101 | |
| 681 | 1102 //------------------------------inline_string_equals------------------------ |
| 1103 bool LibraryCallKit::inline_string_equals() { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1104 Node* receiver = null_check_receiver(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1105 // 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
|
1106 // allows to specify NULL as argument. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1107 Node* argument = this->argument(1); |
| 681 | 1108 if (stopped()) { |
| 1109 return true; | |
| 1110 } | |
| 1111 | |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1112 // paths (plus control) merge |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1113 RegionNode* region = new (C) RegionNode(5); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1114 Node* phi = new (C) PhiNode(region, TypeInt::BOOL); |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1115 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1116 // does source == target string? |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1117 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
|
1118 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
|
1119 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1120 Node* if_eq = generate_slow_guard(bol, NULL); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1121 if (if_eq != NULL) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1122 // receiver == argument |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1123 phi->init_req(2, intcon(1)); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1124 region->init_req(2, if_eq); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1125 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1126 |
| 681 | 1127 // get String klass for instanceOf |
| 1128 ciInstanceKlass* klass = env()->String_klass(); | |
| 1129 | |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1130 if (!stopped()) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1131 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
|
1132 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
|
1133 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
|
1134 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1135 Node* inst_false = generate_guard(bol, NULL, PROB_MIN); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1136 //instanceOf == true, fallthrough |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1137 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1138 if (inst_false != NULL) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1139 phi->init_req(3, intcon(0)); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1140 region->init_req(3, inst_false); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1141 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1142 } |
| 681 | 1143 |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1144 if (!stopped()) { |
| 6057 | 1145 const TypeOopPtr* string_type = TypeOopPtr::make_from_klass(klass); |
| 1146 | |
|
1496
e8e83be27dd7
6951190: assert(!klass_is_exact(),"only non-exact klass") while building JDK
never
parents:
1396
diff
changeset
|
1147 // 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
|
1148 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
|
1149 // 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
|
1150 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
|
1151 |
| 6057 | 1152 Node* no_ctrl = NULL; |
| 1153 | |
| 1154 // Get start addr of receiver | |
| 1155 Node* receiver_val = load_String_value(no_ctrl, receiver); | |
| 1156 Node* receiver_offset = load_String_offset(no_ctrl, receiver); | |
| 1157 Node* receiver_start = array_element_address(receiver_val, receiver_offset, T_CHAR); | |
| 1158 | |
| 1159 // Get length of receiver | |
| 1160 Node* receiver_cnt = load_String_length(no_ctrl, receiver); | |
| 1161 | |
| 1162 // Get start addr of argument | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1163 Node* argument_val = load_String_value(no_ctrl, argument); |
| 6057 | 1164 Node* argument_offset = load_String_offset(no_ctrl, argument); |
| 1165 Node* argument_start = array_element_address(argument_val, argument_offset, T_CHAR); | |
| 1166 | |
| 1167 // Get length of argument | |
| 1168 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
|
1169 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1170 // Check for receiver count != argument count |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1171 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
|
1172 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
|
1173 Node* if_ne = generate_slow_guard(bol, NULL); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1174 if (if_ne != NULL) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1175 phi->init_req(4, intcon(0)); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1176 region->init_req(4, if_ne); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1177 } |
| 6057 | 1178 |
| 1179 // Check for count == 0 is done by assembler code for StrEquals. | |
| 1180 | |
| 1181 if (!stopped()) { | |
| 1182 Node* equals = make_string_method_node(Op_StrEquals, receiver_start, receiver_cnt, argument_start, argument_cnt); | |
| 1183 phi->init_req(1, equals); | |
| 1184 region->init_req(1, control()); | |
| 1185 } | |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1186 } |
| 681 | 1187 |
| 1188 // post merge | |
| 1189 set_control(_gvn.transform(region)); | |
| 1190 record_for_igvn(region); | |
| 1191 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1192 set_result(_gvn.transform(phi)); |
| 681 | 1193 return true; |
| 1194 } | |
| 1195 | |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1196 //------------------------------inline_array_equals---------------------------- |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1197 bool LibraryCallKit::inline_array_equals() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1198 Node* arg1 = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1199 Node* arg2 = argument(1); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1200 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
|
1201 return true; |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1202 } |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1203 |
| 0 | 1204 // Java version of String.indexOf(constant string) |
| 1205 // class StringDecl { | |
| 1206 // StringDecl(char[] ca) { | |
| 1207 // offset = 0; | |
| 1208 // count = ca.length; | |
| 1209 // value = ca; | |
| 1210 // } | |
| 1211 // int offset; | |
| 1212 // int count; | |
| 1213 // char[] value; | |
| 1214 // } | |
| 1215 // | |
| 1216 // static int string_indexOf_J(StringDecl string_object, char[] target_object, | |
| 1217 // int targetOffset, int cache_i, int md2) { | |
| 1218 // int cache = cache_i; | |
| 1219 // int sourceOffset = string_object.offset; | |
| 1220 // int sourceCount = string_object.count; | |
| 1221 // int targetCount = target_object.length; | |
| 1222 // | |
| 1223 // int targetCountLess1 = targetCount - 1; | |
| 1224 // int sourceEnd = sourceOffset + sourceCount - targetCountLess1; | |
| 1225 // | |
| 1226 // char[] source = string_object.value; | |
| 1227 // char[] target = target_object; | |
| 1228 // int lastChar = target[targetCountLess1]; | |
| 1229 // | |
| 1230 // outer_loop: | |
| 1231 // for (int i = sourceOffset; i < sourceEnd; ) { | |
| 1232 // int src = source[i + targetCountLess1]; | |
| 1233 // if (src == lastChar) { | |
| 1234 // // With random strings and a 4-character alphabet, | |
| 1235 // // reverse matching at this point sets up 0.8% fewer | |
| 1236 // // frames, but (paradoxically) makes 0.3% more probes. | |
| 1237 // // Since those probes are nearer the lastChar probe, | |
| 1238 // // there is may be a net D$ win with reverse matching. | |
| 1239 // // But, reversing loop inhibits unroll of inner loop | |
| 1240 // // for unknown reason. So, does running outer loop from | |
| 1241 // // (sourceOffset - targetCountLess1) to (sourceOffset + sourceCount) | |
| 1242 // for (int j = 0; j < targetCountLess1; j++) { | |
| 1243 // if (target[targetOffset + j] != source[i+j]) { | |
| 1244 // if ((cache & (1 << source[i+j])) == 0) { | |
| 1245 // if (md2 < j+1) { | |
| 1246 // i += j+1; | |
| 1247 // continue outer_loop; | |
| 1248 // } | |
| 1249 // } | |
| 1250 // i += md2; | |
| 1251 // continue outer_loop; | |
| 1252 // } | |
| 1253 // } | |
| 1254 // return i - sourceOffset; | |
| 1255 // } | |
| 1256 // if ((cache & (1 << src)) == 0) { | |
| 1257 // i += targetCountLess1; | |
| 1258 // } // using "i += targetCount;" and an "else i++;" causes a jump to jump. | |
| 1259 // i++; | |
| 1260 // } | |
| 1261 // return -1; | |
| 1262 // } | |
| 1263 | |
| 1264 //------------------------------string_indexOf------------------------ | |
| 1265 Node* LibraryCallKit::string_indexOf(Node* string_object, ciTypeArray* target_array, jint targetOffset_i, | |
| 1266 jint cache_i, jint md2_i) { | |
| 1267 | |
| 1268 Node* no_ctrl = NULL; | |
| 1269 float likely = PROB_LIKELY(0.9); | |
| 1270 float unlikely = PROB_UNLIKELY(0.9); | |
| 1271 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1272 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
|
1273 |
| 6057 | 1274 Node* source = load_String_value(no_ctrl, string_object); |
| 1275 Node* sourceOffset = load_String_offset(no_ctrl, string_object); | |
| 1276 Node* sourceCount = load_String_length(no_ctrl, string_object); | |
| 0 | 1277 |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1278 Node* target = _gvn.transform( makecon(TypeOopPtr::make_from_constant(target_array, true))); |
| 0 | 1279 jint target_length = target_array->length(); |
| 1280 const TypeAry* target_array_type = TypeAry::make(TypeInt::CHAR, TypeInt::make(0, target_length, Type::WidenMin)); | |
| 1281 const TypeAryPtr* target_type = TypeAryPtr::make(TypePtr::BotPTR, target_array_type, target_array->klass(), true, Type::OffsetBot); | |
| 1282 | |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
1283 IdealKit kit(this, false, true); |
| 0 | 1284 #define __ kit. |
| 1285 Node* zero = __ ConI(0); | |
| 1286 Node* one = __ ConI(1); | |
| 1287 Node* cache = __ ConI(cache_i); | |
| 1288 Node* md2 = __ ConI(md2_i); | |
| 1289 Node* lastChar = __ ConI(target_array->char_at(target_length - 1)); | |
| 1290 Node* targetCount = __ ConI(target_length); | |
| 1291 Node* targetCountLess1 = __ ConI(target_length - 1); | |
| 1292 Node* targetOffset = __ ConI(targetOffset_i); | |
| 1293 Node* sourceEnd = __ SubI(__ AddI(sourceOffset, sourceCount), targetCountLess1); | |
| 1294 | |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1295 IdealVariable rtn(kit), i(kit), j(kit); __ declarations_done(); |
| 0 | 1296 Node* outer_loop = __ make_label(2 /* goto */); |
| 1297 Node* return_ = __ make_label(1); | |
| 1298 | |
| 1299 __ set(rtn,__ ConI(-1)); | |
|
2383
9dc311b8473e
7008866: Missing loop predicate for loop with multiple entries
kvn
parents:
2324
diff
changeset
|
1300 __ loop(this, nargs, i, sourceOffset, BoolTest::lt, sourceEnd); { |
| 0 | 1301 Node* i2 = __ AddI(__ value(i), targetCountLess1); |
| 1302 // pin to prohibit loading of "next iteration" value which may SEGV (rare) | |
| 1303 Node* src = load_array_element(__ ctrl(), source, i2, TypeAryPtr::CHARS); | |
| 1304 __ if_then(src, BoolTest::eq, lastChar, unlikely); { | |
|
2383
9dc311b8473e
7008866: Missing loop predicate for loop with multiple entries
kvn
parents:
2324
diff
changeset
|
1305 __ loop(this, nargs, j, zero, BoolTest::lt, targetCountLess1); { |
| 0 | 1306 Node* tpj = __ AddI(targetOffset, __ value(j)); |
| 1307 Node* targ = load_array_element(no_ctrl, target, tpj, target_type); | |
| 1308 Node* ipj = __ AddI(__ value(i), __ value(j)); | |
| 1309 Node* src2 = load_array_element(no_ctrl, source, ipj, TypeAryPtr::CHARS); | |
| 1310 __ if_then(targ, BoolTest::ne, src2); { | |
| 1311 __ if_then(__ AndI(cache, __ LShiftI(one, src2)), BoolTest::eq, zero); { | |
| 1312 __ if_then(md2, BoolTest::lt, __ AddI(__ value(j), one)); { | |
| 1313 __ increment(i, __ AddI(__ value(j), one)); | |
| 1314 __ goto_(outer_loop); | |
| 1315 } __ end_if(); __ dead(j); | |
| 1316 }__ end_if(); __ dead(j); | |
| 1317 __ increment(i, md2); | |
| 1318 __ goto_(outer_loop); | |
| 1319 }__ end_if(); | |
| 1320 __ increment(j, one); | |
| 1321 }__ end_loop(); __ dead(j); | |
| 1322 __ set(rtn, __ SubI(__ value(i), sourceOffset)); __ dead(i); | |
| 1323 __ goto_(return_); | |
| 1324 }__ end_if(); | |
| 1325 __ if_then(__ AndI(cache, __ LShiftI(one, src)), BoolTest::eq, zero, likely); { | |
| 1326 __ increment(i, targetCountLess1); | |
| 1327 }__ end_if(); | |
| 1328 __ increment(i, one); | |
| 1329 __ bind(outer_loop); | |
| 1330 }__ end_loop(); __ dead(i); | |
| 1331 __ bind(return_); | |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1332 |
|
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1333 // Final sync IdealKit and GraphKit. |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
1334 final_sync(kit); |
| 0 | 1335 Node* result = __ value(rtn); |
| 1336 #undef __ | |
| 1337 C->set_has_loops(true); | |
| 1338 return result; | |
| 1339 } | |
| 1340 | |
| 1341 //------------------------------inline_string_indexOf------------------------ | |
| 1342 bool LibraryCallKit::inline_string_indexOf() { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1343 Node* receiver = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1344 Node* arg = argument(1); |
| 681 | 1345 |
| 1346 Node* result; | |
|
1504
ae8f909e5fc7
6948602: Disable use of SSE4.2 in String.indexOf intrinsic until 6942326 is fixed
iveresov
parents:
1396
diff
changeset
|
1347 // 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
|
1348 // 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
|
1349 if (Matcher::has_match_rule(Op_StrIndexOf) && |
| 681 | 1350 UseSSE42Intrinsics) { |
| 1351 // Generate SSE4.2 version of indexOf | |
| 1352 // We currently only have match rules that use SSE4.2 | |
| 1353 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1354 receiver = null_check(receiver); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1355 arg = null_check(arg); |
| 681 | 1356 if (stopped()) { |
| 1357 return true; | |
| 1358 } | |
| 1359 | |
|
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1360 ciInstanceKlass* str_klass = env()->String_klass(); |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1361 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
|
1362 |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1363 // Make the merge point |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1364 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
|
1365 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
|
1366 Node* no_ctrl = NULL; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1367 |
| 6057 | 1368 // Get start addr of source string |
| 1369 Node* source = load_String_value(no_ctrl, receiver); | |
| 1370 Node* source_offset = load_String_offset(no_ctrl, receiver); | |
| 1371 Node* source_start = array_element_address(source, source_offset, T_CHAR); | |
| 1372 | |
| 1373 // Get length of source string | |
| 1374 Node* source_cnt = load_String_length(no_ctrl, receiver); | |
| 1375 | |
| 1376 // Get start addr of substring | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1377 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
|
1378 Node* substr_offset = load_String_offset(no_ctrl, arg); |
| 6057 | 1379 Node* substr_start = array_element_address(substr, substr_offset, T_CHAR); |
| 1380 | |
| 1381 // Get length of source string | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1382 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
|
1383 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1384 // Check for substr count > string count |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1385 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
|
1386 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
|
1387 Node* if_gt = generate_slow_guard(bol, NULL); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1388 if (if_gt != NULL) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1389 result_phi->init_req(2, intcon(-1)); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1390 result_rgn->init_req(2, if_gt); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1391 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1392 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1393 if (!stopped()) { |
|
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1394 // Check for substr count == 0 |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1395 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
|
1396 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
|
1397 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
|
1398 if (if_zero != NULL) { |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1399 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
|
1400 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
|
1401 } |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1402 } |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1403 |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1404 if (!stopped()) { |
| 6057 | 1405 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
|
1406 result_phi->init_req(1, result); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1407 result_rgn->init_req(1, control()); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1408 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1409 set_control(_gvn.transform(result_rgn)); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1410 record_for_igvn(result_rgn); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1411 result = _gvn.transform(result_phi); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1412 |
|
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1413 } else { // Use LibraryCallKit::string_indexOf |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1414 // 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
|
1415 if (!arg->is_Con()) { |
| 681 | 1416 return false; |
| 1417 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1418 const TypeOopPtr* str_type = _gvn.type(arg)->isa_oopptr(); |
| 681 | 1419 if (str_type == NULL) { |
| 1420 return false; | |
| 1421 } | |
| 1422 ciInstanceKlass* klass = env()->String_klass(); | |
| 1423 ciObject* str_const = str_type->const_oop(); | |
| 1424 if (str_const == NULL || str_const->klass() != klass) { | |
| 1425 return false; | |
| 1426 } | |
| 1427 ciInstance* str = str_const->as_instance(); | |
| 1428 assert(str != NULL, "must be instance"); | |
| 1429 | |
| 6057 | 1430 ciObject* v = str->field_value_by_offset(java_lang_String::value_offset_in_bytes()).as_object(); |
| 681 | 1431 ciTypeArray* pat = v->as_type_array(); // pattern (argument) character array |
| 1432 | |
| 6057 | 1433 int o; |
| 1434 int c; | |
| 1435 if (java_lang_String::has_offset_field()) { | |
| 1436 o = str->field_value_by_offset(java_lang_String::offset_offset_in_bytes()).as_int(); | |
| 1437 c = str->field_value_by_offset(java_lang_String::count_offset_in_bytes()).as_int(); | |
| 1438 } else { | |
| 1439 o = 0; | |
| 1440 c = pat->length(); | |
| 1441 } | |
| 1442 | |
| 681 | 1443 // constant strings have no offset and count == length which |
| 1444 // simplifies the resulting code somewhat so lets optimize for that. | |
| 1445 if (o != 0 || c != pat->length()) { | |
| 1446 return false; | |
| 1447 } | |
| 1448 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1449 receiver = null_check(receiver, T_OBJECT); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1450 // NOTE: No null check on the argument is needed since it's a constant String oop. |
| 681 | 1451 if (stopped()) { |
|
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1452 return true; |
| 681 | 1453 } |
| 1454 | |
| 1455 // The null string as a pattern always returns 0 (match at beginning of string) | |
| 1456 if (c == 0) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1457 set_result(intcon(0)); |
| 681 | 1458 return true; |
| 1459 } | |
| 1460 | |
| 1461 // Generate default indexOf | |
| 1462 jchar lastChar = pat->char_at(o + (c - 1)); | |
| 1463 int cache = 0; | |
| 1464 int i; | |
| 1465 for (i = 0; i < c - 1; i++) { | |
| 1466 assert(i < pat->length(), "out of range"); | |
| 1467 cache |= (1 << (pat->char_at(o + i) & (sizeof(cache) * BitsPerByte - 1))); | |
| 1468 } | |
| 1469 | |
| 1470 int md2 = c; | |
| 1471 for (i = 0; i < c - 1; i++) { | |
| 1472 assert(i < pat->length(), "out of range"); | |
| 1473 if (pat->char_at(o + i) == lastChar) { | |
| 1474 md2 = (c - 1) - i; | |
| 1475 } | |
| 1476 } | |
| 1477 | |
| 1478 result = string_indexOf(receiver, pat, o, cache, md2); | |
| 0 | 1479 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1480 set_result(result); |
| 0 | 1481 return true; |
| 1482 } | |
| 1483 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1484 //--------------------------round_double_node-------------------------------- |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1485 // Round a double node if necessary. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1486 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
|
1487 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
|
1488 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
|
1489 return n; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1490 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1491 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1492 //------------------------------inline_math----------------------------------- |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1493 // public static double Math.abs(double) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1494 // public static double Math.sqrt(double) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1495 // public static double Math.log(double) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1496 // public static double Math.log10(double) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1497 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
|
1498 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
|
1499 Node* n; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1500 switch (id) { |
|
8076
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1501 case vmIntrinsics::_dabs: n = new (C) AbsDNode( arg); break; |
|
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1502 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
|
1503 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
|
1504 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
|
1505 default: fatal_unexpected_iid(id); break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1506 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1507 set_result(_gvn.transform(n)); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1508 return true; |
| 0 | 1509 } |
| 1510 | |
| 1511 //------------------------------inline_trig---------------------------------- | |
| 1512 // Inline sin/cos/tan instructions, if possible. If rounding is required, do | |
| 1513 // argument reduction which will turn into a fast/slow diamond. | |
| 1514 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
|
1515 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
|
1516 Node* n = NULL; |
| 0 | 1517 |
| 1518 switch (id) { | |
|
8076
c59b7900a2bd
8007959: Use expensive node logic for more math nodes
roland
parents:
8048
diff
changeset
|
1519 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
|
1520 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
|
1521 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
|
1522 default: fatal_unexpected_iid(id); break; |
| 0 | 1523 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1524 n = _gvn.transform(n); |
| 0 | 1525 |
| 1526 // 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
|
1527 if (Matcher::strict_fp_requires_explicit_rounding) { |
| 0 | 1528 static const double pi_4 = 0.7853981633974483; |
| 1529 static const double neg_pi_4 = -0.7853981633974483; | |
| 1530 // pi/2 in 80-bit extended precision | |
| 1531 // static const unsigned char pi_2_bits_x[] = {0x35,0xc2,0x68,0x21,0xa2,0xda,0x0f,0xc9,0xff,0x3f,0x00,0x00,0x00,0x00,0x00,0x00}; | |
| 1532 // -pi/2 in 80-bit extended precision | |
| 1533 // 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}; | |
| 1534 // Cutoff value for using this argument reduction technique | |
| 1535 //static const double pi_2_minus_epsilon = 1.564660403643354; | |
| 1536 //static const double neg_pi_2_plus_epsilon = -1.564660403643354; | |
| 1537 | |
| 1538 // Pseudocode for sin: | |
| 1539 // if (x <= Math.PI / 4.0) { | |
| 1540 // if (x >= -Math.PI / 4.0) return fsin(x); | |
| 1541 // if (x >= -Math.PI / 2.0) return -fcos(x + Math.PI / 2.0); | |
| 1542 // } else { | |
| 1543 // if (x <= Math.PI / 2.0) return fcos(x - Math.PI / 2.0); | |
| 1544 // } | |
| 1545 // return StrictMath.sin(x); | |
| 1546 | |
| 1547 // Pseudocode for cos: | |
| 1548 // if (x <= Math.PI / 4.0) { | |
| 1549 // if (x >= -Math.PI / 4.0) return fcos(x); | |
| 1550 // if (x >= -Math.PI / 2.0) return fsin(x + Math.PI / 2.0); | |
| 1551 // } else { | |
| 1552 // if (x <= Math.PI / 2.0) return -fsin(x - Math.PI / 2.0); | |
| 1553 // } | |
| 1554 // return StrictMath.cos(x); | |
| 1555 | |
| 1556 // Actually, sticking in an 80-bit Intel value into C2 will be tough; it | |
| 1557 // requires a special machine instruction to load it. Instead we'll try | |
| 1558 // the 'easy' case. If we really need the extra range +/- PI/2 we'll | |
| 1559 // probably do the math inside the SIN encoding. | |
| 1560 | |
| 1561 // Make the merge point | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1562 RegionNode* r = new (C) RegionNode(3); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1563 Node* phi = new (C) PhiNode(r, Type::DOUBLE); |
| 0 | 1564 |
| 1565 // 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
|
1566 Node *abs = _gvn.transform(new (C) AbsDNode(arg)); |
| 0 | 1567 // Node for PI/4 constant |
| 1568 Node *pi4 = makecon(TypeD::make(pi_4)); | |
| 1569 // Check PI/4 : abs(arg) | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1570 Node *cmp = _gvn.transform(new (C) CmpDNode(pi4,abs)); |
| 0 | 1571 // 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
|
1572 Node *bol = _gvn.transform(new (C) BoolNode( cmp, BoolTest::lt )); |
| 0 | 1573 // Branch either way |
| 1574 IfNode *iff = create_and_xform_if(control(),bol, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
| 1575 set_control(opt_iff(r,iff)); | |
| 1576 | |
| 1577 // Set fast path result | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1578 phi->init_req(2, n); |
| 0 | 1579 |
| 1580 // Slow path - non-blocking leaf call | |
| 1581 Node* call = NULL; | |
| 1582 switch (id) { | |
| 1583 case vmIntrinsics::_dsin: | |
| 1584 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(), | |
| 1585 CAST_FROM_FN_PTR(address, SharedRuntime::dsin), | |
| 1586 "Sin", NULL, arg, top()); | |
| 1587 break; | |
| 1588 case vmIntrinsics::_dcos: | |
| 1589 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(), | |
| 1590 CAST_FROM_FN_PTR(address, SharedRuntime::dcos), | |
| 1591 "Cos", NULL, arg, top()); | |
| 1592 break; | |
| 1593 case vmIntrinsics::_dtan: | |
| 1594 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(), | |
| 1595 CAST_FROM_FN_PTR(address, SharedRuntime::dtan), | |
| 1596 "Tan", NULL, arg, top()); | |
| 1597 break; | |
| 1598 } | |
| 1599 assert(control()->in(0) == call, ""); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1600 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
|
1601 r->init_req(1, control()); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1602 phi->init_req(1, slow_result); |
| 0 | 1603 |
| 1604 // Post-merge | |
| 1605 set_control(_gvn.transform(r)); | |
| 1606 record_for_igvn(r); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1607 n = _gvn.transform(phi); |
| 0 | 1608 |
| 1609 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
| 1610 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1611 set_result(n); |
| 0 | 1612 return true; |
| 1613 } | |
| 1614 | |
| 6205 | 1615 void LibraryCallKit::finish_pow_exp(Node* result, Node* x, Node* y, const TypeFunc* call_type, address funcAddr, const char* funcName) { |
| 1616 //------------------- | |
| 1617 //result=(result.isNaN())? funcAddr():result; | |
| 1618 // Check: If isNaN() by checking result!=result? then either trap | |
| 1619 // or go to runtime | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1620 Node* cmpisnan = _gvn.transform(new (C) CmpDNode(result, result)); |
| 6205 | 1621 // Build the boolean node |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1622 Node* bolisnum = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::eq)); |
| 6205 | 1623 |
| 1624 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
|
1625 { BuildCutout unless(this, bolisnum, PROB_STATIC_FREQUENT); |
| 6205 | 1626 // The pow or exp intrinsic returned a NaN, which requires a call |
| 1627 // to the runtime. Recompile with the runtime call. | |
| 1628 uncommon_trap(Deoptimization::Reason_intrinsic, | |
| 1629 Deoptimization::Action_make_not_entrant); | |
| 1630 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1631 set_result(result); |
| 6205 | 1632 } else { |
| 1633 // If this inlining ever returned NaN in the past, we compile a call | |
| 1634 // to the runtime to properly handle corner cases | |
| 1635 | |
| 1636 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
|
1637 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
|
1638 Node* if_fast = _gvn.transform(new (C) IfTrueNode(iff)); |
| 6205 | 1639 |
| 1640 if (!if_slow->is_top()) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1641 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
|
1642 PhiNode* result_val = new (C) PhiNode(result_region, Type::DOUBLE); |
| 6205 | 1643 |
| 1644 result_region->init_req(1, if_fast); | |
| 1645 result_val->init_req(1, result); | |
| 1646 | |
| 1647 set_control(if_slow); | |
| 1648 | |
| 1649 const TypePtr* no_memory_effects = NULL; | |
| 1650 Node* rt = make_runtime_call(RC_LEAF, call_type, funcAddr, funcName, | |
| 1651 no_memory_effects, | |
| 1652 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
|
1653 Node* value = _gvn.transform(new (C) ProjNode(rt, TypeFunc::Parms+0)); |
| 6205 | 1654 #ifdef ASSERT |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1655 Node* value_top = _gvn.transform(new (C) ProjNode(rt, TypeFunc::Parms+1)); |
| 6205 | 1656 assert(value_top == top(), "second value must be top"); |
| 1657 #endif | |
| 1658 | |
| 1659 result_region->init_req(2, control()); | |
| 1660 result_val->init_req(2, value); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1661 set_result(result_region, result_val); |
| 6205 | 1662 } else { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1663 set_result(result); |
| 6205 | 1664 } |
| 1665 } | |
| 1666 } | |
| 1667 | |
| 0 | 1668 //------------------------------inline_exp------------------------------------- |
| 1669 // Inline exp instructions, if possible. The Intel hardware only misses | |
| 1670 // 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
|
1671 bool LibraryCallKit::inline_exp() { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1672 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
|
1673 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
|
1674 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1675 finish_pow_exp(n, arg, NULL, OptoRuntime::Math_D_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dexp), "EXP"); |
| 0 | 1676 |
| 1677 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
| 1678 return true; | |
| 1679 } | |
| 1680 | |
| 1681 //------------------------------inline_pow------------------------------------- | |
| 1682 // Inline power instructions, if possible. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1683 bool LibraryCallKit::inline_pow() { |
| 0 | 1684 // Pseudocode for pow |
| 1685 // if (x <= 0.0) { | |
| 6205 | 1686 // long longy = (long)y; |
| 1687 // if ((double)longy == y) { // if y is long | |
| 1688 // if (y + 1 == y) longy = 0; // huge number: even | |
| 1689 // result = ((1&longy) == 0)?-DPow(abs(x), y):DPow(abs(x), y); | |
| 0 | 1690 // } else { |
| 1691 // result = NaN; | |
| 1692 // } | |
| 1693 // } else { | |
| 1694 // result = DPow(x,y); | |
| 1695 // } | |
| 1696 // if (result != result)? { | |
| 6205 | 1697 // result = uncommon_trap() or runtime_call(); |
| 0 | 1698 // } |
| 1699 // return result; | |
| 1700 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1701 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
|
1702 Node* y = round_double_node(argument(2)); |
| 0 | 1703 |
| 6205 | 1704 Node* result = NULL; |
| 1705 | |
| 1706 if (!too_many_traps(Deoptimization::Reason_intrinsic)) { | |
| 1707 // 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
|
1708 result = _gvn.transform(new (C) PowDNode(C, control(), x, y)); |
| 0 | 1709 } else { |
| 6205 | 1710 // If this inlining ever returned NaN in the past, include all |
| 1711 // checks + call to the runtime. | |
| 0 | 1712 |
| 1713 // Set the merge point for If node with condition of (x <= 0.0) | |
| 1714 // 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
|
1715 RegionNode *r = new (C) RegionNode(4); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1716 Node *phi = new (C) PhiNode(r, Type::DOUBLE); |
| 0 | 1717 |
| 1718 // Build the first if node: if (x <= 0.0) | |
| 1719 // Node for 0 constant | |
| 1720 Node *zeronode = makecon(TypeD::ZERO); | |
| 1721 // Check x:0 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1722 Node *cmp = _gvn.transform(new (C) CmpDNode(x, zeronode)); |
| 0 | 1723 // 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
|
1724 Node *bol1 = _gvn.transform(new (C) BoolNode( cmp, BoolTest::le )); |
| 0 | 1725 // Branch either way |
| 1726 IfNode *if1 = create_and_xform_if(control(),bol1, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN); | |
| 1727 // 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
|
1728 Node *fast_taken = _gvn.transform(new (C) IfFalseNode(if1)); |
| 0 | 1729 r->init_req(3,fast_taken); // Capture fast-control |
| 1730 | |
| 1731 // 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
|
1732 Node *complex_path = _gvn.transform(new (C) IfTrueNode(if1)); |
| 0 | 1733 |
| 1734 // Set fast path result | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1735 Node *fast_result = _gvn.transform(new (C) PowDNode(C, control(), x, y)); |
| 0 | 1736 phi->init_req(3, fast_result); |
| 1737 | |
| 1738 // Complex path | |
| 6205 | 1739 // Build the second if node (if y is long) |
| 1740 // Node for (long)y | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1741 Node *longy = _gvn.transform(new (C) ConvD2LNode(y)); |
| 6205 | 1742 // Node for (double)((long) y) |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1743 Node *doublelongy= _gvn.transform(new (C) ConvL2DNode(longy)); |
| 6205 | 1744 // Check (double)((long) y) : y |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1745 Node *cmplongy= _gvn.transform(new (C) CmpDNode(doublelongy, y)); |
| 6205 | 1746 // Check if (y isn't long) then go to slow path |
| 1747 | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1748 Node *bol2 = _gvn.transform(new (C) BoolNode( cmplongy, BoolTest::ne )); |
| 605 | 1749 // Branch either way |
| 0 | 1750 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
|
1751 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
|
1752 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1753 Node *slow_path = _gvn.transform(new (C) IfTrueNode(if2)); |
| 6205 | 1754 |
| 1755 // Calculate DPow(abs(x), y)*(1 & (long)y) | |
| 0 | 1756 // Node for constant 1 |
| 6205 | 1757 Node *conone = longcon(1); |
| 1758 // 1& (long)y | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1759 Node *signnode= _gvn.transform(new (C) AndLNode(conone, longy)); |
| 6205 | 1760 |
| 1761 // A huge number is always even. Detect a huge number by checking | |
| 1762 // if y + 1 == y and set integer to be tested for parity to 0. | |
| 1763 // Required for corner case: | |
| 1764 // (long)9.223372036854776E18 = max_jlong | |
| 1765 // (double)(long)9.223372036854776E18 = 9.223372036854776E18 | |
| 1766 // 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
|
1767 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
|
1768 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
|
1769 Node *bolyplus1 = _gvn.transform(new (C) BoolNode( cmpyplus1, BoolTest::eq )); |
| 6205 | 1770 Node* correctedsign = NULL; |
| 1771 if (ConditionalMoveLimit != 0) { | |
| 1772 correctedsign = _gvn.transform( CMoveNode::make(C, NULL, bolyplus1, signnode, longcon(0), TypeLong::LONG)); | |
| 1773 } else { | |
| 1774 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
|
1775 RegionNode *r = new (C) RegionNode(3); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1776 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
|
1777 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
|
1778 r->init_req(2, _gvn.transform(new (C) IfTrueNode(ifyplus1))); |
| 6205 | 1779 phi->init_req(1, signnode); |
| 1780 phi->init_req(2, longcon(0)); | |
| 1781 correctedsign = _gvn.transform(phi); | |
| 1782 ylong_path = _gvn.transform(r); | |
| 1783 record_for_igvn(r); | |
| 1784 } | |
| 1785 | |
| 0 | 1786 // zero node |
| 6205 | 1787 Node *conzero = longcon(0); |
| 1788 // Check (1&(long)y)==0? | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1789 Node *cmpeq1 = _gvn.transform(new (C) CmpLNode(correctedsign, conzero)); |
| 6205 | 1790 // 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
|
1791 Node *bol3 = _gvn.transform(new (C) BoolNode( cmpeq1, BoolTest::ne )); |
| 0 | 1792 // abs(x) |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1793 Node *absx=_gvn.transform(new (C) AbsDNode(x)); |
| 0 | 1794 // abs(x)^y |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1795 Node *absxpowy = _gvn.transform(new (C) PowDNode(C, control(), absx, y)); |
| 0 | 1796 // -abs(x)^y |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1797 Node *negabsxpowy = _gvn.transform(new (C) NegDNode (absxpowy)); |
| 6205 | 1798 // (1&(long)y)==1?-DPow(abs(x), y):DPow(abs(x), y) |
| 1799 Node *signresult = NULL; | |
| 1800 if (ConditionalMoveLimit != 0) { | |
| 1801 signresult = _gvn.transform( CMoveNode::make(C, NULL, bol3, absxpowy, negabsxpowy, Type::DOUBLE)); | |
| 1802 } else { | |
| 1803 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
|
1804 RegionNode *r = new (C) RegionNode(3); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1805 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
|
1806 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
|
1807 r->init_req(2, _gvn.transform(new (C) IfTrueNode(ifyeven))); |
| 6205 | 1808 phi->init_req(1, absxpowy); |
| 1809 phi->init_req(2, negabsxpowy); | |
| 1810 signresult = _gvn.transform(phi); | |
| 1811 ylong_path = _gvn.transform(r); | |
| 1812 record_for_igvn(r); | |
| 1813 } | |
| 0 | 1814 // Set complex path fast result |
| 6205 | 1815 r->init_req(2, ylong_path); |
| 0 | 1816 phi->init_req(2, signresult); |
| 1817 | |
| 1818 static const jlong nan_bits = CONST64(0x7ff8000000000000); | |
| 1819 Node *slow_result = makecon(TypeD::make(*(double*)&nan_bits)); // return NaN | |
| 1820 r->init_req(1,slow_path); | |
| 1821 phi->init_req(1,slow_result); | |
| 1822 | |
| 1823 // Post merge | |
| 1824 set_control(_gvn.transform(r)); | |
| 1825 record_for_igvn(r); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1826 result = _gvn.transform(phi); |
| 0 | 1827 } |
| 1828 | |
| 6205 | 1829 finish_pow_exp(result, x, y, OptoRuntime::Math_DD_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dpow), "POW"); |
| 0 | 1830 |
| 1831 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
| 1832 return true; | |
| 1833 } | |
| 1834 | |
| 1835 //------------------------------runtime_math----------------------------- | |
| 1836 bool LibraryCallKit::runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName) { | |
| 1837 assert(call_type == OptoRuntime::Math_DD_D_Type() || call_type == OptoRuntime::Math_D_D_Type(), | |
| 1838 "must be (DD)D or (D)D type"); | |
| 1839 | |
| 1840 // Inputs | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1841 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
|
1842 Node* b = (call_type == OptoRuntime::Math_DD_D_Type()) ? round_double_node(argument(2)) : NULL; |
| 0 | 1843 |
| 1844 const TypePtr* no_memory_effects = NULL; | |
| 1845 Node* trig = make_runtime_call(RC_LEAF, call_type, funcAddr, funcName, | |
| 1846 no_memory_effects, | |
| 1847 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
|
1848 Node* value = _gvn.transform(new (C) ProjNode(trig, TypeFunc::Parms+0)); |
| 0 | 1849 #ifdef ASSERT |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1850 Node* value_top = _gvn.transform(new (C) ProjNode(trig, TypeFunc::Parms+1)); |
| 0 | 1851 assert(value_top == top(), "second value must be top"); |
| 1852 #endif | |
| 1853 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1854 set_result(value); |
| 0 | 1855 return true; |
| 1856 } | |
| 1857 | |
| 1858 //------------------------------inline_math_native----------------------------- | |
| 1859 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
|
1860 #define FN_PTR(f) CAST_FROM_FN_PTR(address, f) |
| 0 | 1861 switch (id) { |
| 1862 // 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
|
1863 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
|
1864 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
|
1865 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
|
1866 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
|
1867 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
|
1868 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
|
1869 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1870 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
|
1871 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
|
1872 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
|
1873 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dlog10), "LOG10"); |
| 0 | 1874 |
| 1875 // These intrinsics are supported on all hardware | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1876 case vmIntrinsics::_dsqrt: return Matcher::has_match_rule(Op_SqrtD) ? inline_math(id) : false; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1877 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
|
1878 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1879 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
|
1880 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
|
1881 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
|
1882 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
|
1883 #undef FN_PTR |
| 0 | 1884 |
| 1885 // These intrinsics are not yet correctly implemented | |
| 1886 case vmIntrinsics::_datan2: | |
| 1887 return false; | |
| 1888 | |
| 1889 default: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1890 fatal_unexpected_iid(id); |
| 0 | 1891 return false; |
| 1892 } | |
| 1893 } | |
| 1894 | |
| 1895 static bool is_simple_name(Node* n) { | |
| 1896 return (n->req() == 1 // constant | |
| 1897 || (n->is_Type() && n->as_Type()->type()->singleton()) | |
| 1898 || n->is_Proj() // parameter or return value | |
| 1899 || n->is_Phi() // local of some sort | |
| 1900 ); | |
| 1901 } | |
| 1902 | |
| 1903 //----------------------------inline_min_max----------------------------------- | |
| 1904 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
|
1905 set_result(generate_min_max(id, argument(0), argument(1))); |
| 0 | 1906 return true; |
| 1907 } | |
| 1908 | |
| 1909 Node* | |
| 1910 LibraryCallKit::generate_min_max(vmIntrinsics::ID id, Node* x0, Node* y0) { | |
| 1911 // These are the candidate return value: | |
| 1912 Node* xvalue = x0; | |
| 1913 Node* yvalue = y0; | |
| 1914 | |
| 1915 if (xvalue == yvalue) { | |
| 1916 return xvalue; | |
| 1917 } | |
| 1918 | |
| 1919 bool want_max = (id == vmIntrinsics::_max); | |
| 1920 | |
| 1921 const TypeInt* txvalue = _gvn.type(xvalue)->isa_int(); | |
| 1922 const TypeInt* tyvalue = _gvn.type(yvalue)->isa_int(); | |
| 1923 if (txvalue == NULL || tyvalue == NULL) return top(); | |
| 1924 // This is not really necessary, but it is consistent with a | |
| 1925 // hypothetical MaxINode::Value method: | |
| 1926 int widen = MAX2(txvalue->_widen, tyvalue->_widen); | |
| 1927 | |
| 1928 // %%% This folding logic should (ideally) be in a different place. | |
| 1929 // Some should be inside IfNode, and there to be a more reliable | |
| 1930 // transformation of ?: style patterns into cmoves. We also want | |
| 1931 // more powerful optimizations around cmove and min/max. | |
| 1932 | |
| 1933 // Try to find a dominating comparison of these guys. | |
| 1934 // It can simplify the index computation for Arrays.copyOf | |
| 1935 // and similar uses of System.arraycopy. | |
| 1936 // First, compute the normalized version of CmpI(x, y). | |
| 1937 int cmp_op = Op_CmpI; | |
| 1938 Node* xkey = xvalue; | |
| 1939 Node* ykey = yvalue; | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
1940 Node* ideal_cmpxy = _gvn.transform(new(C) CmpINode(xkey, ykey)); |
| 0 | 1941 if (ideal_cmpxy->is_Cmp()) { |
| 1942 // E.g., if we have CmpI(length - offset, count), | |
| 1943 // it might idealize to CmpI(length, count + offset) | |
| 1944 cmp_op = ideal_cmpxy->Opcode(); | |
| 1945 xkey = ideal_cmpxy->in(1); | |
| 1946 ykey = ideal_cmpxy->in(2); | |
| 1947 } | |
| 1948 | |
| 1949 // Start by locating any relevant comparisons. | |
| 1950 Node* start_from = (xkey->outcnt() < ykey->outcnt()) ? xkey : ykey; | |
| 1951 Node* cmpxy = NULL; | |
| 1952 Node* cmpyx = NULL; | |
| 1953 for (DUIterator_Fast kmax, k = start_from->fast_outs(kmax); k < kmax; k++) { | |
| 1954 Node* cmp = start_from->fast_out(k); | |
| 1955 if (cmp->outcnt() > 0 && // must have prior uses | |
| 1956 cmp->in(0) == NULL && // must be context-independent | |
| 1957 cmp->Opcode() == cmp_op) { // right kind of compare | |
| 1958 if (cmp->in(1) == xkey && cmp->in(2) == ykey) cmpxy = cmp; | |
| 1959 if (cmp->in(1) == ykey && cmp->in(2) == xkey) cmpyx = cmp; | |
| 1960 } | |
| 1961 } | |
| 1962 | |
| 1963 const int NCMPS = 2; | |
| 1964 Node* cmps[NCMPS] = { cmpxy, cmpyx }; | |
| 1965 int cmpn; | |
| 1966 for (cmpn = 0; cmpn < NCMPS; cmpn++) { | |
| 1967 if (cmps[cmpn] != NULL) break; // find a result | |
| 1968 } | |
| 1969 if (cmpn < NCMPS) { | |
| 1970 // Look for a dominating test that tells us the min and max. | |
| 1971 int depth = 0; // Limit search depth for speed | |
| 1972 Node* dom = control(); | |
| 1973 for (; dom != NULL; dom = IfNode::up_one_dom(dom, true)) { | |
| 1974 if (++depth >= 100) break; | |
| 1975 Node* ifproj = dom; | |
| 1976 if (!ifproj->is_Proj()) continue; | |
| 1977 Node* iff = ifproj->in(0); | |
| 1978 if (!iff->is_If()) continue; | |
| 1979 Node* bol = iff->in(1); | |
| 1980 if (!bol->is_Bool()) continue; | |
| 1981 Node* cmp = bol->in(1); | |
| 1982 if (cmp == NULL) continue; | |
| 1983 for (cmpn = 0; cmpn < NCMPS; cmpn++) | |
| 1984 if (cmps[cmpn] == cmp) break; | |
| 1985 if (cmpn == NCMPS) continue; | |
| 1986 BoolTest::mask btest = bol->as_Bool()->_test._test; | |
| 1987 if (ifproj->is_IfFalse()) btest = BoolTest(btest).negate(); | |
| 1988 if (cmp->in(1) == ykey) btest = BoolTest(btest).commute(); | |
| 1989 // At this point, we know that 'x btest y' is true. | |
| 1990 switch (btest) { | |
| 1991 case BoolTest::eq: | |
| 1992 // They are proven equal, so we can collapse the min/max. | |
| 1993 // Either value is the answer. Choose the simpler. | |
| 1994 if (is_simple_name(yvalue) && !is_simple_name(xvalue)) | |
| 1995 return yvalue; | |
| 1996 return xvalue; | |
| 1997 case BoolTest::lt: // x < y | |
| 1998 case BoolTest::le: // x <= y | |
| 1999 return (want_max ? yvalue : xvalue); | |
| 2000 case BoolTest::gt: // x > y | |
| 2001 case BoolTest::ge: // x >= y | |
| 2002 return (want_max ? xvalue : yvalue); | |
| 2003 } | |
| 2004 } | |
| 2005 } | |
| 2006 | |
| 2007 // We failed to find a dominating test. | |
| 2008 // Let's pick a test that might GVN with prior tests. | |
| 2009 Node* best_bol = NULL; | |
| 2010 BoolTest::mask best_btest = BoolTest::illegal; | |
| 2011 for (cmpn = 0; cmpn < NCMPS; cmpn++) { | |
| 2012 Node* cmp = cmps[cmpn]; | |
| 2013 if (cmp == NULL) continue; | |
| 2014 for (DUIterator_Fast jmax, j = cmp->fast_outs(jmax); j < jmax; j++) { | |
| 2015 Node* bol = cmp->fast_out(j); | |
| 2016 if (!bol->is_Bool()) continue; | |
| 2017 BoolTest::mask btest = bol->as_Bool()->_test._test; | |
| 2018 if (btest == BoolTest::eq || btest == BoolTest::ne) continue; | |
| 2019 if (cmp->in(1) == ykey) btest = BoolTest(btest).commute(); | |
| 2020 if (bol->outcnt() > (best_bol == NULL ? 0 : best_bol->outcnt())) { | |
| 2021 best_bol = bol->as_Bool(); | |
| 2022 best_btest = btest; | |
| 2023 } | |
| 2024 } | |
| 2025 } | |
| 2026 | |
| 2027 Node* answer_if_true = NULL; | |
| 2028 Node* answer_if_false = NULL; | |
| 2029 switch (best_btest) { | |
| 2030 default: | |
| 2031 if (cmpxy == NULL) | |
| 2032 cmpxy = ideal_cmpxy; | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
2033 best_bol = _gvn.transform(new(C) BoolNode(cmpxy, BoolTest::lt)); |
| 0 | 2034 // and fall through: |
| 2035 case BoolTest::lt: // x < y | |
| 2036 case BoolTest::le: // x <= y | |
| 2037 answer_if_true = (want_max ? yvalue : xvalue); | |
| 2038 answer_if_false = (want_max ? xvalue : yvalue); | |
| 2039 break; | |
| 2040 case BoolTest::gt: // x > y | |
| 2041 case BoolTest::ge: // x >= y | |
| 2042 answer_if_true = (want_max ? xvalue : yvalue); | |
| 2043 answer_if_false = (want_max ? yvalue : xvalue); | |
| 2044 break; | |
| 2045 } | |
| 2046 | |
| 2047 jint hi, lo; | |
| 2048 if (want_max) { | |
| 2049 // We can sharpen the minimum. | |
| 2050 hi = MAX2(txvalue->_hi, tyvalue->_hi); | |
| 2051 lo = MAX2(txvalue->_lo, tyvalue->_lo); | |
| 2052 } else { | |
| 2053 // We can sharpen the maximum. | |
| 2054 hi = MIN2(txvalue->_hi, tyvalue->_hi); | |
| 2055 lo = MIN2(txvalue->_lo, tyvalue->_lo); | |
| 2056 } | |
| 2057 | |
| 2058 // Use a flow-free graph structure, to avoid creating excess control edges | |
| 2059 // which could hinder other optimizations. | |
| 2060 // Since Math.min/max is often used with arraycopy, we want | |
| 2061 // tightly_coupled_allocation to be able to see beyond min/max expressions. | |
| 2062 Node* cmov = CMoveNode::make(C, NULL, best_bol, | |
| 2063 answer_if_false, answer_if_true, | |
| 2064 TypeInt::make(lo, hi, widen)); | |
| 2065 | |
| 2066 return _gvn.transform(cmov); | |
| 2067 | |
| 2068 /* | |
| 2069 // This is not as desirable as it may seem, since Min and Max | |
| 2070 // nodes do not have a full set of optimizations. | |
| 2071 // And they would interfere, anyway, with 'if' optimizations | |
| 2072 // and with CMoveI canonical forms. | |
| 2073 switch (id) { | |
| 2074 case vmIntrinsics::_min: | |
| 2075 result_val = _gvn.transform(new (C, 3) MinINode(x,y)); break; | |
| 2076 case vmIntrinsics::_max: | |
| 2077 result_val = _gvn.transform(new (C, 3) MaxINode(x,y)); break; | |
| 2078 default: | |
| 2079 ShouldNotReachHere(); | |
| 2080 } | |
| 2081 */ | |
| 2082 } | |
| 2083 | |
| 2084 inline int | |
| 2085 LibraryCallKit::classify_unsafe_addr(Node* &base, Node* &offset) { | |
| 2086 const TypePtr* base_type = TypePtr::NULL_PTR; | |
| 2087 if (base != NULL) base_type = _gvn.type(base)->isa_ptr(); | |
| 2088 if (base_type == NULL) { | |
| 2089 // Unknown type. | |
| 2090 return Type::AnyPtr; | |
| 2091 } else if (base_type == TypePtr::NULL_PTR) { | |
| 2092 // 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
|
2093 base = _gvn.transform(new (C) CastX2PNode(offset)); |
| 0 | 2094 offset = MakeConX(0); |
| 2095 return Type::RawPtr; | |
| 2096 } else if (base_type->base() == Type::RawPtr) { | |
| 2097 return Type::RawPtr; | |
| 2098 } else if (base_type->isa_oopptr()) { | |
| 2099 // Base is never null => always a heap address. | |
| 2100 if (base_type->ptr() == TypePtr::NotNull) { | |
| 2101 return Type::OopPtr; | |
| 2102 } | |
| 2103 // Offset is small => always a heap address. | |
| 2104 const TypeX* offset_type = _gvn.type(offset)->isa_intptr_t(); | |
| 2105 if (offset_type != NULL && | |
| 2106 base_type->offset() == 0 && // (should always be?) | |
| 2107 offset_type->_lo >= 0 && | |
| 2108 !MacroAssembler::needs_explicit_null_check(offset_type->_hi)) { | |
| 2109 return Type::OopPtr; | |
| 2110 } | |
| 2111 // Otherwise, it might either be oop+off or NULL+addr. | |
| 2112 return Type::AnyPtr; | |
| 2113 } else { | |
| 2114 // No information: | |
| 2115 return Type::AnyPtr; | |
| 2116 } | |
| 2117 } | |
| 2118 | |
| 2119 inline Node* LibraryCallKit::make_unsafe_address(Node* base, Node* offset) { | |
| 2120 int kind = classify_unsafe_addr(base, offset); | |
| 2121 if (kind == Type::RawPtr) { | |
| 2122 return basic_plus_adr(top(), base, offset); | |
| 2123 } else { | |
| 2124 return basic_plus_adr(base, offset); | |
| 2125 } | |
| 2126 } | |
| 2127 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2128 //--------------------------inline_number_methods----------------------------- |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2129 // inline int Integer.numberOfLeadingZeros(int) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2130 // inline int Long.numberOfLeadingZeros(long) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2131 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2132 // inline int Integer.numberOfTrailingZeros(int) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2133 // inline int Long.numberOfTrailingZeros(long) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2134 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2135 // inline int Integer.bitCount(int) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2136 // inline int Long.bitCount(long) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2137 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2138 // inline char Character.reverseBytes(char) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2139 // inline short Short.reverseBytes(short) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2140 // inline int Integer.reverseBytes(int) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2141 // inline long Long.reverseBytes(long) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2142 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
|
2143 Node* arg = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2144 Node* n; |
|
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
2145 switch (id) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2146 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
|
2147 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
|
2148 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
|
2149 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
|
2150 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
|
2151 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
|
2152 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
|
2153 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
|
2154 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
|
2155 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
|
2156 default: fatal_unexpected_iid(id); break; |
|
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
2157 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2158 set_result(_gvn.transform(n)); |
| 0 | 2159 return true; |
| 2160 } | |
| 2161 | |
| 2162 //----------------------------inline_unsafe_access---------------------------- | |
| 2163 | |
| 2164 const static BasicType T_ADDRESS_HOLDER = T_LONG; | |
| 2165 | |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2166 // 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
|
2167 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
|
2168 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
|
2169 // 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
|
2170 // 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
|
2171 // 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
|
2172 // 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
|
2173 // 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
|
2174 // 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
|
2175 if (!UseG1GC && !need_mem_bar) |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2176 return; |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2177 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2178 // Some compile time checks. |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2179 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2180 // 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
|
2181 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
|
2182 if (otype != NULL && otype->is_con() && |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2183 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
|
2184 // 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
|
2185 return; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2186 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2187 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2188 // 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
|
2189 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
|
2190 if (btype != NULL) { |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2191 if (btype->isa_aryptr()) { |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2192 // Array type so nothing to do |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2193 return; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2194 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2195 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2196 const TypeInstPtr* itype = btype->isa_instptr(); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2197 if (itype != NULL) { |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2198 // 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
|
2199 // _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
|
2200 ciKlass* klass = itype->klass(); |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2201 if ( klass->is_loaded() && |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2202 !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
|
2203 !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
|
2204 return; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2205 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2206 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2207 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2208 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2209 // 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
|
2210 // 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
|
2211 // |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2212 // 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
|
2213 // 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
|
2214 // pre_barrier(_, pre_val, ...); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2215 // } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2216 // } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2217 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2218 float likely = PROB_LIKELY( 0.999); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2219 float unlikely = PROB_UNLIKELY(0.999); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2220 |
| 3255 | 2221 IdealKit ideal(this); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2222 #define __ ideal. |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2223 |
|
3254
59766fd005ff
7035117: G1: nsk/stress/jni/jnistress002 fails with assertion failure
johnc
parents:
3252
diff
changeset
|
2224 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
|
2225 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2226 __ 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
|
2227 // Update graphKit memory and control from IdealKit. |
| 3255 | 2228 sync_kit(ideal); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2229 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2230 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
|
2231 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
|
2232 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2233 // Update IdealKit memory and control from graphKit. |
| 3255 | 2234 __ sync_kit(this); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2235 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2236 Node* one = __ ConI(1); |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2237 // 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
|
2238 __ 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
|
2239 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2240 // Update graphKit from IdeakKit. |
| 3255 | 2241 sync_kit(ideal); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2242 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2243 // 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
|
2244 pre_barrier(false /* do_load */, |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2245 __ ctrl(), |
|
3258
edd9b016deb6
7036021: G1: build failure on win64 and linux with hs21 in jdk6 build environment
johnc
parents:
3255
diff
changeset
|
2246 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
|
2247 pre_val /* pre_val */, |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2248 T_OBJECT); |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2249 if (need_mem_bar) { |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2250 // 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
|
2251 // 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
|
2252 insert_mem_bar(Op_MemBarCPUOrder); |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2253 } |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2254 // Update IdealKit from graphKit. |
| 3255 | 2255 __ sync_kit(this); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2256 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2257 } __ end_if(); // _ref_type != ref_none |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2258 } __ end_if(); // offset == referent_offset |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2259 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2260 // Final sync IdealKit and GraphKit. |
| 3255 | 2261 final_sync(ideal); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2262 #undef __ |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2263 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2264 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2265 |
| 0 | 2266 // Interpret Unsafe.fieldOffset cookies correctly: |
| 2267 extern jlong Unsafe_field_offset_to_byte_offset(jlong field_offset); | |
| 2268 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2269 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
|
2270 // Attempt to infer a sharper value type from the offset and base type. |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2271 ciKlass* sharpened_klass = NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2272 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2273 // See if it is an instance field, with an object type. |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2274 if (alias_type->field() != NULL) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2275 assert(!is_native_ptr, "native pointer op cannot use a java address"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2276 if (alias_type->field()->type()->is_klass()) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2277 sharpened_klass = alias_type->field()->type()->as_klass(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2278 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2279 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2280 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2281 // See if it is a narrow oop array. |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2282 if (adr_type->isa_aryptr()) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2283 if (adr_type->offset() >= objArrayOopDesc::base_offset_in_bytes()) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2284 const TypeOopPtr *elem_type = adr_type->is_aryptr()->elem()->isa_oopptr(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2285 if (elem_type != NULL) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2286 sharpened_klass = elem_type->klass(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2287 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2288 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2289 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2290 |
|
6847
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2291 // 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
|
2292 // contraint in place. |
|
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2293 if (sharpened_klass != NULL && sharpened_klass->is_loaded()) { |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2294 const TypeOopPtr* tjp = TypeOopPtr::make_from_klass(sharpened_klass); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2295 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2296 #ifndef PRODUCT |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2297 if (PrintIntrinsics || PrintInlining || PrintOptoInlining) { |
|
6847
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2298 tty->print(" from base type: "); adr_type->dump(); |
|
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2299 tty->print(" sharpened value: "); tjp->dump(); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2300 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2301 #endif |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2302 // Sharpen the value type. |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2303 return tjp; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2304 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2305 return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2306 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2307 |
| 0 | 2308 bool LibraryCallKit::inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile) { |
| 2309 if (callee()->is_static()) return false; // caller must have the capability! | |
| 2310 | |
| 2311 #ifndef PRODUCT | |
| 2312 { | |
| 2313 ResourceMark rm; | |
| 2314 // Check the signatures. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2315 ciSignature* sig = callee()->signature(); |
| 0 | 2316 #ifdef ASSERT |
| 2317 if (!is_store) { | |
| 2318 // Object getObject(Object base, int/long offset), etc. | |
| 2319 BasicType rtype = sig->return_type()->basic_type(); | |
| 2320 if (rtype == T_ADDRESS_HOLDER && callee()->name() == ciSymbol::getAddress_name()) | |
| 2321 rtype = T_ADDRESS; // it is really a C void* | |
| 2322 assert(rtype == type, "getter must return the expected value"); | |
| 2323 if (!is_native_ptr) { | |
| 2324 assert(sig->count() == 2, "oop getter has 2 arguments"); | |
| 2325 assert(sig->type_at(0)->basic_type() == T_OBJECT, "getter base is object"); | |
| 2326 assert(sig->type_at(1)->basic_type() == T_LONG, "getter offset is correct"); | |
| 2327 } else { | |
| 2328 assert(sig->count() == 1, "native getter has 1 argument"); | |
| 2329 assert(sig->type_at(0)->basic_type() == T_LONG, "getter base is long"); | |
| 2330 } | |
| 2331 } else { | |
| 2332 // void putObject(Object base, int/long offset, Object x), etc. | |
| 2333 assert(sig->return_type()->basic_type() == T_VOID, "putter must not return a value"); | |
| 2334 if (!is_native_ptr) { | |
| 2335 assert(sig->count() == 3, "oop putter has 3 arguments"); | |
| 2336 assert(sig->type_at(0)->basic_type() == T_OBJECT, "putter base is object"); | |
| 2337 assert(sig->type_at(1)->basic_type() == T_LONG, "putter offset is correct"); | |
| 2338 } else { | |
| 2339 assert(sig->count() == 2, "native putter has 2 arguments"); | |
| 2340 assert(sig->type_at(0)->basic_type() == T_LONG, "putter base is long"); | |
| 2341 } | |
| 2342 BasicType vtype = sig->type_at(sig->count()-1)->basic_type(); | |
| 2343 if (vtype == T_ADDRESS_HOLDER && callee()->name() == ciSymbol::putAddress_name()) | |
| 2344 vtype = T_ADDRESS; // it is really a C void* | |
| 2345 assert(vtype == type, "putter must accept the expected value"); | |
| 2346 } | |
| 2347 #endif // ASSERT | |
| 2348 } | |
| 2349 #endif //PRODUCT | |
| 2350 | |
| 2351 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
| 2352 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2353 Node* receiver = argument(0); // type: oop |
| 0 | 2354 |
| 2355 // 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
|
2356 Node* adr; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2357 Node* heap_base_oop = top(); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2358 Node* offset = top(); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2359 Node* val; |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2360 |
| 0 | 2361 if (!is_native_ptr) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2362 // 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
|
2363 Node* base = argument(1); // type: oop |
| 0 | 2364 // 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
|
2365 offset = argument(2); // type: long |
| 0 | 2366 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset |
| 2367 // to be plain byte offsets, which are also the same as those accepted | |
| 2368 // by oopDesc::field_base. | |
| 2369 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
| 2370 "fieldOffset must be byte-scaled"); | |
| 2371 // 32-bit machines ignore the high half! | |
| 2372 offset = ConvL2X(offset); | |
| 2373 adr = make_unsafe_address(base, offset); | |
| 2374 heap_base_oop = base; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2375 val = is_store ? argument(4) : NULL; |
| 0 | 2376 } else { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2377 Node* ptr = argument(1); // type: long |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2378 ptr = ConvL2X(ptr); // adjust Java long to machine word |
| 0 | 2379 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
|
2380 val = is_store ? argument(3) : NULL; |
| 0 | 2381 } |
| 2382 | |
| 2383 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
| 2384 | |
| 2385 // First guess at the value type. | |
| 2386 const Type *value_type = Type::get_const_basic_type(type); | |
| 2387 | |
| 2388 // Try to categorize the address. If it comes up as TypeJavaPtr::BOTTOM, | |
| 2389 // there was not enough information to nail it down. | |
| 2390 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
| 2391 assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here"); | |
| 2392 | |
| 2393 // We will need memory barriers unless we can determine a unique | |
| 2394 // alias category for this reference. (Note: If for some reason | |
| 2395 // the barriers get omitted and the unsafe reference begins to "pollute" | |
| 2396 // the alias analysis of the rest of the graph, either Compile::can_alias | |
| 2397 // or Compile::must_alias will throw a diagnostic assert.) | |
| 2398 bool need_mem_bar = (alias_type->adr_type() == TypeOopPtr::BOTTOM); | |
| 2399 | |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2400 // 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
|
2401 // 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
|
2402 // 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
|
2403 // 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
|
2404 // 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
|
2405 // 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
|
2406 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
|
2407 offset != top() && heap_base_oop != top(); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2408 |
| 0 | 2409 if (!is_store && type == T_OBJECT) { |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2410 const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type, is_native_ptr); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2411 if (tjp != NULL) { |
| 0 | 2412 value_type = tjp; |
| 2413 } | |
| 2414 } | |
| 2415 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2416 receiver = null_check(receiver); |
| 0 | 2417 if (stopped()) { |
| 2418 return true; | |
| 2419 } | |
| 2420 // Heap pointers get a null-check from the interpreter, | |
| 2421 // as a courtesy. However, this is not guaranteed by Unsafe, | |
| 2422 // and it is not possible to fully distinguish unintended nulls | |
| 2423 // from intended ones in this API. | |
| 2424 | |
| 2425 if (is_volatile) { | |
| 2426 // We need to emit leading and trailing CPU membars (see below) in | |
| 2427 // addition to memory membars when is_volatile. This is a little | |
| 2428 // too strong, but avoids the need to insert per-alias-type | |
| 2429 // volatile membars (for stores; compare Parse::do_put_xxx), which | |
| 605 | 2430 // we cannot do effectively here because we probably only have a |
| 0 | 2431 // rough approximation of type. |
| 2432 need_mem_bar = true; | |
| 2433 // For Stores, place a memory ordering barrier now. | |
| 2434 if (is_store) | |
| 2435 insert_mem_bar(Op_MemBarRelease); | |
| 2436 } | |
| 2437 | |
| 2438 // Memory barrier to prevent normal and 'unsafe' accesses from | |
| 2439 // bypassing each other. Happens after null checks, so the | |
| 2440 // exception paths do not take memory state from the memory barrier, | |
| 2441 // so there's no problems making a strong assert about mixing users | |
| 2442 // of safe & unsafe memory. Otherwise fails in a CTW of rt.jar | |
| 2443 // around 5701, class sun/reflect/UnsafeBooleanFieldAccessorImpl. | |
| 2444 if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder); | |
| 2445 | |
| 2446 if (!is_store) { | |
| 2447 Node* p = make_load(control(), adr, value_type, type, adr_type, is_volatile); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2448 // load value |
| 0 | 2449 switch (type) { |
| 2450 case T_BOOLEAN: | |
| 2451 case T_CHAR: | |
| 2452 case T_BYTE: | |
| 2453 case T_SHORT: | |
| 2454 case T_INT: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2455 case T_LONG: |
| 0 | 2456 case T_FLOAT: |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2457 case T_DOUBLE: |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2458 break; |
| 0 | 2459 case T_OBJECT: |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2460 if (need_read_barrier) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2461 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
|
2462 } |
| 0 | 2463 break; |
| 2464 case T_ADDRESS: | |
| 2465 // Cast to an int type. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2466 p = _gvn.transform(new (C) CastP2XNode(NULL, p)); |
| 0 | 2467 p = ConvX2L(p); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2468 break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2469 default: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2470 fatal(err_msg_res("unexpected type %d: %s", type, type2name(type))); |
| 0 | 2471 break; |
| 2472 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2473 // 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
|
2474 // 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
|
2475 // 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
|
2476 // point is fine. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2477 set_result(p); |
| 0 | 2478 } else { |
| 2479 // place effect of store into memory | |
| 2480 switch (type) { | |
| 2481 case T_DOUBLE: | |
| 2482 val = dstore_rounding(val); | |
| 2483 break; | |
| 2484 case T_ADDRESS: | |
| 2485 // Repackage the long as a pointer. | |
| 2486 val = ConvL2X(val); | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
2487 val = _gvn.transform(new (C) CastX2PNode(val)); |
| 0 | 2488 break; |
| 2489 } | |
| 2490 | |
| 2491 if (type != T_OBJECT ) { | |
| 2492 (void) store_to_memory(control(), adr, val, type, adr_type, is_volatile); | |
| 2493 } else { | |
| 2494 // Possibly an oop being stored to Java heap or native memory | |
| 2495 if (!TypePtr::NULL_PTR->higher_equal(_gvn.type(heap_base_oop))) { | |
| 2496 // oop to Java heap. | |
| 825 | 2497 (void) store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type); |
| 0 | 2498 } else { |
| 2499 // We can't tell at compile time if we are storing in the Java heap or outside | |
| 2500 // of it. So we need to emit code to conditionally do the proper type of | |
| 2501 // store. | |
| 2502 | |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2503 IdealKit ideal(this); |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2504 #define __ ideal. |
| 0 | 2505 // QQQ who knows what probability is here?? |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2506 __ 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
|
2507 // Sync IdealKit and graphKit. |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2508 sync_kit(ideal); |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2509 Node* st = store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type); |
|
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2510 // Update IdealKit memory. |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2511 __ sync_kit(this); |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2512 } __ else_(); { |
|
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2513 __ store(__ ctrl(), adr, val, type, alias_type->index(), is_volatile); |
|
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2514 } __ end_if(); |
|
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2515 // Final sync IdealKit and GraphKit. |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2516 final_sync(ideal); |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2517 #undef __ |
| 0 | 2518 } |
| 2519 } | |
| 2520 } | |
| 2521 | |
| 2522 if (is_volatile) { | |
| 2523 if (!is_store) | |
| 2524 insert_mem_bar(Op_MemBarAcquire); | |
| 2525 else | |
| 2526 insert_mem_bar(Op_MemBarVolatile); | |
| 2527 } | |
| 2528 | |
| 2529 if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder); | |
| 2530 | |
| 2531 return true; | |
| 2532 } | |
| 2533 | |
| 2534 //----------------------------inline_unsafe_prefetch---------------------------- | |
| 2535 | |
| 2536 bool LibraryCallKit::inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static) { | |
| 2537 #ifndef PRODUCT | |
| 2538 { | |
| 2539 ResourceMark rm; | |
| 2540 // Check the signatures. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2541 ciSignature* sig = callee()->signature(); |
| 0 | 2542 #ifdef ASSERT |
| 2543 // Object getObject(Object base, int/long offset), etc. | |
| 2544 BasicType rtype = sig->return_type()->basic_type(); | |
| 2545 if (!is_native_ptr) { | |
| 2546 assert(sig->count() == 2, "oop prefetch has 2 arguments"); | |
| 2547 assert(sig->type_at(0)->basic_type() == T_OBJECT, "prefetch base is object"); | |
| 2548 assert(sig->type_at(1)->basic_type() == T_LONG, "prefetcha offset is correct"); | |
| 2549 } else { | |
| 2550 assert(sig->count() == 1, "native prefetch has 1 argument"); | |
| 2551 assert(sig->type_at(0)->basic_type() == T_LONG, "prefetch base is long"); | |
| 2552 } | |
| 2553 #endif // ASSERT | |
| 2554 } | |
| 2555 #endif // !PRODUCT | |
| 2556 | |
| 2557 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
| 2558 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2559 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
|
2560 if (!is_static) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2561 null_check_receiver(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2562 if (stopped()) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2563 return true; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2564 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2565 } |
| 0 | 2566 |
| 2567 // Build address expression. See the code in inline_unsafe_access. | |
| 2568 Node *adr; | |
| 2569 if (!is_native_ptr) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2570 // 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
|
2571 Node* base = argument(idx + 0); // type: oop |
| 0 | 2572 // 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
|
2573 Node* offset = argument(idx + 1); // type: long |
| 0 | 2574 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset |
| 2575 // to be plain byte offsets, which are also the same as those accepted | |
| 2576 // by oopDesc::field_base. | |
| 2577 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
| 2578 "fieldOffset must be byte-scaled"); | |
| 2579 // 32-bit machines ignore the high half! | |
| 2580 offset = ConvL2X(offset); | |
| 2581 adr = make_unsafe_address(base, offset); | |
| 2582 } else { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2583 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
|
2584 ptr = ConvL2X(ptr); // adjust Java long to machine word |
| 0 | 2585 adr = make_unsafe_address(NULL, ptr); |
| 2586 } | |
| 2587 | |
| 2588 // Generate the read or write prefetch | |
| 2589 Node *prefetch; | |
| 2590 if (is_store) { | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2591 prefetch = new (C) PrefetchWriteNode(i_o(), adr); |
| 0 | 2592 } else { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2593 prefetch = new (C) PrefetchReadNode(i_o(), adr); |
| 0 | 2594 } |
| 2595 prefetch->init_req(0, control()); | |
| 2596 set_i_o(_gvn.transform(prefetch)); | |
| 2597 | |
| 2598 return true; | |
| 2599 } | |
| 2600 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2601 //----------------------------inline_unsafe_load_store---------------------------- |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2602 // 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
|
2603 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2604 // LS_cmpxchg: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2605 // 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
|
2606 // 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
|
2607 // 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
|
2608 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2609 // LS_xadd: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2610 // 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
|
2611 // 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
|
2612 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2613 // LS_xchg: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2614 // 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
|
2615 // 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
|
2616 // 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
|
2617 // |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2618 bool LibraryCallKit::inline_unsafe_load_store(BasicType type, LoadStoreKind kind) { |
| 0 | 2619 // This basic scheme here is the same as inline_unsafe_access, but |
| 2620 // differs in enough details that combining them would make the code | |
| 2621 // overly confusing. (This is a true fact! I originally combined | |
| 2622 // them, but even I was confused by it!) As much code/comments as | |
| 2623 // possible are retained from inline_unsafe_access though to make | |
| 605 | 2624 // the correspondences clearer. - dl |
| 0 | 2625 |
| 2626 if (callee()->is_static()) return false; // caller must have the capability! | |
| 2627 | |
| 2628 #ifndef PRODUCT | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2629 BasicType rtype; |
| 0 | 2630 { |
| 2631 ResourceMark rm; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2632 // Check the signatures. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2633 ciSignature* sig = callee()->signature(); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2634 rtype = sig->return_type()->basic_type(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2635 if (kind == LS_xadd || kind == LS_xchg) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2636 // Check the signatures. |
| 0 | 2637 #ifdef ASSERT |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2638 assert(rtype == type, "get and set must return the expected type"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2639 assert(sig->count() == 3, "get and set has 3 arguments"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2640 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
|
2641 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
|
2642 assert(sig->type_at(2)->basic_type() == type, "get and set must take expected type as new value/delta"); |
| 0 | 2643 #endif // ASSERT |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2644 } else if (kind == LS_cmpxchg) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2645 // Check the signatures. |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2646 #ifdef ASSERT |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2647 assert(rtype == T_BOOLEAN, "CAS must return boolean"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2648 assert(sig->count() == 4, "CAS has 4 arguments"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2649 assert(sig->type_at(0)->basic_type() == T_OBJECT, "CAS base is object"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2650 assert(sig->type_at(1)->basic_type() == T_LONG, "CAS offset is long"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2651 #endif // ASSERT |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2652 } else { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2653 ShouldNotReachHere(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2654 } |
| 0 | 2655 } |
| 2656 #endif //PRODUCT | |
| 2657 | |
| 2658 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
| 2659 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2660 // Get arguments: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2661 Node* receiver = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2662 Node* base = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2663 Node* offset = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2664 Node* oldval = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2665 Node* newval = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2666 if (kind == LS_cmpxchg) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2667 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
|
2668 receiver = argument(0); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2669 base = argument(1); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2670 offset = argument(2); // type: long |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2671 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
|
2672 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
|
2673 } 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
|
2674 receiver = argument(0); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2675 base = argument(1); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2676 offset = argument(2); // type: long |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2677 oldval = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2678 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
|
2679 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2680 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2681 // Null check receiver. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2682 receiver = null_check(receiver); |
| 0 | 2683 if (stopped()) { |
| 2684 return true; | |
| 2685 } | |
| 2686 | |
| 2687 // Build field offset expression. | |
| 2688 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset | |
| 2689 // to be plain byte offsets, which are also the same as those accepted | |
| 2690 // by oopDesc::field_base. | |
| 2691 assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled"); | |
| 2692 // 32-bit machines ignore the high half of long offsets | |
| 2693 offset = ConvL2X(offset); | |
| 2694 Node* adr = make_unsafe_address(base, offset); | |
| 2695 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
| 2696 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2697 // For CAS, unlike inline_unsafe_access, there seems no point in |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2698 // trying to refine types. Just use the coarse types here. |
| 0 | 2699 const Type *value_type = Type::get_const_basic_type(type); |
| 2700 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
| 2701 assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here"); | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2702 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2703 if (kind == LS_xchg && type == T_OBJECT) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2704 const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2705 if (tjp != NULL) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2706 value_type = tjp; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2707 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2708 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2709 |
| 0 | 2710 int alias_idx = C->get_alias_index(adr_type); |
| 2711 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2712 // Memory-model-wise, a LoadStore acts like a little synchronized |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2713 // block, so needs barriers on each side. These don't translate |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2714 // into actual barriers on most machines, but we still need rest of |
| 0 | 2715 // compiler to respect ordering. |
| 2716 | |
| 2717 insert_mem_bar(Op_MemBarRelease); | |
| 2718 insert_mem_bar(Op_MemBarCPUOrder); | |
| 2719 | |
| 2720 // 4984716: MemBars must be inserted before this | |
| 2721 // memory node in order to avoid a false | |
| 2722 // dependency which will confuse the scheduler. | |
| 2723 Node *mem = memory(alias_idx); | |
| 2724 | |
| 2725 // For now, we handle only those cases that actually exist: ints, | |
| 2726 // longs, and Object. Adding others should be straightforward. | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2727 Node* load_store; |
| 0 | 2728 switch(type) { |
| 2729 case T_INT: | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2730 if (kind == LS_xadd) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2731 load_store = _gvn.transform(new (C) GetAndAddINode(control(), mem, adr, newval, adr_type)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2732 } else if (kind == LS_xchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2733 load_store = _gvn.transform(new (C) GetAndSetINode(control(), mem, adr, newval, adr_type)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2734 } else if (kind == LS_cmpxchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2735 load_store = _gvn.transform(new (C) CompareAndSwapINode(control(), mem, adr, newval, oldval)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2736 } else { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2737 ShouldNotReachHere(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2738 } |
| 0 | 2739 break; |
| 2740 case T_LONG: | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2741 if (kind == LS_xadd) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2742 load_store = _gvn.transform(new (C) GetAndAddLNode(control(), mem, adr, newval, adr_type)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2743 } else if (kind == LS_xchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2744 load_store = _gvn.transform(new (C) GetAndSetLNode(control(), mem, adr, newval, adr_type)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2745 } else if (kind == LS_cmpxchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2746 load_store = _gvn.transform(new (C) CompareAndSwapLNode(control(), mem, adr, newval, oldval)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2747 } else { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2748 ShouldNotReachHere(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2749 } |
| 0 | 2750 break; |
| 2751 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
|
2752 // 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
|
2753 // 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
|
2754 // 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
|
2755 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
|
2756 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
|
2757 |
|
b9bc6cae88f2
7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes
kvn
parents:
4778
diff
changeset
|
2758 // Reference stores need a store barrier. |
|
12169
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2759 if (kind == LS_xchg) { |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2760 // 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
|
2761 if (!can_move_pre_barrier()) { |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2762 pre_barrier(true /* do_load*/, |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2763 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
|
2764 NULL /* pre_val*/, |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2765 T_OBJECT); |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2766 } // 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
|
2767 } else if (kind == LS_cmpxchg) { |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2768 // Same as for newval above: |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2769 if (_gvn.type(oldval) == TypePtr::NULL_PTR) { |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2770 oldval = _gvn.makecon(TypePtr::NULL_PTR); |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2771 } |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2772 // 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
|
2773 pre_barrier(false /* do_load */, |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2774 control(), NULL, NULL, max_juint, NULL, NULL, |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2775 oldval /* pre_val */, |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2776 T_OBJECT); |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2777 } else { |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2778 ShouldNotReachHere(); |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2779 } |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2780 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
2781 #ifdef _LP64 |
| 163 | 2782 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
|
2783 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
|
2784 if (kind == LS_xchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2785 load_store = _gvn.transform(new (C) GetAndSetNNode(control(), mem, adr, |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2786 newval_enc, adr_type, value_type->make_narrowoop())); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2787 } else { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2788 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
|
2789 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
|
2790 load_store = _gvn.transform(new (C) CompareAndSwapNNode(control(), mem, adr, |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2791 newval_enc, oldval_enc)); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2792 } |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
2793 } else |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
2794 #endif |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
174
diff
changeset
|
2795 { |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2796 if (kind == LS_xchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2797 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
|
2798 } else { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2799 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
|
2800 load_store = _gvn.transform(new (C) CompareAndSwapPNode(control(), mem, adr, newval, oldval)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2801 } |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
174
diff
changeset
|
2802 } |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2803 post_barrier(control(), load_store, base, adr, alias_idx, newval, T_OBJECT, true); |
| 0 | 2804 break; |
| 2805 default: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2806 fatal(err_msg_res("unexpected type %d: %s", type, type2name(type))); |
| 0 | 2807 break; |
| 2808 } | |
| 2809 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2810 // SCMemProjNodes represent the memory state of a LoadStore. Their |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2811 // main role is to prevent LoadStore nodes from being optimized away |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2812 // when their results aren't used. |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
2813 Node* proj = _gvn.transform(new (C) SCMemProjNode(load_store)); |
| 0 | 2814 set_memory(proj, alias_idx); |
| 2815 | |
|
12169
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2816 if (type == T_OBJECT && kind == LS_xchg) { |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2817 #ifdef _LP64 |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2818 if (adr->bottom_type()->is_ptr_to_narrowoop()) { |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2819 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
|
2820 } |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2821 #endif |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2822 if (can_move_pre_barrier()) { |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2823 // 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
|
2824 // 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
|
2825 // gets inserted between them. |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2826 pre_barrier(false /* do_load */, |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2827 control(), NULL, NULL, max_juint, NULL, NULL, |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2828 load_store /* pre_val */, |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2829 T_OBJECT); |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2830 } |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2831 } |
|
29aa8936f03c
8023597: Optimize G1 barriers code for unsafe load_store
kvn
parents:
12078
diff
changeset
|
2832 |
| 0 | 2833 // Add the trailing membar surrounding the access |
| 2834 insert_mem_bar(Op_MemBarCPUOrder); | |
| 2835 insert_mem_bar(Op_MemBarAcquire); | |
| 2836 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2837 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
|
2838 set_result(load_store); |
| 0 | 2839 return true; |
| 2840 } | |
| 2841 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2842 //----------------------------inline_unsafe_ordered_store---------------------- |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2843 // 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
|
2844 // 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
|
2845 // public native void sun.misc.Unsafe.putOrderedLong(Object o, long offset, long x); |
| 0 | 2846 bool LibraryCallKit::inline_unsafe_ordered_store(BasicType type) { |
| 2847 // This is another variant of inline_unsafe_access, differing in | |
| 2848 // that it always issues store-store ("release") barrier and ensures | |
| 2849 // store-atomicity (which only matters for "long"). | |
| 2850 | |
| 2851 if (callee()->is_static()) return false; // caller must have the capability! | |
| 2852 | |
| 2853 #ifndef PRODUCT | |
| 2854 { | |
| 2855 ResourceMark rm; | |
| 2856 // Check the signatures. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2857 ciSignature* sig = callee()->signature(); |
| 0 | 2858 #ifdef ASSERT |
| 2859 BasicType rtype = sig->return_type()->basic_type(); | |
| 2860 assert(rtype == T_VOID, "must return void"); | |
| 2861 assert(sig->count() == 3, "has 3 arguments"); | |
| 2862 assert(sig->type_at(0)->basic_type() == T_OBJECT, "base is object"); | |
| 2863 assert(sig->type_at(1)->basic_type() == T_LONG, "offset is long"); | |
| 2864 #endif // ASSERT | |
| 2865 } | |
| 2866 #endif //PRODUCT | |
| 2867 | |
| 2868 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
| 2869 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2870 // Get arguments: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2871 Node* receiver = argument(0); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2872 Node* base = argument(1); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2873 Node* offset = argument(2); // type: long |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2874 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
|
2875 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2876 // Null check receiver. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2877 receiver = null_check(receiver); |
| 0 | 2878 if (stopped()) { |
| 2879 return true; | |
| 2880 } | |
| 2881 | |
| 2882 // Build field offset expression. | |
| 2883 assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled"); | |
| 2884 // 32-bit machines ignore the high half of long offsets | |
| 2885 offset = ConvL2X(offset); | |
| 2886 Node* adr = make_unsafe_address(base, offset); | |
| 2887 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
| 2888 const Type *value_type = Type::get_const_basic_type(type); | |
| 2889 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
| 2890 | |
| 2891 insert_mem_bar(Op_MemBarRelease); | |
| 2892 insert_mem_bar(Op_MemBarCPUOrder); | |
| 2893 // 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
|
2894 const bool require_atomic_access = true; |
| 0 | 2895 Node* store; |
| 2896 if (type == T_OBJECT) // reference stores need a store barrier. | |
| 825 | 2897 store = store_oop_to_unknown(control(), base, adr, adr_type, val, type); |
| 0 | 2898 else { |
| 2899 store = store_to_memory(control(), adr, val, type, adr_type, require_atomic_access); | |
| 2900 } | |
| 2901 insert_mem_bar(Op_MemBarCPUOrder); | |
| 2902 return true; | |
| 2903 } | |
| 2904 | |
| 7425 | 2905 bool LibraryCallKit::inline_unsafe_fence(vmIntrinsics::ID id) { |
| 2906 // Regardless of form, don't allow previous ld/st to move down, | |
| 2907 // then issue acquire, release, or volatile mem_bar. | |
| 2908 insert_mem_bar(Op_MemBarCPUOrder); | |
| 2909 switch(id) { | |
| 2910 case vmIntrinsics::_loadFence: | |
| 2911 insert_mem_bar(Op_MemBarAcquire); | |
| 2912 return true; | |
| 2913 case vmIntrinsics::_storeFence: | |
| 2914 insert_mem_bar(Op_MemBarRelease); | |
| 2915 return true; | |
| 2916 case vmIntrinsics::_fullFence: | |
| 2917 insert_mem_bar(Op_MemBarVolatile); | |
| 2918 return true; | |
| 2919 default: | |
| 2920 fatal_unexpected_iid(id); | |
| 2921 return false; | |
| 2922 } | |
| 2923 } | |
| 2924 | |
| 12078 | 2925 bool LibraryCallKit::klass_needs_init_guard(Node* kls) { |
| 2926 if (!kls->is_Con()) { | |
| 2927 return true; | |
| 2928 } | |
| 2929 const TypeKlassPtr* klsptr = kls->bottom_type()->isa_klassptr(); | |
| 2930 if (klsptr == NULL) { | |
| 2931 return true; | |
| 2932 } | |
| 2933 ciInstanceKlass* ik = klsptr->klass()->as_instance_klass(); | |
| 2934 // don't need a guard for a klass that is already initialized | |
| 2935 return !ik->is_initialized(); | |
| 2936 } | |
| 2937 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2938 //----------------------------inline_unsafe_allocate--------------------------- |
| 12078 | 2939 // public native Object sun.misc.Unsafe.allocateInstance(Class<?> cls); |
| 0 | 2940 bool LibraryCallKit::inline_unsafe_allocate() { |
| 2941 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
|
2942 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2943 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
|
2944 Node* cls = null_check(argument(1)); |
| 0 | 2945 if (stopped()) return true; |
| 2946 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2947 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
|
2948 kls = null_check(kls); |
| 0 | 2949 if (stopped()) return true; // argument was like int.class |
| 2950 | |
| 12078 | 2951 Node* test = NULL; |
| 2952 if (LibraryCallKit::klass_needs_init_guard(kls)) { | |
| 2953 // Note: The argument might still be an illegal value like | |
| 2954 // Serializable.class or Object[].class. The runtime will handle it. | |
| 2955 // But we must make an explicit check for initialization. | |
| 2956 Node* insp = basic_plus_adr(kls, in_bytes(InstanceKlass::init_state_offset())); | |
| 2957 // Use T_BOOLEAN for InstanceKlass::_init_state so the compiler | |
| 2958 // can generate code to load it as unsigned byte. | |
| 2959 Node* inst = make_load(NULL, insp, TypeInt::UBYTE, T_BOOLEAN); | |
| 2960 Node* bits = intcon(InstanceKlass::fully_initialized); | |
| 2961 test = _gvn.transform(new (C) SubINode(inst, bits)); | |
| 2962 // The 'test' is non-zero if we need to take a slow path. | |
| 2963 } | |
| 0 | 2964 |
| 2965 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
|
2966 set_result(obj); |
| 0 | 2967 return true; |
| 2968 } | |
| 2969 | |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2970 #ifdef TRACE_HAVE_INTRINSICS |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2971 /* |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2972 * oop -> myklass |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2973 * myklass->trace_id |= USED |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2974 * return myklass->trace_id & ~0x3 |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2975 */ |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2976 bool LibraryCallKit::inline_native_classID() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2977 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
|
2978 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
|
2979 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
|
2980 kls = null_check(kls, T_OBJECT); |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2981 ByteSize offset = TRACE_ID_OFFSET; |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2982 Node* insp = basic_plus_adr(kls, in_bytes(offset)); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2983 Node* tvalue = make_load(NULL, insp, TypeLong::LONG, T_LONG); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2984 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
|
2985 Node* andl = _gvn.transform(new (C) AndLNode(tvalue, bits)); |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2986 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
|
2987 Node* orl = _gvn.transform(new (C) OrLNode(tvalue, clsused)); |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2988 |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2989 const TypePtr *adr_type = _gvn.type(insp)->isa_ptr(); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2990 store_to_memory(control(), insp, orl, T_LONG, adr_type); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2991 set_result(andl); |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2992 return true; |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2993 } |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2994 |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2995 bool LibraryCallKit::inline_native_threadID() { |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2996 Node* tls_ptr = NULL; |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2997 Node* cur_thr = generate_current_thread(tls_ptr); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2998 Node* p = basic_plus_adr(top()/*!oop*/, tls_ptr, in_bytes(JavaThread::osthread_offset())); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2999 Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3000 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
|
3001 |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3002 Node* threadid = NULL; |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3003 size_t thread_id_size = OSThread::thread_id_size(); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3004 if (thread_id_size == (size_t) BytesPerLong) { |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3005 threadid = ConvL2I(make_load(control(), p, TypeLong::LONG, T_LONG)); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3006 } else if (thread_id_size == (size_t) BytesPerInt) { |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3007 threadid = make_load(control(), p, TypeInt::INT, T_INT); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3008 } else { |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3009 ShouldNotReachHere(); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3010 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3011 set_result(threadid); |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3012 return true; |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3013 } |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3014 #endif |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3015 |
| 0 | 3016 //------------------------inline_native_time_funcs-------------- |
| 3017 // inline code for System.currentTimeMillis() and System.nanoTime() | |
| 3018 // these have the same type and signature | |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
3019 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
|
3020 const TypeFunc* tf = OptoRuntime::void_long_Type(); |
| 0 | 3021 const TypePtr* no_memory_effects = NULL; |
| 3022 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
|
3023 Node* value = _gvn.transform(new (C) ProjNode(time, TypeFunc::Parms+0)); |
| 0 | 3024 #ifdef ASSERT |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3025 Node* value_top = _gvn.transform(new (C) ProjNode(time, TypeFunc::Parms+1)); |
| 0 | 3026 assert(value_top == top(), "second value must be top"); |
| 3027 #endif | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3028 set_result(value); |
| 0 | 3029 return true; |
| 3030 } | |
| 3031 | |
| 3032 //------------------------inline_native_currentThread------------------ | |
| 3033 bool LibraryCallKit::inline_native_currentThread() { | |
| 3034 Node* junk = NULL; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3035 set_result(generate_current_thread(junk)); |
| 0 | 3036 return true; |
| 3037 } | |
| 3038 | |
| 3039 //------------------------inline_native_isInterrupted------------------ | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3040 // private native boolean java.lang.Thread.isInterrupted(boolean ClearInterrupted); |
| 0 | 3041 bool LibraryCallKit::inline_native_isInterrupted() { |
| 3042 // Add a fast path to t.isInterrupted(clear_int): | |
| 3043 // (t == Thread.current() && (!TLS._osthread._interrupted || !clear_int)) | |
| 3044 // ? TLS._osthread._interrupted : /*slow path:*/ t.isInterrupted(clear_int) | |
| 3045 // So, in the common case that the interrupt bit is false, | |
| 3046 // we avoid making a call into the VM. Even if the interrupt bit | |
| 3047 // is true, if the clear_int argument is false, we avoid the VM call. | |
| 3048 // However, if the receiver is not currentThread, we must call the VM, | |
| 3049 // because there must be some locking done around the operation. | |
| 3050 | |
| 3051 // We only go to the fast case code if we pass two guards. | |
| 3052 // 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
|
3053 |
|
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3054 enum { |
|
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3055 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
|
3056 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
|
3057 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
|
3058 PATH_LIMIT |
|
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3059 }; |
|
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3060 |
|
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3061 // 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
|
3062 // out of the function. |
|
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3063 insert_mem_bar(Op_MemBarCPUOrder); |
|
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3064 |
|
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3065 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
|
3066 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
|
3067 |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3068 RegionNode* slow_region = new (C) RegionNode(1); |
| 0 | 3069 record_for_igvn(slow_region); |
| 3070 | |
| 3071 // (a) Receiving thread must be the current thread. | |
| 3072 Node* rec_thr = argument(0); | |
| 3073 Node* tls_ptr = NULL; | |
| 3074 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
|
3075 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
|
3076 Node* bol_thr = _gvn.transform(new (C) BoolNode(cmp_thr, BoolTest::ne)); |
| 0 | 3077 |
|
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3078 generate_slow_guard(bol_thr, slow_region); |
| 0 | 3079 |
| 3080 // (b) Interrupt bit on TLS must be false. | |
| 3081 Node* p = basic_plus_adr(top()/*!oop*/, tls_ptr, in_bytes(JavaThread::osthread_offset())); | |
| 3082 Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS); | |
| 3083 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
|
3084 |
|
787
aabd393cf1ee
6772683: Thread.isInterrupted() fails to return true on multiprocessor PC
kvn
parents:
775
diff
changeset
|
3085 // Set the control input on the field _interrupted read to prevent it floating up. |
|
aabd393cf1ee
6772683: Thread.isInterrupted() fails to return true on multiprocessor PC
kvn
parents:
775
diff
changeset
|
3086 Node* int_bit = make_load(control(), p, TypeInt::BOOL, T_INT); |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3087 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
|
3088 Node* bol_bit = _gvn.transform(new (C) BoolNode(cmp_bit, BoolTest::ne)); |
| 0 | 3089 |
| 3090 IfNode* iff_bit = create_and_map_if(control(), bol_bit, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN); | |
| 3091 | |
| 3092 // 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
|
3093 Node* false_bit = _gvn.transform(new (C) IfFalseNode(iff_bit)); |
| 0 | 3094 result_rgn->init_req(no_int_result_path, false_bit); |
| 3095 result_val->init_req(no_int_result_path, intcon(0)); | |
| 3096 | |
| 3097 // drop through to next case | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3098 set_control( _gvn.transform(new (C) IfTrueNode(iff_bit))); |
| 0 | 3099 |
| 3100 // (c) Or, if interrupt bit is set and clear_int is false, use 2nd fast path. | |
| 3101 Node* clr_arg = argument(1); | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3102 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
|
3103 Node* bol_arg = _gvn.transform(new (C) BoolNode(cmp_arg, BoolTest::ne)); |
| 0 | 3104 IfNode* iff_arg = create_and_map_if(control(), bol_arg, PROB_FAIR, COUNT_UNKNOWN); |
| 3105 | |
| 3106 // 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
|
3107 Node* false_arg = _gvn.transform(new (C) IfFalseNode(iff_arg)); |
| 0 | 3108 result_rgn->init_req(no_clear_result_path, false_arg); |
| 3109 result_val->init_req(no_clear_result_path, intcon(1)); | |
| 3110 | |
| 3111 // drop through to next case | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3112 set_control( _gvn.transform(new (C) IfTrueNode(iff_arg))); |
| 0 | 3113 |
| 3114 // (d) Otherwise, go to the slow path. | |
| 3115 slow_region->add_req(control()); | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3116 set_control( _gvn.transform(slow_region)); |
| 0 | 3117 |
| 3118 if (stopped()) { | |
| 3119 // There is no slow path. | |
| 3120 result_rgn->init_req(slow_result_path, top()); | |
| 3121 result_val->init_req(slow_result_path, top()); | |
| 3122 } else { | |
| 3123 // non-virtual because it is a private non-static | |
| 3124 CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_isInterrupted); | |
| 3125 | |
| 3126 Node* slow_val = set_results_for_java_call(slow_call); | |
| 3127 // this->control() comes from set_results_for_java_call | |
| 3128 | |
| 3129 Node* fast_io = slow_call->in(TypeFunc::I_O); | |
| 3130 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
|
3131 |
| 0 | 3132 // 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
|
3133 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
|
3134 PhiNode* result_io = PhiNode::make(result_rgn, fast_io, Type::ABIO); |
| 0 | 3135 |
| 3136 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
|
3137 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
|
3138 result_mem->init_req(slow_result_path, reset_memory()); |
| 0 | 3139 result_val->init_req(slow_result_path, slow_val); |
| 3140 | |
|
7422
eb409f2f146e
8003135: HotSpot inlines and hoists the Thread.currentThread().isInterrupted() out of the loop
vlivanov
parents:
7200
diff
changeset
|
3141 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
|
3142 set_i_o( _gvn.transform(result_io)); |
| 0 | 3143 } |
| 3144 | |
| 3145 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
|
3146 set_result(result_rgn, result_val); |
| 0 | 3147 return true; |
| 3148 } | |
| 3149 | |
| 3150 //---------------------------load_mirror_from_klass---------------------------- | |
| 3151 // Given a klass oop, load its java mirror (a java.lang.Class oop). | |
| 3152 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
|
3153 Node* p = basic_plus_adr(klass, in_bytes(Klass::java_mirror_offset())); |
| 0 | 3154 return make_load(NULL, p, TypeInstPtr::MIRROR, T_OBJECT); |
| 3155 } | |
| 3156 | |
| 3157 //-----------------------load_klass_from_mirror_common------------------------- | |
| 3158 // Given a java mirror (a java.lang.Class oop), load its corresponding klass oop. | |
| 3159 // Test the klass oop for null (signifying a primitive Class like Integer.TYPE), | |
| 3160 // and branch to the given path on the region. | |
| 3161 // If never_see_null, take an uncommon trap on null, so we can optimistically | |
| 3162 // compile for the non-null case. | |
| 3163 // If the region is NULL, force never_see_null = true. | |
| 3164 Node* LibraryCallKit::load_klass_from_mirror_common(Node* mirror, | |
| 3165 bool never_see_null, | |
| 3166 RegionNode* region, | |
| 3167 int null_path, | |
| 3168 int offset) { | |
| 3169 if (region == NULL) never_see_null = true; | |
| 3170 Node* p = basic_plus_adr(mirror, offset); | |
| 3171 const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL; | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3172 Node* kls = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeRawPtr::BOTTOM, kls_type)); |
| 0 | 3173 Node* null_ctl = top(); |
| 3174 kls = null_check_oop(kls, &null_ctl, never_see_null); | |
| 3175 if (region != NULL) { | |
| 3176 // Set region->in(null_path) if the mirror is a primitive (e.g, int.class). | |
| 3177 region->init_req(null_path, null_ctl); | |
| 3178 } else { | |
| 3179 assert(null_ctl == top(), "no loose ends"); | |
| 3180 } | |
| 3181 return kls; | |
| 3182 } | |
| 3183 | |
| 3184 //--------------------(inline_native_Class_query helpers)--------------------- | |
| 3185 // Use this for JVM_ACC_INTERFACE, JVM_ACC_IS_CLONEABLE, JVM_ACC_HAS_FINALIZER. | |
| 3186 // Fall through if (mods & mask) == bits, take the guard otherwise. | |
| 3187 Node* LibraryCallKit::generate_access_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region) { | |
| 3188 // Branch around if the given klass has the given modifier bit set. | |
| 3189 // 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
|
3190 Node* modp = basic_plus_adr(kls, in_bytes(Klass::access_flags_offset())); |
| 0 | 3191 Node* mods = make_load(NULL, modp, TypeInt::INT, T_INT); |
| 3192 Node* mask = intcon(modifier_mask); | |
| 3193 Node* bits = intcon(modifier_bits); | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3194 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
|
3195 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
|
3196 Node* bol = _gvn.transform(new (C) BoolNode(cmp, BoolTest::ne)); |
| 0 | 3197 return generate_fair_guard(bol, region); |
| 3198 } | |
| 3199 Node* LibraryCallKit::generate_interface_guard(Node* kls, RegionNode* region) { | |
| 3200 return generate_access_flags_guard(kls, JVM_ACC_INTERFACE, 0, region); | |
| 3201 } | |
| 3202 | |
| 3203 //-------------------------inline_native_Class_query------------------- | |
| 3204 bool LibraryCallKit::inline_native_Class_query(vmIntrinsics::ID id) { | |
| 3205 const Type* return_type = TypeInt::BOOL; | |
| 3206 Node* prim_return_value = top(); // what happens if it's a primitive class? | |
| 3207 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
| 3208 bool expect_prim = false; // most of these guys expect to work on refs | |
| 3209 | |
| 3210 enum { _normal_path = 1, _prim_path = 2, PATH_LIMIT }; | |
| 3211 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3212 Node* mirror = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3213 Node* obj = top(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3214 |
| 0 | 3215 switch (id) { |
| 3216 case vmIntrinsics::_isInstance: | |
| 3217 // nothing is an instance of a primitive type | |
| 3218 prim_return_value = intcon(0); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3219 obj = argument(1); |
| 0 | 3220 break; |
| 3221 case vmIntrinsics::_getModifiers: | |
| 3222 prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC); | |
| 3223 assert(is_power_of_2((int)JVM_ACC_WRITTEN_FLAGS+1), "change next line"); | |
| 3224 return_type = TypeInt::make(0, JVM_ACC_WRITTEN_FLAGS, Type::WidenMin); | |
| 3225 break; | |
| 3226 case vmIntrinsics::_isInterface: | |
| 3227 prim_return_value = intcon(0); | |
| 3228 break; | |
| 3229 case vmIntrinsics::_isArray: | |
| 3230 prim_return_value = intcon(0); | |
| 3231 expect_prim = true; // cf. ObjectStreamClass.getClassSignature | |
| 3232 break; | |
| 3233 case vmIntrinsics::_isPrimitive: | |
| 3234 prim_return_value = intcon(1); | |
| 3235 expect_prim = true; // obviously | |
| 3236 break; | |
| 3237 case vmIntrinsics::_getSuperclass: | |
| 3238 prim_return_value = null(); | |
| 3239 return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR); | |
| 3240 break; | |
| 3241 case vmIntrinsics::_getComponentType: | |
| 3242 prim_return_value = null(); | |
| 3243 return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR); | |
| 3244 break; | |
| 3245 case vmIntrinsics::_getClassAccessFlags: | |
| 3246 prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC); | |
| 3247 return_type = TypeInt::INT; // not bool! 6297094 | |
| 3248 break; | |
| 3249 default: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3250 fatal_unexpected_iid(id); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3251 break; |
| 0 | 3252 } |
| 3253 | |
| 3254 const TypeInstPtr* mirror_con = _gvn.type(mirror)->isa_instptr(); | |
| 3255 if (mirror_con == NULL) return false; // cannot happen? | |
| 3256 | |
| 3257 #ifndef PRODUCT | |
| 3258 if (PrintIntrinsics || PrintInlining || PrintOptoInlining) { | |
| 3259 ciType* k = mirror_con->java_mirror_type(); | |
| 3260 if (k) { | |
| 3261 tty->print("Inlining %s on constant Class ", vmIntrinsics::name_at(intrinsic_id())); | |
| 3262 k->print_name(); | |
| 3263 tty->cr(); | |
| 3264 } | |
| 3265 } | |
| 3266 #endif | |
| 3267 | |
| 3268 // 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
|
3269 RegionNode* region = new (C) RegionNode(PATH_LIMIT); |
| 0 | 3270 record_for_igvn(region); |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3271 PhiNode* phi = new (C) PhiNode(region, return_type); |
| 0 | 3272 |
| 3273 // The mirror will never be null of Reflection.getClassAccessFlags, however | |
| 3274 // it may be null for Class.isInstance or Class.getModifiers. Throw a NPE | |
| 3275 // if it is. See bug 4774291. | |
| 3276 | |
| 3277 // For Reflection.getClassAccessFlags(), the null check occurs in | |
| 3278 // the wrong place; see inline_unsafe_access(), above, for a similar | |
| 3279 // situation. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3280 mirror = null_check(mirror); |
| 0 | 3281 // If mirror or obj is dead, only null-path is taken. |
| 3282 if (stopped()) return true; | |
| 3283 | |
| 3284 if (expect_prim) never_see_null = false; // expect nulls (meaning prims) | |
| 3285 | |
| 3286 // Now load the mirror's klass metaobject, and null-check it. | |
| 3287 // 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
|
3288 Node* kls = load_klass_from_mirror(mirror, never_see_null, region, _prim_path); |
| 0 | 3289 // If kls is null, we have a primitive mirror. |
| 3290 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
|
3291 if (stopped()) { set_result(region, phi); return true; } |
| 0 | 3292 |
| 3293 Node* p; // handy temp | |
| 3294 Node* null_ctl; | |
| 3295 | |
| 3296 // Now that we have the non-null klass, we can perform the real query. | |
| 3297 // For constant classes, the query will constant-fold in LoadNode::Value. | |
| 3298 Node* query_value = top(); | |
| 3299 switch (id) { | |
| 3300 case vmIntrinsics::_isInstance: | |
| 3301 // nothing is an instance of a primitive type | |
| 3302 query_value = gen_instanceof(obj, kls); | |
| 3303 break; | |
| 3304 | |
| 3305 case vmIntrinsics::_getModifiers: | |
|
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3306 p = basic_plus_adr(kls, in_bytes(Klass::modifier_flags_offset())); |
| 0 | 3307 query_value = make_load(NULL, p, TypeInt::INT, T_INT); |
| 3308 break; | |
| 3309 | |
| 3310 case vmIntrinsics::_isInterface: | |
| 3311 // (To verify this code sequence, check the asserts in JVM_IsInterface.) | |
| 3312 if (generate_interface_guard(kls, region) != NULL) | |
| 3313 // A guard was added. If the guard is taken, it was an interface. | |
| 3314 phi->add_req(intcon(1)); | |
| 3315 // If we fall through, it's a plain class. | |
| 3316 query_value = intcon(0); | |
| 3317 break; | |
| 3318 | |
| 3319 case vmIntrinsics::_isArray: | |
| 3320 // (To verify this code sequence, check the asserts in JVM_IsArrayClass.) | |
| 3321 if (generate_array_guard(kls, region) != NULL) | |
| 3322 // A guard was added. If the guard is taken, it was an array. | |
| 3323 phi->add_req(intcon(1)); | |
| 3324 // If we fall through, it's a plain class. | |
| 3325 query_value = intcon(0); | |
| 3326 break; | |
| 3327 | |
| 3328 case vmIntrinsics::_isPrimitive: | |
| 3329 query_value = intcon(0); // "normal" path produces false | |
| 3330 break; | |
| 3331 | |
| 3332 case vmIntrinsics::_getSuperclass: | |
| 3333 // The rules here are somewhat unfortunate, but we can still do better | |
| 3334 // with random logic than with a JNI call. | |
| 3335 // Interfaces store null or Object as _super, but must report null. | |
| 3336 // Arrays store an intermediate super as _super, but must report Object. | |
| 3337 // Other types can report the actual _super. | |
| 3338 // (To verify this code sequence, check the asserts in JVM_IsInterface.) | |
| 3339 if (generate_interface_guard(kls, region) != NULL) | |
| 3340 // A guard was added. If the guard is taken, it was an interface. | |
| 3341 phi->add_req(null()); | |
| 3342 if (generate_array_guard(kls, region) != NULL) | |
| 3343 // A guard was added. If the guard is taken, it was an array. | |
| 3344 phi->add_req(makecon(TypeInstPtr::make(env()->Object_klass()->java_mirror()))); | |
| 3345 // 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
|
3346 p = basic_plus_adr(kls, in_bytes(Klass::super_offset())); |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3347 kls = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeRawPtr::BOTTOM, TypeKlassPtr::OBJECT_OR_NULL)); |
| 0 | 3348 null_ctl = top(); |
| 3349 kls = null_check_oop(kls, &null_ctl); | |
| 3350 if (null_ctl != top()) { | |
| 3351 // If the guard is taken, Object.superClass is null (both klass and mirror). | |
| 3352 region->add_req(null_ctl); | |
| 3353 phi ->add_req(null()); | |
| 3354 } | |
| 3355 if (!stopped()) { | |
| 3356 query_value = load_mirror_from_klass(kls); | |
| 3357 } | |
| 3358 break; | |
| 3359 | |
| 3360 case vmIntrinsics::_getComponentType: | |
| 3361 if (generate_array_guard(kls, region) != NULL) { | |
| 3362 // Be sure to pin the oop load to the guard edge just created: | |
| 3363 Node* is_array_ctrl = region->in(region->req()-1); | |
|
6831
d8ce2825b193
8000213: NPG: Should have renamed arrayKlass and typeArrayKlass
coleenp
parents:
6804
diff
changeset
|
3364 Node* cma = basic_plus_adr(kls, in_bytes(ArrayKlass::component_mirror_offset())); |
| 0 | 3365 Node* cmo = make_load(is_array_ctrl, cma, TypeInstPtr::MIRROR, T_OBJECT); |
| 3366 phi->add_req(cmo); | |
| 3367 } | |
| 3368 query_value = null(); // non-array case is null | |
| 3369 break; | |
| 3370 | |
| 3371 case vmIntrinsics::_getClassAccessFlags: | |
|
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3372 p = basic_plus_adr(kls, in_bytes(Klass::access_flags_offset())); |
| 0 | 3373 query_value = make_load(NULL, p, TypeInt::INT, T_INT); |
| 3374 break; | |
| 3375 | |
| 3376 default: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3377 fatal_unexpected_iid(id); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3378 break; |
| 0 | 3379 } |
| 3380 | |
| 3381 // Fall-through is the normal case of a query to a real class. | |
| 3382 phi->init_req(1, query_value); | |
| 3383 region->init_req(1, control()); | |
| 3384 | |
| 3385 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
|
3386 set_result(region, phi); |
| 0 | 3387 return true; |
| 3388 } | |
| 3389 | |
| 3390 //--------------------------inline_native_subtype_check------------------------ | |
| 3391 // This intrinsic takes the JNI calls out of the heart of | |
| 3392 // UnsafeFieldAccessorImpl.set, which improves Field.set, readObject, etc. | |
| 3393 bool LibraryCallKit::inline_native_subtype_check() { | |
| 3394 // Pull both arguments off the stack. | |
| 3395 Node* args[2]; // two java.lang.Class mirrors: superc, subc | |
| 3396 args[0] = argument(0); | |
| 3397 args[1] = argument(1); | |
| 3398 Node* klasses[2]; // corresponding Klasses: superk, subk | |
| 3399 klasses[0] = klasses[1] = top(); | |
| 3400 | |
| 3401 enum { | |
| 3402 // A full decision tree on {superc is prim, subc is prim}: | |
| 3403 _prim_0_path = 1, // {P,N} => false | |
| 3404 // {P,P} & superc!=subc => false | |
| 3405 _prim_same_path, // {P,P} & superc==subc => true | |
| 3406 _prim_1_path, // {N,P} => false | |
| 3407 _ref_subtype_path, // {N,N} & subtype check wins => true | |
| 3408 _both_ref_path, // {N,N} & subtype check loses => false | |
| 3409 PATH_LIMIT | |
| 3410 }; | |
| 3411 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3412 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
|
3413 Node* phi = new (C) PhiNode(region, TypeInt::BOOL); |
| 0 | 3414 record_for_igvn(region); |
| 3415 | |
| 3416 const TypePtr* adr_type = TypeRawPtr::BOTTOM; // memory type of loads | |
| 3417 const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL; | |
| 3418 int class_klass_offset = java_lang_Class::klass_offset_in_bytes(); | |
| 3419 | |
| 3420 // First null-check both mirrors and load each mirror's klass metaobject. | |
| 3421 int which_arg; | |
| 3422 for (which_arg = 0; which_arg <= 1; which_arg++) { | |
| 3423 Node* arg = args[which_arg]; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3424 arg = null_check(arg); |
| 0 | 3425 if (stopped()) break; |
|
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7200
diff
changeset
|
3426 args[which_arg] = arg; |
| 0 | 3427 |
| 3428 Node* p = basic_plus_adr(arg, class_klass_offset); | |
|
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
3429 Node* kls = LoadKlassNode::make(_gvn, immutable_memory(), p, adr_type, kls_type); |
| 0 | 3430 klasses[which_arg] = _gvn.transform(kls); |
| 3431 } | |
| 3432 | |
| 3433 // Having loaded both klasses, test each for null. | |
| 3434 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
| 3435 for (which_arg = 0; which_arg <= 1; which_arg++) { | |
| 3436 Node* kls = klasses[which_arg]; | |
| 3437 Node* null_ctl = top(); | |
| 3438 kls = null_check_oop(kls, &null_ctl, never_see_null); | |
| 3439 int prim_path = (which_arg == 0 ? _prim_0_path : _prim_1_path); | |
| 3440 region->init_req(prim_path, null_ctl); | |
| 3441 if (stopped()) break; | |
| 3442 klasses[which_arg] = kls; | |
| 3443 } | |
| 3444 | |
| 3445 if (!stopped()) { | |
| 3446 // now we have two reference types, in klasses[0..1] | |
| 3447 Node* subk = klasses[1]; // the argument to isAssignableFrom | |
| 3448 Node* superk = klasses[0]; // the receiver | |
| 3449 region->set_req(_both_ref_path, gen_subtype_check(subk, superk)); | |
| 3450 // now we have a successful reference subtype check | |
| 3451 region->set_req(_ref_subtype_path, control()); | |
| 3452 } | |
| 3453 | |
| 3454 // If both operands are primitive (both klasses null), then | |
| 3455 // we must return true when they are identical primitives. | |
| 3456 // It is convenient to test this after the first null klass check. | |
| 3457 set_control(region->in(_prim_0_path)); // go back to first null check | |
| 3458 if (!stopped()) { | |
| 3459 // 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
|
3460 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
|
3461 Node* bol_eq = _gvn.transform(new (C) BoolNode(cmp_eq, BoolTest::eq)); |
| 0 | 3462 generate_guard(bol_eq, region, PROB_FAIR); |
| 3463 if (region->req() == PATH_LIMIT+1) { | |
| 3464 // A guard was added. If the added guard is taken, superc==subc. | |
| 3465 region->swap_edges(PATH_LIMIT, _prim_same_path); | |
| 3466 region->del_req(PATH_LIMIT); | |
| 3467 } | |
| 3468 region->set_req(_prim_0_path, control()); // Not equal after all. | |
| 3469 } | |
| 3470 | |
| 3471 // these are the only paths that produce 'true': | |
| 3472 phi->set_req(_prim_same_path, intcon(1)); | |
| 3473 phi->set_req(_ref_subtype_path, intcon(1)); | |
| 3474 | |
| 3475 // pull together the cases: | |
| 3476 assert(region->req() == PATH_LIMIT, "sane region"); | |
| 3477 for (uint i = 1; i < region->req(); i++) { | |
| 3478 Node* ctl = region->in(i); | |
| 3479 if (ctl == NULL || ctl == top()) { | |
| 3480 region->set_req(i, top()); | |
| 3481 phi ->set_req(i, top()); | |
| 3482 } else if (phi->in(i) == NULL) { | |
| 3483 phi->set_req(i, intcon(0)); // all other paths produce 'false' | |
| 3484 } | |
| 3485 } | |
| 3486 | |
| 3487 set_control(_gvn.transform(region)); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3488 set_result(_gvn.transform(phi)); |
| 0 | 3489 return true; |
| 3490 } | |
| 3491 | |
| 3492 //---------------------generate_array_guard_common------------------------ | |
| 3493 Node* LibraryCallKit::generate_array_guard_common(Node* kls, RegionNode* region, | |
| 3494 bool obj_array, bool not_array) { | |
| 3495 // If obj_array/non_array==false/false: | |
| 3496 // Branch around if the given klass is in fact an array (either obj or prim). | |
| 3497 // If obj_array/non_array==false/true: | |
| 3498 // Branch around if the given klass is not an array klass of any kind. | |
| 3499 // If obj_array/non_array==true/true: | |
| 3500 // Branch around if the kls is not an oop array (kls is int[], String, etc.) | |
| 3501 // If obj_array/non_array==true/false: | |
| 3502 // Branch around if the kls is an oop array (Object[] or subtype) | |
| 3503 // | |
| 3504 // Like generate_guard, adds a new path onto the region. | |
| 3505 jint layout_con = 0; | |
| 3506 Node* layout_val = get_layout_helper(kls, layout_con); | |
| 3507 if (layout_val == NULL) { | |
| 3508 bool query = (obj_array | |
| 3509 ? Klass::layout_helper_is_objArray(layout_con) | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
3510 : Klass::layout_helper_is_array(layout_con)); |
| 0 | 3511 if (query == not_array) { |
| 3512 return NULL; // never a branch | |
| 3513 } else { // always a branch | |
| 3514 Node* always_branch = control(); | |
| 3515 if (region != NULL) | |
| 3516 region->add_req(always_branch); | |
| 3517 set_control(top()); | |
| 3518 return always_branch; | |
| 3519 } | |
| 3520 } | |
| 3521 // Now test the correct condition. | |
| 3522 jint nval = (obj_array | |
| 3523 ? ((jint)Klass::_lh_array_tag_type_value | |
| 3524 << Klass::_lh_array_tag_shift) | |
| 3525 : Klass::_lh_neutral_value); | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3526 Node* cmp = _gvn.transform(new(C) CmpINode(layout_val, intcon(nval))); |
| 0 | 3527 BoolTest::mask btest = BoolTest::lt; // correct for testing is_[obj]array |
| 3528 // invert the test if we are looking for a non-array | |
| 3529 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
|
3530 Node* bol = _gvn.transform(new(C) BoolNode(cmp, btest)); |
| 0 | 3531 return generate_fair_guard(bol, region); |
| 3532 } | |
| 3533 | |
| 3534 | |
| 3535 //-----------------------inline_native_newArray-------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3536 // private static native Object java.lang.reflect.newArray(Class<?> componentType, int length); |
| 0 | 3537 bool LibraryCallKit::inline_native_newArray() { |
| 3538 Node* mirror = argument(0); | |
| 3539 Node* count_val = argument(1); | |
| 3540 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3541 mirror = null_check(mirror); |
| 163 | 3542 // If mirror or obj is dead, only null-path is taken. |
| 3543 if (stopped()) return true; | |
| 0 | 3544 |
| 3545 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
|
3546 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
|
3547 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
|
3548 TypeInstPtr::NOTNULL); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3549 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
|
3550 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
|
3551 TypePtr::BOTTOM); |
| 0 | 3552 |
| 3553 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
| 3554 Node* klass_node = load_array_klass_from_mirror(mirror, never_see_null, | |
| 3555 result_reg, _slow_path); | |
| 3556 Node* normal_ctl = control(); | |
| 3557 Node* no_array_ctl = result_reg->in(_slow_path); | |
| 3558 | |
| 3559 // Generate code for the slow case. We make a call to newArray(). | |
| 3560 set_control(no_array_ctl); | |
| 3561 if (!stopped()) { | |
| 3562 // Either the input type is void.class, or else the | |
| 3563 // array klass has not yet been cached. Either the | |
| 3564 // ensuing call will throw an exception, or else it | |
| 3565 // will cache the array klass for next time. | |
| 3566 PreserveJVMState pjvms(this); | |
| 3567 CallJavaNode* slow_call = generate_method_call_static(vmIntrinsics::_newArray); | |
| 3568 Node* slow_result = set_results_for_java_call(slow_call); | |
| 3569 // this->control() comes from set_results_for_java_call | |
| 3570 result_reg->set_req(_slow_path, control()); | |
| 3571 result_val->set_req(_slow_path, slow_result); | |
| 3572 result_io ->set_req(_slow_path, i_o()); | |
| 3573 result_mem->set_req(_slow_path, reset_memory()); | |
| 3574 } | |
| 3575 | |
| 3576 set_control(normal_ctl); | |
| 3577 if (!stopped()) { | |
| 3578 // Normal case: The array type has been cached in the java.lang.Class. | |
| 3579 // The following call works fine even if the array type is polymorphic. | |
| 3580 // 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
|
3581 Node* obj = new_array(klass_node, count_val, 0); // no arguments to push |
| 0 | 3582 result_reg->init_req(_normal_path, control()); |
| 3583 result_val->init_req(_normal_path, obj); | |
| 3584 result_io ->init_req(_normal_path, i_o()); | |
| 3585 result_mem->init_req(_normal_path, reset_memory()); | |
| 3586 } | |
| 3587 | |
| 3588 // Return the combined state. | |
| 3589 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
|
3590 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
|
3591 |
| 0 | 3592 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
|
3593 set_result(result_reg, result_val); |
| 0 | 3594 return true; |
| 3595 } | |
| 3596 | |
| 3597 //----------------------inline_native_getLength-------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3598 // public static native int java.lang.reflect.Array.getLength(Object array); |
| 0 | 3599 bool LibraryCallKit::inline_native_getLength() { |
| 3600 if (too_many_traps(Deoptimization::Reason_intrinsic)) return false; | |
| 3601 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3602 Node* array = null_check(argument(0)); |
| 0 | 3603 // If array is dead, only null-path is taken. |
| 3604 if (stopped()) return true; | |
| 3605 | |
| 3606 // Deoptimize if it is a non-array. | |
| 3607 Node* non_array = generate_non_array_guard(load_object_klass(array), NULL); | |
| 3608 | |
| 3609 if (non_array != NULL) { | |
| 3610 PreserveJVMState pjvms(this); | |
| 3611 set_control(non_array); | |
| 3612 uncommon_trap(Deoptimization::Reason_intrinsic, | |
| 3613 Deoptimization::Action_maybe_recompile); | |
| 3614 } | |
| 3615 | |
| 3616 // If control is dead, only non-array-path is taken. | |
| 3617 if (stopped()) return true; | |
| 3618 | |
| 3619 // The works fine even if the array type is polymorphic. | |
| 3620 // 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
|
3621 Node* result = load_array_length(array); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3622 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3623 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
|
3624 set_result(result); |
| 0 | 3625 return true; |
| 3626 } | |
| 3627 | |
| 3628 //------------------------inline_array_copyOf---------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3629 // 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
|
3630 // public static <T,U> T[] java.util.Arrays.copyOfRange(U[] original, int from, int to, Class<? extends T[]> newType); |
| 0 | 3631 bool LibraryCallKit::inline_array_copyOf(bool is_copyOfRange) { |
| 3632 if (too_many_traps(Deoptimization::Reason_intrinsic)) return false; | |
| 3633 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3634 // Get the arguments. |
| 0 | 3635 Node* original = argument(0); |
| 3636 Node* start = is_copyOfRange? argument(1): intcon(0); | |
| 3637 Node* end = is_copyOfRange? argument(2): argument(1); | |
| 3638 Node* array_type_mirror = is_copyOfRange? argument(3): argument(2); | |
| 3639 | |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3640 Node* newcopy; |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3641 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3642 // 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
|
3643 // 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
|
3644 { PreserveReexecuteState preexecs(this); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3645 jvms()->set_should_reexecute(true); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3646 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3647 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
|
3648 original = null_check(original); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3649 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3650 // Check if a null path was taken unconditionally. |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3651 if (stopped()) return true; |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3652 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3653 Node* orig_length = load_array_length(original); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3654 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3655 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
|
3656 klass_node = null_check(klass_node); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3657 |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3658 RegionNode* bailout = new (C) RegionNode(1); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3659 record_for_igvn(bailout); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3660 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3661 // 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
|
3662 // Bail out if that is so. |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3663 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
|
3664 if (not_objArray != NULL) { |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3665 // 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
|
3666 ciKlass* ak = ciArrayKlass::make(env()->Object_klass()); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3667 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
|
3668 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
|
3669 cast->init_req(0, control()); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3670 klass_node = _gvn.transform(cast); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3671 } |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3672 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3673 // 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
|
3674 generate_negative_guard(start, bailout, &start); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3675 generate_negative_guard(end, bailout, &end); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3676 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3677 Node* length = end; |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3678 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
|
3679 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
|
3680 } |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3681 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3682 // 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
|
3683 // 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
|
3684 // 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
|
3685 // should be thrown |
|
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3686 generate_negative_guard(length, bailout, &length); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3687 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3688 if (bailout->req() > 1) { |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3689 PreserveJVMState pjvms(this); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3690 set_control(_gvn.transform(bailout)); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3691 uncommon_trap(Deoptimization::Reason_intrinsic, |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3692 Deoptimization::Action_maybe_recompile); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3693 } |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3694 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3695 if (!stopped()) { |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3696 // 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
|
3697 // 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
|
3698 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
|
3699 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
|
3700 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3701 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
|
3702 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3703 // 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
|
3704 // 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
|
3705 // oop stores need checking. |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3706 // 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
|
3707 // 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
|
3708 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
|
3709 // 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
|
3710 // negative. |
|
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3711 bool length_never_negative = !is_copyOfRange; |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3712 generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3713 original, start, newcopy, intcon(0), moved, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3714 disjoint_bases, length_never_negative); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3715 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3716 } // original reexecute is set back here |
| 0 | 3717 |
| 3718 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
|
3719 if (!stopped()) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3720 set_result(newcopy); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3721 } |
| 0 | 3722 return true; |
| 3723 } | |
| 3724 | |
| 3725 | |
| 3726 //----------------------generate_virtual_guard--------------------------- | |
| 3727 // Helper for hashCode and clone. Peeks inside the vtable to avoid a call. | |
| 3728 Node* LibraryCallKit::generate_virtual_guard(Node* obj_klass, | |
| 3729 RegionNode* slow_region) { | |
| 3730 ciMethod* method = callee(); | |
| 3731 int vtable_index = method->vtable_index(); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
3732 // 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
|
3733 int entry_offset = (InstanceKlass::vtable_start_offset() + |
| 0 | 3734 vtable_index*vtableEntry::size()) * wordSize + |
| 3735 vtableEntry::method_offset_in_bytes(); | |
| 3736 Node* entry_addr = basic_plus_adr(obj_klass, entry_offset); | |
|
6888
cfe522e6461c
8000623: tools/javac/Diagnostics/6769027/T6769027.java crashes in PSPromotionManager::copy_to_survivor_space
kvn
parents:
6853
diff
changeset
|
3737 Node* target_call = make_load(NULL, entry_addr, TypePtr::NOTNULL, T_ADDRESS); |
| 0 | 3738 |
| 3739 // 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
|
3740 const TypePtr* native_call_addr = TypeMetadataPtr::make(method); |
| 0 | 3741 |
| 3742 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
|
3743 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
|
3744 Node* test_native = _gvn.transform(new(C) BoolNode(chk_native, BoolTest::ne)); |
| 0 | 3745 |
| 3746 return generate_slow_guard(test_native, slow_region); | |
| 3747 } | |
| 3748 | |
| 3749 //-----------------------generate_method_call---------------------------- | |
| 3750 // Use generate_method_call to make a slow-call to the real | |
| 3751 // method if the fast path fails. An alternative would be to | |
| 3752 // use a stub like OptoRuntime::slow_arraycopy_Java. | |
| 3753 // This only works for expanding the current library call, | |
| 3754 // not another intrinsic. (E.g., don't use this for making an | |
| 3755 // arraycopy call inside of the copyOf intrinsic.) | |
| 3756 CallJavaNode* | |
| 3757 LibraryCallKit::generate_method_call(vmIntrinsics::ID method_id, bool is_virtual, bool is_static) { | |
| 3758 // When compiling the intrinsic method itself, do not use this technique. | |
| 3759 guarantee(callee() != C->method(), "cannot make slow-call to self"); | |
| 3760 | |
| 3761 ciMethod* method = callee(); | |
| 3762 // ensure the JVMS we have will be correct for this call | |
| 3763 guarantee(method_id == method->intrinsic_id(), "must match"); | |
| 3764 | |
| 3765 const TypeFunc* tf = TypeFunc::make(method); | |
| 3766 CallJavaNode* slow_call; | |
| 3767 if (is_static) { | |
| 3768 assert(!is_virtual, ""); | |
| 10278 | 3769 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
|
3770 SharedRuntime::get_resolve_static_call_stub(), |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3771 method, bci()); |
| 0 | 3772 } else if (is_virtual) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3773 null_check_receiver(); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
3774 int vtable_index = Method::invalid_vtable_index; |
| 0 | 3775 if (UseInlineCaches) { |
| 3776 // Suppress the vtable call | |
| 3777 } else { | |
| 3778 // hashCode and clone are not a miranda methods, | |
| 3779 // so the vtable index is fixed. | |
| 3780 // No need to use the linkResolver to get it. | |
| 3781 vtable_index = method->vtable_index(); | |
| 3782 } | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3783 slow_call = new(C) CallDynamicJavaNode(tf, |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3784 SharedRuntime::get_resolve_virtual_call_stub(), |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3785 method, vtable_index, bci()); |
| 0 | 3786 } 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
|
3787 null_check_receiver(); |
| 10278 | 3788 slow_call = new(C) CallStaticJavaNode(C, tf, |
| 0 | 3789 SharedRuntime::get_resolve_opt_virtual_call_stub(), |
| 3790 method, bci()); | |
| 3791 slow_call->set_optimized_virtual(true); | |
| 3792 } | |
| 3793 set_arguments_for_java_call(slow_call); | |
| 3794 set_edges_for_java_call(slow_call); | |
| 3795 return slow_call; | |
| 3796 } | |
| 3797 | |
| 3798 | |
| 3799 //------------------------------inline_native_hashcode-------------------- | |
| 3800 // Build special case code for calls to hashCode on an object. | |
| 3801 bool LibraryCallKit::inline_native_hashcode(bool is_virtual, bool is_static) { | |
| 3802 assert(is_static == callee()->is_static(), "correct intrinsic selection"); | |
| 3803 assert(!(is_virtual && is_static), "either virtual, special, or static"); | |
| 3804 | |
| 3805 enum { _slow_path = 1, _fast_path, _null_path, PATH_LIMIT }; | |
| 3806 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3807 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
|
3808 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
|
3809 TypeInt::INT); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3810 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
|
3811 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
|
3812 TypePtr::BOTTOM); |
| 0 | 3813 Node* obj = NULL; |
| 3814 if (!is_static) { | |
| 3815 // Check for hashing null object | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3816 obj = null_check_receiver(); |
| 0 | 3817 if (stopped()) return true; // unconditionally null |
| 3818 result_reg->init_req(_null_path, top()); | |
| 3819 result_val->init_req(_null_path, top()); | |
| 3820 } else { | |
| 3821 // Do a null check, and return zero if null. | |
| 3822 // System.identityHashCode(null) == 0 | |
| 3823 obj = argument(0); | |
| 3824 Node* null_ctl = top(); | |
| 3825 obj = null_check_oop(obj, &null_ctl); | |
| 3826 result_reg->init_req(_null_path, null_ctl); | |
| 3827 result_val->init_req(_null_path, _gvn.intcon(0)); | |
| 3828 } | |
| 3829 | |
| 3830 // Unconditionally null? Then return right away. | |
| 3831 if (stopped()) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3832 set_control( result_reg->in(_null_path)); |
| 0 | 3833 if (!stopped()) |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3834 set_result(result_val->in(_null_path)); |
| 0 | 3835 return true; |
| 3836 } | |
| 3837 | |
| 3838 // After null check, get the object's klass. | |
| 3839 Node* obj_klass = load_object_klass(obj); | |
| 3840 | |
| 3841 // This call may be virtual (invokevirtual) or bound (invokespecial). | |
| 3842 // For each case we generate slightly different code. | |
| 3843 | |
| 3844 // We only go to the fast case code if we pass a number of guards. The | |
| 3845 // 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
|
3846 RegionNode* slow_region = new (C) RegionNode(1); |
| 0 | 3847 record_for_igvn(slow_region); |
| 3848 | |
| 3849 // If this is a virtual call, we generate a funny guard. We pull out | |
| 3850 // the vtable entry corresponding to hashCode() from the target object. | |
| 3851 // If the target method which we are calling happens to be the native | |
| 3852 // Object hashCode() method, we pass the guard. We do not need this | |
| 3853 // guard for non-virtual calls -- the caller is known to be the native | |
| 3854 // Object hashCode(). | |
| 3855 if (is_virtual) { | |
| 3856 generate_virtual_guard(obj_klass, slow_region); | |
| 3857 } | |
| 3858 | |
| 3859 // Get the header out of the object, use LoadMarkNode when available | |
| 3860 Node* header_addr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes()); | |
| 1609 | 3861 Node* header = make_load(control(), header_addr, TypeX_X, TypeX_X->basic_type()); |
| 0 | 3862 |
| 3863 // Test the header to see if it is unlocked. | |
| 3864 Node *lock_mask = _gvn.MakeConX(markOopDesc::biased_lock_mask_in_place); | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3865 Node *lmasked_header = _gvn.transform(new (C) AndXNode(header, lock_mask)); |
| 0 | 3866 Node *unlocked_val = _gvn.MakeConX(markOopDesc::unlocked_value); |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3867 Node *chk_unlocked = _gvn.transform(new (C) CmpXNode( lmasked_header, unlocked_val)); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3868 Node *test_unlocked = _gvn.transform(new (C) BoolNode( chk_unlocked, BoolTest::ne)); |
| 0 | 3869 |
| 3870 generate_slow_guard(test_unlocked, slow_region); | |
| 3871 | |
| 3872 // Get the hash value and check to see that it has been properly assigned. | |
| 3873 // We depend on hash_mask being at most 32 bits and avoid the use of | |
| 3874 // hash_mask_in_place because it could be larger than 32 bits in a 64-bit | |
| 3875 // vm: see markOop.hpp. | |
| 3876 Node *hash_mask = _gvn.intcon(markOopDesc::hash_mask); | |
| 3877 Node *hash_shift = _gvn.intcon(markOopDesc::hash_shift); | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3878 Node *hshifted_header= _gvn.transform(new (C) URShiftXNode(header, hash_shift)); |
| 0 | 3879 // This hack lets the hash bits live anywhere in the mark object now, as long |
| 605 | 3880 // as the shift drops the relevant bits into the low 32 bits. Note that |
| 0 | 3881 // Java spec says that HashCode is an int so there's no point in capturing |
| 3882 // an 'X'-sized hashcode (32 in 32-bit build or 64 in 64-bit build). | |
| 3883 hshifted_header = ConvX2I(hshifted_header); | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3884 Node *hash_val = _gvn.transform(new (C) AndINode(hshifted_header, hash_mask)); |
| 0 | 3885 |
| 3886 Node *no_hash_val = _gvn.intcon(markOopDesc::no_hash); | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3887 Node *chk_assigned = _gvn.transform(new (C) CmpINode( hash_val, no_hash_val)); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
3888 Node *test_assigned = _gvn.transform(new (C) BoolNode( chk_assigned, BoolTest::eq)); |
| 0 | 3889 |
| 3890 generate_slow_guard(test_assigned, slow_region); | |
| 3891 | |
| 3892 Node* init_mem = reset_memory(); | |
| 3893 // fill in the rest of the null path: | |
| 3894 result_io ->init_req(_null_path, i_o()); | |
| 3895 result_mem->init_req(_null_path, init_mem); | |
| 3896 | |
| 3897 result_val->init_req(_fast_path, hash_val); | |
| 3898 result_reg->init_req(_fast_path, control()); | |
| 3899 result_io ->init_req(_fast_path, i_o()); | |
| 3900 result_mem->init_req(_fast_path, init_mem); | |
| 3901 | |
| 3902 // Generate code for the slow case. We make a call to hashCode(). | |
| 3903 set_control(_gvn.transform(slow_region)); | |
| 3904 if (!stopped()) { | |
| 3905 // No need for PreserveJVMState, because we're using up the present state. | |
| 3906 set_all_memory(init_mem); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3907 vmIntrinsics::ID hashCode_id = is_static ? vmIntrinsics::_identityHashCode : vmIntrinsics::_hashCode; |
| 0 | 3908 CallJavaNode* slow_call = generate_method_call(hashCode_id, is_virtual, is_static); |
| 3909 Node* slow_result = set_results_for_java_call(slow_call); | |
| 3910 // this->control() comes from set_results_for_java_call | |
| 3911 result_reg->init_req(_slow_path, control()); | |
| 3912 result_val->init_req(_slow_path, slow_result); | |
| 3913 result_io ->set_req(_slow_path, i_o()); | |
| 3914 result_mem ->set_req(_slow_path, reset_memory()); | |
| 3915 } | |
| 3916 | |
| 3917 // Return the combined state. | |
| 3918 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
|
3919 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
|
3920 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3921 set_result(result_reg, result_val); |
| 0 | 3922 return true; |
| 3923 } | |
| 3924 | |
| 3925 //---------------------------inline_native_getClass---------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3926 // 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
|
3927 // |
| 605 | 3928 // Build special case code for calls to getClass on an object. |
| 0 | 3929 bool LibraryCallKit::inline_native_getClass() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3930 Node* obj = null_check_receiver(); |
| 0 | 3931 if (stopped()) return true; |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3932 set_result(load_mirror_from_klass(load_object_klass(obj))); |
| 0 | 3933 return true; |
| 3934 } | |
| 3935 | |
| 3936 //-----------------inline_native_Reflection_getCallerClass--------------------- | |
|
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3937 // 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
|
3938 // |
| 0 | 3939 // In the presence of deep enough inlining, getCallerClass() becomes a no-op. |
| 3940 // | |
|
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3941 // 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
|
3942 // 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
|
3943 // caller sensitive methods. |
| 0 | 3944 bool LibraryCallKit::inline_native_Reflection_getCallerClass() { |
| 3945 #ifndef PRODUCT | |
| 3946 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { | |
| 3947 tty->print_cr("Attempting to inline sun.reflect.Reflection.getCallerClass"); | |
| 3948 } | |
| 3949 #endif | |
| 3950 | |
| 3951 if (!jvms()->has_method()) { | |
| 3952 #ifndef PRODUCT | |
| 3953 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { | |
| 3954 tty->print_cr(" Bailing out because intrinsic was inlined at top level"); | |
| 3955 } | |
| 3956 #endif | |
| 3957 return false; | |
| 3958 } | |
| 3959 | |
| 3960 // 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
|
3961 // depth. |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3962 JVMState* caller_jvms = jvms(); |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3963 |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3964 // Cf. JVM_GetCallerClass |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3965 // 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
|
3966 // not include the Reflection.getCallerClass() frame. |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3967 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
|
3968 ciMethod* m = caller_jvms->method(); |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3969 switch (n) { |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3970 case 0: |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3971 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
|
3972 break; |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3973 case 1: |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3974 // 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
|
3975 if (!m->caller_sensitive()) { |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3976 #ifndef PRODUCT |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3977 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3978 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
|
3979 } |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3980 #endif |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3981 return false; // bail-out; let JVM_GetCallerClass do the work |
| 0 | 3982 } |
|
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3983 break; |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3984 default: |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3985 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
|
3986 // 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
|
3987 // 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
|
3988 ciInstanceKlass* caller_klass = caller_jvms->method()->holder(); |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3989 ciInstance* caller_mirror = caller_klass->java_mirror(); |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3990 set_result(makecon(TypeInstPtr::make(caller_mirror))); |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3991 |
| 0 | 3992 #ifndef PRODUCT |
|
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3993 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3994 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
|
3995 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
|
3996 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
|
3997 ciMethod* m = jvms()->of_depth(i)->method(); |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
3998 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
|
3999 } |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4000 } |
| 0 | 4001 #endif |
|
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4002 return true; |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4003 } |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4004 break; |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4005 } |
| 0 | 4006 } |
| 4007 | |
| 4008 #ifndef PRODUCT | |
| 4009 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { | |
|
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4010 tty->print_cr(" Bailing out because caller depth exceeded inlining depth = %d", jvms()->depth()); |
| 0 | 4011 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
|
4012 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
|
4013 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
|
4014 tty->print_cr(" %d) %s.%s", n, m->holder()->name()->as_utf8(), m->name()->as_utf8()); |
| 0 | 4015 } |
| 4016 } | |
| 4017 #endif | |
|
8866
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4018 |
|
16885e702c88
7198429: need checked categorization of caller-sensitive methods in the JDK
twisti
parents:
8076
diff
changeset
|
4019 return false; // bail-out; let JVM_GetCallerClass do the work |
| 0 | 4020 } |
| 4021 | |
| 4022 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
|
4023 Node* arg = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4024 Node* result; |
| 0 | 4025 |
| 4026 switch (id) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4027 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
|
4028 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
|
4029 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
|
4030 case vmIntrinsics::_longBitsToDouble: result = new (C) MoveL2DNode(arg); break; |
| 0 | 4031 |
| 4032 case vmIntrinsics::_doubleToLongBits: { | |
| 4033 // 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
|
4034 RegionNode *r = new (C) RegionNode(3); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4035 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
|
4036 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4037 Node *cmpisnan = _gvn.transform(new (C) CmpDNode(arg, arg)); |
| 0 | 4038 // Build the boolean node |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4039 Node *bolisnan = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::ne)); |
| 0 | 4040 |
| 4041 // Branch either way. | |
| 4042 // NaN case is less traveled, which makes all the difference. | |
| 4043 IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
| 4044 Node *opt_isnan = _gvn.transform(ifisnan); | |
| 4045 assert( opt_isnan->is_If(), "Expect an IfNode"); | |
| 4046 IfNode *opt_ifisnan = (IfNode*)opt_isnan; | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4047 Node *iftrue = _gvn.transform(new (C) IfTrueNode(opt_ifisnan)); |
| 0 | 4048 |
| 4049 set_control(iftrue); | |
| 4050 | |
| 4051 static const jlong nan_bits = CONST64(0x7ff8000000000000); | |
| 4052 Node *slow_result = longcon(nan_bits); // return NaN | |
| 4053 phi->init_req(1, _gvn.transform( slow_result )); | |
| 4054 r->init_req(1, iftrue); | |
| 4055 | |
| 4056 // Else fall through | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4057 Node *iffalse = _gvn.transform(new (C) IfFalseNode(opt_ifisnan)); |
| 0 | 4058 set_control(iffalse); |
| 4059 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4060 phi->init_req(2, _gvn.transform(new (C) MoveD2LNode(arg))); |
| 0 | 4061 r->init_req(2, iffalse); |
| 4062 | |
| 4063 // Post merge | |
| 4064 set_control(_gvn.transform(r)); | |
| 4065 record_for_igvn(r); | |
| 4066 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4067 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
|
4068 result = phi; |
| 0 | 4069 assert(result->bottom_type()->isa_long(), "must be"); |
| 4070 break; | |
| 4071 } | |
| 4072 | |
| 4073 case vmIntrinsics::_floatToIntBits: { | |
| 4074 // 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
|
4075 RegionNode *r = new (C) RegionNode(3); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4076 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
|
4077 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4078 Node *cmpisnan = _gvn.transform(new (C) CmpFNode(arg, arg)); |
| 0 | 4079 // Build the boolean node |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4080 Node *bolisnan = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::ne)); |
| 0 | 4081 |
| 4082 // Branch either way. | |
| 4083 // NaN case is less traveled, which makes all the difference. | |
| 4084 IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
| 4085 Node *opt_isnan = _gvn.transform(ifisnan); | |
| 4086 assert( opt_isnan->is_If(), "Expect an IfNode"); | |
| 4087 IfNode *opt_ifisnan = (IfNode*)opt_isnan; | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4088 Node *iftrue = _gvn.transform(new (C) IfTrueNode(opt_ifisnan)); |
| 0 | 4089 |
| 4090 set_control(iftrue); | |
| 4091 | |
| 4092 static const jint nan_bits = 0x7fc00000; | |
| 4093 Node *slow_result = makecon(TypeInt::make(nan_bits)); // return NaN | |
| 4094 phi->init_req(1, _gvn.transform( slow_result )); | |
| 4095 r->init_req(1, iftrue); | |
| 4096 | |
| 4097 // Else fall through | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4098 Node *iffalse = _gvn.transform(new (C) IfFalseNode(opt_ifisnan)); |
| 0 | 4099 set_control(iffalse); |
| 4100 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4101 phi->init_req(2, _gvn.transform(new (C) MoveF2INode(arg))); |
| 0 | 4102 r->init_req(2, iffalse); |
| 4103 | |
| 4104 // Post merge | |
| 4105 set_control(_gvn.transform(r)); | |
| 4106 record_for_igvn(r); | |
| 4107 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4108 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
|
4109 result = phi; |
| 0 | 4110 assert(result->bottom_type()->isa_int(), "must be"); |
| 4111 break; | |
| 4112 } | |
| 4113 | |
| 4114 default: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4115 fatal_unexpected_iid(id); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4116 break; |
| 0 | 4117 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4118 set_result(_gvn.transform(result)); |
| 0 | 4119 return true; |
| 4120 } | |
| 4121 | |
| 4122 #ifdef _LP64 | |
| 4123 #define XTOP ,top() /*additional argument*/ | |
| 4124 #else //_LP64 | |
| 4125 #define XTOP /*no additional argument*/ | |
| 4126 #endif //_LP64 | |
| 4127 | |
| 4128 //----------------------inline_unsafe_copyMemory------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4129 // public native void sun.misc.Unsafe.copyMemory(Object srcBase, long srcOffset, Object destBase, long destOffset, long bytes); |
| 0 | 4130 bool LibraryCallKit::inline_unsafe_copyMemory() { |
| 4131 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
|
4132 null_check_receiver(); // null-check receiver |
| 0 | 4133 if (stopped()) return true; |
| 4134 | |
| 4135 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
| 4136 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4137 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
|
4138 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
|
4139 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
|
4140 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
|
4141 Node* size = ConvL2X(argument(7)); // type: long |
| 0 | 4142 |
| 4143 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
| 4144 "fieldOffset must be byte-scaled"); | |
| 4145 | |
| 4146 Node* src = make_unsafe_address(src_ptr, src_off); | |
| 4147 Node* dst = make_unsafe_address(dst_ptr, dst_off); | |
| 4148 | |
| 4149 // Conservatively insert a memory barrier on all memory slices. | |
| 4150 // Do not let writes of the copy source or destination float below the copy. | |
| 4151 insert_mem_bar(Op_MemBarCPUOrder); | |
| 4152 | |
| 4153 // Call it. Note that the length argument is not scaled. | |
| 4154 make_runtime_call(RC_LEAF|RC_NO_FP, | |
| 4155 OptoRuntime::fast_arraycopy_Type(), | |
| 4156 StubRoutines::unsafe_arraycopy(), | |
| 4157 "unsafe_arraycopy", | |
| 4158 TypeRawPtr::BOTTOM, | |
| 4159 src, dst, size XTOP); | |
| 4160 | |
| 4161 // Do not let reads of the copy destination float above the copy. | |
| 4162 insert_mem_bar(Op_MemBarCPUOrder); | |
| 4163 | |
| 4164 return true; | |
| 4165 } | |
| 4166 | |
|
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4167 //------------------------clone_coping----------------------------------- |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4168 // 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
|
4169 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
|
4170 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
|
4171 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
|
4172 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
|
4173 |
|
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4174 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
|
4175 if (ReduceBulkZeroing) { |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4176 // 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
|
4177 // mark Initialize node as complete. |
|
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4178 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
|
4179 // 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
|
4180 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
|
4181 // 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
|
4182 // 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
|
4183 // 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
|
4184 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
|
4185 } |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4186 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4187 // 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
|
4188 // 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
|
4189 Node* src = obj; |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4190 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
|
4191 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
|
4192 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4193 // 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
|
4194 // 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
|
4195 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
|
4196 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
|
4197 // base_off: |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4198 // 8 - 32-bit VM |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4199 // 12 - 64-bit VM, compressed klass |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4200 // 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
|
4201 if (base_off % BytesPerLong != 0) { |
|
12226
7944aba7ba41
8015107: NPG: Use consistent naming for metaspace concepts
ehelin
parents:
12169
diff
changeset
|
4202 assert(UseCompressedClassPointers, ""); |
|
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4203 if (is_array) { |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4204 // 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
|
4205 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
|
4206 } else { |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4207 // 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
|
4208 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
|
4209 } |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4210 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
|
4211 } |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4212 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
|
4213 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
|
4214 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4215 // 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
|
4216 Node* countx = size; |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4217 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
|
4218 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
|
4219 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4220 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
|
4221 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
|
4222 generate_unchecked_arraycopy(raw_adr_type, T_LONG, disjoint_bases, |
| 2324 | 4223 src, NULL, dest, NULL, countx, |
| 4224 /*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
|
4225 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4226 // 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
|
4227 if (card_mark) { |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4228 assert(!is_array, ""); |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4229 // 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
|
4230 // 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
|
4231 // 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
|
4232 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
|
4233 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
|
4234 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
|
4235 post_barrier(control(), |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4236 memory(raw_adr_type), |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4237 alloc_obj, |
|
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4238 no_particular_field, |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4239 raw_adr_idx, |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4240 no_particular_value, |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4241 T_OBJECT, |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4242 false); |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4243 } |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4244 |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4245 // 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
|
4246 if (alloc != NULL) { |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4247 // 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
|
4248 // 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
|
4249 // other threads. |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4250 // 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
|
4251 // 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
|
4252 // AllocateNode and eliminate the MemBarStoreStoreNode if possible |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4253 // 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
|
4254 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
|
4255 } else { |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4256 insert_mem_bar(Op_MemBarCPUOrder); |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4257 } |
|
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4258 } |
| 0 | 4259 |
| 4260 //------------------------inline_native_clone---------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4261 // 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
|
4262 // |
| 0 | 4263 // Here are the simple edge cases: |
| 4264 // null receiver => normal trap | |
| 4265 // virtual and clone was overridden => slow path to out-of-line clone | |
| 4266 // not cloneable or finalizer => slow path to out-of-line Object.clone | |
| 4267 // | |
| 4268 // The general case has two steps, allocation and copying. | |
| 4269 // Allocation has two cases, and uses GraphKit::new_instance or new_array. | |
| 4270 // | |
| 4271 // Copying also has two cases, oop arrays and everything else. | |
| 4272 // Oop arrays use arrayof_oop_arraycopy (same as System.arraycopy). | |
| 4273 // Everything else uses the tight inline loop supplied by CopyArrayNode. | |
| 4274 // | |
| 4275 // These steps fold up nicely if and when the cloned object's klass | |
| 4276 // can be sharply typed as an object array, a type array, or an instance. | |
| 4277 // | |
| 4278 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
|
4279 PhiNode* result_val; |
| 0 | 4280 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4281 // 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
|
4282 // 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
|
4283 { PreserveReexecuteState preexecs(this); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4284 jvms()->set_should_reexecute(true); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4285 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4286 Node* obj = null_check_receiver(); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4287 if (stopped()) return true; |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4288 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4289 Node* obj_klass = load_object_klass(obj); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4290 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
|
4291 const TypeOopPtr* toop = ((tklass != NULL) |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4292 ? tklass->as_instance_type() |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4293 : TypeInstPtr::NOTNULL); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4294 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4295 // 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
|
4296 // 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
|
4297 insert_mem_bar(Op_MemBarCPUOrder); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4298 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4299 // paths into result_reg: |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4300 enum { |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4301 _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
|
4302 _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
|
4303 _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
|
4304 _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
|
4305 PATH_LIMIT |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4306 }; |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4307 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
|
4308 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
|
4309 TypeInstPtr::NOTNULL); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4310 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
|
4311 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
|
4312 TypePtr::BOTTOM); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4313 record_for_igvn(result_reg); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4314 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4315 const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM; |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4316 int raw_adr_idx = Compile::AliasIdxRaw; |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4317 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4318 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
|
4319 if (array_ctl != NULL) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4320 // It's an array. |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4321 PreserveJVMState pjvms(this); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4322 set_control(array_ctl); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4323 Node* obj_length = load_array_length(obj); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4324 Node* obj_size = NULL; |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4325 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
|
4326 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4327 if (!use_ReduceInitialCardMarks()) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4328 // 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
|
4329 // 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
|
4330 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
|
4331 if (is_obja != NULL) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4332 PreserveJVMState pjvms2(this); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4333 set_control(is_obja); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4334 // 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
|
4335 bool disjoint_bases = true; |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4336 bool length_never_negative = true; |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4337 generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4338 obj, intcon(0), alloc_obj, intcon(0), |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4339 obj_length, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4340 disjoint_bases, length_never_negative); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4341 result_reg->init_req(_objArray_path, control()); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4342 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
|
4343 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
|
4344 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
|
4345 } |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4346 } |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4347 // 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
|
4348 // (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
|
4349 // comes out of eden (TLAB)... In fact, ReduceInitialCardMarks |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4350 // 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
|
4351 // simulate a fresh allocation, so that no further |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4352 // 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
|
4353 // the object.) |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4354 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4355 if (!stopped()) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4356 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
|
4357 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4358 // Present the results of the copy. |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4359 result_reg->init_req(_array_path, control()); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4360 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
|
4361 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
|
4362 result_mem ->set_req(_array_path, reset_memory()); |
| 0 | 4363 } |
| 4364 } | |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4365 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4366 // 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
|
4367 // 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
|
4368 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
|
4369 record_for_igvn(slow_region); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4370 if (!stopped()) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4371 // 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
|
4372 // 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
|
4373 // 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
|
4374 // 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
|
4375 // 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
|
4376 // 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
|
4377 // Object clone(). |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4378 if (is_virtual) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4379 generate_virtual_guard(obj_klass, slow_region); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4380 } |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4381 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4382 // 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
|
4383 // 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
|
4384 // 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
|
4385 generate_access_flags_guard(obj_klass, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4386 // Test both conditions: |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4387 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
|
4388 // Must be cloneable but not finalizer: |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4389 JVM_ACC_IS_CLONEABLE, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4390 slow_region); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4391 } |
|
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4392 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4393 if (!stopped()) { |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4394 // 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
|
4395 PreserveJVMState pjvms(this); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4396 Node* obj_size = NULL; |
|
3278
66b0e2371912
7026700: regression in 6u24-rev-b23: Crash in C2 compiler in PhaseIdealLoop::build_loop_late_post
kvn
parents:
2446
diff
changeset
|
4397 Node* alloc_obj = new_instance(obj_klass, NULL, &obj_size); |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4398 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4399 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
|
4400 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4401 // Present the results of the slow call. |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4402 result_reg->init_req(_instance_path, control()); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4403 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
|
4404 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
|
4405 result_mem ->set_req(_instance_path, reset_memory()); |
| 0 | 4406 } |
| 4407 | |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4408 // 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
|
4409 set_control(_gvn.transform(slow_region)); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4410 if (!stopped()) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4411 PreserveJVMState pjvms(this); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4412 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
|
4413 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
|
4414 // 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
|
4415 result_reg->init_req(_slow_path, control()); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4416 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
|
4417 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
|
4418 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
|
4419 } |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4420 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4421 // Return the combined state. |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4422 set_control( _gvn.transform(result_reg)); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4423 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
|
4424 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
|
4425 } // original reexecute is set back here |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4426 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4427 set_result(_gvn.transform(result_val)); |
| 0 | 4428 return true; |
| 4429 } | |
| 4430 | |
| 4431 //------------------------------basictype2arraycopy---------------------------- | |
| 4432 address LibraryCallKit::basictype2arraycopy(BasicType t, | |
| 4433 Node* src_offset, | |
| 4434 Node* dest_offset, | |
| 4435 bool disjoint_bases, | |
| 2324 | 4436 const char* &name, |
| 4437 bool dest_uninitialized) { | |
| 0 | 4438 const TypeInt* src_offset_inttype = gvn().find_int_type(src_offset);; |
| 4439 const TypeInt* dest_offset_inttype = gvn().find_int_type(dest_offset);; | |
| 4440 | |
| 4441 bool aligned = false; | |
| 4442 bool disjoint = disjoint_bases; | |
| 4443 | |
| 4444 // if the offsets are the same, we can treat the memory regions as | |
| 4445 // disjoint, because either the memory regions are in different arrays, | |
| 4446 // or they are identical (which we can treat as disjoint.) We can also | |
| 4447 // treat a copy with a destination index less that the source index | |
| 4448 // as disjoint since a low->high copy will work correctly in this case. | |
| 4449 if (src_offset_inttype != NULL && src_offset_inttype->is_con() && | |
| 4450 dest_offset_inttype != NULL && dest_offset_inttype->is_con()) { | |
| 4451 // both indices are constants | |
| 4452 int s_offs = src_offset_inttype->get_con(); | |
| 4453 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
|
4454 int element_size = type2aelembytes(t); |
| 0 | 4455 aligned = ((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) && |
| 4456 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0); | |
| 4457 if (s_offs >= d_offs) disjoint = true; | |
| 4458 } else if (src_offset == dest_offset && src_offset != NULL) { | |
| 4459 // This can occur if the offsets are identical non-constants. | |
| 4460 disjoint = true; | |
| 4461 } | |
| 4462 | |
| 2446 | 4463 return StubRoutines::select_arraycopy_function(t, aligned, disjoint, name, dest_uninitialized); |
| 0 | 4464 } |
| 4465 | |
| 4466 | |
| 4467 //------------------------------inline_arraycopy----------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4468 // 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
|
4469 // Object dest, int destPos, |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4470 // int length); |
| 0 | 4471 bool LibraryCallKit::inline_arraycopy() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4472 // Get the arguments. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4473 Node* src = argument(0); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4474 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
|
4475 Node* dest = argument(2); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4476 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
|
4477 Node* length = argument(4); // type: int |
| 0 | 4478 |
| 4479 // Compile time checks. If any of these checks cannot be verified at compile time, | |
| 4480 // we do not make a fast path for this call. Instead, we let the call remain as it | |
| 4481 // is. The checks we choose to mandate at compile time are: | |
| 4482 // | |
| 4483 // (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
|
4484 const Type* src_type = src->Value(&_gvn); |
| 0 | 4485 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
|
4486 const TypeAryPtr* top_src = src_type->isa_aryptr(); |
| 0 | 4487 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); |
| 4488 if (top_src == NULL || top_src->klass() == NULL || | |
| 4489 top_dest == NULL || top_dest->klass() == NULL) { | |
| 4490 // Conservatively insert a memory barrier on all memory slices. | |
| 4491 // Do not let writes into the source float below the arraycopy. | |
| 4492 insert_mem_bar(Op_MemBarCPUOrder); | |
| 4493 | |
| 4494 // Call StubRoutines::generic_arraycopy stub. | |
| 4495 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
|
4496 src, src_offset, dest, dest_offset, length); |
| 0 | 4497 |
| 4498 // Do not let reads from the destination float above the arraycopy. | |
| 4499 // Since we cannot type the arrays, we don't know which slices | |
| 4500 // might be affected. We could restrict this barrier only to those | |
| 4501 // memory slices which pertain to array elements--but don't bother. | |
| 4502 if (!InsertMemBarAfterArraycopy) | |
| 4503 // (If InsertMemBarAfterArraycopy, there is already one in place.) | |
| 4504 insert_mem_bar(Op_MemBarCPUOrder); | |
| 4505 return true; | |
| 4506 } | |
| 4507 | |
| 4508 // (2) src and dest arrays must have elements of the same BasicType | |
| 4509 // Figure out the size and type of the elements we will be copying. | |
| 4510 BasicType src_elem = top_src->klass()->as_array_klass()->element_type()->basic_type(); | |
| 4511 BasicType dest_elem = top_dest->klass()->as_array_klass()->element_type()->basic_type(); | |
| 4512 if (src_elem == T_ARRAY) src_elem = T_OBJECT; | |
| 4513 if (dest_elem == T_ARRAY) dest_elem = T_OBJECT; | |
| 4514 | |
| 4515 if (src_elem != dest_elem || dest_elem == T_VOID) { | |
| 4516 // The component types are not the same or are not recognized. Punt. | |
| 4517 // (But, avoid the native method wrapper to JVM_ArrayCopy.) | |
| 4518 generate_slow_arraycopy(TypePtr::BOTTOM, | |
| 2324 | 4519 src, src_offset, dest, dest_offset, length, |
| 4520 /*dest_uninitialized*/false); | |
| 0 | 4521 return true; |
| 4522 } | |
| 4523 | |
| 4524 //--------------------------------------------------------------------------- | |
| 4525 // We will make a fast path for this call to arraycopy. | |
| 4526 | |
| 4527 // We have the following tests left to perform: | |
| 4528 // | |
| 4529 // (3) src and dest must not be null. | |
| 4530 // (4) src_offset must not be negative. | |
| 4531 // (5) dest_offset must not be negative. | |
| 4532 // (6) length must not be negative. | |
| 4533 // (7) src_offset + length must not exceed length of src. | |
| 4534 // (8) dest_offset + length must not exceed length of dest. | |
| 4535 // (9) each element of an oop array must be assignable | |
| 4536 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4537 RegionNode* slow_region = new (C) RegionNode(1); |
| 0 | 4538 record_for_igvn(slow_region); |
| 4539 | |
| 4540 // (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
|
4541 // We currently perform our null checks with the null_check routine. |
| 0 | 4542 // This means that the null exceptions will be reported in the caller |
| 4543 // rather than (correctly) reported inside of the native arraycopy call. | |
| 4544 // This should be corrected, given time. We do our null check with the | |
| 4545 // stack pointer restored. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4546 src = null_check(src, T_ARRAY); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4547 dest = null_check(dest, T_ARRAY); |
| 0 | 4548 |
| 4549 // (4) src_offset must not be negative. | |
| 4550 generate_negative_guard(src_offset, slow_region); | |
| 4551 | |
| 4552 // (5) dest_offset must not be negative. | |
| 4553 generate_negative_guard(dest_offset, slow_region); | |
| 4554 | |
| 4555 // (6) length must not be negative (moved to generate_arraycopy()). | |
| 4556 // generate_negative_guard(length, slow_region); | |
| 4557 | |
| 4558 // (7) src_offset + length must not exceed length of src. | |
| 4559 generate_limit_guard(src_offset, length, | |
| 4560 load_array_length(src), | |
| 4561 slow_region); | |
| 4562 | |
| 4563 // (8) dest_offset + length must not exceed length of dest. | |
| 4564 generate_limit_guard(dest_offset, length, | |
| 4565 load_array_length(dest), | |
| 4566 slow_region); | |
| 4567 | |
| 4568 // (9) each element of an oop array must be assignable | |
| 4569 // The generate_arraycopy subroutine checks this. | |
| 4570 | |
| 4571 // This is where the memory effects are placed: | |
| 4572 const TypePtr* adr_type = TypeAryPtr::get_array_body_type(dest_elem); | |
| 4573 generate_arraycopy(adr_type, dest_elem, | |
| 4574 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
|
4575 false, false, slow_region); |
| 0 | 4576 |
| 4577 return true; | |
| 4578 } | |
| 4579 | |
| 4580 //-----------------------------generate_arraycopy---------------------- | |
| 4581 // Generate an optimized call to arraycopy. | |
| 4582 // Caller must guard against non-arrays. | |
| 4583 // Caller must determine a common array basic-type for both arrays. | |
| 4584 // Caller must validate offsets against array bounds. | |
| 4585 // The slow_region has already collected guard failure paths | |
| 4586 // (such as out of bounds length or non-conformable array types). | |
| 4587 // The generated code has this shape, in general: | |
| 4588 // | |
| 4589 // if (length == 0) return // via zero_path | |
| 4590 // slowval = -1 | |
| 4591 // if (types unknown) { | |
| 4592 // slowval = call generic copy loop | |
| 4593 // if (slowval == 0) return // via checked_path | |
| 4594 // } else if (indexes in bounds) { | |
| 4595 // if ((is object array) && !(array type check)) { | |
| 4596 // slowval = call checked copy loop | |
| 4597 // if (slowval == 0) return // via checked_path | |
| 4598 // } else { | |
| 4599 // call bulk copy loop | |
| 4600 // return // via fast_path | |
| 4601 // } | |
| 4602 // } | |
| 4603 // // adjust params for remaining work: | |
| 4604 // if (slowval != -1) { | |
| 4605 // n = -1^slowval; src_offset += n; dest_offset += n; length -= n | |
| 4606 // } | |
| 4607 // slow_region: | |
| 4608 // call slow arraycopy(src, src_offset, dest, dest_offset, length) | |
| 4609 // return // via slow_call_path | |
| 4610 // | |
| 4611 // This routine is used from several intrinsics: System.arraycopy, | |
| 4612 // Object.clone (the array subcase), and Arrays.copyOf[Range]. | |
| 4613 // | |
| 4614 void | |
| 4615 LibraryCallKit::generate_arraycopy(const TypePtr* adr_type, | |
| 4616 BasicType basic_elem_type, | |
| 4617 Node* src, Node* src_offset, | |
| 4618 Node* dest, Node* dest_offset, | |
| 4619 Node* copy_length, | |
| 4620 bool disjoint_bases, | |
| 4621 bool length_never_negative, | |
| 4622 RegionNode* slow_region) { | |
| 4623 | |
| 4624 if (slow_region == NULL) { | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4625 slow_region = new(C) RegionNode(1); |
| 0 | 4626 record_for_igvn(slow_region); |
| 4627 } | |
| 4628 | |
| 4629 Node* original_dest = dest; | |
| 4630 AllocateArrayNode* alloc = NULL; // used for zeroing, if needed | |
| 2324 | 4631 bool dest_uninitialized = false; |
| 0 | 4632 |
| 4633 // See if this is the initialization of a newly-allocated array. | |
| 4634 // If so, we will take responsibility here for initializing it to zero. | |
| 4635 // (Note: Because tightly_coupled_allocation performs checks on the | |
| 4636 // out-edges of the dest, we need to avoid making derived pointers | |
| 4637 // from it until we have checked its uses.) | |
| 4638 if (ReduceBulkZeroing | |
| 4639 && !ZeroTLAB // pointless if already zeroed | |
| 4640 && basic_elem_type != T_CONFLICT // avoid corner case | |
| 4778 | 4641 && !src->eqv_uncast(dest) |
| 0 | 4642 && ((alloc = tightly_coupled_allocation(dest, slow_region)) |
| 4643 != NULL) | |
|
34
545c277a3ecf
6667581: Don't generate initialization (by 0) code for arrays with size 0
kvn
parents:
29
diff
changeset
|
4644 && _gvn.find_int_con(alloc->in(AllocateNode::ALength), 1) > 0 |
| 0 | 4645 && alloc->maybe_set_complete(&_gvn)) { |
| 4646 // "You break it, you buy it." | |
| 4647 InitializeNode* init = alloc->initialization(); | |
| 4648 assert(init->is_complete(), "we just did this"); | |
|
3961
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3742
diff
changeset
|
4649 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
|
4650 assert(dest->is_CheckCastPP(), "sanity"); |
| 0 | 4651 assert(dest->in(0)->in(0) == init, "dest pinned"); |
| 4652 adr_type = TypeRawPtr::BOTTOM; // all initializations are into raw memory | |
| 4653 // From this point on, every exit path is responsible for | |
| 4654 // initializing any non-copied parts of the object to zero. | |
| 2324 | 4655 // Also, if this flag is set we make sure that arraycopy interacts properly |
| 4656 // with G1, eliding pre-barriers. See CR 6627983. | |
| 4657 dest_uninitialized = true; | |
| 0 | 4658 } else { |
| 4659 // No zeroing elimination here. | |
| 4660 alloc = NULL; | |
| 4661 //original_dest = dest; | |
| 2324 | 4662 //dest_uninitialized = false; |
| 0 | 4663 } |
| 4664 | |
| 4665 // Results are placed here: | |
| 4666 enum { fast_path = 1, // normal void-returning assembly stub | |
| 4667 checked_path = 2, // special assembly stub with cleanup | |
| 4668 slow_call_path = 3, // something went wrong; call the VM | |
| 4669 zero_path = 4, // bypass when length of copy is zero | |
| 4670 bcopy_path = 5, // copy primitive array by 64-bit blocks | |
| 4671 PATH_LIMIT = 6 | |
| 4672 }; | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4673 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
|
4674 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
|
4675 PhiNode* result_memory = new(C) PhiNode(result_region, Type::MEMORY, adr_type); |
| 0 | 4676 record_for_igvn(result_region); |
| 4677 _gvn.set_type_bottom(result_i_o); | |
| 4678 _gvn.set_type_bottom(result_memory); | |
| 4679 assert(adr_type != TypePtr::BOTTOM, "must be RawMem or a T[] slice"); | |
| 4680 | |
| 4681 // The slow_control path: | |
| 4682 Node* slow_control; | |
| 4683 Node* slow_i_o = i_o(); | |
| 4684 Node* slow_mem = memory(adr_type); | |
| 4685 debug_only(slow_control = (Node*) badAddress); | |
| 4686 | |
| 4687 // Checked control path: | |
| 4688 Node* checked_control = top(); | |
| 4689 Node* checked_mem = NULL; | |
| 4690 Node* checked_i_o = NULL; | |
| 4691 Node* checked_value = NULL; | |
| 4692 | |
| 4693 if (basic_elem_type == T_CONFLICT) { | |
| 2324 | 4694 assert(!dest_uninitialized, ""); |
| 0 | 4695 Node* cv = generate_generic_arraycopy(adr_type, |
| 4696 src, src_offset, dest, dest_offset, | |
| 2324 | 4697 copy_length, dest_uninitialized); |
| 0 | 4698 if (cv == NULL) cv = intcon(-1); // failure (no stub available) |
| 4699 checked_control = control(); | |
| 4700 checked_i_o = i_o(); | |
| 4701 checked_mem = memory(adr_type); | |
| 4702 checked_value = cv; | |
| 4703 set_control(top()); // no fast path | |
| 4704 } | |
| 4705 | |
| 4706 Node* not_pos = generate_nonpositive_guard(copy_length, length_never_negative); | |
| 4707 if (not_pos != NULL) { | |
| 4708 PreserveJVMState pjvms(this); | |
| 4709 set_control(not_pos); | |
| 4710 | |
| 4711 // (6) length must not be negative. | |
| 4712 if (!length_never_negative) { | |
| 4713 generate_negative_guard(copy_length, slow_region); | |
| 4714 } | |
| 4715 | |
|
836
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
4716 // copy_length is 0. |
| 2324 | 4717 if (!stopped() && dest_uninitialized) { |
| 0 | 4718 Node* dest_length = alloc->in(AllocateNode::ALength); |
| 4778 | 4719 if (copy_length->eqv_uncast(dest_length) |
| 0 | 4720 || _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
|
4721 // There is no zeroing to do. No need for a secondary raw memory barrier. |
| 0 | 4722 } else { |
| 4723 // Clear the whole thing since there are no source elements to copy. | |
| 4724 generate_clear_array(adr_type, dest, basic_elem_type, | |
| 4725 intcon(0), NULL, | |
| 4726 alloc->in(AllocateNode::AllocSize)); | |
|
836
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
4727 // 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
|
4728 // 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
|
4729 // 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
|
4730 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
|
4731 Compile::AliasIdxRaw, |
|
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
4732 top())->as_Initialize(); |
|
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
4733 init->set_complete(&_gvn); // (there is no corresponding AllocateNode) |
| 0 | 4734 } |
| 4735 } | |
| 4736 | |
| 4737 // Present the results of the fast call. | |
| 4738 result_region->init_req(zero_path, control()); | |
| 4739 result_i_o ->init_req(zero_path, i_o()); | |
| 4740 result_memory->init_req(zero_path, memory(adr_type)); | |
| 4741 } | |
| 4742 | |
| 2324 | 4743 if (!stopped() && dest_uninitialized) { |
| 0 | 4744 // We have to initialize the *uncopied* part of the array to zero. |
| 4745 // The copy destination is the slice dest[off..off+len]. The other slices | |
| 4746 // are dest_head = dest[0..off] and dest_tail = dest[off+len..dest.length]. | |
| 4747 Node* dest_size = alloc->in(AllocateNode::AllocSize); | |
| 4748 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
|
4749 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
|
4750 copy_length)); |
| 0 | 4751 |
| 4752 // If there is a head section that needs zeroing, do it now. | |
| 4753 if (find_int_con(dest_offset, -1) != 0) { | |
| 4754 generate_clear_array(adr_type, dest, basic_elem_type, | |
| 4755 intcon(0), dest_offset, | |
| 4756 NULL); | |
| 4757 } | |
| 4758 | |
| 4759 // Next, perform a dynamic check on the tail length. | |
| 4760 // It is often zero, and we can win big if we prove this. | |
| 4761 // There are two wins: Avoid generating the ClearArray | |
| 4762 // with its attendant messy index arithmetic, and upgrade | |
| 4763 // the copy to a more hardware-friendly word size of 64 bits. | |
| 4764 Node* tail_ctl = NULL; | |
| 4778 | 4765 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
|
4766 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
|
4767 Node* bol_lt = _gvn.transform(new(C) BoolNode(cmp_lt, BoolTest::lt)); |
| 0 | 4768 tail_ctl = generate_slow_guard(bol_lt, NULL); |
| 4769 assert(tail_ctl != NULL || !stopped(), "must be an outcome"); | |
| 4770 } | |
| 4771 | |
| 4772 // At this point, let's assume there is no tail. | |
| 4773 if (!stopped() && alloc != NULL && basic_elem_type != T_OBJECT) { | |
| 4774 // There is no tail. Try an upgrade to a 64-bit copy. | |
| 4775 bool didit = false; | |
| 4776 { PreserveJVMState pjvms(this); | |
| 4777 didit = generate_block_arraycopy(adr_type, basic_elem_type, alloc, | |
| 4778 src, src_offset, dest, dest_offset, | |
| 2324 | 4779 dest_size, dest_uninitialized); |
| 0 | 4780 if (didit) { |
| 4781 // Present the results of the block-copying fast call. | |
| 4782 result_region->init_req(bcopy_path, control()); | |
| 4783 result_i_o ->init_req(bcopy_path, i_o()); | |
| 4784 result_memory->init_req(bcopy_path, memory(adr_type)); | |
| 4785 } | |
| 4786 } | |
| 4787 if (didit) | |
| 4788 set_control(top()); // no regular fast path | |
| 4789 } | |
| 4790 | |
| 4791 // Clear the tail, if any. | |
| 4792 if (tail_ctl != NULL) { | |
| 4793 Node* notail_ctl = stopped() ? NULL : control(); | |
| 4794 set_control(tail_ctl); | |
| 4795 if (notail_ctl == NULL) { | |
| 4796 generate_clear_array(adr_type, dest, basic_elem_type, | |
| 4797 dest_tail, NULL, | |
| 4798 dest_size); | |
| 4799 } else { | |
| 4800 // Make a local merge. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4801 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
|
4802 Node* done_mem = new(C) PhiNode(done_ctl, Type::MEMORY, adr_type); |
| 0 | 4803 done_ctl->init_req(1, notail_ctl); |
| 4804 done_mem->init_req(1, memory(adr_type)); | |
| 4805 generate_clear_array(adr_type, dest, basic_elem_type, | |
| 4806 dest_tail, NULL, | |
| 4807 dest_size); | |
| 4808 done_ctl->init_req(2, control()); | |
| 4809 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
|
4810 set_control( _gvn.transform(done_ctl)); |
| 0 | 4811 set_memory( _gvn.transform(done_mem), adr_type ); |
| 4812 } | |
| 4813 } | |
| 4814 } | |
| 4815 | |
| 4816 BasicType copy_type = basic_elem_type; | |
| 4817 assert(basic_elem_type != T_ARRAY, "caller must fix this"); | |
| 4818 if (!stopped() && copy_type == T_OBJECT) { | |
| 4819 // If src and dest have compatible element types, we can copy bits. | |
| 4820 // Types S[] and D[] are compatible if D is a supertype of S. | |
| 4821 // | |
| 4822 // If they are not, we will use checked_oop_disjoint_arraycopy, | |
| 4823 // which performs a fast optimistic per-oop check, and backs off | |
| 4824 // further to JVM_ArrayCopy on the first per-oop check that fails. | |
| 4825 // (Actually, we don't move raw bits only; the GC requires card marks.) | |
| 4826 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4827 // Get the Klass* for both src and dest |
| 0 | 4828 Node* src_klass = load_object_klass(src); |
| 4829 Node* dest_klass = load_object_klass(dest); | |
| 4830 | |
| 4831 // Generate the subtype check. | |
| 4832 // This might fold up statically, or then again it might not. | |
| 4833 // | |
| 4834 // Non-static example: Copying List<String>.elements to a new String[]. | |
| 4835 // The backing store for a List<String> is always an Object[], | |
| 4836 // but its elements are always type String, if the generic types | |
| 4837 // are correct at the source level. | |
| 4838 // | |
| 4839 // Test S[] against D[], not S against D, because (probably) | |
| 4840 // the secondary supertype cache is less busy for S[] than S. | |
| 4841 // This usually only matters when D is an interface. | |
| 4842 Node* not_subtype_ctrl = gen_subtype_check(src_klass, dest_klass); | |
| 4843 // Plug failing path into checked_oop_disjoint_arraycopy | |
| 4844 if (not_subtype_ctrl != top()) { | |
| 4845 PreserveJVMState pjvms(this); | |
| 4846 set_control(not_subtype_ctrl); | |
| 4847 // (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
|
4848 int ek_offset = in_bytes(ObjArrayKlass::element_klass_offset()); |
| 0 | 4849 Node* p1 = basic_plus_adr(dest_klass, ek_offset); |
|
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
4850 Node* n1 = LoadKlassNode::make(_gvn, immutable_memory(), p1, TypeRawPtr::BOTTOM); |
| 0 | 4851 Node* dest_elem_klass = _gvn.transform(n1); |
| 4852 Node* cv = generate_checkcast_arraycopy(adr_type, | |
| 4853 dest_elem_klass, | |
| 4854 src, src_offset, dest, dest_offset, | |
| 2324 | 4855 ConvI2X(copy_length), dest_uninitialized); |
| 0 | 4856 if (cv == NULL) cv = intcon(-1); // failure (no stub available) |
| 4857 checked_control = control(); | |
| 4858 checked_i_o = i_o(); | |
| 4859 checked_mem = memory(adr_type); | |
| 4860 checked_value = cv; | |
| 4861 } | |
| 4862 // At this point we know we do not need type checks on oop stores. | |
| 4863 | |
| 4864 // Let's see if we need card marks: | |
| 4865 if (alloc != NULL && use_ReduceInitialCardMarks()) { | |
| 4866 // 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
|
4867 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
|
4868 assert(type2aelembytes(basic_elem_type) == type2aelembytes(copy_type), |
| 0 | 4869 "sizes agree"); |
| 4870 } | |
| 4871 } | |
| 4872 | |
| 4873 if (!stopped()) { | |
| 4874 // Generate the fast path, if possible. | |
| 4875 PreserveJVMState pjvms(this); | |
| 4876 generate_unchecked_arraycopy(adr_type, copy_type, disjoint_bases, | |
| 4877 src, src_offset, dest, dest_offset, | |
| 2324 | 4878 ConvI2X(copy_length), dest_uninitialized); |
| 0 | 4879 |
| 4880 // Present the results of the fast call. | |
| 4881 result_region->init_req(fast_path, control()); | |
| 4882 result_i_o ->init_req(fast_path, i_o()); | |
| 4883 result_memory->init_req(fast_path, memory(adr_type)); | |
| 4884 } | |
| 4885 | |
| 4886 // Here are all the slow paths up to this point, in one bundle: | |
| 4887 slow_control = top(); | |
| 4888 if (slow_region != NULL) | |
| 4889 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
|
4890 DEBUG_ONLY(slow_region = (RegionNode*)badAddress); |
| 0 | 4891 |
| 4892 set_control(checked_control); | |
| 4893 if (!stopped()) { | |
| 4894 // Clean up after the checked call. | |
| 4895 // The returned value is either 0 or -1^K, | |
| 4896 // 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
|
4897 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
|
4898 Node* bol = _gvn.transform(new(C) BoolNode(cmp, BoolTest::eq)); |
| 0 | 4899 IfNode* iff = create_and_map_if(control(), bol, PROB_MAX, COUNT_UNKNOWN); |
| 4900 | |
| 4901 // 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
|
4902 Node* checks_done = _gvn.transform(new(C) IfTrueNode(iff)); |
| 0 | 4903 result_region->init_req(checked_path, checks_done); |
| 4904 result_i_o ->init_req(checked_path, checked_i_o); | |
| 4905 result_memory->init_req(checked_path, checked_mem); | |
| 4906 | |
| 4907 // 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
|
4908 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
|
4909 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
|
4910 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
|
4911 PhiNode* slow_mem2 = new(C) PhiNode(slow_reg2, Type::MEMORY, adr_type); |
| 0 | 4912 record_for_igvn(slow_reg2); |
| 4913 slow_reg2 ->init_req(1, slow_control); | |
| 4914 slow_i_o2 ->init_req(1, slow_i_o); | |
| 4915 slow_mem2 ->init_req(1, slow_mem); | |
| 4916 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
|
4917 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
|
4918 slow_mem2 ->init_req(2, checked_mem); |
| 0 | 4919 |
| 4920 slow_control = _gvn.transform(slow_reg2); | |
| 4921 slow_i_o = _gvn.transform(slow_i_o2); | |
| 4922 slow_mem = _gvn.transform(slow_mem2); | |
| 4923 | |
| 4924 if (alloc != NULL) { | |
| 4925 // We'll restart from the very beginning, after zeroing the whole thing. | |
| 4926 // This can cause double writes, but that's OK since dest is brand new. | |
| 4927 // So we ignore the low 31 bits of the value returned from the stub. | |
| 4928 } else { | |
| 4929 // We must continue the copy exactly where it failed, or else | |
| 4930 // 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
|
4931 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
|
4932 Node* slow_offset = new(C) PhiNode(slow_reg2, TypeInt::INT); |
| 0 | 4933 slow_offset->init_req(1, intcon(0)); |
| 4934 slow_offset->init_req(2, checked_offset); | |
| 4935 slow_offset = _gvn.transform(slow_offset); | |
| 4936 | |
| 4937 // 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
|
4938 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
|
4939 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
|
4940 Node* length_minus = _gvn.transform(new(C) SubINode(copy_length, slow_offset)); |
| 0 | 4941 |
| 4942 // Tweak the node variables to adjust the code produced below: | |
| 4943 src_offset = src_off_plus; | |
| 4944 dest_offset = dest_off_plus; | |
| 4945 copy_length = length_minus; | |
| 4946 } | |
| 4947 } | |
| 4948 | |
| 4949 set_control(slow_control); | |
| 4950 if (!stopped()) { | |
| 4951 // Generate the slow path, if needed. | |
| 4952 PreserveJVMState pjvms(this); // replace_in_map may trash the map | |
| 4953 | |
| 4954 set_memory(slow_mem, adr_type); | |
| 4955 set_i_o(slow_i_o); | |
| 4956 | |
| 2324 | 4957 if (dest_uninitialized) { |
| 0 | 4958 generate_clear_array(adr_type, dest, basic_elem_type, |
| 4959 intcon(0), NULL, | |
| 4960 alloc->in(AllocateNode::AllocSize)); | |
| 4961 } | |
| 4962 | |
| 4963 generate_slow_arraycopy(adr_type, | |
| 4964 src, src_offset, dest, dest_offset, | |
| 2324 | 4965 copy_length, /*dest_uninitialized*/false); |
| 0 | 4966 |
| 4967 result_region->init_req(slow_call_path, control()); | |
| 4968 result_i_o ->init_req(slow_call_path, i_o()); | |
| 4969 result_memory->init_req(slow_call_path, memory(adr_type)); | |
| 4970 } | |
| 4971 | |
| 4972 // Remove unused edges. | |
| 4973 for (uint i = 1; i < result_region->req(); i++) { | |
| 4974 if (result_region->in(i) == NULL) | |
| 4975 result_region->init_req(i, top()); | |
| 4976 } | |
| 4977 | |
| 4978 // Finished; return the combined state. | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
4979 set_control( _gvn.transform(result_region)); |
| 0 | 4980 set_i_o( _gvn.transform(result_i_o) ); |
| 4981 set_memory( _gvn.transform(result_memory), adr_type ); | |
| 4982 | |
| 4983 // The memory edges above are precise in order to model effects around | |
| 605 | 4984 // array copies accurately to allow value numbering of field loads around |
| 0 | 4985 // arraycopy. Such field loads, both before and after, are common in Java |
| 4986 // collections and similar classes involving header/array data structures. | |
| 4987 // | |
| 4988 // But with low number of register or when some registers are used or killed | |
| 4989 // by arraycopy calls it causes registers spilling on stack. See 6544710. | |
| 4990 // The next memory barrier is added to avoid it. If the arraycopy can be | |
| 4991 // optimized away (which it can, sometimes) then we can manually remove | |
| 4992 // the membar also. | |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4993 // |
|
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4994 // 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
|
4995 if (alloc != NULL) { |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4996 // 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
|
4997 // 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
|
4998 // other threads. |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4999 // 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
|
5000 // 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
|
5001 // AllocateNode and eliminate the MemBarStoreStoreNode if possible |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
5002 // 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
|
5003 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
|
5004 } else if (InsertMemBarAfterArraycopy) |
| 0 | 5005 insert_mem_bar(Op_MemBarCPUOrder); |
| 5006 } | |
| 5007 | |
| 5008 | |
| 5009 // Helper function which determines if an arraycopy immediately follows | |
| 5010 // an allocation, with no intervening tests or other escapes for the object. | |
| 5011 AllocateArrayNode* | |
| 5012 LibraryCallKit::tightly_coupled_allocation(Node* ptr, | |
| 5013 RegionNode* slow_region) { | |
| 5014 if (stopped()) return NULL; // no fast path | |
| 5015 if (C->AliasLevel() == 0) return NULL; // no MergeMems around | |
| 5016 | |
| 5017 AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(ptr, &_gvn); | |
| 5018 if (alloc == NULL) return NULL; | |
| 5019 | |
| 5020 Node* rawmem = memory(Compile::AliasIdxRaw); | |
| 5021 // Is the allocation's memory state untouched? | |
| 5022 if (!(rawmem->is_Proj() && rawmem->in(0)->is_Initialize())) { | |
| 5023 // Bail out if there have been raw-memory effects since the allocation. | |
| 5024 // (Example: There might have been a call or safepoint.) | |
| 5025 return NULL; | |
| 5026 } | |
| 5027 rawmem = rawmem->in(0)->as_Initialize()->memory(Compile::AliasIdxRaw); | |
| 5028 if (!(rawmem->is_Proj() && rawmem->in(0) == alloc)) { | |
| 5029 return NULL; | |
| 5030 } | |
| 5031 | |
| 5032 // There must be no unexpected observers of this allocation. | |
| 5033 for (DUIterator_Fast imax, i = ptr->fast_outs(imax); i < imax; i++) { | |
| 5034 Node* obs = ptr->fast_out(i); | |
| 5035 if (obs != this->map()) { | |
| 5036 return NULL; | |
| 5037 } | |
| 5038 } | |
| 5039 | |
| 5040 // This arraycopy must unconditionally follow the allocation of the ptr. | |
| 5041 Node* alloc_ctl = ptr->in(0); | |
| 5042 assert(just_allocated_object(alloc_ctl) == ptr, "most recent allo"); | |
| 5043 | |
| 5044 Node* ctl = control(); | |
| 5045 while (ctl != alloc_ctl) { | |
| 5046 // There may be guards which feed into the slow_region. | |
| 5047 // Any other control flow means that we might not get a chance | |
| 5048 // to finish initializing the allocated object. | |
| 5049 if ((ctl->is_IfFalse() || ctl->is_IfTrue()) && ctl->in(0)->is_If()) { | |
| 5050 IfNode* iff = ctl->in(0)->as_If(); | |
| 5051 Node* not_ctl = iff->proj_out(1 - ctl->as_Proj()->_con); | |
| 5052 assert(not_ctl != NULL && not_ctl != ctl, "found alternate"); | |
| 5053 if (slow_region != NULL && slow_region->find_edge(not_ctl) >= 1) { | |
| 5054 ctl = iff->in(0); // This test feeds the known slow_region. | |
| 5055 continue; | |
| 5056 } | |
| 5057 // One more try: Various low-level checks bottom out in | |
| 5058 // uncommon traps. If the debug-info of the trap omits | |
| 5059 // any reference to the allocation, as we've already | |
| 5060 // observed, then there can be no objection to the trap. | |
| 5061 bool found_trap = false; | |
| 5062 for (DUIterator_Fast jmax, j = not_ctl->fast_outs(jmax); j < jmax; j++) { | |
| 5063 Node* obs = not_ctl->fast_out(j); | |
| 5064 if (obs->in(0) == not_ctl && obs->is_Call() && | |
| 1748 | 5065 (obs->as_Call()->entry_point() == SharedRuntime::uncommon_trap_blob()->entry_point())) { |
| 0 | 5066 found_trap = true; break; |
| 5067 } | |
| 5068 } | |
| 5069 if (found_trap) { | |
| 5070 ctl = iff->in(0); // This test feeds a harmless uncommon trap. | |
| 5071 continue; | |
| 5072 } | |
| 5073 } | |
| 5074 return NULL; | |
| 5075 } | |
| 5076 | |
| 5077 // If we get this far, we have an allocation which immediately | |
| 5078 // precedes the arraycopy, and we can take over zeroing the new object. | |
| 5079 // The arraycopy will finish the initialization, and provide | |
| 5080 // a new control state to which we will anchor the destination pointer. | |
| 5081 | |
| 5082 return alloc; | |
| 5083 } | |
| 5084 | |
| 5085 // Helper for initialization of arrays, creating a ClearArray. | |
| 5086 // It writes zero bits in [start..end), within the body of an array object. | |
| 5087 // The memory effects are all chained onto the 'adr_type' alias category. | |
| 5088 // | |
| 5089 // Since the object is otherwise uninitialized, we are free | |
| 5090 // to put a little "slop" around the edges of the cleared area, | |
| 5091 // as long as it does not go back into the array's header, | |
| 5092 // or beyond the array end within the heap. | |
| 5093 // | |
| 5094 // The lower edge can be rounded down to the nearest jint and the | |
| 5095 // upper edge can be rounded up to the nearest MinObjAlignmentInBytes. | |
| 5096 // | |
| 5097 // Arguments: | |
| 5098 // adr_type memory slice where writes are generated | |
| 5099 // dest oop of the destination array | |
| 5100 // basic_elem_type element type of the destination | |
| 5101 // slice_idx array index of first element to store | |
| 5102 // slice_len number of elements to store (or NULL) | |
| 5103 // dest_size total size in bytes of the array object | |
| 5104 // | |
| 5105 // Exactly one of slice_len or dest_size must be non-NULL. | |
| 5106 // If dest_size is non-NULL, zeroing extends to the end of the object. | |
| 5107 // If slice_len is non-NULL, the slice_idx value must be a constant. | |
| 5108 void | |
| 5109 LibraryCallKit::generate_clear_array(const TypePtr* adr_type, | |
| 5110 Node* dest, | |
| 5111 BasicType basic_elem_type, | |
| 5112 Node* slice_idx, | |
| 5113 Node* slice_len, | |
| 5114 Node* dest_size) { | |
| 5115 // one or the other but not both of slice_len and dest_size: | |
| 5116 assert((slice_len != NULL? 1: 0) + (dest_size != NULL? 1: 0) == 1, ""); | |
| 5117 if (slice_len == NULL) slice_len = top(); | |
| 5118 if (dest_size == NULL) dest_size = top(); | |
| 5119 | |
| 5120 // operate on this memory slice: | |
| 5121 Node* mem = memory(adr_type); // memory slice to operate on | |
| 5122 | |
| 5123 // scaling and rounding of indexes: | |
|
29
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
0
diff
changeset
|
5124 int scale = exact_log2(type2aelembytes(basic_elem_type)); |
| 0 | 5125 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type); |
| 5126 int clear_low = (-1 << scale) & (BytesPerInt - 1); | |
| 5127 int bump_bit = (-1 << scale) & BytesPerInt; | |
| 5128 | |
| 5129 // determine constant starts and ends | |
| 5130 const intptr_t BIG_NEG = -128; | |
| 5131 assert(BIG_NEG + 2*abase < 0, "neg enough"); | |
| 5132 intptr_t slice_idx_con = (intptr_t) find_int_con(slice_idx, BIG_NEG); | |
| 5133 intptr_t slice_len_con = (intptr_t) find_int_con(slice_len, BIG_NEG); | |
| 5134 if (slice_len_con == 0) { | |
| 5135 return; // nothing to do here | |
| 5136 } | |
| 5137 intptr_t start_con = (abase + (slice_idx_con << scale)) & ~clear_low; | |
| 5138 intptr_t end_con = find_intptr_t_con(dest_size, -1); | |
| 5139 if (slice_idx_con >= 0 && slice_len_con >= 0) { | |
| 5140 assert(end_con < 0, "not two cons"); | |
| 5141 end_con = round_to(abase + ((slice_idx_con + slice_len_con) << scale), | |
| 5142 BytesPerLong); | |
| 5143 } | |
| 5144 | |
| 5145 if (start_con >= 0 && end_con >= 0) { | |
| 5146 // Constant start and end. Simple. | |
| 5147 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
| 5148 start_con, end_con, &_gvn); | |
| 5149 } else if (start_con >= 0 && dest_size != top()) { | |
| 5150 // Constant start, pre-rounded end after the tail of the array. | |
| 5151 Node* end = dest_size; | |
| 5152 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
| 5153 start_con, end, &_gvn); | |
| 5154 } else if (start_con >= 0 && slice_len != top()) { | |
| 5155 // Constant start, non-constant end. End needs rounding up. | |
| 5156 // End offset = round_up(abase + ((slice_idx_con + slice_len) << scale), 8) | |
| 5157 intptr_t end_base = abase + (slice_idx_con << scale); | |
| 5158 int end_round = (-1 << scale) & (BytesPerLong - 1); | |
| 5159 Node* end = ConvI2X(slice_len); | |
| 5160 if (scale != 0) | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5161 end = _gvn.transform(new(C) LShiftXNode(end, intcon(scale) )); |
| 0 | 5162 end_base += end_round; |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5163 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
|
5164 end = _gvn.transform(new(C) AndXNode(end, MakeConX(~end_round))); |
| 0 | 5165 mem = ClearArrayNode::clear_memory(control(), mem, dest, |
| 5166 start_con, end, &_gvn); | |
| 5167 } else if (start_con < 0 && dest_size != top()) { | |
| 5168 // Non-constant start, pre-rounded end after the tail of the array. | |
| 5169 // This is almost certainly a "round-to-end" operation. | |
| 5170 Node* start = slice_idx; | |
| 5171 start = ConvI2X(start); | |
| 5172 if (scale != 0) | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5173 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
|
5174 start = _gvn.transform(new(C) AddXNode(start, MakeConX(abase))); |
| 0 | 5175 if ((bump_bit | clear_low) != 0) { |
| 5176 int to_clear = (bump_bit | clear_low); | |
| 5177 // Align up mod 8, then store a jint zero unconditionally | |
| 5178 // 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
|
5179 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
|
5180 < 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
|
5181 bump_bit = 0; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5182 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
|
5183 } else { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5184 // 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
|
5185 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
|
5186 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
|
5187 } |
| 0 | 5188 // 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
|
5189 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
|
5190 if (bump_bit != 0) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5191 // 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
|
5192 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
|
5193 Node* p1 = basic_plus_adr(dest, x1); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5194 mem = StoreNode::make(_gvn, control(), mem, p1, adr_type, intcon(0), T_INT); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5195 mem = _gvn.transform(mem); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5196 } |
| 0 | 5197 } |
| 5198 Node* end = dest_size; // pre-rounded | |
| 5199 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
| 5200 start, end, &_gvn); | |
| 5201 } else { | |
| 5202 // Non-constant start, unrounded non-constant end. | |
| 5203 // (Nobody zeroes a random midsection of an array using this routine.) | |
| 5204 ShouldNotReachHere(); // fix caller | |
| 5205 } | |
| 5206 | |
| 5207 // Done. | |
| 5208 set_memory(mem, adr_type); | |
| 5209 } | |
| 5210 | |
| 5211 | |
| 5212 bool | |
| 5213 LibraryCallKit::generate_block_arraycopy(const TypePtr* adr_type, | |
| 5214 BasicType basic_elem_type, | |
| 5215 AllocateNode* alloc, | |
| 5216 Node* src, Node* src_offset, | |
| 5217 Node* dest, Node* dest_offset, | |
| 2324 | 5218 Node* dest_size, bool dest_uninitialized) { |
| 0 | 5219 // 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
|
5220 int scale = exact_log2(type2aelembytes(basic_elem_type)); |
| 0 | 5221 if (scale >= LogBytesPerLong) |
| 5222 return false; // it is already a block transfer | |
| 5223 | |
| 5224 // Look at the alignment of the starting offsets. | |
| 5225 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
|
5226 |
|
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5227 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
|
5228 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
|
5229 if (src_off_con < 0 || dest_off_con < 0) |
| 0 | 5230 // At present, we can only understand constants. |
| 5231 return false; | |
| 5232 | |
|
3742
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5233 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
|
5234 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
|
5235 |
| 0 | 5236 if (((src_off | dest_off) & (BytesPerLong-1)) != 0) { |
| 5237 // Non-aligned; too bad. | |
| 5238 // One more chance: Pick off an initial 32-bit word. | |
| 5239 // This is a common case, since abase can be odd mod 8. | |
| 5240 if (((src_off | dest_off) & (BytesPerLong-1)) == BytesPerInt && | |
| 5241 ((src_off ^ dest_off) & (BytesPerLong-1)) == 0) { | |
| 5242 Node* sptr = basic_plus_adr(src, src_off); | |
| 5243 Node* dptr = basic_plus_adr(dest, dest_off); | |
| 5244 Node* sval = make_load(control(), sptr, TypeInt::INT, T_INT, adr_type); | |
| 5245 store_to_memory(control(), dptr, sval, T_INT, adr_type); | |
| 5246 src_off += BytesPerInt; | |
| 5247 dest_off += BytesPerInt; | |
| 5248 } else { | |
| 5249 return false; | |
| 5250 } | |
| 5251 } | |
| 5252 assert(src_off % BytesPerLong == 0, ""); | |
| 5253 assert(dest_off % BytesPerLong == 0, ""); | |
| 5254 | |
| 5255 // Do this copy by giant steps. | |
| 5256 Node* sptr = basic_plus_adr(src, src_off); | |
| 5257 Node* dptr = basic_plus_adr(dest, dest_off); | |
| 5258 Node* countx = dest_size; | |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5259 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
|
5260 countx = _gvn.transform(new (C) URShiftXNode(countx, intcon(LogBytesPerLong))); |
| 0 | 5261 |
| 5262 bool disjoint_bases = true; // since alloc != NULL | |
| 5263 generate_unchecked_arraycopy(adr_type, T_LONG, disjoint_bases, | |
| 2324 | 5264 sptr, NULL, dptr, NULL, countx, dest_uninitialized); |
| 0 | 5265 |
| 5266 return true; | |
| 5267 } | |
| 5268 | |
| 5269 | |
| 5270 // Helper function; generates code for the slow case. | |
| 5271 // We make a call to a runtime method which emulates the native method, | |
| 5272 // but without the native wrapper overhead. | |
| 5273 void | |
| 5274 LibraryCallKit::generate_slow_arraycopy(const TypePtr* adr_type, | |
| 5275 Node* src, Node* src_offset, | |
| 5276 Node* dest, Node* dest_offset, | |
| 2324 | 5277 Node* copy_length, bool dest_uninitialized) { |
| 5278 assert(!dest_uninitialized, "Invariant"); | |
| 0 | 5279 Node* call = make_runtime_call(RC_NO_LEAF | RC_UNCOMMON, |
| 5280 OptoRuntime::slow_arraycopy_Type(), | |
| 5281 OptoRuntime::slow_arraycopy_Java(), | |
| 5282 "slow_arraycopy", adr_type, | |
| 5283 src, src_offset, dest, dest_offset, | |
| 5284 copy_length); | |
| 5285 | |
| 5286 // Handle exceptions thrown by this fellow: | |
| 5287 make_slow_call_ex(call, env()->Throwable_klass(), false); | |
| 5288 } | |
| 5289 | |
| 5290 // Helper function; generates code for cases requiring runtime checks. | |
| 5291 Node* | |
| 5292 LibraryCallKit::generate_checkcast_arraycopy(const TypePtr* adr_type, | |
| 5293 Node* dest_elem_klass, | |
| 5294 Node* src, Node* src_offset, | |
| 5295 Node* dest, Node* dest_offset, | |
| 2324 | 5296 Node* copy_length, bool dest_uninitialized) { |
| 0 | 5297 if (stopped()) return NULL; |
| 5298 | |
| 2324 | 5299 address copyfunc_addr = StubRoutines::checkcast_arraycopy(dest_uninitialized); |
| 0 | 5300 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path. |
| 5301 return NULL; | |
| 5302 } | |
| 5303 | |
| 5304 // Pick out the parameters required to perform a store-check | |
| 5305 // for the target array. This is an optimistic check. It will | |
| 5306 // look in each non-null element's class, at the desired klass's | |
| 5307 // 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
|
5308 int sco_offset = in_bytes(Klass::super_check_offset_offset()); |
| 0 | 5309 Node* p3 = basic_plus_adr(dest_elem_klass, sco_offset); |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5310 Node* n3 = new(C) LoadINode(NULL, memory(p3), p3, _gvn.type(p3)->is_ptr()); |
|
1844
75588558f1bf
6980792: Crash "exception happened outside interpreter, nmethods and vtable stubs (1)"
never
parents:
1748
diff
changeset
|
5311 Node* check_offset = ConvI2X(_gvn.transform(n3)); |
| 0 | 5312 Node* check_value = dest_elem_klass; |
| 5313 | |
| 5314 Node* src_start = array_element_address(src, src_offset, T_OBJECT); | |
| 5315 Node* dest_start = array_element_address(dest, dest_offset, T_OBJECT); | |
| 5316 | |
| 5317 // (We know the arrays are never conjoint, because their types differ.) | |
| 5318 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, | |
| 5319 OptoRuntime::checkcast_arraycopy_Type(), | |
| 5320 copyfunc_addr, "checkcast_arraycopy", adr_type, | |
| 5321 // five arguments, of which two are | |
| 5322 // intptr_t (jlong in LP64) | |
| 5323 src_start, dest_start, | |
| 5324 copy_length XTOP, | |
| 5325 check_offset XTOP, | |
| 5326 check_value); | |
| 5327 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5328 return _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
| 0 | 5329 } |
| 5330 | |
| 5331 | |
| 5332 // Helper function; generates code for cases requiring runtime checks. | |
| 5333 Node* | |
| 5334 LibraryCallKit::generate_generic_arraycopy(const TypePtr* adr_type, | |
| 5335 Node* src, Node* src_offset, | |
| 5336 Node* dest, Node* dest_offset, | |
| 2324 | 5337 Node* copy_length, bool dest_uninitialized) { |
| 5338 assert(!dest_uninitialized, "Invariant"); | |
| 0 | 5339 if (stopped()) return NULL; |
| 5340 address copyfunc_addr = StubRoutines::generic_arraycopy(); | |
| 5341 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path. | |
| 5342 return NULL; | |
| 5343 } | |
| 5344 | |
| 5345 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, | |
| 5346 OptoRuntime::generic_arraycopy_Type(), | |
| 5347 copyfunc_addr, "generic_arraycopy", adr_type, | |
| 5348 src, src_offset, dest, dest_offset, copy_length); | |
| 5349 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5350 return _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
| 0 | 5351 } |
| 5352 | |
| 5353 // Helper function; generates the fast out-of-line call to an arraycopy stub. | |
| 5354 void | |
| 5355 LibraryCallKit::generate_unchecked_arraycopy(const TypePtr* adr_type, | |
| 5356 BasicType basic_elem_type, | |
| 5357 bool disjoint_bases, | |
| 5358 Node* src, Node* src_offset, | |
| 5359 Node* dest, Node* dest_offset, | |
| 2324 | 5360 Node* copy_length, bool dest_uninitialized) { |
| 0 | 5361 if (stopped()) return; // nothing to do |
| 5362 | |
| 5363 Node* src_start = src; | |
| 5364 Node* dest_start = dest; | |
| 5365 if (src_offset != NULL || dest_offset != NULL) { | |
| 5366 assert(src_offset != NULL && dest_offset != NULL, ""); | |
| 5367 src_start = array_element_address(src, src_offset, basic_elem_type); | |
| 5368 dest_start = array_element_address(dest, dest_offset, basic_elem_type); | |
| 5369 } | |
| 5370 | |
| 5371 // Figure out which arraycopy runtime method to call. | |
| 5372 const char* copyfunc_name = "arraycopy"; | |
| 5373 address copyfunc_addr = | |
| 5374 basictype2arraycopy(basic_elem_type, src_offset, dest_offset, | |
| 2324 | 5375 disjoint_bases, copyfunc_name, dest_uninitialized); |
| 0 | 5376 |
| 5377 // Call it. Note that the count_ix value is not scaled to a byte-size. | |
| 5378 make_runtime_call(RC_LEAF|RC_NO_FP, | |
| 5379 OptoRuntime::fast_arraycopy_Type(), | |
| 5380 copyfunc_addr, copyfunc_name, adr_type, | |
| 5381 src_start, dest_start, copy_length XTOP); | |
| 5382 } | |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5383 |
|
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5384 //-------------inline_encodeISOArray----------------------------------- |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5385 // 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
|
5386 bool LibraryCallKit::inline_encodeISOArray() { |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5387 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
|
5388 // 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
|
5389 Node *src = argument(0); |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5390 Node *src_offset = argument(1); |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5391 Node *dst = argument(2); |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5392 Node *dst_offset = argument(3); |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5393 Node *length = argument(4); |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5394 |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5395 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
|
5396 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
|
5397 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
|
5398 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
|
5399 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
|
5400 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
|
5401 // failed array check |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5402 return false; |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5403 } |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5404 |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5405 // 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
|
5406 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
|
5407 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
|
5408 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
|
5409 return false; |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5410 } |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5411 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
|
5412 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
|
5413 // '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
|
5414 // '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
|
5415 |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5416 const TypeAryPtr* mtype = TypeAryPtr::BYTES; |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5417 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
|
5418 enc = _gvn.transform(enc); |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5419 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
|
5420 set_memory(res_mem, mtype); |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5421 set_result(enc); |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5422 return true; |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5423 } |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
7602
diff
changeset
|
5424 |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5425 /** |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5426 * Calculate CRC32 for byte. |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5427 * 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
|
5428 */ |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5429 bool LibraryCallKit::inline_updateCRC32() { |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5430 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
|
5431 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
|
5432 // no receiver since it is static method |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5433 Node* crc = argument(0); // type: int |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5434 Node* b = argument(1); // type: int |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5435 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5436 /* |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5437 * int c = ~ crc; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5438 * b = timesXtoThe32[(b ^ c) & 0xFF]; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5439 * b = b ^ (c >>> 8); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5440 * crc = ~b; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5441 */ |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5442 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5443 Node* M1 = intcon(-1); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5444 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
|
5445 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
|
5446 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
|
5447 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5448 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
|
5449 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
|
5450 Node* adr = basic_plus_adr(top(), base, ConvI2X(offset)); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5451 result = make_load(control(), adr, TypeInt::INT, T_INT); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5452 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5453 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
|
5454 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
|
5455 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
|
5456 set_result(result); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5457 return true; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5458 } |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5459 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5460 /** |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5461 * Calculate CRC32 for byte[] array. |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5462 * 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
|
5463 */ |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5464 bool LibraryCallKit::inline_updateBytesCRC32() { |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5465 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
|
5466 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
|
5467 // no receiver since it is static method |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5468 Node* crc = argument(0); // type: int |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5469 Node* src = argument(1); // type: oop |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5470 Node* offset = argument(2); // type: int |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5471 Node* length = argument(3); // type: int |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5472 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5473 const Type* src_type = src->Value(&_gvn); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5474 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
|
5475 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
|
5476 // failed array check |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5477 return false; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5478 } |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5479 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5480 // 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
|
5481 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
|
5482 if (src_elem != T_BYTE) { |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5483 return false; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5484 } |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5485 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5486 // '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
|
5487 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
|
5488 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5489 // 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
|
5490 // 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
|
5491 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5492 // Call the stub. |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5493 address stubAddr = StubRoutines::updateBytesCRC32(); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5494 const char *stubName = "updateBytesCRC32"; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5495 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5496 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
|
5497 stubAddr, stubName, TypePtr::BOTTOM, |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5498 crc, src_start, length); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5499 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
|
5500 set_result(result); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5501 return true; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5502 } |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5503 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5504 /** |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5505 * Calculate CRC32 for ByteBuffer. |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5506 * 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
|
5507 */ |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5508 bool LibraryCallKit::inline_updateByteBufferCRC32() { |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5509 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
|
5510 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
|
5511 // no receiver since it is static method |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5512 Node* crc = argument(0); // type: int |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5513 Node* src = argument(1); // type: long |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5514 Node* offset = argument(3); // type: int |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5515 Node* length = argument(4); // type: int |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5516 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5517 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
|
5518 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
|
5519 offset = ConvI2X(offset); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5520 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5521 // '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
|
5522 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
|
5523 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5524 // Call the stub. |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5525 address stubAddr = StubRoutines::updateBytesCRC32(); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5526 const char *stubName = "updateBytesCRC32"; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5527 |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5528 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
|
5529 stubAddr, stubName, TypePtr::BOTTOM, |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5530 crc, src_start, length); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5531 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
|
5532 set_result(result); |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5533 return true; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5534 } |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10405
diff
changeset
|
5535 |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5536 //----------------------------inline_reference_get---------------------------- |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5537 // 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
|
5538 bool LibraryCallKit::inline_reference_get() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5539 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
|
5540 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
|
5541 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5542 // Get the argument: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5543 Node* reference_obj = null_check_receiver(); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5544 if (stopped()) return true; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5545 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5546 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
|
5547 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5548 ciInstanceKlass* klass = env()->Object_klass(); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5549 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
|
5550 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5551 Node* no_ctrl = NULL; |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5552 Node* result = make_load(no_ctrl, adr, object_type, T_OBJECT); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5553 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5554 // 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
|
5555 pre_barrier(false /* do_load */, |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5556 control(), |
|
3258
edd9b016deb6
7036021: G1: build failure on win64 and linux with hs21 in jdk6 build environment
johnc
parents:
3255
diff
changeset
|
5557 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
|
5558 result /* pre_val */, |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5559 T_OBJECT); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5560 |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
5561 // 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
|
5562 // 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
|
5563 insert_mem_bar(Op_MemBarCPUOrder); |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
5564 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5565 set_result(result); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5566 return true; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5567 } |
| 6894 | 5568 |
| 5569 | |
| 5570 Node * LibraryCallKit::load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString, | |
| 5571 bool is_exact=true, bool is_static=false) { | |
| 5572 | |
| 5573 const TypeInstPtr* tinst = _gvn.type(fromObj)->isa_instptr(); | |
| 5574 assert(tinst != NULL, "obj is null"); | |
| 5575 assert(tinst->klass()->is_loaded(), "obj is not loaded"); | |
| 5576 assert(!is_exact || tinst->klass_is_exact(), "klass not exact"); | |
| 5577 | |
| 5578 ciField* field = tinst->klass()->as_instance_klass()->get_field_by_name(ciSymbol::make(fieldName), | |
| 5579 ciSymbol::make(fieldTypeString), | |
| 5580 is_static); | |
| 5581 if (field == NULL) return (Node *) NULL; | |
| 5582 assert (field != NULL, "undefined field"); | |
| 5583 | |
| 5584 // Next code copied from Parse::do_get_xxx(): | |
| 5585 | |
| 5586 // Compute address and memory type. | |
| 5587 int offset = field->offset_in_bytes(); | |
| 5588 bool is_vol = field->is_volatile(); | |
| 5589 ciType* field_klass = field->type(); | |
| 5590 assert(field_klass->is_loaded(), "should be loaded"); | |
| 5591 const TypePtr* adr_type = C->alias_type(field)->adr_type(); | |
| 5592 Node *adr = basic_plus_adr(fromObj, fromObj, offset); | |
| 5593 BasicType bt = field->layout_type(); | |
| 5594 | |
| 5595 // Build the resultant type of the load | |
| 5596 const Type *type = TypeOopPtr::make_from_klass(field_klass->as_klass()); | |
| 5597 | |
| 5598 // Build the load. | |
| 5599 Node* loadedField = make_load(NULL, adr, type, bt, adr_type, is_vol); | |
| 5600 return loadedField; | |
| 5601 } | |
| 5602 | |
| 5603 | |
| 5604 //------------------------------inline_aescrypt_Block----------------------- | |
| 5605 bool LibraryCallKit::inline_aescrypt_Block(vmIntrinsics::ID id) { | |
| 5606 address stubAddr; | |
| 5607 const char *stubName; | |
| 5608 assert(UseAES, "need AES instruction support"); | |
| 5609 | |
| 5610 switch(id) { | |
| 5611 case vmIntrinsics::_aescrypt_encryptBlock: | |
| 5612 stubAddr = StubRoutines::aescrypt_encryptBlock(); | |
| 5613 stubName = "aescrypt_encryptBlock"; | |
| 5614 break; | |
| 5615 case vmIntrinsics::_aescrypt_decryptBlock: | |
| 5616 stubAddr = StubRoutines::aescrypt_decryptBlock(); | |
| 5617 stubName = "aescrypt_decryptBlock"; | |
| 5618 break; | |
| 5619 } | |
| 5620 if (stubAddr == NULL) return false; | |
| 5621 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5622 Node* aescrypt_object = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5623 Node* src = argument(1); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5624 Node* src_offset = argument(2); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5625 Node* dest = argument(3); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5626 Node* dest_offset = argument(4); |
| 6894 | 5627 |
| 5628 // (1) src and dest are arrays. | |
| 5629 const Type* src_type = src->Value(&_gvn); | |
| 5630 const Type* dest_type = dest->Value(&_gvn); | |
| 5631 const TypeAryPtr* top_src = src_type->isa_aryptr(); | |
| 5632 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); | |
| 5633 assert (top_src != NULL && top_src->klass() != NULL && top_dest != NULL && top_dest->klass() != NULL, "args are strange"); | |
| 5634 | |
| 5635 // for the quick and dirty code we will skip all the checks. | |
| 5636 // we are just trying to get the call to be generated. | |
| 5637 Node* src_start = src; | |
| 5638 Node* dest_start = dest; | |
| 5639 if (src_offset != NULL || dest_offset != NULL) { | |
| 5640 assert(src_offset != NULL && dest_offset != NULL, ""); | |
| 5641 src_start = array_element_address(src, src_offset, T_BYTE); | |
| 5642 dest_start = array_element_address(dest, dest_offset, T_BYTE); | |
| 5643 } | |
| 5644 | |
| 5645 // now need to get the start of its expanded key array | |
| 5646 // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java | |
| 5647 Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object); | |
| 5648 if (k_start == NULL) return false; | |
| 5649 | |
| 5650 // Call the stub. | |
| 5651 make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::aescrypt_block_Type(), | |
| 5652 stubAddr, stubName, TypePtr::BOTTOM, | |
| 5653 src_start, dest_start, k_start); | |
| 5654 | |
| 5655 return true; | |
| 5656 } | |
| 5657 | |
| 5658 //------------------------------inline_cipherBlockChaining_AESCrypt----------------------- | |
| 5659 bool LibraryCallKit::inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id) { | |
| 5660 address stubAddr; | |
| 5661 const char *stubName; | |
| 5662 | |
| 5663 assert(UseAES, "need AES instruction support"); | |
| 5664 | |
| 5665 switch(id) { | |
| 5666 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
| 5667 stubAddr = StubRoutines::cipherBlockChaining_encryptAESCrypt(); | |
| 5668 stubName = "cipherBlockChaining_encryptAESCrypt"; | |
| 5669 break; | |
| 5670 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
| 5671 stubAddr = StubRoutines::cipherBlockChaining_decryptAESCrypt(); | |
| 5672 stubName = "cipherBlockChaining_decryptAESCrypt"; | |
| 5673 break; | |
| 5674 } | |
| 5675 if (stubAddr == NULL) return false; | |
| 5676 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5677 Node* cipherBlockChaining_object = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5678 Node* src = argument(1); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5679 Node* src_offset = argument(2); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5680 Node* len = argument(3); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5681 Node* dest = argument(4); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5682 Node* dest_offset = argument(5); |
| 6894 | 5683 |
| 5684 // (1) src and dest are arrays. | |
| 5685 const Type* src_type = src->Value(&_gvn); | |
| 5686 const Type* dest_type = dest->Value(&_gvn); | |
| 5687 const TypeAryPtr* top_src = src_type->isa_aryptr(); | |
| 5688 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); | |
| 5689 assert (top_src != NULL && top_src->klass() != NULL | |
| 5690 && top_dest != NULL && top_dest->klass() != NULL, "args are strange"); | |
| 5691 | |
| 5692 // checks are the responsibility of the caller | |
| 5693 Node* src_start = src; | |
| 5694 Node* dest_start = dest; | |
| 5695 if (src_offset != NULL || dest_offset != NULL) { | |
| 5696 assert(src_offset != NULL && dest_offset != NULL, ""); | |
| 5697 src_start = array_element_address(src, src_offset, T_BYTE); | |
| 5698 dest_start = array_element_address(dest, dest_offset, T_BYTE); | |
| 5699 } | |
| 5700 | |
| 5701 // if we are in this set of code, we "know" the embeddedCipher is an AESCrypt object | |
| 5702 // (because of the predicated logic executed earlier). | |
| 5703 // so we cast it here safely. | |
| 5704 // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java | |
| 5705 | |
| 5706 Node* embeddedCipherObj = load_field_from_object(cipherBlockChaining_object, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false); | |
| 5707 if (embeddedCipherObj == NULL) return false; | |
| 5708 | |
| 5709 // cast it to what we know it will be at runtime | |
| 5710 const TypeInstPtr* tinst = _gvn.type(cipherBlockChaining_object)->isa_instptr(); | |
| 5711 assert(tinst != NULL, "CBC obj is null"); | |
| 5712 assert(tinst->klass()->is_loaded(), "CBC obj is not loaded"); | |
| 5713 ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt")); | |
| 5714 if (!klass_AESCrypt->is_loaded()) return false; | |
| 5715 | |
| 5716 ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass(); | |
| 5717 const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_AESCrypt); | |
| 5718 const TypeOopPtr* xtype = aklass->as_instance_type(); | |
| 5719 Node* aescrypt_object = new(C) CheckCastPPNode(control(), embeddedCipherObj, xtype); | |
| 5720 aescrypt_object = _gvn.transform(aescrypt_object); | |
| 5721 | |
| 5722 // we need to get the start of the aescrypt_object's expanded key array | |
| 5723 Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object); | |
| 5724 if (k_start == NULL) return false; | |
| 5725 | |
| 5726 // similarly, get the start address of the r vector | |
| 5727 Node* objRvec = load_field_from_object(cipherBlockChaining_object, "r", "[B", /*is_exact*/ false); | |
| 5728 if (objRvec == NULL) return false; | |
| 5729 Node* r_start = array_element_address(objRvec, intcon(0), T_BYTE); | |
| 5730 | |
| 5731 // Call the stub, passing src_start, dest_start, k_start, r_start and src_len | |
| 5732 make_runtime_call(RC_LEAF|RC_NO_FP, | |
| 5733 OptoRuntime::cipherBlockChaining_aescrypt_Type(), | |
| 5734 stubAddr, stubName, TypePtr::BOTTOM, | |
| 5735 src_start, dest_start, k_start, r_start, len); | |
| 5736 | |
| 5737 // return is void so no result needs to be pushed | |
| 5738 | |
| 5739 return true; | |
| 5740 } | |
| 5741 | |
| 5742 //------------------------------get_key_start_from_aescrypt_object----------------------- | |
| 5743 Node * LibraryCallKit::get_key_start_from_aescrypt_object(Node *aescrypt_object) { | |
| 5744 Node* objAESCryptKey = load_field_from_object(aescrypt_object, "K", "[I", /*is_exact*/ false); | |
| 5745 assert (objAESCryptKey != NULL, "wrong version of com.sun.crypto.provider.AESCrypt"); | |
| 5746 if (objAESCryptKey == NULL) return (Node *) NULL; | |
| 5747 | |
| 5748 // now have the array, need to get the start address of the K array | |
| 5749 Node* k_start = array_element_address(objAESCryptKey, intcon(0), T_INT); | |
| 5750 return k_start; | |
| 5751 } | |
| 5752 | |
| 5753 //----------------------------inline_cipherBlockChaining_AESCrypt_predicate---------------------------- | |
| 5754 // Return node representing slow path of predicate check. | |
| 5755 // the pseudo code we want to emulate with this predicate is: | |
| 5756 // for encryption: | |
| 5757 // if (embeddedCipherObj instanceof AESCrypt) do_intrinsic, else do_javapath | |
| 5758 // for decryption: | |
| 5759 // if ((embeddedCipherObj instanceof AESCrypt) && (cipher!=plain)) do_intrinsic, else do_javapath | |
| 5760 // note cipher==plain is more conservative than the original java code but that's OK | |
| 5761 // | |
| 5762 Node* LibraryCallKit::inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting) { | |
| 5763 // First, check receiver for NULL since it is virtual method. | |
| 5764 Node* objCBC = argument(0); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5765 objCBC = null_check(objCBC); |
| 6894 | 5766 |
| 5767 if (stopped()) return NULL; // Always NULL | |
| 5768 | |
| 5769 // Load embeddedCipher field of CipherBlockChaining object. | |
| 5770 Node* embeddedCipherObj = load_field_from_object(objCBC, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false); | |
| 5771 | |
| 5772 // get AESCrypt klass for instanceOf check | |
| 5773 // AESCrypt might not be loaded yet if some other SymmetricCipher got us to this compile point | |
| 5774 // will have same classloader as CipherBlockChaining object | |
| 5775 const TypeInstPtr* tinst = _gvn.type(objCBC)->isa_instptr(); | |
| 5776 assert(tinst != NULL, "CBCobj is null"); | |
| 5777 assert(tinst->klass()->is_loaded(), "CBCobj is not loaded"); | |
| 5778 | |
| 5779 // we want to do an instanceof comparison against the AESCrypt class | |
| 5780 ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt")); | |
| 5781 if (!klass_AESCrypt->is_loaded()) { | |
| 5782 // if AESCrypt is not even loaded, we never take the intrinsic fast path | |
| 5783 Node* ctrl = control(); | |
| 5784 set_control(top()); // no regular fast path | |
| 5785 return ctrl; | |
| 5786 } | |
| 5787 ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass(); | |
| 5788 | |
| 5789 Node* instof = gen_instanceof(embeddedCipherObj, makecon(TypeKlassPtr::make(instklass_AESCrypt))); | |
| 5790 Node* cmp_instof = _gvn.transform(new (C) CmpINode(instof, intcon(1))); | |
| 5791 Node* bool_instof = _gvn.transform(new (C) BoolNode(cmp_instof, BoolTest::ne)); | |
| 5792 | |
| 5793 Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN); | |
| 5794 | |
| 5795 // for encryption, we are done | |
| 5796 if (!decrypting) | |
| 5797 return instof_false; // even if it is NULL | |
| 5798 | |
| 5799 // for decryption, we need to add a further check to avoid | |
| 5800 // taking the intrinsic path when cipher and plain are the same | |
| 5801 // see the original java code for why. | |
| 5802 RegionNode* region = new(C) RegionNode(3); | |
| 5803 region->init_req(1, instof_false); | |
| 5804 Node* src = argument(1); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5805 Node* dest = argument(4); |
| 6894 | 5806 Node* cmp_src_dest = _gvn.transform(new (C) CmpPNode(src, dest)); |
| 5807 Node* bool_src_dest = _gvn.transform(new (C) BoolNode(cmp_src_dest, BoolTest::eq)); | |
| 5808 Node* src_dest_conjoint = generate_guard(bool_src_dest, NULL, PROB_MIN); | |
| 5809 region->init_req(2, src_dest_conjoint); | |
| 5810 | |
| 5811 record_for_igvn(region); | |
| 5812 return _gvn.transform(region); | |
| 5813 } |