Thu, 06 Dec 2012 09:57:41 -0800
8003250: SPARC: move MacroAssembler into separate file
Reviewed-by: jrose, kvn
duke@435 | 1 | /* |
coleenp@4037 | 2 | * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
twisti@4323 | 26 | #include "asm/macroAssembler.inline.hpp" |
stefank@2314 | 27 | #include "interpreter/interpreter.hpp" |
stefank@2314 | 28 | #include "nativeInst_sparc.hpp" |
stefank@2314 | 29 | #include "oops/instanceOop.hpp" |
coleenp@4037 | 30 | #include "oops/method.hpp" |
stefank@2314 | 31 | #include "oops/objArrayKlass.hpp" |
stefank@2314 | 32 | #include "oops/oop.inline.hpp" |
stefank@2314 | 33 | #include "prims/methodHandles.hpp" |
stefank@2314 | 34 | #include "runtime/frame.inline.hpp" |
stefank@2314 | 35 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 36 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 37 | #include "runtime/stubCodeGenerator.hpp" |
stefank@2314 | 38 | #include "runtime/stubRoutines.hpp" |
stefank@2314 | 39 | #include "utilities/top.hpp" |
stefank@2314 | 40 | #ifdef TARGET_OS_FAMILY_linux |
stefank@2314 | 41 | # include "thread_linux.inline.hpp" |
stefank@2314 | 42 | #endif |
stefank@2314 | 43 | #ifdef TARGET_OS_FAMILY_solaris |
stefank@2314 | 44 | # include "thread_solaris.inline.hpp" |
stefank@2314 | 45 | #endif |
stefank@2314 | 46 | #ifdef COMPILER2 |
stefank@2314 | 47 | #include "opto/runtime.hpp" |
stefank@2314 | 48 | #endif |
duke@435 | 49 | |
duke@435 | 50 | // Declaration and definition of StubGenerator (no .hpp file). |
duke@435 | 51 | // For a more detailed description of the stub routine structure |
duke@435 | 52 | // see the comment in stubRoutines.hpp. |
duke@435 | 53 | |
duke@435 | 54 | #define __ _masm-> |
duke@435 | 55 | |
duke@435 | 56 | #ifdef PRODUCT |
duke@435 | 57 | #define BLOCK_COMMENT(str) /* nothing */ |
duke@435 | 58 | #else |
duke@435 | 59 | #define BLOCK_COMMENT(str) __ block_comment(str) |
duke@435 | 60 | #endif |
duke@435 | 61 | |
duke@435 | 62 | #define BIND(label) bind(label); BLOCK_COMMENT(#label ":") |
duke@435 | 63 | |
duke@435 | 64 | // Note: The register L7 is used as L7_thread_cache, and may not be used |
duke@435 | 65 | // any other way within this module. |
duke@435 | 66 | |
duke@435 | 67 | |
duke@435 | 68 | static const Register& Lstub_temp = L2; |
duke@435 | 69 | |
duke@435 | 70 | // ------------------------------------------------------------------------------------------------------------------------- |
duke@435 | 71 | // Stub Code definitions |
duke@435 | 72 | |
duke@435 | 73 | static address handle_unsafe_access() { |
duke@435 | 74 | JavaThread* thread = JavaThread::current(); |
duke@435 | 75 | address pc = thread->saved_exception_pc(); |
duke@435 | 76 | address npc = thread->saved_exception_npc(); |
duke@435 | 77 | // pc is the instruction which we must emulate |
duke@435 | 78 | // doing a no-op is fine: return garbage from the load |
duke@435 | 79 | |
duke@435 | 80 | // request an async exception |
duke@435 | 81 | thread->set_pending_unsafe_access_error(); |
duke@435 | 82 | |
duke@435 | 83 | // return address of next instruction to execute |
duke@435 | 84 | return npc; |
duke@435 | 85 | } |
duke@435 | 86 | |
duke@435 | 87 | class StubGenerator: public StubCodeGenerator { |
duke@435 | 88 | private: |
duke@435 | 89 | |
duke@435 | 90 | #ifdef PRODUCT |
duke@435 | 91 | #define inc_counter_np(a,b,c) (0) |
duke@435 | 92 | #else |
duke@435 | 93 | #define inc_counter_np(counter, t1, t2) \ |
duke@435 | 94 | BLOCK_COMMENT("inc_counter " #counter); \ |
twisti@1162 | 95 | __ inc_counter(&counter, t1, t2); |
duke@435 | 96 | #endif |
duke@435 | 97 | |
duke@435 | 98 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 99 | // Call stubs are used to call Java from C |
duke@435 | 100 | |
duke@435 | 101 | address generate_call_stub(address& return_pc) { |
duke@435 | 102 | StubCodeMark mark(this, "StubRoutines", "call_stub"); |
duke@435 | 103 | address start = __ pc(); |
duke@435 | 104 | |
duke@435 | 105 | // Incoming arguments: |
duke@435 | 106 | // |
duke@435 | 107 | // o0 : call wrapper address |
duke@435 | 108 | // o1 : result (address) |
duke@435 | 109 | // o2 : result type |
duke@435 | 110 | // o3 : method |
duke@435 | 111 | // o4 : (interpreter) entry point |
duke@435 | 112 | // o5 : parameters (address) |
duke@435 | 113 | // [sp + 0x5c]: parameter size (in words) |
duke@435 | 114 | // [sp + 0x60]: thread |
duke@435 | 115 | // |
duke@435 | 116 | // +---------------+ <--- sp + 0 |
duke@435 | 117 | // | | |
duke@435 | 118 | // . reg save area . |
duke@435 | 119 | // | | |
duke@435 | 120 | // +---------------+ <--- sp + 0x40 |
duke@435 | 121 | // | | |
duke@435 | 122 | // . extra 7 slots . |
duke@435 | 123 | // | | |
duke@435 | 124 | // +---------------+ <--- sp + 0x5c |
duke@435 | 125 | // | param. size | |
duke@435 | 126 | // +---------------+ <--- sp + 0x60 |
duke@435 | 127 | // | thread | |
duke@435 | 128 | // +---------------+ |
duke@435 | 129 | // | | |
duke@435 | 130 | |
duke@435 | 131 | // note: if the link argument position changes, adjust |
duke@435 | 132 | // the code in frame::entry_frame_call_wrapper() |
duke@435 | 133 | |
duke@435 | 134 | const Argument link = Argument(0, false); // used only for GC |
duke@435 | 135 | const Argument result = Argument(1, false); |
duke@435 | 136 | const Argument result_type = Argument(2, false); |
duke@435 | 137 | const Argument method = Argument(3, false); |
duke@435 | 138 | const Argument entry_point = Argument(4, false); |
duke@435 | 139 | const Argument parameters = Argument(5, false); |
duke@435 | 140 | const Argument parameter_size = Argument(6, false); |
duke@435 | 141 | const Argument thread = Argument(7, false); |
duke@435 | 142 | |
duke@435 | 143 | // setup thread register |
duke@435 | 144 | __ ld_ptr(thread.as_address(), G2_thread); |
coleenp@548 | 145 | __ reinit_heapbase(); |
duke@435 | 146 | |
duke@435 | 147 | #ifdef ASSERT |
duke@435 | 148 | // make sure we have no pending exceptions |
duke@435 | 149 | { const Register t = G3_scratch; |
duke@435 | 150 | Label L; |
duke@435 | 151 | __ ld_ptr(G2_thread, in_bytes(Thread::pending_exception_offset()), t); |
kvn@3037 | 152 | __ br_null_short(t, Assembler::pt, L); |
duke@435 | 153 | __ stop("StubRoutines::call_stub: entered with pending exception"); |
duke@435 | 154 | __ bind(L); |
duke@435 | 155 | } |
duke@435 | 156 | #endif |
duke@435 | 157 | |
duke@435 | 158 | // create activation frame & allocate space for parameters |
duke@435 | 159 | { const Register t = G3_scratch; |
duke@435 | 160 | __ ld_ptr(parameter_size.as_address(), t); // get parameter size (in words) |
duke@435 | 161 | __ add(t, frame::memory_parameter_word_sp_offset, t); // add space for save area (in words) |
duke@435 | 162 | __ round_to(t, WordsPerLong); // make sure it is multiple of 2 (in words) |
twisti@1861 | 163 | __ sll(t, Interpreter::logStackElementSize, t); // compute number of bytes |
duke@435 | 164 | __ neg(t); // negate so it can be used with save |
duke@435 | 165 | __ save(SP, t, SP); // setup new frame |
duke@435 | 166 | } |
duke@435 | 167 | |
duke@435 | 168 | // +---------------+ <--- sp + 0 |
duke@435 | 169 | // | | |
duke@435 | 170 | // . reg save area . |
duke@435 | 171 | // | | |
duke@435 | 172 | // +---------------+ <--- sp + 0x40 |
duke@435 | 173 | // | | |
duke@435 | 174 | // . extra 7 slots . |
duke@435 | 175 | // | | |
duke@435 | 176 | // +---------------+ <--- sp + 0x5c |
duke@435 | 177 | // | empty slot | (only if parameter size is even) |
duke@435 | 178 | // +---------------+ |
duke@435 | 179 | // | | |
duke@435 | 180 | // . parameters . |
duke@435 | 181 | // | | |
duke@435 | 182 | // +---------------+ <--- fp + 0 |
duke@435 | 183 | // | | |
duke@435 | 184 | // . reg save area . |
duke@435 | 185 | // | | |
duke@435 | 186 | // +---------------+ <--- fp + 0x40 |
duke@435 | 187 | // | | |
duke@435 | 188 | // . extra 7 slots . |
duke@435 | 189 | // | | |
duke@435 | 190 | // +---------------+ <--- fp + 0x5c |
duke@435 | 191 | // | param. size | |
duke@435 | 192 | // +---------------+ <--- fp + 0x60 |
duke@435 | 193 | // | thread | |
duke@435 | 194 | // +---------------+ |
duke@435 | 195 | // | | |
duke@435 | 196 | |
duke@435 | 197 | // pass parameters if any |
duke@435 | 198 | BLOCK_COMMENT("pass parameters if any"); |
duke@435 | 199 | { const Register src = parameters.as_in().as_register(); |
duke@435 | 200 | const Register dst = Lentry_args; |
duke@435 | 201 | const Register tmp = G3_scratch; |
duke@435 | 202 | const Register cnt = G4_scratch; |
duke@435 | 203 | |
duke@435 | 204 | // test if any parameters & setup of Lentry_args |
duke@435 | 205 | Label exit; |
duke@435 | 206 | __ ld_ptr(parameter_size.as_in().as_address(), cnt); // parameter counter |
duke@435 | 207 | __ add( FP, STACK_BIAS, dst ); |
kvn@3037 | 208 | __ cmp_zero_and_br(Assembler::zero, cnt, exit); |
duke@435 | 209 | __ delayed()->sub(dst, BytesPerWord, dst); // setup Lentry_args |
duke@435 | 210 | |
duke@435 | 211 | // copy parameters if any |
duke@435 | 212 | Label loop; |
duke@435 | 213 | __ BIND(loop); |
duke@435 | 214 | // Store parameter value |
duke@435 | 215 | __ ld_ptr(src, 0, tmp); |
duke@435 | 216 | __ add(src, BytesPerWord, src); |
twisti@1861 | 217 | __ st_ptr(tmp, dst, 0); |
duke@435 | 218 | __ deccc(cnt); |
duke@435 | 219 | __ br(Assembler::greater, false, Assembler::pt, loop); |
twisti@1861 | 220 | __ delayed()->sub(dst, Interpreter::stackElementSize, dst); |
duke@435 | 221 | |
duke@435 | 222 | // done |
duke@435 | 223 | __ BIND(exit); |
duke@435 | 224 | } |
duke@435 | 225 | |
duke@435 | 226 | // setup parameters, method & call Java function |
duke@435 | 227 | #ifdef ASSERT |
duke@435 | 228 | // layout_activation_impl checks it's notion of saved SP against |
duke@435 | 229 | // this register, so if this changes update it as well. |
duke@435 | 230 | const Register saved_SP = Lscratch; |
duke@435 | 231 | __ mov(SP, saved_SP); // keep track of SP before call |
duke@435 | 232 | #endif |
duke@435 | 233 | |
duke@435 | 234 | // setup parameters |
duke@435 | 235 | const Register t = G3_scratch; |
duke@435 | 236 | __ ld_ptr(parameter_size.as_in().as_address(), t); // get parameter size (in words) |
twisti@1861 | 237 | __ sll(t, Interpreter::logStackElementSize, t); // compute number of bytes |
duke@435 | 238 | __ sub(FP, t, Gargs); // setup parameter pointer |
duke@435 | 239 | #ifdef _LP64 |
duke@435 | 240 | __ add( Gargs, STACK_BIAS, Gargs ); // Account for LP64 stack bias |
duke@435 | 241 | #endif |
duke@435 | 242 | __ mov(SP, O5_savedSP); |
duke@435 | 243 | |
duke@435 | 244 | |
duke@435 | 245 | // do the call |
duke@435 | 246 | // |
duke@435 | 247 | // the following register must be setup: |
duke@435 | 248 | // |
duke@435 | 249 | // G2_thread |
duke@435 | 250 | // G5_method |
duke@435 | 251 | // Gargs |
duke@435 | 252 | BLOCK_COMMENT("call Java function"); |
duke@435 | 253 | __ jmpl(entry_point.as_in().as_register(), G0, O7); |
duke@435 | 254 | __ delayed()->mov(method.as_in().as_register(), G5_method); // setup method |
duke@435 | 255 | |
duke@435 | 256 | BLOCK_COMMENT("call_stub_return_address:"); |
duke@435 | 257 | return_pc = __ pc(); |
duke@435 | 258 | |
duke@435 | 259 | // The callee, if it wasn't interpreted, can return with SP changed so |
duke@435 | 260 | // we can no longer assert of change of SP. |
duke@435 | 261 | |
duke@435 | 262 | // store result depending on type |
duke@435 | 263 | // (everything that is not T_OBJECT, T_LONG, T_FLOAT, or T_DOUBLE |
duke@435 | 264 | // is treated as T_INT) |
duke@435 | 265 | { const Register addr = result .as_in().as_register(); |
duke@435 | 266 | const Register type = result_type.as_in().as_register(); |
duke@435 | 267 | Label is_long, is_float, is_double, is_object, exit; |
duke@435 | 268 | __ cmp(type, T_OBJECT); __ br(Assembler::equal, false, Assembler::pn, is_object); |
duke@435 | 269 | __ delayed()->cmp(type, T_FLOAT); __ br(Assembler::equal, false, Assembler::pn, is_float); |
duke@435 | 270 | __ delayed()->cmp(type, T_DOUBLE); __ br(Assembler::equal, false, Assembler::pn, is_double); |
duke@435 | 271 | __ delayed()->cmp(type, T_LONG); __ br(Assembler::equal, false, Assembler::pn, is_long); |
duke@435 | 272 | __ delayed()->nop(); |
duke@435 | 273 | |
duke@435 | 274 | // store int result |
duke@435 | 275 | __ st(O0, addr, G0); |
duke@435 | 276 | |
duke@435 | 277 | __ BIND(exit); |
duke@435 | 278 | __ ret(); |
duke@435 | 279 | __ delayed()->restore(); |
duke@435 | 280 | |
duke@435 | 281 | __ BIND(is_object); |
kvn@3037 | 282 | __ ba(exit); |
duke@435 | 283 | __ delayed()->st_ptr(O0, addr, G0); |
duke@435 | 284 | |
duke@435 | 285 | __ BIND(is_float); |
kvn@3037 | 286 | __ ba(exit); |
duke@435 | 287 | __ delayed()->stf(FloatRegisterImpl::S, F0, addr, G0); |
duke@435 | 288 | |
duke@435 | 289 | __ BIND(is_double); |
kvn@3037 | 290 | __ ba(exit); |
duke@435 | 291 | __ delayed()->stf(FloatRegisterImpl::D, F0, addr, G0); |
duke@435 | 292 | |
duke@435 | 293 | __ BIND(is_long); |
duke@435 | 294 | #ifdef _LP64 |
kvn@3037 | 295 | __ ba(exit); |
duke@435 | 296 | __ delayed()->st_long(O0, addr, G0); // store entire long |
duke@435 | 297 | #else |
duke@435 | 298 | #if defined(COMPILER2) |
duke@435 | 299 | // All return values are where we want them, except for Longs. C2 returns |
duke@435 | 300 | // longs in G1 in the 32-bit build whereas the interpreter wants them in O0/O1. |
duke@435 | 301 | // Since the interpreter will return longs in G1 and O0/O1 in the 32bit |
duke@435 | 302 | // build we simply always use G1. |
duke@435 | 303 | // Note: I tried to make c2 return longs in O0/O1 and G1 so we wouldn't have to |
duke@435 | 304 | // do this here. Unfortunately if we did a rethrow we'd see an machepilog node |
duke@435 | 305 | // first which would move g1 -> O0/O1 and destroy the exception we were throwing. |
duke@435 | 306 | |
kvn@3037 | 307 | __ ba(exit); |
duke@435 | 308 | __ delayed()->stx(G1, addr, G0); // store entire long |
duke@435 | 309 | #else |
duke@435 | 310 | __ st(O1, addr, BytesPerInt); |
kvn@3037 | 311 | __ ba(exit); |
duke@435 | 312 | __ delayed()->st(O0, addr, G0); |
duke@435 | 313 | #endif /* COMPILER2 */ |
duke@435 | 314 | #endif /* _LP64 */ |
duke@435 | 315 | } |
duke@435 | 316 | return start; |
duke@435 | 317 | } |
duke@435 | 318 | |
duke@435 | 319 | |
duke@435 | 320 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 321 | // Return point for a Java call if there's an exception thrown in Java code. |
duke@435 | 322 | // The exception is caught and transformed into a pending exception stored in |
duke@435 | 323 | // JavaThread that can be tested from within the VM. |
duke@435 | 324 | // |
duke@435 | 325 | // Oexception: exception oop |
duke@435 | 326 | |
duke@435 | 327 | address generate_catch_exception() { |
duke@435 | 328 | StubCodeMark mark(this, "StubRoutines", "catch_exception"); |
duke@435 | 329 | |
duke@435 | 330 | address start = __ pc(); |
duke@435 | 331 | // verify that thread corresponds |
duke@435 | 332 | __ verify_thread(); |
duke@435 | 333 | |
duke@435 | 334 | const Register& temp_reg = Gtemp; |
twisti@1162 | 335 | Address pending_exception_addr (G2_thread, Thread::pending_exception_offset()); |
twisti@1162 | 336 | Address exception_file_offset_addr(G2_thread, Thread::exception_file_offset ()); |
twisti@1162 | 337 | Address exception_line_offset_addr(G2_thread, Thread::exception_line_offset ()); |
duke@435 | 338 | |
duke@435 | 339 | // set pending exception |
duke@435 | 340 | __ verify_oop(Oexception); |
duke@435 | 341 | __ st_ptr(Oexception, pending_exception_addr); |
duke@435 | 342 | __ set((intptr_t)__FILE__, temp_reg); |
duke@435 | 343 | __ st_ptr(temp_reg, exception_file_offset_addr); |
duke@435 | 344 | __ set((intptr_t)__LINE__, temp_reg); |
duke@435 | 345 | __ st(temp_reg, exception_line_offset_addr); |
duke@435 | 346 | |
duke@435 | 347 | // complete return to VM |
duke@435 | 348 | assert(StubRoutines::_call_stub_return_address != NULL, "must have been generated before"); |
duke@435 | 349 | |
twisti@1162 | 350 | AddressLiteral stub_ret(StubRoutines::_call_stub_return_address); |
twisti@1162 | 351 | __ jump_to(stub_ret, temp_reg); |
duke@435 | 352 | __ delayed()->nop(); |
duke@435 | 353 | |
duke@435 | 354 | return start; |
duke@435 | 355 | } |
duke@435 | 356 | |
duke@435 | 357 | |
duke@435 | 358 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 359 | // Continuation point for runtime calls returning with a pending exception |
duke@435 | 360 | // The pending exception check happened in the runtime or native call stub |
duke@435 | 361 | // The pending exception in Thread is converted into a Java-level exception |
duke@435 | 362 | // |
duke@435 | 363 | // Contract with Java-level exception handler: O0 = exception |
duke@435 | 364 | // O1 = throwing pc |
duke@435 | 365 | |
duke@435 | 366 | address generate_forward_exception() { |
duke@435 | 367 | StubCodeMark mark(this, "StubRoutines", "forward_exception"); |
duke@435 | 368 | address start = __ pc(); |
duke@435 | 369 | |
duke@435 | 370 | // Upon entry, O7 has the return address returning into Java |
duke@435 | 371 | // (interpreted or compiled) code; i.e. the return address |
duke@435 | 372 | // becomes the throwing pc. |
duke@435 | 373 | |
duke@435 | 374 | const Register& handler_reg = Gtemp; |
duke@435 | 375 | |
twisti@1162 | 376 | Address exception_addr(G2_thread, Thread::pending_exception_offset()); |
duke@435 | 377 | |
duke@435 | 378 | #ifdef ASSERT |
duke@435 | 379 | // make sure that this code is only executed if there is a pending exception |
duke@435 | 380 | { Label L; |
duke@435 | 381 | __ ld_ptr(exception_addr, Gtemp); |
kvn@3037 | 382 | __ br_notnull_short(Gtemp, Assembler::pt, L); |
duke@435 | 383 | __ stop("StubRoutines::forward exception: no pending exception (1)"); |
duke@435 | 384 | __ bind(L); |
duke@435 | 385 | } |
duke@435 | 386 | #endif |
duke@435 | 387 | |
duke@435 | 388 | // compute exception handler into handler_reg |
duke@435 | 389 | __ get_thread(); |
duke@435 | 390 | __ ld_ptr(exception_addr, Oexception); |
duke@435 | 391 | __ verify_oop(Oexception); |
duke@435 | 392 | __ save_frame(0); // compensates for compiler weakness |
duke@435 | 393 | __ add(O7->after_save(), frame::pc_return_offset, Lscratch); // save the issuing PC |
duke@435 | 394 | BLOCK_COMMENT("call exception_handler_for_return_address"); |
twisti@1730 | 395 | __ call_VM_leaf(L7_thread_cache, CAST_FROM_FN_PTR(address, SharedRuntime::exception_handler_for_return_address), G2_thread, Lscratch); |
duke@435 | 396 | __ mov(O0, handler_reg); |
duke@435 | 397 | __ restore(); // compensates for compiler weakness |
duke@435 | 398 | |
duke@435 | 399 | __ ld_ptr(exception_addr, Oexception); |
duke@435 | 400 | __ add(O7, frame::pc_return_offset, Oissuing_pc); // save the issuing PC |
duke@435 | 401 | |
duke@435 | 402 | #ifdef ASSERT |
duke@435 | 403 | // make sure exception is set |
duke@435 | 404 | { Label L; |
kvn@3037 | 405 | __ br_notnull_short(Oexception, Assembler::pt, L); |
duke@435 | 406 | __ stop("StubRoutines::forward exception: no pending exception (2)"); |
duke@435 | 407 | __ bind(L); |
duke@435 | 408 | } |
duke@435 | 409 | #endif |
duke@435 | 410 | // jump to exception handler |
duke@435 | 411 | __ jmp(handler_reg, 0); |
duke@435 | 412 | // clear pending exception |
duke@435 | 413 | __ delayed()->st_ptr(G0, exception_addr); |
duke@435 | 414 | |
duke@435 | 415 | return start; |
duke@435 | 416 | } |
duke@435 | 417 | |
duke@435 | 418 | |
duke@435 | 419 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 420 | // Continuation point for throwing of implicit exceptions that are not handled in |
duke@435 | 421 | // the current activation. Fabricates an exception oop and initiates normal |
duke@435 | 422 | // exception dispatching in this frame. Only callee-saved registers are preserved |
duke@435 | 423 | // (through the normal register window / RegisterMap handling). |
duke@435 | 424 | // If the compiler needs all registers to be preserved between the fault |
duke@435 | 425 | // point and the exception handler then it must assume responsibility for that in |
duke@435 | 426 | // AbstractCompiler::continuation_for_implicit_null_exception or |
duke@435 | 427 | // continuation_for_implicit_division_by_zero_exception. All other implicit |
duke@435 | 428 | // exceptions (e.g., NullPointerException or AbstractMethodError on entry) are |
duke@435 | 429 | // either at call sites or otherwise assume that stack unwinding will be initiated, |
duke@435 | 430 | // so caller saved registers were assumed volatile in the compiler. |
duke@435 | 431 | |
duke@435 | 432 | // Note that we generate only this stub into a RuntimeStub, because it needs to be |
duke@435 | 433 | // properly traversed and ignored during GC, so we change the meaning of the "__" |
duke@435 | 434 | // macro within this method. |
duke@435 | 435 | #undef __ |
duke@435 | 436 | #define __ masm-> |
duke@435 | 437 | |
never@3136 | 438 | address generate_throw_exception(const char* name, address runtime_entry, |
never@2978 | 439 | Register arg1 = noreg, Register arg2 = noreg) { |
duke@435 | 440 | #ifdef ASSERT |
duke@435 | 441 | int insts_size = VerifyThread ? 1 * K : 600; |
duke@435 | 442 | #else |
duke@435 | 443 | int insts_size = VerifyThread ? 1 * K : 256; |
duke@435 | 444 | #endif /* ASSERT */ |
duke@435 | 445 | int locs_size = 32; |
duke@435 | 446 | |
duke@435 | 447 | CodeBuffer code(name, insts_size, locs_size); |
duke@435 | 448 | MacroAssembler* masm = new MacroAssembler(&code); |
duke@435 | 449 | |
duke@435 | 450 | __ verify_thread(); |
duke@435 | 451 | |
duke@435 | 452 | // This is an inlined and slightly modified version of call_VM |
duke@435 | 453 | // which has the ability to fetch the return PC out of thread-local storage |
duke@435 | 454 | __ assert_not_delayed(); |
duke@435 | 455 | |
duke@435 | 456 | // Note that we always push a frame because on the SPARC |
duke@435 | 457 | // architecture, for all of our implicit exception kinds at call |
duke@435 | 458 | // sites, the implicit exception is taken before the callee frame |
duke@435 | 459 | // is pushed. |
duke@435 | 460 | __ save_frame(0); |
duke@435 | 461 | |
duke@435 | 462 | int frame_complete = __ offset(); |
duke@435 | 463 | |
duke@435 | 464 | // Note that we always have a runtime stub frame on the top of stack by this point |
duke@435 | 465 | Register last_java_sp = SP; |
duke@435 | 466 | // 64-bit last_java_sp is biased! |
duke@435 | 467 | __ set_last_Java_frame(last_java_sp, G0); |
duke@435 | 468 | if (VerifyThread) __ mov(G2_thread, O0); // about to be smashed; pass early |
duke@435 | 469 | __ save_thread(noreg); |
never@2978 | 470 | if (arg1 != noreg) { |
never@2978 | 471 | assert(arg2 != O1, "clobbered"); |
never@2978 | 472 | __ mov(arg1, O1); |
never@2978 | 473 | } |
never@2978 | 474 | if (arg2 != noreg) { |
never@2978 | 475 | __ mov(arg2, O2); |
never@2978 | 476 | } |
duke@435 | 477 | // do the call |
duke@435 | 478 | BLOCK_COMMENT("call runtime_entry"); |
duke@435 | 479 | __ call(runtime_entry, relocInfo::runtime_call_type); |
duke@435 | 480 | if (!VerifyThread) |
duke@435 | 481 | __ delayed()->mov(G2_thread, O0); // pass thread as first argument |
duke@435 | 482 | else |
duke@435 | 483 | __ delayed()->nop(); // (thread already passed) |
duke@435 | 484 | __ restore_thread(noreg); |
duke@435 | 485 | __ reset_last_Java_frame(); |
duke@435 | 486 | |
duke@435 | 487 | // check for pending exceptions. use Gtemp as scratch register. |
duke@435 | 488 | #ifdef ASSERT |
duke@435 | 489 | Label L; |
duke@435 | 490 | |
twisti@1162 | 491 | Address exception_addr(G2_thread, Thread::pending_exception_offset()); |
duke@435 | 492 | Register scratch_reg = Gtemp; |
duke@435 | 493 | __ ld_ptr(exception_addr, scratch_reg); |
kvn@3037 | 494 | __ br_notnull_short(scratch_reg, Assembler::pt, L); |
duke@435 | 495 | __ should_not_reach_here(); |
duke@435 | 496 | __ bind(L); |
duke@435 | 497 | #endif // ASSERT |
duke@435 | 498 | BLOCK_COMMENT("call forward_exception_entry"); |
duke@435 | 499 | __ call(StubRoutines::forward_exception_entry(), relocInfo::runtime_call_type); |
duke@435 | 500 | // we use O7 linkage so that forward_exception_entry has the issuing PC |
duke@435 | 501 | __ delayed()->restore(); |
duke@435 | 502 | |
duke@435 | 503 | RuntimeStub* stub = RuntimeStub::new_runtime_stub(name, &code, frame_complete, masm->total_frame_size_in_bytes(0), NULL, false); |
duke@435 | 504 | return stub->entry_point(); |
duke@435 | 505 | } |
duke@435 | 506 | |
duke@435 | 507 | #undef __ |
duke@435 | 508 | #define __ _masm-> |
duke@435 | 509 | |
duke@435 | 510 | |
duke@435 | 511 | // Generate a routine that sets all the registers so we |
duke@435 | 512 | // can tell if the stop routine prints them correctly. |
duke@435 | 513 | address generate_test_stop() { |
duke@435 | 514 | StubCodeMark mark(this, "StubRoutines", "test_stop"); |
duke@435 | 515 | address start = __ pc(); |
duke@435 | 516 | |
duke@435 | 517 | int i; |
duke@435 | 518 | |
duke@435 | 519 | __ save_frame(0); |
duke@435 | 520 | |
duke@435 | 521 | static jfloat zero = 0.0, one = 1.0; |
duke@435 | 522 | |
duke@435 | 523 | // put addr in L0, then load through L0 to F0 |
duke@435 | 524 | __ set((intptr_t)&zero, L0); __ ldf( FloatRegisterImpl::S, L0, 0, F0); |
duke@435 | 525 | __ set((intptr_t)&one, L0); __ ldf( FloatRegisterImpl::S, L0, 0, F1); // 1.0 to F1 |
duke@435 | 526 | |
duke@435 | 527 | // use add to put 2..18 in F2..F18 |
duke@435 | 528 | for ( i = 2; i <= 18; ++i ) { |
duke@435 | 529 | __ fadd( FloatRegisterImpl::S, F1, as_FloatRegister(i-1), as_FloatRegister(i)); |
duke@435 | 530 | } |
duke@435 | 531 | |
duke@435 | 532 | // Now put double 2 in F16, double 18 in F18 |
duke@435 | 533 | __ ftof( FloatRegisterImpl::S, FloatRegisterImpl::D, F2, F16 ); |
duke@435 | 534 | __ ftof( FloatRegisterImpl::S, FloatRegisterImpl::D, F18, F18 ); |
duke@435 | 535 | |
duke@435 | 536 | // use add to put 20..32 in F20..F32 |
duke@435 | 537 | for (i = 20; i < 32; i += 2) { |
duke@435 | 538 | __ fadd( FloatRegisterImpl::D, F16, as_FloatRegister(i-2), as_FloatRegister(i)); |
duke@435 | 539 | } |
duke@435 | 540 | |
duke@435 | 541 | // put 0..7 in i's, 8..15 in l's, 16..23 in o's, 24..31 in g's |
duke@435 | 542 | for ( i = 0; i < 8; ++i ) { |
duke@435 | 543 | if (i < 6) { |
duke@435 | 544 | __ set( i, as_iRegister(i)); |
duke@435 | 545 | __ set(16 + i, as_oRegister(i)); |
duke@435 | 546 | __ set(24 + i, as_gRegister(i)); |
duke@435 | 547 | } |
duke@435 | 548 | __ set( 8 + i, as_lRegister(i)); |
duke@435 | 549 | } |
duke@435 | 550 | |
duke@435 | 551 | __ stop("testing stop"); |
duke@435 | 552 | |
duke@435 | 553 | |
duke@435 | 554 | __ ret(); |
duke@435 | 555 | __ delayed()->restore(); |
duke@435 | 556 | |
duke@435 | 557 | return start; |
duke@435 | 558 | } |
duke@435 | 559 | |
duke@435 | 560 | |
duke@435 | 561 | address generate_stop_subroutine() { |
duke@435 | 562 | StubCodeMark mark(this, "StubRoutines", "stop_subroutine"); |
duke@435 | 563 | address start = __ pc(); |
duke@435 | 564 | |
duke@435 | 565 | __ stop_subroutine(); |
duke@435 | 566 | |
duke@435 | 567 | return start; |
duke@435 | 568 | } |
duke@435 | 569 | |
duke@435 | 570 | address generate_flush_callers_register_windows() { |
duke@435 | 571 | StubCodeMark mark(this, "StubRoutines", "flush_callers_register_windows"); |
duke@435 | 572 | address start = __ pc(); |
duke@435 | 573 | |
duke@435 | 574 | __ flush_windows(); |
duke@435 | 575 | __ retl(false); |
duke@435 | 576 | __ delayed()->add( FP, STACK_BIAS, O0 ); |
duke@435 | 577 | // The returned value must be a stack pointer whose register save area |
duke@435 | 578 | // is flushed, and will stay flushed while the caller executes. |
duke@435 | 579 | |
duke@435 | 580 | return start; |
duke@435 | 581 | } |
duke@435 | 582 | |
duke@435 | 583 | // Helper functions for v8 atomic operations. |
duke@435 | 584 | // |
duke@435 | 585 | void get_v8_oop_lock_ptr(Register lock_ptr_reg, Register mark_oop_reg, Register scratch_reg) { |
duke@435 | 586 | if (mark_oop_reg == noreg) { |
duke@435 | 587 | address lock_ptr = (address)StubRoutines::Sparc::atomic_memory_operation_lock_addr(); |
duke@435 | 588 | __ set((intptr_t)lock_ptr, lock_ptr_reg); |
duke@435 | 589 | } else { |
duke@435 | 590 | assert(scratch_reg != noreg, "just checking"); |
duke@435 | 591 | address lock_ptr = (address)StubRoutines::Sparc::_v8_oop_lock_cache; |
duke@435 | 592 | __ set((intptr_t)lock_ptr, lock_ptr_reg); |
duke@435 | 593 | __ and3(mark_oop_reg, StubRoutines::Sparc::v8_oop_lock_mask_in_place, scratch_reg); |
duke@435 | 594 | __ add(lock_ptr_reg, scratch_reg, lock_ptr_reg); |
duke@435 | 595 | } |
duke@435 | 596 | } |
duke@435 | 597 | |
duke@435 | 598 | void generate_v8_lock_prologue(Register lock_reg, Register lock_ptr_reg, Register yield_reg, Label& retry, Label& dontyield, Register mark_oop_reg = noreg, Register scratch_reg = noreg) { |
duke@435 | 599 | |
duke@435 | 600 | get_v8_oop_lock_ptr(lock_ptr_reg, mark_oop_reg, scratch_reg); |
duke@435 | 601 | __ set(StubRoutines::Sparc::locked, lock_reg); |
duke@435 | 602 | // Initialize yield counter |
duke@435 | 603 | __ mov(G0,yield_reg); |
duke@435 | 604 | |
duke@435 | 605 | __ BIND(retry); |
kvn@3037 | 606 | __ cmp_and_br_short(yield_reg, V8AtomicOperationUnderLockSpinCount, Assembler::less, Assembler::pt, dontyield); |
duke@435 | 607 | |
duke@435 | 608 | // This code can only be called from inside the VM, this |
duke@435 | 609 | // stub is only invoked from Atomic::add(). We do not |
duke@435 | 610 | // want to use call_VM, because _last_java_sp and such |
duke@435 | 611 | // must already be set. |
duke@435 | 612 | // |
duke@435 | 613 | // Save the regs and make space for a C call |
duke@435 | 614 | __ save(SP, -96, SP); |
duke@435 | 615 | __ save_all_globals_into_locals(); |
duke@435 | 616 | BLOCK_COMMENT("call os::naked_sleep"); |
duke@435 | 617 | __ call(CAST_FROM_FN_PTR(address, os::naked_sleep)); |
duke@435 | 618 | __ delayed()->nop(); |
duke@435 | 619 | __ restore_globals_from_locals(); |
duke@435 | 620 | __ restore(); |
duke@435 | 621 | // reset the counter |
duke@435 | 622 | __ mov(G0,yield_reg); |
duke@435 | 623 | |
duke@435 | 624 | __ BIND(dontyield); |
duke@435 | 625 | |
duke@435 | 626 | // try to get lock |
duke@435 | 627 | __ swap(lock_ptr_reg, 0, lock_reg); |
duke@435 | 628 | |
duke@435 | 629 | // did we get the lock? |
duke@435 | 630 | __ cmp(lock_reg, StubRoutines::Sparc::unlocked); |
duke@435 | 631 | __ br(Assembler::notEqual, true, Assembler::pn, retry); |
duke@435 | 632 | __ delayed()->add(yield_reg,1,yield_reg); |
duke@435 | 633 | |
duke@435 | 634 | // yes, got lock. do the operation here. |
duke@435 | 635 | } |
duke@435 | 636 | |
duke@435 | 637 | void generate_v8_lock_epilogue(Register lock_reg, Register lock_ptr_reg, Register yield_reg, Label& retry, Label& dontyield, Register mark_oop_reg = noreg, Register scratch_reg = noreg) { |
duke@435 | 638 | __ st(lock_reg, lock_ptr_reg, 0); // unlock |
duke@435 | 639 | } |
duke@435 | 640 | |
duke@435 | 641 | // Support for jint Atomic::xchg(jint exchange_value, volatile jint* dest). |
duke@435 | 642 | // |
duke@435 | 643 | // Arguments : |
duke@435 | 644 | // |
duke@435 | 645 | // exchange_value: O0 |
duke@435 | 646 | // dest: O1 |
duke@435 | 647 | // |
duke@435 | 648 | // Results: |
duke@435 | 649 | // |
duke@435 | 650 | // O0: the value previously stored in dest |
duke@435 | 651 | // |
duke@435 | 652 | address generate_atomic_xchg() { |
duke@435 | 653 | StubCodeMark mark(this, "StubRoutines", "atomic_xchg"); |
duke@435 | 654 | address start = __ pc(); |
duke@435 | 655 | |
duke@435 | 656 | if (UseCASForSwap) { |
duke@435 | 657 | // Use CAS instead of swap, just in case the MP hardware |
duke@435 | 658 | // prefers to work with just one kind of synch. instruction. |
duke@435 | 659 | Label retry; |
duke@435 | 660 | __ BIND(retry); |
duke@435 | 661 | __ mov(O0, O3); // scratch copy of exchange value |
duke@435 | 662 | __ ld(O1, 0, O2); // observe the previous value |
duke@435 | 663 | // try to replace O2 with O3 |
duke@435 | 664 | __ cas_under_lock(O1, O2, O3, |
duke@435 | 665 | (address)StubRoutines::Sparc::atomic_memory_operation_lock_addr(),false); |
kvn@3037 | 666 | __ cmp_and_br_short(O2, O3, Assembler::notEqual, Assembler::pn, retry); |
duke@435 | 667 | |
duke@435 | 668 | __ retl(false); |
duke@435 | 669 | __ delayed()->mov(O2, O0); // report previous value to caller |
duke@435 | 670 | |
duke@435 | 671 | } else { |
duke@435 | 672 | if (VM_Version::v9_instructions_work()) { |
duke@435 | 673 | __ retl(false); |
duke@435 | 674 | __ delayed()->swap(O1, 0, O0); |
duke@435 | 675 | } else { |
duke@435 | 676 | const Register& lock_reg = O2; |
duke@435 | 677 | const Register& lock_ptr_reg = O3; |
duke@435 | 678 | const Register& yield_reg = O4; |
duke@435 | 679 | |
duke@435 | 680 | Label retry; |
duke@435 | 681 | Label dontyield; |
duke@435 | 682 | |
duke@435 | 683 | generate_v8_lock_prologue(lock_reg, lock_ptr_reg, yield_reg, retry, dontyield); |
duke@435 | 684 | // got the lock, do the swap |
duke@435 | 685 | __ swap(O1, 0, O0); |
duke@435 | 686 | |
duke@435 | 687 | generate_v8_lock_epilogue(lock_reg, lock_ptr_reg, yield_reg, retry, dontyield); |
duke@435 | 688 | __ retl(false); |
duke@435 | 689 | __ delayed()->nop(); |
duke@435 | 690 | } |
duke@435 | 691 | } |
duke@435 | 692 | |
duke@435 | 693 | return start; |
duke@435 | 694 | } |
duke@435 | 695 | |
duke@435 | 696 | |
duke@435 | 697 | // Support for jint Atomic::cmpxchg(jint exchange_value, volatile jint* dest, jint compare_value) |
duke@435 | 698 | // |
duke@435 | 699 | // Arguments : |
duke@435 | 700 | // |
duke@435 | 701 | // exchange_value: O0 |
duke@435 | 702 | // dest: O1 |
duke@435 | 703 | // compare_value: O2 |
duke@435 | 704 | // |
duke@435 | 705 | // Results: |
duke@435 | 706 | // |
duke@435 | 707 | // O0: the value previously stored in dest |
duke@435 | 708 | // |
duke@435 | 709 | // Overwrites (v8): O3,O4,O5 |
duke@435 | 710 | // |
duke@435 | 711 | address generate_atomic_cmpxchg() { |
duke@435 | 712 | StubCodeMark mark(this, "StubRoutines", "atomic_cmpxchg"); |
duke@435 | 713 | address start = __ pc(); |
duke@435 | 714 | |
duke@435 | 715 | // cmpxchg(dest, compare_value, exchange_value) |
duke@435 | 716 | __ cas_under_lock(O1, O2, O0, |
duke@435 | 717 | (address)StubRoutines::Sparc::atomic_memory_operation_lock_addr(),false); |
duke@435 | 718 | __ retl(false); |
duke@435 | 719 | __ delayed()->nop(); |
duke@435 | 720 | |
duke@435 | 721 | return start; |
duke@435 | 722 | } |
duke@435 | 723 | |
duke@435 | 724 | // Support for jlong Atomic::cmpxchg(jlong exchange_value, volatile jlong *dest, jlong compare_value) |
duke@435 | 725 | // |
duke@435 | 726 | // Arguments : |
duke@435 | 727 | // |
duke@435 | 728 | // exchange_value: O1:O0 |
duke@435 | 729 | // dest: O2 |
duke@435 | 730 | // compare_value: O4:O3 |
duke@435 | 731 | // |
duke@435 | 732 | // Results: |
duke@435 | 733 | // |
duke@435 | 734 | // O1:O0: the value previously stored in dest |
duke@435 | 735 | // |
duke@435 | 736 | // This only works on V9, on V8 we don't generate any |
duke@435 | 737 | // code and just return NULL. |
duke@435 | 738 | // |
duke@435 | 739 | // Overwrites: G1,G2,G3 |
duke@435 | 740 | // |
duke@435 | 741 | address generate_atomic_cmpxchg_long() { |
duke@435 | 742 | StubCodeMark mark(this, "StubRoutines", "atomic_cmpxchg_long"); |
duke@435 | 743 | address start = __ pc(); |
duke@435 | 744 | |
duke@435 | 745 | if (!VM_Version::supports_cx8()) |
duke@435 | 746 | return NULL;; |
duke@435 | 747 | __ sllx(O0, 32, O0); |
duke@435 | 748 | __ srl(O1, 0, O1); |
duke@435 | 749 | __ or3(O0,O1,O0); // O0 holds 64-bit value from compare_value |
duke@435 | 750 | __ sllx(O3, 32, O3); |
duke@435 | 751 | __ srl(O4, 0, O4); |
duke@435 | 752 | __ or3(O3,O4,O3); // O3 holds 64-bit value from exchange_value |
duke@435 | 753 | __ casx(O2, O3, O0); |
duke@435 | 754 | __ srl(O0, 0, O1); // unpacked return value in O1:O0 |
duke@435 | 755 | __ retl(false); |
duke@435 | 756 | __ delayed()->srlx(O0, 32, O0); |
duke@435 | 757 | |
duke@435 | 758 | return start; |
duke@435 | 759 | } |
duke@435 | 760 | |
duke@435 | 761 | |
duke@435 | 762 | // Support for jint Atomic::add(jint add_value, volatile jint* dest). |
duke@435 | 763 | // |
duke@435 | 764 | // Arguments : |
duke@435 | 765 | // |
duke@435 | 766 | // add_value: O0 (e.g., +1 or -1) |
duke@435 | 767 | // dest: O1 |
duke@435 | 768 | // |
duke@435 | 769 | // Results: |
duke@435 | 770 | // |
duke@435 | 771 | // O0: the new value stored in dest |
duke@435 | 772 | // |
duke@435 | 773 | // Overwrites (v9): O3 |
duke@435 | 774 | // Overwrites (v8): O3,O4,O5 |
duke@435 | 775 | // |
duke@435 | 776 | address generate_atomic_add() { |
duke@435 | 777 | StubCodeMark mark(this, "StubRoutines", "atomic_add"); |
duke@435 | 778 | address start = __ pc(); |
duke@435 | 779 | __ BIND(_atomic_add_stub); |
duke@435 | 780 | |
duke@435 | 781 | if (VM_Version::v9_instructions_work()) { |
duke@435 | 782 | Label(retry); |
duke@435 | 783 | __ BIND(retry); |
duke@435 | 784 | |
duke@435 | 785 | __ lduw(O1, 0, O2); |
kvn@3037 | 786 | __ add(O0, O2, O3); |
kvn@3037 | 787 | __ cas(O1, O2, O3); |
kvn@3037 | 788 | __ cmp_and_br_short(O2, O3, Assembler::notEqual, Assembler::pn, retry); |
duke@435 | 789 | __ retl(false); |
duke@435 | 790 | __ delayed()->add(O0, O2, O0); // note that cas made O2==O3 |
duke@435 | 791 | } else { |
duke@435 | 792 | const Register& lock_reg = O2; |
duke@435 | 793 | const Register& lock_ptr_reg = O3; |
duke@435 | 794 | const Register& value_reg = O4; |
duke@435 | 795 | const Register& yield_reg = O5; |
duke@435 | 796 | |
duke@435 | 797 | Label(retry); |
duke@435 | 798 | Label(dontyield); |
duke@435 | 799 | |
duke@435 | 800 | generate_v8_lock_prologue(lock_reg, lock_ptr_reg, yield_reg, retry, dontyield); |
duke@435 | 801 | // got lock, do the increment |
duke@435 | 802 | __ ld(O1, 0, value_reg); |
duke@435 | 803 | __ add(O0, value_reg, value_reg); |
duke@435 | 804 | __ st(value_reg, O1, 0); |
duke@435 | 805 | |
duke@435 | 806 | // %%% only for RMO and PSO |
duke@435 | 807 | __ membar(Assembler::StoreStore); |
duke@435 | 808 | |
duke@435 | 809 | generate_v8_lock_epilogue(lock_reg, lock_ptr_reg, yield_reg, retry, dontyield); |
duke@435 | 810 | |
duke@435 | 811 | __ retl(false); |
duke@435 | 812 | __ delayed()->mov(value_reg, O0); |
duke@435 | 813 | } |
duke@435 | 814 | |
duke@435 | 815 | return start; |
duke@435 | 816 | } |
duke@435 | 817 | Label _atomic_add_stub; // called from other stubs |
duke@435 | 818 | |
duke@435 | 819 | |
duke@435 | 820 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 821 | // The following routine generates a subroutine to throw an asynchronous |
duke@435 | 822 | // UnknownError when an unsafe access gets a fault that could not be |
duke@435 | 823 | // reasonably prevented by the programmer. (Example: SIGBUS/OBJERR.) |
duke@435 | 824 | // |
duke@435 | 825 | // Arguments : |
duke@435 | 826 | // |
duke@435 | 827 | // trapping PC: O7 |
duke@435 | 828 | // |
duke@435 | 829 | // Results: |
duke@435 | 830 | // posts an asynchronous exception, skips the trapping instruction |
duke@435 | 831 | // |
duke@435 | 832 | |
duke@435 | 833 | address generate_handler_for_unsafe_access() { |
duke@435 | 834 | StubCodeMark mark(this, "StubRoutines", "handler_for_unsafe_access"); |
duke@435 | 835 | address start = __ pc(); |
duke@435 | 836 | |
duke@435 | 837 | const int preserve_register_words = (64 * 2); |
twisti@1162 | 838 | Address preserve_addr(FP, (-preserve_register_words * wordSize) + STACK_BIAS); |
duke@435 | 839 | |
duke@435 | 840 | Register Lthread = L7_thread_cache; |
duke@435 | 841 | int i; |
duke@435 | 842 | |
duke@435 | 843 | __ save_frame(0); |
duke@435 | 844 | __ mov(G1, L1); |
duke@435 | 845 | __ mov(G2, L2); |
duke@435 | 846 | __ mov(G3, L3); |
duke@435 | 847 | __ mov(G4, L4); |
duke@435 | 848 | __ mov(G5, L5); |
duke@435 | 849 | for (i = 0; i < (VM_Version::v9_instructions_work() ? 64 : 32); i += 2) { |
duke@435 | 850 | __ stf(FloatRegisterImpl::D, as_FloatRegister(i), preserve_addr, i * wordSize); |
duke@435 | 851 | } |
duke@435 | 852 | |
duke@435 | 853 | address entry_point = CAST_FROM_FN_PTR(address, handle_unsafe_access); |
duke@435 | 854 | BLOCK_COMMENT("call handle_unsafe_access"); |
duke@435 | 855 | __ call(entry_point, relocInfo::runtime_call_type); |
duke@435 | 856 | __ delayed()->nop(); |
duke@435 | 857 | |
duke@435 | 858 | __ mov(L1, G1); |
duke@435 | 859 | __ mov(L2, G2); |
duke@435 | 860 | __ mov(L3, G3); |
duke@435 | 861 | __ mov(L4, G4); |
duke@435 | 862 | __ mov(L5, G5); |
duke@435 | 863 | for (i = 0; i < (VM_Version::v9_instructions_work() ? 64 : 32); i += 2) { |
duke@435 | 864 | __ ldf(FloatRegisterImpl::D, preserve_addr, as_FloatRegister(i), i * wordSize); |
duke@435 | 865 | } |
duke@435 | 866 | |
duke@435 | 867 | __ verify_thread(); |
duke@435 | 868 | |
duke@435 | 869 | __ jmp(O0, 0); |
duke@435 | 870 | __ delayed()->restore(); |
duke@435 | 871 | |
duke@435 | 872 | return start; |
duke@435 | 873 | } |
duke@435 | 874 | |
duke@435 | 875 | |
duke@435 | 876 | // Support for uint StubRoutine::Sparc::partial_subtype_check( Klass sub, Klass super ); |
duke@435 | 877 | // Arguments : |
duke@435 | 878 | // |
duke@435 | 879 | // ret : O0, returned |
duke@435 | 880 | // icc/xcc: set as O0 (depending on wordSize) |
duke@435 | 881 | // sub : O1, argument, not changed |
duke@435 | 882 | // super: O2, argument, not changed |
duke@435 | 883 | // raddr: O7, blown by call |
duke@435 | 884 | address generate_partial_subtype_check() { |
coleenp@548 | 885 | __ align(CodeEntryAlignment); |
duke@435 | 886 | StubCodeMark mark(this, "StubRoutines", "partial_subtype_check"); |
duke@435 | 887 | address start = __ pc(); |
jrose@1079 | 888 | Label miss; |
duke@435 | 889 | |
duke@435 | 890 | #if defined(COMPILER2) && !defined(_LP64) |
duke@435 | 891 | // Do not use a 'save' because it blows the 64-bit O registers. |
coleenp@548 | 892 | __ add(SP,-4*wordSize,SP); // Make space for 4 temps (stack must be 2 words aligned) |
duke@435 | 893 | __ st_ptr(L0,SP,(frame::register_save_words+0)*wordSize); |
duke@435 | 894 | __ st_ptr(L1,SP,(frame::register_save_words+1)*wordSize); |
duke@435 | 895 | __ st_ptr(L2,SP,(frame::register_save_words+2)*wordSize); |
duke@435 | 896 | __ st_ptr(L3,SP,(frame::register_save_words+3)*wordSize); |
duke@435 | 897 | Register Rret = O0; |
duke@435 | 898 | Register Rsub = O1; |
duke@435 | 899 | Register Rsuper = O2; |
duke@435 | 900 | #else |
duke@435 | 901 | __ save_frame(0); |
duke@435 | 902 | Register Rret = I0; |
duke@435 | 903 | Register Rsub = I1; |
duke@435 | 904 | Register Rsuper = I2; |
duke@435 | 905 | #endif |
duke@435 | 906 | |
duke@435 | 907 | Register L0_ary_len = L0; |
duke@435 | 908 | Register L1_ary_ptr = L1; |
duke@435 | 909 | Register L2_super = L2; |
duke@435 | 910 | Register L3_index = L3; |
duke@435 | 911 | |
jrose@1079 | 912 | __ check_klass_subtype_slow_path(Rsub, Rsuper, |
jrose@1079 | 913 | L0, L1, L2, L3, |
jrose@1079 | 914 | NULL, &miss); |
jrose@1079 | 915 | |
jrose@1079 | 916 | // Match falls through here. |
jrose@1079 | 917 | __ addcc(G0,0,Rret); // set Z flags, Z result |
duke@435 | 918 | |
duke@435 | 919 | #if defined(COMPILER2) && !defined(_LP64) |
duke@435 | 920 | __ ld_ptr(SP,(frame::register_save_words+0)*wordSize,L0); |
duke@435 | 921 | __ ld_ptr(SP,(frame::register_save_words+1)*wordSize,L1); |
duke@435 | 922 | __ ld_ptr(SP,(frame::register_save_words+2)*wordSize,L2); |
duke@435 | 923 | __ ld_ptr(SP,(frame::register_save_words+3)*wordSize,L3); |
duke@435 | 924 | __ retl(); // Result in Rret is zero; flags set to Z |
duke@435 | 925 | __ delayed()->add(SP,4*wordSize,SP); |
duke@435 | 926 | #else |
duke@435 | 927 | __ ret(); // Result in Rret is zero; flags set to Z |
duke@435 | 928 | __ delayed()->restore(); |
duke@435 | 929 | #endif |
duke@435 | 930 | |
duke@435 | 931 | __ BIND(miss); |
duke@435 | 932 | __ addcc(G0,1,Rret); // set NZ flags, NZ result |
duke@435 | 933 | |
duke@435 | 934 | #if defined(COMPILER2) && !defined(_LP64) |
duke@435 | 935 | __ ld_ptr(SP,(frame::register_save_words+0)*wordSize,L0); |
duke@435 | 936 | __ ld_ptr(SP,(frame::register_save_words+1)*wordSize,L1); |
duke@435 | 937 | __ ld_ptr(SP,(frame::register_save_words+2)*wordSize,L2); |
duke@435 | 938 | __ ld_ptr(SP,(frame::register_save_words+3)*wordSize,L3); |
duke@435 | 939 | __ retl(); // Result in Rret is != 0; flags set to NZ |
duke@435 | 940 | __ delayed()->add(SP,4*wordSize,SP); |
duke@435 | 941 | #else |
duke@435 | 942 | __ ret(); // Result in Rret is != 0; flags set to NZ |
duke@435 | 943 | __ delayed()->restore(); |
duke@435 | 944 | #endif |
duke@435 | 945 | |
duke@435 | 946 | return start; |
duke@435 | 947 | } |
duke@435 | 948 | |
duke@435 | 949 | |
duke@435 | 950 | // Called from MacroAssembler::verify_oop |
duke@435 | 951 | // |
duke@435 | 952 | address generate_verify_oop_subroutine() { |
duke@435 | 953 | StubCodeMark mark(this, "StubRoutines", "verify_oop_stub"); |
duke@435 | 954 | |
duke@435 | 955 | address start = __ pc(); |
duke@435 | 956 | |
duke@435 | 957 | __ verify_oop_subroutine(); |
duke@435 | 958 | |
duke@435 | 959 | return start; |
duke@435 | 960 | } |
duke@435 | 961 | |
duke@435 | 962 | |
duke@435 | 963 | // |
duke@435 | 964 | // Verify that a register contains clean 32-bits positive value |
duke@435 | 965 | // (high 32-bits are 0) so it could be used in 64-bits shifts (sllx, srax). |
duke@435 | 966 | // |
duke@435 | 967 | // Input: |
duke@435 | 968 | // Rint - 32-bits value |
duke@435 | 969 | // Rtmp - scratch |
duke@435 | 970 | // |
duke@435 | 971 | void assert_clean_int(Register Rint, Register Rtmp) { |
duke@435 | 972 | #if defined(ASSERT) && defined(_LP64) |
duke@435 | 973 | __ signx(Rint, Rtmp); |
duke@435 | 974 | __ cmp(Rint, Rtmp); |
duke@435 | 975 | __ breakpoint_trap(Assembler::notEqual, Assembler::xcc); |
duke@435 | 976 | #endif |
duke@435 | 977 | } |
duke@435 | 978 | |
duke@435 | 979 | // |
duke@435 | 980 | // Generate overlap test for array copy stubs |
duke@435 | 981 | // |
duke@435 | 982 | // Input: |
duke@435 | 983 | // O0 - array1 |
duke@435 | 984 | // O1 - array2 |
duke@435 | 985 | // O2 - element count |
duke@435 | 986 | // |
duke@435 | 987 | // Kills temps: O3, O4 |
duke@435 | 988 | // |
duke@435 | 989 | void array_overlap_test(address no_overlap_target, int log2_elem_size) { |
duke@435 | 990 | assert(no_overlap_target != NULL, "must be generated"); |
duke@435 | 991 | array_overlap_test(no_overlap_target, NULL, log2_elem_size); |
duke@435 | 992 | } |
duke@435 | 993 | void array_overlap_test(Label& L_no_overlap, int log2_elem_size) { |
duke@435 | 994 | array_overlap_test(NULL, &L_no_overlap, log2_elem_size); |
duke@435 | 995 | } |
duke@435 | 996 | void array_overlap_test(address no_overlap_target, Label* NOLp, int log2_elem_size) { |
duke@435 | 997 | const Register from = O0; |
duke@435 | 998 | const Register to = O1; |
duke@435 | 999 | const Register count = O2; |
duke@435 | 1000 | const Register to_from = O3; // to - from |
duke@435 | 1001 | const Register byte_count = O4; // count << log2_elem_size |
duke@435 | 1002 | |
duke@435 | 1003 | __ subcc(to, from, to_from); |
duke@435 | 1004 | __ sll_ptr(count, log2_elem_size, byte_count); |
duke@435 | 1005 | if (NOLp == NULL) |
duke@435 | 1006 | __ brx(Assembler::lessEqualUnsigned, false, Assembler::pt, no_overlap_target); |
duke@435 | 1007 | else |
duke@435 | 1008 | __ brx(Assembler::lessEqualUnsigned, false, Assembler::pt, (*NOLp)); |
duke@435 | 1009 | __ delayed()->cmp(to_from, byte_count); |
duke@435 | 1010 | if (NOLp == NULL) |
tonyp@2010 | 1011 | __ brx(Assembler::greaterEqualUnsigned, false, Assembler::pt, no_overlap_target); |
duke@435 | 1012 | else |
tonyp@2010 | 1013 | __ brx(Assembler::greaterEqualUnsigned, false, Assembler::pt, (*NOLp)); |
duke@435 | 1014 | __ delayed()->nop(); |
duke@435 | 1015 | } |
duke@435 | 1016 | |
duke@435 | 1017 | // |
duke@435 | 1018 | // Generate pre-write barrier for array. |
duke@435 | 1019 | // |
duke@435 | 1020 | // Input: |
duke@435 | 1021 | // addr - register containing starting address |
duke@435 | 1022 | // count - register containing element count |
duke@435 | 1023 | // tmp - scratch register |
duke@435 | 1024 | // |
duke@435 | 1025 | // The input registers are overwritten. |
duke@435 | 1026 | // |
iveresov@2606 | 1027 | void gen_write_ref_array_pre_barrier(Register addr, Register count, bool dest_uninitialized) { |
duke@435 | 1028 | BarrierSet* bs = Universe::heap()->barrier_set(); |
iveresov@2606 | 1029 | switch (bs->kind()) { |
iveresov@2606 | 1030 | case BarrierSet::G1SATBCT: |
iveresov@2606 | 1031 | case BarrierSet::G1SATBCTLogging: |
iveresov@2606 | 1032 | // With G1, don't generate the call if we statically know that the target in uninitialized |
iveresov@2606 | 1033 | if (!dest_uninitialized) { |
iveresov@2606 | 1034 | __ save_frame(0); |
iveresov@2606 | 1035 | // Save the necessary global regs... will be used after. |
iveresov@2606 | 1036 | if (addr->is_global()) { |
iveresov@2606 | 1037 | __ mov(addr, L0); |
iveresov@2606 | 1038 | } |
iveresov@2606 | 1039 | if (count->is_global()) { |
iveresov@2606 | 1040 | __ mov(count, L1); |
iveresov@2606 | 1041 | } |
iveresov@2606 | 1042 | __ mov(addr->after_save(), O0); |
iveresov@2606 | 1043 | // Get the count into O1 |
iveresov@2606 | 1044 | __ call(CAST_FROM_FN_PTR(address, BarrierSet::static_write_ref_array_pre)); |
iveresov@2606 | 1045 | __ delayed()->mov(count->after_save(), O1); |
iveresov@2606 | 1046 | if (addr->is_global()) { |
iveresov@2606 | 1047 | __ mov(L0, addr); |
iveresov@2606 | 1048 | } |
iveresov@2606 | 1049 | if (count->is_global()) { |
iveresov@2606 | 1050 | __ mov(L1, count); |
iveresov@2606 | 1051 | } |
iveresov@2606 | 1052 | __ restore(); |
iveresov@2606 | 1053 | } |
iveresov@2606 | 1054 | break; |
iveresov@2606 | 1055 | case BarrierSet::CardTableModRef: |
iveresov@2606 | 1056 | case BarrierSet::CardTableExtension: |
iveresov@2606 | 1057 | case BarrierSet::ModRef: |
iveresov@2606 | 1058 | break; |
iveresov@2606 | 1059 | default: |
iveresov@2606 | 1060 | ShouldNotReachHere(); |
duke@435 | 1061 | } |
duke@435 | 1062 | } |
duke@435 | 1063 | // |
duke@435 | 1064 | // Generate post-write barrier for array. |
duke@435 | 1065 | // |
duke@435 | 1066 | // Input: |
duke@435 | 1067 | // addr - register containing starting address |
duke@435 | 1068 | // count - register containing element count |
duke@435 | 1069 | // tmp - scratch register |
duke@435 | 1070 | // |
duke@435 | 1071 | // The input registers are overwritten. |
duke@435 | 1072 | // |
duke@435 | 1073 | void gen_write_ref_array_post_barrier(Register addr, Register count, |
iveresov@2606 | 1074 | Register tmp) { |
duke@435 | 1075 | BarrierSet* bs = Universe::heap()->barrier_set(); |
duke@435 | 1076 | |
duke@435 | 1077 | switch (bs->kind()) { |
duke@435 | 1078 | case BarrierSet::G1SATBCT: |
duke@435 | 1079 | case BarrierSet::G1SATBCTLogging: |
duke@435 | 1080 | { |
duke@435 | 1081 | // Get some new fresh output registers. |
duke@435 | 1082 | __ save_frame(0); |
ysr@777 | 1083 | __ mov(addr->after_save(), O0); |
duke@435 | 1084 | __ call(CAST_FROM_FN_PTR(address, BarrierSet::static_write_ref_array_post)); |
ysr@777 | 1085 | __ delayed()->mov(count->after_save(), O1); |
duke@435 | 1086 | __ restore(); |
duke@435 | 1087 | } |
duke@435 | 1088 | break; |
duke@435 | 1089 | case BarrierSet::CardTableModRef: |
duke@435 | 1090 | case BarrierSet::CardTableExtension: |
duke@435 | 1091 | { |
duke@435 | 1092 | CardTableModRefBS* ct = (CardTableModRefBS*)bs; |
duke@435 | 1093 | assert(sizeof(*ct->byte_map_base) == sizeof(jbyte), "adjust this code"); |
duke@435 | 1094 | assert_different_registers(addr, count, tmp); |
duke@435 | 1095 | |
duke@435 | 1096 | Label L_loop; |
duke@435 | 1097 | |
coleenp@548 | 1098 | __ sll_ptr(count, LogBytesPerHeapOop, count); |
coleenp@548 | 1099 | __ sub(count, BytesPerHeapOop, count); |
duke@435 | 1100 | __ add(count, addr, count); |
duke@435 | 1101 | // Use two shifts to clear out those low order two bits! (Cannot opt. into 1.) |
duke@435 | 1102 | __ srl_ptr(addr, CardTableModRefBS::card_shift, addr); |
duke@435 | 1103 | __ srl_ptr(count, CardTableModRefBS::card_shift, count); |
duke@435 | 1104 | __ sub(count, addr, count); |
twisti@1162 | 1105 | AddressLiteral rs(ct->byte_map_base); |
twisti@1162 | 1106 | __ set(rs, tmp); |
duke@435 | 1107 | __ BIND(L_loop); |
twisti@1162 | 1108 | __ stb(G0, tmp, addr); |
duke@435 | 1109 | __ subcc(count, 1, count); |
duke@435 | 1110 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_loop); |
duke@435 | 1111 | __ delayed()->add(addr, 1, addr); |
twisti@1162 | 1112 | } |
duke@435 | 1113 | break; |
duke@435 | 1114 | case BarrierSet::ModRef: |
duke@435 | 1115 | break; |
twisti@1162 | 1116 | default: |
duke@435 | 1117 | ShouldNotReachHere(); |
duke@435 | 1118 | } |
duke@435 | 1119 | } |
duke@435 | 1120 | |
kvn@3103 | 1121 | // |
kvn@3103 | 1122 | // Generate main code for disjoint arraycopy |
kvn@3103 | 1123 | // |
kvn@3103 | 1124 | typedef void (StubGenerator::*CopyLoopFunc)(Register from, Register to, Register count, int count_dec, |
kvn@3103 | 1125 | Label& L_loop, bool use_prefetch, bool use_bis); |
kvn@3103 | 1126 | |
kvn@3103 | 1127 | void disjoint_copy_core(Register from, Register to, Register count, int log2_elem_size, |
kvn@3103 | 1128 | int iter_size, CopyLoopFunc copy_loop_func) { |
kvn@3103 | 1129 | Label L_copy; |
kvn@3103 | 1130 | |
kvn@3103 | 1131 | assert(log2_elem_size <= 3, "the following code should be changed"); |
kvn@3103 | 1132 | int count_dec = 16>>log2_elem_size; |
kvn@3103 | 1133 | |
kvn@3103 | 1134 | int prefetch_dist = MAX2(ArraycopySrcPrefetchDistance, ArraycopyDstPrefetchDistance); |
kvn@3103 | 1135 | assert(prefetch_dist < 4096, "invalid value"); |
kvn@3103 | 1136 | prefetch_dist = (prefetch_dist + (iter_size-1)) & (-iter_size); // round up to one iteration copy size |
kvn@3103 | 1137 | int prefetch_count = (prefetch_dist >> log2_elem_size); // elements count |
kvn@3103 | 1138 | |
kvn@3103 | 1139 | if (UseBlockCopy) { |
kvn@3103 | 1140 | Label L_block_copy, L_block_copy_prefetch, L_skip_block_copy; |
kvn@3103 | 1141 | |
kvn@3103 | 1142 | // 64 bytes tail + bytes copied in one loop iteration |
kvn@3103 | 1143 | int tail_size = 64 + iter_size; |
kvn@3103 | 1144 | int block_copy_count = (MAX2(tail_size, (int)BlockCopyLowLimit)) >> log2_elem_size; |
kvn@3103 | 1145 | // Use BIS copy only for big arrays since it requires membar. |
kvn@3103 | 1146 | __ set(block_copy_count, O4); |
kvn@3103 | 1147 | __ cmp_and_br_short(count, O4, Assembler::lessUnsigned, Assembler::pt, L_skip_block_copy); |
kvn@3103 | 1148 | // This code is for disjoint source and destination: |
kvn@3103 | 1149 | // to <= from || to >= from+count |
kvn@3103 | 1150 | // but BIS will stomp over 'from' if (to > from-tail_size && to <= from) |
kvn@3103 | 1151 | __ sub(from, to, O4); |
kvn@3103 | 1152 | __ srax(O4, 4, O4); // divide by 16 since following short branch have only 5 bits for imm. |
kvn@3103 | 1153 | __ cmp_and_br_short(O4, (tail_size>>4), Assembler::lessEqualUnsigned, Assembler::pn, L_skip_block_copy); |
kvn@3103 | 1154 | |
kvn@3103 | 1155 | __ wrasi(G0, Assembler::ASI_ST_BLKINIT_PRIMARY); |
kvn@3103 | 1156 | // BIS should not be used to copy tail (64 bytes+iter_size) |
kvn@3103 | 1157 | // to avoid zeroing of following values. |
kvn@3103 | 1158 | __ sub(count, (tail_size>>log2_elem_size), count); // count is still positive >= 0 |
kvn@3103 | 1159 | |
kvn@3103 | 1160 | if (prefetch_count > 0) { // rounded up to one iteration count |
kvn@3103 | 1161 | // Do prefetching only if copy size is bigger |
kvn@3103 | 1162 | // than prefetch distance. |
kvn@3103 | 1163 | __ set(prefetch_count, O4); |
kvn@3103 | 1164 | __ cmp_and_brx_short(count, O4, Assembler::less, Assembler::pt, L_block_copy); |
kvn@3103 | 1165 | __ sub(count, prefetch_count, count); |
kvn@3103 | 1166 | |
kvn@3103 | 1167 | (this->*copy_loop_func)(from, to, count, count_dec, L_block_copy_prefetch, true, true); |
kvn@3103 | 1168 | __ add(count, prefetch_count, count); // restore count |
kvn@3103 | 1169 | |
kvn@3103 | 1170 | } // prefetch_count > 0 |
kvn@3103 | 1171 | |
kvn@3103 | 1172 | (this->*copy_loop_func)(from, to, count, count_dec, L_block_copy, false, true); |
kvn@3103 | 1173 | __ add(count, (tail_size>>log2_elem_size), count); // restore count |
kvn@3103 | 1174 | |
kvn@3103 | 1175 | __ wrasi(G0, Assembler::ASI_PRIMARY_NOFAULT); |
kvn@3103 | 1176 | // BIS needs membar. |
kvn@3103 | 1177 | __ membar(Assembler::StoreLoad); |
kvn@3103 | 1178 | // Copy tail |
kvn@3103 | 1179 | __ ba_short(L_copy); |
kvn@3103 | 1180 | |
kvn@3103 | 1181 | __ BIND(L_skip_block_copy); |
kvn@3103 | 1182 | } // UseBlockCopy |
kvn@3103 | 1183 | |
kvn@3103 | 1184 | if (prefetch_count > 0) { // rounded up to one iteration count |
kvn@3103 | 1185 | // Do prefetching only if copy size is bigger |
kvn@3103 | 1186 | // than prefetch distance. |
kvn@3103 | 1187 | __ set(prefetch_count, O4); |
kvn@3103 | 1188 | __ cmp_and_brx_short(count, O4, Assembler::lessUnsigned, Assembler::pt, L_copy); |
kvn@3103 | 1189 | __ sub(count, prefetch_count, count); |
kvn@3103 | 1190 | |
kvn@3103 | 1191 | Label L_copy_prefetch; |
kvn@3103 | 1192 | (this->*copy_loop_func)(from, to, count, count_dec, L_copy_prefetch, true, false); |
kvn@3103 | 1193 | __ add(count, prefetch_count, count); // restore count |
kvn@3103 | 1194 | |
kvn@3103 | 1195 | } // prefetch_count > 0 |
kvn@3103 | 1196 | |
kvn@3103 | 1197 | (this->*copy_loop_func)(from, to, count, count_dec, L_copy, false, false); |
kvn@3103 | 1198 | } |
kvn@3103 | 1199 | |
kvn@3103 | 1200 | |
kvn@3103 | 1201 | |
kvn@3103 | 1202 | // |
kvn@3103 | 1203 | // Helper methods for copy_16_bytes_forward_with_shift() |
kvn@3103 | 1204 | // |
kvn@3103 | 1205 | void copy_16_bytes_shift_loop(Register from, Register to, Register count, int count_dec, |
kvn@3103 | 1206 | Label& L_loop, bool use_prefetch, bool use_bis) { |
kvn@3103 | 1207 | |
kvn@3103 | 1208 | const Register left_shift = G1; // left shift bit counter |
kvn@3103 | 1209 | const Register right_shift = G5; // right shift bit counter |
kvn@3103 | 1210 | |
kvn@3103 | 1211 | __ align(OptoLoopAlignment); |
kvn@3103 | 1212 | __ BIND(L_loop); |
kvn@3103 | 1213 | if (use_prefetch) { |
kvn@3103 | 1214 | if (ArraycopySrcPrefetchDistance > 0) { |
kvn@3103 | 1215 | __ prefetch(from, ArraycopySrcPrefetchDistance, Assembler::severalReads); |
kvn@3103 | 1216 | } |
kvn@3103 | 1217 | if (ArraycopyDstPrefetchDistance > 0) { |
kvn@3103 | 1218 | __ prefetch(to, ArraycopyDstPrefetchDistance, Assembler::severalWritesAndPossiblyReads); |
kvn@3103 | 1219 | } |
kvn@3103 | 1220 | } |
kvn@3103 | 1221 | __ ldx(from, 0, O4); |
kvn@3103 | 1222 | __ ldx(from, 8, G4); |
kvn@3103 | 1223 | __ inc(to, 16); |
kvn@3103 | 1224 | __ inc(from, 16); |
kvn@3103 | 1225 | __ deccc(count, count_dec); // Can we do next iteration after this one? |
kvn@3103 | 1226 | __ srlx(O4, right_shift, G3); |
kvn@3103 | 1227 | __ bset(G3, O3); |
kvn@3103 | 1228 | __ sllx(O4, left_shift, O4); |
kvn@3103 | 1229 | __ srlx(G4, right_shift, G3); |
kvn@3103 | 1230 | __ bset(G3, O4); |
kvn@3103 | 1231 | if (use_bis) { |
kvn@3103 | 1232 | __ stxa(O3, to, -16); |
kvn@3103 | 1233 | __ stxa(O4, to, -8); |
kvn@3103 | 1234 | } else { |
kvn@3103 | 1235 | __ stx(O3, to, -16); |
kvn@3103 | 1236 | __ stx(O4, to, -8); |
kvn@3103 | 1237 | } |
kvn@3103 | 1238 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_loop); |
kvn@3103 | 1239 | __ delayed()->sllx(G4, left_shift, O3); |
kvn@3103 | 1240 | } |
duke@435 | 1241 | |
duke@435 | 1242 | // Copy big chunks forward with shift |
duke@435 | 1243 | // |
duke@435 | 1244 | // Inputs: |
duke@435 | 1245 | // from - source arrays |
duke@435 | 1246 | // to - destination array aligned to 8-bytes |
duke@435 | 1247 | // count - elements count to copy >= the count equivalent to 16 bytes |
duke@435 | 1248 | // count_dec - elements count's decrement equivalent to 16 bytes |
duke@435 | 1249 | // L_copy_bytes - copy exit label |
duke@435 | 1250 | // |
duke@435 | 1251 | void copy_16_bytes_forward_with_shift(Register from, Register to, |
kvn@3103 | 1252 | Register count, int log2_elem_size, Label& L_copy_bytes) { |
kvn@3103 | 1253 | Label L_aligned_copy, L_copy_last_bytes; |
kvn@3103 | 1254 | assert(log2_elem_size <= 3, "the following code should be changed"); |
kvn@3103 | 1255 | int count_dec = 16>>log2_elem_size; |
duke@435 | 1256 | |
duke@435 | 1257 | // if both arrays have the same alignment mod 8, do 8 bytes aligned copy |
kvn@3103 | 1258 | __ andcc(from, 7, G1); // misaligned bytes |
kvn@3103 | 1259 | __ br(Assembler::zero, false, Assembler::pt, L_aligned_copy); |
kvn@3103 | 1260 | __ delayed()->nop(); |
duke@435 | 1261 | |
duke@435 | 1262 | const Register left_shift = G1; // left shift bit counter |
duke@435 | 1263 | const Register right_shift = G5; // right shift bit counter |
duke@435 | 1264 | |
kvn@3103 | 1265 | __ sll(G1, LogBitsPerByte, left_shift); |
kvn@3103 | 1266 | __ mov(64, right_shift); |
kvn@3103 | 1267 | __ sub(right_shift, left_shift, right_shift); |
duke@435 | 1268 | |
duke@435 | 1269 | // |
duke@435 | 1270 | // Load 2 aligned 8-bytes chunks and use one from previous iteration |
duke@435 | 1271 | // to form 2 aligned 8-bytes chunks to store. |
duke@435 | 1272 | // |
kvn@3103 | 1273 | __ dec(count, count_dec); // Pre-decrement 'count' |
kvn@3103 | 1274 | __ andn(from, 7, from); // Align address |
kvn@3103 | 1275 | __ ldx(from, 0, O3); |
kvn@3103 | 1276 | __ inc(from, 8); |
kvn@3103 | 1277 | __ sllx(O3, left_shift, O3); |
kvn@3103 | 1278 | |
kvn@3103 | 1279 | disjoint_copy_core(from, to, count, log2_elem_size, 16, copy_16_bytes_shift_loop); |
kvn@3103 | 1280 | |
kvn@3103 | 1281 | __ inccc(count, count_dec>>1 ); // + 8 bytes |
kvn@3103 | 1282 | __ brx(Assembler::negative, true, Assembler::pn, L_copy_last_bytes); |
kvn@3103 | 1283 | __ delayed()->inc(count, count_dec>>1); // restore 'count' |
kvn@3103 | 1284 | |
kvn@3103 | 1285 | // copy 8 bytes, part of them already loaded in O3 |
kvn@3103 | 1286 | __ ldx(from, 0, O4); |
kvn@3103 | 1287 | __ inc(to, 8); |
kvn@3103 | 1288 | __ inc(from, 8); |
kvn@3103 | 1289 | __ srlx(O4, right_shift, G3); |
kvn@3103 | 1290 | __ bset(O3, G3); |
kvn@3103 | 1291 | __ stx(G3, to, -8); |
duke@435 | 1292 | |
duke@435 | 1293 | __ BIND(L_copy_last_bytes); |
kvn@3103 | 1294 | __ srl(right_shift, LogBitsPerByte, right_shift); // misaligned bytes |
kvn@3103 | 1295 | __ br(Assembler::always, false, Assembler::pt, L_copy_bytes); |
kvn@3103 | 1296 | __ delayed()->sub(from, right_shift, from); // restore address |
duke@435 | 1297 | |
duke@435 | 1298 | __ BIND(L_aligned_copy); |
duke@435 | 1299 | } |
duke@435 | 1300 | |
duke@435 | 1301 | // Copy big chunks backward with shift |
duke@435 | 1302 | // |
duke@435 | 1303 | // Inputs: |
duke@435 | 1304 | // end_from - source arrays end address |
duke@435 | 1305 | // end_to - destination array end address aligned to 8-bytes |
duke@435 | 1306 | // count - elements count to copy >= the count equivalent to 16 bytes |
duke@435 | 1307 | // count_dec - elements count's decrement equivalent to 16 bytes |
duke@435 | 1308 | // L_aligned_copy - aligned copy exit label |
duke@435 | 1309 | // L_copy_bytes - copy exit label |
duke@435 | 1310 | // |
duke@435 | 1311 | void copy_16_bytes_backward_with_shift(Register end_from, Register end_to, |
duke@435 | 1312 | Register count, int count_dec, |
duke@435 | 1313 | Label& L_aligned_copy, Label& L_copy_bytes) { |
duke@435 | 1314 | Label L_loop, L_copy_last_bytes; |
duke@435 | 1315 | |
duke@435 | 1316 | // if both arrays have the same alignment mod 8, do 8 bytes aligned copy |
duke@435 | 1317 | __ andcc(end_from, 7, G1); // misaligned bytes |
duke@435 | 1318 | __ br(Assembler::zero, false, Assembler::pt, L_aligned_copy); |
duke@435 | 1319 | __ delayed()->deccc(count, count_dec); // Pre-decrement 'count' |
duke@435 | 1320 | |
duke@435 | 1321 | const Register left_shift = G1; // left shift bit counter |
duke@435 | 1322 | const Register right_shift = G5; // right shift bit counter |
duke@435 | 1323 | |
duke@435 | 1324 | __ sll(G1, LogBitsPerByte, left_shift); |
duke@435 | 1325 | __ mov(64, right_shift); |
duke@435 | 1326 | __ sub(right_shift, left_shift, right_shift); |
duke@435 | 1327 | |
duke@435 | 1328 | // |
duke@435 | 1329 | // Load 2 aligned 8-bytes chunks and use one from previous iteration |
duke@435 | 1330 | // to form 2 aligned 8-bytes chunks to store. |
duke@435 | 1331 | // |
duke@435 | 1332 | __ andn(end_from, 7, end_from); // Align address |
duke@435 | 1333 | __ ldx(end_from, 0, O3); |
kvn@1800 | 1334 | __ align(OptoLoopAlignment); |
duke@435 | 1335 | __ BIND(L_loop); |
duke@435 | 1336 | __ ldx(end_from, -8, O4); |
duke@435 | 1337 | __ deccc(count, count_dec); // Can we do next iteration after this one? |
duke@435 | 1338 | __ ldx(end_from, -16, G4); |
duke@435 | 1339 | __ dec(end_to, 16); |
duke@435 | 1340 | __ dec(end_from, 16); |
duke@435 | 1341 | __ srlx(O3, right_shift, O3); |
duke@435 | 1342 | __ sllx(O4, left_shift, G3); |
duke@435 | 1343 | __ bset(G3, O3); |
duke@435 | 1344 | __ stx(O3, end_to, 8); |
duke@435 | 1345 | __ srlx(O4, right_shift, O4); |
duke@435 | 1346 | __ sllx(G4, left_shift, G3); |
duke@435 | 1347 | __ bset(G3, O4); |
duke@435 | 1348 | __ stx(O4, end_to, 0); |
duke@435 | 1349 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_loop); |
duke@435 | 1350 | __ delayed()->mov(G4, O3); |
duke@435 | 1351 | |
duke@435 | 1352 | __ inccc(count, count_dec>>1 ); // + 8 bytes |
duke@435 | 1353 | __ brx(Assembler::negative, true, Assembler::pn, L_copy_last_bytes); |
duke@435 | 1354 | __ delayed()->inc(count, count_dec>>1); // restore 'count' |
duke@435 | 1355 | |
duke@435 | 1356 | // copy 8 bytes, part of them already loaded in O3 |
duke@435 | 1357 | __ ldx(end_from, -8, O4); |
duke@435 | 1358 | __ dec(end_to, 8); |
duke@435 | 1359 | __ dec(end_from, 8); |
duke@435 | 1360 | __ srlx(O3, right_shift, O3); |
duke@435 | 1361 | __ sllx(O4, left_shift, G3); |
duke@435 | 1362 | __ bset(O3, G3); |
duke@435 | 1363 | __ stx(G3, end_to, 0); |
duke@435 | 1364 | |
duke@435 | 1365 | __ BIND(L_copy_last_bytes); |
duke@435 | 1366 | __ srl(left_shift, LogBitsPerByte, left_shift); // misaligned bytes |
duke@435 | 1367 | __ br(Assembler::always, false, Assembler::pt, L_copy_bytes); |
duke@435 | 1368 | __ delayed()->add(end_from, left_shift, end_from); // restore address |
duke@435 | 1369 | } |
duke@435 | 1370 | |
duke@435 | 1371 | // |
duke@435 | 1372 | // Generate stub for disjoint byte copy. If "aligned" is true, the |
duke@435 | 1373 | // "from" and "to" addresses are assumed to be heapword aligned. |
duke@435 | 1374 | // |
duke@435 | 1375 | // Arguments for generated stub: |
duke@435 | 1376 | // from: O0 |
duke@435 | 1377 | // to: O1 |
duke@435 | 1378 | // count: O2 treated as signed |
duke@435 | 1379 | // |
iveresov@2595 | 1380 | address generate_disjoint_byte_copy(bool aligned, address *entry, const char *name) { |
duke@435 | 1381 | __ align(CodeEntryAlignment); |
duke@435 | 1382 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 1383 | address start = __ pc(); |
duke@435 | 1384 | |
duke@435 | 1385 | Label L_skip_alignment, L_align; |
duke@435 | 1386 | Label L_copy_byte, L_copy_byte_loop, L_exit; |
duke@435 | 1387 | |
duke@435 | 1388 | const Register from = O0; // source array address |
duke@435 | 1389 | const Register to = O1; // destination array address |
duke@435 | 1390 | const Register count = O2; // elements count |
duke@435 | 1391 | const Register offset = O5; // offset from start of arrays |
duke@435 | 1392 | // O3, O4, G3, G4 are used as temp registers |
duke@435 | 1393 | |
duke@435 | 1394 | assert_clean_int(count, O3); // Make sure 'count' is clean int. |
duke@435 | 1395 | |
iveresov@2595 | 1396 | if (entry != NULL) { |
iveresov@2595 | 1397 | *entry = __ pc(); |
iveresov@2595 | 1398 | // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) |
iveresov@2595 | 1399 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 1400 | } |
duke@435 | 1401 | |
duke@435 | 1402 | // for short arrays, just do single element copy |
duke@435 | 1403 | __ cmp(count, 23); // 16 + 7 |
duke@435 | 1404 | __ brx(Assembler::less, false, Assembler::pn, L_copy_byte); |
duke@435 | 1405 | __ delayed()->mov(G0, offset); |
duke@435 | 1406 | |
duke@435 | 1407 | if (aligned) { |
duke@435 | 1408 | // 'aligned' == true when it is known statically during compilation |
duke@435 | 1409 | // of this arraycopy call site that both 'from' and 'to' addresses |
duke@435 | 1410 | // are HeapWordSize aligned (see LibraryCallKit::basictype2arraycopy()). |
duke@435 | 1411 | // |
duke@435 | 1412 | // Aligned arrays have 4 bytes alignment in 32-bits VM |
duke@435 | 1413 | // and 8 bytes - in 64-bits VM. So we do it only for 32-bits VM |
duke@435 | 1414 | // |
duke@435 | 1415 | #ifndef _LP64 |
duke@435 | 1416 | // copy a 4-bytes word if necessary to align 'to' to 8 bytes |
duke@435 | 1417 | __ andcc(to, 7, G0); |
duke@435 | 1418 | __ br(Assembler::zero, false, Assembler::pn, L_skip_alignment); |
duke@435 | 1419 | __ delayed()->ld(from, 0, O3); |
duke@435 | 1420 | __ inc(from, 4); |
duke@435 | 1421 | __ inc(to, 4); |
duke@435 | 1422 | __ dec(count, 4); |
duke@435 | 1423 | __ st(O3, to, -4); |
duke@435 | 1424 | __ BIND(L_skip_alignment); |
duke@435 | 1425 | #endif |
duke@435 | 1426 | } else { |
duke@435 | 1427 | // copy bytes to align 'to' on 8 byte boundary |
duke@435 | 1428 | __ andcc(to, 7, G1); // misaligned bytes |
duke@435 | 1429 | __ br(Assembler::zero, false, Assembler::pt, L_skip_alignment); |
duke@435 | 1430 | __ delayed()->neg(G1); |
duke@435 | 1431 | __ inc(G1, 8); // bytes need to copy to next 8-bytes alignment |
duke@435 | 1432 | __ sub(count, G1, count); |
duke@435 | 1433 | __ BIND(L_align); |
duke@435 | 1434 | __ ldub(from, 0, O3); |
duke@435 | 1435 | __ deccc(G1); |
duke@435 | 1436 | __ inc(from); |
duke@435 | 1437 | __ stb(O3, to, 0); |
duke@435 | 1438 | __ br(Assembler::notZero, false, Assembler::pt, L_align); |
duke@435 | 1439 | __ delayed()->inc(to); |
duke@435 | 1440 | __ BIND(L_skip_alignment); |
duke@435 | 1441 | } |
duke@435 | 1442 | #ifdef _LP64 |
duke@435 | 1443 | if (!aligned) |
duke@435 | 1444 | #endif |
duke@435 | 1445 | { |
duke@435 | 1446 | // Copy with shift 16 bytes per iteration if arrays do not have |
duke@435 | 1447 | // the same alignment mod 8, otherwise fall through to the next |
duke@435 | 1448 | // code for aligned copy. |
duke@435 | 1449 | // The compare above (count >= 23) guarantes 'count' >= 16 bytes. |
duke@435 | 1450 | // Also jump over aligned copy after the copy with shift completed. |
duke@435 | 1451 | |
kvn@3103 | 1452 | copy_16_bytes_forward_with_shift(from, to, count, 0, L_copy_byte); |
duke@435 | 1453 | } |
duke@435 | 1454 | |
duke@435 | 1455 | // Both array are 8 bytes aligned, copy 16 bytes at a time |
duke@435 | 1456 | __ and3(count, 7, G4); // Save count |
duke@435 | 1457 | __ srl(count, 3, count); |
duke@435 | 1458 | generate_disjoint_long_copy_core(aligned); |
duke@435 | 1459 | __ mov(G4, count); // Restore count |
duke@435 | 1460 | |
duke@435 | 1461 | // copy tailing bytes |
duke@435 | 1462 | __ BIND(L_copy_byte); |
kvn@3037 | 1463 | __ cmp_and_br_short(count, 0, Assembler::equal, Assembler::pt, L_exit); |
kvn@1800 | 1464 | __ align(OptoLoopAlignment); |
duke@435 | 1465 | __ BIND(L_copy_byte_loop); |
duke@435 | 1466 | __ ldub(from, offset, O3); |
duke@435 | 1467 | __ deccc(count); |
duke@435 | 1468 | __ stb(O3, to, offset); |
duke@435 | 1469 | __ brx(Assembler::notZero, false, Assembler::pt, L_copy_byte_loop); |
duke@435 | 1470 | __ delayed()->inc(offset); |
duke@435 | 1471 | |
duke@435 | 1472 | __ BIND(L_exit); |
duke@435 | 1473 | // O3, O4 are used as temp registers |
duke@435 | 1474 | inc_counter_np(SharedRuntime::_jbyte_array_copy_ctr, O3, O4); |
duke@435 | 1475 | __ retl(); |
duke@435 | 1476 | __ delayed()->mov(G0, O0); // return 0 |
duke@435 | 1477 | return start; |
duke@435 | 1478 | } |
duke@435 | 1479 | |
duke@435 | 1480 | // |
duke@435 | 1481 | // Generate stub for conjoint byte copy. If "aligned" is true, the |
duke@435 | 1482 | // "from" and "to" addresses are assumed to be heapword aligned. |
duke@435 | 1483 | // |
duke@435 | 1484 | // Arguments for generated stub: |
duke@435 | 1485 | // from: O0 |
duke@435 | 1486 | // to: O1 |
duke@435 | 1487 | // count: O2 treated as signed |
duke@435 | 1488 | // |
iveresov@2595 | 1489 | address generate_conjoint_byte_copy(bool aligned, address nooverlap_target, |
iveresov@2595 | 1490 | address *entry, const char *name) { |
duke@435 | 1491 | // Do reverse copy. |
duke@435 | 1492 | |
duke@435 | 1493 | __ align(CodeEntryAlignment); |
duke@435 | 1494 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 1495 | address start = __ pc(); |
duke@435 | 1496 | |
duke@435 | 1497 | Label L_skip_alignment, L_align, L_aligned_copy; |
duke@435 | 1498 | Label L_copy_byte, L_copy_byte_loop, L_exit; |
duke@435 | 1499 | |
duke@435 | 1500 | const Register from = O0; // source array address |
duke@435 | 1501 | const Register to = O1; // destination array address |
duke@435 | 1502 | const Register count = O2; // elements count |
duke@435 | 1503 | const Register end_from = from; // source array end address |
duke@435 | 1504 | const Register end_to = to; // destination array end address |
duke@435 | 1505 | |
duke@435 | 1506 | assert_clean_int(count, O3); // Make sure 'count' is clean int. |
duke@435 | 1507 | |
iveresov@2595 | 1508 | if (entry != NULL) { |
iveresov@2595 | 1509 | *entry = __ pc(); |
iveresov@2595 | 1510 | // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) |
iveresov@2595 | 1511 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 1512 | } |
duke@435 | 1513 | |
duke@435 | 1514 | array_overlap_test(nooverlap_target, 0); |
duke@435 | 1515 | |
duke@435 | 1516 | __ add(to, count, end_to); // offset after last copied element |
duke@435 | 1517 | |
duke@435 | 1518 | // for short arrays, just do single element copy |
duke@435 | 1519 | __ cmp(count, 23); // 16 + 7 |
duke@435 | 1520 | __ brx(Assembler::less, false, Assembler::pn, L_copy_byte); |
duke@435 | 1521 | __ delayed()->add(from, count, end_from); |
duke@435 | 1522 | |
duke@435 | 1523 | { |
duke@435 | 1524 | // Align end of arrays since they could be not aligned even |
duke@435 | 1525 | // when arrays itself are aligned. |
duke@435 | 1526 | |
duke@435 | 1527 | // copy bytes to align 'end_to' on 8 byte boundary |
duke@435 | 1528 | __ andcc(end_to, 7, G1); // misaligned bytes |
duke@435 | 1529 | __ br(Assembler::zero, false, Assembler::pt, L_skip_alignment); |
duke@435 | 1530 | __ delayed()->nop(); |
duke@435 | 1531 | __ sub(count, G1, count); |
duke@435 | 1532 | __ BIND(L_align); |
duke@435 | 1533 | __ dec(end_from); |
duke@435 | 1534 | __ dec(end_to); |
duke@435 | 1535 | __ ldub(end_from, 0, O3); |
duke@435 | 1536 | __ deccc(G1); |
duke@435 | 1537 | __ brx(Assembler::notZero, false, Assembler::pt, L_align); |
duke@435 | 1538 | __ delayed()->stb(O3, end_to, 0); |
duke@435 | 1539 | __ BIND(L_skip_alignment); |
duke@435 | 1540 | } |
duke@435 | 1541 | #ifdef _LP64 |
duke@435 | 1542 | if (aligned) { |
duke@435 | 1543 | // Both arrays are aligned to 8-bytes in 64-bits VM. |
duke@435 | 1544 | // The 'count' is decremented in copy_16_bytes_backward_with_shift() |
duke@435 | 1545 | // in unaligned case. |
duke@435 | 1546 | __ dec(count, 16); |
duke@435 | 1547 | } else |
duke@435 | 1548 | #endif |
duke@435 | 1549 | { |
duke@435 | 1550 | // Copy with shift 16 bytes per iteration if arrays do not have |
duke@435 | 1551 | // the same alignment mod 8, otherwise jump to the next |
duke@435 | 1552 | // code for aligned copy (and substracting 16 from 'count' before jump). |
duke@435 | 1553 | // The compare above (count >= 11) guarantes 'count' >= 16 bytes. |
duke@435 | 1554 | // Also jump over aligned copy after the copy with shift completed. |
duke@435 | 1555 | |
duke@435 | 1556 | copy_16_bytes_backward_with_shift(end_from, end_to, count, 16, |
duke@435 | 1557 | L_aligned_copy, L_copy_byte); |
duke@435 | 1558 | } |
duke@435 | 1559 | // copy 4 elements (16 bytes) at a time |
kvn@1800 | 1560 | __ align(OptoLoopAlignment); |
duke@435 | 1561 | __ BIND(L_aligned_copy); |
duke@435 | 1562 | __ dec(end_from, 16); |
duke@435 | 1563 | __ ldx(end_from, 8, O3); |
duke@435 | 1564 | __ ldx(end_from, 0, O4); |
duke@435 | 1565 | __ dec(end_to, 16); |
duke@435 | 1566 | __ deccc(count, 16); |
duke@435 | 1567 | __ stx(O3, end_to, 8); |
duke@435 | 1568 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_aligned_copy); |
duke@435 | 1569 | __ delayed()->stx(O4, end_to, 0); |
duke@435 | 1570 | __ inc(count, 16); |
duke@435 | 1571 | |
duke@435 | 1572 | // copy 1 element (2 bytes) at a time |
duke@435 | 1573 | __ BIND(L_copy_byte); |
kvn@3037 | 1574 | __ cmp_and_br_short(count, 0, Assembler::equal, Assembler::pt, L_exit); |
kvn@1800 | 1575 | __ align(OptoLoopAlignment); |
duke@435 | 1576 | __ BIND(L_copy_byte_loop); |
duke@435 | 1577 | __ dec(end_from); |
duke@435 | 1578 | __ dec(end_to); |
duke@435 | 1579 | __ ldub(end_from, 0, O4); |
duke@435 | 1580 | __ deccc(count); |
duke@435 | 1581 | __ brx(Assembler::greater, false, Assembler::pt, L_copy_byte_loop); |
duke@435 | 1582 | __ delayed()->stb(O4, end_to, 0); |
duke@435 | 1583 | |
duke@435 | 1584 | __ BIND(L_exit); |
duke@435 | 1585 | // O3, O4 are used as temp registers |
duke@435 | 1586 | inc_counter_np(SharedRuntime::_jbyte_array_copy_ctr, O3, O4); |
duke@435 | 1587 | __ retl(); |
duke@435 | 1588 | __ delayed()->mov(G0, O0); // return 0 |
duke@435 | 1589 | return start; |
duke@435 | 1590 | } |
duke@435 | 1591 | |
duke@435 | 1592 | // |
duke@435 | 1593 | // Generate stub for disjoint short copy. If "aligned" is true, the |
duke@435 | 1594 | // "from" and "to" addresses are assumed to be heapword aligned. |
duke@435 | 1595 | // |
duke@435 | 1596 | // Arguments for generated stub: |
duke@435 | 1597 | // from: O0 |
duke@435 | 1598 | // to: O1 |
duke@435 | 1599 | // count: O2 treated as signed |
duke@435 | 1600 | // |
iveresov@2595 | 1601 | address generate_disjoint_short_copy(bool aligned, address *entry, const char * name) { |
duke@435 | 1602 | __ align(CodeEntryAlignment); |
duke@435 | 1603 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 1604 | address start = __ pc(); |
duke@435 | 1605 | |
duke@435 | 1606 | Label L_skip_alignment, L_skip_alignment2; |
duke@435 | 1607 | Label L_copy_2_bytes, L_copy_2_bytes_loop, L_exit; |
duke@435 | 1608 | |
duke@435 | 1609 | const Register from = O0; // source array address |
duke@435 | 1610 | const Register to = O1; // destination array address |
duke@435 | 1611 | const Register count = O2; // elements count |
duke@435 | 1612 | const Register offset = O5; // offset from start of arrays |
duke@435 | 1613 | // O3, O4, G3, G4 are used as temp registers |
duke@435 | 1614 | |
duke@435 | 1615 | assert_clean_int(count, O3); // Make sure 'count' is clean int. |
duke@435 | 1616 | |
iveresov@2595 | 1617 | if (entry != NULL) { |
iveresov@2595 | 1618 | *entry = __ pc(); |
iveresov@2595 | 1619 | // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) |
iveresov@2595 | 1620 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 1621 | } |
duke@435 | 1622 | |
duke@435 | 1623 | // for short arrays, just do single element copy |
duke@435 | 1624 | __ cmp(count, 11); // 8 + 3 (22 bytes) |
duke@435 | 1625 | __ brx(Assembler::less, false, Assembler::pn, L_copy_2_bytes); |
duke@435 | 1626 | __ delayed()->mov(G0, offset); |
duke@435 | 1627 | |
duke@435 | 1628 | if (aligned) { |
duke@435 | 1629 | // 'aligned' == true when it is known statically during compilation |
duke@435 | 1630 | // of this arraycopy call site that both 'from' and 'to' addresses |
duke@435 | 1631 | // are HeapWordSize aligned (see LibraryCallKit::basictype2arraycopy()). |
duke@435 | 1632 | // |
duke@435 | 1633 | // Aligned arrays have 4 bytes alignment in 32-bits VM |
duke@435 | 1634 | // and 8 bytes - in 64-bits VM. |
duke@435 | 1635 | // |
duke@435 | 1636 | #ifndef _LP64 |
duke@435 | 1637 | // copy a 2-elements word if necessary to align 'to' to 8 bytes |
duke@435 | 1638 | __ andcc(to, 7, G0); |
duke@435 | 1639 | __ br(Assembler::zero, false, Assembler::pt, L_skip_alignment); |
duke@435 | 1640 | __ delayed()->ld(from, 0, O3); |
duke@435 | 1641 | __ inc(from, 4); |
duke@435 | 1642 | __ inc(to, 4); |
duke@435 | 1643 | __ dec(count, 2); |
duke@435 | 1644 | __ st(O3, to, -4); |
duke@435 | 1645 | __ BIND(L_skip_alignment); |
duke@435 | 1646 | #endif |
duke@435 | 1647 | } else { |
duke@435 | 1648 | // copy 1 element if necessary to align 'to' on an 4 bytes |
duke@435 | 1649 | __ andcc(to, 3, G0); |
duke@435 | 1650 | __ br(Assembler::zero, false, Assembler::pt, L_skip_alignment); |
duke@435 | 1651 | __ delayed()->lduh(from, 0, O3); |
duke@435 | 1652 | __ inc(from, 2); |
duke@435 | 1653 | __ inc(to, 2); |
duke@435 | 1654 | __ dec(count); |
duke@435 | 1655 | __ sth(O3, to, -2); |
duke@435 | 1656 | __ BIND(L_skip_alignment); |
duke@435 | 1657 | |
duke@435 | 1658 | // copy 2 elements to align 'to' on an 8 byte boundary |
duke@435 | 1659 | __ andcc(to, 7, G0); |
duke@435 | 1660 | __ br(Assembler::zero, false, Assembler::pn, L_skip_alignment2); |
duke@435 | 1661 | __ delayed()->lduh(from, 0, O3); |
duke@435 | 1662 | __ dec(count, 2); |
duke@435 | 1663 | __ lduh(from, 2, O4); |
duke@435 | 1664 | __ inc(from, 4); |
duke@435 | 1665 | __ inc(to, 4); |
duke@435 | 1666 | __ sth(O3, to, -4); |
duke@435 | 1667 | __ sth(O4, to, -2); |
duke@435 | 1668 | __ BIND(L_skip_alignment2); |
duke@435 | 1669 | } |
duke@435 | 1670 | #ifdef _LP64 |
duke@435 | 1671 | if (!aligned) |
duke@435 | 1672 | #endif |
duke@435 | 1673 | { |
duke@435 | 1674 | // Copy with shift 16 bytes per iteration if arrays do not have |
duke@435 | 1675 | // the same alignment mod 8, otherwise fall through to the next |
duke@435 | 1676 | // code for aligned copy. |
duke@435 | 1677 | // The compare above (count >= 11) guarantes 'count' >= 16 bytes. |
duke@435 | 1678 | // Also jump over aligned copy after the copy with shift completed. |
duke@435 | 1679 | |
kvn@3103 | 1680 | copy_16_bytes_forward_with_shift(from, to, count, 1, L_copy_2_bytes); |
duke@435 | 1681 | } |
duke@435 | 1682 | |
duke@435 | 1683 | // Both array are 8 bytes aligned, copy 16 bytes at a time |
duke@435 | 1684 | __ and3(count, 3, G4); // Save |
duke@435 | 1685 | __ srl(count, 2, count); |
duke@435 | 1686 | generate_disjoint_long_copy_core(aligned); |
duke@435 | 1687 | __ mov(G4, count); // restore |
duke@435 | 1688 | |
duke@435 | 1689 | // copy 1 element at a time |
duke@435 | 1690 | __ BIND(L_copy_2_bytes); |
kvn@3037 | 1691 | __ cmp_and_br_short(count, 0, Assembler::equal, Assembler::pt, L_exit); |
kvn@1800 | 1692 | __ align(OptoLoopAlignment); |
duke@435 | 1693 | __ BIND(L_copy_2_bytes_loop); |
duke@435 | 1694 | __ lduh(from, offset, O3); |
duke@435 | 1695 | __ deccc(count); |
duke@435 | 1696 | __ sth(O3, to, offset); |
duke@435 | 1697 | __ brx(Assembler::notZero, false, Assembler::pt, L_copy_2_bytes_loop); |
duke@435 | 1698 | __ delayed()->inc(offset, 2); |
duke@435 | 1699 | |
duke@435 | 1700 | __ BIND(L_exit); |
duke@435 | 1701 | // O3, O4 are used as temp registers |
duke@435 | 1702 | inc_counter_np(SharedRuntime::_jshort_array_copy_ctr, O3, O4); |
duke@435 | 1703 | __ retl(); |
duke@435 | 1704 | __ delayed()->mov(G0, O0); // return 0 |
duke@435 | 1705 | return start; |
duke@435 | 1706 | } |
duke@435 | 1707 | |
duke@435 | 1708 | // |
never@2118 | 1709 | // Generate stub for disjoint short fill. If "aligned" is true, the |
never@2118 | 1710 | // "to" address is assumed to be heapword aligned. |
never@2118 | 1711 | // |
never@2118 | 1712 | // Arguments for generated stub: |
never@2118 | 1713 | // to: O0 |
never@2118 | 1714 | // value: O1 |
never@2118 | 1715 | // count: O2 treated as signed |
never@2118 | 1716 | // |
never@2118 | 1717 | address generate_fill(BasicType t, bool aligned, const char* name) { |
never@2118 | 1718 | __ align(CodeEntryAlignment); |
never@2118 | 1719 | StubCodeMark mark(this, "StubRoutines", name); |
never@2118 | 1720 | address start = __ pc(); |
never@2118 | 1721 | |
never@2118 | 1722 | const Register to = O0; // source array address |
never@2118 | 1723 | const Register value = O1; // fill value |
never@2118 | 1724 | const Register count = O2; // elements count |
never@2118 | 1725 | // O3 is used as a temp register |
never@2118 | 1726 | |
never@2118 | 1727 | assert_clean_int(count, O3); // Make sure 'count' is clean int. |
never@2118 | 1728 | |
never@2118 | 1729 | Label L_exit, L_skip_align1, L_skip_align2, L_fill_byte; |
never@2149 | 1730 | Label L_fill_2_bytes, L_fill_elements, L_fill_32_bytes; |
never@2118 | 1731 | |
never@2118 | 1732 | int shift = -1; |
never@2118 | 1733 | switch (t) { |
never@2118 | 1734 | case T_BYTE: |
never@2118 | 1735 | shift = 2; |
never@2118 | 1736 | break; |
never@2118 | 1737 | case T_SHORT: |
never@2118 | 1738 | shift = 1; |
never@2118 | 1739 | break; |
never@2118 | 1740 | case T_INT: |
never@2118 | 1741 | shift = 0; |
never@2118 | 1742 | break; |
never@2118 | 1743 | default: ShouldNotReachHere(); |
never@2118 | 1744 | } |
never@2118 | 1745 | |
never@2118 | 1746 | BLOCK_COMMENT("Entry:"); |
never@2118 | 1747 | |
never@2118 | 1748 | if (t == T_BYTE) { |
never@2118 | 1749 | // Zero extend value |
never@2118 | 1750 | __ and3(value, 0xff, value); |
never@2118 | 1751 | __ sllx(value, 8, O3); |
never@2118 | 1752 | __ or3(value, O3, value); |
never@2118 | 1753 | } |
never@2118 | 1754 | if (t == T_SHORT) { |
never@2118 | 1755 | // Zero extend value |
never@2149 | 1756 | __ sllx(value, 48, value); |
never@2149 | 1757 | __ srlx(value, 48, value); |
never@2118 | 1758 | } |
never@2118 | 1759 | if (t == T_BYTE || t == T_SHORT) { |
never@2118 | 1760 | __ sllx(value, 16, O3); |
never@2118 | 1761 | __ or3(value, O3, value); |
never@2118 | 1762 | } |
never@2118 | 1763 | |
never@2118 | 1764 | __ cmp(count, 2<<shift); // Short arrays (< 8 bytes) fill by element |
never@2149 | 1765 | __ brx(Assembler::lessUnsigned, false, Assembler::pn, L_fill_elements); // use unsigned cmp |
never@2149 | 1766 | __ delayed()->andcc(count, 1, G0); |
never@2118 | 1767 | |
never@2118 | 1768 | if (!aligned && (t == T_BYTE || t == T_SHORT)) { |
never@2118 | 1769 | // align source address at 4 bytes address boundary |
never@2118 | 1770 | if (t == T_BYTE) { |
never@2118 | 1771 | // One byte misalignment happens only for byte arrays |
never@2118 | 1772 | __ andcc(to, 1, G0); |
never@2118 | 1773 | __ br(Assembler::zero, false, Assembler::pt, L_skip_align1); |
never@2118 | 1774 | __ delayed()->nop(); |
never@2118 | 1775 | __ stb(value, to, 0); |
never@2118 | 1776 | __ inc(to, 1); |
never@2118 | 1777 | __ dec(count, 1); |
never@2118 | 1778 | __ BIND(L_skip_align1); |
never@2118 | 1779 | } |
never@2118 | 1780 | // Two bytes misalignment happens only for byte and short (char) arrays |
never@2118 | 1781 | __ andcc(to, 2, G0); |
never@2118 | 1782 | __ br(Assembler::zero, false, Assembler::pt, L_skip_align2); |
never@2118 | 1783 | __ delayed()->nop(); |
never@2118 | 1784 | __ sth(value, to, 0); |
never@2118 | 1785 | __ inc(to, 2); |
never@2118 | 1786 | __ dec(count, 1 << (shift - 1)); |
never@2118 | 1787 | __ BIND(L_skip_align2); |
never@2118 | 1788 | } |
never@2118 | 1789 | #ifdef _LP64 |
never@2118 | 1790 | if (!aligned) { |
never@2118 | 1791 | #endif |
never@2118 | 1792 | // align to 8 bytes, we know we are 4 byte aligned to start |
never@2118 | 1793 | __ andcc(to, 7, G0); |
never@2118 | 1794 | __ br(Assembler::zero, false, Assembler::pt, L_fill_32_bytes); |
never@2118 | 1795 | __ delayed()->nop(); |
never@2118 | 1796 | __ stw(value, to, 0); |
never@2118 | 1797 | __ inc(to, 4); |
never@2118 | 1798 | __ dec(count, 1 << shift); |
never@2118 | 1799 | __ BIND(L_fill_32_bytes); |
never@2118 | 1800 | #ifdef _LP64 |
never@2118 | 1801 | } |
never@2118 | 1802 | #endif |
never@2118 | 1803 | |
never@2118 | 1804 | if (t == T_INT) { |
never@2118 | 1805 | // Zero extend value |
never@2118 | 1806 | __ srl(value, 0, value); |
never@2118 | 1807 | } |
never@2118 | 1808 | if (t == T_BYTE || t == T_SHORT || t == T_INT) { |
never@2118 | 1809 | __ sllx(value, 32, O3); |
never@2118 | 1810 | __ or3(value, O3, value); |
never@2118 | 1811 | } |
never@2118 | 1812 | |
never@2137 | 1813 | Label L_check_fill_8_bytes; |
never@2137 | 1814 | // Fill 32-byte chunks |
never@2137 | 1815 | __ subcc(count, 8 << shift, count); |
never@2137 | 1816 | __ brx(Assembler::less, false, Assembler::pt, L_check_fill_8_bytes); |
never@2137 | 1817 | __ delayed()->nop(); |
never@2137 | 1818 | |
never@2149 | 1819 | Label L_fill_32_bytes_loop, L_fill_4_bytes; |
never@2118 | 1820 | __ align(16); |
never@2118 | 1821 | __ BIND(L_fill_32_bytes_loop); |
never@2118 | 1822 | |
never@2118 | 1823 | __ stx(value, to, 0); |
never@2118 | 1824 | __ stx(value, to, 8); |
never@2118 | 1825 | __ stx(value, to, 16); |
never@2118 | 1826 | __ stx(value, to, 24); |
never@2118 | 1827 | |
never@2118 | 1828 | __ subcc(count, 8 << shift, count); |
never@2118 | 1829 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_fill_32_bytes_loop); |
never@2118 | 1830 | __ delayed()->add(to, 32, to); |
never@2118 | 1831 | |
never@2118 | 1832 | __ BIND(L_check_fill_8_bytes); |
never@2118 | 1833 | __ addcc(count, 8 << shift, count); |
never@2118 | 1834 | __ brx(Assembler::zero, false, Assembler::pn, L_exit); |
never@2118 | 1835 | __ delayed()->subcc(count, 1 << (shift + 1), count); |
never@2118 | 1836 | __ brx(Assembler::less, false, Assembler::pn, L_fill_4_bytes); |
never@2118 | 1837 | __ delayed()->andcc(count, 1<<shift, G0); |
never@2118 | 1838 | |
never@2118 | 1839 | // |
never@2118 | 1840 | // length is too short, just fill 8 bytes at a time |
never@2118 | 1841 | // |
never@2118 | 1842 | Label L_fill_8_bytes_loop; |
never@2118 | 1843 | __ BIND(L_fill_8_bytes_loop); |
never@2118 | 1844 | __ stx(value, to, 0); |
never@2118 | 1845 | __ subcc(count, 1 << (shift + 1), count); |
never@2118 | 1846 | __ brx(Assembler::greaterEqual, false, Assembler::pn, L_fill_8_bytes_loop); |
never@2118 | 1847 | __ delayed()->add(to, 8, to); |
never@2118 | 1848 | |
never@2118 | 1849 | // fill trailing 4 bytes |
never@2118 | 1850 | __ andcc(count, 1<<shift, G0); // in delay slot of branches |
never@2149 | 1851 | if (t == T_INT) { |
never@2149 | 1852 | __ BIND(L_fill_elements); |
never@2149 | 1853 | } |
never@2118 | 1854 | __ BIND(L_fill_4_bytes); |
never@2118 | 1855 | __ brx(Assembler::zero, false, Assembler::pt, L_fill_2_bytes); |
never@2118 | 1856 | if (t == T_BYTE || t == T_SHORT) { |
never@2118 | 1857 | __ delayed()->andcc(count, 1<<(shift-1), G0); |
never@2118 | 1858 | } else { |
never@2118 | 1859 | __ delayed()->nop(); |
never@2118 | 1860 | } |
never@2118 | 1861 | __ stw(value, to, 0); |
never@2118 | 1862 | if (t == T_BYTE || t == T_SHORT) { |
never@2118 | 1863 | __ inc(to, 4); |
never@2118 | 1864 | // fill trailing 2 bytes |
never@2118 | 1865 | __ andcc(count, 1<<(shift-1), G0); // in delay slot of branches |
never@2118 | 1866 | __ BIND(L_fill_2_bytes); |
never@2118 | 1867 | __ brx(Assembler::zero, false, Assembler::pt, L_fill_byte); |
never@2118 | 1868 | __ delayed()->andcc(count, 1, count); |
never@2118 | 1869 | __ sth(value, to, 0); |
never@2118 | 1870 | if (t == T_BYTE) { |
never@2118 | 1871 | __ inc(to, 2); |
never@2118 | 1872 | // fill trailing byte |
never@2118 | 1873 | __ andcc(count, 1, count); // in delay slot of branches |
never@2118 | 1874 | __ BIND(L_fill_byte); |
never@2118 | 1875 | __ brx(Assembler::zero, false, Assembler::pt, L_exit); |
never@2118 | 1876 | __ delayed()->nop(); |
never@2118 | 1877 | __ stb(value, to, 0); |
never@2118 | 1878 | } else { |
never@2118 | 1879 | __ BIND(L_fill_byte); |
never@2118 | 1880 | } |
never@2118 | 1881 | } else { |
never@2118 | 1882 | __ BIND(L_fill_2_bytes); |
never@2118 | 1883 | } |
never@2118 | 1884 | __ BIND(L_exit); |
never@2118 | 1885 | __ retl(); |
never@2149 | 1886 | __ delayed()->nop(); |
never@2149 | 1887 | |
never@2149 | 1888 | // Handle copies less than 8 bytes. Int is handled elsewhere. |
never@2149 | 1889 | if (t == T_BYTE) { |
never@2149 | 1890 | __ BIND(L_fill_elements); |
never@2149 | 1891 | Label L_fill_2, L_fill_4; |
never@2149 | 1892 | // in delay slot __ andcc(count, 1, G0); |
never@2149 | 1893 | __ brx(Assembler::zero, false, Assembler::pt, L_fill_2); |
never@2149 | 1894 | __ delayed()->andcc(count, 2, G0); |
never@2149 | 1895 | __ stb(value, to, 0); |
never@2149 | 1896 | __ inc(to, 1); |
never@2149 | 1897 | __ BIND(L_fill_2); |
never@2149 | 1898 | __ brx(Assembler::zero, false, Assembler::pt, L_fill_4); |
never@2149 | 1899 | __ delayed()->andcc(count, 4, G0); |
never@2149 | 1900 | __ stb(value, to, 0); |
never@2149 | 1901 | __ stb(value, to, 1); |
never@2149 | 1902 | __ inc(to, 2); |
never@2149 | 1903 | __ BIND(L_fill_4); |
never@2149 | 1904 | __ brx(Assembler::zero, false, Assembler::pt, L_exit); |
never@2149 | 1905 | __ delayed()->nop(); |
never@2149 | 1906 | __ stb(value, to, 0); |
never@2149 | 1907 | __ stb(value, to, 1); |
never@2149 | 1908 | __ stb(value, to, 2); |
never@2149 | 1909 | __ retl(); |
never@2149 | 1910 | __ delayed()->stb(value, to, 3); |
never@2149 | 1911 | } |
never@2149 | 1912 | |
never@2149 | 1913 | if (t == T_SHORT) { |
never@2149 | 1914 | Label L_fill_2; |
never@2149 | 1915 | __ BIND(L_fill_elements); |
never@2149 | 1916 | // in delay slot __ andcc(count, 1, G0); |
never@2149 | 1917 | __ brx(Assembler::zero, false, Assembler::pt, L_fill_2); |
never@2149 | 1918 | __ delayed()->andcc(count, 2, G0); |
never@2149 | 1919 | __ sth(value, to, 0); |
never@2149 | 1920 | __ inc(to, 2); |
never@2149 | 1921 | __ BIND(L_fill_2); |
never@2149 | 1922 | __ brx(Assembler::zero, false, Assembler::pt, L_exit); |
never@2149 | 1923 | __ delayed()->nop(); |
never@2149 | 1924 | __ sth(value, to, 0); |
never@2149 | 1925 | __ retl(); |
never@2149 | 1926 | __ delayed()->sth(value, to, 2); |
never@2149 | 1927 | } |
never@2118 | 1928 | return start; |
never@2118 | 1929 | } |
never@2118 | 1930 | |
never@2118 | 1931 | // |
duke@435 | 1932 | // Generate stub for conjoint short copy. If "aligned" is true, the |
duke@435 | 1933 | // "from" and "to" addresses are assumed to be heapword aligned. |
duke@435 | 1934 | // |
duke@435 | 1935 | // Arguments for generated stub: |
duke@435 | 1936 | // from: O0 |
duke@435 | 1937 | // to: O1 |
duke@435 | 1938 | // count: O2 treated as signed |
duke@435 | 1939 | // |
iveresov@2595 | 1940 | address generate_conjoint_short_copy(bool aligned, address nooverlap_target, |
iveresov@2595 | 1941 | address *entry, const char *name) { |
duke@435 | 1942 | // Do reverse copy. |
duke@435 | 1943 | |
duke@435 | 1944 | __ align(CodeEntryAlignment); |
duke@435 | 1945 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 1946 | address start = __ pc(); |
duke@435 | 1947 | |
duke@435 | 1948 | Label L_skip_alignment, L_skip_alignment2, L_aligned_copy; |
duke@435 | 1949 | Label L_copy_2_bytes, L_copy_2_bytes_loop, L_exit; |
duke@435 | 1950 | |
duke@435 | 1951 | const Register from = O0; // source array address |
duke@435 | 1952 | const Register to = O1; // destination array address |
duke@435 | 1953 | const Register count = O2; // elements count |
duke@435 | 1954 | const Register end_from = from; // source array end address |
duke@435 | 1955 | const Register end_to = to; // destination array end address |
duke@435 | 1956 | |
duke@435 | 1957 | const Register byte_count = O3; // bytes count to copy |
duke@435 | 1958 | |
duke@435 | 1959 | assert_clean_int(count, O3); // Make sure 'count' is clean int. |
duke@435 | 1960 | |
iveresov@2595 | 1961 | if (entry != NULL) { |
iveresov@2595 | 1962 | *entry = __ pc(); |
iveresov@2595 | 1963 | // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) |
iveresov@2595 | 1964 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 1965 | } |
duke@435 | 1966 | |
duke@435 | 1967 | array_overlap_test(nooverlap_target, 1); |
duke@435 | 1968 | |
duke@435 | 1969 | __ sllx(count, LogBytesPerShort, byte_count); |
duke@435 | 1970 | __ add(to, byte_count, end_to); // offset after last copied element |
duke@435 | 1971 | |
duke@435 | 1972 | // for short arrays, just do single element copy |
duke@435 | 1973 | __ cmp(count, 11); // 8 + 3 (22 bytes) |
duke@435 | 1974 | __ brx(Assembler::less, false, Assembler::pn, L_copy_2_bytes); |
duke@435 | 1975 | __ delayed()->add(from, byte_count, end_from); |
duke@435 | 1976 | |
duke@435 | 1977 | { |
duke@435 | 1978 | // Align end of arrays since they could be not aligned even |
duke@435 | 1979 | // when arrays itself are aligned. |
duke@435 | 1980 | |
duke@435 | 1981 | // copy 1 element if necessary to align 'end_to' on an 4 bytes |
duke@435 | 1982 | __ andcc(end_to, 3, G0); |
duke@435 | 1983 | __ br(Assembler::zero, false, Assembler::pt, L_skip_alignment); |
duke@435 | 1984 | __ delayed()->lduh(end_from, -2, O3); |
duke@435 | 1985 | __ dec(end_from, 2); |
duke@435 | 1986 | __ dec(end_to, 2); |
duke@435 | 1987 | __ dec(count); |
duke@435 | 1988 | __ sth(O3, end_to, 0); |
duke@435 | 1989 | __ BIND(L_skip_alignment); |
duke@435 | 1990 | |
duke@435 | 1991 | // copy 2 elements to align 'end_to' on an 8 byte boundary |
duke@435 | 1992 | __ andcc(end_to, 7, G0); |
duke@435 | 1993 | __ br(Assembler::zero, false, Assembler::pn, L_skip_alignment2); |
duke@435 | 1994 | __ delayed()->lduh(end_from, -2, O3); |
duke@435 | 1995 | __ dec(count, 2); |
duke@435 | 1996 | __ lduh(end_from, -4, O4); |
duke@435 | 1997 | __ dec(end_from, 4); |
duke@435 | 1998 | __ dec(end_to, 4); |
duke@435 | 1999 | __ sth(O3, end_to, 2); |
duke@435 | 2000 | __ sth(O4, end_to, 0); |
duke@435 | 2001 | __ BIND(L_skip_alignment2); |
duke@435 | 2002 | } |
duke@435 | 2003 | #ifdef _LP64 |
duke@435 | 2004 | if (aligned) { |
duke@435 | 2005 | // Both arrays are aligned to 8-bytes in 64-bits VM. |
duke@435 | 2006 | // The 'count' is decremented in copy_16_bytes_backward_with_shift() |
duke@435 | 2007 | // in unaligned case. |
duke@435 | 2008 | __ dec(count, 8); |
duke@435 | 2009 | } else |
duke@435 | 2010 | #endif |
duke@435 | 2011 | { |
duke@435 | 2012 | // Copy with shift 16 bytes per iteration if arrays do not have |
duke@435 | 2013 | // the same alignment mod 8, otherwise jump to the next |
duke@435 | 2014 | // code for aligned copy (and substracting 8 from 'count' before jump). |
duke@435 | 2015 | // The compare above (count >= 11) guarantes 'count' >= 16 bytes. |
duke@435 | 2016 | // Also jump over aligned copy after the copy with shift completed. |
duke@435 | 2017 | |
duke@435 | 2018 | copy_16_bytes_backward_with_shift(end_from, end_to, count, 8, |
duke@435 | 2019 | L_aligned_copy, L_copy_2_bytes); |
duke@435 | 2020 | } |
duke@435 | 2021 | // copy 4 elements (16 bytes) at a time |
kvn@1800 | 2022 | __ align(OptoLoopAlignment); |
duke@435 | 2023 | __ BIND(L_aligned_copy); |
duke@435 | 2024 | __ dec(end_from, 16); |
duke@435 | 2025 | __ ldx(end_from, 8, O3); |
duke@435 | 2026 | __ ldx(end_from, 0, O4); |
duke@435 | 2027 | __ dec(end_to, 16); |
duke@435 | 2028 | __ deccc(count, 8); |
duke@435 | 2029 | __ stx(O3, end_to, 8); |
duke@435 | 2030 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_aligned_copy); |
duke@435 | 2031 | __ delayed()->stx(O4, end_to, 0); |
duke@435 | 2032 | __ inc(count, 8); |
duke@435 | 2033 | |
duke@435 | 2034 | // copy 1 element (2 bytes) at a time |
duke@435 | 2035 | __ BIND(L_copy_2_bytes); |
kvn@3037 | 2036 | __ cmp_and_br_short(count, 0, Assembler::equal, Assembler::pt, L_exit); |
duke@435 | 2037 | __ BIND(L_copy_2_bytes_loop); |
duke@435 | 2038 | __ dec(end_from, 2); |
duke@435 | 2039 | __ dec(end_to, 2); |
duke@435 | 2040 | __ lduh(end_from, 0, O4); |
duke@435 | 2041 | __ deccc(count); |
duke@435 | 2042 | __ brx(Assembler::greater, false, Assembler::pt, L_copy_2_bytes_loop); |
duke@435 | 2043 | __ delayed()->sth(O4, end_to, 0); |
duke@435 | 2044 | |
duke@435 | 2045 | __ BIND(L_exit); |
duke@435 | 2046 | // O3, O4 are used as temp registers |
duke@435 | 2047 | inc_counter_np(SharedRuntime::_jshort_array_copy_ctr, O3, O4); |
duke@435 | 2048 | __ retl(); |
duke@435 | 2049 | __ delayed()->mov(G0, O0); // return 0 |
duke@435 | 2050 | return start; |
duke@435 | 2051 | } |
duke@435 | 2052 | |
duke@435 | 2053 | // |
kvn@3103 | 2054 | // Helper methods for generate_disjoint_int_copy_core() |
kvn@3103 | 2055 | // |
kvn@3103 | 2056 | void copy_16_bytes_loop(Register from, Register to, Register count, int count_dec, |
kvn@3103 | 2057 | Label& L_loop, bool use_prefetch, bool use_bis) { |
kvn@3103 | 2058 | |
kvn@3103 | 2059 | __ align(OptoLoopAlignment); |
kvn@3103 | 2060 | __ BIND(L_loop); |
kvn@3103 | 2061 | if (use_prefetch) { |
kvn@3103 | 2062 | if (ArraycopySrcPrefetchDistance > 0) { |
kvn@3103 | 2063 | __ prefetch(from, ArraycopySrcPrefetchDistance, Assembler::severalReads); |
kvn@3103 | 2064 | } |
kvn@3103 | 2065 | if (ArraycopyDstPrefetchDistance > 0) { |
kvn@3103 | 2066 | __ prefetch(to, ArraycopyDstPrefetchDistance, Assembler::severalWritesAndPossiblyReads); |
kvn@3103 | 2067 | } |
kvn@3103 | 2068 | } |
kvn@3103 | 2069 | __ ldx(from, 4, O4); |
kvn@3103 | 2070 | __ ldx(from, 12, G4); |
kvn@3103 | 2071 | __ inc(to, 16); |
kvn@3103 | 2072 | __ inc(from, 16); |
kvn@3103 | 2073 | __ deccc(count, 4); // Can we do next iteration after this one? |
kvn@3103 | 2074 | |
kvn@3103 | 2075 | __ srlx(O4, 32, G3); |
kvn@3103 | 2076 | __ bset(G3, O3); |
kvn@3103 | 2077 | __ sllx(O4, 32, O4); |
kvn@3103 | 2078 | __ srlx(G4, 32, G3); |
kvn@3103 | 2079 | __ bset(G3, O4); |
kvn@3103 | 2080 | if (use_bis) { |
kvn@3103 | 2081 | __ stxa(O3, to, -16); |
kvn@3103 | 2082 | __ stxa(O4, to, -8); |
kvn@3103 | 2083 | } else { |
kvn@3103 | 2084 | __ stx(O3, to, -16); |
kvn@3103 | 2085 | __ stx(O4, to, -8); |
kvn@3103 | 2086 | } |
kvn@3103 | 2087 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_loop); |
kvn@3103 | 2088 | __ delayed()->sllx(G4, 32, O3); |
kvn@3103 | 2089 | |
kvn@3103 | 2090 | } |
kvn@3103 | 2091 | |
kvn@3103 | 2092 | // |
duke@435 | 2093 | // Generate core code for disjoint int copy (and oop copy on 32-bit). |
duke@435 | 2094 | // If "aligned" is true, the "from" and "to" addresses are assumed |
duke@435 | 2095 | // to be heapword aligned. |
duke@435 | 2096 | // |
duke@435 | 2097 | // Arguments: |
duke@435 | 2098 | // from: O0 |
duke@435 | 2099 | // to: O1 |
duke@435 | 2100 | // count: O2 treated as signed |
duke@435 | 2101 | // |
duke@435 | 2102 | void generate_disjoint_int_copy_core(bool aligned) { |
duke@435 | 2103 | |
duke@435 | 2104 | Label L_skip_alignment, L_aligned_copy; |
kvn@3103 | 2105 | Label L_copy_4_bytes, L_copy_4_bytes_loop, L_exit; |
duke@435 | 2106 | |
duke@435 | 2107 | const Register from = O0; // source array address |
duke@435 | 2108 | const Register to = O1; // destination array address |
duke@435 | 2109 | const Register count = O2; // elements count |
duke@435 | 2110 | const Register offset = O5; // offset from start of arrays |
duke@435 | 2111 | // O3, O4, G3, G4 are used as temp registers |
duke@435 | 2112 | |
duke@435 | 2113 | // 'aligned' == true when it is known statically during compilation |
duke@435 | 2114 | // of this arraycopy call site that both 'from' and 'to' addresses |
duke@435 | 2115 | // are HeapWordSize aligned (see LibraryCallKit::basictype2arraycopy()). |
duke@435 | 2116 | // |
duke@435 | 2117 | // Aligned arrays have 4 bytes alignment in 32-bits VM |
duke@435 | 2118 | // and 8 bytes - in 64-bits VM. |
duke@435 | 2119 | // |
duke@435 | 2120 | #ifdef _LP64 |
duke@435 | 2121 | if (!aligned) |
duke@435 | 2122 | #endif |
duke@435 | 2123 | { |
duke@435 | 2124 | // The next check could be put under 'ifndef' since the code in |
duke@435 | 2125 | // generate_disjoint_long_copy_core() has own checks and set 'offset'. |
duke@435 | 2126 | |
duke@435 | 2127 | // for short arrays, just do single element copy |
duke@435 | 2128 | __ cmp(count, 5); // 4 + 1 (20 bytes) |
duke@435 | 2129 | __ brx(Assembler::lessEqual, false, Assembler::pn, L_copy_4_bytes); |
duke@435 | 2130 | __ delayed()->mov(G0, offset); |
duke@435 | 2131 | |
duke@435 | 2132 | // copy 1 element to align 'to' on an 8 byte boundary |
duke@435 | 2133 | __ andcc(to, 7, G0); |
duke@435 | 2134 | __ br(Assembler::zero, false, Assembler::pt, L_skip_alignment); |
duke@435 | 2135 | __ delayed()->ld(from, 0, O3); |
duke@435 | 2136 | __ inc(from, 4); |
duke@435 | 2137 | __ inc(to, 4); |
duke@435 | 2138 | __ dec(count); |
duke@435 | 2139 | __ st(O3, to, -4); |
duke@435 | 2140 | __ BIND(L_skip_alignment); |
duke@435 | 2141 | |
duke@435 | 2142 | // if arrays have same alignment mod 8, do 4 elements copy |
duke@435 | 2143 | __ andcc(from, 7, G0); |
duke@435 | 2144 | __ br(Assembler::zero, false, Assembler::pt, L_aligned_copy); |
duke@435 | 2145 | __ delayed()->ld(from, 0, O3); |
duke@435 | 2146 | |
duke@435 | 2147 | // |
duke@435 | 2148 | // Load 2 aligned 8-bytes chunks and use one from previous iteration |
duke@435 | 2149 | // to form 2 aligned 8-bytes chunks to store. |
duke@435 | 2150 | // |
duke@435 | 2151 | // copy_16_bytes_forward_with_shift() is not used here since this |
duke@435 | 2152 | // code is more optimal. |
duke@435 | 2153 | |
duke@435 | 2154 | // copy with shift 4 elements (16 bytes) at a time |
duke@435 | 2155 | __ dec(count, 4); // The cmp at the beginning guaranty count >= 4 |
kvn@3103 | 2156 | __ sllx(O3, 32, O3); |
kvn@3103 | 2157 | |
kvn@3103 | 2158 | disjoint_copy_core(from, to, count, 2, 16, copy_16_bytes_loop); |
duke@435 | 2159 | |
duke@435 | 2160 | __ br(Assembler::always, false, Assembler::pt, L_copy_4_bytes); |
duke@435 | 2161 | __ delayed()->inc(count, 4); // restore 'count' |
duke@435 | 2162 | |
duke@435 | 2163 | __ BIND(L_aligned_copy); |
kvn@3103 | 2164 | } // !aligned |
kvn@3103 | 2165 | |
duke@435 | 2166 | // copy 4 elements (16 bytes) at a time |
duke@435 | 2167 | __ and3(count, 1, G4); // Save |
duke@435 | 2168 | __ srl(count, 1, count); |
duke@435 | 2169 | generate_disjoint_long_copy_core(aligned); |
duke@435 | 2170 | __ mov(G4, count); // Restore |
duke@435 | 2171 | |
duke@435 | 2172 | // copy 1 element at a time |
duke@435 | 2173 | __ BIND(L_copy_4_bytes); |
kvn@3037 | 2174 | __ cmp_and_br_short(count, 0, Assembler::equal, Assembler::pt, L_exit); |
duke@435 | 2175 | __ BIND(L_copy_4_bytes_loop); |
duke@435 | 2176 | __ ld(from, offset, O3); |
duke@435 | 2177 | __ deccc(count); |
duke@435 | 2178 | __ st(O3, to, offset); |
duke@435 | 2179 | __ brx(Assembler::notZero, false, Assembler::pt, L_copy_4_bytes_loop); |
duke@435 | 2180 | __ delayed()->inc(offset, 4); |
duke@435 | 2181 | __ BIND(L_exit); |
duke@435 | 2182 | } |
duke@435 | 2183 | |
duke@435 | 2184 | // |
duke@435 | 2185 | // Generate stub for disjoint int copy. If "aligned" is true, the |
duke@435 | 2186 | // "from" and "to" addresses are assumed to be heapword aligned. |
duke@435 | 2187 | // |
duke@435 | 2188 | // Arguments for generated stub: |
duke@435 | 2189 | // from: O0 |
duke@435 | 2190 | // to: O1 |
duke@435 | 2191 | // count: O2 treated as signed |
duke@435 | 2192 | // |
iveresov@2595 | 2193 | address generate_disjoint_int_copy(bool aligned, address *entry, const char *name) { |
duke@435 | 2194 | __ align(CodeEntryAlignment); |
duke@435 | 2195 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 2196 | address start = __ pc(); |
duke@435 | 2197 | |
duke@435 | 2198 | const Register count = O2; |
duke@435 | 2199 | assert_clean_int(count, O3); // Make sure 'count' is clean int. |
duke@435 | 2200 | |
iveresov@2595 | 2201 | if (entry != NULL) { |
iveresov@2595 | 2202 | *entry = __ pc(); |
iveresov@2595 | 2203 | // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) |
iveresov@2595 | 2204 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 2205 | } |
duke@435 | 2206 | |
duke@435 | 2207 | generate_disjoint_int_copy_core(aligned); |
duke@435 | 2208 | |
duke@435 | 2209 | // O3, O4 are used as temp registers |
duke@435 | 2210 | inc_counter_np(SharedRuntime::_jint_array_copy_ctr, O3, O4); |
duke@435 | 2211 | __ retl(); |
duke@435 | 2212 | __ delayed()->mov(G0, O0); // return 0 |
duke@435 | 2213 | return start; |
duke@435 | 2214 | } |
duke@435 | 2215 | |
duke@435 | 2216 | // |
duke@435 | 2217 | // Generate core code for conjoint int copy (and oop copy on 32-bit). |
duke@435 | 2218 | // If "aligned" is true, the "from" and "to" addresses are assumed |
duke@435 | 2219 | // to be heapword aligned. |
duke@435 | 2220 | // |
duke@435 | 2221 | // Arguments: |
duke@435 | 2222 | // from: O0 |
duke@435 | 2223 | // to: O1 |
duke@435 | 2224 | // count: O2 treated as signed |
duke@435 | 2225 | // |
duke@435 | 2226 | void generate_conjoint_int_copy_core(bool aligned) { |
duke@435 | 2227 | // Do reverse copy. |
duke@435 | 2228 | |
duke@435 | 2229 | Label L_skip_alignment, L_aligned_copy; |
duke@435 | 2230 | Label L_copy_16_bytes, L_copy_4_bytes, L_copy_4_bytes_loop, L_exit; |
duke@435 | 2231 | |
duke@435 | 2232 | const Register from = O0; // source array address |
duke@435 | 2233 | const Register to = O1; // destination array address |
duke@435 | 2234 | const Register count = O2; // elements count |
duke@435 | 2235 | const Register end_from = from; // source array end address |
duke@435 | 2236 | const Register end_to = to; // destination array end address |
duke@435 | 2237 | // O3, O4, O5, G3 are used as temp registers |
duke@435 | 2238 | |
duke@435 | 2239 | const Register byte_count = O3; // bytes count to copy |
duke@435 | 2240 | |
duke@435 | 2241 | __ sllx(count, LogBytesPerInt, byte_count); |
duke@435 | 2242 | __ add(to, byte_count, end_to); // offset after last copied element |
duke@435 | 2243 | |
duke@435 | 2244 | __ cmp(count, 5); // for short arrays, just do single element copy |
duke@435 | 2245 | __ brx(Assembler::lessEqual, false, Assembler::pn, L_copy_4_bytes); |
duke@435 | 2246 | __ delayed()->add(from, byte_count, end_from); |
duke@435 | 2247 | |
duke@435 | 2248 | // copy 1 element to align 'to' on an 8 byte boundary |
duke@435 | 2249 | __ andcc(end_to, 7, G0); |
duke@435 | 2250 | __ br(Assembler::zero, false, Assembler::pt, L_skip_alignment); |
duke@435 | 2251 | __ delayed()->nop(); |
duke@435 | 2252 | __ dec(count); |
duke@435 | 2253 | __ dec(end_from, 4); |
duke@435 | 2254 | __ dec(end_to, 4); |
duke@435 | 2255 | __ ld(end_from, 0, O4); |
duke@435 | 2256 | __ st(O4, end_to, 0); |
duke@435 | 2257 | __ BIND(L_skip_alignment); |
duke@435 | 2258 | |
duke@435 | 2259 | // Check if 'end_from' and 'end_to' has the same alignment. |
duke@435 | 2260 | __ andcc(end_from, 7, G0); |
duke@435 | 2261 | __ br(Assembler::zero, false, Assembler::pt, L_aligned_copy); |
duke@435 | 2262 | __ delayed()->dec(count, 4); // The cmp at the start guaranty cnt >= 4 |
duke@435 | 2263 | |
duke@435 | 2264 | // copy with shift 4 elements (16 bytes) at a time |
duke@435 | 2265 | // |
duke@435 | 2266 | // Load 2 aligned 8-bytes chunks and use one from previous iteration |
duke@435 | 2267 | // to form 2 aligned 8-bytes chunks to store. |
duke@435 | 2268 | // |
duke@435 | 2269 | __ ldx(end_from, -4, O3); |
kvn@1800 | 2270 | __ align(OptoLoopAlignment); |
duke@435 | 2271 | __ BIND(L_copy_16_bytes); |
duke@435 | 2272 | __ ldx(end_from, -12, O4); |
duke@435 | 2273 | __ deccc(count, 4); |
duke@435 | 2274 | __ ldx(end_from, -20, O5); |
duke@435 | 2275 | __ dec(end_to, 16); |
duke@435 | 2276 | __ dec(end_from, 16); |
duke@435 | 2277 | __ srlx(O3, 32, O3); |
duke@435 | 2278 | __ sllx(O4, 32, G3); |
duke@435 | 2279 | __ bset(G3, O3); |
duke@435 | 2280 | __ stx(O3, end_to, 8); |
duke@435 | 2281 | __ srlx(O4, 32, O4); |
duke@435 | 2282 | __ sllx(O5, 32, G3); |
duke@435 | 2283 | __ bset(O4, G3); |
duke@435 | 2284 | __ stx(G3, end_to, 0); |
duke@435 | 2285 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_copy_16_bytes); |
duke@435 | 2286 | __ delayed()->mov(O5, O3); |
duke@435 | 2287 | |
duke@435 | 2288 | __ br(Assembler::always, false, Assembler::pt, L_copy_4_bytes); |
duke@435 | 2289 | __ delayed()->inc(count, 4); |
duke@435 | 2290 | |
duke@435 | 2291 | // copy 4 elements (16 bytes) at a time |
kvn@1800 | 2292 | __ align(OptoLoopAlignment); |
duke@435 | 2293 | __ BIND(L_aligned_copy); |
duke@435 | 2294 | __ dec(end_from, 16); |
duke@435 | 2295 | __ ldx(end_from, 8, O3); |
duke@435 | 2296 | __ ldx(end_from, 0, O4); |
duke@435 | 2297 | __ dec(end_to, 16); |
duke@435 | 2298 | __ deccc(count, 4); |
duke@435 | 2299 | __ stx(O3, end_to, 8); |
duke@435 | 2300 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_aligned_copy); |
duke@435 | 2301 | __ delayed()->stx(O4, end_to, 0); |
duke@435 | 2302 | __ inc(count, 4); |
duke@435 | 2303 | |
duke@435 | 2304 | // copy 1 element (4 bytes) at a time |
duke@435 | 2305 | __ BIND(L_copy_4_bytes); |
kvn@3037 | 2306 | __ cmp_and_br_short(count, 0, Assembler::equal, Assembler::pt, L_exit); |
duke@435 | 2307 | __ BIND(L_copy_4_bytes_loop); |
duke@435 | 2308 | __ dec(end_from, 4); |
duke@435 | 2309 | __ dec(end_to, 4); |
duke@435 | 2310 | __ ld(end_from, 0, O4); |
duke@435 | 2311 | __ deccc(count); |
duke@435 | 2312 | __ brx(Assembler::greater, false, Assembler::pt, L_copy_4_bytes_loop); |
duke@435 | 2313 | __ delayed()->st(O4, end_to, 0); |
duke@435 | 2314 | __ BIND(L_exit); |
duke@435 | 2315 | } |
duke@435 | 2316 | |
duke@435 | 2317 | // |
duke@435 | 2318 | // Generate stub for conjoint int copy. If "aligned" is true, the |
duke@435 | 2319 | // "from" and "to" addresses are assumed to be heapword aligned. |
duke@435 | 2320 | // |
duke@435 | 2321 | // Arguments for generated stub: |
duke@435 | 2322 | // from: O0 |
duke@435 | 2323 | // to: O1 |
duke@435 | 2324 | // count: O2 treated as signed |
duke@435 | 2325 | // |
iveresov@2595 | 2326 | address generate_conjoint_int_copy(bool aligned, address nooverlap_target, |
iveresov@2595 | 2327 | address *entry, const char *name) { |
duke@435 | 2328 | __ align(CodeEntryAlignment); |
duke@435 | 2329 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 2330 | address start = __ pc(); |
duke@435 | 2331 | |
duke@435 | 2332 | assert_clean_int(O2, O3); // Make sure 'count' is clean int. |
duke@435 | 2333 | |
iveresov@2595 | 2334 | if (entry != NULL) { |
iveresov@2595 | 2335 | *entry = __ pc(); |
iveresov@2595 | 2336 | // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) |
iveresov@2595 | 2337 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 2338 | } |
duke@435 | 2339 | |
duke@435 | 2340 | array_overlap_test(nooverlap_target, 2); |
duke@435 | 2341 | |
duke@435 | 2342 | generate_conjoint_int_copy_core(aligned); |
duke@435 | 2343 | |
duke@435 | 2344 | // O3, O4 are used as temp registers |
duke@435 | 2345 | inc_counter_np(SharedRuntime::_jint_array_copy_ctr, O3, O4); |
duke@435 | 2346 | __ retl(); |
duke@435 | 2347 | __ delayed()->mov(G0, O0); // return 0 |
duke@435 | 2348 | return start; |
duke@435 | 2349 | } |
duke@435 | 2350 | |
duke@435 | 2351 | // |
kvn@3103 | 2352 | // Helper methods for generate_disjoint_long_copy_core() |
kvn@3103 | 2353 | // |
kvn@3103 | 2354 | void copy_64_bytes_loop(Register from, Register to, Register count, int count_dec, |
kvn@3103 | 2355 | Label& L_loop, bool use_prefetch, bool use_bis) { |
kvn@3103 | 2356 | __ align(OptoLoopAlignment); |
kvn@3103 | 2357 | __ BIND(L_loop); |
kvn@3103 | 2358 | for (int off = 0; off < 64; off += 16) { |
kvn@3103 | 2359 | if (use_prefetch && (off & 31) == 0) { |
kvn@3103 | 2360 | if (ArraycopySrcPrefetchDistance > 0) { |
kvn@3157 | 2361 | __ prefetch(from, ArraycopySrcPrefetchDistance+off, Assembler::severalReads); |
kvn@3103 | 2362 | } |
kvn@3103 | 2363 | if (ArraycopyDstPrefetchDistance > 0) { |
kvn@3157 | 2364 | __ prefetch(to, ArraycopyDstPrefetchDistance+off, Assembler::severalWritesAndPossiblyReads); |
kvn@3103 | 2365 | } |
kvn@3103 | 2366 | } |
kvn@3103 | 2367 | __ ldx(from, off+0, O4); |
kvn@3103 | 2368 | __ ldx(from, off+8, O5); |
kvn@3103 | 2369 | if (use_bis) { |
kvn@3103 | 2370 | __ stxa(O4, to, off+0); |
kvn@3103 | 2371 | __ stxa(O5, to, off+8); |
kvn@3103 | 2372 | } else { |
kvn@3103 | 2373 | __ stx(O4, to, off+0); |
kvn@3103 | 2374 | __ stx(O5, to, off+8); |
kvn@3103 | 2375 | } |
kvn@3103 | 2376 | } |
kvn@3103 | 2377 | __ deccc(count, 8); |
kvn@3103 | 2378 | __ inc(from, 64); |
kvn@3103 | 2379 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_loop); |
kvn@3103 | 2380 | __ delayed()->inc(to, 64); |
kvn@3103 | 2381 | } |
kvn@3103 | 2382 | |
kvn@3103 | 2383 | // |
duke@435 | 2384 | // Generate core code for disjoint long copy (and oop copy on 64-bit). |
duke@435 | 2385 | // "aligned" is ignored, because we must make the stronger |
duke@435 | 2386 | // assumption that both addresses are always 64-bit aligned. |
duke@435 | 2387 | // |
duke@435 | 2388 | // Arguments: |
duke@435 | 2389 | // from: O0 |
duke@435 | 2390 | // to: O1 |
duke@435 | 2391 | // count: O2 treated as signed |
duke@435 | 2392 | // |
kvn@1799 | 2393 | // count -= 2; |
kvn@1799 | 2394 | // if ( count >= 0 ) { // >= 2 elements |
kvn@1799 | 2395 | // if ( count > 6) { // >= 8 elements |
kvn@1799 | 2396 | // count -= 6; // original count - 8 |
kvn@1799 | 2397 | // do { |
kvn@1799 | 2398 | // copy_8_elements; |
kvn@1799 | 2399 | // count -= 8; |
kvn@1799 | 2400 | // } while ( count >= 0 ); |
kvn@1799 | 2401 | // count += 6; |
kvn@1799 | 2402 | // } |
kvn@1799 | 2403 | // if ( count >= 0 ) { // >= 2 elements |
kvn@1799 | 2404 | // do { |
kvn@1799 | 2405 | // copy_2_elements; |
kvn@1799 | 2406 | // } while ( (count=count-2) >= 0 ); |
kvn@1799 | 2407 | // } |
kvn@1799 | 2408 | // } |
kvn@1799 | 2409 | // count += 2; |
kvn@1799 | 2410 | // if ( count != 0 ) { // 1 element left |
kvn@1799 | 2411 | // copy_1_element; |
kvn@1799 | 2412 | // } |
kvn@1799 | 2413 | // |
duke@435 | 2414 | void generate_disjoint_long_copy_core(bool aligned) { |
duke@435 | 2415 | Label L_copy_8_bytes, L_copy_16_bytes, L_exit; |
duke@435 | 2416 | const Register from = O0; // source array address |
duke@435 | 2417 | const Register to = O1; // destination array address |
duke@435 | 2418 | const Register count = O2; // elements count |
duke@435 | 2419 | const Register offset0 = O4; // element offset |
duke@435 | 2420 | const Register offset8 = O5; // next element offset |
duke@435 | 2421 | |
kvn@3103 | 2422 | __ deccc(count, 2); |
kvn@3103 | 2423 | __ mov(G0, offset0); // offset from start of arrays (0) |
kvn@3103 | 2424 | __ brx(Assembler::negative, false, Assembler::pn, L_copy_8_bytes ); |
kvn@3103 | 2425 | __ delayed()->add(offset0, 8, offset8); |
kvn@1799 | 2426 | |
kvn@1799 | 2427 | // Copy by 64 bytes chunks |
kvn@3103 | 2428 | |
kvn@1799 | 2429 | const Register from64 = O3; // source address |
kvn@1799 | 2430 | const Register to64 = G3; // destination address |
kvn@3103 | 2431 | __ subcc(count, 6, O3); |
kvn@3103 | 2432 | __ brx(Assembler::negative, false, Assembler::pt, L_copy_16_bytes ); |
kvn@3103 | 2433 | __ delayed()->mov(to, to64); |
kvn@3103 | 2434 | // Now we can use O4(offset0), O5(offset8) as temps |
kvn@3103 | 2435 | __ mov(O3, count); |
kvn@3103 | 2436 | // count >= 0 (original count - 8) |
kvn@3103 | 2437 | __ mov(from, from64); |
kvn@3103 | 2438 | |
kvn@3103 | 2439 | disjoint_copy_core(from64, to64, count, 3, 64, copy_64_bytes_loop); |
kvn@1799 | 2440 | |
kvn@1799 | 2441 | // Restore O4(offset0), O5(offset8) |
kvn@1799 | 2442 | __ sub(from64, from, offset0); |
kvn@3103 | 2443 | __ inccc(count, 6); // restore count |
kvn@1799 | 2444 | __ brx(Assembler::negative, false, Assembler::pn, L_copy_8_bytes ); |
kvn@1799 | 2445 | __ delayed()->add(offset0, 8, offset8); |
kvn@1799 | 2446 | |
kvn@1799 | 2447 | // Copy by 16 bytes chunks |
kvn@1800 | 2448 | __ align(OptoLoopAlignment); |
duke@435 | 2449 | __ BIND(L_copy_16_bytes); |
duke@435 | 2450 | __ ldx(from, offset0, O3); |
duke@435 | 2451 | __ ldx(from, offset8, G3); |
duke@435 | 2452 | __ deccc(count, 2); |
duke@435 | 2453 | __ stx(O3, to, offset0); |
duke@435 | 2454 | __ inc(offset0, 16); |
duke@435 | 2455 | __ stx(G3, to, offset8); |
duke@435 | 2456 | __ brx(Assembler::greaterEqual, false, Assembler::pt, L_copy_16_bytes); |
duke@435 | 2457 | __ delayed()->inc(offset8, 16); |
duke@435 | 2458 | |
kvn@1799 | 2459 | // Copy last 8 bytes |
duke@435 | 2460 | __ BIND(L_copy_8_bytes); |
duke@435 | 2461 | __ inccc(count, 2); |
duke@435 | 2462 | __ brx(Assembler::zero, true, Assembler::pn, L_exit ); |
duke@435 | 2463 | __ delayed()->mov(offset0, offset8); // Set O5 used by other stubs |
duke@435 | 2464 | __ ldx(from, offset0, O3); |
duke@435 | 2465 | __ stx(O3, to, offset0); |
duke@435 | 2466 | __ BIND(L_exit); |
duke@435 | 2467 | } |
duke@435 | 2468 | |
duke@435 | 2469 | // |
duke@435 | 2470 | // Generate stub for disjoint long copy. |
duke@435 | 2471 | // "aligned" is ignored, because we must make the stronger |
duke@435 | 2472 | // assumption that both addresses are always 64-bit aligned. |
duke@435 | 2473 | // |
duke@435 | 2474 | // Arguments for generated stub: |
duke@435 | 2475 | // from: O0 |
duke@435 | 2476 | // to: O1 |
duke@435 | 2477 | // count: O2 treated as signed |
duke@435 | 2478 | // |
iveresov@2595 | 2479 | address generate_disjoint_long_copy(bool aligned, address *entry, const char *name) { |
duke@435 | 2480 | __ align(CodeEntryAlignment); |
duke@435 | 2481 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 2482 | address start = __ pc(); |
duke@435 | 2483 | |
duke@435 | 2484 | assert_clean_int(O2, O3); // Make sure 'count' is clean int. |
duke@435 | 2485 | |
iveresov@2595 | 2486 | if (entry != NULL) { |
iveresov@2595 | 2487 | *entry = __ pc(); |
iveresov@2595 | 2488 | // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) |
iveresov@2595 | 2489 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 2490 | } |
duke@435 | 2491 | |
duke@435 | 2492 | generate_disjoint_long_copy_core(aligned); |
duke@435 | 2493 | |
duke@435 | 2494 | // O3, O4 are used as temp registers |
duke@435 | 2495 | inc_counter_np(SharedRuntime::_jlong_array_copy_ctr, O3, O4); |
duke@435 | 2496 | __ retl(); |
duke@435 | 2497 | __ delayed()->mov(G0, O0); // return 0 |
duke@435 | 2498 | return start; |
duke@435 | 2499 | } |
duke@435 | 2500 | |
duke@435 | 2501 | // |
duke@435 | 2502 | // Generate core code for conjoint long copy (and oop copy on 64-bit). |
duke@435 | 2503 | // "aligned" is ignored, because we must make the stronger |
duke@435 | 2504 | // assumption that both addresses are always 64-bit aligned. |
duke@435 | 2505 | // |
duke@435 | 2506 | // Arguments: |
duke@435 | 2507 | // from: O0 |
duke@435 | 2508 | // to: O1 |
duke@435 | 2509 | // count: O2 treated as signed |
duke@435 | 2510 | // |
duke@435 | 2511 | void generate_conjoint_long_copy_core(bool aligned) { |
duke@435 | 2512 | // Do reverse copy. |
duke@435 | 2513 | Label L_copy_8_bytes, L_copy_16_bytes, L_exit; |
duke@435 | 2514 | const Register from = O0; // source array address |
duke@435 | 2515 | const Register to = O1; // destination array address |
duke@435 | 2516 | const Register count = O2; // elements count |
duke@435 | 2517 | const Register offset8 = O4; // element offset |
duke@435 | 2518 | const Register offset0 = O5; // previous element offset |
duke@435 | 2519 | |
duke@435 | 2520 | __ subcc(count, 1, count); |
duke@435 | 2521 | __ brx(Assembler::lessEqual, false, Assembler::pn, L_copy_8_bytes ); |
duke@435 | 2522 | __ delayed()->sllx(count, LogBytesPerLong, offset8); |
duke@435 | 2523 | __ sub(offset8, 8, offset0); |
kvn@1800 | 2524 | __ align(OptoLoopAlignment); |
duke@435 | 2525 | __ BIND(L_copy_16_bytes); |
duke@435 | 2526 | __ ldx(from, offset8, O2); |
duke@435 | 2527 | __ ldx(from, offset0, O3); |
duke@435 | 2528 | __ stx(O2, to, offset8); |
duke@435 | 2529 | __ deccc(offset8, 16); // use offset8 as counter |
duke@435 | 2530 | __ stx(O3, to, offset0); |
duke@435 | 2531 | __ brx(Assembler::greater, false, Assembler::pt, L_copy_16_bytes); |
duke@435 | 2532 | __ delayed()->dec(offset0, 16); |
duke@435 | 2533 | |
duke@435 | 2534 | __ BIND(L_copy_8_bytes); |
duke@435 | 2535 | __ brx(Assembler::negative, false, Assembler::pn, L_exit ); |
duke@435 | 2536 | __ delayed()->nop(); |
duke@435 | 2537 | __ ldx(from, 0, O3); |
duke@435 | 2538 | __ stx(O3, to, 0); |
duke@435 | 2539 | __ BIND(L_exit); |
duke@435 | 2540 | } |
duke@435 | 2541 | |
duke@435 | 2542 | // Generate stub for conjoint long copy. |
duke@435 | 2543 | // "aligned" is ignored, because we must make the stronger |
duke@435 | 2544 | // assumption that both addresses are always 64-bit aligned. |
duke@435 | 2545 | // |
duke@435 | 2546 | // Arguments for generated stub: |
duke@435 | 2547 | // from: O0 |
duke@435 | 2548 | // to: O1 |
duke@435 | 2549 | // count: O2 treated as signed |
duke@435 | 2550 | // |
iveresov@2595 | 2551 | address generate_conjoint_long_copy(bool aligned, address nooverlap_target, |
iveresov@2595 | 2552 | address *entry, const char *name) { |
duke@435 | 2553 | __ align(CodeEntryAlignment); |
duke@435 | 2554 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 2555 | address start = __ pc(); |
duke@435 | 2556 | |
iveresov@2606 | 2557 | assert(aligned, "Should always be aligned"); |
duke@435 | 2558 | |
duke@435 | 2559 | assert_clean_int(O2, O3); // Make sure 'count' is clean int. |
duke@435 | 2560 | |
iveresov@2595 | 2561 | if (entry != NULL) { |
iveresov@2595 | 2562 | *entry = __ pc(); |
iveresov@2595 | 2563 | // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) |
iveresov@2595 | 2564 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 2565 | } |
duke@435 | 2566 | |
duke@435 | 2567 | array_overlap_test(nooverlap_target, 3); |
duke@435 | 2568 | |
duke@435 | 2569 | generate_conjoint_long_copy_core(aligned); |
duke@435 | 2570 | |
duke@435 | 2571 | // O3, O4 are used as temp registers |
duke@435 | 2572 | inc_counter_np(SharedRuntime::_jlong_array_copy_ctr, O3, O4); |
duke@435 | 2573 | __ retl(); |
duke@435 | 2574 | __ delayed()->mov(G0, O0); // return 0 |
duke@435 | 2575 | return start; |
duke@435 | 2576 | } |
duke@435 | 2577 | |
duke@435 | 2578 | // Generate stub for disjoint oop copy. If "aligned" is true, the |
duke@435 | 2579 | // "from" and "to" addresses are assumed to be heapword aligned. |
duke@435 | 2580 | // |
duke@435 | 2581 | // Arguments for generated stub: |
duke@435 | 2582 | // from: O0 |
duke@435 | 2583 | // to: O1 |
duke@435 | 2584 | // count: O2 treated as signed |
duke@435 | 2585 | // |
iveresov@2606 | 2586 | address generate_disjoint_oop_copy(bool aligned, address *entry, const char *name, |
iveresov@2606 | 2587 | bool dest_uninitialized = false) { |
duke@435 | 2588 | |
duke@435 | 2589 | const Register from = O0; // source array address |
duke@435 | 2590 | const Register to = O1; // destination array address |
duke@435 | 2591 | const Register count = O2; // elements count |
duke@435 | 2592 | |
duke@435 | 2593 | __ align(CodeEntryAlignment); |
duke@435 | 2594 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 2595 | address start = __ pc(); |
duke@435 | 2596 | |
duke@435 | 2597 | assert_clean_int(count, O3); // Make sure 'count' is clean int. |
duke@435 | 2598 | |
iveresov@2595 | 2599 | if (entry != NULL) { |
iveresov@2595 | 2600 | *entry = __ pc(); |
iveresov@2595 | 2601 | // caller can pass a 64-bit byte count here |
iveresov@2595 | 2602 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 2603 | } |
duke@435 | 2604 | |
duke@435 | 2605 | // save arguments for barrier generation |
duke@435 | 2606 | __ mov(to, G1); |
duke@435 | 2607 | __ mov(count, G5); |
iveresov@2606 | 2608 | gen_write_ref_array_pre_barrier(G1, G5, dest_uninitialized); |
duke@435 | 2609 | #ifdef _LP64 |
coleenp@548 | 2610 | assert_clean_int(count, O3); // Make sure 'count' is clean int. |
coleenp@548 | 2611 | if (UseCompressedOops) { |
coleenp@548 | 2612 | generate_disjoint_int_copy_core(aligned); |
coleenp@548 | 2613 | } else { |
coleenp@548 | 2614 | generate_disjoint_long_copy_core(aligned); |
coleenp@548 | 2615 | } |
duke@435 | 2616 | #else |
duke@435 | 2617 | generate_disjoint_int_copy_core(aligned); |
duke@435 | 2618 | #endif |
duke@435 | 2619 | // O0 is used as temp register |
duke@435 | 2620 | gen_write_ref_array_post_barrier(G1, G5, O0); |
duke@435 | 2621 | |
duke@435 | 2622 | // O3, O4 are used as temp registers |
duke@435 | 2623 | inc_counter_np(SharedRuntime::_oop_array_copy_ctr, O3, O4); |
duke@435 | 2624 | __ retl(); |
duke@435 | 2625 | __ delayed()->mov(G0, O0); // return 0 |
duke@435 | 2626 | return start; |
duke@435 | 2627 | } |
duke@435 | 2628 | |
duke@435 | 2629 | // Generate stub for conjoint oop copy. If "aligned" is true, the |
duke@435 | 2630 | // "from" and "to" addresses are assumed to be heapword aligned. |
duke@435 | 2631 | // |
duke@435 | 2632 | // Arguments for generated stub: |
duke@435 | 2633 | // from: O0 |
duke@435 | 2634 | // to: O1 |
duke@435 | 2635 | // count: O2 treated as signed |
duke@435 | 2636 | // |
iveresov@2595 | 2637 | address generate_conjoint_oop_copy(bool aligned, address nooverlap_target, |
iveresov@2606 | 2638 | address *entry, const char *name, |
iveresov@2606 | 2639 | bool dest_uninitialized = false) { |
duke@435 | 2640 | |
duke@435 | 2641 | const Register from = O0; // source array address |
duke@435 | 2642 | const Register to = O1; // destination array address |
duke@435 | 2643 | const Register count = O2; // elements count |
duke@435 | 2644 | |
duke@435 | 2645 | __ align(CodeEntryAlignment); |
duke@435 | 2646 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 2647 | address start = __ pc(); |
duke@435 | 2648 | |
duke@435 | 2649 | assert_clean_int(count, O3); // Make sure 'count' is clean int. |
duke@435 | 2650 | |
iveresov@2595 | 2651 | if (entry != NULL) { |
iveresov@2595 | 2652 | *entry = __ pc(); |
iveresov@2595 | 2653 | // caller can pass a 64-bit byte count here |
iveresov@2595 | 2654 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 2655 | } |
iveresov@2595 | 2656 | |
iveresov@2595 | 2657 | array_overlap_test(nooverlap_target, LogBytesPerHeapOop); |
duke@435 | 2658 | |
duke@435 | 2659 | // save arguments for barrier generation |
duke@435 | 2660 | __ mov(to, G1); |
duke@435 | 2661 | __ mov(count, G5); |
iveresov@2606 | 2662 | gen_write_ref_array_pre_barrier(G1, G5, dest_uninitialized); |
duke@435 | 2663 | |
duke@435 | 2664 | #ifdef _LP64 |
coleenp@548 | 2665 | if (UseCompressedOops) { |
coleenp@548 | 2666 | generate_conjoint_int_copy_core(aligned); |
coleenp@548 | 2667 | } else { |
coleenp@548 | 2668 | generate_conjoint_long_copy_core(aligned); |
coleenp@548 | 2669 | } |
duke@435 | 2670 | #else |
duke@435 | 2671 | generate_conjoint_int_copy_core(aligned); |
duke@435 | 2672 | #endif |
duke@435 | 2673 | |
duke@435 | 2674 | // O0 is used as temp register |
duke@435 | 2675 | gen_write_ref_array_post_barrier(G1, G5, O0); |
duke@435 | 2676 | |
duke@435 | 2677 | // O3, O4 are used as temp registers |
duke@435 | 2678 | inc_counter_np(SharedRuntime::_oop_array_copy_ctr, O3, O4); |
duke@435 | 2679 | __ retl(); |
duke@435 | 2680 | __ delayed()->mov(G0, O0); // return 0 |
duke@435 | 2681 | return start; |
duke@435 | 2682 | } |
duke@435 | 2683 | |
duke@435 | 2684 | |
duke@435 | 2685 | // Helper for generating a dynamic type check. |
duke@435 | 2686 | // Smashes only the given temp registers. |
duke@435 | 2687 | void generate_type_check(Register sub_klass, |
duke@435 | 2688 | Register super_check_offset, |
duke@435 | 2689 | Register super_klass, |
duke@435 | 2690 | Register temp, |
jrose@1079 | 2691 | Label& L_success) { |
duke@435 | 2692 | assert_different_registers(sub_klass, super_check_offset, super_klass, temp); |
duke@435 | 2693 | |
duke@435 | 2694 | BLOCK_COMMENT("type_check:"); |
duke@435 | 2695 | |
jrose@1079 | 2696 | Label L_miss, L_pop_to_miss; |
duke@435 | 2697 | |
duke@435 | 2698 | assert_clean_int(super_check_offset, temp); |
duke@435 | 2699 | |
jrose@1079 | 2700 | __ check_klass_subtype_fast_path(sub_klass, super_klass, temp, noreg, |
jrose@1079 | 2701 | &L_success, &L_miss, NULL, |
jrose@1079 | 2702 | super_check_offset); |
jrose@1079 | 2703 | |
jrose@1079 | 2704 | BLOCK_COMMENT("type_check_slow_path:"); |
duke@435 | 2705 | __ save_frame(0); |
jrose@1079 | 2706 | __ check_klass_subtype_slow_path(sub_klass->after_save(), |
jrose@1079 | 2707 | super_klass->after_save(), |
jrose@1079 | 2708 | L0, L1, L2, L4, |
jrose@1079 | 2709 | NULL, &L_pop_to_miss); |
kvn@3037 | 2710 | __ ba(L_success); |
jrose@1079 | 2711 | __ delayed()->restore(); |
jrose@1079 | 2712 | |
jrose@1079 | 2713 | __ bind(L_pop_to_miss); |
duke@435 | 2714 | __ restore(); |
duke@435 | 2715 | |
duke@435 | 2716 | // Fall through on failure! |
duke@435 | 2717 | __ BIND(L_miss); |
duke@435 | 2718 | } |
duke@435 | 2719 | |
duke@435 | 2720 | |
duke@435 | 2721 | // Generate stub for checked oop copy. |
duke@435 | 2722 | // |
duke@435 | 2723 | // Arguments for generated stub: |
duke@435 | 2724 | // from: O0 |
duke@435 | 2725 | // to: O1 |
duke@435 | 2726 | // count: O2 treated as signed |
duke@435 | 2727 | // ckoff: O3 (super_check_offset) |
duke@435 | 2728 | // ckval: O4 (super_klass) |
duke@435 | 2729 | // ret: O0 zero for success; (-1^K) where K is partial transfer count |
duke@435 | 2730 | // |
iveresov@2606 | 2731 | address generate_checkcast_copy(const char *name, address *entry, bool dest_uninitialized = false) { |
duke@435 | 2732 | |
duke@435 | 2733 | const Register O0_from = O0; // source array address |
duke@435 | 2734 | const Register O1_to = O1; // destination array address |
duke@435 | 2735 | const Register O2_count = O2; // elements count |
duke@435 | 2736 | const Register O3_ckoff = O3; // super_check_offset |
duke@435 | 2737 | const Register O4_ckval = O4; // super_klass |
duke@435 | 2738 | |
duke@435 | 2739 | const Register O5_offset = O5; // loop var, with stride wordSize |
duke@435 | 2740 | const Register G1_remain = G1; // loop var, with stride -1 |
duke@435 | 2741 | const Register G3_oop = G3; // actual oop copied |
duke@435 | 2742 | const Register G4_klass = G4; // oop._klass |
duke@435 | 2743 | const Register G5_super = G5; // oop._klass._primary_supers[ckval] |
duke@435 | 2744 | |
duke@435 | 2745 | __ align(CodeEntryAlignment); |
duke@435 | 2746 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 2747 | address start = __ pc(); |
duke@435 | 2748 | |
duke@435 | 2749 | #ifdef ASSERT |
jrose@1079 | 2750 | // We sometimes save a frame (see generate_type_check below). |
duke@435 | 2751 | // If this will cause trouble, let's fail now instead of later. |
duke@435 | 2752 | __ save_frame(0); |
duke@435 | 2753 | __ restore(); |
duke@435 | 2754 | #endif |
duke@435 | 2755 | |
never@2199 | 2756 | assert_clean_int(O2_count, G1); // Make sure 'count' is clean int. |
never@2199 | 2757 | |
duke@435 | 2758 | #ifdef ASSERT |
duke@435 | 2759 | // caller guarantees that the arrays really are different |
duke@435 | 2760 | // otherwise, we would have to make conjoint checks |
duke@435 | 2761 | { Label L; |
duke@435 | 2762 | __ mov(O3, G1); // spill: overlap test smashes O3 |
duke@435 | 2763 | __ mov(O4, G4); // spill: overlap test smashes O4 |
coleenp@548 | 2764 | array_overlap_test(L, LogBytesPerHeapOop); |
duke@435 | 2765 | __ stop("checkcast_copy within a single array"); |
duke@435 | 2766 | __ bind(L); |
duke@435 | 2767 | __ mov(G1, O3); |
duke@435 | 2768 | __ mov(G4, O4); |
duke@435 | 2769 | } |
duke@435 | 2770 | #endif //ASSERT |
duke@435 | 2771 | |
iveresov@2595 | 2772 | if (entry != NULL) { |
iveresov@2595 | 2773 | *entry = __ pc(); |
iveresov@2595 | 2774 | // caller can pass a 64-bit byte count here (from generic stub) |
iveresov@2595 | 2775 | BLOCK_COMMENT("Entry:"); |
iveresov@2595 | 2776 | } |
iveresov@2606 | 2777 | gen_write_ref_array_pre_barrier(O1_to, O2_count, dest_uninitialized); |
duke@435 | 2778 | |
duke@435 | 2779 | Label load_element, store_element, do_card_marks, fail, done; |
duke@435 | 2780 | __ addcc(O2_count, 0, G1_remain); // initialize loop index, and test it |
duke@435 | 2781 | __ brx(Assembler::notZero, false, Assembler::pt, load_element); |
duke@435 | 2782 | __ delayed()->mov(G0, O5_offset); // offset from start of arrays |
duke@435 | 2783 | |
duke@435 | 2784 | // Empty array: Nothing to do. |
duke@435 | 2785 | inc_counter_np(SharedRuntime::_checkcast_array_copy_ctr, O3, O4); |
duke@435 | 2786 | __ retl(); |
duke@435 | 2787 | __ delayed()->set(0, O0); // return 0 on (trivial) success |
duke@435 | 2788 | |
duke@435 | 2789 | // ======== begin loop ======== |
duke@435 | 2790 | // (Loop is rotated; its entry is load_element.) |
duke@435 | 2791 | // Loop variables: |
duke@435 | 2792 | // (O5 = 0; ; O5 += wordSize) --- offset from src, dest arrays |
duke@435 | 2793 | // (O2 = len; O2 != 0; O2--) --- number of oops *remaining* |
duke@435 | 2794 | // G3, G4, G5 --- current oop, oop.klass, oop.klass.super |
kvn@1800 | 2795 | __ align(OptoLoopAlignment); |
duke@435 | 2796 | |
jrose@1079 | 2797 | __ BIND(store_element); |
jrose@1079 | 2798 | __ deccc(G1_remain); // decrement the count |
coleenp@548 | 2799 | __ store_heap_oop(G3_oop, O1_to, O5_offset); // store the oop |
coleenp@548 | 2800 | __ inc(O5_offset, heapOopSize); // step to next offset |
duke@435 | 2801 | __ brx(Assembler::zero, true, Assembler::pt, do_card_marks); |
duke@435 | 2802 | __ delayed()->set(0, O0); // return -1 on success |
duke@435 | 2803 | |
duke@435 | 2804 | // ======== loop entry is here ======== |
jrose@1079 | 2805 | __ BIND(load_element); |
coleenp@548 | 2806 | __ load_heap_oop(O0_from, O5_offset, G3_oop); // load the oop |
kvn@3037 | 2807 | __ br_null_short(G3_oop, Assembler::pt, store_element); |
duke@435 | 2808 | |
coleenp@548 | 2809 | __ load_klass(G3_oop, G4_klass); // query the object klass |
duke@435 | 2810 | |
duke@435 | 2811 | generate_type_check(G4_klass, O3_ckoff, O4_ckval, G5_super, |
duke@435 | 2812 | // branch to this on success: |
jrose@1079 | 2813 | store_element); |
duke@435 | 2814 | // ======== end loop ======== |
duke@435 | 2815 | |
duke@435 | 2816 | // It was a real error; we must depend on the caller to finish the job. |
duke@435 | 2817 | // Register G1 has number of *remaining* oops, O2 number of *total* oops. |
duke@435 | 2818 | // Emit GC store barriers for the oops we have copied (O2 minus G1), |
duke@435 | 2819 | // and report their number to the caller. |
jrose@1079 | 2820 | __ BIND(fail); |
duke@435 | 2821 | __ subcc(O2_count, G1_remain, O2_count); |
duke@435 | 2822 | __ brx(Assembler::zero, false, Assembler::pt, done); |
duke@435 | 2823 | __ delayed()->not1(O2_count, O0); // report (-1^K) to caller |
duke@435 | 2824 | |
jrose@1079 | 2825 | __ BIND(do_card_marks); |
duke@435 | 2826 | gen_write_ref_array_post_barrier(O1_to, O2_count, O3); // store check on O1[0..O2] |
duke@435 | 2827 | |
jrose@1079 | 2828 | __ BIND(done); |
duke@435 | 2829 | inc_counter_np(SharedRuntime::_checkcast_array_copy_ctr, O3, O4); |
duke@435 | 2830 | __ retl(); |
duke@435 | 2831 | __ delayed()->nop(); // return value in 00 |
duke@435 | 2832 | |
duke@435 | 2833 | return start; |
duke@435 | 2834 | } |
duke@435 | 2835 | |
duke@435 | 2836 | |
duke@435 | 2837 | // Generate 'unsafe' array copy stub |
duke@435 | 2838 | // Though just as safe as the other stubs, it takes an unscaled |
duke@435 | 2839 | // size_t argument instead of an element count. |
duke@435 | 2840 | // |
duke@435 | 2841 | // Arguments for generated stub: |
duke@435 | 2842 | // from: O0 |
duke@435 | 2843 | // to: O1 |
duke@435 | 2844 | // count: O2 byte count, treated as ssize_t, can be zero |
duke@435 | 2845 | // |
duke@435 | 2846 | // Examines the alignment of the operands and dispatches |
duke@435 | 2847 | // to a long, int, short, or byte copy loop. |
duke@435 | 2848 | // |
iveresov@2595 | 2849 | address generate_unsafe_copy(const char* name, |
iveresov@2595 | 2850 | address byte_copy_entry, |
iveresov@2595 | 2851 | address short_copy_entry, |
iveresov@2595 | 2852 | address int_copy_entry, |
iveresov@2595 | 2853 | address long_copy_entry) { |
duke@435 | 2854 | |
duke@435 | 2855 | const Register O0_from = O0; // source array address |
duke@435 | 2856 | const Register O1_to = O1; // destination array address |
duke@435 | 2857 | const Register O2_count = O2; // elements count |
duke@435 | 2858 | |
duke@435 | 2859 | const Register G1_bits = G1; // test copy of low bits |
duke@435 | 2860 | |
duke@435 | 2861 | __ align(CodeEntryAlignment); |
duke@435 | 2862 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 2863 | address start = __ pc(); |
duke@435 | 2864 | |
duke@435 | 2865 | // bump this on entry, not on exit: |
duke@435 | 2866 | inc_counter_np(SharedRuntime::_unsafe_array_copy_ctr, G1, G3); |
duke@435 | 2867 | |
duke@435 | 2868 | __ or3(O0_from, O1_to, G1_bits); |
duke@435 | 2869 | __ or3(O2_count, G1_bits, G1_bits); |
duke@435 | 2870 | |
duke@435 | 2871 | __ btst(BytesPerLong-1, G1_bits); |
duke@435 | 2872 | __ br(Assembler::zero, true, Assembler::pt, |
duke@435 | 2873 | long_copy_entry, relocInfo::runtime_call_type); |
duke@435 | 2874 | // scale the count on the way out: |
duke@435 | 2875 | __ delayed()->srax(O2_count, LogBytesPerLong, O2_count); |
duke@435 | 2876 | |
duke@435 | 2877 | __ btst(BytesPerInt-1, G1_bits); |
duke@435 | 2878 | __ br(Assembler::zero, true, Assembler::pt, |
duke@435 | 2879 | int_copy_entry, relocInfo::runtime_call_type); |
duke@435 | 2880 | // scale the count on the way out: |
duke@435 | 2881 | __ delayed()->srax(O2_count, LogBytesPerInt, O2_count); |
duke@435 | 2882 | |
duke@435 | 2883 | __ btst(BytesPerShort-1, G1_bits); |
duke@435 | 2884 | __ br(Assembler::zero, true, Assembler::pt, |
duke@435 | 2885 | short_copy_entry, relocInfo::runtime_call_type); |
duke@435 | 2886 | // scale the count on the way out: |
duke@435 | 2887 | __ delayed()->srax(O2_count, LogBytesPerShort, O2_count); |
duke@435 | 2888 | |
duke@435 | 2889 | __ br(Assembler::always, false, Assembler::pt, |
duke@435 | 2890 | byte_copy_entry, relocInfo::runtime_call_type); |
duke@435 | 2891 | __ delayed()->nop(); |
duke@435 | 2892 | |
duke@435 | 2893 | return start; |
duke@435 | 2894 | } |
duke@435 | 2895 | |
duke@435 | 2896 | |
duke@435 | 2897 | // Perform range checks on the proposed arraycopy. |
duke@435 | 2898 | // Kills the two temps, but nothing else. |
duke@435 | 2899 | // Also, clean the sign bits of src_pos and dst_pos. |
duke@435 | 2900 | void arraycopy_range_checks(Register src, // source array oop (O0) |
duke@435 | 2901 | Register src_pos, // source position (O1) |
duke@435 | 2902 | Register dst, // destination array oo (O2) |
duke@435 | 2903 | Register dst_pos, // destination position (O3) |
duke@435 | 2904 | Register length, // length of copy (O4) |
duke@435 | 2905 | Register temp1, Register temp2, |
duke@435 | 2906 | Label& L_failed) { |
duke@435 | 2907 | BLOCK_COMMENT("arraycopy_range_checks:"); |
duke@435 | 2908 | |
duke@435 | 2909 | // if (src_pos + length > arrayOop(src)->length() ) FAIL; |
duke@435 | 2910 | |
duke@435 | 2911 | const Register array_length = temp1; // scratch |
duke@435 | 2912 | const Register end_pos = temp2; // scratch |
duke@435 | 2913 | |
duke@435 | 2914 | // Note: This next instruction may be in the delay slot of a branch: |
duke@435 | 2915 | __ add(length, src_pos, end_pos); // src_pos + length |
duke@435 | 2916 | __ lduw(src, arrayOopDesc::length_offset_in_bytes(), array_length); |
duke@435 | 2917 | __ cmp(end_pos, array_length); |
duke@435 | 2918 | __ br(Assembler::greater, false, Assembler::pn, L_failed); |
duke@435 | 2919 | |
duke@435 | 2920 | // if (dst_pos + length > arrayOop(dst)->length() ) FAIL; |
duke@435 | 2921 | __ delayed()->add(length, dst_pos, end_pos); // dst_pos + length |
duke@435 | 2922 | __ lduw(dst, arrayOopDesc::length_offset_in_bytes(), array_length); |
duke@435 | 2923 | __ cmp(end_pos, array_length); |
duke@435 | 2924 | __ br(Assembler::greater, false, Assembler::pn, L_failed); |
duke@435 | 2925 | |
duke@435 | 2926 | // Have to clean up high 32-bits of 'src_pos' and 'dst_pos'. |
duke@435 | 2927 | // Move with sign extension can be used since they are positive. |
duke@435 | 2928 | __ delayed()->signx(src_pos, src_pos); |
duke@435 | 2929 | __ signx(dst_pos, dst_pos); |
duke@435 | 2930 | |
duke@435 | 2931 | BLOCK_COMMENT("arraycopy_range_checks done"); |
duke@435 | 2932 | } |
duke@435 | 2933 | |
duke@435 | 2934 | |
duke@435 | 2935 | // |
duke@435 | 2936 | // Generate generic array copy stubs |
duke@435 | 2937 | // |
duke@435 | 2938 | // Input: |
duke@435 | 2939 | // O0 - src oop |
duke@435 | 2940 | // O1 - src_pos |
duke@435 | 2941 | // O2 - dst oop |
duke@435 | 2942 | // O3 - dst_pos |
duke@435 | 2943 | // O4 - element count |
duke@435 | 2944 | // |
duke@435 | 2945 | // Output: |
duke@435 | 2946 | // O0 == 0 - success |
duke@435 | 2947 | // O0 == -1 - need to call System.arraycopy |
duke@435 | 2948 | // |
iveresov@2595 | 2949 | address generate_generic_copy(const char *name, |
iveresov@2595 | 2950 | address entry_jbyte_arraycopy, |
iveresov@2595 | 2951 | address entry_jshort_arraycopy, |
iveresov@2595 | 2952 | address entry_jint_arraycopy, |
iveresov@2595 | 2953 | address entry_oop_arraycopy, |
iveresov@2595 | 2954 | address entry_jlong_arraycopy, |
iveresov@2595 | 2955 | address entry_checkcast_arraycopy) { |
duke@435 | 2956 | Label L_failed, L_objArray; |
duke@435 | 2957 | |
duke@435 | 2958 | // Input registers |
duke@435 | 2959 | const Register src = O0; // source array oop |
duke@435 | 2960 | const Register src_pos = O1; // source position |
duke@435 | 2961 | const Register dst = O2; // destination array oop |
duke@435 | 2962 | const Register dst_pos = O3; // destination position |
duke@435 | 2963 | const Register length = O4; // elements count |
duke@435 | 2964 | |
duke@435 | 2965 | // registers used as temp |
duke@435 | 2966 | const Register G3_src_klass = G3; // source array klass |
duke@435 | 2967 | const Register G4_dst_klass = G4; // destination array klass |
duke@435 | 2968 | const Register G5_lh = G5; // layout handler |
duke@435 | 2969 | const Register O5_temp = O5; |
duke@435 | 2970 | |
duke@435 | 2971 | __ align(CodeEntryAlignment); |
duke@435 | 2972 | StubCodeMark mark(this, "StubRoutines", name); |
duke@435 | 2973 | address start = __ pc(); |
duke@435 | 2974 | |
duke@435 | 2975 | // bump this on entry, not on exit: |
duke@435 | 2976 | inc_counter_np(SharedRuntime::_generic_array_copy_ctr, G1, G3); |
duke@435 | 2977 | |
duke@435 | 2978 | // In principle, the int arguments could be dirty. |
duke@435 | 2979 | //assert_clean_int(src_pos, G1); |
duke@435 | 2980 | //assert_clean_int(dst_pos, G1); |
duke@435 | 2981 | //assert_clean_int(length, G1); |
duke@435 | 2982 | |
duke@435 | 2983 | //----------------------------------------------------------------------- |
duke@435 | 2984 | // Assembler stubs will be used for this call to arraycopy |
duke@435 | 2985 | // if the following conditions are met: |
duke@435 | 2986 | // |
duke@435 | 2987 | // (1) src and dst must not be null. |
duke@435 | 2988 | // (2) src_pos must not be negative. |
duke@435 | 2989 | // (3) dst_pos must not be negative. |
duke@435 | 2990 | // (4) length must not be negative. |
duke@435 | 2991 | // (5) src klass and dst klass should be the same and not NULL. |
duke@435 | 2992 | // (6) src and dst should be arrays. |
duke@435 | 2993 | // (7) src_pos + length must not exceed length of src. |
duke@435 | 2994 | // (8) dst_pos + length must not exceed length of dst. |
duke@435 | 2995 | BLOCK_COMMENT("arraycopy initial argument checks"); |
duke@435 | 2996 | |
duke@435 | 2997 | // if (src == NULL) return -1; |
duke@435 | 2998 | __ br_null(src, false, Assembler::pn, L_failed); |
duke@435 | 2999 | |
duke@435 | 3000 | // if (src_pos < 0) return -1; |
duke@435 | 3001 | __ delayed()->tst(src_pos); |
duke@435 | 3002 | __ br(Assembler::negative, false, Assembler::pn, L_failed); |
duke@435 | 3003 | __ delayed()->nop(); |
duke@435 | 3004 | |
duke@435 | 3005 | // if (dst == NULL) return -1; |
duke@435 | 3006 | __ br_null(dst, false, Assembler::pn, L_failed); |
duke@435 | 3007 | |
duke@435 | 3008 | // if (dst_pos < 0) return -1; |
duke@435 | 3009 | __ delayed()->tst(dst_pos); |
duke@435 | 3010 | __ br(Assembler::negative, false, Assembler::pn, L_failed); |
duke@435 | 3011 | |
duke@435 | 3012 | // if (length < 0) return -1; |
duke@435 | 3013 | __ delayed()->tst(length); |
duke@435 | 3014 | __ br(Assembler::negative, false, Assembler::pn, L_failed); |
duke@435 | 3015 | |
duke@435 | 3016 | BLOCK_COMMENT("arraycopy argument klass checks"); |
duke@435 | 3017 | // get src->klass() |
coleenp@4037 | 3018 | if (UseCompressedKlassPointers) { |
coleenp@548 | 3019 | __ delayed()->nop(); // ??? not good |
coleenp@548 | 3020 | __ load_klass(src, G3_src_klass); |
coleenp@548 | 3021 | } else { |
coleenp@548 | 3022 | __ delayed()->ld_ptr(src, oopDesc::klass_offset_in_bytes(), G3_src_klass); |
coleenp@548 | 3023 | } |
duke@435 | 3024 | |
duke@435 | 3025 | #ifdef ASSERT |
duke@435 | 3026 | // assert(src->klass() != NULL); |
duke@435 | 3027 | BLOCK_COMMENT("assert klasses not null"); |
duke@435 | 3028 | { Label L_a, L_b; |
kvn@3037 | 3029 | __ br_notnull_short(G3_src_klass, Assembler::pt, L_b); // it is broken if klass is NULL |
duke@435 | 3030 | __ bind(L_a); |
duke@435 | 3031 | __ stop("broken null klass"); |
duke@435 | 3032 | __ bind(L_b); |
coleenp@548 | 3033 | __ load_klass(dst, G4_dst_klass); |
duke@435 | 3034 | __ br_null(G4_dst_klass, false, Assembler::pn, L_a); // this would be broken also |
duke@435 | 3035 | __ delayed()->mov(G0, G4_dst_klass); // scribble the temp |
duke@435 | 3036 | BLOCK_COMMENT("assert done"); |
duke@435 | 3037 | } |
duke@435 | 3038 | #endif |
duke@435 | 3039 | |
duke@435 | 3040 | // Load layout helper |
duke@435 | 3041 | // |
duke@435 | 3042 | // |array_tag| | header_size | element_type | |log2_element_size| |
duke@435 | 3043 | // 32 30 24 16 8 2 0 |
duke@435 | 3044 | // |
duke@435 | 3045 | // array_tag: typeArray = 0x3, objArray = 0x2, non-array = 0x0 |
duke@435 | 3046 | // |
duke@435 | 3047 | |
stefank@3391 | 3048 | int lh_offset = in_bytes(Klass::layout_helper_offset()); |
duke@435 | 3049 | |
duke@435 | 3050 | // Load 32-bits signed value. Use br() instruction with it to check icc. |
duke@435 | 3051 | __ lduw(G3_src_klass, lh_offset, G5_lh); |
duke@435 | 3052 | |
coleenp@4037 | 3053 | if (UseCompressedKlassPointers) { |
coleenp@548 | 3054 | __ load_klass(dst, G4_dst_klass); |
coleenp@548 | 3055 | } |
duke@435 | 3056 | // Handle objArrays completely differently... |
duke@435 | 3057 | juint objArray_lh = Klass::array_layout_helper(T_OBJECT); |
duke@435 | 3058 | __ set(objArray_lh, O5_temp); |
duke@435 | 3059 | __ cmp(G5_lh, O5_temp); |
duke@435 | 3060 | __ br(Assembler::equal, false, Assembler::pt, L_objArray); |
coleenp@4037 | 3061 | if (UseCompressedKlassPointers) { |
coleenp@548 | 3062 | __ delayed()->nop(); |
coleenp@548 | 3063 | } else { |
coleenp@548 | 3064 | __ delayed()->ld_ptr(dst, oopDesc::klass_offset_in_bytes(), G4_dst_klass); |
coleenp@548 | 3065 | } |
duke@435 | 3066 | |
duke@435 | 3067 | // if (src->klass() != dst->klass()) return -1; |
kvn@3037 | 3068 | __ cmp_and_brx_short(G3_src_klass, G4_dst_klass, Assembler::notEqual, Assembler::pn, L_failed); |
duke@435 | 3069 | |
duke@435 | 3070 | // if (!src->is_Array()) return -1; |
duke@435 | 3071 | __ cmp(G5_lh, Klass::_lh_neutral_value); // < 0 |
duke@435 | 3072 | __ br(Assembler::greaterEqual, false, Assembler::pn, L_failed); |
duke@435 | 3073 | |
duke@435 | 3074 | // At this point, it is known to be a typeArray (array_tag 0x3). |
duke@435 | 3075 | #ifdef ASSERT |
duke@435 | 3076 | __ delayed()->nop(); |
duke@435 | 3077 | { Label L; |
duke@435 | 3078 | jint lh_prim_tag_in_place = (Klass::_lh_array_tag_type_value << Klass::_lh_array_tag_shift); |
duke@435 | 3079 | __ set(lh_prim_tag_in_place, O5_temp); |
duke@435 | 3080 | __ cmp(G5_lh, O5_temp); |
duke@435 | 3081 | __ br(Assembler::greaterEqual, false, Assembler::pt, L); |
duke@435 | 3082 | __ delayed()->nop(); |
duke@435 | 3083 | __ stop("must be a primitive array"); |
duke@435 | 3084 | __ bind(L); |
duke@435 | 3085 | } |
duke@435 | 3086 | #else |
duke@435 | 3087 | __ delayed(); // match next insn to prev branch |
duke@435 | 3088 | #endif |
duke@435 | 3089 | |
duke@435 | 3090 | arraycopy_range_checks(src, src_pos, dst, dst_pos, length, |
duke@435 | 3091 | O5_temp, G4_dst_klass, L_failed); |
duke@435 | 3092 | |
coleenp@4142 | 3093 | // TypeArrayKlass |
duke@435 | 3094 | // |
duke@435 | 3095 | // src_addr = (src + array_header_in_bytes()) + (src_pos << log2elemsize); |
duke@435 | 3096 | // dst_addr = (dst + array_header_in_bytes()) + (dst_pos << log2elemsize); |
duke@435 | 3097 | // |
duke@435 | 3098 | |
duke@435 | 3099 | const Register G4_offset = G4_dst_klass; // array offset |
duke@435 | 3100 | const Register G3_elsize = G3_src_klass; // log2 element size |
duke@435 | 3101 | |
duke@435 | 3102 | __ srl(G5_lh, Klass::_lh_header_size_shift, G4_offset); |
duke@435 | 3103 | __ and3(G4_offset, Klass::_lh_header_size_mask, G4_offset); // array_offset |
duke@435 | 3104 | __ add(src, G4_offset, src); // src array offset |
duke@435 | 3105 | __ add(dst, G4_offset, dst); // dst array offset |
duke@435 | 3106 | __ and3(G5_lh, Klass::_lh_log2_element_size_mask, G3_elsize); // log2 element size |
duke@435 | 3107 | |
duke@435 | 3108 | // next registers should be set before the jump to corresponding stub |
duke@435 | 3109 | const Register from = O0; // source array address |
duke@435 | 3110 | const Register to = O1; // destination array address |
duke@435 | 3111 | const Register count = O2; // elements count |
duke@435 | 3112 | |
duke@435 | 3113 | // 'from', 'to', 'count' registers should be set in this order |
duke@435 | 3114 | // since they are the same as 'src', 'src_pos', 'dst'. |
duke@435 | 3115 | |
duke@435 | 3116 | BLOCK_COMMENT("scale indexes to element size"); |
duke@435 | 3117 | __ sll_ptr(src_pos, G3_elsize, src_pos); |
duke@435 | 3118 | __ sll_ptr(dst_pos, G3_elsize, dst_pos); |
duke@435 | 3119 | __ add(src, src_pos, from); // src_addr |
duke@435 | 3120 | __ add(dst, dst_pos, to); // dst_addr |
duke@435 | 3121 | |
duke@435 | 3122 | BLOCK_COMMENT("choose copy loop based on element size"); |
duke@435 | 3123 | __ cmp(G3_elsize, 0); |
iveresov@2595 | 3124 | __ br(Assembler::equal, true, Assembler::pt, entry_jbyte_arraycopy); |
duke@435 | 3125 | __ delayed()->signx(length, count); // length |
duke@435 | 3126 | |
duke@435 | 3127 | __ cmp(G3_elsize, LogBytesPerShort); |
iveresov@2595 | 3128 | __ br(Assembler::equal, true, Assembler::pt, entry_jshort_arraycopy); |
duke@435 | 3129 | __ delayed()->signx(length, count); // length |
duke@435 | 3130 | |
duke@435 | 3131 | __ cmp(G3_elsize, LogBytesPerInt); |
iveresov@2595 | 3132 | __ br(Assembler::equal, true, Assembler::pt, entry_jint_arraycopy); |
duke@435 | 3133 | __ delayed()->signx(length, count); // length |
duke@435 | 3134 | #ifdef ASSERT |
duke@435 | 3135 | { Label L; |
kvn@3037 | 3136 | __ cmp_and_br_short(G3_elsize, LogBytesPerLong, Assembler::equal, Assembler::pt, L); |
duke@435 | 3137 | __ stop("must be long copy, but elsize is wrong"); |
duke@435 | 3138 | __ bind(L); |
duke@435 | 3139 | } |
duke@435 | 3140 | #endif |
iveresov@2595 | 3141 | __ br(Assembler::always, false, Assembler::pt, entry_jlong_arraycopy); |
duke@435 | 3142 | __ delayed()->signx(length, count); // length |
duke@435 | 3143 | |
coleenp@4142 | 3144 | // ObjArrayKlass |
duke@435 | 3145 | __ BIND(L_objArray); |
duke@435 | 3146 | // live at this point: G3_src_klass, G4_dst_klass, src[_pos], dst[_pos], length |
duke@435 | 3147 | |
duke@435 | 3148 | Label L_plain_copy, L_checkcast_copy; |
duke@435 | 3149 | // test array classes for subtyping |
duke@435 | 3150 | __ cmp(G3_src_klass, G4_dst_klass); // usual case is exact equality |
duke@435 | 3151 | __ brx(Assembler::notEqual, true, Assembler::pn, L_checkcast_copy); |
duke@435 | 3152 | __ delayed()->lduw(G4_dst_klass, lh_offset, O5_temp); // hoisted from below |
duke@435 | 3153 | |
duke@435 | 3154 | // Identically typed arrays can be copied without element-wise checks. |
duke@435 | 3155 | arraycopy_range_checks(src, src_pos, dst, dst_pos, length, |
duke@435 | 3156 | O5_temp, G5_lh, L_failed); |
duke@435 | 3157 | |
duke@435 | 3158 | __ add(src, arrayOopDesc::base_offset_in_bytes(T_OBJECT), src); //src offset |
duke@435 | 3159 | __ add(dst, arrayOopDesc::base_offset_in_bytes(T_OBJECT), dst); //dst offset |
coleenp@548 | 3160 | __ sll_ptr(src_pos, LogBytesPerHeapOop, src_pos); |
coleenp@548 | 3161 | __ sll_ptr(dst_pos, LogBytesPerHeapOop, dst_pos); |
duke@435 | 3162 | __ add(src, src_pos, from); // src_addr |
duke@435 | 3163 | __ add(dst, dst_pos, to); // dst_addr |
duke@435 | 3164 | __ BIND(L_plain_copy); |
iveresov@2595 | 3165 | __ br(Assembler::always, false, Assembler::pt, entry_oop_arraycopy); |
duke@435 | 3166 | __ delayed()->signx(length, count); // length |
duke@435 | 3167 | |
duke@435 | 3168 | __ BIND(L_checkcast_copy); |
duke@435 | 3169 | // live at this point: G3_src_klass, G4_dst_klass |
duke@435 | 3170 | { |
duke@435 | 3171 | // Before looking at dst.length, make sure dst is also an objArray. |
duke@435 | 3172 | // lduw(G4_dst_klass, lh_offset, O5_temp); // hoisted to delay slot |
duke@435 | 3173 | __ cmp(G5_lh, O5_temp); |
duke@435 | 3174 | __ br(Assembler::notEqual, false, Assembler::pn, L_failed); |
duke@435 | 3175 | |
duke@435 | 3176 | // It is safe to examine both src.length and dst.length. |
duke@435 | 3177 | __ delayed(); // match next insn to prev branch |
duke@435 | 3178 | arraycopy_range_checks(src, src_pos, dst, dst_pos, length, |
duke@435 | 3179 | O5_temp, G5_lh, L_failed); |
duke@435 | 3180 | |
duke@435 | 3181 | // Marshal the base address arguments now, freeing registers. |
duke@435 | 3182 | __ add(src, arrayOopDesc::base_offset_in_bytes(T_OBJECT), src); //src offset |
duke@435 | 3183 | __ add(dst, arrayOopDesc::base_offset_in_bytes(T_OBJECT), dst); //dst offset |
coleenp@548 | 3184 | __ sll_ptr(src_pos, LogBytesPerHeapOop, src_pos); |
coleenp@548 | 3185 | __ sll_ptr(dst_pos, LogBytesPerHeapOop, dst_pos); |
duke@435 | 3186 | __ add(src, src_pos, from); // src_addr |
duke@435 | 3187 | __ add(dst, dst_pos, to); // dst_addr |
duke@435 | 3188 | __ signx(length, count); // length (reloaded) |
duke@435 | 3189 | |
duke@435 | 3190 | Register sco_temp = O3; // this register is free now |
duke@435 | 3191 | assert_different_registers(from, to, count, sco_temp, |
duke@435 | 3192 | G4_dst_klass, G3_src_klass); |
duke@435 | 3193 | |
duke@435 | 3194 | // Generate the type check. |
stefank@3391 | 3195 | int sco_offset = in_bytes(Klass::super_check_offset_offset()); |
duke@435 | 3196 | __ lduw(G4_dst_klass, sco_offset, sco_temp); |
duke@435 | 3197 | generate_type_check(G3_src_klass, sco_temp, G4_dst_klass, |
duke@435 | 3198 | O5_temp, L_plain_copy); |
duke@435 | 3199 | |
coleenp@4142 | 3200 | // Fetch destination element klass from the ObjArrayKlass header. |
coleenp@4142 | 3201 | int ek_offset = in_bytes(ObjArrayKlass::element_klass_offset()); |
duke@435 | 3202 | |
duke@435 | 3203 | // the checkcast_copy loop needs two extra arguments: |
duke@435 | 3204 | __ ld_ptr(G4_dst_klass, ek_offset, O4); // dest elem klass |
duke@435 | 3205 | // lduw(O4, sco_offset, O3); // sco of elem klass |
duke@435 | 3206 | |
iveresov@2595 | 3207 | __ br(Assembler::always, false, Assembler::pt, entry_checkcast_arraycopy); |
duke@435 | 3208 | __ delayed()->lduw(O4, sco_offset, O3); |
duke@435 | 3209 | } |
duke@435 | 3210 | |
duke@435 | 3211 | __ BIND(L_failed); |
duke@435 | 3212 | __ retl(); |
duke@435 | 3213 | __ delayed()->sub(G0, 1, O0); // return -1 |
duke@435 | 3214 | return start; |
duke@435 | 3215 | } |
duke@435 | 3216 | |
kvn@3092 | 3217 | // |
kvn@3092 | 3218 | // Generate stub for heap zeroing. |
kvn@3092 | 3219 | // "to" address is aligned to jlong (8 bytes). |
kvn@3092 | 3220 | // |
kvn@3092 | 3221 | // Arguments for generated stub: |
kvn@3092 | 3222 | // to: O0 |
kvn@3092 | 3223 | // count: O1 treated as signed (count of HeapWord) |
kvn@3092 | 3224 | // count could be 0 |
kvn@3092 | 3225 | // |
kvn@3092 | 3226 | address generate_zero_aligned_words(const char* name) { |
kvn@3092 | 3227 | __ align(CodeEntryAlignment); |
kvn@3092 | 3228 | StubCodeMark mark(this, "StubRoutines", name); |
kvn@3092 | 3229 | address start = __ pc(); |
kvn@3092 | 3230 | |
kvn@3092 | 3231 | const Register to = O0; // source array address |
kvn@3092 | 3232 | const Register count = O1; // HeapWords count |
kvn@3092 | 3233 | const Register temp = O2; // scratch |
kvn@3092 | 3234 | |
kvn@3092 | 3235 | Label Ldone; |
kvn@3092 | 3236 | __ sllx(count, LogHeapWordSize, count); // to bytes count |
kvn@3092 | 3237 | // Use BIS for zeroing |
kvn@3092 | 3238 | __ bis_zeroing(to, count, temp, Ldone); |
kvn@3092 | 3239 | __ bind(Ldone); |
kvn@3092 | 3240 | __ retl(); |
kvn@3092 | 3241 | __ delayed()->nop(); |
kvn@3092 | 3242 | return start; |
kvn@3092 | 3243 | } |
kvn@3092 | 3244 | |
duke@435 | 3245 | void generate_arraycopy_stubs() { |
iveresov@2595 | 3246 | address entry; |
iveresov@2595 | 3247 | address entry_jbyte_arraycopy; |
iveresov@2595 | 3248 | address entry_jshort_arraycopy; |
iveresov@2595 | 3249 | address entry_jint_arraycopy; |
iveresov@2595 | 3250 | address entry_oop_arraycopy; |
iveresov@2595 | 3251 | address entry_jlong_arraycopy; |
iveresov@2595 | 3252 | address entry_checkcast_arraycopy; |
iveresov@2595 | 3253 | |
iveresov@2606 | 3254 | //*** jbyte |
iveresov@2606 | 3255 | // Always need aligned and unaligned versions |
iveresov@2606 | 3256 | StubRoutines::_jbyte_disjoint_arraycopy = generate_disjoint_byte_copy(false, &entry, |
iveresov@2606 | 3257 | "jbyte_disjoint_arraycopy"); |
iveresov@2606 | 3258 | StubRoutines::_jbyte_arraycopy = generate_conjoint_byte_copy(false, entry, |
iveresov@2606 | 3259 | &entry_jbyte_arraycopy, |
iveresov@2606 | 3260 | "jbyte_arraycopy"); |
iveresov@2606 | 3261 | StubRoutines::_arrayof_jbyte_disjoint_arraycopy = generate_disjoint_byte_copy(true, &entry, |
iveresov@2606 | 3262 | "arrayof_jbyte_disjoint_arraycopy"); |
iveresov@2606 | 3263 | StubRoutines::_arrayof_jbyte_arraycopy = generate_conjoint_byte_copy(true, entry, NULL, |
iveresov@2606 | 3264 | "arrayof_jbyte_arraycopy"); |
iveresov@2606 | 3265 | |
iveresov@2606 | 3266 | //*** jshort |
iveresov@2606 | 3267 | // Always need aligned and unaligned versions |
iveresov@2606 | 3268 | StubRoutines::_jshort_disjoint_arraycopy = generate_disjoint_short_copy(false, &entry, |
iveresov@2606 | 3269 | "jshort_disjoint_arraycopy"); |
iveresov@2606 | 3270 | StubRoutines::_jshort_arraycopy = generate_conjoint_short_copy(false, entry, |
iveresov@2606 | 3271 | &entry_jshort_arraycopy, |
iveresov@2606 | 3272 | "jshort_arraycopy"); |
iveresov@2595 | 3273 | StubRoutines::_arrayof_jshort_disjoint_arraycopy = generate_disjoint_short_copy(true, &entry, |
iveresov@2595 | 3274 | "arrayof_jshort_disjoint_arraycopy"); |
iveresov@2595 | 3275 | StubRoutines::_arrayof_jshort_arraycopy = generate_conjoint_short_copy(true, entry, NULL, |
iveresov@2595 | 3276 | "arrayof_jshort_arraycopy"); |
iveresov@2595 | 3277 | |
iveresov@2606 | 3278 | //*** jint |
iveresov@2606 | 3279 | // Aligned versions |
iveresov@2606 | 3280 | StubRoutines::_arrayof_jint_disjoint_arraycopy = generate_disjoint_int_copy(true, &entry, |
iveresov@2606 | 3281 | "arrayof_jint_disjoint_arraycopy"); |
iveresov@2606 | 3282 | StubRoutines::_arrayof_jint_arraycopy = generate_conjoint_int_copy(true, entry, &entry_jint_arraycopy, |
iveresov@2606 | 3283 | "arrayof_jint_arraycopy"); |
duke@435 | 3284 | #ifdef _LP64 |
iveresov@2606 | 3285 | // In 64 bit we need both aligned and unaligned versions of jint arraycopy. |
iveresov@2606 | 3286 | // entry_jint_arraycopy always points to the unaligned version (notice that we overwrite it). |
iveresov@2606 | 3287 | StubRoutines::_jint_disjoint_arraycopy = generate_disjoint_int_copy(false, &entry, |
iveresov@2606 | 3288 | "jint_disjoint_arraycopy"); |
iveresov@2606 | 3289 | StubRoutines::_jint_arraycopy = generate_conjoint_int_copy(false, entry, |
iveresov@2606 | 3290 | &entry_jint_arraycopy, |
iveresov@2606 | 3291 | "jint_arraycopy"); |
iveresov@2606 | 3292 | #else |
iveresov@2606 | 3293 | // In 32 bit jints are always HeapWordSize aligned, so always use the aligned version |
iveresov@2606 | 3294 | // (in fact in 32bit we always have a pre-loop part even in the aligned version, |
iveresov@2606 | 3295 | // because it uses 64-bit loads/stores, so the aligned flag is actually ignored). |
iveresov@2606 | 3296 | StubRoutines::_jint_disjoint_arraycopy = StubRoutines::_arrayof_jint_disjoint_arraycopy; |
iveresov@2606 | 3297 | StubRoutines::_jint_arraycopy = StubRoutines::_arrayof_jint_arraycopy; |
duke@435 | 3298 | #endif |
iveresov@2595 | 3299 | |
iveresov@2606 | 3300 | |
iveresov@2606 | 3301 | //*** jlong |
iveresov@2606 | 3302 | // It is always aligned |
iveresov@2606 | 3303 | StubRoutines::_arrayof_jlong_disjoint_arraycopy = generate_disjoint_long_copy(true, &entry, |
iveresov@2606 | 3304 | "arrayof_jlong_disjoint_arraycopy"); |
iveresov@2606 | 3305 | StubRoutines::_arrayof_jlong_arraycopy = generate_conjoint_long_copy(true, entry, &entry_jlong_arraycopy, |
iveresov@2606 | 3306 | "arrayof_jlong_arraycopy"); |
iveresov@2606 | 3307 | StubRoutines::_jlong_disjoint_arraycopy = StubRoutines::_arrayof_jlong_disjoint_arraycopy; |
iveresov@2606 | 3308 | StubRoutines::_jlong_arraycopy = StubRoutines::_arrayof_jlong_arraycopy; |
iveresov@2606 | 3309 | |
iveresov@2606 | 3310 | |
iveresov@2606 | 3311 | //*** oops |
iveresov@2606 | 3312 | // Aligned versions |
iveresov@2606 | 3313 | StubRoutines::_arrayof_oop_disjoint_arraycopy = generate_disjoint_oop_copy(true, &entry, |
iveresov@2606 | 3314 | "arrayof_oop_disjoint_arraycopy"); |
iveresov@2606 | 3315 | StubRoutines::_arrayof_oop_arraycopy = generate_conjoint_oop_copy(true, entry, &entry_oop_arraycopy, |
iveresov@2606 | 3316 | "arrayof_oop_arraycopy"); |
iveresov@2606 | 3317 | // Aligned versions without pre-barriers |
iveresov@2606 | 3318 | StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit = generate_disjoint_oop_copy(true, &entry, |
iveresov@2606 | 3319 | "arrayof_oop_disjoint_arraycopy_uninit", |
iveresov@2606 | 3320 | /*dest_uninitialized*/true); |
iveresov@2606 | 3321 | StubRoutines::_arrayof_oop_arraycopy_uninit = generate_conjoint_oop_copy(true, entry, NULL, |
iveresov@2606 | 3322 | "arrayof_oop_arraycopy_uninit", |
iveresov@2606 | 3323 | /*dest_uninitialized*/true); |
iveresov@2606 | 3324 | #ifdef _LP64 |
iveresov@2606 | 3325 | if (UseCompressedOops) { |
iveresov@2606 | 3326 | // With compressed oops we need unaligned versions, notice that we overwrite entry_oop_arraycopy. |
iveresov@2606 | 3327 | StubRoutines::_oop_disjoint_arraycopy = generate_disjoint_oop_copy(false, &entry, |
iveresov@2606 | 3328 | "oop_disjoint_arraycopy"); |
iveresov@2606 | 3329 | StubRoutines::_oop_arraycopy = generate_conjoint_oop_copy(false, entry, &entry_oop_arraycopy, |
iveresov@2606 | 3330 | "oop_arraycopy"); |
iveresov@2606 | 3331 | // Unaligned versions without pre-barriers |
iveresov@2606 | 3332 | StubRoutines::_oop_disjoint_arraycopy_uninit = generate_disjoint_oop_copy(false, &entry, |
iveresov@2606 | 3333 | "oop_disjoint_arraycopy_uninit", |
iveresov@2606 | 3334 | /*dest_uninitialized*/true); |
iveresov@2606 | 3335 | StubRoutines::_oop_arraycopy_uninit = generate_conjoint_oop_copy(false, entry, NULL, |
iveresov@2606 | 3336 | "oop_arraycopy_uninit", |
iveresov@2606 | 3337 | /*dest_uninitialized*/true); |
iveresov@2606 | 3338 | } else |
iveresov@2606 | 3339 | #endif |
iveresov@2606 | 3340 | { |
iveresov@2606 | 3341 | // oop arraycopy is always aligned on 32bit and 64bit without compressed oops |
iveresov@2606 | 3342 | StubRoutines::_oop_disjoint_arraycopy = StubRoutines::_arrayof_oop_disjoint_arraycopy; |
iveresov@2606 | 3343 | StubRoutines::_oop_arraycopy = StubRoutines::_arrayof_oop_arraycopy; |
iveresov@2606 | 3344 | StubRoutines::_oop_disjoint_arraycopy_uninit = StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit; |
iveresov@2606 | 3345 | StubRoutines::_oop_arraycopy_uninit = StubRoutines::_arrayof_oop_arraycopy_uninit; |
iveresov@2606 | 3346 | } |
iveresov@2606 | 3347 | |
iveresov@2606 | 3348 | StubRoutines::_checkcast_arraycopy = generate_checkcast_copy("checkcast_arraycopy", &entry_checkcast_arraycopy); |
iveresov@2606 | 3349 | StubRoutines::_checkcast_arraycopy_uninit = generate_checkcast_copy("checkcast_arraycopy_uninit", NULL, |
iveresov@2606 | 3350 | /*dest_uninitialized*/true); |
iveresov@2606 | 3351 | |
iveresov@2595 | 3352 | StubRoutines::_unsafe_arraycopy = generate_unsafe_copy("unsafe_arraycopy", |
iveresov@2595 | 3353 | entry_jbyte_arraycopy, |
iveresov@2595 | 3354 | entry_jshort_arraycopy, |
iveresov@2595 | 3355 | entry_jint_arraycopy, |
iveresov@2595 | 3356 | entry_jlong_arraycopy); |
iveresov@2595 | 3357 | StubRoutines::_generic_arraycopy = generate_generic_copy("generic_arraycopy", |
iveresov@2595 | 3358 | entry_jbyte_arraycopy, |
iveresov@2595 | 3359 | entry_jshort_arraycopy, |
iveresov@2595 | 3360 | entry_jint_arraycopy, |
iveresov@2595 | 3361 | entry_oop_arraycopy, |
iveresov@2595 | 3362 | entry_jlong_arraycopy, |
iveresov@2595 | 3363 | entry_checkcast_arraycopy); |
never@2118 | 3364 | |
never@2118 | 3365 | StubRoutines::_jbyte_fill = generate_fill(T_BYTE, false, "jbyte_fill"); |
never@2118 | 3366 | StubRoutines::_jshort_fill = generate_fill(T_SHORT, false, "jshort_fill"); |
never@2118 | 3367 | StubRoutines::_jint_fill = generate_fill(T_INT, false, "jint_fill"); |
never@2118 | 3368 | StubRoutines::_arrayof_jbyte_fill = generate_fill(T_BYTE, true, "arrayof_jbyte_fill"); |
never@2118 | 3369 | StubRoutines::_arrayof_jshort_fill = generate_fill(T_SHORT, true, "arrayof_jshort_fill"); |
never@2118 | 3370 | StubRoutines::_arrayof_jint_fill = generate_fill(T_INT, true, "arrayof_jint_fill"); |
kvn@3092 | 3371 | |
kvn@3092 | 3372 | if (UseBlockZeroing) { |
kvn@3092 | 3373 | StubRoutines::_zero_aligned_words = generate_zero_aligned_words("zero_aligned_words"); |
kvn@3092 | 3374 | } |
duke@435 | 3375 | } |
duke@435 | 3376 | |
duke@435 | 3377 | void generate_initial() { |
duke@435 | 3378 | // Generates all stubs and initializes the entry points |
duke@435 | 3379 | |
duke@435 | 3380 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 3381 | // entry points that exist in all platforms |
duke@435 | 3382 | // Note: This is code that could be shared among different platforms - however the benefit seems to be smaller than |
duke@435 | 3383 | // the disadvantage of having a much more complicated generator structure. See also comment in stubRoutines.hpp. |
duke@435 | 3384 | StubRoutines::_forward_exception_entry = generate_forward_exception(); |
duke@435 | 3385 | |
duke@435 | 3386 | StubRoutines::_call_stub_entry = generate_call_stub(StubRoutines::_call_stub_return_address); |
duke@435 | 3387 | StubRoutines::_catch_exception_entry = generate_catch_exception(); |
duke@435 | 3388 | |
duke@435 | 3389 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 3390 | // entry points that are platform specific |
duke@435 | 3391 | StubRoutines::Sparc::_test_stop_entry = generate_test_stop(); |
duke@435 | 3392 | |
duke@435 | 3393 | StubRoutines::Sparc::_stop_subroutine_entry = generate_stop_subroutine(); |
duke@435 | 3394 | StubRoutines::Sparc::_flush_callers_register_windows_entry = generate_flush_callers_register_windows(); |
duke@435 | 3395 | |
duke@435 | 3396 | #if !defined(COMPILER2) && !defined(_LP64) |
duke@435 | 3397 | StubRoutines::_atomic_xchg_entry = generate_atomic_xchg(); |
duke@435 | 3398 | StubRoutines::_atomic_cmpxchg_entry = generate_atomic_cmpxchg(); |
duke@435 | 3399 | StubRoutines::_atomic_add_entry = generate_atomic_add(); |
duke@435 | 3400 | StubRoutines::_atomic_xchg_ptr_entry = StubRoutines::_atomic_xchg_entry; |
duke@435 | 3401 | StubRoutines::_atomic_cmpxchg_ptr_entry = StubRoutines::_atomic_cmpxchg_entry; |
duke@435 | 3402 | StubRoutines::_atomic_cmpxchg_long_entry = generate_atomic_cmpxchg_long(); |
duke@435 | 3403 | StubRoutines::_atomic_add_ptr_entry = StubRoutines::_atomic_add_entry; |
duke@435 | 3404 | #endif // COMPILER2 !=> _LP64 |
never@2978 | 3405 | |
bdelsart@3372 | 3406 | // Build this early so it's available for the interpreter. |
bdelsart@3372 | 3407 | StubRoutines::_throw_StackOverflowError_entry = generate_throw_exception("StackOverflowError throw_exception", CAST_FROM_FN_PTR(address, SharedRuntime::throw_StackOverflowError)); |
duke@435 | 3408 | } |
duke@435 | 3409 | |
duke@435 | 3410 | |
duke@435 | 3411 | void generate_all() { |
duke@435 | 3412 | // Generates all stubs and initializes the entry points |
duke@435 | 3413 | |
kvn@1077 | 3414 | // Generate partial_subtype_check first here since its code depends on |
kvn@1077 | 3415 | // UseZeroBaseCompressedOops which is defined after heap initialization. |
kvn@1077 | 3416 | StubRoutines::Sparc::_partial_subtype_check = generate_partial_subtype_check(); |
duke@435 | 3417 | // These entry points require SharedInfo::stack0 to be set up in non-core builds |
never@3136 | 3418 | StubRoutines::_throw_AbstractMethodError_entry = generate_throw_exception("AbstractMethodError throw_exception", CAST_FROM_FN_PTR(address, SharedRuntime::throw_AbstractMethodError)); |
never@3136 | 3419 | StubRoutines::_throw_IncompatibleClassChangeError_entry= generate_throw_exception("IncompatibleClassChangeError throw_exception", CAST_FROM_FN_PTR(address, SharedRuntime::throw_IncompatibleClassChangeError)); |
never@3136 | 3420 | StubRoutines::_throw_NullPointerException_at_call_entry= generate_throw_exception("NullPointerException at call throw_exception", CAST_FROM_FN_PTR(address, SharedRuntime::throw_NullPointerException_at_call)); |
duke@435 | 3421 | |
duke@435 | 3422 | StubRoutines::_handler_for_unsafe_access_entry = |
duke@435 | 3423 | generate_handler_for_unsafe_access(); |
duke@435 | 3424 | |
duke@435 | 3425 | // support for verify_oop (must happen after universe_init) |
duke@435 | 3426 | StubRoutines::_verify_oop_subroutine_entry = generate_verify_oop_subroutine(); |
duke@435 | 3427 | |
duke@435 | 3428 | // arraycopy stubs used by compilers |
duke@435 | 3429 | generate_arraycopy_stubs(); |
never@1609 | 3430 | |
never@1609 | 3431 | // Don't initialize the platform math functions since sparc |
never@1609 | 3432 | // doesn't have intrinsics for these operations. |
duke@435 | 3433 | } |
duke@435 | 3434 | |
duke@435 | 3435 | |
duke@435 | 3436 | public: |
duke@435 | 3437 | StubGenerator(CodeBuffer* code, bool all) : StubCodeGenerator(code) { |
duke@435 | 3438 | // replace the standard masm with a special one: |
duke@435 | 3439 | _masm = new MacroAssembler(code); |
duke@435 | 3440 | |
duke@435 | 3441 | _stub_count = !all ? 0x100 : 0x200; |
duke@435 | 3442 | if (all) { |
duke@435 | 3443 | generate_all(); |
duke@435 | 3444 | } else { |
duke@435 | 3445 | generate_initial(); |
duke@435 | 3446 | } |
duke@435 | 3447 | |
duke@435 | 3448 | // make sure this stub is available for all local calls |
duke@435 | 3449 | if (_atomic_add_stub.is_unbound()) { |
duke@435 | 3450 | // generate a second time, if necessary |
duke@435 | 3451 | (void) generate_atomic_add(); |
duke@435 | 3452 | } |
duke@435 | 3453 | } |
duke@435 | 3454 | |
duke@435 | 3455 | |
duke@435 | 3456 | private: |
duke@435 | 3457 | int _stub_count; |
duke@435 | 3458 | void stub_prolog(StubCodeDesc* cdesc) { |
duke@435 | 3459 | # ifdef ASSERT |
duke@435 | 3460 | // put extra information in the stub code, to make it more readable |
duke@435 | 3461 | #ifdef _LP64 |
duke@435 | 3462 | // Write the high part of the address |
duke@435 | 3463 | // [RGV] Check if there is a dependency on the size of this prolog |
duke@435 | 3464 | __ emit_data((intptr_t)cdesc >> 32, relocInfo::none); |
duke@435 | 3465 | #endif |
duke@435 | 3466 | __ emit_data((intptr_t)cdesc, relocInfo::none); |
duke@435 | 3467 | __ emit_data(++_stub_count, relocInfo::none); |
duke@435 | 3468 | # endif |
duke@435 | 3469 | align(true); |
duke@435 | 3470 | } |
duke@435 | 3471 | |
duke@435 | 3472 | void align(bool at_header = false) { |
duke@435 | 3473 | // %%%%% move this constant somewhere else |
duke@435 | 3474 | // UltraSPARC cache line size is 8 instructions: |
duke@435 | 3475 | const unsigned int icache_line_size = 32; |
duke@435 | 3476 | const unsigned int icache_half_line_size = 16; |
duke@435 | 3477 | |
duke@435 | 3478 | if (at_header) { |
duke@435 | 3479 | while ((intptr_t)(__ pc()) % icache_line_size != 0) { |
duke@435 | 3480 | __ emit_data(0, relocInfo::none); |
duke@435 | 3481 | } |
duke@435 | 3482 | } else { |
duke@435 | 3483 | while ((intptr_t)(__ pc()) % icache_half_line_size != 0) { |
duke@435 | 3484 | __ nop(); |
duke@435 | 3485 | } |
duke@435 | 3486 | } |
duke@435 | 3487 | } |
duke@435 | 3488 | |
duke@435 | 3489 | }; // end class declaration |
duke@435 | 3490 | |
duke@435 | 3491 | void StubGenerator_generate(CodeBuffer* code, bool all) { |
duke@435 | 3492 | StubGenerator g(code, all); |
duke@435 | 3493 | } |