Mercurial > hg > truffle
annotate src/share/vm/opto/library_call.cpp @ 7194:beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
Reviewed-by: kvn, jrose
| author | twisti |
|---|---|
| date | Mon, 26 Nov 2012 17:25:11 -0800 |
| parents | a3ecd773a7b9 |
| children | dd38cfd12c3a |
| rev | line source |
|---|---|
| 0 | 1 /* |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2 * Copyright (c) 1999, 2012, 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" | |
| 0 | 41 |
| 42 class LibraryIntrinsic : public InlineCallGenerator { | |
| 43 // Extend the set of intrinsics known to the runtime: | |
| 44 public: | |
| 45 private: | |
| 46 bool _is_virtual; | |
| 6894 | 47 bool _is_predicted; |
| 0 | 48 vmIntrinsics::ID _intrinsic_id; |
| 49 | |
| 50 public: | |
| 6894 | 51 LibraryIntrinsic(ciMethod* m, bool is_virtual, bool is_predicted, vmIntrinsics::ID id) |
| 0 | 52 : InlineCallGenerator(m), |
| 53 _is_virtual(is_virtual), | |
| 6894 | 54 _is_predicted(is_predicted), |
| 0 | 55 _intrinsic_id(id) |
| 56 { | |
| 57 } | |
| 58 virtual bool is_intrinsic() const { return true; } | |
| 59 virtual bool is_virtual() const { return _is_virtual; } | |
| 6894 | 60 virtual bool is_predicted() const { return _is_predicted; } |
| 0 | 61 virtual JVMState* generate(JVMState* jvms); |
| 6894 | 62 virtual Node* generate_predicate(JVMState* jvms); |
| 0 | 63 vmIntrinsics::ID intrinsic_id() const { return _intrinsic_id; } |
| 64 }; | |
| 65 | |
| 66 | |
| 67 // Local helper class for LibraryIntrinsic: | |
| 68 class LibraryCallKit : public GraphKit { | |
| 69 private: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
70 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
|
71 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
|
72 int _reexecute_sp; // the stack pointer when bytecode needs to be reexecuted |
| 0 | 73 |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
74 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
|
75 |
| 0 | 76 public: |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
77 LibraryCallKit(JVMState* jvms, LibraryIntrinsic* intrinsic) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
78 : GraphKit(jvms), |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
79 _intrinsic(intrinsic), |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
80 _result(NULL) |
| 0 | 81 { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
82 // Find out how many arguments the interpreter needs when deoptimizing |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
83 // and save the stack pointer value so it can used by uncommon_trap. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
84 // We find the argument count by looking at the declared signature. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
85 bool ignored_will_link; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
86 ciSignature* declared_signature = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
87 ciMethod* ignored_callee = caller()->get_method_at_bci(bci(), ignored_will_link, &declared_signature); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
88 const int nargs = declared_signature->arg_size_for_bc(caller()->java_code_at_bci(bci())); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
89 _reexecute_sp = sp() + nargs; // "push" arguments back on stack |
| 0 | 90 } |
| 91 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
92 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
|
93 |
| 0 | 94 ciMethod* caller() const { return jvms()->method(); } |
| 95 int bci() const { return jvms()->bci(); } | |
| 96 LibraryIntrinsic* intrinsic() const { return _intrinsic; } | |
| 97 vmIntrinsics::ID intrinsic_id() const { return _intrinsic->intrinsic_id(); } | |
| 98 ciMethod* callee() const { return _intrinsic->method(); } | |
| 99 | |
| 100 bool try_to_inline(); | |
| 6894 | 101 Node* try_to_predicate(); |
| 0 | 102 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
103 void push_result() { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
104 // Push the result onto the stack. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
105 if (!stopped() && result() != NULL) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
106 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
|
107 push_node(bt, result()); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
108 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
109 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
110 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
111 private: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
112 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
|
113 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
|
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 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
|
117 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
|
118 Node* result() { return _result; } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
119 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
120 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
|
121 |
| 0 | 122 // Helper functions to inline natives |
| 123 Node* generate_guard(Node* test, RegionNode* region, float true_prob); | |
| 124 Node* generate_slow_guard(Node* test, RegionNode* region); | |
| 125 Node* generate_fair_guard(Node* test, RegionNode* region); | |
| 126 Node* generate_negative_guard(Node* index, RegionNode* region, | |
| 127 // resulting CastII of index: | |
| 128 Node* *pos_index = NULL); | |
| 129 Node* generate_nonpositive_guard(Node* index, bool never_negative, | |
| 130 // resulting CastII of index: | |
| 131 Node* *pos_index = NULL); | |
| 132 Node* generate_limit_guard(Node* offset, Node* subseq_length, | |
| 133 Node* array_length, | |
| 134 RegionNode* region); | |
| 135 Node* generate_current_thread(Node* &tls_output); | |
| 136 address basictype2arraycopy(BasicType t, Node *src_offset, Node *dest_offset, | |
| 2324 | 137 bool disjoint_bases, const char* &name, bool dest_uninitialized); |
| 0 | 138 Node* load_mirror_from_klass(Node* klass); |
| 139 Node* load_klass_from_mirror_common(Node* mirror, bool never_see_null, | |
| 140 RegionNode* region, int null_path, | |
| 141 int offset); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
142 Node* load_klass_from_mirror(Node* mirror, bool never_see_null, |
| 0 | 143 RegionNode* region, int null_path) { |
| 144 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
|
145 return load_klass_from_mirror_common(mirror, never_see_null, |
| 0 | 146 region, null_path, |
| 147 offset); | |
| 148 } | |
| 149 Node* load_array_klass_from_mirror(Node* mirror, bool never_see_null, | |
| 150 RegionNode* region, int null_path) { | |
| 151 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
|
152 return load_klass_from_mirror_common(mirror, never_see_null, |
| 0 | 153 region, null_path, |
| 154 offset); | |
| 155 } | |
| 156 Node* generate_access_flags_guard(Node* kls, | |
| 157 int modifier_mask, int modifier_bits, | |
| 158 RegionNode* region); | |
| 159 Node* generate_interface_guard(Node* kls, RegionNode* region); | |
| 160 Node* generate_array_guard(Node* kls, RegionNode* region) { | |
| 161 return generate_array_guard_common(kls, region, false, false); | |
| 162 } | |
| 163 Node* generate_non_array_guard(Node* kls, RegionNode* region) { | |
| 164 return generate_array_guard_common(kls, region, false, true); | |
| 165 } | |
| 166 Node* generate_objArray_guard(Node* kls, RegionNode* region) { | |
| 167 return generate_array_guard_common(kls, region, true, false); | |
| 168 } | |
| 169 Node* generate_non_objArray_guard(Node* kls, RegionNode* region) { | |
| 170 return generate_array_guard_common(kls, region, true, true); | |
| 171 } | |
| 172 Node* generate_array_guard_common(Node* kls, RegionNode* region, | |
| 173 bool obj_array, bool not_array); | |
| 174 Node* generate_virtual_guard(Node* obj_klass, RegionNode* slow_region); | |
| 175 CallJavaNode* generate_method_call(vmIntrinsics::ID method_id, | |
| 176 bool is_virtual = false, bool is_static = false); | |
| 177 CallJavaNode* generate_method_call_static(vmIntrinsics::ID method_id) { | |
| 178 return generate_method_call(method_id, false, true); | |
| 179 } | |
| 180 CallJavaNode* generate_method_call_virtual(vmIntrinsics::ID method_id) { | |
| 181 return generate_method_call(method_id, true, false); | |
| 182 } | |
| 6894 | 183 Node * load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString, bool is_exact, bool is_static); |
| 0 | 184 |
| 6057 | 185 Node* make_string_method_node(int opcode, Node* str1_start, Node* cnt1, Node* str2_start, Node* cnt2); |
| 186 Node* make_string_method_node(int opcode, Node* str1, Node* str2); | |
| 0 | 187 bool inline_string_compareTo(); |
| 188 bool inline_string_indexOf(); | |
| 189 Node* string_indexOf(Node* string_object, ciTypeArray* target_array, jint offset, jint cache_i, jint md2_i); | |
| 681 | 190 bool inline_string_equals(); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
191 Node* round_double_node(Node* n); |
| 0 | 192 bool runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName); |
| 193 bool inline_math_native(vmIntrinsics::ID id); | |
| 194 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
|
195 bool inline_math(vmIntrinsics::ID id); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
196 bool inline_exp(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
197 bool inline_pow(); |
| 6205 | 198 void finish_pow_exp(Node* result, Node* x, Node* y, const TypeFunc* call_type, address funcAddr, const char* funcName); |
| 0 | 199 bool inline_min_max(vmIntrinsics::ID id); |
| 200 Node* generate_min_max(vmIntrinsics::ID id, Node* x, Node* y); | |
| 201 // This returns Type::AnyPtr, RawPtr, or OopPtr. | |
| 202 int classify_unsafe_addr(Node* &base, Node* &offset); | |
| 203 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
|
204 // Helper for inline_unsafe_access. |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
205 // 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
|
206 // 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
|
207 void insert_pre_barrier(Node* base_oop, Node* offset, Node* pre_val, bool need_mem_bar); |
| 0 | 208 bool inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile); |
| 209 bool inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static); | |
| 210 bool inline_unsafe_allocate(); | |
| 211 bool inline_unsafe_copyMemory(); | |
| 212 bool inline_native_currentThread(); | |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
213 #ifdef TRACE_HAVE_INTRINSICS |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
214 bool inline_native_classID(); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
215 bool inline_native_threadID(); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
216 #endif |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
217 bool inline_native_time_funcs(address method, const char* funcName); |
| 0 | 218 bool inline_native_isInterrupted(); |
| 219 bool inline_native_Class_query(vmIntrinsics::ID id); | |
| 220 bool inline_native_subtype_check(); | |
| 221 | |
| 222 bool inline_native_newArray(); | |
| 223 bool inline_native_getLength(); | |
| 224 bool inline_array_copyOf(bool is_copyOfRange); | |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
225 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
|
226 void copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array, bool card_mark); |
| 0 | 227 bool inline_native_clone(bool is_virtual); |
| 228 bool inline_native_Reflection_getCallerClass(); | |
| 229 bool is_method_invoke_or_aux_frame(JVMState* jvms); | |
| 230 // Helper function for inlining native object hash method | |
| 231 bool inline_native_hashcode(bool is_virtual, bool is_static); | |
| 232 bool inline_native_getClass(); | |
| 233 | |
| 234 // Helper functions for inlining arraycopy | |
| 235 bool inline_arraycopy(); | |
| 236 void generate_arraycopy(const TypePtr* adr_type, | |
| 237 BasicType basic_elem_type, | |
| 238 Node* src, Node* src_offset, | |
| 239 Node* dest, Node* dest_offset, | |
| 240 Node* copy_length, | |
| 241 bool disjoint_bases = false, | |
| 242 bool length_never_negative = false, | |
| 243 RegionNode* slow_region = NULL); | |
| 244 AllocateArrayNode* tightly_coupled_allocation(Node* ptr, | |
| 245 RegionNode* slow_region); | |
| 246 void generate_clear_array(const TypePtr* adr_type, | |
| 247 Node* dest, | |
| 248 BasicType basic_elem_type, | |
| 249 Node* slice_off, | |
| 250 Node* slice_len, | |
| 251 Node* slice_end); | |
| 252 bool generate_block_arraycopy(const TypePtr* adr_type, | |
| 253 BasicType basic_elem_type, | |
| 254 AllocateNode* alloc, | |
| 255 Node* src, Node* src_offset, | |
| 256 Node* dest, Node* dest_offset, | |
| 2324 | 257 Node* dest_size, bool dest_uninitialized); |
| 0 | 258 void generate_slow_arraycopy(const TypePtr* adr_type, |
| 259 Node* src, Node* src_offset, | |
| 260 Node* dest, Node* dest_offset, | |
| 2324 | 261 Node* copy_length, bool dest_uninitialized); |
| 0 | 262 Node* generate_checkcast_arraycopy(const TypePtr* adr_type, |
| 263 Node* dest_elem_klass, | |
| 264 Node* src, Node* src_offset, | |
| 265 Node* dest, Node* dest_offset, | |
| 2324 | 266 Node* copy_length, bool dest_uninitialized); |
| 0 | 267 Node* generate_generic_arraycopy(const TypePtr* adr_type, |
| 268 Node* src, Node* src_offset, | |
| 269 Node* dest, Node* dest_offset, | |
| 2324 | 270 Node* copy_length, bool dest_uninitialized); |
| 0 | 271 void generate_unchecked_arraycopy(const TypePtr* adr_type, |
| 272 BasicType basic_elem_type, | |
| 273 bool disjoint_bases, | |
| 274 Node* src, Node* src_offset, | |
| 275 Node* dest, Node* dest_offset, | |
| 2324 | 276 Node* copy_length, bool dest_uninitialized); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
277 typedef enum { LS_xadd, LS_xchg, LS_cmpxchg } LoadStoreKind; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
278 bool inline_unsafe_load_store(BasicType type, LoadStoreKind kind); |
| 0 | 279 bool inline_unsafe_ordered_store(BasicType type); |
| 280 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
|
281 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
|
282 bool inline_reference_get(); |
| 6894 | 283 bool inline_aescrypt_Block(vmIntrinsics::ID id); |
| 284 bool inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id); | |
| 285 Node* inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting); | |
| 286 Node* get_key_start_from_aescrypt_object(Node* aescrypt_object); | |
| 0 | 287 }; |
| 288 | |
| 289 | |
| 290 //---------------------------make_vm_intrinsic---------------------------- | |
| 291 CallGenerator* Compile::make_vm_intrinsic(ciMethod* m, bool is_virtual) { | |
| 292 vmIntrinsics::ID id = m->intrinsic_id(); | |
| 293 assert(id != vmIntrinsics::_none, "must be a VM intrinsic"); | |
| 294 | |
| 295 if (DisableIntrinsic[0] != '\0' | |
| 296 && strstr(DisableIntrinsic, vmIntrinsics::name_at(id)) != NULL) { | |
| 297 // disabled by a user request on the command line: | |
| 298 // example: -XX:DisableIntrinsic=_hashCode,_getClass | |
| 299 return NULL; | |
| 300 } | |
| 301 | |
| 302 if (!m->is_loaded()) { | |
| 303 // do not attempt to inline unloaded methods | |
| 304 return NULL; | |
| 305 } | |
| 306 | |
| 307 // Only a few intrinsics implement a virtual dispatch. | |
| 308 // They are expensive calls which are also frequently overridden. | |
| 309 if (is_virtual) { | |
| 310 switch (id) { | |
| 311 case vmIntrinsics::_hashCode: | |
| 312 case vmIntrinsics::_clone: | |
| 313 // OK, Object.hashCode and Object.clone intrinsics come in both flavors | |
| 314 break; | |
| 315 default: | |
| 316 return NULL; | |
| 317 } | |
| 318 } | |
| 319 | |
| 320 // -XX:-InlineNatives disables nearly all intrinsics: | |
| 321 if (!InlineNatives) { | |
| 322 switch (id) { | |
| 323 case vmIntrinsics::_indexOf: | |
| 324 case vmIntrinsics::_compareTo: | |
| 681 | 325 case vmIntrinsics::_equals: |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
326 case vmIntrinsics::_equalsC: |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
327 case vmIntrinsics::_getAndAddInt: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
328 case vmIntrinsics::_getAndAddLong: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
329 case vmIntrinsics::_getAndSetInt: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
330 case vmIntrinsics::_getAndSetLong: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
331 case vmIntrinsics::_getAndSetObject: |
| 0 | 332 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
|
333 case vmIntrinsics::_Reference_get: |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
334 break; // InlineNatives does not control Reference.get |
| 0 | 335 default: |
| 336 return NULL; | |
| 337 } | |
| 338 } | |
| 339 | |
| 6894 | 340 bool is_predicted = false; |
| 341 | |
| 0 | 342 switch (id) { |
| 343 case vmIntrinsics::_compareTo: | |
| 344 if (!SpecialStringCompareTo) return NULL; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
345 if (!Matcher::match_rule_supported(Op_StrComp)) return NULL; |
| 0 | 346 break; |
| 347 case vmIntrinsics::_indexOf: | |
| 348 if (!SpecialStringIndexOf) return NULL; | |
| 349 break; | |
| 681 | 350 case vmIntrinsics::_equals: |
| 351 if (!SpecialStringEquals) return NULL; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
352 if (!Matcher::match_rule_supported(Op_StrEquals)) return NULL; |
| 681 | 353 break; |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
354 case vmIntrinsics::_equalsC: |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
355 if (!SpecialArraysEquals) return NULL; |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
356 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
|
357 break; |
| 0 | 358 case vmIntrinsics::_arraycopy: |
| 359 if (!InlineArrayCopy) return NULL; | |
| 360 break; | |
| 361 case vmIntrinsics::_copyMemory: | |
| 362 if (StubRoutines::unsafe_arraycopy() == NULL) return NULL; | |
| 363 if (!InlineArrayCopy) return NULL; | |
| 364 break; | |
| 365 case vmIntrinsics::_hashCode: | |
| 366 if (!InlineObjectHash) return NULL; | |
| 367 break; | |
| 368 case vmIntrinsics::_clone: | |
| 369 case vmIntrinsics::_copyOf: | |
| 370 case vmIntrinsics::_copyOfRange: | |
| 371 if (!InlineObjectCopy) return NULL; | |
| 372 // These also use the arraycopy intrinsic mechanism: | |
| 373 if (!InlineArrayCopy) return NULL; | |
| 374 break; | |
| 375 case vmIntrinsics::_checkIndex: | |
| 376 // We do not intrinsify this. The optimizer does fine with it. | |
| 377 return NULL; | |
| 378 | |
| 379 case vmIntrinsics::_getCallerClass: | |
| 380 if (!UseNewReflection) return NULL; | |
| 381 if (!InlineReflectionGetCallerClass) return NULL; | |
| 382 if (!JDK_Version::is_gte_jdk14x_version()) return NULL; | |
| 383 break; | |
| 384 | |
|
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
385 case vmIntrinsics::_bitCount_i: |
|
5934
61b82be3b1ff
7152957: VM crashes with assert(false) failed: bad AD file
never
parents:
5927
diff
changeset
|
386 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
|
387 break; |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
388 |
|
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
389 case vmIntrinsics::_bitCount_l: |
|
5934
61b82be3b1ff
7152957: VM crashes with assert(false) failed: bad AD file
never
parents:
5927
diff
changeset
|
390 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
|
391 break; |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
392 |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
393 case vmIntrinsics::_numberOfLeadingZeros_i: |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
394 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
|
395 break; |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
396 |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
397 case vmIntrinsics::_numberOfLeadingZeros_l: |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
398 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
|
399 break; |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
400 |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
401 case vmIntrinsics::_numberOfTrailingZeros_i: |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
402 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
|
403 break; |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
404 |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
405 case vmIntrinsics::_numberOfTrailingZeros_l: |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
406 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
|
407 break; |
|
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
408 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
409 case vmIntrinsics::_reverseBytes_c: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
410 if (!Matcher::match_rule_supported(Op_ReverseBytesUS)) return false; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
411 break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
412 case vmIntrinsics::_reverseBytes_s: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
413 if (!Matcher::match_rule_supported(Op_ReverseBytesS)) return false; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
414 break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
415 case vmIntrinsics::_reverseBytes_i: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
416 if (!Matcher::match_rule_supported(Op_ReverseBytesI)) return false; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
417 break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
418 case vmIntrinsics::_reverseBytes_l: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
419 if (!Matcher::match_rule_supported(Op_ReverseBytesL)) return false; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
420 break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
421 |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
422 case vmIntrinsics::_Reference_get: |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
423 // 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
|
424 // 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
|
425 // 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
|
426 // 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
|
427 break; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
428 |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
429 case vmIntrinsics::_compareAndSwapObject: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
430 #ifdef _LP64 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
431 if (!UseCompressedOops && !Matcher::match_rule_supported(Op_CompareAndSwapP)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
432 #endif |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
433 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
434 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
435 case vmIntrinsics::_compareAndSwapLong: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
436 if (!Matcher::match_rule_supported(Op_CompareAndSwapL)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
437 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
438 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
439 case vmIntrinsics::_getAndAddInt: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
440 if (!Matcher::match_rule_supported(Op_GetAndAddI)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
441 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
442 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
443 case vmIntrinsics::_getAndAddLong: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
444 if (!Matcher::match_rule_supported(Op_GetAndAddL)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
445 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
446 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
447 case vmIntrinsics::_getAndSetInt: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
448 if (!Matcher::match_rule_supported(Op_GetAndSetI)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
449 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
450 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
451 case vmIntrinsics::_getAndSetLong: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
452 if (!Matcher::match_rule_supported(Op_GetAndSetL)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
453 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
454 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
455 case vmIntrinsics::_getAndSetObject: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
456 #ifdef _LP64 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
457 if (!UseCompressedOops && !Matcher::match_rule_supported(Op_GetAndSetP)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
458 if (UseCompressedOops && !Matcher::match_rule_supported(Op_GetAndSetN)) 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 #else |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
461 if (!Matcher::match_rule_supported(Op_GetAndSetP)) return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
462 break; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
463 #endif |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
464 |
| 6894 | 465 case vmIntrinsics::_aescrypt_encryptBlock: |
| 466 case vmIntrinsics::_aescrypt_decryptBlock: | |
| 467 if (!UseAESIntrinsics) return NULL; | |
| 468 break; | |
| 469 | |
| 470 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
| 471 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
| 472 if (!UseAESIntrinsics) return NULL; | |
| 473 // these two require the predicated logic | |
| 474 is_predicted = true; | |
| 475 break; | |
| 476 | |
| 0 | 477 default: |
|
856
75596850f863
6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents:
851
diff
changeset
|
478 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
|
479 assert(id != vmIntrinsics::_Object_init && id != vmIntrinsics::_invoke, "enum out of order?"); |
| 0 | 480 break; |
| 481 } | |
| 482 | |
| 483 // -XX:-InlineClassNatives disables natives from the Class class. | |
| 484 // The flag applies to all reflective calls, notably Array.newArray | |
| 485 // (visible to Java programmers as Array.newInstance). | |
| 486 if (m->holder()->name() == ciSymbol::java_lang_Class() || | |
| 487 m->holder()->name() == ciSymbol::java_lang_reflect_Array()) { | |
| 488 if (!InlineClassNatives) return NULL; | |
| 489 } | |
| 490 | |
| 491 // -XX:-InlineThreadNatives disables natives from the Thread class. | |
| 492 if (m->holder()->name() == ciSymbol::java_lang_Thread()) { | |
| 493 if (!InlineThreadNatives) return NULL; | |
| 494 } | |
| 495 | |
| 496 // -XX:-InlineMathNatives disables natives from the Math,Float and Double classes. | |
| 497 if (m->holder()->name() == ciSymbol::java_lang_Math() || | |
| 498 m->holder()->name() == ciSymbol::java_lang_Float() || | |
| 499 m->holder()->name() == ciSymbol::java_lang_Double()) { | |
| 500 if (!InlineMathNatives) return NULL; | |
| 501 } | |
| 502 | |
| 503 // -XX:-InlineUnsafeOps disables natives from the Unsafe class. | |
| 504 if (m->holder()->name() == ciSymbol::sun_misc_Unsafe()) { | |
| 505 if (!InlineUnsafeOps) return NULL; | |
| 506 } | |
| 507 | |
| 6894 | 508 return new LibraryIntrinsic(m, is_virtual, is_predicted, (vmIntrinsics::ID) id); |
| 0 | 509 } |
| 510 | |
| 511 //----------------------register_library_intrinsics----------------------- | |
| 512 // Initialize this file's data structures, for each Compile instance. | |
| 513 void Compile::register_library_intrinsics() { | |
| 514 // Nothing to do here. | |
| 515 } | |
| 516 | |
| 517 JVMState* LibraryIntrinsic::generate(JVMState* jvms) { | |
| 518 LibraryCallKit kit(jvms, this); | |
| 519 Compile* C = kit.C; | |
| 520 int nodes = C->unique(); | |
| 521 #ifndef PRODUCT | |
| 522 if ((PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) && Verbose) { | |
| 523 char buf[1000]; | |
| 524 const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf)); | |
| 525 tty->print_cr("Intrinsic %s", str); | |
| 526 } | |
| 527 #endif | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
528 ciMethod* callee = kit.callee(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
529 const int bci = kit.bci(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
530 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
531 // Try to inline the intrinsic. |
| 0 | 532 if (kit.try_to_inline()) { |
| 533 if (PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
534 CompileTask::print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual)" : "(intrinsic)"); |
| 0 | 535 } |
| 536 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked); | |
| 537 if (C->log()) { | |
| 538 C->log()->elem("intrinsic id='%s'%s nodes='%d'", | |
| 539 vmIntrinsics::name_at(intrinsic_id()), | |
| 540 (is_virtual() ? " virtual='1'" : ""), | |
| 541 C->unique() - nodes); | |
| 542 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
543 // 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
|
544 kit.push_result(); |
| 0 | 545 return kit.transfer_exceptions_into_jvms(); |
| 546 } | |
| 547 | |
|
5927
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
548 // The intrinsic bailed out |
|
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
549 if (PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) { |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
550 if (jvms->has_method()) { |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
551 // Not a root compile. |
|
5927
b40ac3579043
6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline.
never
parents:
4902
diff
changeset
|
552 const char* msg = is_virtual() ? "failed to inline (intrinsic, virtual)" : "failed to inline (intrinsic)"; |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
553 CompileTask::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
|
554 } else { |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
555 // Root compile |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
556 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
|
557 vmIntrinsics::name_at(intrinsic_id()), |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
558 (is_virtual() ? " (virtual)" : ""), bci); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
559 } |
| 0 | 560 } |
| 561 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed); | |
| 562 return NULL; | |
| 563 } | |
| 564 | |
| 6894 | 565 Node* LibraryIntrinsic::generate_predicate(JVMState* jvms) { |
| 566 LibraryCallKit kit(jvms, this); | |
| 567 Compile* C = kit.C; | |
| 568 int nodes = C->unique(); | |
| 569 #ifndef PRODUCT | |
| 570 assert(is_predicted(), "sanity"); | |
| 571 if ((PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) && Verbose) { | |
| 572 char buf[1000]; | |
| 573 const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf)); | |
| 574 tty->print_cr("Predicate for intrinsic %s", str); | |
| 575 } | |
| 576 #endif | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
577 ciMethod* callee = kit.callee(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
578 const int bci = kit.bci(); |
| 6894 | 579 |
| 580 Node* slow_ctl = kit.try_to_predicate(); | |
| 581 if (!kit.failing()) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
582 if (PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
583 CompileTask::print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual)" : "(intrinsic)"); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
584 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
585 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked); |
| 6894 | 586 if (C->log()) { |
| 587 C->log()->elem("predicate_intrinsic id='%s'%s nodes='%d'", | |
| 588 vmIntrinsics::name_at(intrinsic_id()), | |
| 589 (is_virtual() ? " virtual='1'" : ""), | |
| 590 C->unique() - nodes); | |
| 591 } | |
| 592 return slow_ctl; // Could be NULL if the check folds. | |
| 593 } | |
| 594 | |
| 595 // The intrinsic bailed out | |
| 596 if (PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) { | |
| 597 if (jvms->has_method()) { | |
| 598 // Not a root compile. | |
| 599 const char* msg = "failed to generate predicate for intrinsic"; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
600 CompileTask::print_inlining(kit.callee(), jvms->depth() - 1, bci, msg); |
| 6894 | 601 } else { |
| 602 // Root compile | |
| 603 tty->print("Did not generate predicate for intrinsic %s%s at bci:%d in", | |
| 604 vmIntrinsics::name_at(intrinsic_id()), | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
605 (is_virtual() ? " (virtual)" : ""), bci); |
| 6894 | 606 } |
| 607 } | |
| 608 C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed); | |
| 609 return NULL; | |
| 610 } | |
| 611 | |
| 0 | 612 bool LibraryCallKit::try_to_inline() { |
| 613 // Handle symbolic names for otherwise undistinguished boolean switches: | |
| 614 const bool is_store = true; | |
| 615 const bool is_native_ptr = true; | |
| 616 const bool is_static = true; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
617 const bool is_volatile = true; |
| 0 | 618 |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
619 if (!jvms()->has_method()) { |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
620 // Root JVMState has a null method. |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
621 assert(map()->memory()->Opcode() == Op_Parm, ""); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
622 // Insert the memory aliasing node |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
623 set_all_memory(reset_memory()); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
624 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
625 assert(merged_memory(), ""); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
626 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
627 |
| 0 | 628 switch (intrinsic_id()) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
629 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
|
630 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
|
631 case vmIntrinsics::_getClass: return inline_native_getClass(); |
| 0 | 632 |
| 633 case vmIntrinsics::_dsin: | |
| 634 case vmIntrinsics::_dcos: | |
| 635 case vmIntrinsics::_dtan: | |
| 636 case vmIntrinsics::_dabs: | |
| 637 case vmIntrinsics::_datan2: | |
| 638 case vmIntrinsics::_dsqrt: | |
| 639 case vmIntrinsics::_dexp: | |
| 640 case vmIntrinsics::_dlog: | |
| 641 case vmIntrinsics::_dlog10: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
642 case vmIntrinsics::_dpow: return inline_math_native(intrinsic_id()); |
| 0 | 643 |
| 644 case vmIntrinsics::_min: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
645 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
|
646 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
647 case vmIntrinsics::_arraycopy: return inline_arraycopy(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
648 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
649 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
|
650 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
|
651 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
|
652 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
653 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
|
654 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
|
655 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
|
656 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
|
657 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
|
658 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
|
659 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
|
660 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
|
661 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
|
662 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
663 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
|
664 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
|
665 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
|
666 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
|
667 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
|
668 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
|
669 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
|
670 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
|
671 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
|
672 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
673 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
|
674 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
|
675 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
|
676 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
|
677 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
|
678 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
|
679 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
|
680 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
|
681 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
682 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
|
683 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
|
684 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
|
685 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
|
686 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
|
687 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
|
688 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
|
689 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
|
690 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
691 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
|
692 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
|
693 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
|
694 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
|
695 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
|
696 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
|
697 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
|
698 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
|
699 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
|
700 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
701 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
|
702 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
|
703 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
|
704 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
|
705 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
|
706 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
|
707 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
|
708 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
|
709 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
|
710 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
711 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
|
712 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
|
713 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
|
714 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
|
715 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
716 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
|
717 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
|
718 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
|
719 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
720 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
|
721 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
|
722 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
|
723 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
724 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
|
725 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
|
726 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
|
727 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
|
728 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
|
729 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
730 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
|
731 case vmIntrinsics::_isInterrupted: return inline_native_isInterrupted(); |
| 0 | 732 |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
733 #ifdef TRACE_HAVE_INTRINSICS |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
734 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
|
735 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
|
736 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
|
737 #endif |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
738 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
|
739 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
|
740 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
|
741 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
|
742 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
|
743 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
|
744 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
|
745 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
|
746 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
|
747 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
|
748 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
749 case vmIntrinsics::_isAssignableFrom: return inline_native_subtype_check(); |
| 0 | 750 |
| 751 case vmIntrinsics::_isInstance: | |
| 752 case vmIntrinsics::_getModifiers: | |
| 753 case vmIntrinsics::_isInterface: | |
| 754 case vmIntrinsics::_isArray: | |
| 755 case vmIntrinsics::_isPrimitive: | |
| 756 case vmIntrinsics::_getSuperclass: | |
| 757 case vmIntrinsics::_getComponentType: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
758 case vmIntrinsics::_getClassAccessFlags: return inline_native_Class_query(intrinsic_id()); |
| 0 | 759 |
| 760 case vmIntrinsics::_floatToRawIntBits: | |
| 761 case vmIntrinsics::_floatToIntBits: | |
| 762 case vmIntrinsics::_intBitsToFloat: | |
| 763 case vmIntrinsics::_doubleToRawLongBits: | |
| 764 case vmIntrinsics::_doubleToLongBits: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
765 case vmIntrinsics::_longBitsToDouble: return inline_fp_conversions(intrinsic_id()); |
| 0 | 766 |
|
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
767 case vmIntrinsics::_numberOfLeadingZeros_i: |
|
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
768 case vmIntrinsics::_numberOfLeadingZeros_l: |
|
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
769 case vmIntrinsics::_numberOfTrailingZeros_i: |
|
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
770 case vmIntrinsics::_numberOfTrailingZeros_l: |
|
643
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
771 case vmIntrinsics::_bitCount_i: |
|
c771b7f43bbf
6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents:
605
diff
changeset
|
772 case vmIntrinsics::_bitCount_l: |
| 0 | 773 case vmIntrinsics::_reverseBytes_i: |
| 774 case vmIntrinsics::_reverseBytes_l: | |
|
1396
d7f654633cfe
6946040: add intrinsic for short and char reverseBytes
never
parents:
1152
diff
changeset
|
775 case vmIntrinsics::_reverseBytes_s: |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
776 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
|
777 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
778 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
|
779 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
780 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
|
781 |
| 6894 | 782 case vmIntrinsics::_aescrypt_encryptBlock: |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
783 case vmIntrinsics::_aescrypt_decryptBlock: return inline_aescrypt_Block(intrinsic_id()); |
| 6894 | 784 |
| 785 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
| 786 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
| 787 return inline_cipherBlockChaining_AESCrypt(intrinsic_id()); | |
| 788 | |
| 0 | 789 default: |
| 790 // If you get here, it may be that someone has added a new intrinsic | |
| 791 // to the list in vmSymbols.hpp without implementing it here. | |
| 792 #ifndef PRODUCT | |
| 793 if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) { | |
| 794 tty->print_cr("*** Warning: Unimplemented intrinsic %s(%d)", | |
| 795 vmIntrinsics::name_at(intrinsic_id()), intrinsic_id()); | |
| 796 } | |
| 797 #endif | |
| 798 return false; | |
| 799 } | |
| 800 } | |
| 801 | |
| 6894 | 802 Node* LibraryCallKit::try_to_predicate() { |
| 803 if (!jvms()->has_method()) { | |
| 804 // Root JVMState has a null method. | |
| 805 assert(map()->memory()->Opcode() == Op_Parm, ""); | |
| 806 // Insert the memory aliasing node | |
| 807 set_all_memory(reset_memory()); | |
| 808 } | |
| 809 assert(merged_memory(), ""); | |
| 810 | |
| 811 switch (intrinsic_id()) { | |
| 812 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
| 813 return inline_cipherBlockChaining_AESCrypt_predicate(false); | |
| 814 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
| 815 return inline_cipherBlockChaining_AESCrypt_predicate(true); | |
| 816 | |
| 817 default: | |
| 818 // If you get here, it may be that someone has added a new intrinsic | |
| 819 // to the list in vmSymbols.hpp without implementing it here. | |
| 820 #ifndef PRODUCT | |
| 821 if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) { | |
| 822 tty->print_cr("*** Warning: Unimplemented predicate for intrinsic %s(%d)", | |
| 823 vmIntrinsics::name_at(intrinsic_id()), intrinsic_id()); | |
| 824 } | |
| 825 #endif | |
| 826 Node* slow_ctl = control(); | |
| 827 set_control(top()); // No fast path instrinsic | |
| 828 return slow_ctl; | |
| 829 } | |
| 830 } | |
| 831 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
832 //------------------------------set_result------------------------------- |
| 0 | 833 // Helper function for finishing intrinsics. |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
834 void LibraryCallKit::set_result(RegionNode* region, PhiNode* value) { |
| 0 | 835 record_for_igvn(region); |
| 836 set_control(_gvn.transform(region)); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
837 set_result( _gvn.transform(value)); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
838 assert(value->type()->basic_type() == result()->bottom_type()->basic_type(), "sanity"); |
| 0 | 839 } |
| 840 | |
| 841 //------------------------------generate_guard--------------------------- | |
| 842 // Helper function for generating guarded fast-slow graph structures. | |
| 843 // The given 'test', if true, guards a slow path. If the test fails | |
| 844 // then a fast path can be taken. (We generally hope it fails.) | |
| 845 // In all cases, GraphKit::control() is updated to the fast path. | |
| 846 // The returned value represents the control for the slow path. | |
| 847 // The return value is never 'top'; it is either a valid control | |
| 848 // or NULL if it is obvious that the slow path can never be taken. | |
| 849 // Also, if region and the slow control are not NULL, the slow edge | |
| 850 // is appended to the region. | |
| 851 Node* LibraryCallKit::generate_guard(Node* test, RegionNode* region, float true_prob) { | |
| 852 if (stopped()) { | |
| 853 // Already short circuited. | |
| 854 return NULL; | |
| 855 } | |
| 856 | |
| 857 // Build an if node and its projections. | |
| 858 // If test is true we take the slow path, which we assume is uncommon. | |
| 859 if (_gvn.type(test) == TypeInt::ZERO) { | |
| 860 // The slow branch is never taken. No need to build this guard. | |
| 861 return NULL; | |
| 862 } | |
| 863 | |
| 864 IfNode* iff = create_and_map_if(control(), test, true_prob, COUNT_UNKNOWN); | |
| 865 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
866 Node* if_slow = _gvn.transform( new (C) IfTrueNode(iff) ); |
| 0 | 867 if (if_slow == top()) { |
| 868 // The slow branch is never taken. No need to build this guard. | |
| 869 return NULL; | |
| 870 } | |
| 871 | |
| 872 if (region != NULL) | |
| 873 region->add_req(if_slow); | |
| 874 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
875 Node* if_fast = _gvn.transform( new (C) IfFalseNode(iff) ); |
| 0 | 876 set_control(if_fast); |
| 877 | |
| 878 return if_slow; | |
| 879 } | |
| 880 | |
| 881 inline Node* LibraryCallKit::generate_slow_guard(Node* test, RegionNode* region) { | |
| 882 return generate_guard(test, region, PROB_UNLIKELY_MAG(3)); | |
| 883 } | |
| 884 inline Node* LibraryCallKit::generate_fair_guard(Node* test, RegionNode* region) { | |
| 885 return generate_guard(test, region, PROB_FAIR); | |
| 886 } | |
| 887 | |
| 888 inline Node* LibraryCallKit::generate_negative_guard(Node* index, RegionNode* region, | |
| 889 Node* *pos_index) { | |
| 890 if (stopped()) | |
| 891 return NULL; // already stopped | |
| 892 if (_gvn.type(index)->higher_equal(TypeInt::POS)) // [0,maxint] | |
| 893 return NULL; // index is already adequately typed | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
894 Node* cmp_lt = _gvn.transform( new (C) CmpINode(index, intcon(0)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
895 Node* bol_lt = _gvn.transform( new (C) BoolNode(cmp_lt, BoolTest::lt) ); |
| 0 | 896 Node* is_neg = generate_guard(bol_lt, region, PROB_MIN); |
| 897 if (is_neg != NULL && pos_index != NULL) { | |
| 898 // 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
|
899 Node* ccast = new (C) CastIINode(index, TypeInt::POS); |
| 0 | 900 ccast->set_req(0, control()); |
| 901 (*pos_index) = _gvn.transform(ccast); | |
| 902 } | |
| 903 return is_neg; | |
| 904 } | |
| 905 | |
| 906 inline Node* LibraryCallKit::generate_nonpositive_guard(Node* index, bool never_negative, | |
| 907 Node* *pos_index) { | |
| 908 if (stopped()) | |
| 909 return NULL; // already stopped | |
| 910 if (_gvn.type(index)->higher_equal(TypeInt::POS1)) // [1,maxint] | |
| 911 return NULL; // index is already adequately typed | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
912 Node* cmp_le = _gvn.transform( new (C) CmpINode(index, intcon(0)) ); |
| 0 | 913 BoolTest::mask le_or_eq = (never_negative ? BoolTest::eq : BoolTest::le); |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
914 Node* bol_le = _gvn.transform( new (C) BoolNode(cmp_le, le_or_eq) ); |
| 0 | 915 Node* is_notp = generate_guard(bol_le, NULL, PROB_MIN); |
| 916 if (is_notp != NULL && pos_index != NULL) { | |
| 917 // 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
|
918 Node* ccast = new (C) CastIINode(index, TypeInt::POS1); |
| 0 | 919 ccast->set_req(0, control()); |
| 920 (*pos_index) = _gvn.transform(ccast); | |
| 921 } | |
| 922 return is_notp; | |
| 923 } | |
| 924 | |
| 925 // Make sure that 'position' is a valid limit index, in [0..length]. | |
| 926 // There are two equivalent plans for checking this: | |
| 927 // A. (offset + copyLength) unsigned<= arrayLength | |
| 928 // B. offset <= (arrayLength - copyLength) | |
| 929 // We require that all of the values above, except for the sum and | |
| 930 // difference, are already known to be non-negative. | |
| 931 // Plan A is robust in the face of overflow, if offset and copyLength | |
| 932 // are both hugely positive. | |
| 933 // | |
| 934 // Plan B is less direct and intuitive, but it does not overflow at | |
| 935 // all, since the difference of two non-negatives is always | |
| 936 // representable. Whenever Java methods must perform the equivalent | |
| 937 // check they generally use Plan B instead of Plan A. | |
| 938 // For the moment we use Plan A. | |
| 939 inline Node* LibraryCallKit::generate_limit_guard(Node* offset, | |
| 940 Node* subseq_length, | |
| 941 Node* array_length, | |
| 942 RegionNode* region) { | |
| 943 if (stopped()) | |
| 944 return NULL; // already stopped | |
| 945 bool zero_offset = _gvn.type(offset) == TypeInt::ZERO; | |
| 4778 | 946 if (zero_offset && subseq_length->eqv_uncast(array_length)) |
| 0 | 947 return NULL; // common case of whole-array copy |
| 948 Node* last = subseq_length; | |
| 949 if (!zero_offset) // last += offset | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
950 last = _gvn.transform( new (C) AddINode(last, offset)); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
951 Node* cmp_lt = _gvn.transform( new (C) CmpUNode(array_length, last) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
952 Node* bol_lt = _gvn.transform( new (C) BoolNode(cmp_lt, BoolTest::lt) ); |
| 0 | 953 Node* is_over = generate_guard(bol_lt, region, PROB_MIN); |
| 954 return is_over; | |
| 955 } | |
| 956 | |
| 957 | |
| 958 //--------------------------generate_current_thread-------------------- | |
| 959 Node* LibraryCallKit::generate_current_thread(Node* &tls_output) { | |
| 960 ciKlass* thread_klass = env()->Thread_klass(); | |
| 961 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
|
962 Node* thread = _gvn.transform(new (C) ThreadLocalNode()); |
| 0 | 963 Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(JavaThread::threadObj_offset())); |
| 964 Node* threadObj = make_load(NULL, p, thread_type, T_OBJECT); | |
| 965 tls_output = thread; | |
| 966 return threadObj; | |
| 967 } | |
| 968 | |
| 969 | |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
970 //------------------------------make_string_method_node------------------------ |
| 6057 | 971 // Helper method for String intrinsic functions. This version is called |
| 972 // with str1 and str2 pointing to String object nodes. | |
| 973 // | |
| 974 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
|
975 Node* no_ctrl = NULL; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
976 |
| 6057 | 977 // Get start addr of string |
| 978 Node* str1_value = load_String_value(no_ctrl, str1); | |
| 979 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
|
980 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
|
981 |
| 6057 | 982 // Get length of string 1 |
| 983 Node* str1_len = load_String_length(no_ctrl, str1); | |
| 984 | |
| 985 Node* str2_value = load_String_value(no_ctrl, str2); | |
| 986 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
|
987 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
|
988 |
| 6057 | 989 Node* str2_len = NULL; |
| 990 Node* result = NULL; | |
| 991 | |
| 992 switch (opcode) { | |
| 993 case Op_StrIndexOf: | |
| 994 // Get length of string 2 | |
| 995 str2_len = load_String_length(no_ctrl, str2); | |
| 996 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
997 result = new (C) StrIndexOfNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 998 str1_start, str1_len, str2_start, str2_len); |
| 999 break; | |
| 1000 case Op_StrComp: | |
| 1001 // Get length of string 2 | |
| 1002 str2_len = load_String_length(no_ctrl, str2); | |
| 1003 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1004 result = new (C) StrCompNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1005 str1_start, str1_len, str2_start, str2_len); |
| 1006 break; | |
| 1007 case Op_StrEquals: | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1008 result = new (C) StrEqualsNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1009 str1_start, str2_start, str1_len); |
| 1010 break; | |
| 1011 default: | |
| 1012 ShouldNotReachHere(); | |
| 1013 return NULL; | |
| 1014 } | |
| 1015 | |
| 1016 // All these intrinsics have checks. | |
| 1017 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
| 1018 | |
| 1019 return _gvn.transform(result); | |
| 1020 } | |
| 1021 | |
| 1022 // Helper method for String intrinsic functions. This version is called | |
| 1023 // with str1 and str2 pointing to char[] nodes, with cnt1 and cnt2 pointing | |
| 1024 // to Int nodes containing the lenghts of str1 and str2. | |
| 1025 // | |
| 1026 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
|
1027 Node* result = NULL; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1028 switch (opcode) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1029 case Op_StrIndexOf: |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1030 result = new (C) StrIndexOfNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1031 str1_start, cnt1, str2_start, cnt2); |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1032 break; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1033 case Op_StrComp: |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1034 result = new (C) StrCompNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1035 str1_start, cnt1, str2_start, cnt2); |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1036 break; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1037 case Op_StrEquals: |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1038 result = new (C) StrEqualsNode(control(), memory(TypeAryPtr::CHARS), |
| 6057 | 1039 str1_start, str2_start, cnt1); |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1040 break; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1041 default: |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1042 ShouldNotReachHere(); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1043 return NULL; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1044 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1045 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1046 // All these intrinsics have checks. |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1047 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
|
1048 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1049 return _gvn.transform(result); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1050 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1051 |
| 0 | 1052 //------------------------------inline_string_compareTo------------------------ |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1053 // public int java.lang.String.compareTo(String anotherString); |
| 0 | 1054 bool LibraryCallKit::inline_string_compareTo() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1055 Node* receiver = null_check(argument(0)); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1056 Node* arg = null_check(argument(1)); |
| 0 | 1057 if (stopped()) { |
| 1058 return true; | |
| 1059 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1060 set_result(make_string_method_node(Op_StrComp, receiver, arg)); |
| 0 | 1061 return true; |
| 1062 } | |
| 1063 | |
| 681 | 1064 //------------------------------inline_string_equals------------------------ |
| 1065 bool LibraryCallKit::inline_string_equals() { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1066 Node* receiver = null_check_receiver(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1067 // 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
|
1068 // allows to specify NULL as argument. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1069 Node* argument = this->argument(1); |
| 681 | 1070 if (stopped()) { |
| 1071 return true; | |
| 1072 } | |
| 1073 | |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1074 // paths (plus control) merge |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1075 RegionNode* region = new (C) RegionNode(5); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1076 Node* phi = new (C) PhiNode(region, TypeInt::BOOL); |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1077 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1078 // does source == target string? |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1079 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
|
1080 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
|
1081 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1082 Node* if_eq = generate_slow_guard(bol, NULL); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1083 if (if_eq != NULL) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1084 // receiver == argument |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1085 phi->init_req(2, intcon(1)); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1086 region->init_req(2, if_eq); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1087 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1088 |
| 681 | 1089 // get String klass for instanceOf |
| 1090 ciInstanceKlass* klass = env()->String_klass(); | |
| 1091 | |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1092 if (!stopped()) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1093 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
|
1094 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
|
1095 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
|
1096 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1097 Node* inst_false = generate_guard(bol, NULL, PROB_MIN); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1098 //instanceOf == true, fallthrough |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1099 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1100 if (inst_false != NULL) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1101 phi->init_req(3, intcon(0)); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1102 region->init_req(3, inst_false); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1103 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1104 } |
| 681 | 1105 |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1106 if (!stopped()) { |
| 6057 | 1107 const TypeOopPtr* string_type = TypeOopPtr::make_from_klass(klass); |
| 1108 | |
|
1496
e8e83be27dd7
6951190: assert(!klass_is_exact(),"only non-exact klass") while building JDK
never
parents:
1396
diff
changeset
|
1109 // 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
|
1110 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
|
1111 // 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
|
1112 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
|
1113 |
| 6057 | 1114 Node* no_ctrl = NULL; |
| 1115 | |
| 1116 // Get start addr of receiver | |
| 1117 Node* receiver_val = load_String_value(no_ctrl, receiver); | |
| 1118 Node* receiver_offset = load_String_offset(no_ctrl, receiver); | |
| 1119 Node* receiver_start = array_element_address(receiver_val, receiver_offset, T_CHAR); | |
| 1120 | |
| 1121 // Get length of receiver | |
| 1122 Node* receiver_cnt = load_String_length(no_ctrl, receiver); | |
| 1123 | |
| 1124 // Get start addr of argument | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1125 Node* argument_val = load_String_value(no_ctrl, argument); |
| 6057 | 1126 Node* argument_offset = load_String_offset(no_ctrl, argument); |
| 1127 Node* argument_start = array_element_address(argument_val, argument_offset, T_CHAR); | |
| 1128 | |
| 1129 // Get length of argument | |
| 1130 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
|
1131 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1132 // Check for receiver count != argument count |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1133 Node* cmp = _gvn.transform( new(C) CmpINode(receiver_cnt, argument_cnt) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1134 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
|
1135 Node* if_ne = generate_slow_guard(bol, NULL); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1136 if (if_ne != NULL) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1137 phi->init_req(4, intcon(0)); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1138 region->init_req(4, if_ne); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1139 } |
| 6057 | 1140 |
| 1141 // Check for count == 0 is done by assembler code for StrEquals. | |
| 1142 | |
| 1143 if (!stopped()) { | |
| 1144 Node* equals = make_string_method_node(Op_StrEquals, receiver_start, receiver_cnt, argument_start, argument_cnt); | |
| 1145 phi->init_req(1, equals); | |
| 1146 region->init_req(1, control()); | |
| 1147 } | |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1148 } |
| 681 | 1149 |
| 1150 // post merge | |
| 1151 set_control(_gvn.transform(region)); | |
| 1152 record_for_igvn(region); | |
| 1153 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1154 set_result(_gvn.transform(phi)); |
| 681 | 1155 return true; |
| 1156 } | |
| 1157 | |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1158 //------------------------------inline_array_equals---------------------------- |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1159 bool LibraryCallKit::inline_array_equals() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1160 Node* arg1 = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1161 Node* arg2 = argument(1); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1162 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
|
1163 return true; |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1164 } |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
1165 |
| 0 | 1166 // Java version of String.indexOf(constant string) |
| 1167 // class StringDecl { | |
| 1168 // StringDecl(char[] ca) { | |
| 1169 // offset = 0; | |
| 1170 // count = ca.length; | |
| 1171 // value = ca; | |
| 1172 // } | |
| 1173 // int offset; | |
| 1174 // int count; | |
| 1175 // char[] value; | |
| 1176 // } | |
| 1177 // | |
| 1178 // static int string_indexOf_J(StringDecl string_object, char[] target_object, | |
| 1179 // int targetOffset, int cache_i, int md2) { | |
| 1180 // int cache = cache_i; | |
| 1181 // int sourceOffset = string_object.offset; | |
| 1182 // int sourceCount = string_object.count; | |
| 1183 // int targetCount = target_object.length; | |
| 1184 // | |
| 1185 // int targetCountLess1 = targetCount - 1; | |
| 1186 // int sourceEnd = sourceOffset + sourceCount - targetCountLess1; | |
| 1187 // | |
| 1188 // char[] source = string_object.value; | |
| 1189 // char[] target = target_object; | |
| 1190 // int lastChar = target[targetCountLess1]; | |
| 1191 // | |
| 1192 // outer_loop: | |
| 1193 // for (int i = sourceOffset; i < sourceEnd; ) { | |
| 1194 // int src = source[i + targetCountLess1]; | |
| 1195 // if (src == lastChar) { | |
| 1196 // // With random strings and a 4-character alphabet, | |
| 1197 // // reverse matching at this point sets up 0.8% fewer | |
| 1198 // // frames, but (paradoxically) makes 0.3% more probes. | |
| 1199 // // Since those probes are nearer the lastChar probe, | |
| 1200 // // there is may be a net D$ win with reverse matching. | |
| 1201 // // But, reversing loop inhibits unroll of inner loop | |
| 1202 // // for unknown reason. So, does running outer loop from | |
| 1203 // // (sourceOffset - targetCountLess1) to (sourceOffset + sourceCount) | |
| 1204 // for (int j = 0; j < targetCountLess1; j++) { | |
| 1205 // if (target[targetOffset + j] != source[i+j]) { | |
| 1206 // if ((cache & (1 << source[i+j])) == 0) { | |
| 1207 // if (md2 < j+1) { | |
| 1208 // i += j+1; | |
| 1209 // continue outer_loop; | |
| 1210 // } | |
| 1211 // } | |
| 1212 // i += md2; | |
| 1213 // continue outer_loop; | |
| 1214 // } | |
| 1215 // } | |
| 1216 // return i - sourceOffset; | |
| 1217 // } | |
| 1218 // if ((cache & (1 << src)) == 0) { | |
| 1219 // i += targetCountLess1; | |
| 1220 // } // using "i += targetCount;" and an "else i++;" causes a jump to jump. | |
| 1221 // i++; | |
| 1222 // } | |
| 1223 // return -1; | |
| 1224 // } | |
| 1225 | |
| 1226 //------------------------------string_indexOf------------------------ | |
| 1227 Node* LibraryCallKit::string_indexOf(Node* string_object, ciTypeArray* target_array, jint targetOffset_i, | |
| 1228 jint cache_i, jint md2_i) { | |
| 1229 | |
| 1230 Node* no_ctrl = NULL; | |
| 1231 float likely = PROB_LIKELY(0.9); | |
| 1232 float unlikely = PROB_UNLIKELY(0.9); | |
| 1233 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1234 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
|
1235 |
| 6057 | 1236 Node* source = load_String_value(no_ctrl, string_object); |
| 1237 Node* sourceOffset = load_String_offset(no_ctrl, string_object); | |
| 1238 Node* sourceCount = load_String_length(no_ctrl, string_object); | |
| 0 | 1239 |
|
2379
b099aaf51bf8
6962931: move interned strings out of the perm gen
jcoomes
parents:
2324
diff
changeset
|
1240 Node* target = _gvn.transform( makecon(TypeOopPtr::make_from_constant(target_array, true)) ); |
| 0 | 1241 jint target_length = target_array->length(); |
| 1242 const TypeAry* target_array_type = TypeAry::make(TypeInt::CHAR, TypeInt::make(0, target_length, Type::WidenMin)); | |
| 1243 const TypeAryPtr* target_type = TypeAryPtr::make(TypePtr::BotPTR, target_array_type, target_array->klass(), true, Type::OffsetBot); | |
| 1244 | |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
1245 IdealKit kit(this, false, true); |
| 0 | 1246 #define __ kit. |
| 1247 Node* zero = __ ConI(0); | |
| 1248 Node* one = __ ConI(1); | |
| 1249 Node* cache = __ ConI(cache_i); | |
| 1250 Node* md2 = __ ConI(md2_i); | |
| 1251 Node* lastChar = __ ConI(target_array->char_at(target_length - 1)); | |
| 1252 Node* targetCount = __ ConI(target_length); | |
| 1253 Node* targetCountLess1 = __ ConI(target_length - 1); | |
| 1254 Node* targetOffset = __ ConI(targetOffset_i); | |
| 1255 Node* sourceEnd = __ SubI(__ AddI(sourceOffset, sourceCount), targetCountLess1); | |
| 1256 | |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1257 IdealVariable rtn(kit), i(kit), j(kit); __ declarations_done(); |
| 0 | 1258 Node* outer_loop = __ make_label(2 /* goto */); |
| 1259 Node* return_ = __ make_label(1); | |
| 1260 | |
| 1261 __ set(rtn,__ ConI(-1)); | |
|
2383
9dc311b8473e
7008866: Missing loop predicate for loop with multiple entries
kvn
parents:
2324
diff
changeset
|
1262 __ loop(this, nargs, i, sourceOffset, BoolTest::lt, sourceEnd); { |
| 0 | 1263 Node* i2 = __ AddI(__ value(i), targetCountLess1); |
| 1264 // pin to prohibit loading of "next iteration" value which may SEGV (rare) | |
| 1265 Node* src = load_array_element(__ ctrl(), source, i2, TypeAryPtr::CHARS); | |
| 1266 __ if_then(src, BoolTest::eq, lastChar, unlikely); { | |
|
2383
9dc311b8473e
7008866: Missing loop predicate for loop with multiple entries
kvn
parents:
2324
diff
changeset
|
1267 __ loop(this, nargs, j, zero, BoolTest::lt, targetCountLess1); { |
| 0 | 1268 Node* tpj = __ AddI(targetOffset, __ value(j)); |
| 1269 Node* targ = load_array_element(no_ctrl, target, tpj, target_type); | |
| 1270 Node* ipj = __ AddI(__ value(i), __ value(j)); | |
| 1271 Node* src2 = load_array_element(no_ctrl, source, ipj, TypeAryPtr::CHARS); | |
| 1272 __ if_then(targ, BoolTest::ne, src2); { | |
| 1273 __ if_then(__ AndI(cache, __ LShiftI(one, src2)), BoolTest::eq, zero); { | |
| 1274 __ if_then(md2, BoolTest::lt, __ AddI(__ value(j), one)); { | |
| 1275 __ increment(i, __ AddI(__ value(j), one)); | |
| 1276 __ goto_(outer_loop); | |
| 1277 } __ end_if(); __ dead(j); | |
| 1278 }__ end_if(); __ dead(j); | |
| 1279 __ increment(i, md2); | |
| 1280 __ goto_(outer_loop); | |
| 1281 }__ end_if(); | |
| 1282 __ increment(j, one); | |
| 1283 }__ end_loop(); __ dead(j); | |
| 1284 __ set(rtn, __ SubI(__ value(i), sourceOffset)); __ dead(i); | |
| 1285 __ goto_(return_); | |
| 1286 }__ end_if(); | |
| 1287 __ if_then(__ AndI(cache, __ LShiftI(one, src)), BoolTest::eq, zero, likely); { | |
| 1288 __ increment(i, targetCountLess1); | |
| 1289 }__ end_if(); | |
| 1290 __ increment(i, one); | |
| 1291 __ bind(outer_loop); | |
| 1292 }__ end_loop(); __ dead(i); | |
| 1293 __ bind(return_); | |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1294 |
|
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
1295 // Final sync IdealKit and GraphKit. |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
1296 final_sync(kit); |
| 0 | 1297 Node* result = __ value(rtn); |
| 1298 #undef __ | |
| 1299 C->set_has_loops(true); | |
| 1300 return result; | |
| 1301 } | |
| 1302 | |
| 1303 //------------------------------inline_string_indexOf------------------------ | |
| 1304 bool LibraryCallKit::inline_string_indexOf() { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1305 Node* receiver = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1306 Node* arg = argument(1); |
| 681 | 1307 |
| 1308 Node* result; | |
|
1504
ae8f909e5fc7
6948602: Disable use of SSE4.2 in String.indexOf intrinsic until 6942326 is fixed
iveresov
parents:
1396
diff
changeset
|
1309 // 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
|
1310 // 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
|
1311 if (Matcher::has_match_rule(Op_StrIndexOf) && |
| 681 | 1312 UseSSE42Intrinsics) { |
| 1313 // Generate SSE4.2 version of indexOf | |
| 1314 // We currently only have match rules that use SSE4.2 | |
| 1315 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1316 receiver = null_check(receiver); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1317 arg = null_check(arg); |
| 681 | 1318 if (stopped()) { |
| 1319 return true; | |
| 1320 } | |
| 1321 | |
|
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1322 ciInstanceKlass* str_klass = env()->String_klass(); |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1323 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
|
1324 |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1325 // Make the merge point |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1326 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
|
1327 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
|
1328 Node* no_ctrl = NULL; |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1329 |
| 6057 | 1330 // Get start addr of source string |
| 1331 Node* source = load_String_value(no_ctrl, receiver); | |
| 1332 Node* source_offset = load_String_offset(no_ctrl, receiver); | |
| 1333 Node* source_start = array_element_address(source, source_offset, T_CHAR); | |
| 1334 | |
| 1335 // Get length of source string | |
| 1336 Node* source_cnt = load_String_length(no_ctrl, receiver); | |
| 1337 | |
| 1338 // Get start addr of substring | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1339 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
|
1340 Node* substr_offset = load_String_offset(no_ctrl, arg); |
| 6057 | 1341 Node* substr_start = array_element_address(substr, substr_offset, T_CHAR); |
| 1342 | |
| 1343 // Get length of source string | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1344 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
|
1345 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1346 // Check for substr count > string count |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1347 Node* cmp = _gvn.transform( new(C) CmpINode(substr_cnt, source_cnt) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1348 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
|
1349 Node* if_gt = generate_slow_guard(bol, NULL); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1350 if (if_gt != NULL) { |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1351 result_phi->init_req(2, intcon(-1)); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1352 result_rgn->init_req(2, if_gt); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1353 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1354 |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1355 if (!stopped()) { |
|
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1356 // Check for substr count == 0 |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1357 cmp = _gvn.transform( new(C) CmpINode(substr_cnt, intcon(0)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1358 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
|
1359 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
|
1360 if (if_zero != NULL) { |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1361 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
|
1362 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
|
1363 } |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1364 } |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1365 |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1366 if (!stopped()) { |
| 6057 | 1367 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
|
1368 result_phi->init_req(1, result); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1369 result_rgn->init_req(1, control()); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1370 } |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1371 set_control(_gvn.transform(result_rgn)); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1372 record_for_igvn(result_rgn); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1373 result = _gvn.transform(result_phi); |
|
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
958
diff
changeset
|
1374 |
|
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1375 } else { // Use LibraryCallKit::string_indexOf |
|
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1376 // 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
|
1377 if (!arg->is_Con()) { |
| 681 | 1378 return false; |
| 1379 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1380 const TypeOopPtr* str_type = _gvn.type(arg)->isa_oopptr(); |
| 681 | 1381 if (str_type == NULL) { |
| 1382 return false; | |
| 1383 } | |
| 1384 ciInstanceKlass* klass = env()->String_klass(); | |
| 1385 ciObject* str_const = str_type->const_oop(); | |
| 1386 if (str_const == NULL || str_const->klass() != klass) { | |
| 1387 return false; | |
| 1388 } | |
| 1389 ciInstance* str = str_const->as_instance(); | |
| 1390 assert(str != NULL, "must be instance"); | |
| 1391 | |
| 6057 | 1392 ciObject* v = str->field_value_by_offset(java_lang_String::value_offset_in_bytes()).as_object(); |
| 681 | 1393 ciTypeArray* pat = v->as_type_array(); // pattern (argument) character array |
| 1394 | |
| 6057 | 1395 int o; |
| 1396 int c; | |
| 1397 if (java_lang_String::has_offset_field()) { | |
| 1398 o = str->field_value_by_offset(java_lang_String::offset_offset_in_bytes()).as_int(); | |
| 1399 c = str->field_value_by_offset(java_lang_String::count_offset_in_bytes()).as_int(); | |
| 1400 } else { | |
| 1401 o = 0; | |
| 1402 c = pat->length(); | |
| 1403 } | |
| 1404 | |
| 681 | 1405 // constant strings have no offset and count == length which |
| 1406 // simplifies the resulting code somewhat so lets optimize for that. | |
| 1407 if (o != 0 || c != pat->length()) { | |
| 1408 return false; | |
| 1409 } | |
| 1410 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1411 receiver = null_check(receiver, T_OBJECT); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1412 // NOTE: No null check on the argument is needed since it's a constant String oop. |
| 681 | 1413 if (stopped()) { |
|
2320
41d4973cf100
6942326: x86 code in string_indexof() could read beyond reserved heap space
kvn
parents:
1972
diff
changeset
|
1414 return true; |
| 681 | 1415 } |
| 1416 | |
| 1417 // The null string as a pattern always returns 0 (match at beginning of string) | |
| 1418 if (c == 0) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1419 set_result(intcon(0)); |
| 681 | 1420 return true; |
| 1421 } | |
| 1422 | |
| 1423 // Generate default indexOf | |
| 1424 jchar lastChar = pat->char_at(o + (c - 1)); | |
| 1425 int cache = 0; | |
| 1426 int i; | |
| 1427 for (i = 0; i < c - 1; i++) { | |
| 1428 assert(i < pat->length(), "out of range"); | |
| 1429 cache |= (1 << (pat->char_at(o + i) & (sizeof(cache) * BitsPerByte - 1))); | |
| 1430 } | |
| 1431 | |
| 1432 int md2 = c; | |
| 1433 for (i = 0; i < c - 1; i++) { | |
| 1434 assert(i < pat->length(), "out of range"); | |
| 1435 if (pat->char_at(o + i) == lastChar) { | |
| 1436 md2 = (c - 1) - i; | |
| 1437 } | |
| 1438 } | |
| 1439 | |
| 1440 result = string_indexOf(receiver, pat, o, cache, md2); | |
| 0 | 1441 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1442 set_result(result); |
| 0 | 1443 return true; |
| 1444 } | |
| 1445 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1446 //--------------------------round_double_node-------------------------------- |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1447 // Round a double node if necessary. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1448 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
|
1449 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
|
1450 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
|
1451 return n; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1452 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1453 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1454 //------------------------------inline_math----------------------------------- |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1455 // public static double Math.abs(double) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1456 // public static double Math.sqrt(double) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1457 // public static double Math.log(double) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1458 // public static double Math.log10(double) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1459 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
|
1460 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
|
1461 Node* n; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1462 switch (id) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1463 case vmIntrinsics::_dabs: n = new (C) AbsDNode( arg); break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1464 case vmIntrinsics::_dsqrt: n = new (C) SqrtDNode(0, arg); break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1465 case vmIntrinsics::_dlog: n = new (C) LogDNode( arg); break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1466 case vmIntrinsics::_dlog10: n = new (C) Log10DNode( arg); break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1467 default: fatal_unexpected_iid(id); break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1468 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1469 set_result(_gvn.transform(n)); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1470 return true; |
| 0 | 1471 } |
| 1472 | |
| 1473 //------------------------------inline_trig---------------------------------- | |
| 1474 // Inline sin/cos/tan instructions, if possible. If rounding is required, do | |
| 1475 // argument reduction which will turn into a fast/slow diamond. | |
| 1476 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
|
1477 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
|
1478 Node* n = NULL; |
| 0 | 1479 |
| 1480 switch (id) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1481 case vmIntrinsics::_dsin: n = new (C) SinDNode(arg); break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1482 case vmIntrinsics::_dcos: n = new (C) CosDNode(arg); break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1483 case vmIntrinsics::_dtan: n = new (C) TanDNode(arg); break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1484 default: fatal_unexpected_iid(id); break; |
| 0 | 1485 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1486 n = _gvn.transform(n); |
| 0 | 1487 |
| 1488 // 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
|
1489 if (Matcher::strict_fp_requires_explicit_rounding) { |
| 0 | 1490 static const double pi_4 = 0.7853981633974483; |
| 1491 static const double neg_pi_4 = -0.7853981633974483; | |
| 1492 // pi/2 in 80-bit extended precision | |
| 1493 // static const unsigned char pi_2_bits_x[] = {0x35,0xc2,0x68,0x21,0xa2,0xda,0x0f,0xc9,0xff,0x3f,0x00,0x00,0x00,0x00,0x00,0x00}; | |
| 1494 // -pi/2 in 80-bit extended precision | |
| 1495 // 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}; | |
| 1496 // Cutoff value for using this argument reduction technique | |
| 1497 //static const double pi_2_minus_epsilon = 1.564660403643354; | |
| 1498 //static const double neg_pi_2_plus_epsilon = -1.564660403643354; | |
| 1499 | |
| 1500 // Pseudocode for sin: | |
| 1501 // if (x <= Math.PI / 4.0) { | |
| 1502 // if (x >= -Math.PI / 4.0) return fsin(x); | |
| 1503 // if (x >= -Math.PI / 2.0) return -fcos(x + Math.PI / 2.0); | |
| 1504 // } else { | |
| 1505 // if (x <= Math.PI / 2.0) return fcos(x - Math.PI / 2.0); | |
| 1506 // } | |
| 1507 // return StrictMath.sin(x); | |
| 1508 | |
| 1509 // Pseudocode for cos: | |
| 1510 // if (x <= Math.PI / 4.0) { | |
| 1511 // if (x >= -Math.PI / 4.0) return fcos(x); | |
| 1512 // if (x >= -Math.PI / 2.0) return fsin(x + Math.PI / 2.0); | |
| 1513 // } else { | |
| 1514 // if (x <= Math.PI / 2.0) return -fsin(x - Math.PI / 2.0); | |
| 1515 // } | |
| 1516 // return StrictMath.cos(x); | |
| 1517 | |
| 1518 // Actually, sticking in an 80-bit Intel value into C2 will be tough; it | |
| 1519 // requires a special machine instruction to load it. Instead we'll try | |
| 1520 // the 'easy' case. If we really need the extra range +/- PI/2 we'll | |
| 1521 // probably do the math inside the SIN encoding. | |
| 1522 | |
| 1523 // Make the merge point | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1524 RegionNode* r = new (C) RegionNode(3); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1525 Node* phi = new (C) PhiNode(r, Type::DOUBLE); |
| 0 | 1526 |
| 1527 // 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
|
1528 Node *abs = _gvn.transform(new (C) AbsDNode(arg)); |
| 0 | 1529 // Node for PI/4 constant |
| 1530 Node *pi4 = makecon(TypeD::make(pi_4)); | |
| 1531 // Check PI/4 : abs(arg) | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1532 Node *cmp = _gvn.transform(new (C) CmpDNode(pi4,abs)); |
| 0 | 1533 // Check: If PI/4 < abs(arg) then go slow |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1534 Node *bol = _gvn.transform( new (C) BoolNode( cmp, BoolTest::lt ) ); |
| 0 | 1535 // Branch either way |
| 1536 IfNode *iff = create_and_xform_if(control(),bol, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
| 1537 set_control(opt_iff(r,iff)); | |
| 1538 | |
| 1539 // Set fast path result | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1540 phi->init_req(2, n); |
| 0 | 1541 |
| 1542 // Slow path - non-blocking leaf call | |
| 1543 Node* call = NULL; | |
| 1544 switch (id) { | |
| 1545 case vmIntrinsics::_dsin: | |
| 1546 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(), | |
| 1547 CAST_FROM_FN_PTR(address, SharedRuntime::dsin), | |
| 1548 "Sin", NULL, arg, top()); | |
| 1549 break; | |
| 1550 case vmIntrinsics::_dcos: | |
| 1551 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(), | |
| 1552 CAST_FROM_FN_PTR(address, SharedRuntime::dcos), | |
| 1553 "Cos", NULL, arg, top()); | |
| 1554 break; | |
| 1555 case vmIntrinsics::_dtan: | |
| 1556 call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(), | |
| 1557 CAST_FROM_FN_PTR(address, SharedRuntime::dtan), | |
| 1558 "Tan", NULL, arg, top()); | |
| 1559 break; | |
| 1560 } | |
| 1561 assert(control()->in(0) == call, ""); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1562 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
|
1563 r->init_req(1, control()); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1564 phi->init_req(1, slow_result); |
| 0 | 1565 |
| 1566 // Post-merge | |
| 1567 set_control(_gvn.transform(r)); | |
| 1568 record_for_igvn(r); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1569 n = _gvn.transform(phi); |
| 0 | 1570 |
| 1571 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
| 1572 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1573 set_result(n); |
| 0 | 1574 return true; |
| 1575 } | |
| 1576 | |
| 6205 | 1577 void LibraryCallKit::finish_pow_exp(Node* result, Node* x, Node* y, const TypeFunc* call_type, address funcAddr, const char* funcName) { |
| 1578 //------------------- | |
| 1579 //result=(result.isNaN())? funcAddr():result; | |
| 1580 // Check: If isNaN() by checking result!=result? then either trap | |
| 1581 // or go to runtime | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1582 Node* cmpisnan = _gvn.transform(new (C) CmpDNode(result, result)); |
| 6205 | 1583 // Build the boolean node |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1584 Node* bolisnum = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::eq)); |
| 6205 | 1585 |
| 1586 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
|
1587 { BuildCutout unless(this, bolisnum, PROB_STATIC_FREQUENT); |
| 6205 | 1588 // The pow or exp intrinsic returned a NaN, which requires a call |
| 1589 // to the runtime. Recompile with the runtime call. | |
| 1590 uncommon_trap(Deoptimization::Reason_intrinsic, | |
| 1591 Deoptimization::Action_make_not_entrant); | |
| 1592 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1593 set_result(result); |
| 6205 | 1594 } else { |
| 1595 // If this inlining ever returned NaN in the past, we compile a call | |
| 1596 // to the runtime to properly handle corner cases | |
| 1597 | |
| 1598 IfNode* iff = create_and_xform_if(control(), bolisnum, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1599 Node* if_slow = _gvn.transform( new (C) IfFalseNode(iff) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1600 Node* if_fast = _gvn.transform( new (C) IfTrueNode(iff) ); |
| 6205 | 1601 |
| 1602 if (!if_slow->is_top()) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1603 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
|
1604 PhiNode* result_val = new (C) PhiNode(result_region, Type::DOUBLE); |
| 6205 | 1605 |
| 1606 result_region->init_req(1, if_fast); | |
| 1607 result_val->init_req(1, result); | |
| 1608 | |
| 1609 set_control(if_slow); | |
| 1610 | |
| 1611 const TypePtr* no_memory_effects = NULL; | |
| 1612 Node* rt = make_runtime_call(RC_LEAF, call_type, funcAddr, funcName, | |
| 1613 no_memory_effects, | |
| 1614 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
|
1615 Node* value = _gvn.transform(new (C) ProjNode(rt, TypeFunc::Parms+0)); |
| 6205 | 1616 #ifdef ASSERT |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1617 Node* value_top = _gvn.transform(new (C) ProjNode(rt, TypeFunc::Parms+1)); |
| 6205 | 1618 assert(value_top == top(), "second value must be top"); |
| 1619 #endif | |
| 1620 | |
| 1621 result_region->init_req(2, control()); | |
| 1622 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
|
1623 set_result(result_region, result_val); |
| 6205 | 1624 } else { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1625 set_result(result); |
| 6205 | 1626 } |
| 1627 } | |
| 1628 } | |
| 1629 | |
| 0 | 1630 //------------------------------inline_exp------------------------------------- |
| 1631 // Inline exp instructions, if possible. The Intel hardware only misses | |
| 1632 // 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
|
1633 bool LibraryCallKit::inline_exp() { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1634 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
|
1635 Node* n = _gvn.transform(new (C) ExpDNode(0, arg)); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1636 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1637 finish_pow_exp(n, arg, NULL, OptoRuntime::Math_D_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dexp), "EXP"); |
| 0 | 1638 |
| 1639 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
| 1640 return true; | |
| 1641 } | |
| 1642 | |
| 1643 //------------------------------inline_pow------------------------------------- | |
| 1644 // Inline power instructions, if possible. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1645 bool LibraryCallKit::inline_pow() { |
| 0 | 1646 // Pseudocode for pow |
| 1647 // if (x <= 0.0) { | |
| 6205 | 1648 // long longy = (long)y; |
| 1649 // if ((double)longy == y) { // if y is long | |
| 1650 // if (y + 1 == y) longy = 0; // huge number: even | |
| 1651 // result = ((1&longy) == 0)?-DPow(abs(x), y):DPow(abs(x), y); | |
| 0 | 1652 // } else { |
| 1653 // result = NaN; | |
| 1654 // } | |
| 1655 // } else { | |
| 1656 // result = DPow(x,y); | |
| 1657 // } | |
| 1658 // if (result != result)? { | |
| 6205 | 1659 // result = uncommon_trap() or runtime_call(); |
| 0 | 1660 // } |
| 1661 // return result; | |
| 1662 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1663 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
|
1664 Node* y = round_double_node(argument(2)); |
| 0 | 1665 |
| 6205 | 1666 Node* result = NULL; |
| 1667 | |
| 1668 if (!too_many_traps(Deoptimization::Reason_intrinsic)) { | |
| 1669 // Short form: skip the fancy tests and just check for NaN result. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1670 result = _gvn.transform(new (C) PowDNode(0, x, y)); |
| 0 | 1671 } else { |
| 6205 | 1672 // If this inlining ever returned NaN in the past, include all |
| 1673 // checks + call to the runtime. | |
| 0 | 1674 |
| 1675 // Set the merge point for If node with condition of (x <= 0.0) | |
| 1676 // 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
|
1677 RegionNode *r = new (C) RegionNode(4); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1678 Node *phi = new (C) PhiNode(r, Type::DOUBLE); |
| 0 | 1679 |
| 1680 // Build the first if node: if (x <= 0.0) | |
| 1681 // Node for 0 constant | |
| 1682 Node *zeronode = makecon(TypeD::ZERO); | |
| 1683 // Check x:0 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1684 Node *cmp = _gvn.transform(new (C) CmpDNode(x, zeronode)); |
| 0 | 1685 // Check: If (x<=0) then go complex path |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1686 Node *bol1 = _gvn.transform( new (C) BoolNode( cmp, BoolTest::le ) ); |
| 0 | 1687 // Branch either way |
| 1688 IfNode *if1 = create_and_xform_if(control(),bol1, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN); | |
| 1689 // Fast path taken; set region slot 3 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1690 Node *fast_taken = _gvn.transform( new (C) IfFalseNode(if1) ); |
| 0 | 1691 r->init_req(3,fast_taken); // Capture fast-control |
| 1692 | |
| 1693 // Fast path not-taken, i.e. slow path | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1694 Node *complex_path = _gvn.transform( new (C) IfTrueNode(if1) ); |
| 0 | 1695 |
| 1696 // Set fast path result | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1697 Node *fast_result = _gvn.transform( new (C) PowDNode(0, x, y) ); |
| 0 | 1698 phi->init_req(3, fast_result); |
| 1699 | |
| 1700 // Complex path | |
| 6205 | 1701 // Build the second if node (if y is long) |
| 1702 // Node for (long)y | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1703 Node *longy = _gvn.transform( new (C) ConvD2LNode(y)); |
| 6205 | 1704 // Node for (double)((long) y) |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1705 Node *doublelongy= _gvn.transform( new (C) ConvL2DNode(longy)); |
| 6205 | 1706 // Check (double)((long) y) : y |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1707 Node *cmplongy= _gvn.transform(new (C) CmpDNode(doublelongy, y)); |
| 6205 | 1708 // Check if (y isn't long) then go to slow path |
| 1709 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1710 Node *bol2 = _gvn.transform( new (C) BoolNode( cmplongy, BoolTest::ne ) ); |
| 605 | 1711 // Branch either way |
| 0 | 1712 IfNode *if2 = create_and_xform_if(complex_path,bol2, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN); |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1713 Node* ylong_path = _gvn.transform( new (C) IfFalseNode(if2)); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1714 |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1715 Node *slow_path = _gvn.transform( new (C) IfTrueNode(if2) ); |
| 6205 | 1716 |
| 1717 // Calculate DPow(abs(x), y)*(1 & (long)y) | |
| 0 | 1718 // Node for constant 1 |
| 6205 | 1719 Node *conone = longcon(1); |
| 1720 // 1& (long)y | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1721 Node *signnode= _gvn.transform( new (C) AndLNode(conone, longy) ); |
| 6205 | 1722 |
| 1723 // A huge number is always even. Detect a huge number by checking | |
| 1724 // if y + 1 == y and set integer to be tested for parity to 0. | |
| 1725 // Required for corner case: | |
| 1726 // (long)9.223372036854776E18 = max_jlong | |
| 1727 // (double)(long)9.223372036854776E18 = 9.223372036854776E18 | |
| 1728 // max_jlong is odd but 9.223372036854776E18 is even | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1729 Node* yplus1 = _gvn.transform( new (C) AddDNode(y, makecon(TypeD::make(1)))); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1730 Node *cmpyplus1= _gvn.transform(new (C) CmpDNode(yplus1, y)); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1731 Node *bolyplus1 = _gvn.transform( new (C) BoolNode( cmpyplus1, BoolTest::eq ) ); |
| 6205 | 1732 Node* correctedsign = NULL; |
| 1733 if (ConditionalMoveLimit != 0) { | |
| 1734 correctedsign = _gvn.transform( CMoveNode::make(C, NULL, bolyplus1, signnode, longcon(0), TypeLong::LONG)); | |
| 1735 } else { | |
| 1736 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
|
1737 RegionNode *r = new (C) RegionNode(3); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1738 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
|
1739 r->init_req(1, _gvn.transform( new (C) IfFalseNode(ifyplus1))); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1740 r->init_req(2, _gvn.transform( new (C) IfTrueNode(ifyplus1))); |
| 6205 | 1741 phi->init_req(1, signnode); |
| 1742 phi->init_req(2, longcon(0)); | |
| 1743 correctedsign = _gvn.transform(phi); | |
| 1744 ylong_path = _gvn.transform(r); | |
| 1745 record_for_igvn(r); | |
| 1746 } | |
| 1747 | |
| 0 | 1748 // zero node |
| 6205 | 1749 Node *conzero = longcon(0); |
| 1750 // Check (1&(long)y)==0? | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1751 Node *cmpeq1 = _gvn.transform(new (C) CmpLNode(correctedsign, conzero)); |
| 6205 | 1752 // Check if (1&(long)y)!=0?, if so the result is negative |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1753 Node *bol3 = _gvn.transform( new (C) BoolNode( cmpeq1, BoolTest::ne ) ); |
| 0 | 1754 // abs(x) |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1755 Node *absx=_gvn.transform( new (C) AbsDNode(x)); |
| 0 | 1756 // abs(x)^y |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1757 Node *absxpowy = _gvn.transform( new (C) PowDNode(0, absx, y) ); |
| 0 | 1758 // -abs(x)^y |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1759 Node *negabsxpowy = _gvn.transform(new (C) NegDNode (absxpowy)); |
| 6205 | 1760 // (1&(long)y)==1?-DPow(abs(x), y):DPow(abs(x), y) |
| 1761 Node *signresult = NULL; | |
| 1762 if (ConditionalMoveLimit != 0) { | |
| 1763 signresult = _gvn.transform( CMoveNode::make(C, NULL, bol3, absxpowy, negabsxpowy, Type::DOUBLE)); | |
| 1764 } else { | |
| 1765 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
|
1766 RegionNode *r = new (C) RegionNode(3); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1767 Node *phi = new (C) PhiNode(r, Type::DOUBLE); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1768 r->init_req(1, _gvn.transform( new (C) IfFalseNode(ifyeven))); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1769 r->init_req(2, _gvn.transform( new (C) IfTrueNode(ifyeven))); |
| 6205 | 1770 phi->init_req(1, absxpowy); |
| 1771 phi->init_req(2, negabsxpowy); | |
| 1772 signresult = _gvn.transform(phi); | |
| 1773 ylong_path = _gvn.transform(r); | |
| 1774 record_for_igvn(r); | |
| 1775 } | |
| 0 | 1776 // Set complex path fast result |
| 6205 | 1777 r->init_req(2, ylong_path); |
| 0 | 1778 phi->init_req(2, signresult); |
| 1779 | |
| 1780 static const jlong nan_bits = CONST64(0x7ff8000000000000); | |
| 1781 Node *slow_result = makecon(TypeD::make(*(double*)&nan_bits)); // return NaN | |
| 1782 r->init_req(1,slow_path); | |
| 1783 phi->init_req(1,slow_result); | |
| 1784 | |
| 1785 // Post merge | |
| 1786 set_control(_gvn.transform(r)); | |
| 1787 record_for_igvn(r); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1788 result = _gvn.transform(phi); |
| 0 | 1789 } |
| 1790 | |
| 6205 | 1791 finish_pow_exp(result, x, y, OptoRuntime::Math_DD_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dpow), "POW"); |
| 0 | 1792 |
| 1793 C->set_has_split_ifs(true); // Has chance for split-if optimization | |
| 1794 return true; | |
| 1795 } | |
| 1796 | |
| 1797 //------------------------------runtime_math----------------------------- | |
| 1798 bool LibraryCallKit::runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName) { | |
| 1799 assert(call_type == OptoRuntime::Math_DD_D_Type() || call_type == OptoRuntime::Math_D_D_Type(), | |
| 1800 "must be (DD)D or (D)D type"); | |
| 1801 | |
| 1802 // Inputs | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1803 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
|
1804 Node* b = (call_type == OptoRuntime::Math_DD_D_Type()) ? round_double_node(argument(2)) : NULL; |
| 0 | 1805 |
| 1806 const TypePtr* no_memory_effects = NULL; | |
| 1807 Node* trig = make_runtime_call(RC_LEAF, call_type, funcAddr, funcName, | |
| 1808 no_memory_effects, | |
| 1809 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
|
1810 Node* value = _gvn.transform(new (C) ProjNode(trig, TypeFunc::Parms+0)); |
| 0 | 1811 #ifdef ASSERT |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1812 Node* value_top = _gvn.transform(new (C) ProjNode(trig, TypeFunc::Parms+1)); |
| 0 | 1813 assert(value_top == top(), "second value must be top"); |
| 1814 #endif | |
| 1815 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1816 set_result(value); |
| 0 | 1817 return true; |
| 1818 } | |
| 1819 | |
| 1820 //------------------------------inline_math_native----------------------------- | |
| 1821 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
|
1822 #define FN_PTR(f) CAST_FROM_FN_PTR(address, f) |
| 0 | 1823 switch (id) { |
| 1824 // 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
|
1825 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
|
1826 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
|
1827 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
|
1828 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
|
1829 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
|
1830 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
|
1831 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1832 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
|
1833 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
|
1834 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
|
1835 runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dlog10), "LOG10"); |
| 0 | 1836 |
| 1837 // 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
|
1838 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
|
1839 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
|
1840 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1841 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
|
1842 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
|
1843 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
|
1844 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
|
1845 #undef FN_PTR |
| 0 | 1846 |
| 1847 // These intrinsics are not yet correctly implemented | |
| 1848 case vmIntrinsics::_datan2: | |
| 1849 return false; | |
| 1850 | |
| 1851 default: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
1852 fatal_unexpected_iid(id); |
| 0 | 1853 return false; |
| 1854 } | |
| 1855 } | |
| 1856 | |
| 1857 static bool is_simple_name(Node* n) { | |
| 1858 return (n->req() == 1 // constant | |
| 1859 || (n->is_Type() && n->as_Type()->type()->singleton()) | |
| 1860 || n->is_Proj() // parameter or return value | |
| 1861 || n->is_Phi() // local of some sort | |
| 1862 ); | |
| 1863 } | |
| 1864 | |
| 1865 //----------------------------inline_min_max----------------------------------- | |
| 1866 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
|
1867 set_result(generate_min_max(id, argument(0), argument(1))); |
| 0 | 1868 return true; |
| 1869 } | |
| 1870 | |
| 1871 Node* | |
| 1872 LibraryCallKit::generate_min_max(vmIntrinsics::ID id, Node* x0, Node* y0) { | |
| 1873 // These are the candidate return value: | |
| 1874 Node* xvalue = x0; | |
| 1875 Node* yvalue = y0; | |
| 1876 | |
| 1877 if (xvalue == yvalue) { | |
| 1878 return xvalue; | |
| 1879 } | |
| 1880 | |
| 1881 bool want_max = (id == vmIntrinsics::_max); | |
| 1882 | |
| 1883 const TypeInt* txvalue = _gvn.type(xvalue)->isa_int(); | |
| 1884 const TypeInt* tyvalue = _gvn.type(yvalue)->isa_int(); | |
| 1885 if (txvalue == NULL || tyvalue == NULL) return top(); | |
| 1886 // This is not really necessary, but it is consistent with a | |
| 1887 // hypothetical MaxINode::Value method: | |
| 1888 int widen = MAX2(txvalue->_widen, tyvalue->_widen); | |
| 1889 | |
| 1890 // %%% This folding logic should (ideally) be in a different place. | |
| 1891 // Some should be inside IfNode, and there to be a more reliable | |
| 1892 // transformation of ?: style patterns into cmoves. We also want | |
| 1893 // more powerful optimizations around cmove and min/max. | |
| 1894 | |
| 1895 // Try to find a dominating comparison of these guys. | |
| 1896 // It can simplify the index computation for Arrays.copyOf | |
| 1897 // and similar uses of System.arraycopy. | |
| 1898 // First, compute the normalized version of CmpI(x, y). | |
| 1899 int cmp_op = Op_CmpI; | |
| 1900 Node* xkey = xvalue; | |
| 1901 Node* ykey = yvalue; | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1902 Node* ideal_cmpxy = _gvn.transform( new(C) CmpINode(xkey, ykey) ); |
| 0 | 1903 if (ideal_cmpxy->is_Cmp()) { |
| 1904 // E.g., if we have CmpI(length - offset, count), | |
| 1905 // it might idealize to CmpI(length, count + offset) | |
| 1906 cmp_op = ideal_cmpxy->Opcode(); | |
| 1907 xkey = ideal_cmpxy->in(1); | |
| 1908 ykey = ideal_cmpxy->in(2); | |
| 1909 } | |
| 1910 | |
| 1911 // Start by locating any relevant comparisons. | |
| 1912 Node* start_from = (xkey->outcnt() < ykey->outcnt()) ? xkey : ykey; | |
| 1913 Node* cmpxy = NULL; | |
| 1914 Node* cmpyx = NULL; | |
| 1915 for (DUIterator_Fast kmax, k = start_from->fast_outs(kmax); k < kmax; k++) { | |
| 1916 Node* cmp = start_from->fast_out(k); | |
| 1917 if (cmp->outcnt() > 0 && // must have prior uses | |
| 1918 cmp->in(0) == NULL && // must be context-independent | |
| 1919 cmp->Opcode() == cmp_op) { // right kind of compare | |
| 1920 if (cmp->in(1) == xkey && cmp->in(2) == ykey) cmpxy = cmp; | |
| 1921 if (cmp->in(1) == ykey && cmp->in(2) == xkey) cmpyx = cmp; | |
| 1922 } | |
| 1923 } | |
| 1924 | |
| 1925 const int NCMPS = 2; | |
| 1926 Node* cmps[NCMPS] = { cmpxy, cmpyx }; | |
| 1927 int cmpn; | |
| 1928 for (cmpn = 0; cmpn < NCMPS; cmpn++) { | |
| 1929 if (cmps[cmpn] != NULL) break; // find a result | |
| 1930 } | |
| 1931 if (cmpn < NCMPS) { | |
| 1932 // Look for a dominating test that tells us the min and max. | |
| 1933 int depth = 0; // Limit search depth for speed | |
| 1934 Node* dom = control(); | |
| 1935 for (; dom != NULL; dom = IfNode::up_one_dom(dom, true)) { | |
| 1936 if (++depth >= 100) break; | |
| 1937 Node* ifproj = dom; | |
| 1938 if (!ifproj->is_Proj()) continue; | |
| 1939 Node* iff = ifproj->in(0); | |
| 1940 if (!iff->is_If()) continue; | |
| 1941 Node* bol = iff->in(1); | |
| 1942 if (!bol->is_Bool()) continue; | |
| 1943 Node* cmp = bol->in(1); | |
| 1944 if (cmp == NULL) continue; | |
| 1945 for (cmpn = 0; cmpn < NCMPS; cmpn++) | |
| 1946 if (cmps[cmpn] == cmp) break; | |
| 1947 if (cmpn == NCMPS) continue; | |
| 1948 BoolTest::mask btest = bol->as_Bool()->_test._test; | |
| 1949 if (ifproj->is_IfFalse()) btest = BoolTest(btest).negate(); | |
| 1950 if (cmp->in(1) == ykey) btest = BoolTest(btest).commute(); | |
| 1951 // At this point, we know that 'x btest y' is true. | |
| 1952 switch (btest) { | |
| 1953 case BoolTest::eq: | |
| 1954 // They are proven equal, so we can collapse the min/max. | |
| 1955 // Either value is the answer. Choose the simpler. | |
| 1956 if (is_simple_name(yvalue) && !is_simple_name(xvalue)) | |
| 1957 return yvalue; | |
| 1958 return xvalue; | |
| 1959 case BoolTest::lt: // x < y | |
| 1960 case BoolTest::le: // x <= y | |
| 1961 return (want_max ? yvalue : xvalue); | |
| 1962 case BoolTest::gt: // x > y | |
| 1963 case BoolTest::ge: // x >= y | |
| 1964 return (want_max ? xvalue : yvalue); | |
| 1965 } | |
| 1966 } | |
| 1967 } | |
| 1968 | |
| 1969 // We failed to find a dominating test. | |
| 1970 // Let's pick a test that might GVN with prior tests. | |
| 1971 Node* best_bol = NULL; | |
| 1972 BoolTest::mask best_btest = BoolTest::illegal; | |
| 1973 for (cmpn = 0; cmpn < NCMPS; cmpn++) { | |
| 1974 Node* cmp = cmps[cmpn]; | |
| 1975 if (cmp == NULL) continue; | |
| 1976 for (DUIterator_Fast jmax, j = cmp->fast_outs(jmax); j < jmax; j++) { | |
| 1977 Node* bol = cmp->fast_out(j); | |
| 1978 if (!bol->is_Bool()) continue; | |
| 1979 BoolTest::mask btest = bol->as_Bool()->_test._test; | |
| 1980 if (btest == BoolTest::eq || btest == BoolTest::ne) continue; | |
| 1981 if (cmp->in(1) == ykey) btest = BoolTest(btest).commute(); | |
| 1982 if (bol->outcnt() > (best_bol == NULL ? 0 : best_bol->outcnt())) { | |
| 1983 best_bol = bol->as_Bool(); | |
| 1984 best_btest = btest; | |
| 1985 } | |
| 1986 } | |
| 1987 } | |
| 1988 | |
| 1989 Node* answer_if_true = NULL; | |
| 1990 Node* answer_if_false = NULL; | |
| 1991 switch (best_btest) { | |
| 1992 default: | |
| 1993 if (cmpxy == NULL) | |
| 1994 cmpxy = ideal_cmpxy; | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1995 best_bol = _gvn.transform( new(C) BoolNode(cmpxy, BoolTest::lt) ); |
| 0 | 1996 // and fall through: |
| 1997 case BoolTest::lt: // x < y | |
| 1998 case BoolTest::le: // x <= y | |
| 1999 answer_if_true = (want_max ? yvalue : xvalue); | |
| 2000 answer_if_false = (want_max ? xvalue : yvalue); | |
| 2001 break; | |
| 2002 case BoolTest::gt: // x > y | |
| 2003 case BoolTest::ge: // x >= y | |
| 2004 answer_if_true = (want_max ? xvalue : yvalue); | |
| 2005 answer_if_false = (want_max ? yvalue : xvalue); | |
| 2006 break; | |
| 2007 } | |
| 2008 | |
| 2009 jint hi, lo; | |
| 2010 if (want_max) { | |
| 2011 // We can sharpen the minimum. | |
| 2012 hi = MAX2(txvalue->_hi, tyvalue->_hi); | |
| 2013 lo = MAX2(txvalue->_lo, tyvalue->_lo); | |
| 2014 } else { | |
| 2015 // We can sharpen the maximum. | |
| 2016 hi = MIN2(txvalue->_hi, tyvalue->_hi); | |
| 2017 lo = MIN2(txvalue->_lo, tyvalue->_lo); | |
| 2018 } | |
| 2019 | |
| 2020 // Use a flow-free graph structure, to avoid creating excess control edges | |
| 2021 // which could hinder other optimizations. | |
| 2022 // Since Math.min/max is often used with arraycopy, we want | |
| 2023 // tightly_coupled_allocation to be able to see beyond min/max expressions. | |
| 2024 Node* cmov = CMoveNode::make(C, NULL, best_bol, | |
| 2025 answer_if_false, answer_if_true, | |
| 2026 TypeInt::make(lo, hi, widen)); | |
| 2027 | |
| 2028 return _gvn.transform(cmov); | |
| 2029 | |
| 2030 /* | |
| 2031 // This is not as desirable as it may seem, since Min and Max | |
| 2032 // nodes do not have a full set of optimizations. | |
| 2033 // And they would interfere, anyway, with 'if' optimizations | |
| 2034 // and with CMoveI canonical forms. | |
| 2035 switch (id) { | |
| 2036 case vmIntrinsics::_min: | |
| 2037 result_val = _gvn.transform(new (C, 3) MinINode(x,y)); break; | |
| 2038 case vmIntrinsics::_max: | |
| 2039 result_val = _gvn.transform(new (C, 3) MaxINode(x,y)); break; | |
| 2040 default: | |
| 2041 ShouldNotReachHere(); | |
| 2042 } | |
| 2043 */ | |
| 2044 } | |
| 2045 | |
| 2046 inline int | |
| 2047 LibraryCallKit::classify_unsafe_addr(Node* &base, Node* &offset) { | |
| 2048 const TypePtr* base_type = TypePtr::NULL_PTR; | |
| 2049 if (base != NULL) base_type = _gvn.type(base)->isa_ptr(); | |
| 2050 if (base_type == NULL) { | |
| 2051 // Unknown type. | |
| 2052 return Type::AnyPtr; | |
| 2053 } else if (base_type == TypePtr::NULL_PTR) { | |
| 2054 // Since this is a NULL+long form, we have to switch to a rawptr. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2055 base = _gvn.transform( new (C) CastX2PNode(offset) ); |
| 0 | 2056 offset = MakeConX(0); |
| 2057 return Type::RawPtr; | |
| 2058 } else if (base_type->base() == Type::RawPtr) { | |
| 2059 return Type::RawPtr; | |
| 2060 } else if (base_type->isa_oopptr()) { | |
| 2061 // Base is never null => always a heap address. | |
| 2062 if (base_type->ptr() == TypePtr::NotNull) { | |
| 2063 return Type::OopPtr; | |
| 2064 } | |
| 2065 // Offset is small => always a heap address. | |
| 2066 const TypeX* offset_type = _gvn.type(offset)->isa_intptr_t(); | |
| 2067 if (offset_type != NULL && | |
| 2068 base_type->offset() == 0 && // (should always be?) | |
| 2069 offset_type->_lo >= 0 && | |
| 2070 !MacroAssembler::needs_explicit_null_check(offset_type->_hi)) { | |
| 2071 return Type::OopPtr; | |
| 2072 } | |
| 2073 // Otherwise, it might either be oop+off or NULL+addr. | |
| 2074 return Type::AnyPtr; | |
| 2075 } else { | |
| 2076 // No information: | |
| 2077 return Type::AnyPtr; | |
| 2078 } | |
| 2079 } | |
| 2080 | |
| 2081 inline Node* LibraryCallKit::make_unsafe_address(Node* base, Node* offset) { | |
| 2082 int kind = classify_unsafe_addr(base, offset); | |
| 2083 if (kind == Type::RawPtr) { | |
| 2084 return basic_plus_adr(top(), base, offset); | |
| 2085 } else { | |
| 2086 return basic_plus_adr(base, offset); | |
| 2087 } | |
| 2088 } | |
| 2089 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2090 //--------------------------inline_number_methods----------------------------- |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2091 // inline int Integer.numberOfLeadingZeros(int) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2092 // inline int Long.numberOfLeadingZeros(long) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2093 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2094 // inline int Integer.numberOfTrailingZeros(int) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2095 // inline int Long.numberOfTrailingZeros(long) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2096 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2097 // inline int Integer.bitCount(int) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2098 // inline int Long.bitCount(long) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2099 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2100 // inline char Character.reverseBytes(char) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2101 // inline short Short.reverseBytes(short) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2102 // inline int Integer.reverseBytes(int) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2103 // inline long Long.reverseBytes(long) |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2104 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
|
2105 Node* arg = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2106 Node* n; |
|
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
2107 switch (id) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2108 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
|
2109 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
|
2110 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
|
2111 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
|
2112 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
|
2113 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
|
2114 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
|
2115 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
|
2116 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
|
2117 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
|
2118 default: fatal_unexpected_iid(id); break; |
|
775
93c14e5562c4
6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents:
730
diff
changeset
|
2119 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2120 set_result(_gvn.transform(n)); |
| 0 | 2121 return true; |
| 2122 } | |
| 2123 | |
| 2124 //----------------------------inline_unsafe_access---------------------------- | |
| 2125 | |
| 2126 const static BasicType T_ADDRESS_HOLDER = T_LONG; | |
| 2127 | |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2128 // 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
|
2129 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
|
2130 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
|
2131 // 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
|
2132 // 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
|
2133 // 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
|
2134 // 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
|
2135 // 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
|
2136 // 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
|
2137 if (!UseG1GC && !need_mem_bar) |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2138 return; |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2139 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2140 // Some compile time checks. |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2141 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2142 // 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
|
2143 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
|
2144 if (otype != NULL && otype->is_con() && |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2145 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
|
2146 // 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
|
2147 return; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2148 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2149 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2150 // 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
|
2151 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
|
2152 if (btype != NULL) { |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2153 if (btype->isa_aryptr()) { |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2154 // Array type so nothing to do |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2155 return; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2156 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2157 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2158 const TypeInstPtr* itype = btype->isa_instptr(); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2159 if (itype != NULL) { |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2160 // 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
|
2161 // _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
|
2162 ciKlass* klass = itype->klass(); |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2163 if ( klass->is_loaded() && |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2164 !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
|
2165 !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
|
2166 return; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2167 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2168 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2169 } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2170 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2171 // 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
|
2172 // 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
|
2173 // |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2174 // 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
|
2175 // 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
|
2176 // pre_barrier(_, pre_val, ...); |
|
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 // } |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2179 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2180 float likely = PROB_LIKELY( 0.999); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2181 float unlikely = PROB_UNLIKELY(0.999); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2182 |
| 3255 | 2183 IdealKit ideal(this); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2184 #define __ ideal. |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2185 |
|
3254
59766fd005ff
7035117: G1: nsk/stress/jni/jnistress002 fails with assertion failure
johnc
parents:
3252
diff
changeset
|
2186 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
|
2187 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2188 __ 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
|
2189 // Update graphKit memory and control from IdealKit. |
| 3255 | 2190 sync_kit(ideal); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2191 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2192 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
|
2193 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
|
2194 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2195 // Update IdealKit memory and control from graphKit. |
| 3255 | 2196 __ sync_kit(this); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2197 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2198 Node* one = __ ConI(1); |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2199 // 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
|
2200 __ 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
|
2201 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2202 // Update graphKit from IdeakKit. |
| 3255 | 2203 sync_kit(ideal); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2204 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2205 // 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
|
2206 pre_barrier(false /* do_load */, |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2207 __ ctrl(), |
|
3258
edd9b016deb6
7036021: G1: build failure on win64 and linux with hs21 in jdk6 build environment
johnc
parents:
3255
diff
changeset
|
2208 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
|
2209 pre_val /* pre_val */, |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2210 T_OBJECT); |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2211 if (need_mem_bar) { |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2212 // 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
|
2213 // 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
|
2214 insert_mem_bar(Op_MemBarCPUOrder); |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
2215 } |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2216 // Update IdealKit from graphKit. |
| 3255 | 2217 __ sync_kit(this); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2218 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2219 } __ end_if(); // _ref_type != ref_none |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2220 } __ end_if(); // offset == referent_offset |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2221 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2222 // Final sync IdealKit and GraphKit. |
| 3255 | 2223 final_sync(ideal); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2224 #undef __ |
|
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 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2227 |
| 0 | 2228 // Interpret Unsafe.fieldOffset cookies correctly: |
| 2229 extern jlong Unsafe_field_offset_to_byte_offset(jlong field_offset); | |
| 2230 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2231 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
|
2232 // Attempt to infer a sharper value type from the offset and base type. |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2233 ciKlass* sharpened_klass = NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2234 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2235 // See if it is an instance field, with an object type. |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2236 if (alias_type->field() != NULL) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2237 assert(!is_native_ptr, "native pointer op cannot use a java address"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2238 if (alias_type->field()->type()->is_klass()) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2239 sharpened_klass = alias_type->field()->type()->as_klass(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2240 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2241 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2242 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2243 // See if it is a narrow oop array. |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2244 if (adr_type->isa_aryptr()) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2245 if (adr_type->offset() >= objArrayOopDesc::base_offset_in_bytes()) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2246 const TypeOopPtr *elem_type = adr_type->is_aryptr()->elem()->isa_oopptr(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2247 if (elem_type != NULL) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2248 sharpened_klass = elem_type->klass(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2249 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2250 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2251 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2252 |
|
6847
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2253 // 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
|
2254 // contraint in place. |
|
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2255 if (sharpened_klass != NULL && sharpened_klass->is_loaded()) { |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2256 const TypeOopPtr* tjp = TypeOopPtr::make_from_klass(sharpened_klass); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2257 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2258 #ifndef PRODUCT |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2259 if (PrintIntrinsics || PrintInlining || PrintOptoInlining) { |
|
6847
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2260 tty->print(" from base type: "); adr_type->dump(); |
|
65d07d9ee446
8000263: JSR 292: signature types may appear to be unloaded
twisti
parents:
6804
diff
changeset
|
2261 tty->print(" sharpened value: "); tjp->dump(); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2262 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2263 #endif |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2264 // Sharpen the value type. |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2265 return tjp; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2266 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2267 return NULL; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2268 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2269 |
| 0 | 2270 bool LibraryCallKit::inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile) { |
| 2271 if (callee()->is_static()) return false; // caller must have the capability! | |
| 2272 | |
| 2273 #ifndef PRODUCT | |
| 2274 { | |
| 2275 ResourceMark rm; | |
| 2276 // Check the signatures. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2277 ciSignature* sig = callee()->signature(); |
| 0 | 2278 #ifdef ASSERT |
| 2279 if (!is_store) { | |
| 2280 // Object getObject(Object base, int/long offset), etc. | |
| 2281 BasicType rtype = sig->return_type()->basic_type(); | |
| 2282 if (rtype == T_ADDRESS_HOLDER && callee()->name() == ciSymbol::getAddress_name()) | |
| 2283 rtype = T_ADDRESS; // it is really a C void* | |
| 2284 assert(rtype == type, "getter must return the expected value"); | |
| 2285 if (!is_native_ptr) { | |
| 2286 assert(sig->count() == 2, "oop getter has 2 arguments"); | |
| 2287 assert(sig->type_at(0)->basic_type() == T_OBJECT, "getter base is object"); | |
| 2288 assert(sig->type_at(1)->basic_type() == T_LONG, "getter offset is correct"); | |
| 2289 } else { | |
| 2290 assert(sig->count() == 1, "native getter has 1 argument"); | |
| 2291 assert(sig->type_at(0)->basic_type() == T_LONG, "getter base is long"); | |
| 2292 } | |
| 2293 } else { | |
| 2294 // void putObject(Object base, int/long offset, Object x), etc. | |
| 2295 assert(sig->return_type()->basic_type() == T_VOID, "putter must not return a value"); | |
| 2296 if (!is_native_ptr) { | |
| 2297 assert(sig->count() == 3, "oop putter has 3 arguments"); | |
| 2298 assert(sig->type_at(0)->basic_type() == T_OBJECT, "putter base is object"); | |
| 2299 assert(sig->type_at(1)->basic_type() == T_LONG, "putter offset is correct"); | |
| 2300 } else { | |
| 2301 assert(sig->count() == 2, "native putter has 2 arguments"); | |
| 2302 assert(sig->type_at(0)->basic_type() == T_LONG, "putter base is long"); | |
| 2303 } | |
| 2304 BasicType vtype = sig->type_at(sig->count()-1)->basic_type(); | |
| 2305 if (vtype == T_ADDRESS_HOLDER && callee()->name() == ciSymbol::putAddress_name()) | |
| 2306 vtype = T_ADDRESS; // it is really a C void* | |
| 2307 assert(vtype == type, "putter must accept the expected value"); | |
| 2308 } | |
| 2309 #endif // ASSERT | |
| 2310 } | |
| 2311 #endif //PRODUCT | |
| 2312 | |
| 2313 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
| 2314 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2315 Node* receiver = argument(0); // type: oop |
| 0 | 2316 |
| 2317 // 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
|
2318 Node* adr; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2319 Node* heap_base_oop = top(); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2320 Node* offset = top(); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2321 Node* val; |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2322 |
| 0 | 2323 if (!is_native_ptr) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2324 // 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
|
2325 Node* base = argument(1); // type: oop |
| 0 | 2326 // 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
|
2327 offset = argument(2); // type: long |
| 0 | 2328 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset |
| 2329 // to be plain byte offsets, which are also the same as those accepted | |
| 2330 // by oopDesc::field_base. | |
| 2331 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
| 2332 "fieldOffset must be byte-scaled"); | |
| 2333 // 32-bit machines ignore the high half! | |
| 2334 offset = ConvL2X(offset); | |
| 2335 adr = make_unsafe_address(base, offset); | |
| 2336 heap_base_oop = base; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2337 val = is_store ? argument(4) : NULL; |
| 0 | 2338 } else { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2339 Node* ptr = argument(1); // type: long |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2340 ptr = ConvL2X(ptr); // adjust Java long to machine word |
| 0 | 2341 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
|
2342 val = is_store ? argument(3) : NULL; |
| 0 | 2343 } |
| 2344 | |
| 2345 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
| 2346 | |
| 2347 // First guess at the value type. | |
| 2348 const Type *value_type = Type::get_const_basic_type(type); | |
| 2349 | |
| 2350 // Try to categorize the address. If it comes up as TypeJavaPtr::BOTTOM, | |
| 2351 // there was not enough information to nail it down. | |
| 2352 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
| 2353 assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here"); | |
| 2354 | |
| 2355 // We will need memory barriers unless we can determine a unique | |
| 2356 // alias category for this reference. (Note: If for some reason | |
| 2357 // the barriers get omitted and the unsafe reference begins to "pollute" | |
| 2358 // the alias analysis of the rest of the graph, either Compile::can_alias | |
| 2359 // or Compile::must_alias will throw a diagnostic assert.) | |
| 2360 bool need_mem_bar = (alias_type->adr_type() == TypeOopPtr::BOTTOM); | |
| 2361 | |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2362 // 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
|
2363 // 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
|
2364 // 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
|
2365 // 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
|
2366 // 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
|
2367 // 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
|
2368 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
|
2369 offset != top() && heap_base_oop != top(); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2370 |
| 0 | 2371 if (!is_store && type == T_OBJECT) { |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2372 const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type, is_native_ptr); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2373 if (tjp != NULL) { |
| 0 | 2374 value_type = tjp; |
| 2375 } | |
| 2376 } | |
| 2377 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2378 receiver = null_check(receiver); |
| 0 | 2379 if (stopped()) { |
| 2380 return true; | |
| 2381 } | |
| 2382 // Heap pointers get a null-check from the interpreter, | |
| 2383 // as a courtesy. However, this is not guaranteed by Unsafe, | |
| 2384 // and it is not possible to fully distinguish unintended nulls | |
| 2385 // from intended ones in this API. | |
| 2386 | |
| 2387 if (is_volatile) { | |
| 2388 // We need to emit leading and trailing CPU membars (see below) in | |
| 2389 // addition to memory membars when is_volatile. This is a little | |
| 2390 // too strong, but avoids the need to insert per-alias-type | |
| 2391 // volatile membars (for stores; compare Parse::do_put_xxx), which | |
| 605 | 2392 // we cannot do effectively here because we probably only have a |
| 0 | 2393 // rough approximation of type. |
| 2394 need_mem_bar = true; | |
| 2395 // For Stores, place a memory ordering barrier now. | |
| 2396 if (is_store) | |
| 2397 insert_mem_bar(Op_MemBarRelease); | |
| 2398 } | |
| 2399 | |
| 2400 // Memory barrier to prevent normal and 'unsafe' accesses from | |
| 2401 // bypassing each other. Happens after null checks, so the | |
| 2402 // exception paths do not take memory state from the memory barrier, | |
| 2403 // so there's no problems making a strong assert about mixing users | |
| 2404 // of safe & unsafe memory. Otherwise fails in a CTW of rt.jar | |
| 2405 // around 5701, class sun/reflect/UnsafeBooleanFieldAccessorImpl. | |
| 2406 if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder); | |
| 2407 | |
| 2408 if (!is_store) { | |
| 2409 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
|
2410 // load value |
| 0 | 2411 switch (type) { |
| 2412 case T_BOOLEAN: | |
| 2413 case T_CHAR: | |
| 2414 case T_BYTE: | |
| 2415 case T_SHORT: | |
| 2416 case T_INT: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2417 case T_LONG: |
| 0 | 2418 case T_FLOAT: |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2419 case T_DOUBLE: |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2420 break; |
| 0 | 2421 case T_OBJECT: |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2422 if (need_read_barrier) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2423 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
|
2424 } |
| 0 | 2425 break; |
| 2426 case T_ADDRESS: | |
| 2427 // Cast to an int type. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2428 p = _gvn.transform(new (C) CastP2XNode(NULL, p)); |
| 0 | 2429 p = ConvX2L(p); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2430 break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2431 default: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2432 fatal(err_msg_res("unexpected type %d: %s", type, type2name(type))); |
| 0 | 2433 break; |
| 2434 } | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2435 // 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
|
2436 // 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
|
2437 // 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
|
2438 // point is fine. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2439 set_result(p); |
| 0 | 2440 } else { |
| 2441 // place effect of store into memory | |
| 2442 switch (type) { | |
| 2443 case T_DOUBLE: | |
| 2444 val = dstore_rounding(val); | |
| 2445 break; | |
| 2446 case T_ADDRESS: | |
| 2447 // Repackage the long as a pointer. | |
| 2448 val = ConvL2X(val); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2449 val = _gvn.transform( new (C) CastX2PNode(val) ); |
| 0 | 2450 break; |
| 2451 } | |
| 2452 | |
| 2453 if (type != T_OBJECT ) { | |
| 2454 (void) store_to_memory(control(), adr, val, type, adr_type, is_volatile); | |
| 2455 } else { | |
| 2456 // Possibly an oop being stored to Java heap or native memory | |
| 2457 if (!TypePtr::NULL_PTR->higher_equal(_gvn.type(heap_base_oop))) { | |
| 2458 // oop to Java heap. | |
| 825 | 2459 (void) store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type); |
| 0 | 2460 } else { |
| 2461 // We can't tell at compile time if we are storing in the Java heap or outside | |
| 2462 // of it. So we need to emit code to conditionally do the proper type of | |
| 2463 // store. | |
| 2464 | |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2465 IdealKit ideal(this); |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2466 #define __ ideal. |
| 0 | 2467 // QQQ who knows what probability is here?? |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2468 __ 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
|
2469 // Sync IdealKit and graphKit. |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2470 sync_kit(ideal); |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2471 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
|
2472 // Update IdealKit memory. |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2473 __ sync_kit(this); |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2474 } __ else_(); { |
|
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2475 __ 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
|
2476 } __ end_if(); |
|
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2477 // Final sync IdealKit and GraphKit. |
|
2444
07acc51c1d2a
7032314: Allow to generate CallLeafNoFPNode in IdealKit
kvn
parents:
2405
diff
changeset
|
2478 final_sync(ideal); |
|
851
fc4be448891f
6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents:
836
diff
changeset
|
2479 #undef __ |
| 0 | 2480 } |
| 2481 } | |
| 2482 } | |
| 2483 | |
| 2484 if (is_volatile) { | |
| 2485 if (!is_store) | |
| 2486 insert_mem_bar(Op_MemBarAcquire); | |
| 2487 else | |
| 2488 insert_mem_bar(Op_MemBarVolatile); | |
| 2489 } | |
| 2490 | |
| 2491 if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder); | |
| 2492 | |
| 2493 return true; | |
| 2494 } | |
| 2495 | |
| 2496 //----------------------------inline_unsafe_prefetch---------------------------- | |
| 2497 | |
| 2498 bool LibraryCallKit::inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static) { | |
| 2499 #ifndef PRODUCT | |
| 2500 { | |
| 2501 ResourceMark rm; | |
| 2502 // Check the signatures. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2503 ciSignature* sig = callee()->signature(); |
| 0 | 2504 #ifdef ASSERT |
| 2505 // Object getObject(Object base, int/long offset), etc. | |
| 2506 BasicType rtype = sig->return_type()->basic_type(); | |
| 2507 if (!is_native_ptr) { | |
| 2508 assert(sig->count() == 2, "oop prefetch has 2 arguments"); | |
| 2509 assert(sig->type_at(0)->basic_type() == T_OBJECT, "prefetch base is object"); | |
| 2510 assert(sig->type_at(1)->basic_type() == T_LONG, "prefetcha offset is correct"); | |
| 2511 } else { | |
| 2512 assert(sig->count() == 1, "native prefetch has 1 argument"); | |
| 2513 assert(sig->type_at(0)->basic_type() == T_LONG, "prefetch base is long"); | |
| 2514 } | |
| 2515 #endif // ASSERT | |
| 2516 } | |
| 2517 #endif // !PRODUCT | |
| 2518 | |
| 2519 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
| 2520 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2521 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
|
2522 if (!is_static) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2523 null_check_receiver(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2524 if (stopped()) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2525 return true; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2526 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2527 } |
| 0 | 2528 |
| 2529 // Build address expression. See the code in inline_unsafe_access. | |
| 2530 Node *adr; | |
| 2531 if (!is_native_ptr) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2532 // 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
|
2533 Node* base = argument(idx + 0); // type: oop |
| 0 | 2534 // 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
|
2535 Node* offset = argument(idx + 1); // type: long |
| 0 | 2536 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset |
| 2537 // to be plain byte offsets, which are also the same as those accepted | |
| 2538 // by oopDesc::field_base. | |
| 2539 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
| 2540 "fieldOffset must be byte-scaled"); | |
| 2541 // 32-bit machines ignore the high half! | |
| 2542 offset = ConvL2X(offset); | |
| 2543 adr = make_unsafe_address(base, offset); | |
| 2544 } else { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2545 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
|
2546 ptr = ConvL2X(ptr); // adjust Java long to machine word |
| 0 | 2547 adr = make_unsafe_address(NULL, ptr); |
| 2548 } | |
| 2549 | |
| 2550 // Generate the read or write prefetch | |
| 2551 Node *prefetch; | |
| 2552 if (is_store) { | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2553 prefetch = new (C) PrefetchWriteNode(i_o(), adr); |
| 0 | 2554 } else { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2555 prefetch = new (C) PrefetchReadNode(i_o(), adr); |
| 0 | 2556 } |
| 2557 prefetch->init_req(0, control()); | |
| 2558 set_i_o(_gvn.transform(prefetch)); | |
| 2559 | |
| 2560 return true; | |
| 2561 } | |
| 2562 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2563 //----------------------------inline_unsafe_load_store---------------------------- |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2564 // 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
|
2565 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2566 // LS_cmpxchg: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2567 // 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
|
2568 // 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
|
2569 // 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
|
2570 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2571 // LS_xadd: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2572 // 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
|
2573 // 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
|
2574 // |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2575 // LS_xchg: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2576 // 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
|
2577 // 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
|
2578 // 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
|
2579 // |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2580 bool LibraryCallKit::inline_unsafe_load_store(BasicType type, LoadStoreKind kind) { |
| 0 | 2581 // This basic scheme here is the same as inline_unsafe_access, but |
| 2582 // differs in enough details that combining them would make the code | |
| 2583 // overly confusing. (This is a true fact! I originally combined | |
| 2584 // them, but even I was confused by it!) As much code/comments as | |
| 2585 // possible are retained from inline_unsafe_access though to make | |
| 605 | 2586 // the correspondences clearer. - dl |
| 0 | 2587 |
| 2588 if (callee()->is_static()) return false; // caller must have the capability! | |
| 2589 | |
| 2590 #ifndef PRODUCT | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2591 BasicType rtype; |
| 0 | 2592 { |
| 2593 ResourceMark rm; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2594 // Check the signatures. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2595 ciSignature* sig = callee()->signature(); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2596 rtype = sig->return_type()->basic_type(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2597 if (kind == LS_xadd || kind == LS_xchg) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2598 // Check the signatures. |
| 0 | 2599 #ifdef ASSERT |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2600 assert(rtype == type, "get and set must return the expected type"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2601 assert(sig->count() == 3, "get and set has 3 arguments"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2602 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
|
2603 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
|
2604 assert(sig->type_at(2)->basic_type() == type, "get and set must take expected type as new value/delta"); |
| 0 | 2605 #endif // ASSERT |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2606 } else if (kind == LS_cmpxchg) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2607 // Check the signatures. |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2608 #ifdef ASSERT |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2609 assert(rtype == T_BOOLEAN, "CAS must return boolean"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2610 assert(sig->count() == 4, "CAS has 4 arguments"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2611 assert(sig->type_at(0)->basic_type() == T_OBJECT, "CAS base is object"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2612 assert(sig->type_at(1)->basic_type() == T_LONG, "CAS offset is long"); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2613 #endif // ASSERT |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2614 } else { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2615 ShouldNotReachHere(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2616 } |
| 0 | 2617 } |
| 2618 #endif //PRODUCT | |
| 2619 | |
| 2620 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
| 2621 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2622 // Get arguments: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2623 Node* receiver = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2624 Node* base = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2625 Node* offset = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2626 Node* oldval = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2627 Node* newval = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2628 if (kind == LS_cmpxchg) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2629 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
|
2630 receiver = argument(0); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2631 base = argument(1); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2632 offset = argument(2); // type: long |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2633 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
|
2634 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
|
2635 } 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
|
2636 receiver = argument(0); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2637 base = argument(1); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2638 offset = argument(2); // type: long |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2639 oldval = NULL; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2640 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
|
2641 } |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2642 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2643 // Null check receiver. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2644 receiver = null_check(receiver); |
| 0 | 2645 if (stopped()) { |
| 2646 return true; | |
| 2647 } | |
| 2648 | |
| 2649 // Build field offset expression. | |
| 2650 // We currently rely on the cookies produced by Unsafe.xxxFieldOffset | |
| 2651 // to be plain byte offsets, which are also the same as those accepted | |
| 2652 // by oopDesc::field_base. | |
| 2653 assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled"); | |
| 2654 // 32-bit machines ignore the high half of long offsets | |
| 2655 offset = ConvL2X(offset); | |
| 2656 Node* adr = make_unsafe_address(base, offset); | |
| 2657 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
| 2658 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2659 // For CAS, unlike inline_unsafe_access, there seems no point in |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2660 // trying to refine types. Just use the coarse types here. |
| 0 | 2661 const Type *value_type = Type::get_const_basic_type(type); |
| 2662 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
| 2663 assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here"); | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2664 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2665 if (kind == LS_xchg && type == T_OBJECT) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2666 const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2667 if (tjp != NULL) { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2668 value_type = tjp; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2669 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2670 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2671 |
| 0 | 2672 int alias_idx = C->get_alias_index(adr_type); |
| 2673 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2674 // Memory-model-wise, a LoadStore acts like a little synchronized |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2675 // block, so needs barriers on each side. These don't translate |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2676 // into actual barriers on most machines, but we still need rest of |
| 0 | 2677 // compiler to respect ordering. |
| 2678 | |
| 2679 insert_mem_bar(Op_MemBarRelease); | |
| 2680 insert_mem_bar(Op_MemBarCPUOrder); | |
| 2681 | |
| 2682 // 4984716: MemBars must be inserted before this | |
| 2683 // memory node in order to avoid a false | |
| 2684 // dependency which will confuse the scheduler. | |
| 2685 Node *mem = memory(alias_idx); | |
| 2686 | |
| 2687 // For now, we handle only those cases that actually exist: ints, | |
| 2688 // longs, and Object. Adding others should be straightforward. | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2689 Node* load_store; |
| 0 | 2690 switch(type) { |
| 2691 case T_INT: | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2692 if (kind == LS_xadd) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2693 load_store = _gvn.transform(new (C) GetAndAddINode(control(), mem, adr, newval, adr_type)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2694 } else if (kind == LS_xchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2695 load_store = _gvn.transform(new (C) GetAndSetINode(control(), mem, adr, newval, adr_type)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2696 } else if (kind == LS_cmpxchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2697 load_store = _gvn.transform(new (C) CompareAndSwapINode(control(), mem, adr, newval, oldval)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2698 } else { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2699 ShouldNotReachHere(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2700 } |
| 0 | 2701 break; |
| 2702 case T_LONG: | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2703 if (kind == LS_xadd) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2704 load_store = _gvn.transform(new (C) GetAndAddLNode(control(), mem, adr, newval, adr_type)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2705 } else if (kind == LS_xchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2706 load_store = _gvn.transform(new (C) GetAndSetLNode(control(), mem, adr, newval, adr_type)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2707 } else if (kind == LS_cmpxchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2708 load_store = _gvn.transform(new (C) CompareAndSwapLNode(control(), mem, adr, newval, oldval)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2709 } else { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2710 ShouldNotReachHere(); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2711 } |
| 0 | 2712 break; |
| 2713 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
|
2714 // 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
|
2715 // 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
|
2716 // 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
|
2717 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
|
2718 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
|
2719 |
|
b9bc6cae88f2
7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes
kvn
parents:
4778
diff
changeset
|
2720 // Reference stores need a store barrier. |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2721 pre_barrier(true /* do_load*/, |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2722 control(), base, adr, alias_idx, newval, value_type->make_oopptr(), |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2723 NULL /* pre_val*/, |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
2724 T_OBJECT); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
2725 #ifdef _LP64 |
| 163 | 2726 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
|
2727 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
|
2728 if (kind == LS_xchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2729 load_store = _gvn.transform(new (C) GetAndSetNNode(control(), mem, adr, |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2730 newval_enc, adr_type, value_type->make_narrowoop())); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2731 } else { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2732 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
|
2733 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
|
2734 load_store = _gvn.transform(new (C) CompareAndSwapNNode(control(), mem, adr, |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2735 newval_enc, oldval_enc)); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2736 } |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
2737 } else |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
2738 #endif |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
174
diff
changeset
|
2739 { |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2740 if (kind == LS_xchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2741 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
|
2742 } else { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2743 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
|
2744 load_store = _gvn.transform(new (C) CompareAndSwapPNode(control(), mem, adr, newval, oldval)); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2745 } |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
174
diff
changeset
|
2746 } |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2747 post_barrier(control(), load_store, base, adr, alias_idx, newval, T_OBJECT, true); |
| 0 | 2748 break; |
| 2749 default: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2750 fatal(err_msg_res("unexpected type %d: %s", type, type2name(type))); |
| 0 | 2751 break; |
| 2752 } | |
| 2753 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2754 // SCMemProjNodes represent the memory state of a LoadStore. Their |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2755 // main role is to prevent LoadStore nodes from being optimized away |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2756 // when their results aren't used. |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2757 Node* proj = _gvn.transform( new (C) SCMemProjNode(load_store)); |
| 0 | 2758 set_memory(proj, alias_idx); |
| 2759 | |
| 2760 // Add the trailing membar surrounding the access | |
| 2761 insert_mem_bar(Op_MemBarCPUOrder); | |
| 2762 insert_mem_bar(Op_MemBarAcquire); | |
| 2763 | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2764 #ifdef _LP64 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2765 if (type == T_OBJECT && adr->bottom_type()->is_ptr_to_narrowoop() && kind == LS_xchg) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2766 load_store = _gvn.transform(new (C) DecodeNNode(load_store, load_store->bottom_type()->make_ptr())); |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2767 } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2768 #endif |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2769 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6725
diff
changeset
|
2770 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
|
2771 set_result(load_store); |
| 0 | 2772 return true; |
| 2773 } | |
| 2774 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2775 //----------------------------inline_unsafe_ordered_store---------------------- |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2776 // 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
|
2777 // 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
|
2778 // public native void sun.misc.Unsafe.putOrderedLong(Object o, long offset, long x); |
| 0 | 2779 bool LibraryCallKit::inline_unsafe_ordered_store(BasicType type) { |
| 2780 // This is another variant of inline_unsafe_access, differing in | |
| 2781 // that it always issues store-store ("release") barrier and ensures | |
| 2782 // store-atomicity (which only matters for "long"). | |
| 2783 | |
| 2784 if (callee()->is_static()) return false; // caller must have the capability! | |
| 2785 | |
| 2786 #ifndef PRODUCT | |
| 2787 { | |
| 2788 ResourceMark rm; | |
| 2789 // Check the signatures. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2790 ciSignature* sig = callee()->signature(); |
| 0 | 2791 #ifdef ASSERT |
| 2792 BasicType rtype = sig->return_type()->basic_type(); | |
| 2793 assert(rtype == T_VOID, "must return void"); | |
| 2794 assert(sig->count() == 3, "has 3 arguments"); | |
| 2795 assert(sig->type_at(0)->basic_type() == T_OBJECT, "base is object"); | |
| 2796 assert(sig->type_at(1)->basic_type() == T_LONG, "offset is long"); | |
| 2797 #endif // ASSERT | |
| 2798 } | |
| 2799 #endif //PRODUCT | |
| 2800 | |
| 2801 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
| 2802 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2803 // Get arguments: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2804 Node* receiver = argument(0); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2805 Node* base = argument(1); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2806 Node* offset = argument(2); // type: long |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2807 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
|
2808 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2809 // Null check receiver. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2810 receiver = null_check(receiver); |
| 0 | 2811 if (stopped()) { |
| 2812 return true; | |
| 2813 } | |
| 2814 | |
| 2815 // Build field offset expression. | |
| 2816 assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled"); | |
| 2817 // 32-bit machines ignore the high half of long offsets | |
| 2818 offset = ConvL2X(offset); | |
| 2819 Node* adr = make_unsafe_address(base, offset); | |
| 2820 const TypePtr *adr_type = _gvn.type(adr)->isa_ptr(); | |
| 2821 const Type *value_type = Type::get_const_basic_type(type); | |
| 2822 Compile::AliasType* alias_type = C->alias_type(adr_type); | |
| 2823 | |
| 2824 insert_mem_bar(Op_MemBarRelease); | |
| 2825 insert_mem_bar(Op_MemBarCPUOrder); | |
| 2826 // 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
|
2827 const bool require_atomic_access = true; |
| 0 | 2828 Node* store; |
| 2829 if (type == T_OBJECT) // reference stores need a store barrier. | |
| 825 | 2830 store = store_oop_to_unknown(control(), base, adr, adr_type, val, type); |
| 0 | 2831 else { |
| 2832 store = store_to_memory(control(), adr, val, type, adr_type, require_atomic_access); | |
| 2833 } | |
| 2834 insert_mem_bar(Op_MemBarCPUOrder); | |
| 2835 return true; | |
| 2836 } | |
| 2837 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2838 //----------------------------inline_unsafe_allocate--------------------------- |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2839 // public native Object sun.mics.Unsafe.allocateInstance(Class<?> cls); |
| 0 | 2840 bool LibraryCallKit::inline_unsafe_allocate() { |
| 2841 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
|
2842 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2843 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
|
2844 Node* cls = null_check(argument(1)); |
| 0 | 2845 if (stopped()) return true; |
| 2846 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2847 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
|
2848 kls = null_check(kls); |
| 0 | 2849 if (stopped()) return true; // argument was like int.class |
| 2850 | |
| 2851 // Note: The argument might still be an illegal value like | |
| 2852 // Serializable.class or Object[].class. The runtime will handle it. | |
| 2853 // But we must make an explicit check for initialization. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
2854 Node* insp = basic_plus_adr(kls, in_bytes(InstanceKlass::init_state_offset())); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
2855 // Use T_BOOLEAN for InstanceKlass::_init_state so the compiler |
|
4739
52b5d32fbfaf
7117052: instanceKlass::_init_state can be u1 type
coleenp
parents:
3961
diff
changeset
|
2856 // can generate code to load it as unsigned byte. |
|
52b5d32fbfaf
7117052: instanceKlass::_init_state can be u1 type
coleenp
parents:
3961
diff
changeset
|
2857 Node* inst = make_load(NULL, insp, TypeInt::UBYTE, T_BOOLEAN); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
2858 Node* bits = intcon(InstanceKlass::fully_initialized); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2859 Node* test = _gvn.transform(new (C) SubINode(inst, bits)); |
| 0 | 2860 // The 'test' is non-zero if we need to take a slow path. |
| 2861 | |
| 2862 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
|
2863 set_result(obj); |
| 0 | 2864 return true; |
| 2865 } | |
| 2866 | |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2867 #ifdef TRACE_HAVE_INTRINSICS |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2868 /* |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2869 * oop -> myklass |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2870 * myklass->trace_id |= USED |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2871 * return myklass->trace_id & ~0x3 |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2872 */ |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2873 bool LibraryCallKit::inline_native_classID() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2874 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
|
2875 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
|
2876 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
|
2877 kls = null_check(kls, T_OBJECT); |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2878 ByteSize offset = TRACE_ID_OFFSET; |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2879 Node* insp = basic_plus_adr(kls, in_bytes(offset)); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2880 Node* tvalue = make_load(NULL, insp, TypeLong::LONG, T_LONG); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2881 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
|
2882 Node* andl = _gvn.transform(new (C) AndLNode(tvalue, bits)); |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2883 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
|
2884 Node* orl = _gvn.transform(new (C) OrLNode(tvalue, clsused)); |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2885 |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2886 const TypePtr *adr_type = _gvn.type(insp)->isa_ptr(); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2887 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
|
2888 set_result(andl); |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2889 return true; |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2890 } |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2891 |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2892 bool LibraryCallKit::inline_native_threadID() { |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2893 Node* tls_ptr = NULL; |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2894 Node* cur_thr = generate_current_thread(tls_ptr); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2895 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
|
2896 Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2897 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
|
2898 |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2899 Node* threadid = NULL; |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2900 size_t thread_id_size = OSThread::thread_id_size(); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2901 if (thread_id_size == (size_t) BytesPerLong) { |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2902 threadid = ConvL2I(make_load(control(), p, TypeLong::LONG, T_LONG)); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2903 } else if (thread_id_size == (size_t) BytesPerInt) { |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2904 threadid = make_load(control(), p, TypeInt::INT, T_INT); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2905 } else { |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2906 ShouldNotReachHere(); |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2907 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2908 set_result(threadid); |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2909 return true; |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2910 } |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2911 #endif |
|
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2912 |
| 0 | 2913 //------------------------inline_native_time_funcs-------------- |
| 2914 // inline code for System.currentTimeMillis() and System.nanoTime() | |
| 2915 // these have the same type and signature | |
|
6006
0105f367a14c
7160570: Intrinsification support for tracing framework
rbackman
parents:
5934
diff
changeset
|
2916 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
|
2917 const TypeFunc* tf = OptoRuntime::void_long_Type(); |
| 0 | 2918 const TypePtr* no_memory_effects = NULL; |
| 2919 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
|
2920 Node* value = _gvn.transform(new (C) ProjNode(time, TypeFunc::Parms+0)); |
| 0 | 2921 #ifdef ASSERT |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2922 Node* value_top = _gvn.transform(new (C) ProjNode(time, TypeFunc::Parms+1)); |
| 0 | 2923 assert(value_top == top(), "second value must be top"); |
| 2924 #endif | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2925 set_result(value); |
| 0 | 2926 return true; |
| 2927 } | |
| 2928 | |
| 2929 //------------------------inline_native_currentThread------------------ | |
| 2930 bool LibraryCallKit::inline_native_currentThread() { | |
| 2931 Node* junk = NULL; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2932 set_result(generate_current_thread(junk)); |
| 0 | 2933 return true; |
| 2934 } | |
| 2935 | |
| 2936 //------------------------inline_native_isInterrupted------------------ | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
2937 // private native boolean java.lang.Thread.isInterrupted(boolean ClearInterrupted); |
| 0 | 2938 bool LibraryCallKit::inline_native_isInterrupted() { |
| 2939 // Add a fast path to t.isInterrupted(clear_int): | |
| 2940 // (t == Thread.current() && (!TLS._osthread._interrupted || !clear_int)) | |
| 2941 // ? TLS._osthread._interrupted : /*slow path:*/ t.isInterrupted(clear_int) | |
| 2942 // So, in the common case that the interrupt bit is false, | |
| 2943 // we avoid making a call into the VM. Even if the interrupt bit | |
| 2944 // is true, if the clear_int argument is false, we avoid the VM call. | |
| 2945 // However, if the receiver is not currentThread, we must call the VM, | |
| 2946 // because there must be some locking done around the operation. | |
| 2947 | |
| 2948 // We only go to the fast case code if we pass two guards. | |
| 2949 // 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
|
2950 RegionNode* slow_region = new (C) RegionNode(1); |
| 0 | 2951 record_for_igvn(slow_region); |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2952 RegionNode* result_rgn = new (C) RegionNode(1+3); // fast1, fast2, slow |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2953 PhiNode* result_val = new (C) PhiNode(result_rgn, TypeInt::BOOL); |
| 0 | 2954 enum { no_int_result_path = 1, |
| 2955 no_clear_result_path = 2, | |
| 2956 slow_result_path = 3 | |
| 2957 }; | |
| 2958 | |
| 2959 // (a) Receiving thread must be the current thread. | |
| 2960 Node* rec_thr = argument(0); | |
| 2961 Node* tls_ptr = NULL; | |
| 2962 Node* cur_thr = generate_current_thread(tls_ptr); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2963 Node* cmp_thr = _gvn.transform( new (C) CmpPNode(cur_thr, rec_thr) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2964 Node* bol_thr = _gvn.transform( new (C) BoolNode(cmp_thr, BoolTest::ne) ); |
| 0 | 2965 |
| 2966 bool known_current_thread = (_gvn.type(bol_thr) == TypeInt::ZERO); | |
| 2967 if (!known_current_thread) | |
| 2968 generate_slow_guard(bol_thr, slow_region); | |
| 2969 | |
| 2970 // (b) Interrupt bit on TLS must be false. | |
| 2971 Node* p = basic_plus_adr(top()/*!oop*/, tls_ptr, in_bytes(JavaThread::osthread_offset())); | |
| 2972 Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS); | |
| 2973 p = basic_plus_adr(top()/*!oop*/, osthread, in_bytes(OSThread::interrupted_offset())); | |
|
787
aabd393cf1ee
6772683: Thread.isInterrupted() fails to return true on multiprocessor PC
kvn
parents:
775
diff
changeset
|
2974 // 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
|
2975 Node* int_bit = make_load(control(), p, TypeInt::BOOL, T_INT); |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2976 Node* cmp_bit = _gvn.transform( new (C) CmpINode(int_bit, intcon(0)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2977 Node* bol_bit = _gvn.transform( new (C) BoolNode(cmp_bit, BoolTest::ne) ); |
| 0 | 2978 |
| 2979 IfNode* iff_bit = create_and_map_if(control(), bol_bit, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN); | |
| 2980 | |
| 2981 // First fast path: if (!TLS._interrupted) return false; | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2982 Node* false_bit = _gvn.transform( new (C) IfFalseNode(iff_bit) ); |
| 0 | 2983 result_rgn->init_req(no_int_result_path, false_bit); |
| 2984 result_val->init_req(no_int_result_path, intcon(0)); | |
| 2985 | |
| 2986 // drop through to next case | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2987 set_control( _gvn.transform(new (C) IfTrueNode(iff_bit)) ); |
| 0 | 2988 |
| 2989 // (c) Or, if interrupt bit is set and clear_int is false, use 2nd fast path. | |
| 2990 Node* clr_arg = argument(1); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2991 Node* cmp_arg = _gvn.transform( new (C) CmpINode(clr_arg, intcon(0)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2992 Node* bol_arg = _gvn.transform( new (C) BoolNode(cmp_arg, BoolTest::ne) ); |
| 0 | 2993 IfNode* iff_arg = create_and_map_if(control(), bol_arg, PROB_FAIR, COUNT_UNKNOWN); |
| 2994 | |
| 2995 // Second fast path: ... else if (!clear_int) return true; | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
2996 Node* false_arg = _gvn.transform( new (C) IfFalseNode(iff_arg) ); |
| 0 | 2997 result_rgn->init_req(no_clear_result_path, false_arg); |
| 2998 result_val->init_req(no_clear_result_path, intcon(1)); | |
| 2999 | |
| 3000 // drop through to next case | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3001 set_control( _gvn.transform(new (C) IfTrueNode(iff_arg)) ); |
| 0 | 3002 |
| 3003 // (d) Otherwise, go to the slow path. | |
| 3004 slow_region->add_req(control()); | |
| 3005 set_control( _gvn.transform(slow_region) ); | |
| 3006 | |
| 3007 if (stopped()) { | |
| 3008 // There is no slow path. | |
| 3009 result_rgn->init_req(slow_result_path, top()); | |
| 3010 result_val->init_req(slow_result_path, top()); | |
| 3011 } else { | |
| 3012 // non-virtual because it is a private non-static | |
| 3013 CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_isInterrupted); | |
| 3014 | |
| 3015 Node* slow_val = set_results_for_java_call(slow_call); | |
| 3016 // this->control() comes from set_results_for_java_call | |
| 3017 | |
| 3018 // If we know that the result of the slow call will be true, tell the optimizer! | |
| 3019 if (known_current_thread) slow_val = intcon(1); | |
| 3020 | |
| 3021 Node* fast_io = slow_call->in(TypeFunc::I_O); | |
| 3022 Node* fast_mem = slow_call->in(TypeFunc::Memory); | |
| 3023 // These two phis are pre-filled with copies of of the fast IO and Memory | |
| 3024 Node* io_phi = PhiNode::make(result_rgn, fast_io, Type::ABIO); | |
| 3025 Node* mem_phi = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM); | |
| 3026 | |
| 3027 result_rgn->init_req(slow_result_path, control()); | |
| 3028 io_phi ->init_req(slow_result_path, i_o()); | |
| 3029 mem_phi ->init_req(slow_result_path, reset_memory()); | |
| 3030 result_val->init_req(slow_result_path, slow_val); | |
| 3031 | |
| 3032 set_all_memory( _gvn.transform(mem_phi) ); | |
| 3033 set_i_o( _gvn.transform(io_phi) ); | |
| 3034 } | |
| 3035 | |
| 3036 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
|
3037 set_result(result_rgn, result_val); |
| 0 | 3038 return true; |
| 3039 } | |
| 3040 | |
| 3041 //---------------------------load_mirror_from_klass---------------------------- | |
| 3042 // Given a klass oop, load its java mirror (a java.lang.Class oop). | |
| 3043 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
|
3044 Node* p = basic_plus_adr(klass, in_bytes(Klass::java_mirror_offset())); |
| 0 | 3045 return make_load(NULL, p, TypeInstPtr::MIRROR, T_OBJECT); |
| 3046 } | |
| 3047 | |
| 3048 //-----------------------load_klass_from_mirror_common------------------------- | |
| 3049 // Given a java mirror (a java.lang.Class oop), load its corresponding klass oop. | |
| 3050 // Test the klass oop for null (signifying a primitive Class like Integer.TYPE), | |
| 3051 // and branch to the given path on the region. | |
| 3052 // If never_see_null, take an uncommon trap on null, so we can optimistically | |
| 3053 // compile for the non-null case. | |
| 3054 // If the region is NULL, force never_see_null = true. | |
| 3055 Node* LibraryCallKit::load_klass_from_mirror_common(Node* mirror, | |
| 3056 bool never_see_null, | |
| 3057 RegionNode* region, | |
| 3058 int null_path, | |
| 3059 int offset) { | |
| 3060 if (region == NULL) never_see_null = true; | |
| 3061 Node* p = basic_plus_adr(mirror, offset); | |
| 3062 const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL; | |
|
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
3063 Node* kls = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeRawPtr::BOTTOM, kls_type) ); |
| 0 | 3064 Node* null_ctl = top(); |
| 3065 kls = null_check_oop(kls, &null_ctl, never_see_null); | |
| 3066 if (region != NULL) { | |
| 3067 // Set region->in(null_path) if the mirror is a primitive (e.g, int.class). | |
| 3068 region->init_req(null_path, null_ctl); | |
| 3069 } else { | |
| 3070 assert(null_ctl == top(), "no loose ends"); | |
| 3071 } | |
| 3072 return kls; | |
| 3073 } | |
| 3074 | |
| 3075 //--------------------(inline_native_Class_query helpers)--------------------- | |
| 3076 // Use this for JVM_ACC_INTERFACE, JVM_ACC_IS_CLONEABLE, JVM_ACC_HAS_FINALIZER. | |
| 3077 // Fall through if (mods & mask) == bits, take the guard otherwise. | |
| 3078 Node* LibraryCallKit::generate_access_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region) { | |
| 3079 // Branch around if the given klass has the given modifier bit set. | |
| 3080 // 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
|
3081 Node* modp = basic_plus_adr(kls, in_bytes(Klass::access_flags_offset())); |
| 0 | 3082 Node* mods = make_load(NULL, modp, TypeInt::INT, T_INT); |
| 3083 Node* mask = intcon(modifier_mask); | |
| 3084 Node* bits = intcon(modifier_bits); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3085 Node* mbit = _gvn.transform( new (C) AndINode(mods, mask) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3086 Node* cmp = _gvn.transform( new (C) CmpINode(mbit, bits) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3087 Node* bol = _gvn.transform( new (C) BoolNode(cmp, BoolTest::ne) ); |
| 0 | 3088 return generate_fair_guard(bol, region); |
| 3089 } | |
| 3090 Node* LibraryCallKit::generate_interface_guard(Node* kls, RegionNode* region) { | |
| 3091 return generate_access_flags_guard(kls, JVM_ACC_INTERFACE, 0, region); | |
| 3092 } | |
| 3093 | |
| 3094 //-------------------------inline_native_Class_query------------------- | |
| 3095 bool LibraryCallKit::inline_native_Class_query(vmIntrinsics::ID id) { | |
| 3096 const Type* return_type = TypeInt::BOOL; | |
| 3097 Node* prim_return_value = top(); // what happens if it's a primitive class? | |
| 3098 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
| 3099 bool expect_prim = false; // most of these guys expect to work on refs | |
| 3100 | |
| 3101 enum { _normal_path = 1, _prim_path = 2, PATH_LIMIT }; | |
| 3102 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3103 Node* mirror = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3104 Node* obj = top(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3105 |
| 0 | 3106 switch (id) { |
| 3107 case vmIntrinsics::_isInstance: | |
| 3108 // nothing is an instance of a primitive type | |
| 3109 prim_return_value = intcon(0); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3110 obj = argument(1); |
| 0 | 3111 break; |
| 3112 case vmIntrinsics::_getModifiers: | |
| 3113 prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC); | |
| 3114 assert(is_power_of_2((int)JVM_ACC_WRITTEN_FLAGS+1), "change next line"); | |
| 3115 return_type = TypeInt::make(0, JVM_ACC_WRITTEN_FLAGS, Type::WidenMin); | |
| 3116 break; | |
| 3117 case vmIntrinsics::_isInterface: | |
| 3118 prim_return_value = intcon(0); | |
| 3119 break; | |
| 3120 case vmIntrinsics::_isArray: | |
| 3121 prim_return_value = intcon(0); | |
| 3122 expect_prim = true; // cf. ObjectStreamClass.getClassSignature | |
| 3123 break; | |
| 3124 case vmIntrinsics::_isPrimitive: | |
| 3125 prim_return_value = intcon(1); | |
| 3126 expect_prim = true; // obviously | |
| 3127 break; | |
| 3128 case vmIntrinsics::_getSuperclass: | |
| 3129 prim_return_value = null(); | |
| 3130 return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR); | |
| 3131 break; | |
| 3132 case vmIntrinsics::_getComponentType: | |
| 3133 prim_return_value = null(); | |
| 3134 return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR); | |
| 3135 break; | |
| 3136 case vmIntrinsics::_getClassAccessFlags: | |
| 3137 prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC); | |
| 3138 return_type = TypeInt::INT; // not bool! 6297094 | |
| 3139 break; | |
| 3140 default: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3141 fatal_unexpected_iid(id); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3142 break; |
| 0 | 3143 } |
| 3144 | |
| 3145 const TypeInstPtr* mirror_con = _gvn.type(mirror)->isa_instptr(); | |
| 3146 if (mirror_con == NULL) return false; // cannot happen? | |
| 3147 | |
| 3148 #ifndef PRODUCT | |
| 3149 if (PrintIntrinsics || PrintInlining || PrintOptoInlining) { | |
| 3150 ciType* k = mirror_con->java_mirror_type(); | |
| 3151 if (k) { | |
| 3152 tty->print("Inlining %s on constant Class ", vmIntrinsics::name_at(intrinsic_id())); | |
| 3153 k->print_name(); | |
| 3154 tty->cr(); | |
| 3155 } | |
| 3156 } | |
| 3157 #endif | |
| 3158 | |
| 3159 // 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
|
3160 RegionNode* region = new (C) RegionNode(PATH_LIMIT); |
| 0 | 3161 record_for_igvn(region); |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3162 PhiNode* phi = new (C) PhiNode(region, return_type); |
| 0 | 3163 |
| 3164 // The mirror will never be null of Reflection.getClassAccessFlags, however | |
| 3165 // it may be null for Class.isInstance or Class.getModifiers. Throw a NPE | |
| 3166 // if it is. See bug 4774291. | |
| 3167 | |
| 3168 // For Reflection.getClassAccessFlags(), the null check occurs in | |
| 3169 // the wrong place; see inline_unsafe_access(), above, for a similar | |
| 3170 // situation. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3171 mirror = null_check(mirror); |
| 0 | 3172 // If mirror or obj is dead, only null-path is taken. |
| 3173 if (stopped()) return true; | |
| 3174 | |
| 3175 if (expect_prim) never_see_null = false; // expect nulls (meaning prims) | |
| 3176 | |
| 3177 // Now load the mirror's klass metaobject, and null-check it. | |
| 3178 // 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
|
3179 Node* kls = load_klass_from_mirror(mirror, never_see_null, region, _prim_path); |
| 0 | 3180 // If kls is null, we have a primitive mirror. |
| 3181 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
|
3182 if (stopped()) { set_result(region, phi); return true; } |
| 0 | 3183 |
| 3184 Node* p; // handy temp | |
| 3185 Node* null_ctl; | |
| 3186 | |
| 3187 // Now that we have the non-null klass, we can perform the real query. | |
| 3188 // For constant classes, the query will constant-fold in LoadNode::Value. | |
| 3189 Node* query_value = top(); | |
| 3190 switch (id) { | |
| 3191 case vmIntrinsics::_isInstance: | |
| 3192 // nothing is an instance of a primitive type | |
| 3193 query_value = gen_instanceof(obj, kls); | |
| 3194 break; | |
| 3195 | |
| 3196 case vmIntrinsics::_getModifiers: | |
|
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3197 p = basic_plus_adr(kls, in_bytes(Klass::modifier_flags_offset())); |
| 0 | 3198 query_value = make_load(NULL, p, TypeInt::INT, T_INT); |
| 3199 break; | |
| 3200 | |
| 3201 case vmIntrinsics::_isInterface: | |
| 3202 // (To verify this code sequence, check the asserts in JVM_IsInterface.) | |
| 3203 if (generate_interface_guard(kls, region) != NULL) | |
| 3204 // A guard was added. If the guard is taken, it was an interface. | |
| 3205 phi->add_req(intcon(1)); | |
| 3206 // If we fall through, it's a plain class. | |
| 3207 query_value = intcon(0); | |
| 3208 break; | |
| 3209 | |
| 3210 case vmIntrinsics::_isArray: | |
| 3211 // (To verify this code sequence, check the asserts in JVM_IsArrayClass.) | |
| 3212 if (generate_array_guard(kls, region) != NULL) | |
| 3213 // A guard was added. If the guard is taken, it was an array. | |
| 3214 phi->add_req(intcon(1)); | |
| 3215 // If we fall through, it's a plain class. | |
| 3216 query_value = intcon(0); | |
| 3217 break; | |
| 3218 | |
| 3219 case vmIntrinsics::_isPrimitive: | |
| 3220 query_value = intcon(0); // "normal" path produces false | |
| 3221 break; | |
| 3222 | |
| 3223 case vmIntrinsics::_getSuperclass: | |
| 3224 // The rules here are somewhat unfortunate, but we can still do better | |
| 3225 // with random logic than with a JNI call. | |
| 3226 // Interfaces store null or Object as _super, but must report null. | |
| 3227 // Arrays store an intermediate super as _super, but must report Object. | |
| 3228 // Other types can report the actual _super. | |
| 3229 // (To verify this code sequence, check the asserts in JVM_IsInterface.) | |
| 3230 if (generate_interface_guard(kls, region) != NULL) | |
| 3231 // A guard was added. If the guard is taken, it was an interface. | |
| 3232 phi->add_req(null()); | |
| 3233 if (generate_array_guard(kls, region) != NULL) | |
| 3234 // A guard was added. If the guard is taken, it was an array. | |
| 3235 phi->add_req(makecon(TypeInstPtr::make(env()->Object_klass()->java_mirror()))); | |
| 3236 // 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
|
3237 p = basic_plus_adr(kls, in_bytes(Klass::super_offset())); |
|
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
3238 kls = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeRawPtr::BOTTOM, TypeKlassPtr::OBJECT_OR_NULL) ); |
| 0 | 3239 null_ctl = top(); |
| 3240 kls = null_check_oop(kls, &null_ctl); | |
| 3241 if (null_ctl != top()) { | |
| 3242 // If the guard is taken, Object.superClass is null (both klass and mirror). | |
| 3243 region->add_req(null_ctl); | |
| 3244 phi ->add_req(null()); | |
| 3245 } | |
| 3246 if (!stopped()) { | |
| 3247 query_value = load_mirror_from_klass(kls); | |
| 3248 } | |
| 3249 break; | |
| 3250 | |
| 3251 case vmIntrinsics::_getComponentType: | |
| 3252 if (generate_array_guard(kls, region) != NULL) { | |
| 3253 // Be sure to pin the oop load to the guard edge just created: | |
| 3254 Node* is_array_ctrl = region->in(region->req()-1); | |
|
6831
d8ce2825b193
8000213: NPG: Should have renamed arrayKlass and typeArrayKlass
coleenp
parents:
6804
diff
changeset
|
3255 Node* cma = basic_plus_adr(kls, in_bytes(ArrayKlass::component_mirror_offset())); |
| 0 | 3256 Node* cmo = make_load(is_array_ctrl, cma, TypeInstPtr::MIRROR, T_OBJECT); |
| 3257 phi->add_req(cmo); | |
| 3258 } | |
| 3259 query_value = null(); // non-array case is null | |
| 3260 break; | |
| 3261 | |
| 3262 case vmIntrinsics::_getClassAccessFlags: | |
|
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
3961
diff
changeset
|
3263 p = basic_plus_adr(kls, in_bytes(Klass::access_flags_offset())); |
| 0 | 3264 query_value = make_load(NULL, p, TypeInt::INT, T_INT); |
| 3265 break; | |
| 3266 | |
| 3267 default: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3268 fatal_unexpected_iid(id); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3269 break; |
| 0 | 3270 } |
| 3271 | |
| 3272 // Fall-through is the normal case of a query to a real class. | |
| 3273 phi->init_req(1, query_value); | |
| 3274 region->init_req(1, control()); | |
| 3275 | |
| 3276 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
|
3277 set_result(region, phi); |
| 0 | 3278 return true; |
| 3279 } | |
| 3280 | |
| 3281 //--------------------------inline_native_subtype_check------------------------ | |
| 3282 // This intrinsic takes the JNI calls out of the heart of | |
| 3283 // UnsafeFieldAccessorImpl.set, which improves Field.set, readObject, etc. | |
| 3284 bool LibraryCallKit::inline_native_subtype_check() { | |
| 3285 // Pull both arguments off the stack. | |
| 3286 Node* args[2]; // two java.lang.Class mirrors: superc, subc | |
| 3287 args[0] = argument(0); | |
| 3288 args[1] = argument(1); | |
| 3289 Node* klasses[2]; // corresponding Klasses: superk, subk | |
| 3290 klasses[0] = klasses[1] = top(); | |
| 3291 | |
| 3292 enum { | |
| 3293 // A full decision tree on {superc is prim, subc is prim}: | |
| 3294 _prim_0_path = 1, // {P,N} => false | |
| 3295 // {P,P} & superc!=subc => false | |
| 3296 _prim_same_path, // {P,P} & superc==subc => true | |
| 3297 _prim_1_path, // {N,P} => false | |
| 3298 _ref_subtype_path, // {N,N} & subtype check wins => true | |
| 3299 _both_ref_path, // {N,N} & subtype check loses => false | |
| 3300 PATH_LIMIT | |
| 3301 }; | |
| 3302 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3303 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
|
3304 Node* phi = new (C) PhiNode(region, TypeInt::BOOL); |
| 0 | 3305 record_for_igvn(region); |
| 3306 | |
| 3307 const TypePtr* adr_type = TypeRawPtr::BOTTOM; // memory type of loads | |
| 3308 const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL; | |
| 3309 int class_klass_offset = java_lang_Class::klass_offset_in_bytes(); | |
| 3310 | |
| 3311 // First null-check both mirrors and load each mirror's klass metaobject. | |
| 3312 int which_arg; | |
| 3313 for (which_arg = 0; which_arg <= 1; which_arg++) { | |
| 3314 Node* arg = args[which_arg]; | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3315 arg = null_check(arg); |
| 0 | 3316 if (stopped()) break; |
| 3317 args[which_arg] = _gvn.transform(arg); | |
| 3318 | |
| 3319 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
|
3320 Node* kls = LoadKlassNode::make(_gvn, immutable_memory(), p, adr_type, kls_type); |
| 0 | 3321 klasses[which_arg] = _gvn.transform(kls); |
| 3322 } | |
| 3323 | |
| 3324 // Having loaded both klasses, test each for null. | |
| 3325 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
| 3326 for (which_arg = 0; which_arg <= 1; which_arg++) { | |
| 3327 Node* kls = klasses[which_arg]; | |
| 3328 Node* null_ctl = top(); | |
| 3329 kls = null_check_oop(kls, &null_ctl, never_see_null); | |
| 3330 int prim_path = (which_arg == 0 ? _prim_0_path : _prim_1_path); | |
| 3331 region->init_req(prim_path, null_ctl); | |
| 3332 if (stopped()) break; | |
| 3333 klasses[which_arg] = kls; | |
| 3334 } | |
| 3335 | |
| 3336 if (!stopped()) { | |
| 3337 // now we have two reference types, in klasses[0..1] | |
| 3338 Node* subk = klasses[1]; // the argument to isAssignableFrom | |
| 3339 Node* superk = klasses[0]; // the receiver | |
| 3340 region->set_req(_both_ref_path, gen_subtype_check(subk, superk)); | |
| 3341 // now we have a successful reference subtype check | |
| 3342 region->set_req(_ref_subtype_path, control()); | |
| 3343 } | |
| 3344 | |
| 3345 // If both operands are primitive (both klasses null), then | |
| 3346 // we must return true when they are identical primitives. | |
| 3347 // It is convenient to test this after the first null klass check. | |
| 3348 set_control(region->in(_prim_0_path)); // go back to first null check | |
| 3349 if (!stopped()) { | |
| 3350 // Since superc is primitive, make a guard for the superc==subc case. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3351 Node* cmp_eq = _gvn.transform( new (C) CmpPNode(args[0], args[1]) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3352 Node* bol_eq = _gvn.transform( new (C) BoolNode(cmp_eq, BoolTest::eq) ); |
| 0 | 3353 generate_guard(bol_eq, region, PROB_FAIR); |
| 3354 if (region->req() == PATH_LIMIT+1) { | |
| 3355 // A guard was added. If the added guard is taken, superc==subc. | |
| 3356 region->swap_edges(PATH_LIMIT, _prim_same_path); | |
| 3357 region->del_req(PATH_LIMIT); | |
| 3358 } | |
| 3359 region->set_req(_prim_0_path, control()); // Not equal after all. | |
| 3360 } | |
| 3361 | |
| 3362 // these are the only paths that produce 'true': | |
| 3363 phi->set_req(_prim_same_path, intcon(1)); | |
| 3364 phi->set_req(_ref_subtype_path, intcon(1)); | |
| 3365 | |
| 3366 // pull together the cases: | |
| 3367 assert(region->req() == PATH_LIMIT, "sane region"); | |
| 3368 for (uint i = 1; i < region->req(); i++) { | |
| 3369 Node* ctl = region->in(i); | |
| 3370 if (ctl == NULL || ctl == top()) { | |
| 3371 region->set_req(i, top()); | |
| 3372 phi ->set_req(i, top()); | |
| 3373 } else if (phi->in(i) == NULL) { | |
| 3374 phi->set_req(i, intcon(0)); // all other paths produce 'false' | |
| 3375 } | |
| 3376 } | |
| 3377 | |
| 3378 set_control(_gvn.transform(region)); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3379 set_result(_gvn.transform(phi)); |
| 0 | 3380 return true; |
| 3381 } | |
| 3382 | |
| 3383 //---------------------generate_array_guard_common------------------------ | |
| 3384 Node* LibraryCallKit::generate_array_guard_common(Node* kls, RegionNode* region, | |
| 3385 bool obj_array, bool not_array) { | |
| 3386 // If obj_array/non_array==false/false: | |
| 3387 // Branch around if the given klass is in fact an array (either obj or prim). | |
| 3388 // If obj_array/non_array==false/true: | |
| 3389 // Branch around if the given klass is not an array klass of any kind. | |
| 3390 // If obj_array/non_array==true/true: | |
| 3391 // Branch around if the kls is not an oop array (kls is int[], String, etc.) | |
| 3392 // If obj_array/non_array==true/false: | |
| 3393 // Branch around if the kls is an oop array (Object[] or subtype) | |
| 3394 // | |
| 3395 // Like generate_guard, adds a new path onto the region. | |
| 3396 jint layout_con = 0; | |
| 3397 Node* layout_val = get_layout_helper(kls, layout_con); | |
| 3398 if (layout_val == NULL) { | |
| 3399 bool query = (obj_array | |
| 3400 ? Klass::layout_helper_is_objArray(layout_con) | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
3401 : Klass::layout_helper_is_array(layout_con)); |
| 0 | 3402 if (query == not_array) { |
| 3403 return NULL; // never a branch | |
| 3404 } else { // always a branch | |
| 3405 Node* always_branch = control(); | |
| 3406 if (region != NULL) | |
| 3407 region->add_req(always_branch); | |
| 3408 set_control(top()); | |
| 3409 return always_branch; | |
| 3410 } | |
| 3411 } | |
| 3412 // Now test the correct condition. | |
| 3413 jint nval = (obj_array | |
| 3414 ? ((jint)Klass::_lh_array_tag_type_value | |
| 3415 << Klass::_lh_array_tag_shift) | |
| 3416 : Klass::_lh_neutral_value); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3417 Node* cmp = _gvn.transform( new(C) CmpINode(layout_val, intcon(nval)) ); |
| 0 | 3418 BoolTest::mask btest = BoolTest::lt; // correct for testing is_[obj]array |
| 3419 // invert the test if we are looking for a non-array | |
| 3420 if (not_array) btest = BoolTest(btest).negate(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3421 Node* bol = _gvn.transform( new(C) BoolNode(cmp, btest) ); |
| 0 | 3422 return generate_fair_guard(bol, region); |
| 3423 } | |
| 3424 | |
| 3425 | |
| 3426 //-----------------------inline_native_newArray-------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3427 // private static native Object java.lang.reflect.newArray(Class<?> componentType, int length); |
| 0 | 3428 bool LibraryCallKit::inline_native_newArray() { |
| 3429 Node* mirror = argument(0); | |
| 3430 Node* count_val = argument(1); | |
| 3431 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3432 mirror = null_check(mirror); |
| 163 | 3433 // If mirror or obj is dead, only null-path is taken. |
| 3434 if (stopped()) return true; | |
| 0 | 3435 |
| 3436 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
|
3437 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
|
3438 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
|
3439 TypeInstPtr::NOTNULL); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3440 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
|
3441 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
|
3442 TypePtr::BOTTOM); |
| 0 | 3443 |
| 3444 bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check); | |
| 3445 Node* klass_node = load_array_klass_from_mirror(mirror, never_see_null, | |
| 3446 result_reg, _slow_path); | |
| 3447 Node* normal_ctl = control(); | |
| 3448 Node* no_array_ctl = result_reg->in(_slow_path); | |
| 3449 | |
| 3450 // Generate code for the slow case. We make a call to newArray(). | |
| 3451 set_control(no_array_ctl); | |
| 3452 if (!stopped()) { | |
| 3453 // Either the input type is void.class, or else the | |
| 3454 // array klass has not yet been cached. Either the | |
| 3455 // ensuing call will throw an exception, or else it | |
| 3456 // will cache the array klass for next time. | |
| 3457 PreserveJVMState pjvms(this); | |
| 3458 CallJavaNode* slow_call = generate_method_call_static(vmIntrinsics::_newArray); | |
| 3459 Node* slow_result = set_results_for_java_call(slow_call); | |
| 3460 // this->control() comes from set_results_for_java_call | |
| 3461 result_reg->set_req(_slow_path, control()); | |
| 3462 result_val->set_req(_slow_path, slow_result); | |
| 3463 result_io ->set_req(_slow_path, i_o()); | |
| 3464 result_mem->set_req(_slow_path, reset_memory()); | |
| 3465 } | |
| 3466 | |
| 3467 set_control(normal_ctl); | |
| 3468 if (!stopped()) { | |
| 3469 // Normal case: The array type has been cached in the java.lang.Class. | |
| 3470 // The following call works fine even if the array type is polymorphic. | |
| 3471 // 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
|
3472 Node* obj = new_array(klass_node, count_val, 0); // no arguments to push |
| 0 | 3473 result_reg->init_req(_normal_path, control()); |
| 3474 result_val->init_req(_normal_path, obj); | |
| 3475 result_io ->init_req(_normal_path, i_o()); | |
| 3476 result_mem->init_req(_normal_path, reset_memory()); | |
| 3477 } | |
| 3478 | |
| 3479 // Return the combined state. | |
| 3480 set_i_o( _gvn.transform(result_io) ); | |
| 3481 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
|
3482 |
| 0 | 3483 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
|
3484 set_result(result_reg, result_val); |
| 0 | 3485 return true; |
| 3486 } | |
| 3487 | |
| 3488 //----------------------inline_native_getLength-------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3489 // public static native int java.lang.reflect.Array.getLength(Object array); |
| 0 | 3490 bool LibraryCallKit::inline_native_getLength() { |
| 3491 if (too_many_traps(Deoptimization::Reason_intrinsic)) return false; | |
| 3492 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3493 Node* array = null_check(argument(0)); |
| 0 | 3494 // If array is dead, only null-path is taken. |
| 3495 if (stopped()) return true; | |
| 3496 | |
| 3497 // Deoptimize if it is a non-array. | |
| 3498 Node* non_array = generate_non_array_guard(load_object_klass(array), NULL); | |
| 3499 | |
| 3500 if (non_array != NULL) { | |
| 3501 PreserveJVMState pjvms(this); | |
| 3502 set_control(non_array); | |
| 3503 uncommon_trap(Deoptimization::Reason_intrinsic, | |
| 3504 Deoptimization::Action_maybe_recompile); | |
| 3505 } | |
| 3506 | |
| 3507 // If control is dead, only non-array-path is taken. | |
| 3508 if (stopped()) return true; | |
| 3509 | |
| 3510 // The works fine even if the array type is polymorphic. | |
| 3511 // 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
|
3512 Node* result = load_array_length(array); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3513 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3514 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
|
3515 set_result(result); |
| 0 | 3516 return true; |
| 3517 } | |
| 3518 | |
| 3519 //------------------------inline_array_copyOf---------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3520 // 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
|
3521 // public static <T,U> T[] java.util.Arrays.copyOfRange(U[] original, int from, int to, Class<? extends T[]> newType); |
| 0 | 3522 bool LibraryCallKit::inline_array_copyOf(bool is_copyOfRange) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3523 return false; |
| 0 | 3524 if (too_many_traps(Deoptimization::Reason_intrinsic)) return false; |
| 3525 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3526 // Get the arguments. |
| 0 | 3527 Node* original = argument(0); |
| 3528 Node* start = is_copyOfRange? argument(1): intcon(0); | |
| 3529 Node* end = is_copyOfRange? argument(2): argument(1); | |
| 3530 Node* array_type_mirror = is_copyOfRange? argument(3): argument(2); | |
| 3531 | |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3532 Node* newcopy; |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3533 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3534 // 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
|
3535 // 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
|
3536 { PreserveReexecuteState preexecs(this); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3537 jvms()->set_should_reexecute(true); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3538 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3539 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
|
3540 original = null_check(original); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3541 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3542 // Check if a null path was taken unconditionally. |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3543 if (stopped()) return true; |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3544 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3545 Node* orig_length = load_array_length(original); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3546 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3547 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
|
3548 klass_node = null_check(klass_node); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3549 |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3550 RegionNode* bailout = new (C) RegionNode(1); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3551 record_for_igvn(bailout); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3552 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3553 // 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
|
3554 // Bail out if that is so. |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3555 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
|
3556 if (not_objArray != NULL) { |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3557 // 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
|
3558 ciKlass* ak = ciArrayKlass::make(env()->Object_klass()); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3559 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
|
3560 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
|
3561 cast->init_req(0, control()); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3562 klass_node = _gvn.transform(cast); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3563 } |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3564 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3565 // 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
|
3566 generate_negative_guard(start, bailout, &start); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3567 generate_negative_guard(end, bailout, &end); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3568 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3569 Node* length = end; |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3570 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
|
3571 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
|
3572 } |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3573 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3574 // 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
|
3575 // 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
|
3576 // 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
|
3577 // should be thrown |
|
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3578 generate_negative_guard(length, bailout, &length); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3579 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3580 if (bailout->req() > 1) { |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3581 PreserveJVMState pjvms(this); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3582 set_control(_gvn.transform(bailout)); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3583 uncommon_trap(Deoptimization::Reason_intrinsic, |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3584 Deoptimization::Action_maybe_recompile); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3585 } |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3586 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3587 if (!stopped()) { |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3588 // 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
|
3589 // 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
|
3590 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
|
3591 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
|
3592 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3593 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
|
3594 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3595 // 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
|
3596 // 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
|
3597 // oop stores need checking. |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3598 // 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
|
3599 // 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
|
3600 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
|
3601 // 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
|
3602 // negative. |
|
eeb819cf36e5
7174363: Arrays.copyOfRange leads to VM crash with -Xcomp -server if executed by testing framework
roland
parents:
6143
diff
changeset
|
3603 bool length_never_negative = !is_copyOfRange; |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3604 generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3605 original, start, newcopy, intcon(0), moved, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
3606 disjoint_bases, length_never_negative); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
3607 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3608 } // original reexecute is set back here |
| 0 | 3609 |
| 3610 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
|
3611 if (!stopped()) { |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3612 set_result(newcopy); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3613 } |
| 0 | 3614 return true; |
| 3615 } | |
| 3616 | |
| 3617 | |
| 3618 //----------------------generate_virtual_guard--------------------------- | |
| 3619 // Helper for hashCode and clone. Peeks inside the vtable to avoid a call. | |
| 3620 Node* LibraryCallKit::generate_virtual_guard(Node* obj_klass, | |
| 3621 RegionNode* slow_region) { | |
| 3622 ciMethod* method = callee(); | |
| 3623 int vtable_index = method->vtable_index(); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
3624 // 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
|
3625 int entry_offset = (InstanceKlass::vtable_start_offset() + |
| 0 | 3626 vtable_index*vtableEntry::size()) * wordSize + |
| 3627 vtableEntry::method_offset_in_bytes(); | |
| 3628 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
|
3629 Node* target_call = make_load(NULL, entry_addr, TypePtr::NOTNULL, T_ADDRESS); |
| 0 | 3630 |
| 3631 // 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
|
3632 const TypePtr* native_call_addr = TypeMetadataPtr::make(method); |
| 0 | 3633 |
| 3634 Node* native_call = makecon(native_call_addr); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3635 Node* chk_native = _gvn.transform( new(C) CmpPNode(target_call, native_call) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3636 Node* test_native = _gvn.transform( new(C) BoolNode(chk_native, BoolTest::ne) ); |
| 0 | 3637 |
| 3638 return generate_slow_guard(test_native, slow_region); | |
| 3639 } | |
| 3640 | |
| 3641 //-----------------------generate_method_call---------------------------- | |
| 3642 // Use generate_method_call to make a slow-call to the real | |
| 3643 // method if the fast path fails. An alternative would be to | |
| 3644 // use a stub like OptoRuntime::slow_arraycopy_Java. | |
| 3645 // This only works for expanding the current library call, | |
| 3646 // not another intrinsic. (E.g., don't use this for making an | |
| 3647 // arraycopy call inside of the copyOf intrinsic.) | |
| 3648 CallJavaNode* | |
| 3649 LibraryCallKit::generate_method_call(vmIntrinsics::ID method_id, bool is_virtual, bool is_static) { | |
| 3650 // When compiling the intrinsic method itself, do not use this technique. | |
| 3651 guarantee(callee() != C->method(), "cannot make slow-call to self"); | |
| 3652 | |
| 3653 ciMethod* method = callee(); | |
| 3654 // ensure the JVMS we have will be correct for this call | |
| 3655 guarantee(method_id == method->intrinsic_id(), "must match"); | |
| 3656 | |
| 3657 const TypeFunc* tf = TypeFunc::make(method); | |
| 3658 CallJavaNode* slow_call; | |
| 3659 if (is_static) { | |
| 3660 assert(!is_virtual, ""); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3661 slow_call = new(C) CallStaticJavaNode(tf, |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3662 SharedRuntime::get_resolve_static_call_stub(), |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3663 method, bci()); |
| 0 | 3664 } else if (is_virtual) { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3665 null_check_receiver(); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
3666 int vtable_index = Method::invalid_vtable_index; |
| 0 | 3667 if (UseInlineCaches) { |
| 3668 // Suppress the vtable call | |
| 3669 } else { | |
| 3670 // hashCode and clone are not a miranda methods, | |
| 3671 // so the vtable index is fixed. | |
| 3672 // No need to use the linkResolver to get it. | |
| 3673 vtable_index = method->vtable_index(); | |
| 3674 } | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3675 slow_call = new(C) CallDynamicJavaNode(tf, |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3676 SharedRuntime::get_resolve_virtual_call_stub(), |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3677 method, vtable_index, bci()); |
| 0 | 3678 } 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
|
3679 null_check_receiver(); |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3680 slow_call = new(C) CallStaticJavaNode(tf, |
| 0 | 3681 SharedRuntime::get_resolve_opt_virtual_call_stub(), |
| 3682 method, bci()); | |
| 3683 slow_call->set_optimized_virtual(true); | |
| 3684 } | |
| 3685 set_arguments_for_java_call(slow_call); | |
| 3686 set_edges_for_java_call(slow_call); | |
| 3687 return slow_call; | |
| 3688 } | |
| 3689 | |
| 3690 | |
| 3691 //------------------------------inline_native_hashcode-------------------- | |
| 3692 // Build special case code for calls to hashCode on an object. | |
| 3693 bool LibraryCallKit::inline_native_hashcode(bool is_virtual, bool is_static) { | |
| 3694 assert(is_static == callee()->is_static(), "correct intrinsic selection"); | |
| 3695 assert(!(is_virtual && is_static), "either virtual, special, or static"); | |
| 3696 | |
| 3697 enum { _slow_path = 1, _fast_path, _null_path, PATH_LIMIT }; | |
| 3698 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3699 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
|
3700 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
|
3701 TypeInt::INT); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3702 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
|
3703 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
|
3704 TypePtr::BOTTOM); |
| 0 | 3705 Node* obj = NULL; |
| 3706 if (!is_static) { | |
| 3707 // Check for hashing null object | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3708 obj = null_check_receiver(); |
| 0 | 3709 if (stopped()) return true; // unconditionally null |
| 3710 result_reg->init_req(_null_path, top()); | |
| 3711 result_val->init_req(_null_path, top()); | |
| 3712 } else { | |
| 3713 // Do a null check, and return zero if null. | |
| 3714 // System.identityHashCode(null) == 0 | |
| 3715 obj = argument(0); | |
| 3716 Node* null_ctl = top(); | |
| 3717 obj = null_check_oop(obj, &null_ctl); | |
| 3718 result_reg->init_req(_null_path, null_ctl); | |
| 3719 result_val->init_req(_null_path, _gvn.intcon(0)); | |
| 3720 } | |
| 3721 | |
| 3722 // Unconditionally null? Then return right away. | |
| 3723 if (stopped()) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3724 set_control( result_reg->in(_null_path)); |
| 0 | 3725 if (!stopped()) |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3726 set_result(result_val->in(_null_path)); |
| 0 | 3727 return true; |
| 3728 } | |
| 3729 | |
| 3730 // After null check, get the object's klass. | |
| 3731 Node* obj_klass = load_object_klass(obj); | |
| 3732 | |
| 3733 // This call may be virtual (invokevirtual) or bound (invokespecial). | |
| 3734 // For each case we generate slightly different code. | |
| 3735 | |
| 3736 // We only go to the fast case code if we pass a number of guards. The | |
| 3737 // 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
|
3738 RegionNode* slow_region = new (C) RegionNode(1); |
| 0 | 3739 record_for_igvn(slow_region); |
| 3740 | |
| 3741 // If this is a virtual call, we generate a funny guard. We pull out | |
| 3742 // the vtable entry corresponding to hashCode() from the target object. | |
| 3743 // If the target method which we are calling happens to be the native | |
| 3744 // Object hashCode() method, we pass the guard. We do not need this | |
| 3745 // guard for non-virtual calls -- the caller is known to be the native | |
| 3746 // Object hashCode(). | |
| 3747 if (is_virtual) { | |
| 3748 generate_virtual_guard(obj_klass, slow_region); | |
| 3749 } | |
| 3750 | |
| 3751 // Get the header out of the object, use LoadMarkNode when available | |
| 3752 Node* header_addr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes()); | |
| 1609 | 3753 Node* header = make_load(control(), header_addr, TypeX_X, TypeX_X->basic_type()); |
| 0 | 3754 |
| 3755 // Test the header to see if it is unlocked. | |
| 3756 Node *lock_mask = _gvn.MakeConX(markOopDesc::biased_lock_mask_in_place); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3757 Node *lmasked_header = _gvn.transform( new (C) AndXNode(header, lock_mask) ); |
| 0 | 3758 Node *unlocked_val = _gvn.MakeConX(markOopDesc::unlocked_value); |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3759 Node *chk_unlocked = _gvn.transform( new (C) CmpXNode( lmasked_header, unlocked_val)); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3760 Node *test_unlocked = _gvn.transform( new (C) BoolNode( chk_unlocked, BoolTest::ne) ); |
| 0 | 3761 |
| 3762 generate_slow_guard(test_unlocked, slow_region); | |
| 3763 | |
| 3764 // Get the hash value and check to see that it has been properly assigned. | |
| 3765 // We depend on hash_mask being at most 32 bits and avoid the use of | |
| 3766 // hash_mask_in_place because it could be larger than 32 bits in a 64-bit | |
| 3767 // vm: see markOop.hpp. | |
| 3768 Node *hash_mask = _gvn.intcon(markOopDesc::hash_mask); | |
| 3769 Node *hash_shift = _gvn.intcon(markOopDesc::hash_shift); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3770 Node *hshifted_header= _gvn.transform( new (C) URShiftXNode(header, hash_shift) ); |
| 0 | 3771 // This hack lets the hash bits live anywhere in the mark object now, as long |
| 605 | 3772 // as the shift drops the relevant bits into the low 32 bits. Note that |
| 0 | 3773 // Java spec says that HashCode is an int so there's no point in capturing |
| 3774 // an 'X'-sized hashcode (32 in 32-bit build or 64 in 64-bit build). | |
| 3775 hshifted_header = ConvX2I(hshifted_header); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3776 Node *hash_val = _gvn.transform( new (C) AndINode(hshifted_header, hash_mask) ); |
| 0 | 3777 |
| 3778 Node *no_hash_val = _gvn.intcon(markOopDesc::no_hash); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3779 Node *chk_assigned = _gvn.transform( new (C) CmpINode( hash_val, no_hash_val)); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3780 Node *test_assigned = _gvn.transform( new (C) BoolNode( chk_assigned, BoolTest::eq) ); |
| 0 | 3781 |
| 3782 generate_slow_guard(test_assigned, slow_region); | |
| 3783 | |
| 3784 Node* init_mem = reset_memory(); | |
| 3785 // fill in the rest of the null path: | |
| 3786 result_io ->init_req(_null_path, i_o()); | |
| 3787 result_mem->init_req(_null_path, init_mem); | |
| 3788 | |
| 3789 result_val->init_req(_fast_path, hash_val); | |
| 3790 result_reg->init_req(_fast_path, control()); | |
| 3791 result_io ->init_req(_fast_path, i_o()); | |
| 3792 result_mem->init_req(_fast_path, init_mem); | |
| 3793 | |
| 3794 // Generate code for the slow case. We make a call to hashCode(). | |
| 3795 set_control(_gvn.transform(slow_region)); | |
| 3796 if (!stopped()) { | |
| 3797 // No need for PreserveJVMState, because we're using up the present state. | |
| 3798 set_all_memory(init_mem); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3799 vmIntrinsics::ID hashCode_id = is_static ? vmIntrinsics::_identityHashCode : vmIntrinsics::_hashCode; |
| 0 | 3800 CallJavaNode* slow_call = generate_method_call(hashCode_id, is_virtual, is_static); |
| 3801 Node* slow_result = set_results_for_java_call(slow_call); | |
| 3802 // this->control() comes from set_results_for_java_call | |
| 3803 result_reg->init_req(_slow_path, control()); | |
| 3804 result_val->init_req(_slow_path, slow_result); | |
| 3805 result_io ->set_req(_slow_path, i_o()); | |
| 3806 result_mem ->set_req(_slow_path, reset_memory()); | |
| 3807 } | |
| 3808 | |
| 3809 // Return the combined state. | |
| 3810 set_i_o( _gvn.transform(result_io) ); | |
| 3811 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
|
3812 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3813 set_result(result_reg, result_val); |
| 0 | 3814 return true; |
| 3815 } | |
| 3816 | |
| 3817 //---------------------------inline_native_getClass---------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3818 // 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
|
3819 // |
| 605 | 3820 // Build special case code for calls to getClass on an object. |
| 0 | 3821 bool LibraryCallKit::inline_native_getClass() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3822 Node* obj = null_check_receiver(); |
| 0 | 3823 if (stopped()) return true; |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3824 set_result(load_mirror_from_klass(load_object_klass(obj))); |
| 0 | 3825 return true; |
| 3826 } | |
| 3827 | |
| 3828 //-----------------inline_native_Reflection_getCallerClass--------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3829 // public static native Class<?> sun.reflect.Reflection.getCallerClass(int realFramesToSkip); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3830 // |
| 0 | 3831 // In the presence of deep enough inlining, getCallerClass() becomes a no-op. |
| 3832 // | |
| 3833 // NOTE that this code must perform the same logic as | |
| 3834 // vframeStream::security_get_caller_frame in that it must skip | |
| 3835 // Method.invoke() and auxiliary frames. | |
| 3836 bool LibraryCallKit::inline_native_Reflection_getCallerClass() { | |
| 3837 #ifndef PRODUCT | |
| 3838 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { | |
| 3839 tty->print_cr("Attempting to inline sun.reflect.Reflection.getCallerClass"); | |
| 3840 } | |
| 3841 #endif | |
| 3842 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3843 Node* caller_depth_node = argument(0); |
| 0 | 3844 |
| 3845 // The depth value must be a constant in order for the runtime call | |
| 3846 // to be eliminated. | |
| 3847 const TypeInt* caller_depth_type = _gvn.type(caller_depth_node)->isa_int(); | |
| 3848 if (caller_depth_type == NULL || !caller_depth_type->is_con()) { | |
| 3849 #ifndef PRODUCT | |
| 3850 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { | |
| 3851 tty->print_cr(" Bailing out because caller depth was not a constant"); | |
| 3852 } | |
| 3853 #endif | |
| 3854 return false; | |
| 3855 } | |
| 3856 // Note that the JVM state at this point does not include the | |
| 3857 // getCallerClass() frame which we are trying to inline. The | |
| 3858 // semantics of getCallerClass(), however, are that the "first" | |
| 3859 // frame is the getCallerClass() frame, so we subtract one from the | |
| 3860 // requested depth before continuing. We don't inline requests of | |
| 3861 // getCallerClass(0). | |
| 3862 int caller_depth = caller_depth_type->get_con() - 1; | |
| 3863 if (caller_depth < 0) { | |
| 3864 #ifndef PRODUCT | |
| 3865 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { | |
| 3866 tty->print_cr(" Bailing out because caller depth was %d", caller_depth); | |
| 3867 } | |
| 3868 #endif | |
| 3869 return false; | |
| 3870 } | |
| 3871 | |
| 3872 if (!jvms()->has_method()) { | |
| 3873 #ifndef PRODUCT | |
| 3874 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { | |
| 3875 tty->print_cr(" Bailing out because intrinsic was inlined at top level"); | |
| 3876 } | |
| 3877 #endif | |
| 3878 return false; | |
| 3879 } | |
| 3880 int _depth = jvms()->depth(); // cache call chain depth | |
| 3881 | |
| 3882 // Walk back up the JVM state to find the caller at the required | |
| 3883 // depth. NOTE that this code must perform the same logic as | |
| 3884 // vframeStream::security_get_caller_frame in that it must skip | |
| 3885 // Method.invoke() and auxiliary frames. Note also that depth is | |
| 3886 // 1-based (1 is the bottom of the inlining). | |
| 3887 int inlining_depth = _depth; | |
| 3888 JVMState* caller_jvms = NULL; | |
| 3889 | |
| 3890 if (inlining_depth > 0) { | |
| 3891 caller_jvms = jvms(); | |
| 3892 assert(caller_jvms = jvms()->of_depth(inlining_depth), "inlining_depth == our depth"); | |
| 3893 do { | |
| 3894 // The following if-tests should be performed in this order | |
| 3895 if (is_method_invoke_or_aux_frame(caller_jvms)) { | |
| 3896 // Skip a Method.invoke() or auxiliary frame | |
| 3897 } else if (caller_depth > 0) { | |
| 3898 // Skip real frame | |
| 3899 --caller_depth; | |
| 3900 } else { | |
| 3901 // We're done: reached desired caller after skipping. | |
| 3902 break; | |
| 3903 } | |
| 3904 caller_jvms = caller_jvms->caller(); | |
| 3905 --inlining_depth; | |
| 3906 } while (inlining_depth > 0); | |
| 3907 } | |
| 3908 | |
| 3909 if (inlining_depth == 0) { | |
| 3910 #ifndef PRODUCT | |
| 3911 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { | |
| 3912 tty->print_cr(" Bailing out because caller depth (%d) exceeded inlining depth (%d)", caller_depth_type->get_con(), _depth); | |
| 3913 tty->print_cr(" JVM state at this point:"); | |
| 3914 for (int i = _depth; i >= 1; i--) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3915 ciMethod* m = jvms()->of_depth(i)->method(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3916 tty->print_cr(" %d) %s.%s", i, m->holder()->name()->as_utf8(), m->name()->as_utf8()); |
| 0 | 3917 } |
| 3918 } | |
| 3919 #endif | |
| 3920 return false; // Reached end of inlining | |
| 3921 } | |
| 3922 | |
| 3923 // Acquire method holder as java.lang.Class | |
| 3924 ciInstanceKlass* caller_klass = caller_jvms->method()->holder(); | |
| 3925 ciInstance* caller_mirror = caller_klass->java_mirror(); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3926 |
| 0 | 3927 // Push this as a constant |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3928 set_result(makecon(TypeInstPtr::make(caller_mirror))); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3929 |
| 0 | 3930 #ifndef PRODUCT |
| 3931 if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) { | |
| 3932 tty->print_cr(" Succeeded: caller = %s.%s, caller depth = %d, depth = %d", caller_klass->name()->as_utf8(), caller_jvms->method()->name()->as_utf8(), caller_depth_type->get_con(), _depth); | |
| 3933 tty->print_cr(" JVM state at this point:"); | |
| 3934 for (int i = _depth; i >= 1; i--) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3935 ciMethod* m = jvms()->of_depth(i)->method(); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3936 tty->print_cr(" %d) %s.%s", i, m->holder()->name()->as_utf8(), m->name()->as_utf8()); |
| 0 | 3937 } |
| 3938 } | |
| 3939 #endif | |
| 3940 return true; | |
| 3941 } | |
| 3942 | |
| 3943 // Helper routine for above | |
| 3944 bool LibraryCallKit::is_method_invoke_or_aux_frame(JVMState* jvms) { | |
|
1152
cd37471eaecc
6914206: change way of permission checking for generated MethodHandle adapters
twisti
parents:
1027
diff
changeset
|
3945 ciMethod* method = jvms->method(); |
|
cd37471eaecc
6914206: change way of permission checking for generated MethodHandle adapters
twisti
parents:
1027
diff
changeset
|
3946 |
| 0 | 3947 // Is this the Method.invoke method itself? |
|
1152
cd37471eaecc
6914206: change way of permission checking for generated MethodHandle adapters
twisti
parents:
1027
diff
changeset
|
3948 if (method->intrinsic_id() == vmIntrinsics::_invoke) |
| 0 | 3949 return true; |
| 3950 | |
| 3951 // Is this a helper, defined somewhere underneath MethodAccessorImpl. | |
|
1152
cd37471eaecc
6914206: change way of permission checking for generated MethodHandle adapters
twisti
parents:
1027
diff
changeset
|
3952 ciKlass* k = method->holder(); |
| 0 | 3953 if (k->is_instance_klass()) { |
| 3954 ciInstanceKlass* ik = k->as_instance_klass(); | |
| 3955 for (; ik != NULL; ik = ik->super()) { | |
| 3956 if (ik->name() == ciSymbol::sun_reflect_MethodAccessorImpl() && | |
| 3957 ik == env()->find_system_klass(ik->name())) { | |
| 3958 return true; | |
| 3959 } | |
| 3960 } | |
| 3961 } | |
|
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6205
diff
changeset
|
3962 else if (method->is_method_handle_intrinsic() || |
|
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6205
diff
changeset
|
3963 method->is_compiled_lambda_form()) { |
|
1152
cd37471eaecc
6914206: change way of permission checking for generated MethodHandle adapters
twisti
parents:
1027
diff
changeset
|
3964 // This is an internal adapter frame from the MethodHandleCompiler -- skip it |
|
cd37471eaecc
6914206: change way of permission checking for generated MethodHandle adapters
twisti
parents:
1027
diff
changeset
|
3965 return true; |
|
cd37471eaecc
6914206: change way of permission checking for generated MethodHandle adapters
twisti
parents:
1027
diff
changeset
|
3966 } |
| 0 | 3967 |
| 3968 return false; | |
| 3969 } | |
| 3970 | |
| 3971 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
|
3972 Node* arg = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3973 Node* result; |
| 0 | 3974 |
| 3975 switch (id) { | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3976 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
|
3977 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
|
3978 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
|
3979 case vmIntrinsics::_longBitsToDouble: result = new (C) MoveL2DNode(arg); break; |
| 0 | 3980 |
| 3981 case vmIntrinsics::_doubleToLongBits: { | |
| 3982 // 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
|
3983 RegionNode *r = new (C) RegionNode(3); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3984 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
|
3985 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3986 Node *cmpisnan = _gvn.transform(new (C) CmpDNode(arg, arg)); |
| 0 | 3987 // Build the boolean node |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
3988 Node *bolisnan = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::ne)); |
| 0 | 3989 |
| 3990 // Branch either way. | |
| 3991 // NaN case is less traveled, which makes all the difference. | |
| 3992 IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
| 3993 Node *opt_isnan = _gvn.transform(ifisnan); | |
| 3994 assert( opt_isnan->is_If(), "Expect an IfNode"); | |
| 3995 IfNode *opt_ifisnan = (IfNode*)opt_isnan; | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
3996 Node *iftrue = _gvn.transform( new (C) IfTrueNode(opt_ifisnan) ); |
| 0 | 3997 |
| 3998 set_control(iftrue); | |
| 3999 | |
| 4000 static const jlong nan_bits = CONST64(0x7ff8000000000000); | |
| 4001 Node *slow_result = longcon(nan_bits); // return NaN | |
| 4002 phi->init_req(1, _gvn.transform( slow_result )); | |
| 4003 r->init_req(1, iftrue); | |
| 4004 | |
| 4005 // Else fall through | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4006 Node *iffalse = _gvn.transform(new (C) IfFalseNode(opt_ifisnan)); |
| 0 | 4007 set_control(iffalse); |
| 4008 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4009 phi->init_req(2, _gvn.transform(new (C) MoveD2LNode(arg))); |
| 0 | 4010 r->init_req(2, iffalse); |
| 4011 | |
| 4012 // Post merge | |
| 4013 set_control(_gvn.transform(r)); | |
| 4014 record_for_igvn(r); | |
| 4015 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4016 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
|
4017 result = phi; |
| 0 | 4018 assert(result->bottom_type()->isa_long(), "must be"); |
| 4019 break; | |
| 4020 } | |
| 4021 | |
| 4022 case vmIntrinsics::_floatToIntBits: { | |
| 4023 // 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
|
4024 RegionNode *r = new (C) RegionNode(3); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4025 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
|
4026 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4027 Node *cmpisnan = _gvn.transform(new (C) CmpFNode(arg, arg)); |
| 0 | 4028 // Build the boolean node |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4029 Node *bolisnan = _gvn.transform(new (C) BoolNode(cmpisnan, BoolTest::ne)); |
| 0 | 4030 |
| 4031 // Branch either way. | |
| 4032 // NaN case is less traveled, which makes all the difference. | |
| 4033 IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN); | |
| 4034 Node *opt_isnan = _gvn.transform(ifisnan); | |
| 4035 assert( opt_isnan->is_If(), "Expect an IfNode"); | |
| 4036 IfNode *opt_ifisnan = (IfNode*)opt_isnan; | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4037 Node *iftrue = _gvn.transform( new (C) IfTrueNode(opt_ifisnan) ); |
| 0 | 4038 |
| 4039 set_control(iftrue); | |
| 4040 | |
| 4041 static const jint nan_bits = 0x7fc00000; | |
| 4042 Node *slow_result = makecon(TypeInt::make(nan_bits)); // return NaN | |
| 4043 phi->init_req(1, _gvn.transform( slow_result )); | |
| 4044 r->init_req(1, iftrue); | |
| 4045 | |
| 4046 // Else fall through | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4047 Node *iffalse = _gvn.transform(new (C) IfFalseNode(opt_ifisnan)); |
| 0 | 4048 set_control(iffalse); |
| 4049 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4050 phi->init_req(2, _gvn.transform(new (C) MoveF2INode(arg))); |
| 0 | 4051 r->init_req(2, iffalse); |
| 4052 | |
| 4053 // Post merge | |
| 4054 set_control(_gvn.transform(r)); | |
| 4055 record_for_igvn(r); | |
| 4056 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4057 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
|
4058 result = phi; |
| 0 | 4059 assert(result->bottom_type()->isa_int(), "must be"); |
| 4060 break; | |
| 4061 } | |
| 4062 | |
| 4063 default: | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4064 fatal_unexpected_iid(id); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4065 break; |
| 0 | 4066 } |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4067 set_result(_gvn.transform(result)); |
| 0 | 4068 return true; |
| 4069 } | |
| 4070 | |
| 4071 #ifdef _LP64 | |
| 4072 #define XTOP ,top() /*additional argument*/ | |
| 4073 #else //_LP64 | |
| 4074 #define XTOP /*no additional argument*/ | |
| 4075 #endif //_LP64 | |
| 4076 | |
| 4077 //----------------------inline_unsafe_copyMemory------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4078 // public native void sun.misc.Unsafe.copyMemory(Object srcBase, long srcOffset, Object destBase, long destOffset, long bytes); |
| 0 | 4079 bool LibraryCallKit::inline_unsafe_copyMemory() { |
| 4080 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
|
4081 null_check_receiver(); // null-check receiver |
| 0 | 4082 if (stopped()) return true; |
| 4083 | |
| 4084 C->set_has_unsafe_access(true); // Mark eventual nmethod as "unsafe". | |
| 4085 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4086 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
|
4087 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
|
4088 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
|
4089 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
|
4090 Node* size = ConvL2X(argument(7)); // type: long |
| 0 | 4091 |
| 4092 assert(Unsafe_field_offset_to_byte_offset(11) == 11, | |
| 4093 "fieldOffset must be byte-scaled"); | |
| 4094 | |
| 4095 Node* src = make_unsafe_address(src_ptr, src_off); | |
| 4096 Node* dst = make_unsafe_address(dst_ptr, dst_off); | |
| 4097 | |
| 4098 // Conservatively insert a memory barrier on all memory slices. | |
| 4099 // Do not let writes of the copy source or destination float below the copy. | |
| 4100 insert_mem_bar(Op_MemBarCPUOrder); | |
| 4101 | |
| 4102 // Call it. Note that the length argument is not scaled. | |
| 4103 make_runtime_call(RC_LEAF|RC_NO_FP, | |
| 4104 OptoRuntime::fast_arraycopy_Type(), | |
| 4105 StubRoutines::unsafe_arraycopy(), | |
| 4106 "unsafe_arraycopy", | |
| 4107 TypeRawPtr::BOTTOM, | |
| 4108 src, dst, size XTOP); | |
| 4109 | |
| 4110 // Do not let reads of the copy destination float above the copy. | |
| 4111 insert_mem_bar(Op_MemBarCPUOrder); | |
| 4112 | |
| 4113 return true; | |
| 4114 } | |
| 4115 | |
|
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4116 //------------------------clone_coping----------------------------------- |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4117 // 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
|
4118 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
|
4119 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
|
4120 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
|
4121 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
|
4122 |
|
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4123 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
|
4124 if (ReduceBulkZeroing) { |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4125 // 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
|
4126 // mark Initialize node as complete. |
|
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4127 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
|
4128 // 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
|
4129 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
|
4130 // 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
|
4131 // 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
|
4132 // 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
|
4133 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
|
4134 } |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4135 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4136 // 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
|
4137 // 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
|
4138 Node* src = obj; |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4139 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
|
4140 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
|
4141 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4142 // 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
|
4143 // 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
|
4144 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
|
4145 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
|
4146 // base_off: |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4147 // 8 - 32-bit VM |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4148 // 12 - 64-bit VM, compressed klass |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4149 // 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
|
4150 if (base_off % BytesPerLong != 0) { |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6847
diff
changeset
|
4151 assert(UseCompressedKlassPointers, ""); |
|
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4152 if (is_array) { |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4153 // 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
|
4154 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
|
4155 } else { |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4156 // 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
|
4157 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
|
4158 } |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4159 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
|
4160 } |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4161 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
|
4162 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
|
4163 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4164 // 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
|
4165 Node* countx = size; |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4166 countx = _gvn.transform( new (C) SubXNode(countx, MakeConX(base_off)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4167 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
|
4168 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4169 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
|
4170 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
|
4171 generate_unchecked_arraycopy(raw_adr_type, T_LONG, disjoint_bases, |
| 2324 | 4172 src, NULL, dest, NULL, countx, |
| 4173 /*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
|
4174 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4175 // 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
|
4176 if (card_mark) { |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4177 assert(!is_array, ""); |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4178 // 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
|
4179 // 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
|
4180 // 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
|
4181 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
|
4182 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
|
4183 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
|
4184 post_barrier(control(), |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4185 memory(raw_adr_type), |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4186 alloc_obj, |
|
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4187 no_particular_field, |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4188 raw_adr_idx, |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4189 no_particular_value, |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4190 T_OBJECT, |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4191 false); |
|
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 |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4194 // 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
|
4195 if (alloc != NULL) { |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4196 // 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
|
4197 // 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
|
4198 // other threads. |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4199 // 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
|
4200 // 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
|
4201 // AllocateNode and eliminate the MemBarStoreStoreNode if possible |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4202 // 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
|
4203 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
|
4204 } else { |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4205 insert_mem_bar(Op_MemBarCPUOrder); |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4206 } |
|
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4207 } |
| 0 | 4208 |
| 4209 //------------------------inline_native_clone---------------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4210 // 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
|
4211 // |
| 0 | 4212 // Here are the simple edge cases: |
| 4213 // null receiver => normal trap | |
| 4214 // virtual and clone was overridden => slow path to out-of-line clone | |
| 4215 // not cloneable or finalizer => slow path to out-of-line Object.clone | |
| 4216 // | |
| 4217 // The general case has two steps, allocation and copying. | |
| 4218 // Allocation has two cases, and uses GraphKit::new_instance or new_array. | |
| 4219 // | |
| 4220 // Copying also has two cases, oop arrays and everything else. | |
| 4221 // Oop arrays use arrayof_oop_arraycopy (same as System.arraycopy). | |
| 4222 // Everything else uses the tight inline loop supplied by CopyArrayNode. | |
| 4223 // | |
| 4224 // These steps fold up nicely if and when the cloned object's klass | |
| 4225 // can be sharply typed as an object array, a type array, or an instance. | |
| 4226 // | |
| 4227 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
|
4228 PhiNode* result_val; |
| 0 | 4229 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4230 // 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
|
4231 // 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
|
4232 { PreserveReexecuteState preexecs(this); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4233 jvms()->set_should_reexecute(true); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4234 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4235 Node* obj = null_check_receiver(); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4236 if (stopped()) return true; |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4237 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4238 Node* obj_klass = load_object_klass(obj); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4239 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
|
4240 const TypeOopPtr* toop = ((tklass != NULL) |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4241 ? tklass->as_instance_type() |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4242 : TypeInstPtr::NOTNULL); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4243 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4244 // 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
|
4245 // 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
|
4246 insert_mem_bar(Op_MemBarCPUOrder); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4247 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4248 // paths into result_reg: |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4249 enum { |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4250 _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
|
4251 _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
|
4252 _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
|
4253 _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
|
4254 PATH_LIMIT |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4255 }; |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4256 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
|
4257 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
|
4258 TypeInstPtr::NOTNULL); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4259 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
|
4260 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
|
4261 TypePtr::BOTTOM); |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4262 record_for_igvn(result_reg); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4263 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4264 const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM; |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4265 int raw_adr_idx = Compile::AliasIdxRaw; |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4266 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4267 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
|
4268 if (array_ctl != NULL) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4269 // It's an array. |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4270 PreserveJVMState pjvms(this); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4271 set_control(array_ctl); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4272 Node* obj_length = load_array_length(obj); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4273 Node* obj_size = NULL; |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4274 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
|
4275 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4276 if (!use_ReduceInitialCardMarks()) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4277 // 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
|
4278 // 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
|
4279 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
|
4280 if (is_obja != NULL) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4281 PreserveJVMState pjvms2(this); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4282 set_control(is_obja); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4283 // 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
|
4284 bool disjoint_bases = true; |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4285 bool length_never_negative = true; |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4286 generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4287 obj, intcon(0), alloc_obj, intcon(0), |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4288 obj_length, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4289 disjoint_bases, length_never_negative); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4290 result_reg->init_req(_objArray_path, control()); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4291 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
|
4292 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
|
4293 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
|
4294 } |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4295 } |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4296 // 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
|
4297 // (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
|
4298 // comes out of eden (TLAB)... In fact, ReduceInitialCardMarks |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4299 // 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
|
4300 // simulate a fresh allocation, so that no further |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
986
diff
changeset
|
4301 // 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
|
4302 // the object.) |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4303 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4304 if (!stopped()) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4305 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
|
4306 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4307 // Present the results of the copy. |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4308 result_reg->init_req(_array_path, control()); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4309 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
|
4310 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
|
4311 result_mem ->set_req(_array_path, reset_memory()); |
| 0 | 4312 } |
| 4313 } | |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4314 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4315 // 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
|
4316 // 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
|
4317 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
|
4318 record_for_igvn(slow_region); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4319 if (!stopped()) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4320 // 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
|
4321 // 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
|
4322 // 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
|
4323 // 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
|
4324 // 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
|
4325 // 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
|
4326 // Object clone(). |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4327 if (is_virtual) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4328 generate_virtual_guard(obj_klass, slow_region); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4329 } |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4330 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4331 // 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
|
4332 // 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
|
4333 // 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
|
4334 generate_access_flags_guard(obj_klass, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4335 // Test both conditions: |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4336 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
|
4337 // Must be cloneable but not finalizer: |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4338 JVM_ACC_IS_CLONEABLE, |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4339 slow_region); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4340 } |
|
833
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4341 |
|
acba6af809c8
6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents:
827
diff
changeset
|
4342 if (!stopped()) { |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4343 // 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
|
4344 PreserveJVMState pjvms(this); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4345 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
|
4346 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
|
4347 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4348 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
|
4349 |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4350 // Present the results of the slow call. |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4351 result_reg->init_req(_instance_path, control()); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4352 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
|
4353 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
|
4354 result_mem ->set_req(_instance_path, reset_memory()); |
| 0 | 4355 } |
| 4356 | |
|
900
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4357 // 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
|
4358 set_control(_gvn.transform(slow_region)); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4359 if (!stopped()) { |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4360 PreserveJVMState pjvms(this); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4361 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
|
4362 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
|
4363 // 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
|
4364 result_reg->init_req(_slow_path, control()); |
|
9987d9d5eb0e
6833129: specjvm98 fails with NullPointerException in the compiler with -XX:DeoptimizeALot
cfang
parents:
896
diff
changeset
|
4365 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
|
4366 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
|
4367 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
|
4368 } |
|
902
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4369 |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4370 // Return the combined state. |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4371 set_control( _gvn.transform(result_reg) ); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4372 set_i_o( _gvn.transform(result_i_o) ); |
|
fc2281ddce3c
6868269: CompileTheWorld assertion failure introduced by the reexecute bit implementation
cfang
parents:
900
diff
changeset
|
4373 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
|
4374 } // original reexecute is set back here |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4375 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4376 set_result(_gvn.transform(result_val)); |
| 0 | 4377 return true; |
| 4378 } | |
| 4379 | |
| 4380 //------------------------------basictype2arraycopy---------------------------- | |
| 4381 address LibraryCallKit::basictype2arraycopy(BasicType t, | |
| 4382 Node* src_offset, | |
| 4383 Node* dest_offset, | |
| 4384 bool disjoint_bases, | |
| 2324 | 4385 const char* &name, |
| 4386 bool dest_uninitialized) { | |
| 0 | 4387 const TypeInt* src_offset_inttype = gvn().find_int_type(src_offset);; |
| 4388 const TypeInt* dest_offset_inttype = gvn().find_int_type(dest_offset);; | |
| 4389 | |
| 4390 bool aligned = false; | |
| 4391 bool disjoint = disjoint_bases; | |
| 4392 | |
| 4393 // if the offsets are the same, we can treat the memory regions as | |
| 4394 // disjoint, because either the memory regions are in different arrays, | |
| 4395 // or they are identical (which we can treat as disjoint.) We can also | |
| 4396 // treat a copy with a destination index less that the source index | |
| 4397 // as disjoint since a low->high copy will work correctly in this case. | |
| 4398 if (src_offset_inttype != NULL && src_offset_inttype->is_con() && | |
| 4399 dest_offset_inttype != NULL && dest_offset_inttype->is_con()) { | |
| 4400 // both indices are constants | |
| 4401 int s_offs = src_offset_inttype->get_con(); | |
| 4402 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
|
4403 int element_size = type2aelembytes(t); |
| 0 | 4404 aligned = ((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) && |
| 4405 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0); | |
| 4406 if (s_offs >= d_offs) disjoint = true; | |
| 4407 } else if (src_offset == dest_offset && src_offset != NULL) { | |
| 4408 // This can occur if the offsets are identical non-constants. | |
| 4409 disjoint = true; | |
| 4410 } | |
| 4411 | |
| 2446 | 4412 return StubRoutines::select_arraycopy_function(t, aligned, disjoint, name, dest_uninitialized); |
| 0 | 4413 } |
| 4414 | |
| 4415 | |
| 4416 //------------------------------inline_arraycopy----------------------- | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4417 // 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
|
4418 // Object dest, int destPos, |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4419 // int length); |
| 0 | 4420 bool LibraryCallKit::inline_arraycopy() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4421 // Get the arguments. |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4422 Node* src = argument(0); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4423 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
|
4424 Node* dest = argument(2); // type: oop |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4425 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
|
4426 Node* length = argument(4); // type: int |
| 0 | 4427 |
| 4428 // Compile time checks. If any of these checks cannot be verified at compile time, | |
| 4429 // we do not make a fast path for this call. Instead, we let the call remain as it | |
| 4430 // is. The checks we choose to mandate at compile time are: | |
| 4431 // | |
| 4432 // (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
|
4433 const Type* src_type = src->Value(&_gvn); |
| 0 | 4434 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
|
4435 const TypeAryPtr* top_src = src_type->isa_aryptr(); |
| 0 | 4436 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); |
| 4437 if (top_src == NULL || top_src->klass() == NULL || | |
| 4438 top_dest == NULL || top_dest->klass() == NULL) { | |
| 4439 // Conservatively insert a memory barrier on all memory slices. | |
| 4440 // Do not let writes into the source float below the arraycopy. | |
| 4441 insert_mem_bar(Op_MemBarCPUOrder); | |
| 4442 | |
| 4443 // Call StubRoutines::generic_arraycopy stub. | |
| 4444 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
|
4445 src, src_offset, dest, dest_offset, length); |
| 0 | 4446 |
| 4447 // Do not let reads from the destination float above the arraycopy. | |
| 4448 // Since we cannot type the arrays, we don't know which slices | |
| 4449 // might be affected. We could restrict this barrier only to those | |
| 4450 // memory slices which pertain to array elements--but don't bother. | |
| 4451 if (!InsertMemBarAfterArraycopy) | |
| 4452 // (If InsertMemBarAfterArraycopy, there is already one in place.) | |
| 4453 insert_mem_bar(Op_MemBarCPUOrder); | |
| 4454 return true; | |
| 4455 } | |
| 4456 | |
| 4457 // (2) src and dest arrays must have elements of the same BasicType | |
| 4458 // Figure out the size and type of the elements we will be copying. | |
| 4459 BasicType src_elem = top_src->klass()->as_array_klass()->element_type()->basic_type(); | |
| 4460 BasicType dest_elem = top_dest->klass()->as_array_klass()->element_type()->basic_type(); | |
| 4461 if (src_elem == T_ARRAY) src_elem = T_OBJECT; | |
| 4462 if (dest_elem == T_ARRAY) dest_elem = T_OBJECT; | |
| 4463 | |
| 4464 if (src_elem != dest_elem || dest_elem == T_VOID) { | |
| 4465 // The component types are not the same or are not recognized. Punt. | |
| 4466 // (But, avoid the native method wrapper to JVM_ArrayCopy.) | |
| 4467 generate_slow_arraycopy(TypePtr::BOTTOM, | |
| 2324 | 4468 src, src_offset, dest, dest_offset, length, |
| 4469 /*dest_uninitialized*/false); | |
| 0 | 4470 return true; |
| 4471 } | |
| 4472 | |
| 4473 //--------------------------------------------------------------------------- | |
| 4474 // We will make a fast path for this call to arraycopy. | |
| 4475 | |
| 4476 // We have the following tests left to perform: | |
| 4477 // | |
| 4478 // (3) src and dest must not be null. | |
| 4479 // (4) src_offset must not be negative. | |
| 4480 // (5) dest_offset must not be negative. | |
| 4481 // (6) length must not be negative. | |
| 4482 // (7) src_offset + length must not exceed length of src. | |
| 4483 // (8) dest_offset + length must not exceed length of dest. | |
| 4484 // (9) each element of an oop array must be assignable | |
| 4485 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4486 RegionNode* slow_region = new (C) RegionNode(1); |
| 0 | 4487 record_for_igvn(slow_region); |
| 4488 | |
| 4489 // (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
|
4490 // We currently perform our null checks with the null_check routine. |
| 0 | 4491 // This means that the null exceptions will be reported in the caller |
| 4492 // rather than (correctly) reported inside of the native arraycopy call. | |
| 4493 // This should be corrected, given time. We do our null check with the | |
| 4494 // stack pointer restored. | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4495 src = null_check(src, T_ARRAY); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
4496 dest = null_check(dest, T_ARRAY); |
| 0 | 4497 |
| 4498 // (4) src_offset must not be negative. | |
| 4499 generate_negative_guard(src_offset, slow_region); | |
| 4500 | |
| 4501 // (5) dest_offset must not be negative. | |
| 4502 generate_negative_guard(dest_offset, slow_region); | |
| 4503 | |
| 4504 // (6) length must not be negative (moved to generate_arraycopy()). | |
| 4505 // generate_negative_guard(length, slow_region); | |
| 4506 | |
| 4507 // (7) src_offset + length must not exceed length of src. | |
| 4508 generate_limit_guard(src_offset, length, | |
| 4509 load_array_length(src), | |
| 4510 slow_region); | |
| 4511 | |
| 4512 // (8) dest_offset + length must not exceed length of dest. | |
| 4513 generate_limit_guard(dest_offset, length, | |
| 4514 load_array_length(dest), | |
| 4515 slow_region); | |
| 4516 | |
| 4517 // (9) each element of an oop array must be assignable | |
| 4518 // The generate_arraycopy subroutine checks this. | |
| 4519 | |
| 4520 // This is where the memory effects are placed: | |
| 4521 const TypePtr* adr_type = TypeAryPtr::get_array_body_type(dest_elem); | |
| 4522 generate_arraycopy(adr_type, dest_elem, | |
| 4523 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
|
4524 false, false, slow_region); |
| 0 | 4525 |
| 4526 return true; | |
| 4527 } | |
| 4528 | |
| 4529 //-----------------------------generate_arraycopy---------------------- | |
| 4530 // Generate an optimized call to arraycopy. | |
| 4531 // Caller must guard against non-arrays. | |
| 4532 // Caller must determine a common array basic-type for both arrays. | |
| 4533 // Caller must validate offsets against array bounds. | |
| 4534 // The slow_region has already collected guard failure paths | |
| 4535 // (such as out of bounds length or non-conformable array types). | |
| 4536 // The generated code has this shape, in general: | |
| 4537 // | |
| 4538 // if (length == 0) return // via zero_path | |
| 4539 // slowval = -1 | |
| 4540 // if (types unknown) { | |
| 4541 // slowval = call generic copy loop | |
| 4542 // if (slowval == 0) return // via checked_path | |
| 4543 // } else if (indexes in bounds) { | |
| 4544 // if ((is object array) && !(array type check)) { | |
| 4545 // slowval = call checked copy loop | |
| 4546 // if (slowval == 0) return // via checked_path | |
| 4547 // } else { | |
| 4548 // call bulk copy loop | |
| 4549 // return // via fast_path | |
| 4550 // } | |
| 4551 // } | |
| 4552 // // adjust params for remaining work: | |
| 4553 // if (slowval != -1) { | |
| 4554 // n = -1^slowval; src_offset += n; dest_offset += n; length -= n | |
| 4555 // } | |
| 4556 // slow_region: | |
| 4557 // call slow arraycopy(src, src_offset, dest, dest_offset, length) | |
| 4558 // return // via slow_call_path | |
| 4559 // | |
| 4560 // This routine is used from several intrinsics: System.arraycopy, | |
| 4561 // Object.clone (the array subcase), and Arrays.copyOf[Range]. | |
| 4562 // | |
| 4563 void | |
| 4564 LibraryCallKit::generate_arraycopy(const TypePtr* adr_type, | |
| 4565 BasicType basic_elem_type, | |
| 4566 Node* src, Node* src_offset, | |
| 4567 Node* dest, Node* dest_offset, | |
| 4568 Node* copy_length, | |
| 4569 bool disjoint_bases, | |
| 4570 bool length_never_negative, | |
| 4571 RegionNode* slow_region) { | |
| 4572 | |
| 4573 if (slow_region == NULL) { | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4574 slow_region = new(C) RegionNode(1); |
| 0 | 4575 record_for_igvn(slow_region); |
| 4576 } | |
| 4577 | |
| 4578 Node* original_dest = dest; | |
| 4579 AllocateArrayNode* alloc = NULL; // used for zeroing, if needed | |
| 2324 | 4580 bool dest_uninitialized = false; |
| 0 | 4581 |
| 4582 // See if this is the initialization of a newly-allocated array. | |
| 4583 // If so, we will take responsibility here for initializing it to zero. | |
| 4584 // (Note: Because tightly_coupled_allocation performs checks on the | |
| 4585 // out-edges of the dest, we need to avoid making derived pointers | |
| 4586 // from it until we have checked its uses.) | |
| 4587 if (ReduceBulkZeroing | |
| 4588 && !ZeroTLAB // pointless if already zeroed | |
| 4589 && basic_elem_type != T_CONFLICT // avoid corner case | |
| 4778 | 4590 && !src->eqv_uncast(dest) |
| 0 | 4591 && ((alloc = tightly_coupled_allocation(dest, slow_region)) |
| 4592 != NULL) | |
|
34
545c277a3ecf
6667581: Don't generate initialization (by 0) code for arrays with size 0
kvn
parents:
29
diff
changeset
|
4593 && _gvn.find_int_con(alloc->in(AllocateNode::ALength), 1) > 0 |
| 0 | 4594 && alloc->maybe_set_complete(&_gvn)) { |
| 4595 // "You break it, you buy it." | |
| 4596 InitializeNode* init = alloc->initialization(); | |
| 4597 assert(init->is_complete(), "we just did this"); | |
|
3961
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3742
diff
changeset
|
4598 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
|
4599 assert(dest->is_CheckCastPP(), "sanity"); |
| 0 | 4600 assert(dest->in(0)->in(0) == init, "dest pinned"); |
| 4601 adr_type = TypeRawPtr::BOTTOM; // all initializations are into raw memory | |
| 4602 // From this point on, every exit path is responsible for | |
| 4603 // initializing any non-copied parts of the object to zero. | |
| 2324 | 4604 // Also, if this flag is set we make sure that arraycopy interacts properly |
| 4605 // with G1, eliding pre-barriers. See CR 6627983. | |
| 4606 dest_uninitialized = true; | |
| 0 | 4607 } else { |
| 4608 // No zeroing elimination here. | |
| 4609 alloc = NULL; | |
| 4610 //original_dest = dest; | |
| 2324 | 4611 //dest_uninitialized = false; |
| 0 | 4612 } |
| 4613 | |
| 4614 // Results are placed here: | |
| 4615 enum { fast_path = 1, // normal void-returning assembly stub | |
| 4616 checked_path = 2, // special assembly stub with cleanup | |
| 4617 slow_call_path = 3, // something went wrong; call the VM | |
| 4618 zero_path = 4, // bypass when length of copy is zero | |
| 4619 bcopy_path = 5, // copy primitive array by 64-bit blocks | |
| 4620 PATH_LIMIT = 6 | |
| 4621 }; | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4622 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
|
4623 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
|
4624 PhiNode* result_memory = new(C) PhiNode(result_region, Type::MEMORY, adr_type); |
| 0 | 4625 record_for_igvn(result_region); |
| 4626 _gvn.set_type_bottom(result_i_o); | |
| 4627 _gvn.set_type_bottom(result_memory); | |
| 4628 assert(adr_type != TypePtr::BOTTOM, "must be RawMem or a T[] slice"); | |
| 4629 | |
| 4630 // The slow_control path: | |
| 4631 Node* slow_control; | |
| 4632 Node* slow_i_o = i_o(); | |
| 4633 Node* slow_mem = memory(adr_type); | |
| 4634 debug_only(slow_control = (Node*) badAddress); | |
| 4635 | |
| 4636 // Checked control path: | |
| 4637 Node* checked_control = top(); | |
| 4638 Node* checked_mem = NULL; | |
| 4639 Node* checked_i_o = NULL; | |
| 4640 Node* checked_value = NULL; | |
| 4641 | |
| 4642 if (basic_elem_type == T_CONFLICT) { | |
| 2324 | 4643 assert(!dest_uninitialized, ""); |
| 0 | 4644 Node* cv = generate_generic_arraycopy(adr_type, |
| 4645 src, src_offset, dest, dest_offset, | |
| 2324 | 4646 copy_length, dest_uninitialized); |
| 0 | 4647 if (cv == NULL) cv = intcon(-1); // failure (no stub available) |
| 4648 checked_control = control(); | |
| 4649 checked_i_o = i_o(); | |
| 4650 checked_mem = memory(adr_type); | |
| 4651 checked_value = cv; | |
| 4652 set_control(top()); // no fast path | |
| 4653 } | |
| 4654 | |
| 4655 Node* not_pos = generate_nonpositive_guard(copy_length, length_never_negative); | |
| 4656 if (not_pos != NULL) { | |
| 4657 PreserveJVMState pjvms(this); | |
| 4658 set_control(not_pos); | |
| 4659 | |
| 4660 // (6) length must not be negative. | |
| 4661 if (!length_never_negative) { | |
| 4662 generate_negative_guard(copy_length, slow_region); | |
| 4663 } | |
| 4664 | |
|
836
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
4665 // copy_length is 0. |
| 2324 | 4666 if (!stopped() && dest_uninitialized) { |
| 0 | 4667 Node* dest_length = alloc->in(AllocateNode::ALength); |
| 4778 | 4668 if (copy_length->eqv_uncast(dest_length) |
| 0 | 4669 || _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
|
4670 // There is no zeroing to do. No need for a secondary raw memory barrier. |
| 0 | 4671 } else { |
| 4672 // Clear the whole thing since there are no source elements to copy. | |
| 4673 generate_clear_array(adr_type, dest, basic_elem_type, | |
| 4674 intcon(0), NULL, | |
| 4675 alloc->in(AllocateNode::AllocSize)); | |
|
836
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
4676 // 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
|
4677 // 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
|
4678 // 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
|
4679 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
|
4680 Compile::AliasIdxRaw, |
|
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
4681 top())->as_Initialize(); |
|
4325cdaa78ad
6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents:
833
diff
changeset
|
4682 init->set_complete(&_gvn); // (there is no corresponding AllocateNode) |
| 0 | 4683 } |
| 4684 } | |
| 4685 | |
| 4686 // Present the results of the fast call. | |
| 4687 result_region->init_req(zero_path, control()); | |
| 4688 result_i_o ->init_req(zero_path, i_o()); | |
| 4689 result_memory->init_req(zero_path, memory(adr_type)); | |
| 4690 } | |
| 4691 | |
| 2324 | 4692 if (!stopped() && dest_uninitialized) { |
| 0 | 4693 // We have to initialize the *uncopied* part of the array to zero. |
| 4694 // The copy destination is the slice dest[off..off+len]. The other slices | |
| 4695 // are dest_head = dest[0..off] and dest_tail = dest[off+len..dest.length]. | |
| 4696 Node* dest_size = alloc->in(AllocateNode::AllocSize); | |
| 4697 Node* dest_length = alloc->in(AllocateNode::ALength); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4698 Node* dest_tail = _gvn.transform( new(C) AddINode(dest_offset, |
| 0 | 4699 copy_length) ); |
| 4700 | |
| 4701 // If there is a head section that needs zeroing, do it now. | |
| 4702 if (find_int_con(dest_offset, -1) != 0) { | |
| 4703 generate_clear_array(adr_type, dest, basic_elem_type, | |
| 4704 intcon(0), dest_offset, | |
| 4705 NULL); | |
| 4706 } | |
| 4707 | |
| 4708 // Next, perform a dynamic check on the tail length. | |
| 4709 // It is often zero, and we can win big if we prove this. | |
| 4710 // There are two wins: Avoid generating the ClearArray | |
| 4711 // with its attendant messy index arithmetic, and upgrade | |
| 4712 // the copy to a more hardware-friendly word size of 64 bits. | |
| 4713 Node* tail_ctl = NULL; | |
| 4778 | 4714 if (!stopped() && !dest_tail->eqv_uncast(dest_length)) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4715 Node* cmp_lt = _gvn.transform( new(C) CmpINode(dest_tail, dest_length) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4716 Node* bol_lt = _gvn.transform( new(C) BoolNode(cmp_lt, BoolTest::lt) ); |
| 0 | 4717 tail_ctl = generate_slow_guard(bol_lt, NULL); |
| 4718 assert(tail_ctl != NULL || !stopped(), "must be an outcome"); | |
| 4719 } | |
| 4720 | |
| 4721 // At this point, let's assume there is no tail. | |
| 4722 if (!stopped() && alloc != NULL && basic_elem_type != T_OBJECT) { | |
| 4723 // There is no tail. Try an upgrade to a 64-bit copy. | |
| 4724 bool didit = false; | |
| 4725 { PreserveJVMState pjvms(this); | |
| 4726 didit = generate_block_arraycopy(adr_type, basic_elem_type, alloc, | |
| 4727 src, src_offset, dest, dest_offset, | |
| 2324 | 4728 dest_size, dest_uninitialized); |
| 0 | 4729 if (didit) { |
| 4730 // Present the results of the block-copying fast call. | |
| 4731 result_region->init_req(bcopy_path, control()); | |
| 4732 result_i_o ->init_req(bcopy_path, i_o()); | |
| 4733 result_memory->init_req(bcopy_path, memory(adr_type)); | |
| 4734 } | |
| 4735 } | |
| 4736 if (didit) | |
| 4737 set_control(top()); // no regular fast path | |
| 4738 } | |
| 4739 | |
| 4740 // Clear the tail, if any. | |
| 4741 if (tail_ctl != NULL) { | |
| 4742 Node* notail_ctl = stopped() ? NULL : control(); | |
| 4743 set_control(tail_ctl); | |
| 4744 if (notail_ctl == NULL) { | |
| 4745 generate_clear_array(adr_type, dest, basic_elem_type, | |
| 4746 dest_tail, NULL, | |
| 4747 dest_size); | |
| 4748 } else { | |
| 4749 // Make a local merge. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4750 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
|
4751 Node* done_mem = new(C) PhiNode(done_ctl, Type::MEMORY, adr_type); |
| 0 | 4752 done_ctl->init_req(1, notail_ctl); |
| 4753 done_mem->init_req(1, memory(adr_type)); | |
| 4754 generate_clear_array(adr_type, dest, basic_elem_type, | |
| 4755 dest_tail, NULL, | |
| 4756 dest_size); | |
| 4757 done_ctl->init_req(2, control()); | |
| 4758 done_mem->init_req(2, memory(adr_type)); | |
| 4759 set_control( _gvn.transform(done_ctl) ); | |
| 4760 set_memory( _gvn.transform(done_mem), adr_type ); | |
| 4761 } | |
| 4762 } | |
| 4763 } | |
| 4764 | |
| 4765 BasicType copy_type = basic_elem_type; | |
| 4766 assert(basic_elem_type != T_ARRAY, "caller must fix this"); | |
| 4767 if (!stopped() && copy_type == T_OBJECT) { | |
| 4768 // If src and dest have compatible element types, we can copy bits. | |
| 4769 // Types S[] and D[] are compatible if D is a supertype of S. | |
| 4770 // | |
| 4771 // If they are not, we will use checked_oop_disjoint_arraycopy, | |
| 4772 // which performs a fast optimistic per-oop check, and backs off | |
| 4773 // further to JVM_ArrayCopy on the first per-oop check that fails. | |
| 4774 // (Actually, we don't move raw bits only; the GC requires card marks.) | |
| 4775 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6615
diff
changeset
|
4776 // Get the Klass* for both src and dest |
| 0 | 4777 Node* src_klass = load_object_klass(src); |
| 4778 Node* dest_klass = load_object_klass(dest); | |
| 4779 | |
| 4780 // Generate the subtype check. | |
| 4781 // This might fold up statically, or then again it might not. | |
| 4782 // | |
| 4783 // Non-static example: Copying List<String>.elements to a new String[]. | |
| 4784 // The backing store for a List<String> is always an Object[], | |
| 4785 // but its elements are always type String, if the generic types | |
| 4786 // are correct at the source level. | |
| 4787 // | |
| 4788 // Test S[] against D[], not S against D, because (probably) | |
| 4789 // the secondary supertype cache is less busy for S[] than S. | |
| 4790 // This usually only matters when D is an interface. | |
| 4791 Node* not_subtype_ctrl = gen_subtype_check(src_klass, dest_klass); | |
| 4792 // Plug failing path into checked_oop_disjoint_arraycopy | |
| 4793 if (not_subtype_ctrl != top()) { | |
| 4794 PreserveJVMState pjvms(this); | |
| 4795 set_control(not_subtype_ctrl); | |
| 4796 // (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
|
4797 int ek_offset = in_bytes(ObjArrayKlass::element_klass_offset()); |
| 0 | 4798 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
|
4799 Node* n1 = LoadKlassNode::make(_gvn, immutable_memory(), p1, TypeRawPtr::BOTTOM); |
| 0 | 4800 Node* dest_elem_klass = _gvn.transform(n1); |
| 4801 Node* cv = generate_checkcast_arraycopy(adr_type, | |
| 4802 dest_elem_klass, | |
| 4803 src, src_offset, dest, dest_offset, | |
| 2324 | 4804 ConvI2X(copy_length), dest_uninitialized); |
| 0 | 4805 if (cv == NULL) cv = intcon(-1); // failure (no stub available) |
| 4806 checked_control = control(); | |
| 4807 checked_i_o = i_o(); | |
| 4808 checked_mem = memory(adr_type); | |
| 4809 checked_value = cv; | |
| 4810 } | |
| 4811 // At this point we know we do not need type checks on oop stores. | |
| 4812 | |
| 4813 // Let's see if we need card marks: | |
| 4814 if (alloc != NULL && use_ReduceInitialCardMarks()) { | |
| 4815 // 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
|
4816 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
|
4817 assert(type2aelembytes(basic_elem_type) == type2aelembytes(copy_type), |
| 0 | 4818 "sizes agree"); |
| 4819 } | |
| 4820 } | |
| 4821 | |
| 4822 if (!stopped()) { | |
| 4823 // Generate the fast path, if possible. | |
| 4824 PreserveJVMState pjvms(this); | |
| 4825 generate_unchecked_arraycopy(adr_type, copy_type, disjoint_bases, | |
| 4826 src, src_offset, dest, dest_offset, | |
| 2324 | 4827 ConvI2X(copy_length), dest_uninitialized); |
| 0 | 4828 |
| 4829 // Present the results of the fast call. | |
| 4830 result_region->init_req(fast_path, control()); | |
| 4831 result_i_o ->init_req(fast_path, i_o()); | |
| 4832 result_memory->init_req(fast_path, memory(adr_type)); | |
| 4833 } | |
| 4834 | |
| 4835 // Here are all the slow paths up to this point, in one bundle: | |
| 4836 slow_control = top(); | |
| 4837 if (slow_region != NULL) | |
| 4838 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
|
4839 DEBUG_ONLY(slow_region = (RegionNode*)badAddress); |
| 0 | 4840 |
| 4841 set_control(checked_control); | |
| 4842 if (!stopped()) { | |
| 4843 // Clean up after the checked call. | |
| 4844 // The returned value is either 0 or -1^K, | |
| 4845 // where K = number of partially transferred array elements. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4846 Node* cmp = _gvn.transform( new(C) CmpINode(checked_value, intcon(0)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4847 Node* bol = _gvn.transform( new(C) BoolNode(cmp, BoolTest::eq) ); |
| 0 | 4848 IfNode* iff = create_and_map_if(control(), bol, PROB_MAX, COUNT_UNKNOWN); |
| 4849 | |
| 4850 // If it is 0, we are done, so transfer to the end. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4851 Node* checks_done = _gvn.transform( new(C) IfTrueNode(iff) ); |
| 0 | 4852 result_region->init_req(checked_path, checks_done); |
| 4853 result_i_o ->init_req(checked_path, checked_i_o); | |
| 4854 result_memory->init_req(checked_path, checked_mem); | |
| 4855 | |
| 4856 // If it is not zero, merge into the slow call. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4857 set_control( _gvn.transform( new(C) IfFalseNode(iff) )); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4858 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
|
4859 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
|
4860 PhiNode* slow_mem2 = new(C) PhiNode(slow_reg2, Type::MEMORY, adr_type); |
| 0 | 4861 record_for_igvn(slow_reg2); |
| 4862 slow_reg2 ->init_req(1, slow_control); | |
| 4863 slow_i_o2 ->init_req(1, slow_i_o); | |
| 4864 slow_mem2 ->init_req(1, slow_mem); | |
| 4865 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
|
4866 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
|
4867 slow_mem2 ->init_req(2, checked_mem); |
| 0 | 4868 |
| 4869 slow_control = _gvn.transform(slow_reg2); | |
| 4870 slow_i_o = _gvn.transform(slow_i_o2); | |
| 4871 slow_mem = _gvn.transform(slow_mem2); | |
| 4872 | |
| 4873 if (alloc != NULL) { | |
| 4874 // We'll restart from the very beginning, after zeroing the whole thing. | |
| 4875 // This can cause double writes, but that's OK since dest is brand new. | |
| 4876 // So we ignore the low 31 bits of the value returned from the stub. | |
| 4877 } else { | |
| 4878 // We must continue the copy exactly where it failed, or else | |
| 4879 // another thread might see the wrong number of writes to dest. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4880 Node* checked_offset = _gvn.transform( new(C) XorINode(checked_value, intcon(-1)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4881 Node* slow_offset = new(C) PhiNode(slow_reg2, TypeInt::INT); |
| 0 | 4882 slow_offset->init_req(1, intcon(0)); |
| 4883 slow_offset->init_req(2, checked_offset); | |
| 4884 slow_offset = _gvn.transform(slow_offset); | |
| 4885 | |
| 4886 // Adjust the arguments by the conditionally incoming offset. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4887 Node* src_off_plus = _gvn.transform( new(C) AddINode(src_offset, slow_offset) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4888 Node* dest_off_plus = _gvn.transform( new(C) AddINode(dest_offset, slow_offset) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
4889 Node* length_minus = _gvn.transform( new(C) SubINode(copy_length, slow_offset) ); |
| 0 | 4890 |
| 4891 // Tweak the node variables to adjust the code produced below: | |
| 4892 src_offset = src_off_plus; | |
| 4893 dest_offset = dest_off_plus; | |
| 4894 copy_length = length_minus; | |
| 4895 } | |
| 4896 } | |
| 4897 | |
| 4898 set_control(slow_control); | |
| 4899 if (!stopped()) { | |
| 4900 // Generate the slow path, if needed. | |
| 4901 PreserveJVMState pjvms(this); // replace_in_map may trash the map | |
| 4902 | |
| 4903 set_memory(slow_mem, adr_type); | |
| 4904 set_i_o(slow_i_o); | |
| 4905 | |
| 2324 | 4906 if (dest_uninitialized) { |
| 0 | 4907 generate_clear_array(adr_type, dest, basic_elem_type, |
| 4908 intcon(0), NULL, | |
| 4909 alloc->in(AllocateNode::AllocSize)); | |
| 4910 } | |
| 4911 | |
| 4912 generate_slow_arraycopy(adr_type, | |
| 4913 src, src_offset, dest, dest_offset, | |
| 2324 | 4914 copy_length, /*dest_uninitialized*/false); |
| 0 | 4915 |
| 4916 result_region->init_req(slow_call_path, control()); | |
| 4917 result_i_o ->init_req(slow_call_path, i_o()); | |
| 4918 result_memory->init_req(slow_call_path, memory(adr_type)); | |
| 4919 } | |
| 4920 | |
| 4921 // Remove unused edges. | |
| 4922 for (uint i = 1; i < result_region->req(); i++) { | |
| 4923 if (result_region->in(i) == NULL) | |
| 4924 result_region->init_req(i, top()); | |
| 4925 } | |
| 4926 | |
| 4927 // Finished; return the combined state. | |
| 4928 set_control( _gvn.transform(result_region) ); | |
| 4929 set_i_o( _gvn.transform(result_i_o) ); | |
| 4930 set_memory( _gvn.transform(result_memory), adr_type ); | |
| 4931 | |
| 4932 // The memory edges above are precise in order to model effects around | |
| 605 | 4933 // array copies accurately to allow value numbering of field loads around |
| 0 | 4934 // arraycopy. Such field loads, both before and after, are common in Java |
| 4935 // collections and similar classes involving header/array data structures. | |
| 4936 // | |
| 4937 // But with low number of register or when some registers are used or killed | |
| 4938 // by arraycopy calls it causes registers spilling on stack. See 6544710. | |
| 4939 // The next memory barrier is added to avoid it. If the arraycopy can be | |
| 4940 // optimized away (which it can, sometimes) then we can manually remove | |
| 4941 // the membar also. | |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4942 // |
|
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
950
diff
changeset
|
4943 // 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
|
4944 if (alloc != NULL) { |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4945 // 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
|
4946 // 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
|
4947 // other threads. |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4948 // 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
|
4949 // 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
|
4950 // AllocateNode and eliminate the MemBarStoreStoreNode if possible |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4762
diff
changeset
|
4951 // 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
|
4952 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
|
4953 } else if (InsertMemBarAfterArraycopy) |
| 0 | 4954 insert_mem_bar(Op_MemBarCPUOrder); |
| 4955 } | |
| 4956 | |
| 4957 | |
| 4958 // Helper function which determines if an arraycopy immediately follows | |
| 4959 // an allocation, with no intervening tests or other escapes for the object. | |
| 4960 AllocateArrayNode* | |
| 4961 LibraryCallKit::tightly_coupled_allocation(Node* ptr, | |
| 4962 RegionNode* slow_region) { | |
| 4963 if (stopped()) return NULL; // no fast path | |
| 4964 if (C->AliasLevel() == 0) return NULL; // no MergeMems around | |
| 4965 | |
| 4966 AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(ptr, &_gvn); | |
| 4967 if (alloc == NULL) return NULL; | |
| 4968 | |
| 4969 Node* rawmem = memory(Compile::AliasIdxRaw); | |
| 4970 // Is the allocation's memory state untouched? | |
| 4971 if (!(rawmem->is_Proj() && rawmem->in(0)->is_Initialize())) { | |
| 4972 // Bail out if there have been raw-memory effects since the allocation. | |
| 4973 // (Example: There might have been a call or safepoint.) | |
| 4974 return NULL; | |
| 4975 } | |
| 4976 rawmem = rawmem->in(0)->as_Initialize()->memory(Compile::AliasIdxRaw); | |
| 4977 if (!(rawmem->is_Proj() && rawmem->in(0) == alloc)) { | |
| 4978 return NULL; | |
| 4979 } | |
| 4980 | |
| 4981 // There must be no unexpected observers of this allocation. | |
| 4982 for (DUIterator_Fast imax, i = ptr->fast_outs(imax); i < imax; i++) { | |
| 4983 Node* obs = ptr->fast_out(i); | |
| 4984 if (obs != this->map()) { | |
| 4985 return NULL; | |
| 4986 } | |
| 4987 } | |
| 4988 | |
| 4989 // This arraycopy must unconditionally follow the allocation of the ptr. | |
| 4990 Node* alloc_ctl = ptr->in(0); | |
| 4991 assert(just_allocated_object(alloc_ctl) == ptr, "most recent allo"); | |
| 4992 | |
| 4993 Node* ctl = control(); | |
| 4994 while (ctl != alloc_ctl) { | |
| 4995 // There may be guards which feed into the slow_region. | |
| 4996 // Any other control flow means that we might not get a chance | |
| 4997 // to finish initializing the allocated object. | |
| 4998 if ((ctl->is_IfFalse() || ctl->is_IfTrue()) && ctl->in(0)->is_If()) { | |
| 4999 IfNode* iff = ctl->in(0)->as_If(); | |
| 5000 Node* not_ctl = iff->proj_out(1 - ctl->as_Proj()->_con); | |
| 5001 assert(not_ctl != NULL && not_ctl != ctl, "found alternate"); | |
| 5002 if (slow_region != NULL && slow_region->find_edge(not_ctl) >= 1) { | |
| 5003 ctl = iff->in(0); // This test feeds the known slow_region. | |
| 5004 continue; | |
| 5005 } | |
| 5006 // One more try: Various low-level checks bottom out in | |
| 5007 // uncommon traps. If the debug-info of the trap omits | |
| 5008 // any reference to the allocation, as we've already | |
| 5009 // observed, then there can be no objection to the trap. | |
| 5010 bool found_trap = false; | |
| 5011 for (DUIterator_Fast jmax, j = not_ctl->fast_outs(jmax); j < jmax; j++) { | |
| 5012 Node* obs = not_ctl->fast_out(j); | |
| 5013 if (obs->in(0) == not_ctl && obs->is_Call() && | |
| 1748 | 5014 (obs->as_Call()->entry_point() == SharedRuntime::uncommon_trap_blob()->entry_point())) { |
| 0 | 5015 found_trap = true; break; |
| 5016 } | |
| 5017 } | |
| 5018 if (found_trap) { | |
| 5019 ctl = iff->in(0); // This test feeds a harmless uncommon trap. | |
| 5020 continue; | |
| 5021 } | |
| 5022 } | |
| 5023 return NULL; | |
| 5024 } | |
| 5025 | |
| 5026 // If we get this far, we have an allocation which immediately | |
| 5027 // precedes the arraycopy, and we can take over zeroing the new object. | |
| 5028 // The arraycopy will finish the initialization, and provide | |
| 5029 // a new control state to which we will anchor the destination pointer. | |
| 5030 | |
| 5031 return alloc; | |
| 5032 } | |
| 5033 | |
| 5034 // Helper for initialization of arrays, creating a ClearArray. | |
| 5035 // It writes zero bits in [start..end), within the body of an array object. | |
| 5036 // The memory effects are all chained onto the 'adr_type' alias category. | |
| 5037 // | |
| 5038 // Since the object is otherwise uninitialized, we are free | |
| 5039 // to put a little "slop" around the edges of the cleared area, | |
| 5040 // as long as it does not go back into the array's header, | |
| 5041 // or beyond the array end within the heap. | |
| 5042 // | |
| 5043 // The lower edge can be rounded down to the nearest jint and the | |
| 5044 // upper edge can be rounded up to the nearest MinObjAlignmentInBytes. | |
| 5045 // | |
| 5046 // Arguments: | |
| 5047 // adr_type memory slice where writes are generated | |
| 5048 // dest oop of the destination array | |
| 5049 // basic_elem_type element type of the destination | |
| 5050 // slice_idx array index of first element to store | |
| 5051 // slice_len number of elements to store (or NULL) | |
| 5052 // dest_size total size in bytes of the array object | |
| 5053 // | |
| 5054 // Exactly one of slice_len or dest_size must be non-NULL. | |
| 5055 // If dest_size is non-NULL, zeroing extends to the end of the object. | |
| 5056 // If slice_len is non-NULL, the slice_idx value must be a constant. | |
| 5057 void | |
| 5058 LibraryCallKit::generate_clear_array(const TypePtr* adr_type, | |
| 5059 Node* dest, | |
| 5060 BasicType basic_elem_type, | |
| 5061 Node* slice_idx, | |
| 5062 Node* slice_len, | |
| 5063 Node* dest_size) { | |
| 5064 // one or the other but not both of slice_len and dest_size: | |
| 5065 assert((slice_len != NULL? 1: 0) + (dest_size != NULL? 1: 0) == 1, ""); | |
| 5066 if (slice_len == NULL) slice_len = top(); | |
| 5067 if (dest_size == NULL) dest_size = top(); | |
| 5068 | |
| 5069 // operate on this memory slice: | |
| 5070 Node* mem = memory(adr_type); // memory slice to operate on | |
| 5071 | |
| 5072 // scaling and rounding of indexes: | |
|
29
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
0
diff
changeset
|
5073 int scale = exact_log2(type2aelembytes(basic_elem_type)); |
| 0 | 5074 int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type); |
| 5075 int clear_low = (-1 << scale) & (BytesPerInt - 1); | |
| 5076 int bump_bit = (-1 << scale) & BytesPerInt; | |
| 5077 | |
| 5078 // determine constant starts and ends | |
| 5079 const intptr_t BIG_NEG = -128; | |
| 5080 assert(BIG_NEG + 2*abase < 0, "neg enough"); | |
| 5081 intptr_t slice_idx_con = (intptr_t) find_int_con(slice_idx, BIG_NEG); | |
| 5082 intptr_t slice_len_con = (intptr_t) find_int_con(slice_len, BIG_NEG); | |
| 5083 if (slice_len_con == 0) { | |
| 5084 return; // nothing to do here | |
| 5085 } | |
| 5086 intptr_t start_con = (abase + (slice_idx_con << scale)) & ~clear_low; | |
| 5087 intptr_t end_con = find_intptr_t_con(dest_size, -1); | |
| 5088 if (slice_idx_con >= 0 && slice_len_con >= 0) { | |
| 5089 assert(end_con < 0, "not two cons"); | |
| 5090 end_con = round_to(abase + ((slice_idx_con + slice_len_con) << scale), | |
| 5091 BytesPerLong); | |
| 5092 } | |
| 5093 | |
| 5094 if (start_con >= 0 && end_con >= 0) { | |
| 5095 // Constant start and end. Simple. | |
| 5096 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
| 5097 start_con, end_con, &_gvn); | |
| 5098 } else if (start_con >= 0 && dest_size != top()) { | |
| 5099 // Constant start, pre-rounded end after the tail of the array. | |
| 5100 Node* end = dest_size; | |
| 5101 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
| 5102 start_con, end, &_gvn); | |
| 5103 } else if (start_con >= 0 && slice_len != top()) { | |
| 5104 // Constant start, non-constant end. End needs rounding up. | |
| 5105 // End offset = round_up(abase + ((slice_idx_con + slice_len) << scale), 8) | |
| 5106 intptr_t end_base = abase + (slice_idx_con << scale); | |
| 5107 int end_round = (-1 << scale) & (BytesPerLong - 1); | |
| 5108 Node* end = ConvI2X(slice_len); | |
| 5109 if (scale != 0) | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5110 end = _gvn.transform( new(C) LShiftXNode(end, intcon(scale) )); |
| 0 | 5111 end_base += end_round; |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5112 end = _gvn.transform( new(C) AddXNode(end, MakeConX(end_base)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5113 end = _gvn.transform( new(C) AndXNode(end, MakeConX(~end_round)) ); |
| 0 | 5114 mem = ClearArrayNode::clear_memory(control(), mem, dest, |
| 5115 start_con, end, &_gvn); | |
| 5116 } else if (start_con < 0 && dest_size != top()) { | |
| 5117 // Non-constant start, pre-rounded end after the tail of the array. | |
| 5118 // This is almost certainly a "round-to-end" operation. | |
| 5119 Node* start = slice_idx; | |
| 5120 start = ConvI2X(start); | |
| 5121 if (scale != 0) | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5122 start = _gvn.transform( new(C) LShiftXNode( start, intcon(scale) )); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5123 start = _gvn.transform( new(C) AddXNode(start, MakeConX(abase)) ); |
| 0 | 5124 if ((bump_bit | clear_low) != 0) { |
| 5125 int to_clear = (bump_bit | clear_low); | |
| 5126 // Align up mod 8, then store a jint zero unconditionally | |
| 5127 // 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
|
5128 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
|
5129 < 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
|
5130 bump_bit = 0; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5131 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
|
5132 } else { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5133 // Bump 'start' up to (or past) the next jint boundary: |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5134 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
|
5135 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
|
5136 } |
| 0 | 5137 // Round bumped 'start' down to jlong boundary in body of array. |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5138 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
|
5139 if (bump_bit != 0) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5140 // Store a zero to the immediately preceding jint: |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5141 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
|
5142 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
|
5143 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
|
5144 mem = _gvn.transform(mem); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
34
diff
changeset
|
5145 } |
| 0 | 5146 } |
| 5147 Node* end = dest_size; // pre-rounded | |
| 5148 mem = ClearArrayNode::clear_memory(control(), mem, dest, | |
| 5149 start, end, &_gvn); | |
| 5150 } else { | |
| 5151 // Non-constant start, unrounded non-constant end. | |
| 5152 // (Nobody zeroes a random midsection of an array using this routine.) | |
| 5153 ShouldNotReachHere(); // fix caller | |
| 5154 } | |
| 5155 | |
| 5156 // Done. | |
| 5157 set_memory(mem, adr_type); | |
| 5158 } | |
| 5159 | |
| 5160 | |
| 5161 bool | |
| 5162 LibraryCallKit::generate_block_arraycopy(const TypePtr* adr_type, | |
| 5163 BasicType basic_elem_type, | |
| 5164 AllocateNode* alloc, | |
| 5165 Node* src, Node* src_offset, | |
| 5166 Node* dest, Node* dest_offset, | |
| 2324 | 5167 Node* dest_size, bool dest_uninitialized) { |
| 0 | 5168 // 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
|
5169 int scale = exact_log2(type2aelembytes(basic_elem_type)); |
| 0 | 5170 if (scale >= LogBytesPerLong) |
| 5171 return false; // it is already a block transfer | |
| 5172 | |
| 5173 // Look at the alignment of the starting offsets. | |
| 5174 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
|
5175 |
|
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5176 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
|
5177 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
|
5178 if (src_off_con < 0 || dest_off_con < 0) |
| 0 | 5179 // At present, we can only understand constants. |
| 5180 return false; | |
| 5181 | |
|
3742
b2cb497dec28
7047069: Array can dynamically change size when assigned to an object field
kvn
parents:
3337
diff
changeset
|
5182 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
|
5183 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
|
5184 |
| 0 | 5185 if (((src_off | dest_off) & (BytesPerLong-1)) != 0) { |
| 5186 // Non-aligned; too bad. | |
| 5187 // One more chance: Pick off an initial 32-bit word. | |
| 5188 // This is a common case, since abase can be odd mod 8. | |
| 5189 if (((src_off | dest_off) & (BytesPerLong-1)) == BytesPerInt && | |
| 5190 ((src_off ^ dest_off) & (BytesPerLong-1)) == 0) { | |
| 5191 Node* sptr = basic_plus_adr(src, src_off); | |
| 5192 Node* dptr = basic_plus_adr(dest, dest_off); | |
| 5193 Node* sval = make_load(control(), sptr, TypeInt::INT, T_INT, adr_type); | |
| 5194 store_to_memory(control(), dptr, sval, T_INT, adr_type); | |
| 5195 src_off += BytesPerInt; | |
| 5196 dest_off += BytesPerInt; | |
| 5197 } else { | |
| 5198 return false; | |
| 5199 } | |
| 5200 } | |
| 5201 assert(src_off % BytesPerLong == 0, ""); | |
| 5202 assert(dest_off % BytesPerLong == 0, ""); | |
| 5203 | |
| 5204 // Do this copy by giant steps. | |
| 5205 Node* sptr = basic_plus_adr(src, src_off); | |
| 5206 Node* dptr = basic_plus_adr(dest, dest_off); | |
| 5207 Node* countx = dest_size; | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5208 countx = _gvn.transform( new (C) SubXNode(countx, MakeConX(dest_off)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5209 countx = _gvn.transform( new (C) URShiftXNode(countx, intcon(LogBytesPerLong)) ); |
| 0 | 5210 |
| 5211 bool disjoint_bases = true; // since alloc != NULL | |
| 5212 generate_unchecked_arraycopy(adr_type, T_LONG, disjoint_bases, | |
| 2324 | 5213 sptr, NULL, dptr, NULL, countx, dest_uninitialized); |
| 0 | 5214 |
| 5215 return true; | |
| 5216 } | |
| 5217 | |
| 5218 | |
| 5219 // Helper function; generates code for the slow case. | |
| 5220 // We make a call to a runtime method which emulates the native method, | |
| 5221 // but without the native wrapper overhead. | |
| 5222 void | |
| 5223 LibraryCallKit::generate_slow_arraycopy(const TypePtr* adr_type, | |
| 5224 Node* src, Node* src_offset, | |
| 5225 Node* dest, Node* dest_offset, | |
| 2324 | 5226 Node* copy_length, bool dest_uninitialized) { |
| 5227 assert(!dest_uninitialized, "Invariant"); | |
| 0 | 5228 Node* call = make_runtime_call(RC_NO_LEAF | RC_UNCOMMON, |
| 5229 OptoRuntime::slow_arraycopy_Type(), | |
| 5230 OptoRuntime::slow_arraycopy_Java(), | |
| 5231 "slow_arraycopy", adr_type, | |
| 5232 src, src_offset, dest, dest_offset, | |
| 5233 copy_length); | |
| 5234 | |
| 5235 // Handle exceptions thrown by this fellow: | |
| 5236 make_slow_call_ex(call, env()->Throwable_klass(), false); | |
| 5237 } | |
| 5238 | |
| 5239 // Helper function; generates code for cases requiring runtime checks. | |
| 5240 Node* | |
| 5241 LibraryCallKit::generate_checkcast_arraycopy(const TypePtr* adr_type, | |
| 5242 Node* dest_elem_klass, | |
| 5243 Node* src, Node* src_offset, | |
| 5244 Node* dest, Node* dest_offset, | |
| 2324 | 5245 Node* copy_length, bool dest_uninitialized) { |
| 0 | 5246 if (stopped()) return NULL; |
| 5247 | |
| 2324 | 5248 address copyfunc_addr = StubRoutines::checkcast_arraycopy(dest_uninitialized); |
| 0 | 5249 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path. |
| 5250 return NULL; | |
| 5251 } | |
| 5252 | |
| 5253 // Pick out the parameters required to perform a store-check | |
| 5254 // for the target array. This is an optimistic check. It will | |
| 5255 // look in each non-null element's class, at the desired klass's | |
| 5256 // 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
|
5257 int sco_offset = in_bytes(Klass::super_check_offset_offset()); |
| 0 | 5258 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
|
5259 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
|
5260 Node* check_offset = ConvI2X(_gvn.transform(n3)); |
| 0 | 5261 Node* check_value = dest_elem_klass; |
| 5262 | |
| 5263 Node* src_start = array_element_address(src, src_offset, T_OBJECT); | |
| 5264 Node* dest_start = array_element_address(dest, dest_offset, T_OBJECT); | |
| 5265 | |
| 5266 // (We know the arrays are never conjoint, because their types differ.) | |
| 5267 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, | |
| 5268 OptoRuntime::checkcast_arraycopy_Type(), | |
| 5269 copyfunc_addr, "checkcast_arraycopy", adr_type, | |
| 5270 // five arguments, of which two are | |
| 5271 // intptr_t (jlong in LP64) | |
| 5272 src_start, dest_start, | |
| 5273 copy_length XTOP, | |
| 5274 check_offset XTOP, | |
| 5275 check_value); | |
| 5276 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5277 return _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
| 0 | 5278 } |
| 5279 | |
| 5280 | |
| 5281 // Helper function; generates code for cases requiring runtime checks. | |
| 5282 Node* | |
| 5283 LibraryCallKit::generate_generic_arraycopy(const TypePtr* adr_type, | |
| 5284 Node* src, Node* src_offset, | |
| 5285 Node* dest, Node* dest_offset, | |
| 2324 | 5286 Node* copy_length, bool dest_uninitialized) { |
| 5287 assert(!dest_uninitialized, "Invariant"); | |
| 0 | 5288 if (stopped()) return NULL; |
| 5289 address copyfunc_addr = StubRoutines::generic_arraycopy(); | |
| 5290 if (copyfunc_addr == NULL) { // Stub was not generated, go slow path. | |
| 5291 return NULL; | |
| 5292 } | |
| 5293 | |
| 5294 Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, | |
| 5295 OptoRuntime::generic_arraycopy_Type(), | |
| 5296 copyfunc_addr, "generic_arraycopy", adr_type, | |
| 5297 src, src_offset, dest, dest_offset, copy_length); | |
| 5298 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
5299 return _gvn.transform(new (C) ProjNode(call, TypeFunc::Parms)); |
| 0 | 5300 } |
| 5301 | |
| 5302 // Helper function; generates the fast out-of-line call to an arraycopy stub. | |
| 5303 void | |
| 5304 LibraryCallKit::generate_unchecked_arraycopy(const TypePtr* adr_type, | |
| 5305 BasicType basic_elem_type, | |
| 5306 bool disjoint_bases, | |
| 5307 Node* src, Node* src_offset, | |
| 5308 Node* dest, Node* dest_offset, | |
| 2324 | 5309 Node* copy_length, bool dest_uninitialized) { |
| 0 | 5310 if (stopped()) return; // nothing to do |
| 5311 | |
| 5312 Node* src_start = src; | |
| 5313 Node* dest_start = dest; | |
| 5314 if (src_offset != NULL || dest_offset != NULL) { | |
| 5315 assert(src_offset != NULL && dest_offset != NULL, ""); | |
| 5316 src_start = array_element_address(src, src_offset, basic_elem_type); | |
| 5317 dest_start = array_element_address(dest, dest_offset, basic_elem_type); | |
| 5318 } | |
| 5319 | |
| 5320 // Figure out which arraycopy runtime method to call. | |
| 5321 const char* copyfunc_name = "arraycopy"; | |
| 5322 address copyfunc_addr = | |
| 5323 basictype2arraycopy(basic_elem_type, src_offset, dest_offset, | |
| 2324 | 5324 disjoint_bases, copyfunc_name, dest_uninitialized); |
| 0 | 5325 |
| 5326 // Call it. Note that the count_ix value is not scaled to a byte-size. | |
| 5327 make_runtime_call(RC_LEAF|RC_NO_FP, | |
| 5328 OptoRuntime::fast_arraycopy_Type(), | |
| 5329 copyfunc_addr, copyfunc_name, adr_type, | |
| 5330 src_start, dest_start, copy_length XTOP); | |
| 5331 } | |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5332 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5333 //----------------------------inline_reference_get---------------------------- |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5334 // 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
|
5335 bool LibraryCallKit::inline_reference_get() { |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5336 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
|
5337 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
|
5338 |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5339 // Get the argument: |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5340 Node* reference_obj = null_check_receiver(); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5341 if (stopped()) return true; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5342 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5343 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
|
5344 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5345 ciInstanceKlass* klass = env()->Object_klass(); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5346 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
|
5347 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5348 Node* no_ctrl = NULL; |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5349 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
|
5350 |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5351 // 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
|
5352 pre_barrier(false /* do_load */, |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5353 control(), |
|
3258
edd9b016deb6
7036021: G1: build failure on win64 and linux with hs21 in jdk6 build environment
johnc
parents:
3255
diff
changeset
|
5354 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
|
5355 result /* pre_val */, |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5356 T_OBJECT); |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5357 |
|
6615
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
5358 // 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
|
5359 // 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
|
5360 insert_mem_bar(Op_MemBarCPUOrder); |
|
09aad8452938
7190310: Inlining WeakReference.get(), and hoisting $referent may lead to non-terminating loops
kvn
parents:
6266
diff
changeset
|
5361 |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5362 set_result(result); |
|
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5363 return true; |
|
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2385
diff
changeset
|
5364 } |
| 6894 | 5365 |
| 5366 | |
| 5367 Node * LibraryCallKit::load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString, | |
| 5368 bool is_exact=true, bool is_static=false) { | |
| 5369 | |
| 5370 const TypeInstPtr* tinst = _gvn.type(fromObj)->isa_instptr(); | |
| 5371 assert(tinst != NULL, "obj is null"); | |
| 5372 assert(tinst->klass()->is_loaded(), "obj is not loaded"); | |
| 5373 assert(!is_exact || tinst->klass_is_exact(), "klass not exact"); | |
| 5374 | |
| 5375 ciField* field = tinst->klass()->as_instance_klass()->get_field_by_name(ciSymbol::make(fieldName), | |
| 5376 ciSymbol::make(fieldTypeString), | |
| 5377 is_static); | |
| 5378 if (field == NULL) return (Node *) NULL; | |
| 5379 assert (field != NULL, "undefined field"); | |
| 5380 | |
| 5381 // Next code copied from Parse::do_get_xxx(): | |
| 5382 | |
| 5383 // Compute address and memory type. | |
| 5384 int offset = field->offset_in_bytes(); | |
| 5385 bool is_vol = field->is_volatile(); | |
| 5386 ciType* field_klass = field->type(); | |
| 5387 assert(field_klass->is_loaded(), "should be loaded"); | |
| 5388 const TypePtr* adr_type = C->alias_type(field)->adr_type(); | |
| 5389 Node *adr = basic_plus_adr(fromObj, fromObj, offset); | |
| 5390 BasicType bt = field->layout_type(); | |
| 5391 | |
| 5392 // Build the resultant type of the load | |
| 5393 const Type *type = TypeOopPtr::make_from_klass(field_klass->as_klass()); | |
| 5394 | |
| 5395 // Build the load. | |
| 5396 Node* loadedField = make_load(NULL, adr, type, bt, adr_type, is_vol); | |
| 5397 return loadedField; | |
| 5398 } | |
| 5399 | |
| 5400 | |
| 5401 //------------------------------inline_aescrypt_Block----------------------- | |
| 5402 bool LibraryCallKit::inline_aescrypt_Block(vmIntrinsics::ID id) { | |
| 5403 address stubAddr; | |
| 5404 const char *stubName; | |
| 5405 assert(UseAES, "need AES instruction support"); | |
| 5406 | |
| 5407 switch(id) { | |
| 5408 case vmIntrinsics::_aescrypt_encryptBlock: | |
| 5409 stubAddr = StubRoutines::aescrypt_encryptBlock(); | |
| 5410 stubName = "aescrypt_encryptBlock"; | |
| 5411 break; | |
| 5412 case vmIntrinsics::_aescrypt_decryptBlock: | |
| 5413 stubAddr = StubRoutines::aescrypt_decryptBlock(); | |
| 5414 stubName = "aescrypt_decryptBlock"; | |
| 5415 break; | |
| 5416 } | |
| 5417 if (stubAddr == NULL) return false; | |
| 5418 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5419 Node* aescrypt_object = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5420 Node* src = argument(1); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5421 Node* src_offset = argument(2); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5422 Node* dest = argument(3); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5423 Node* dest_offset = argument(4); |
| 6894 | 5424 |
| 5425 // (1) src and dest are arrays. | |
| 5426 const Type* src_type = src->Value(&_gvn); | |
| 5427 const Type* dest_type = dest->Value(&_gvn); | |
| 5428 const TypeAryPtr* top_src = src_type->isa_aryptr(); | |
| 5429 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); | |
| 5430 assert (top_src != NULL && top_src->klass() != NULL && top_dest != NULL && top_dest->klass() != NULL, "args are strange"); | |
| 5431 | |
| 5432 // for the quick and dirty code we will skip all the checks. | |
| 5433 // we are just trying to get the call to be generated. | |
| 5434 Node* src_start = src; | |
| 5435 Node* dest_start = dest; | |
| 5436 if (src_offset != NULL || dest_offset != NULL) { | |
| 5437 assert(src_offset != NULL && dest_offset != NULL, ""); | |
| 5438 src_start = array_element_address(src, src_offset, T_BYTE); | |
| 5439 dest_start = array_element_address(dest, dest_offset, T_BYTE); | |
| 5440 } | |
| 5441 | |
| 5442 // now need to get the start of its expanded key array | |
| 5443 // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java | |
| 5444 Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object); | |
| 5445 if (k_start == NULL) return false; | |
| 5446 | |
| 5447 // Call the stub. | |
| 5448 make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::aescrypt_block_Type(), | |
| 5449 stubAddr, stubName, TypePtr::BOTTOM, | |
| 5450 src_start, dest_start, k_start); | |
| 5451 | |
| 5452 return true; | |
| 5453 } | |
| 5454 | |
| 5455 //------------------------------inline_cipherBlockChaining_AESCrypt----------------------- | |
| 5456 bool LibraryCallKit::inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id) { | |
| 5457 address stubAddr; | |
| 5458 const char *stubName; | |
| 5459 | |
| 5460 assert(UseAES, "need AES instruction support"); | |
| 5461 | |
| 5462 switch(id) { | |
| 5463 case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt: | |
| 5464 stubAddr = StubRoutines::cipherBlockChaining_encryptAESCrypt(); | |
| 5465 stubName = "cipherBlockChaining_encryptAESCrypt"; | |
| 5466 break; | |
| 5467 case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt: | |
| 5468 stubAddr = StubRoutines::cipherBlockChaining_decryptAESCrypt(); | |
| 5469 stubName = "cipherBlockChaining_decryptAESCrypt"; | |
| 5470 break; | |
| 5471 } | |
| 5472 if (stubAddr == NULL) return false; | |
| 5473 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5474 Node* cipherBlockChaining_object = argument(0); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5475 Node* src = argument(1); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5476 Node* src_offset = argument(2); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5477 Node* len = argument(3); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5478 Node* dest = argument(4); |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5479 Node* dest_offset = argument(5); |
| 6894 | 5480 |
| 5481 // (1) src and dest are arrays. | |
| 5482 const Type* src_type = src->Value(&_gvn); | |
| 5483 const Type* dest_type = dest->Value(&_gvn); | |
| 5484 const TypeAryPtr* top_src = src_type->isa_aryptr(); | |
| 5485 const TypeAryPtr* top_dest = dest_type->isa_aryptr(); | |
| 5486 assert (top_src != NULL && top_src->klass() != NULL | |
| 5487 && top_dest != NULL && top_dest->klass() != NULL, "args are strange"); | |
| 5488 | |
| 5489 // checks are the responsibility of the caller | |
| 5490 Node* src_start = src; | |
| 5491 Node* dest_start = dest; | |
| 5492 if (src_offset != NULL || dest_offset != NULL) { | |
| 5493 assert(src_offset != NULL && dest_offset != NULL, ""); | |
| 5494 src_start = array_element_address(src, src_offset, T_BYTE); | |
| 5495 dest_start = array_element_address(dest, dest_offset, T_BYTE); | |
| 5496 } | |
| 5497 | |
| 5498 // if we are in this set of code, we "know" the embeddedCipher is an AESCrypt object | |
| 5499 // (because of the predicated logic executed earlier). | |
| 5500 // so we cast it here safely. | |
| 5501 // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java | |
| 5502 | |
| 5503 Node* embeddedCipherObj = load_field_from_object(cipherBlockChaining_object, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false); | |
| 5504 if (embeddedCipherObj == NULL) return false; | |
| 5505 | |
| 5506 // cast it to what we know it will be at runtime | |
| 5507 const TypeInstPtr* tinst = _gvn.type(cipherBlockChaining_object)->isa_instptr(); | |
| 5508 assert(tinst != NULL, "CBC obj is null"); | |
| 5509 assert(tinst->klass()->is_loaded(), "CBC obj is not loaded"); | |
| 5510 ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt")); | |
| 5511 if (!klass_AESCrypt->is_loaded()) return false; | |
| 5512 | |
| 5513 ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass(); | |
| 5514 const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_AESCrypt); | |
| 5515 const TypeOopPtr* xtype = aklass->as_instance_type(); | |
| 5516 Node* aescrypt_object = new(C) CheckCastPPNode(control(), embeddedCipherObj, xtype); | |
| 5517 aescrypt_object = _gvn.transform(aescrypt_object); | |
| 5518 | |
| 5519 // we need to get the start of the aescrypt_object's expanded key array | |
| 5520 Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object); | |
| 5521 if (k_start == NULL) return false; | |
| 5522 | |
| 5523 // similarly, get the start address of the r vector | |
| 5524 Node* objRvec = load_field_from_object(cipherBlockChaining_object, "r", "[B", /*is_exact*/ false); | |
| 5525 if (objRvec == NULL) return false; | |
| 5526 Node* r_start = array_element_address(objRvec, intcon(0), T_BYTE); | |
| 5527 | |
| 5528 // Call the stub, passing src_start, dest_start, k_start, r_start and src_len | |
| 5529 make_runtime_call(RC_LEAF|RC_NO_FP, | |
| 5530 OptoRuntime::cipherBlockChaining_aescrypt_Type(), | |
| 5531 stubAddr, stubName, TypePtr::BOTTOM, | |
| 5532 src_start, dest_start, k_start, r_start, len); | |
| 5533 | |
| 5534 // return is void so no result needs to be pushed | |
| 5535 | |
| 5536 return true; | |
| 5537 } | |
| 5538 | |
| 5539 //------------------------------get_key_start_from_aescrypt_object----------------------- | |
| 5540 Node * LibraryCallKit::get_key_start_from_aescrypt_object(Node *aescrypt_object) { | |
| 5541 Node* objAESCryptKey = load_field_from_object(aescrypt_object, "K", "[I", /*is_exact*/ false); | |
| 5542 assert (objAESCryptKey != NULL, "wrong version of com.sun.crypto.provider.AESCrypt"); | |
| 5543 if (objAESCryptKey == NULL) return (Node *) NULL; | |
| 5544 | |
| 5545 // now have the array, need to get the start address of the K array | |
| 5546 Node* k_start = array_element_address(objAESCryptKey, intcon(0), T_INT); | |
| 5547 return k_start; | |
| 5548 } | |
| 5549 | |
| 5550 //----------------------------inline_cipherBlockChaining_AESCrypt_predicate---------------------------- | |
| 5551 // Return node representing slow path of predicate check. | |
| 5552 // the pseudo code we want to emulate with this predicate is: | |
| 5553 // for encryption: | |
| 5554 // if (embeddedCipherObj instanceof AESCrypt) do_intrinsic, else do_javapath | |
| 5555 // for decryption: | |
| 5556 // if ((embeddedCipherObj instanceof AESCrypt) && (cipher!=plain)) do_intrinsic, else do_javapath | |
| 5557 // note cipher==plain is more conservative than the original java code but that's OK | |
| 5558 // | |
| 5559 Node* LibraryCallKit::inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting) { | |
| 5560 // First, check receiver for NULL since it is virtual method. | |
| 5561 Node* objCBC = argument(0); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5562 objCBC = null_check(objCBC); |
| 6894 | 5563 |
| 5564 if (stopped()) return NULL; // Always NULL | |
| 5565 | |
| 5566 // Load embeddedCipher field of CipherBlockChaining object. | |
| 5567 Node* embeddedCipherObj = load_field_from_object(objCBC, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false); | |
| 5568 | |
| 5569 // get AESCrypt klass for instanceOf check | |
| 5570 // AESCrypt might not be loaded yet if some other SymmetricCipher got us to this compile point | |
| 5571 // will have same classloader as CipherBlockChaining object | |
| 5572 const TypeInstPtr* tinst = _gvn.type(objCBC)->isa_instptr(); | |
| 5573 assert(tinst != NULL, "CBCobj is null"); | |
| 5574 assert(tinst->klass()->is_loaded(), "CBCobj is not loaded"); | |
| 5575 | |
| 5576 // we want to do an instanceof comparison against the AESCrypt class | |
| 5577 ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt")); | |
| 5578 if (!klass_AESCrypt->is_loaded()) { | |
| 5579 // if AESCrypt is not even loaded, we never take the intrinsic fast path | |
| 5580 Node* ctrl = control(); | |
| 5581 set_control(top()); // no regular fast path | |
| 5582 return ctrl; | |
| 5583 } | |
| 5584 ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass(); | |
| 5585 | |
| 5586 Node* instof = gen_instanceof(embeddedCipherObj, makecon(TypeKlassPtr::make(instklass_AESCrypt))); | |
| 5587 Node* cmp_instof = _gvn.transform(new (C) CmpINode(instof, intcon(1))); | |
| 5588 Node* bool_instof = _gvn.transform(new (C) BoolNode(cmp_instof, BoolTest::ne)); | |
| 5589 | |
| 5590 Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN); | |
| 5591 | |
| 5592 // for encryption, we are done | |
| 5593 if (!decrypting) | |
| 5594 return instof_false; // even if it is NULL | |
| 5595 | |
| 5596 // for decryption, we need to add a further check to avoid | |
| 5597 // taking the intrinsic path when cipher and plain are the same | |
| 5598 // see the original java code for why. | |
| 5599 RegionNode* region = new(C) RegionNode(3); | |
| 5600 region->init_req(1, instof_false); | |
| 5601 Node* src = argument(1); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
5602 Node* dest = argument(4); |
| 6894 | 5603 Node* cmp_src_dest = _gvn.transform(new (C) CmpPNode(src, dest)); |
| 5604 Node* bool_src_dest = _gvn.transform(new (C) BoolNode(cmp_src_dest, BoolTest::eq)); | |
| 5605 Node* src_dest_conjoint = generate_guard(bool_src_dest, NULL, PROB_MIN); | |
| 5606 region->init_req(2, src_dest_conjoint); | |
| 5607 | |
| 5608 record_for_igvn(region); | |
| 5609 return _gvn.transform(region); | |
| 5610 } |