Mercurial > hg > graal-compiler
annotate src/share/vm/runtime/stubRoutines.cpp @ 20313:b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
Summary: Add C2 SHA intrinsics on SPARC
Reviewed-by: kvn, roland
Contributed-by: james.cheng@oracle.com
| author | kvn |
|---|---|
| date | Wed, 11 Jun 2014 11:05:10 -0700 |
| parents | 980532a806a5 |
| children | 166d744df0de |
| rev | line source |
|---|---|
| 0 | 1 /* |
|
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
11127
diff
changeset
|
2 * Copyright (c) 1997, 2014, 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:
1490
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1490
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:
1490
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #include "precompiled.hpp" |
| 26 #include "asm/codeBuffer.hpp" | |
| 27 #include "memory/resourceArea.hpp" | |
| 28 #include "oops/oop.inline.hpp" | |
| 29 #include "runtime/interfaceSupport.hpp" | |
| 30 #include "runtime/sharedRuntime.hpp" | |
| 31 #include "runtime/stubRoutines.hpp" | |
| 32 #include "runtime/timer.hpp" | |
| 33 #include "utilities/copy.hpp" | |
| 34 #ifdef COMPILER2 | |
| 35 #include "opto/runtime.hpp" | |
| 36 #endif | |
| 0 | 37 |
| 38 | |
| 39 // Implementation of StubRoutines - for a description | |
| 40 // of how to extend it, see the header file. | |
| 41 | |
| 42 // Class Variables | |
| 43 | |
| 44 BufferBlob* StubRoutines::_code1 = NULL; | |
| 45 BufferBlob* StubRoutines::_code2 = NULL; | |
| 46 | |
| 47 address StubRoutines::_call_stub_return_address = NULL; | |
| 48 address StubRoutines::_call_stub_entry = NULL; | |
| 49 | |
| 50 address StubRoutines::_catch_exception_entry = NULL; | |
| 51 address StubRoutines::_forward_exception_entry = NULL; | |
| 52 address StubRoutines::_throw_AbstractMethodError_entry = NULL; | |
|
16
f8236e79048a
6664627: Merge changes made only in hotspot 11 forward to jdk 7
dcubed
parents:
0
diff
changeset
|
53 address StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL; |
| 0 | 54 address StubRoutines::_throw_NullPointerException_at_call_entry = NULL; |
| 55 address StubRoutines::_throw_StackOverflowError_entry = NULL; | |
| 56 address StubRoutines::_handler_for_unsafe_access_entry = NULL; | |
| 57 jint StubRoutines::_verify_oop_count = 0; | |
| 58 address StubRoutines::_verify_oop_subroutine_entry = NULL; | |
| 59 address StubRoutines::_atomic_xchg_entry = NULL; | |
| 60 address StubRoutines::_atomic_xchg_ptr_entry = NULL; | |
| 61 address StubRoutines::_atomic_store_entry = NULL; | |
| 62 address StubRoutines::_atomic_store_ptr_entry = NULL; | |
| 63 address StubRoutines::_atomic_cmpxchg_entry = NULL; | |
| 64 address StubRoutines::_atomic_cmpxchg_ptr_entry = NULL; | |
| 65 address StubRoutines::_atomic_cmpxchg_long_entry = NULL; | |
| 66 address StubRoutines::_atomic_add_entry = NULL; | |
| 67 address StubRoutines::_atomic_add_ptr_entry = NULL; | |
| 68 address StubRoutines::_fence_entry = NULL; | |
| 69 address StubRoutines::_d2i_wrapper = NULL; | |
| 70 address StubRoutines::_d2l_wrapper = NULL; | |
| 71 | |
| 72 jint StubRoutines::_fpu_cntrl_wrd_std = 0; | |
| 73 jint StubRoutines::_fpu_cntrl_wrd_24 = 0; | |
| 74 jint StubRoutines::_fpu_cntrl_wrd_64 = 0; | |
| 75 jint StubRoutines::_fpu_cntrl_wrd_trunc = 0; | |
| 76 jint StubRoutines::_mxcsr_std = 0; | |
| 77 jint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 }; | |
| 78 jint StubRoutines::_fpu_subnormal_bias2[3] = { 0, 0, 0 }; | |
| 79 | |
| 80 // Compiled code entry points default values | |
| 2324 | 81 // The default functions don't have separate disjoint versions. |
| 0 | 82 address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); |
| 83 address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); | |
| 84 address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); | |
| 85 address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); | |
| 86 address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); | |
| 2324 | 87 address StubRoutines::_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit); |
| 0 | 88 address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); |
| 89 address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); | |
| 90 address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); | |
| 91 address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); | |
| 92 address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); | |
| 2324 | 93 address StubRoutines::_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit); |
| 0 | 94 |
| 95 address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); | |
| 96 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); | |
| 97 address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); | |
| 98 address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); | |
| 99 address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); | |
| 2324 | 100 address StubRoutines::_arrayof_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit); |
| 0 | 101 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); |
| 102 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); | |
| 103 address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); | |
| 104 address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); | |
| 2324 | 105 address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); |
| 106 address StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit); | |
| 107 | |
| 3892 | 108 address StubRoutines::_zero_aligned_words = CAST_FROM_FN_PTR(address, Copy::zero_to_words); |
| 0 | 109 |
| 110 address StubRoutines::_checkcast_arraycopy = NULL; | |
| 2324 | 111 address StubRoutines::_checkcast_arraycopy_uninit = NULL; |
| 0 | 112 address StubRoutines::_unsafe_arraycopy = NULL; |
| 113 address StubRoutines::_generic_arraycopy = NULL; | |
| 114 | |
| 1763 | 115 |
| 116 address StubRoutines::_jbyte_fill; | |
| 117 address StubRoutines::_jshort_fill; | |
| 118 address StubRoutines::_jint_fill; | |
| 119 address StubRoutines::_arrayof_jbyte_fill; | |
| 120 address StubRoutines::_arrayof_jshort_fill; | |
| 121 address StubRoutines::_arrayof_jint_fill; | |
| 122 | |
| 6894 | 123 address StubRoutines::_aescrypt_encryptBlock = NULL; |
| 124 address StubRoutines::_aescrypt_decryptBlock = NULL; | |
| 125 address StubRoutines::_cipherBlockChaining_encryptAESCrypt = NULL; | |
| 126 address StubRoutines::_cipherBlockChaining_decryptAESCrypt = NULL; | |
| 1763 | 127 |
|
20313
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
11127
diff
changeset
|
128 address StubRoutines::_sha1_implCompress = NULL; |
|
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
11127
diff
changeset
|
129 address StubRoutines::_sha1_implCompressMB = NULL; |
|
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
11127
diff
changeset
|
130 address StubRoutines::_sha256_implCompress = NULL; |
|
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
11127
diff
changeset
|
131 address StubRoutines::_sha256_implCompressMB = NULL; |
|
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
11127
diff
changeset
|
132 address StubRoutines::_sha512_implCompress = NULL; |
|
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
11127
diff
changeset
|
133 address StubRoutines::_sha512_implCompressMB = NULL; |
|
b20a35eae442
8035968: Leverage CPU Instructions to Improve SHA Performance on SPARC
kvn
parents:
11127
diff
changeset
|
134 |
|
11080
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10161
diff
changeset
|
135 address StubRoutines::_updateBytesCRC32 = NULL; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10161
diff
changeset
|
136 address StubRoutines::_crc_table_adr = NULL; |
|
b800986664f4
7088419: Use x86 Hardware CRC32 Instruction with java.util.zip.CRC32
drchase
parents:
10161
diff
changeset
|
137 |
|
1174
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
138 double (* StubRoutines::_intrinsic_log )(double) = NULL; |
|
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
139 double (* StubRoutines::_intrinsic_log10 )(double) = NULL; |
|
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
140 double (* StubRoutines::_intrinsic_exp )(double) = NULL; |
|
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
141 double (* StubRoutines::_intrinsic_pow )(double, double) = NULL; |
|
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
142 double (* StubRoutines::_intrinsic_sin )(double) = NULL; |
|
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
143 double (* StubRoutines::_intrinsic_cos )(double) = NULL; |
|
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
144 double (* StubRoutines::_intrinsic_tan )(double) = NULL; |
|
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
145 |
| 11127 | 146 address StubRoutines::_safefetch32_entry = NULL; |
| 147 address StubRoutines::_safefetch32_fault_pc = NULL; | |
| 148 address StubRoutines::_safefetch32_continuation_pc = NULL; | |
| 149 address StubRoutines::_safefetchN_entry = NULL; | |
| 150 address StubRoutines::_safefetchN_fault_pc = NULL; | |
| 151 address StubRoutines::_safefetchN_continuation_pc = NULL; | |
| 152 | |
| 0 | 153 // Initialization |
| 154 // | |
| 155 // Note: to break cycle with universe initialization, stubs are generated in two phases. | |
| 156 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry). | |
| 157 // The second phase includes all other stubs (which may depend on universe being initialized.) | |
| 158 | |
| 159 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators | |
| 160 | |
| 161 void StubRoutines::initialize1() { | |
| 162 if (_code1 == NULL) { | |
| 163 ResourceMark rm; | |
| 164 TraceTime timer("StubRoutines generation 1", TraceStartupTime); | |
| 165 _code1 = BufferBlob::create("StubRoutines (1)", code_size1); | |
|
1490
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
166 if (_code1 == NULL) { |
|
10161
746b070f5022
8011661: Insufficient memory message says "malloc" when sometimes it should say "mmap"
ccheung
parents:
6894
diff
changeset
|
167 vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)"); |
|
1490
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
168 } |
| 1748 | 169 CodeBuffer buffer(_code1); |
| 0 | 170 StubGenerator_generate(&buffer, false); |
| 171 } | |
| 172 } | |
| 173 | |
| 174 | |
| 175 #ifdef ASSERT | |
| 176 typedef void (*arraycopy_fn)(address src, address dst, int count); | |
| 177 | |
| 178 // simple tests of generated arraycopy functions | |
| 179 static void test_arraycopy_func(address func, int alignment) { | |
| 180 int v = 0xcc; | |
| 181 int v2 = 0x11; | |
|
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
182 jlong lbuffer[8]; |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
183 jlong lbuffer2[8]; |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
184 address fbuffer = (address) lbuffer; |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
185 address fbuffer2 = (address) lbuffer2; |
| 0 | 186 unsigned int i; |
| 187 for (i = 0; i < sizeof(lbuffer); i++) { | |
|
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
188 fbuffer[i] = v; fbuffer2[i] = v2; |
| 0 | 189 } |
|
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
190 // C++ does not guarantee jlong[] array alignment to 8 bytes. |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
191 // Use middle of array to check that memory before it is not modified. |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
192 address buffer = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong); |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
193 address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong); |
| 0 | 194 // do an aligned copy |
| 195 ((arraycopy_fn)func)(buffer, buffer2, 0); | |
| 196 for (i = 0; i < sizeof(lbuffer); i++) { | |
|
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
197 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); |
| 0 | 198 } |
| 199 // adjust destination alignment | |
| 200 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0); | |
| 201 for (i = 0; i < sizeof(lbuffer); i++) { | |
|
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
202 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); |
| 0 | 203 } |
| 204 // adjust source alignment | |
| 205 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0); | |
| 206 for (i = 0; i < sizeof(lbuffer); i++) { | |
|
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
207 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); |
| 0 | 208 } |
| 209 } | |
| 210 #endif | |
| 211 | |
| 212 | |
| 213 void StubRoutines::initialize2() { | |
| 214 if (_code2 == NULL) { | |
| 215 ResourceMark rm; | |
| 216 TraceTime timer("StubRoutines generation 2", TraceStartupTime); | |
| 217 _code2 = BufferBlob::create("StubRoutines (2)", code_size2); | |
|
1490
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
218 if (_code2 == NULL) { |
|
10161
746b070f5022
8011661: Insufficient memory message says "malloc" when sometimes it should say "mmap"
ccheung
parents:
6894
diff
changeset
|
219 vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)"); |
|
1490
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
220 } |
| 1748 | 221 CodeBuffer buffer(_code2); |
| 0 | 222 StubGenerator_generate(&buffer, true); |
| 223 } | |
| 224 | |
| 225 #ifdef ASSERT | |
| 226 | |
| 227 #define TEST_ARRAYCOPY(type) \ | |
| 228 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \ | |
| 229 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \ | |
| 230 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \ | |
| 231 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord)) | |
| 232 | |
|
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
233 // Make sure all the arraycopy stubs properly handle zero count |
| 0 | 234 TEST_ARRAYCOPY(jbyte); |
| 235 TEST_ARRAYCOPY(jshort); | |
| 236 TEST_ARRAYCOPY(jint); | |
| 237 TEST_ARRAYCOPY(jlong); | |
| 238 | |
| 239 #undef TEST_ARRAYCOPY | |
| 240 | |
| 1763 | 241 #define TEST_FILL(type) \ |
| 242 if (_##type##_fill != NULL) { \ | |
| 243 union { \ | |
| 244 double d; \ | |
| 245 type body[96]; \ | |
| 246 } s; \ | |
| 247 \ | |
| 248 int v = 32; \ | |
| 249 for (int offset = -2; offset <= 2; offset++) { \ | |
| 250 for (int i = 0; i < 96; i++) { \ | |
| 251 s.body[i] = 1; \ | |
| 252 } \ | |
| 253 type* start = s.body + 8 + offset; \ | |
| 254 for (int aligned = 0; aligned < 2; aligned++) { \ | |
| 255 if (aligned) { \ | |
| 256 if (((intptr_t)start) % HeapWordSize == 0) { \ | |
| 257 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \ | |
| 258 } else { \ | |
| 259 continue; \ | |
| 260 } \ | |
| 261 } else { \ | |
| 262 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \ | |
| 263 } \ | |
| 264 for (int i = 0; i < 96; i++) { \ | |
| 265 if (i < (8 + offset) || i >= (88 + offset)) { \ | |
| 266 assert(s.body[i] == 1, "what?"); \ | |
| 267 } else { \ | |
| 268 assert(s.body[i] == 32, "what?"); \ | |
| 269 } \ | |
| 270 } \ | |
| 271 } \ | |
| 272 } \ | |
| 273 } \ | |
| 274 | |
| 275 TEST_FILL(jbyte); | |
| 276 TEST_FILL(jshort); | |
| 277 TEST_FILL(jint); | |
| 278 | |
| 279 #undef TEST_FILL | |
| 280 | |
|
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
281 #define TEST_COPYRTN(type) \ |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
282 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \ |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
283 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type))) |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
284 |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
285 // Make sure all the copy runtime routines properly handle zero count |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
286 TEST_COPYRTN(jbyte); |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
287 TEST_COPYRTN(jshort); |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
288 TEST_COPYRTN(jint); |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
289 TEST_COPYRTN(jlong); |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
290 |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
291 #undef TEST_COPYRTN |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
292 |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
293 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord)); |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
294 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord)); |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
295 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord)); |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
296 // Aligned to BytesPerLong |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
297 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong)); |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
298 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong)); |
|
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
299 |
| 0 | 300 #endif |
| 301 } | |
| 302 | |
| 303 | |
| 304 void stubRoutines_init1() { StubRoutines::initialize1(); } | |
| 305 void stubRoutines_init2() { StubRoutines::initialize2(); } | |
| 306 | |
| 307 // | |
| 308 // Default versions of arraycopy functions | |
| 309 // | |
| 310 | |
| 2324 | 311 static void gen_arraycopy_barrier_pre(oop* dest, size_t count, bool dest_uninitialized) { |
|
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
312 assert(count != 0, "count should be non-zero"); |
|
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
313 assert(count <= (size_t)max_intx, "count too large"); |
|
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
314 BarrierSet* bs = Universe::heap()->barrier_set(); |
|
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
315 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt"); |
| 2324 | 316 bs->write_ref_array_pre(dest, (int)count, dest_uninitialized); |
|
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
317 } |
|
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
318 |
| 0 | 319 static void gen_arraycopy_barrier(oop* dest, size_t count) { |
| 320 assert(count != 0, "count should be non-zero"); | |
| 321 BarrierSet* bs = Universe::heap()->barrier_set(); | |
| 322 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); | |
|
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
323 bs->write_ref_array((HeapWord*)dest, count); |
| 0 | 324 } |
| 325 | |
| 326 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count)) | |
| 327 #ifndef PRODUCT | |
| 328 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy | |
| 329 #endif // !PRODUCT | |
|
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
330 Copy::conjoint_jbytes_atomic(src, dest, count); |
| 0 | 331 JRT_END |
| 332 | |
| 333 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count)) | |
| 334 #ifndef PRODUCT | |
| 335 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy | |
| 336 #endif // !PRODUCT | |
| 337 Copy::conjoint_jshorts_atomic(src, dest, count); | |
| 338 JRT_END | |
| 339 | |
| 340 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count)) | |
| 341 #ifndef PRODUCT | |
| 342 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy | |
| 343 #endif // !PRODUCT | |
| 344 Copy::conjoint_jints_atomic(src, dest, count); | |
| 345 JRT_END | |
| 346 | |
| 347 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count)) | |
| 348 #ifndef PRODUCT | |
| 349 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy | |
| 350 #endif // !PRODUCT | |
| 351 Copy::conjoint_jlongs_atomic(src, dest, count); | |
| 352 JRT_END | |
| 353 | |
| 354 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count)) | |
| 355 #ifndef PRODUCT | |
| 356 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy | |
| 357 #endif // !PRODUCT | |
| 358 assert(count != 0, "count should be non-zero"); | |
| 2324 | 359 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false); |
| 360 Copy::conjoint_oops_atomic(src, dest, count); | |
| 361 gen_arraycopy_barrier(dest, count); | |
| 362 JRT_END | |
| 363 | |
| 364 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count)) | |
| 365 #ifndef PRODUCT | |
| 366 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy | |
| 367 #endif // !PRODUCT | |
| 368 assert(count != 0, "count should be non-zero"); | |
| 369 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true); | |
| 0 | 370 Copy::conjoint_oops_atomic(src, dest, count); |
| 371 gen_arraycopy_barrier(dest, count); | |
| 372 JRT_END | |
| 373 | |
| 374 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
| 375 #ifndef PRODUCT | |
| 376 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy | |
| 377 #endif // !PRODUCT | |
|
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
378 Copy::arrayof_conjoint_jbytes(src, dest, count); |
| 0 | 379 JRT_END |
| 380 | |
| 381 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
| 382 #ifndef PRODUCT | |
| 383 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy | |
| 384 #endif // !PRODUCT | |
| 385 Copy::arrayof_conjoint_jshorts(src, dest, count); | |
| 386 JRT_END | |
| 387 | |
| 388 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
| 389 #ifndef PRODUCT | |
| 390 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy | |
| 391 #endif // !PRODUCT | |
| 392 Copy::arrayof_conjoint_jints(src, dest, count); | |
| 393 JRT_END | |
| 394 | |
| 395 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
| 396 #ifndef PRODUCT | |
| 397 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy | |
| 398 #endif // !PRODUCT | |
| 399 Copy::arrayof_conjoint_jlongs(src, dest, count); | |
| 400 JRT_END | |
| 401 | |
| 402 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
| 403 #ifndef PRODUCT | |
| 404 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy | |
| 405 #endif // !PRODUCT | |
| 406 assert(count != 0, "count should be non-zero"); | |
| 2324 | 407 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/false); |
| 0 | 408 Copy::arrayof_conjoint_oops(src, dest, count); |
| 409 gen_arraycopy_barrier((oop *) dest, count); | |
| 410 JRT_END | |
| 1763 | 411 |
| 2324 | 412 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count)) |
| 413 #ifndef PRODUCT | |
| 414 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy | |
| 415 #endif // !PRODUCT | |
| 416 assert(count != 0, "count should be non-zero"); | |
| 417 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/true); | |
| 418 Copy::arrayof_conjoint_oops(src, dest, count); | |
| 419 gen_arraycopy_barrier((oop *) dest, count); | |
| 420 JRT_END | |
| 1763 | 421 |
| 422 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) { | |
| 423 #define RETURN_STUB(xxx_fill) { \ | |
| 424 name = #xxx_fill; \ | |
| 425 return StubRoutines::xxx_fill(); } | |
| 426 | |
| 427 switch (t) { | |
| 428 case T_BYTE: | |
| 429 case T_BOOLEAN: | |
| 430 if (!aligned) RETURN_STUB(jbyte_fill); | |
| 431 RETURN_STUB(arrayof_jbyte_fill); | |
| 432 case T_CHAR: | |
| 433 case T_SHORT: | |
| 434 if (!aligned) RETURN_STUB(jshort_fill); | |
| 435 RETURN_STUB(arrayof_jshort_fill); | |
| 436 case T_INT: | |
| 437 case T_FLOAT: | |
| 438 if (!aligned) RETURN_STUB(jint_fill); | |
| 439 RETURN_STUB(arrayof_jint_fill); | |
| 440 case T_DOUBLE: | |
| 441 case T_LONG: | |
| 442 case T_ARRAY: | |
| 443 case T_OBJECT: | |
| 444 case T_NARROWOOP: | |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6266
diff
changeset
|
445 case T_NARROWKLASS: |
| 1763 | 446 case T_ADDRESS: |
| 447 // Currently unsupported | |
| 448 return NULL; | |
| 449 | |
| 450 default: | |
| 451 ShouldNotReachHere(); | |
| 452 return NULL; | |
| 453 } | |
| 454 | |
| 455 #undef RETURN_STUB | |
| 456 } | |
| 2446 | 457 |
| 458 // constants for computing the copy function | |
| 459 enum { | |
| 460 COPYFUNC_UNALIGNED = 0, | |
| 461 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize | |
| 462 COPYFUNC_CONJOINT = 0, | |
| 463 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend | |
| 464 }; | |
| 465 | |
| 466 // Note: The condition "disjoint" applies also for overlapping copies | |
| 467 // where an descending copy is permitted (i.e., dest_offset <= src_offset). | |
| 468 address | |
| 469 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) { | |
| 470 int selector = | |
| 471 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) + | |
| 472 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT); | |
| 473 | |
| 474 #define RETURN_STUB(xxx_arraycopy) { \ | |
| 475 name = #xxx_arraycopy; \ | |
| 476 return StubRoutines::xxx_arraycopy(); } | |
| 477 | |
| 478 #define RETURN_STUB_PARM(xxx_arraycopy, parm) { \ | |
| 479 name = #xxx_arraycopy; \ | |
| 480 return StubRoutines::xxx_arraycopy(parm); } | |
| 481 | |
| 482 switch (t) { | |
| 483 case T_BYTE: | |
| 484 case T_BOOLEAN: | |
| 485 switch (selector) { | |
| 486 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy); | |
| 487 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy); | |
| 488 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy); | |
| 489 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy); | |
| 490 } | |
| 491 case T_CHAR: | |
| 492 case T_SHORT: | |
| 493 switch (selector) { | |
| 494 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy); | |
| 495 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy); | |
| 496 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy); | |
| 497 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy); | |
| 498 } | |
| 499 case T_INT: | |
| 500 case T_FLOAT: | |
| 501 switch (selector) { | |
| 502 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy); | |
| 503 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy); | |
| 504 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy); | |
| 505 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy); | |
| 506 } | |
| 507 case T_DOUBLE: | |
| 508 case T_LONG: | |
| 509 switch (selector) { | |
| 510 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy); | |
| 511 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy); | |
| 512 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy); | |
| 513 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy); | |
| 514 } | |
| 515 case T_ARRAY: | |
| 516 case T_OBJECT: | |
| 517 switch (selector) { | |
| 518 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized); | |
| 519 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized); | |
| 520 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized); | |
| 521 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized); | |
| 522 } | |
| 523 default: | |
| 524 ShouldNotReachHere(); | |
| 525 return NULL; | |
| 526 } | |
| 527 | |
| 528 #undef RETURN_STUB | |
| 529 #undef RETURN_STUB_PARM | |
| 530 } |