src/cpu/sparc/vm/c1_Runtime1_sparc.cpp

Tue, 08 Oct 2013 17:35:51 +0200

author
mgerdin
date
Tue, 08 Oct 2013 17:35:51 +0200
changeset 5860
69944b868a32
parent 5628
f98f5d48f511
child 5922
f50418dfb1b7
permissions
-rw-r--r--

8014555: G1: Memory ordering problem with Conc refinement and card marking
Summary: Add a StoreLoad barrier in the G1 post-barrier to fix a race with concurrent refinement. Also-reviewed-by: martin.doerr@sap.com
Reviewed-by: iveresov, tschatzl, brutisso, roland, kvn

duke@435 1 /*
coleenp@4037 2 * Copyright (c) 1999, 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"
stefank@2314 26 #include "c1/c1_Defs.hpp"
stefank@2314 27 #include "c1/c1_MacroAssembler.hpp"
stefank@2314 28 #include "c1/c1_Runtime1.hpp"
stefank@2314 29 #include "interpreter/interpreter.hpp"
stefank@2314 30 #include "nativeInst_sparc.hpp"
coleenp@4037 31 #include "oops/compiledICHolder.hpp"
stefank@2314 32 #include "oops/oop.inline.hpp"
stefank@2314 33 #include "prims/jvmtiExport.hpp"
stefank@2314 34 #include "register_sparc.hpp"
stefank@2314 35 #include "runtime/sharedRuntime.hpp"
stefank@2314 36 #include "runtime/signature.hpp"
stefank@2314 37 #include "runtime/vframeArray.hpp"
jprovino@4542 38 #include "utilities/macros.hpp"
stefank@2314 39 #include "vmreg_sparc.inline.hpp"
mgerdin@5860 40 #if INCLUDE_ALL_GCS
mgerdin@5860 41 #include "gc_implementation/g1/g1SATBCardTableModRefBS.hpp"
mgerdin@5860 42 #endif
duke@435 43
duke@435 44 // Implementation of StubAssembler
duke@435 45
coleenp@4037 46 int StubAssembler::call_RT(Register oop_result1, Register metadata_result, address entry_point, int number_of_arguments) {
duke@435 47 // for sparc changing the number of arguments doesn't change
duke@435 48 // anything about the frame size so we'll always lie and claim that
duke@435 49 // we are only passing 1 argument.
duke@435 50 set_num_rt_args(1);
duke@435 51
duke@435 52 assert_not_delayed();
duke@435 53 // bang stack before going to runtime
duke@435 54 set(-os::vm_page_size() + STACK_BIAS, G3_scratch);
duke@435 55 st(G0, SP, G3_scratch);
duke@435 56
duke@435 57 // debugging support
duke@435 58 assert(number_of_arguments >= 0 , "cannot have negative number of arguments");
duke@435 59
duke@435 60 set_last_Java_frame(SP, noreg);
duke@435 61 if (VerifyThread) mov(G2_thread, O0); // about to be smashed; pass early
duke@435 62 save_thread(L7_thread_cache);
duke@435 63 // do the call
duke@435 64 call(entry_point, relocInfo::runtime_call_type);
duke@435 65 if (!VerifyThread) {
duke@435 66 delayed()->mov(G2_thread, O0); // pass thread as first argument
duke@435 67 } else {
duke@435 68 delayed()->nop(); // (thread already passed)
duke@435 69 }
duke@435 70 int call_offset = offset(); // offset of return address
duke@435 71 restore_thread(L7_thread_cache);
duke@435 72 reset_last_Java_frame();
duke@435 73
duke@435 74 // check for pending exceptions
duke@435 75 { Label L;
twisti@1162 76 Address exception_addr(G2_thread, Thread::pending_exception_offset());
duke@435 77 ld_ptr(exception_addr, Gtemp);
kvn@3037 78 br_null_short(Gtemp, pt, L);
twisti@1162 79 Address vm_result_addr(G2_thread, JavaThread::vm_result_offset());
duke@435 80 st_ptr(G0, vm_result_addr);
twisti@1162 81 Address vm_result_addr_2(G2_thread, JavaThread::vm_result_2_offset());
duke@435 82 st_ptr(G0, vm_result_addr_2);
duke@435 83
duke@435 84 if (frame_size() == no_frame_size) {
duke@435 85 // we use O7 linkage so that forward_exception_entry has the issuing PC
duke@435 86 call(StubRoutines::forward_exception_entry(), relocInfo::runtime_call_type);
duke@435 87 delayed()->restore();
duke@435 88 } else if (_stub_id == Runtime1::forward_exception_id) {
duke@435 89 should_not_reach_here();
duke@435 90 } else {
twisti@1162 91 AddressLiteral exc(Runtime1::entry_for(Runtime1::forward_exception_id));
twisti@1162 92 jump_to(exc, G4);
duke@435 93 delayed()->nop();
duke@435 94 }
duke@435 95 bind(L);
duke@435 96 }
duke@435 97
duke@435 98 // get oop result if there is one and reset the value in the thread
duke@435 99 if (oop_result1->is_valid()) { // get oop result if there is one and reset it in the thread
duke@435 100 get_vm_result (oop_result1);
duke@435 101 } else {
duke@435 102 // be a little paranoid and clear the result
twisti@1162 103 Address vm_result_addr(G2_thread, JavaThread::vm_result_offset());
duke@435 104 st_ptr(G0, vm_result_addr);
duke@435 105 }
duke@435 106
coleenp@4037 107 // get second result if there is one and reset the value in the thread
coleenp@4037 108 if (metadata_result->is_valid()) {
coleenp@4037 109 get_vm_result_2 (metadata_result);
duke@435 110 } else {
duke@435 111 // be a little paranoid and clear the result
twisti@1162 112 Address vm_result_addr_2(G2_thread, JavaThread::vm_result_2_offset());
duke@435 113 st_ptr(G0, vm_result_addr_2);
duke@435 114 }
duke@435 115
duke@435 116 return call_offset;
duke@435 117 }
duke@435 118
duke@435 119
coleenp@4037 120 int StubAssembler::call_RT(Register oop_result1, Register metadata_result, address entry, Register arg1) {
duke@435 121 // O0 is reserved for the thread
duke@435 122 mov(arg1, O1);
coleenp@4037 123 return call_RT(oop_result1, metadata_result, entry, 1);
duke@435 124 }
duke@435 125
duke@435 126
coleenp@4037 127 int StubAssembler::call_RT(Register oop_result1, Register metadata_result, address entry, Register arg1, Register arg2) {
duke@435 128 // O0 is reserved for the thread
duke@435 129 mov(arg1, O1);
duke@435 130 mov(arg2, O2); assert(arg2 != O1, "smashed argument");
coleenp@4037 131 return call_RT(oop_result1, metadata_result, entry, 2);
duke@435 132 }
duke@435 133
duke@435 134
coleenp@4037 135 int StubAssembler::call_RT(Register oop_result1, Register metadata_result, address entry, Register arg1, Register arg2, Register arg3) {
duke@435 136 // O0 is reserved for the thread
duke@435 137 mov(arg1, O1);
duke@435 138 mov(arg2, O2); assert(arg2 != O1, "smashed argument");
duke@435 139 mov(arg3, O3); assert(arg3 != O1 && arg3 != O2, "smashed argument");
coleenp@4037 140 return call_RT(oop_result1, metadata_result, entry, 3);
duke@435 141 }
duke@435 142
duke@435 143
duke@435 144 // Implementation of Runtime1
duke@435 145
duke@435 146 #define __ sasm->
duke@435 147
duke@435 148 static int cpu_reg_save_offsets[FrameMap::nof_cpu_regs];
duke@435 149 static int fpu_reg_save_offsets[FrameMap::nof_fpu_regs];
duke@435 150 static int reg_save_size_in_words;
duke@435 151 static int frame_size_in_bytes = -1;
duke@435 152
duke@435 153 static OopMap* generate_oop_map(StubAssembler* sasm, bool save_fpu_registers) {
duke@435 154 assert(frame_size_in_bytes == __ total_frame_size_in_bytes(reg_save_size_in_words),
twisti@2603 155 "mismatch in calculation");
duke@435 156 sasm->set_frame_size(frame_size_in_bytes / BytesPerWord);
duke@435 157 int frame_size_in_slots = frame_size_in_bytes / sizeof(jint);
duke@435 158 OopMap* oop_map = new OopMap(frame_size_in_slots, 0);
duke@435 159
duke@435 160 int i;
duke@435 161 for (i = 0; i < FrameMap::nof_cpu_regs; i++) {
duke@435 162 Register r = as_Register(i);
duke@435 163 if (r == G1 || r == G3 || r == G4 || r == G5) {
duke@435 164 int sp_offset = cpu_reg_save_offsets[i];
duke@435 165 oop_map->set_callee_saved(VMRegImpl::stack2reg(sp_offset),
duke@435 166 r->as_VMReg());
duke@435 167 }
duke@435 168 }
duke@435 169
duke@435 170 if (save_fpu_registers) {
duke@435 171 for (i = 0; i < FrameMap::nof_fpu_regs; i++) {
duke@435 172 FloatRegister r = as_FloatRegister(i);
duke@435 173 int sp_offset = fpu_reg_save_offsets[i];
duke@435 174 oop_map->set_callee_saved(VMRegImpl::stack2reg(sp_offset),
duke@435 175 r->as_VMReg());
duke@435 176 }
duke@435 177 }
duke@435 178 return oop_map;
duke@435 179 }
duke@435 180
duke@435 181 static OopMap* save_live_registers(StubAssembler* sasm, bool save_fpu_registers = true) {
duke@435 182 assert(frame_size_in_bytes == __ total_frame_size_in_bytes(reg_save_size_in_words),
twisti@2603 183 "mismatch in calculation");
duke@435 184 __ save_frame_c1(frame_size_in_bytes);
duke@435 185
duke@435 186 // Record volatile registers as callee-save values in an OopMap so their save locations will be
duke@435 187 // propagated to the caller frame's RegisterMap during StackFrameStream construction (needed for
duke@435 188 // deoptimization; see compiledVFrame::create_stack_value). The caller's I, L and O registers
duke@435 189 // are saved in register windows - I's and L's in the caller's frame and O's in the stub frame
duke@435 190 // (as the stub's I's) when the runtime routine called by the stub creates its frame.
duke@435 191 // OopMap frame sizes are in c2 stack slot sizes (sizeof(jint))
duke@435 192
duke@435 193 int i;
duke@435 194 for (i = 0; i < FrameMap::nof_cpu_regs; i++) {
duke@435 195 Register r = as_Register(i);
duke@435 196 if (r == G1 || r == G3 || r == G4 || r == G5) {
duke@435 197 int sp_offset = cpu_reg_save_offsets[i];
duke@435 198 __ st_ptr(r, SP, (sp_offset * BytesPerWord) + STACK_BIAS);
duke@435 199 }
duke@435 200 }
duke@435 201
duke@435 202 if (save_fpu_registers) {
duke@435 203 for (i = 0; i < FrameMap::nof_fpu_regs; i++) {
duke@435 204 FloatRegister r = as_FloatRegister(i);
duke@435 205 int sp_offset = fpu_reg_save_offsets[i];
duke@435 206 __ stf(FloatRegisterImpl::S, r, SP, (sp_offset * BytesPerWord) + STACK_BIAS);
duke@435 207 }
duke@435 208 }
duke@435 209
duke@435 210 return generate_oop_map(sasm, save_fpu_registers);
duke@435 211 }
duke@435 212
duke@435 213 static void restore_live_registers(StubAssembler* sasm, bool restore_fpu_registers = true) {
duke@435 214 for (int i = 0; i < FrameMap::nof_cpu_regs; i++) {
duke@435 215 Register r = as_Register(i);
duke@435 216 if (r == G1 || r == G3 || r == G4 || r == G5) {
duke@435 217 __ ld_ptr(SP, (cpu_reg_save_offsets[i] * BytesPerWord) + STACK_BIAS, r);
duke@435 218 }
duke@435 219 }
duke@435 220
duke@435 221 if (restore_fpu_registers) {
duke@435 222 for (int i = 0; i < FrameMap::nof_fpu_regs; i++) {
duke@435 223 FloatRegister r = as_FloatRegister(i);
duke@435 224 __ ldf(FloatRegisterImpl::S, SP, (fpu_reg_save_offsets[i] * BytesPerWord) + STACK_BIAS, r);
duke@435 225 }
duke@435 226 }
duke@435 227 }
duke@435 228
duke@435 229
duke@435 230 void Runtime1::initialize_pd() {
duke@435 231 // compute word offsets from SP at which live (non-windowed) registers are captured by stub routines
duke@435 232 //
duke@435 233 // A stub routine will have a frame that is at least large enough to hold
duke@435 234 // a register window save area (obviously) and the volatile g registers
duke@435 235 // and floating registers. A user of save_live_registers can have a frame
duke@435 236 // that has more scratch area in it (although typically they will use L-regs).
duke@435 237 // in that case the frame will look like this (stack growing down)
duke@435 238 //
duke@435 239 // FP -> | |
duke@435 240 // | scratch mem |
duke@435 241 // | " " |
duke@435 242 // --------------
duke@435 243 // | float regs |
duke@435 244 // | " " |
duke@435 245 // ---------------
duke@435 246 // | G regs |
duke@435 247 // | " " |
duke@435 248 // ---------------
duke@435 249 // | abi reg. |
duke@435 250 // | window save |
duke@435 251 // | area |
duke@435 252 // SP -> ---------------
duke@435 253 //
duke@435 254 int i;
duke@435 255 int sp_offset = round_to(frame::register_save_words, 2); // start doubleword aligned
duke@435 256
duke@435 257 // only G int registers are saved explicitly; others are found in register windows
duke@435 258 for (i = 0; i < FrameMap::nof_cpu_regs; i++) {
duke@435 259 Register r = as_Register(i);
duke@435 260 if (r == G1 || r == G3 || r == G4 || r == G5) {
duke@435 261 cpu_reg_save_offsets[i] = sp_offset;
duke@435 262 sp_offset++;
duke@435 263 }
duke@435 264 }
duke@435 265
duke@435 266 // all float registers are saved explicitly
duke@435 267 assert(FrameMap::nof_fpu_regs == 32, "double registers not handled here");
duke@435 268 for (i = 0; i < FrameMap::nof_fpu_regs; i++) {
duke@435 269 fpu_reg_save_offsets[i] = sp_offset;
duke@435 270 sp_offset++;
duke@435 271 }
duke@435 272 reg_save_size_in_words = sp_offset - frame::memory_parameter_word_sp_offset;
duke@435 273 // this should match assembler::total_frame_size_in_bytes, which
duke@435 274 // isn't callable from this context. It's checked by an assert when
duke@435 275 // it's used though.
duke@435 276 frame_size_in_bytes = align_size_up(sp_offset * wordSize, 8);
duke@435 277 }
duke@435 278
duke@435 279
duke@435 280 OopMapSet* Runtime1::generate_exception_throw(StubAssembler* sasm, address target, bool has_argument) {
duke@435 281 // make a frame and preserve the caller's caller-save registers
duke@435 282 OopMap* oop_map = save_live_registers(sasm);
duke@435 283 int call_offset;
duke@435 284 if (!has_argument) {
duke@435 285 call_offset = __ call_RT(noreg, noreg, target);
duke@435 286 } else {
duke@435 287 call_offset = __ call_RT(noreg, noreg, target, G4);
duke@435 288 }
duke@435 289 OopMapSet* oop_maps = new OopMapSet();
duke@435 290 oop_maps->add_gc_map(call_offset, oop_map);
duke@435 291
duke@435 292 __ should_not_reach_here();
duke@435 293 return oop_maps;
duke@435 294 }
duke@435 295
duke@435 296
duke@435 297 OopMapSet* Runtime1::generate_stub_call(StubAssembler* sasm, Register result, address target,
duke@435 298 Register arg1, Register arg2, Register arg3) {
duke@435 299 // make a frame and preserve the caller's caller-save registers
duke@435 300 OopMap* oop_map = save_live_registers(sasm);
duke@435 301
duke@435 302 int call_offset;
duke@435 303 if (arg1 == noreg) {
duke@435 304 call_offset = __ call_RT(result, noreg, target);
duke@435 305 } else if (arg2 == noreg) {
duke@435 306 call_offset = __ call_RT(result, noreg, target, arg1);
duke@435 307 } else if (arg3 == noreg) {
duke@435 308 call_offset = __ call_RT(result, noreg, target, arg1, arg2);
duke@435 309 } else {
duke@435 310 call_offset = __ call_RT(result, noreg, target, arg1, arg2, arg3);
duke@435 311 }
duke@435 312 OopMapSet* oop_maps = NULL;
duke@435 313
duke@435 314 oop_maps = new OopMapSet();
duke@435 315 oop_maps->add_gc_map(call_offset, oop_map);
duke@435 316 restore_live_registers(sasm);
duke@435 317
duke@435 318 __ ret();
duke@435 319 __ delayed()->restore();
duke@435 320
duke@435 321 return oop_maps;
duke@435 322 }
duke@435 323
duke@435 324
duke@435 325 OopMapSet* Runtime1::generate_patching(StubAssembler* sasm, address target) {
duke@435 326 // make a frame and preserve the caller's caller-save registers
duke@435 327 OopMap* oop_map = save_live_registers(sasm);
duke@435 328
duke@435 329 // call the runtime patching routine, returns non-zero if nmethod got deopted.
duke@435 330 int call_offset = __ call_RT(noreg, noreg, target);
duke@435 331 OopMapSet* oop_maps = new OopMapSet();
duke@435 332 oop_maps->add_gc_map(call_offset, oop_map);
duke@435 333
duke@435 334 // re-execute the patched instruction or, if the nmethod was deoptmized, return to the
duke@435 335 // deoptimization handler entry that will cause re-execution of the current bytecode
duke@435 336 DeoptimizationBlob* deopt_blob = SharedRuntime::deopt_blob();
duke@435 337 assert(deopt_blob != NULL, "deoptimization blob must have been created");
duke@435 338
duke@435 339 Label no_deopt;
kvn@3037 340 __ br_null_short(O0, Assembler::pt, no_deopt);
duke@435 341
duke@435 342 // return to the deoptimization handler entry for unpacking and rexecute
duke@435 343 // if we simply returned the we'd deopt as if any call we patched had just
duke@435 344 // returned.
duke@435 345
duke@435 346 restore_live_registers(sasm);
iveresov@2476 347
iveresov@2476 348 AddressLiteral dest(deopt_blob->unpack_with_reexecution());
iveresov@2476 349 __ jump_to(dest, O0);
iveresov@2476 350 __ delayed()->restore();
duke@435 351
duke@435 352 __ bind(no_deopt);
duke@435 353 restore_live_registers(sasm);
duke@435 354 __ ret();
duke@435 355 __ delayed()->restore();
duke@435 356
duke@435 357 return oop_maps;
duke@435 358 }
duke@435 359
duke@435 360 OopMapSet* Runtime1::generate_code_for(StubID id, StubAssembler* sasm) {
duke@435 361
duke@435 362 OopMapSet* oop_maps = NULL;
duke@435 363 // for better readability
duke@435 364 const bool must_gc_arguments = true;
duke@435 365 const bool dont_gc_arguments = false;
duke@435 366
duke@435 367 // stub code & info for the different stubs
duke@435 368 switch (id) {
duke@435 369 case forward_exception_id:
duke@435 370 {
twisti@2603 371 oop_maps = generate_handle_exception(id, sasm);
duke@435 372 }
duke@435 373 break;
duke@435 374
duke@435 375 case new_instance_id:
duke@435 376 case fast_new_instance_id:
duke@435 377 case fast_new_instance_init_check_id:
duke@435 378 {
duke@435 379 Register G5_klass = G5; // Incoming
duke@435 380 Register O0_obj = O0; // Outgoing
duke@435 381
duke@435 382 if (id == new_instance_id) {
duke@435 383 __ set_info("new_instance", dont_gc_arguments);
duke@435 384 } else if (id == fast_new_instance_id) {
duke@435 385 __ set_info("fast new_instance", dont_gc_arguments);
duke@435 386 } else {
duke@435 387 assert(id == fast_new_instance_init_check_id, "bad StubID");
duke@435 388 __ set_info("fast new_instance init check", dont_gc_arguments);
duke@435 389 }
duke@435 390
duke@435 391 if ((id == fast_new_instance_id || id == fast_new_instance_init_check_id) &&
duke@435 392 UseTLAB && FastTLABRefill) {
duke@435 393 Label slow_path;
duke@435 394 Register G1_obj_size = G1;
duke@435 395 Register G3_t1 = G3;
duke@435 396 Register G4_t2 = G4;
duke@435 397 assert_different_registers(G5_klass, G1_obj_size, G3_t1, G4_t2);
duke@435 398
duke@435 399 // Push a frame since we may do dtrace notification for the
duke@435 400 // allocation which requires calling out and we don't want
duke@435 401 // to stomp the real return address.
duke@435 402 __ save_frame(0);
duke@435 403
duke@435 404 if (id == fast_new_instance_init_check_id) {
duke@435 405 // make sure the klass is initialized
coleenp@4037 406 __ ldub(G5_klass, in_bytes(InstanceKlass::init_state_offset()), G3_t1);
coleenp@4037 407 __ cmp_and_br_short(G3_t1, InstanceKlass::fully_initialized, Assembler::notEqual, Assembler::pn, slow_path);
duke@435 408 }
duke@435 409 #ifdef ASSERT
duke@435 410 // assert object can be fast path allocated
duke@435 411 {
duke@435 412 Label ok, not_ok;
stefank@3391 413 __ ld(G5_klass, in_bytes(Klass::layout_helper_offset()), G1_obj_size);
kvn@3037 414 // make sure it's an instance (LH > 0)
kvn@3037 415 __ cmp_and_br_short(G1_obj_size, 0, Assembler::lessEqual, Assembler::pn, not_ok);
duke@435 416 __ btst(Klass::_lh_instance_slow_path_bit, G1_obj_size);
duke@435 417 __ br(Assembler::zero, false, Assembler::pn, ok);
duke@435 418 __ delayed()->nop();
duke@435 419 __ bind(not_ok);
duke@435 420 __ stop("assert(can be fast path allocated)");
duke@435 421 __ should_not_reach_here();
duke@435 422 __ bind(ok);
duke@435 423 }
duke@435 424 #endif // ASSERT
duke@435 425 // if we got here then the TLAB allocation failed, so try
duke@435 426 // refilling the TLAB or allocating directly from eden.
duke@435 427 Label retry_tlab, try_eden;
duke@435 428 __ tlab_refill(retry_tlab, try_eden, slow_path); // preserves G5_klass
duke@435 429
duke@435 430 __ bind(retry_tlab);
duke@435 431
duke@435 432 // get the instance size
stefank@3391 433 __ ld(G5_klass, in_bytes(Klass::layout_helper_offset()), G1_obj_size);
phh@2423 434
duke@435 435 __ tlab_allocate(O0_obj, G1_obj_size, 0, G3_t1, slow_path);
phh@2423 436
duke@435 437 __ initialize_object(O0_obj, G5_klass, G1_obj_size, 0, G3_t1, G4_t2);
duke@435 438 __ verify_oop(O0_obj);
duke@435 439 __ mov(O0, I0);
duke@435 440 __ ret();
duke@435 441 __ delayed()->restore();
duke@435 442
duke@435 443 __ bind(try_eden);
duke@435 444 // get the instance size
stefank@3391 445 __ ld(G5_klass, in_bytes(Klass::layout_helper_offset()), G1_obj_size);
duke@435 446 __ eden_allocate(O0_obj, G1_obj_size, 0, G3_t1, G4_t2, slow_path);
phh@2447 447 __ incr_allocated_bytes(G1_obj_size, G3_t1, G4_t2);
phh@2423 448
duke@435 449 __ initialize_object(O0_obj, G5_klass, G1_obj_size, 0, G3_t1, G4_t2);
duke@435 450 __ verify_oop(O0_obj);
duke@435 451 __ mov(O0, I0);
duke@435 452 __ ret();
duke@435 453 __ delayed()->restore();
duke@435 454
duke@435 455 __ bind(slow_path);
duke@435 456
duke@435 457 // pop this frame so generate_stub_call can push it's own
duke@435 458 __ restore();
duke@435 459 }
duke@435 460
duke@435 461 oop_maps = generate_stub_call(sasm, I0, CAST_FROM_FN_PTR(address, new_instance), G5_klass);
duke@435 462 // I0->O0: new instance
duke@435 463 }
duke@435 464
duke@435 465 break;
duke@435 466
duke@435 467 case counter_overflow_id:
iveresov@2138 468 // G4 contains bci, G5 contains method
iveresov@2138 469 oop_maps = generate_stub_call(sasm, noreg, CAST_FROM_FN_PTR(address, counter_overflow), G4, G5);
duke@435 470 break;
duke@435 471
duke@435 472 case new_type_array_id:
duke@435 473 case new_object_array_id:
duke@435 474 {
duke@435 475 Register G5_klass = G5; // Incoming
duke@435 476 Register G4_length = G4; // Incoming
duke@435 477 Register O0_obj = O0; // Outgoing
duke@435 478
stefank@3391 479 Address klass_lh(G5_klass, Klass::layout_helper_offset());
duke@435 480 assert(Klass::_lh_header_size_shift % BitsPerByte == 0, "bytewise");
duke@435 481 assert(Klass::_lh_header_size_mask == 0xFF, "bytewise");
duke@435 482 // Use this offset to pick out an individual byte of the layout_helper:
duke@435 483 const int klass_lh_header_size_offset = ((BytesPerInt - 1) // 3 - 2 selects byte {0,1,0,0}
duke@435 484 - Klass::_lh_header_size_shift / BitsPerByte);
duke@435 485
duke@435 486 if (id == new_type_array_id) {
duke@435 487 __ set_info("new_type_array", dont_gc_arguments);
duke@435 488 } else {
duke@435 489 __ set_info("new_object_array", dont_gc_arguments);
duke@435 490 }
duke@435 491
duke@435 492 #ifdef ASSERT
duke@435 493 // assert object type is really an array of the proper kind
duke@435 494 {
duke@435 495 Label ok;
duke@435 496 Register G3_t1 = G3;
duke@435 497 __ ld(klass_lh, G3_t1);
duke@435 498 __ sra(G3_t1, Klass::_lh_array_tag_shift, G3_t1);
duke@435 499 int tag = ((id == new_type_array_id)
duke@435 500 ? Klass::_lh_array_tag_type_value
duke@435 501 : Klass::_lh_array_tag_obj_value);
kvn@3037 502 __ cmp_and_brx_short(G3_t1, tag, Assembler::equal, Assembler::pt, ok);
duke@435 503 __ stop("assert(is an array klass)");
duke@435 504 __ should_not_reach_here();
duke@435 505 __ bind(ok);
duke@435 506 }
duke@435 507 #endif // ASSERT
duke@435 508
duke@435 509 if (UseTLAB && FastTLABRefill) {
duke@435 510 Label slow_path;
duke@435 511 Register G1_arr_size = G1;
duke@435 512 Register G3_t1 = G3;
duke@435 513 Register O1_t2 = O1;
duke@435 514 assert_different_registers(G5_klass, G4_length, G1_arr_size, G3_t1, O1_t2);
duke@435 515
duke@435 516 // check that array length is small enough for fast path
duke@435 517 __ set(C1_MacroAssembler::max_array_allocation_length, G3_t1);
kvn@3037 518 __ cmp_and_br_short(G4_length, G3_t1, Assembler::greaterUnsigned, Assembler::pn, slow_path);
duke@435 519
duke@435 520 // if we got here then the TLAB allocation failed, so try
duke@435 521 // refilling the TLAB or allocating directly from eden.
duke@435 522 Label retry_tlab, try_eden;
duke@435 523 __ tlab_refill(retry_tlab, try_eden, slow_path); // preserves G4_length and G5_klass
duke@435 524
duke@435 525 __ bind(retry_tlab);
duke@435 526
duke@435 527 // get the allocation size: (length << (layout_helper & 0x1F)) + header_size
duke@435 528 __ ld(klass_lh, G3_t1);
duke@435 529 __ sll(G4_length, G3_t1, G1_arr_size);
duke@435 530 __ srl(G3_t1, Klass::_lh_header_size_shift, G3_t1);
duke@435 531 __ and3(G3_t1, Klass::_lh_header_size_mask, G3_t1);
duke@435 532 __ add(G1_arr_size, G3_t1, G1_arr_size);
duke@435 533 __ add(G1_arr_size, MinObjAlignmentInBytesMask, G1_arr_size); // align up
duke@435 534 __ and3(G1_arr_size, ~MinObjAlignmentInBytesMask, G1_arr_size);
duke@435 535
duke@435 536 __ tlab_allocate(O0_obj, G1_arr_size, 0, G3_t1, slow_path); // preserves G1_arr_size
duke@435 537
duke@435 538 __ initialize_header(O0_obj, G5_klass, G4_length, G3_t1, O1_t2);
duke@435 539 __ ldub(klass_lh, G3_t1, klass_lh_header_size_offset);
duke@435 540 __ sub(G1_arr_size, G3_t1, O1_t2); // body length
duke@435 541 __ add(O0_obj, G3_t1, G3_t1); // body start
duke@435 542 __ initialize_body(G3_t1, O1_t2);
duke@435 543 __ verify_oop(O0_obj);
duke@435 544 __ retl();
duke@435 545 __ delayed()->nop();
duke@435 546
duke@435 547 __ bind(try_eden);
duke@435 548 // get the allocation size: (length << (layout_helper & 0x1F)) + header_size
duke@435 549 __ ld(klass_lh, G3_t1);
duke@435 550 __ sll(G4_length, G3_t1, G1_arr_size);
duke@435 551 __ srl(G3_t1, Klass::_lh_header_size_shift, G3_t1);
duke@435 552 __ and3(G3_t1, Klass::_lh_header_size_mask, G3_t1);
duke@435 553 __ add(G1_arr_size, G3_t1, G1_arr_size);
duke@435 554 __ add(G1_arr_size, MinObjAlignmentInBytesMask, G1_arr_size);
duke@435 555 __ and3(G1_arr_size, ~MinObjAlignmentInBytesMask, G1_arr_size);
duke@435 556
duke@435 557 __ eden_allocate(O0_obj, G1_arr_size, 0, G3_t1, O1_t2, slow_path); // preserves G1_arr_size
phh@2447 558 __ incr_allocated_bytes(G1_arr_size, G3_t1, O1_t2);
duke@435 559
duke@435 560 __ initialize_header(O0_obj, G5_klass, G4_length, G3_t1, O1_t2);
duke@435 561 __ ldub(klass_lh, G3_t1, klass_lh_header_size_offset);
duke@435 562 __ sub(G1_arr_size, G3_t1, O1_t2); // body length
duke@435 563 __ add(O0_obj, G3_t1, G3_t1); // body start
duke@435 564 __ initialize_body(G3_t1, O1_t2);
duke@435 565 __ verify_oop(O0_obj);
duke@435 566 __ retl();
duke@435 567 __ delayed()->nop();
duke@435 568
duke@435 569 __ bind(slow_path);
duke@435 570 }
duke@435 571
duke@435 572 if (id == new_type_array_id) {
duke@435 573 oop_maps = generate_stub_call(sasm, I0, CAST_FROM_FN_PTR(address, new_type_array), G5_klass, G4_length);
duke@435 574 } else {
duke@435 575 oop_maps = generate_stub_call(sasm, I0, CAST_FROM_FN_PTR(address, new_object_array), G5_klass, G4_length);
duke@435 576 }
duke@435 577 // I0 -> O0: new array
duke@435 578 }
duke@435 579 break;
duke@435 580
duke@435 581 case new_multi_array_id:
duke@435 582 { // O0: klass
duke@435 583 // O1: rank
duke@435 584 // O2: address of 1st dimension
duke@435 585 __ set_info("new_multi_array", dont_gc_arguments);
duke@435 586 oop_maps = generate_stub_call(sasm, I0, CAST_FROM_FN_PTR(address, new_multi_array), I0, I1, I2);
duke@435 587 // I0 -> O0: new multi array
duke@435 588 }
duke@435 589 break;
duke@435 590
duke@435 591 case register_finalizer_id:
duke@435 592 {
duke@435 593 __ set_info("register_finalizer", dont_gc_arguments);
duke@435 594
duke@435 595 // load the klass and check the has finalizer flag
duke@435 596 Label register_finalizer;
duke@435 597 Register t = O1;
iveresov@2344 598 __ load_klass(O0, t);
stefank@3391 599 __ ld(t, in_bytes(Klass::access_flags_offset()), t);
duke@435 600 __ set(JVM_ACC_HAS_FINALIZER, G3);
duke@435 601 __ andcc(G3, t, G0);
duke@435 602 __ br(Assembler::notZero, false, Assembler::pt, register_finalizer);
duke@435 603 __ delayed()->nop();
duke@435 604
duke@435 605 // do a leaf return
duke@435 606 __ retl();
duke@435 607 __ delayed()->nop();
duke@435 608
duke@435 609 __ bind(register_finalizer);
duke@435 610 OopMap* oop_map = save_live_registers(sasm);
duke@435 611 int call_offset = __ call_RT(noreg, noreg,
duke@435 612 CAST_FROM_FN_PTR(address, SharedRuntime::register_finalizer), I0);
duke@435 613 oop_maps = new OopMapSet();
duke@435 614 oop_maps->add_gc_map(call_offset, oop_map);
duke@435 615
duke@435 616 // Now restore all the live registers
duke@435 617 restore_live_registers(sasm);
duke@435 618
duke@435 619 __ ret();
duke@435 620 __ delayed()->restore();
duke@435 621 }
duke@435 622 break;
duke@435 623
duke@435 624 case throw_range_check_failed_id:
duke@435 625 { __ set_info("range_check_failed", dont_gc_arguments); // arguments will be discarded
duke@435 626 // G4: index
duke@435 627 oop_maps = generate_exception_throw(sasm, CAST_FROM_FN_PTR(address, throw_range_check_exception), true);
duke@435 628 }
duke@435 629 break;
duke@435 630
duke@435 631 case throw_index_exception_id:
duke@435 632 { __ set_info("index_range_check_failed", dont_gc_arguments); // arguments will be discarded
duke@435 633 // G4: index
duke@435 634 oop_maps = generate_exception_throw(sasm, CAST_FROM_FN_PTR(address, throw_index_exception), true);
duke@435 635 }
duke@435 636 break;
duke@435 637
duke@435 638 case throw_div0_exception_id:
duke@435 639 { __ set_info("throw_div0_exception", dont_gc_arguments);
duke@435 640 oop_maps = generate_exception_throw(sasm, CAST_FROM_FN_PTR(address, throw_div0_exception), false);
duke@435 641 }
duke@435 642 break;
duke@435 643
duke@435 644 case throw_null_pointer_exception_id:
duke@435 645 { __ set_info("throw_null_pointer_exception", dont_gc_arguments);
duke@435 646 oop_maps = generate_exception_throw(sasm, CAST_FROM_FN_PTR(address, throw_null_pointer_exception), false);
duke@435 647 }
duke@435 648 break;
duke@435 649
duke@435 650 case handle_exception_id:
twisti@2603 651 { __ set_info("handle_exception", dont_gc_arguments);
twisti@2603 652 oop_maps = generate_handle_exception(id, sasm);
twisti@2603 653 }
twisti@2603 654 break;
duke@435 655
twisti@2603 656 case handle_exception_from_callee_id:
twisti@2603 657 { __ set_info("handle_exception_from_callee", dont_gc_arguments);
twisti@2603 658 oop_maps = generate_handle_exception(id, sasm);
duke@435 659 }
duke@435 660 break;
duke@435 661
duke@435 662 case unwind_exception_id:
duke@435 663 {
duke@435 664 // O0: exception
duke@435 665 // I7: address of call to this method
duke@435 666
duke@435 667 __ set_info("unwind_exception", dont_gc_arguments);
duke@435 668 __ mov(Oexception, Oexception->after_save());
duke@435 669 __ add(I7, frame::pc_return_offset, Oissuing_pc->after_save());
duke@435 670
duke@435 671 __ call_VM_leaf(L7_thread_cache, CAST_FROM_FN_PTR(address, SharedRuntime::exception_handler_for_return_address),
twisti@1730 672 G2_thread, Oissuing_pc->after_save());
duke@435 673 __ verify_not_null_oop(Oexception->after_save());
twisti@1919 674
twisti@2603 675 // Restore SP from L7 if the exception PC is a method handle call site.
twisti@1919 676 __ mov(O0, G5); // Save the target address.
twisti@1919 677 __ lduw(Address(G2_thread, JavaThread::is_method_handle_return_offset()), L0);
twisti@1919 678 __ tst(L0); // Condition codes are preserved over the restore.
twisti@1919 679 __ restore();
twisti@1919 680
twisti@1919 681 __ jmp(G5, 0);
twisti@1919 682 __ delayed()->movcc(Assembler::notZero, false, Assembler::icc, L7_mh_SP_save, SP); // Restore SP if required.
duke@435 683 }
duke@435 684 break;
duke@435 685
duke@435 686 case throw_array_store_exception_id:
duke@435 687 {
duke@435 688 __ set_info("throw_array_store_exception", dont_gc_arguments);
never@2488 689 oop_maps = generate_exception_throw(sasm, CAST_FROM_FN_PTR(address, throw_array_store_exception), true);
duke@435 690 }
duke@435 691 break;
duke@435 692
duke@435 693 case throw_class_cast_exception_id:
duke@435 694 {
duke@435 695 // G4: object
duke@435 696 __ set_info("throw_class_cast_exception", dont_gc_arguments);
duke@435 697 oop_maps = generate_exception_throw(sasm, CAST_FROM_FN_PTR(address, throw_class_cast_exception), true);
duke@435 698 }
duke@435 699 break;
duke@435 700
duke@435 701 case throw_incompatible_class_change_error_id:
duke@435 702 {
duke@435 703 __ set_info("throw_incompatible_class_cast_exception", dont_gc_arguments);
duke@435 704 oop_maps = generate_exception_throw(sasm, CAST_FROM_FN_PTR(address, throw_incompatible_class_change_error), false);
duke@435 705 }
duke@435 706 break;
duke@435 707
duke@435 708 case slow_subtype_check_id:
duke@435 709 { // Support for uint StubRoutine::partial_subtype_check( Klass sub, Klass super );
duke@435 710 // Arguments :
duke@435 711 //
duke@435 712 // ret : G3
duke@435 713 // sub : G3, argument, destroyed
duke@435 714 // super: G1, argument, not changed
duke@435 715 // raddr: O7, blown by call
jrose@1079 716 Label miss;
duke@435 717
duke@435 718 __ save_frame(0); // Blow no registers!
duke@435 719
jrose@1079 720 __ check_klass_subtype_slow_path(G3, G1, L0, L1, L2, L4, NULL, &miss);
duke@435 721
duke@435 722 __ mov(1, G3);
jrose@1079 723 __ ret(); // Result in G5 is 'true'
duke@435 724 __ delayed()->restore(); // free copy or add can go here
duke@435 725
duke@435 726 __ bind(miss);
duke@435 727 __ mov(0, G3);
jrose@1079 728 __ ret(); // Result in G5 is 'false'
duke@435 729 __ delayed()->restore(); // free copy or add can go here
duke@435 730 }
duke@435 731
duke@435 732 case monitorenter_nofpu_id:
duke@435 733 case monitorenter_id:
duke@435 734 { // G4: object
duke@435 735 // G5: lock address
duke@435 736 __ set_info("monitorenter", dont_gc_arguments);
duke@435 737
duke@435 738 int save_fpu_registers = (id == monitorenter_id);
duke@435 739 // make a frame and preserve the caller's caller-save registers
duke@435 740 OopMap* oop_map = save_live_registers(sasm, save_fpu_registers);
duke@435 741
duke@435 742 int call_offset = __ call_RT(noreg, noreg, CAST_FROM_FN_PTR(address, monitorenter), G4, G5);
duke@435 743
duke@435 744 oop_maps = new OopMapSet();
duke@435 745 oop_maps->add_gc_map(call_offset, oop_map);
duke@435 746 restore_live_registers(sasm, save_fpu_registers);
duke@435 747
duke@435 748 __ ret();
duke@435 749 __ delayed()->restore();
duke@435 750 }
duke@435 751 break;
duke@435 752
duke@435 753 case monitorexit_nofpu_id:
duke@435 754 case monitorexit_id:
duke@435 755 { // G4: lock address
duke@435 756 // note: really a leaf routine but must setup last java sp
duke@435 757 // => use call_RT for now (speed can be improved by
duke@435 758 // doing last java sp setup manually)
duke@435 759 __ set_info("monitorexit", dont_gc_arguments);
duke@435 760
duke@435 761 int save_fpu_registers = (id == monitorexit_id);
duke@435 762 // make a frame and preserve the caller's caller-save registers
duke@435 763 OopMap* oop_map = save_live_registers(sasm, save_fpu_registers);
duke@435 764
duke@435 765 int call_offset = __ call_RT(noreg, noreg, CAST_FROM_FN_PTR(address, monitorexit), G4);
duke@435 766
duke@435 767 oop_maps = new OopMapSet();
duke@435 768 oop_maps->add_gc_map(call_offset, oop_map);
duke@435 769 restore_live_registers(sasm, save_fpu_registers);
duke@435 770
duke@435 771 __ ret();
duke@435 772 __ delayed()->restore();
twisti@3244 773 }
twisti@3244 774 break;
duke@435 775
twisti@3244 776 case deoptimize_id:
twisti@3244 777 {
twisti@3244 778 __ set_info("deoptimize", dont_gc_arguments);
twisti@3244 779 OopMap* oop_map = save_live_registers(sasm);
twisti@3244 780 int call_offset = __ call_RT(noreg, noreg, CAST_FROM_FN_PTR(address, deoptimize));
twisti@3244 781 oop_maps = new OopMapSet();
twisti@3244 782 oop_maps->add_gc_map(call_offset, oop_map);
twisti@3244 783 restore_live_registers(sasm);
twisti@3244 784 DeoptimizationBlob* deopt_blob = SharedRuntime::deopt_blob();
twisti@3244 785 assert(deopt_blob != NULL, "deoptimization blob must have been created");
twisti@3244 786 AddressLiteral dest(deopt_blob->unpack_with_reexecution());
twisti@3244 787 __ jump_to(dest, O0);
twisti@3244 788 __ delayed()->restore();
duke@435 789 }
duke@435 790 break;
duke@435 791
duke@435 792 case access_field_patching_id:
duke@435 793 { __ set_info("access_field_patching", dont_gc_arguments);
duke@435 794 oop_maps = generate_patching(sasm, CAST_FROM_FN_PTR(address, access_field_patching));
duke@435 795 }
duke@435 796 break;
duke@435 797
duke@435 798 case load_klass_patching_id:
duke@435 799 { __ set_info("load_klass_patching", dont_gc_arguments);
duke@435 800 oop_maps = generate_patching(sasm, CAST_FROM_FN_PTR(address, move_klass_patching));
duke@435 801 }
duke@435 802 break;
duke@435 803
coleenp@4037 804 case load_mirror_patching_id:
coleenp@4037 805 { __ set_info("load_mirror_patching", dont_gc_arguments);
coleenp@4037 806 oop_maps = generate_patching(sasm, CAST_FROM_FN_PTR(address, move_mirror_patching));
coleenp@4037 807 }
coleenp@4037 808 break;
coleenp@4037 809
roland@5628 810 case load_appendix_patching_id:
roland@5628 811 { __ set_info("load_appendix_patching", dont_gc_arguments);
roland@5628 812 oop_maps = generate_patching(sasm, CAST_FROM_FN_PTR(address, move_appendix_patching));
roland@5628 813 }
roland@5628 814 break;
roland@5628 815
duke@435 816 case dtrace_object_alloc_id:
duke@435 817 { // O0: object
duke@435 818 __ set_info("dtrace_object_alloc", dont_gc_arguments);
duke@435 819 // we can't gc here so skip the oopmap but make sure that all
duke@435 820 // the live registers get saved.
duke@435 821 save_live_registers(sasm);
duke@435 822
duke@435 823 __ save_thread(L7_thread_cache);
duke@435 824 __ call(CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_object_alloc),
duke@435 825 relocInfo::runtime_call_type);
duke@435 826 __ delayed()->mov(I0, O0);
duke@435 827 __ restore_thread(L7_thread_cache);
duke@435 828
duke@435 829 restore_live_registers(sasm);
duke@435 830 __ ret();
duke@435 831 __ delayed()->restore();
duke@435 832 }
duke@435 833 break;
duke@435 834
jprovino@4542 835 #if INCLUDE_ALL_GCS
ysr@777 836 case g1_pre_barrier_slow_id:
ysr@777 837 { // G4: previous value of memory
ysr@777 838 BarrierSet* bs = Universe::heap()->barrier_set();
ysr@777 839 if (bs->kind() != BarrierSet::G1SATBCTLogging) {
ysr@777 840 __ save_frame(0);
ysr@777 841 __ set((int)id, O1);
ysr@777 842 __ call_RT(noreg, noreg, CAST_FROM_FN_PTR(address, unimplemented_entry), I0);
ysr@777 843 __ should_not_reach_here();
ysr@777 844 break;
ysr@777 845 }
ysr@777 846
ysr@777 847 __ set_info("g1_pre_barrier_slow_id", dont_gc_arguments);
ysr@777 848
ysr@777 849 Register pre_val = G4;
ysr@777 850 Register tmp = G1_scratch;
ysr@777 851 Register tmp2 = G3_scratch;
ysr@777 852
ysr@777 853 Label refill, restart;
ysr@777 854 bool with_frame = false; // I don't know if we can do with-frame.
ysr@777 855 int satb_q_index_byte_offset =
ysr@777 856 in_bytes(JavaThread::satb_mark_queue_offset() +
ysr@777 857 PtrQueue::byte_offset_of_index());
ysr@777 858 int satb_q_buf_byte_offset =
ysr@777 859 in_bytes(JavaThread::satb_mark_queue_offset() +
ysr@777 860 PtrQueue::byte_offset_of_buf());
johnc@3088 861
ysr@777 862 __ bind(restart);
johnc@3088 863 // Load the index into the SATB buffer. PtrQueue::_index is a
johnc@3088 864 // size_t so ld_ptr is appropriate
ysr@777 865 __ ld_ptr(G2_thread, satb_q_index_byte_offset, tmp);
ysr@777 866
johnc@3088 867 // index == 0?
johnc@3088 868 __ cmp_and_brx_short(tmp, G0, Assembler::equal, Assembler::pn, refill);
ysr@777 869
johnc@3088 870 __ ld_ptr(G2_thread, satb_q_buf_byte_offset, tmp2);
ysr@777 871 __ sub(tmp, oopSize, tmp);
ysr@777 872
ysr@777 873 __ st_ptr(pre_val, tmp2, tmp); // [_buf + index] := <address_of_card>
ysr@777 874 // Use return-from-leaf
ysr@777 875 __ retl();
ysr@777 876 __ delayed()->st_ptr(tmp, G2_thread, satb_q_index_byte_offset);
ysr@777 877
ysr@777 878 __ bind(refill);
ysr@777 879 __ save_frame(0);
ysr@777 880
ysr@777 881 __ mov(pre_val, L0);
ysr@777 882 __ mov(tmp, L1);
ysr@777 883 __ mov(tmp2, L2);
ysr@777 884
ysr@777 885 __ call_VM_leaf(L7_thread_cache,
ysr@777 886 CAST_FROM_FN_PTR(address,
ysr@777 887 SATBMarkQueueSet::handle_zero_index_for_thread),
ysr@777 888 G2_thread);
ysr@777 889
ysr@777 890 __ mov(L0, pre_val);
ysr@777 891 __ mov(L1, tmp);
ysr@777 892 __ mov(L2, tmp2);
ysr@777 893
ysr@777 894 __ br(Assembler::always, /*annul*/false, Assembler::pt, restart);
ysr@777 895 __ delayed()->restore();
ysr@777 896 }
ysr@777 897 break;
ysr@777 898
ysr@777 899 case g1_post_barrier_slow_id:
ysr@777 900 {
ysr@777 901 BarrierSet* bs = Universe::heap()->barrier_set();
ysr@777 902 if (bs->kind() != BarrierSet::G1SATBCTLogging) {
ysr@777 903 __ save_frame(0);
ysr@777 904 __ set((int)id, O1);
ysr@777 905 __ call_RT(noreg, noreg, CAST_FROM_FN_PTR(address, unimplemented_entry), I0);
ysr@777 906 __ should_not_reach_here();
ysr@777 907 break;
ysr@777 908 }
ysr@777 909
ysr@777 910 __ set_info("g1_post_barrier_slow_id", dont_gc_arguments);
ysr@777 911
ysr@777 912 Register addr = G4;
ysr@777 913 Register cardtable = G5;
ysr@777 914 Register tmp = G1_scratch;
ysr@777 915 Register tmp2 = G3_scratch;
ysr@777 916 jbyte* byte_map_base = ((CardTableModRefBS*)bs)->byte_map_base;
ysr@777 917
mgerdin@5860 918 Label not_already_dirty, restart, refill, young_card;
ysr@777 919
ysr@777 920 #ifdef _LP64
ysr@777 921 __ srlx(addr, CardTableModRefBS::card_shift, addr);
ysr@777 922 #else
ysr@777 923 __ srl(addr, CardTableModRefBS::card_shift, addr);
ysr@777 924 #endif
ysr@777 925
twisti@1162 926 AddressLiteral rs(byte_map_base);
twisti@1162 927 __ set(rs, cardtable); // cardtable := <card table base>
ysr@777 928 __ ldub(addr, cardtable, tmp); // tmp := [addr + cardtable]
ysr@777 929
mgerdin@5860 930 __ cmp_and_br_short(tmp, G1SATBCardTableModRefBS::g1_young_card_val(), Assembler::equal, Assembler::pt, young_card);
mgerdin@5860 931
mgerdin@5860 932 __ membar(Assembler::Membar_mask_bits(Assembler::StoreLoad));
mgerdin@5860 933 __ ldub(addr, cardtable, tmp); // tmp := [addr + cardtable]
mgerdin@5860 934
johnc@3088 935 assert(CardTableModRefBS::dirty_card_val() == 0, "otherwise check this code");
johnc@3088 936 __ cmp_and_br_short(tmp, G0, Assembler::notEqual, Assembler::pt, not_already_dirty);
ysr@777 937
mgerdin@5860 938 __ bind(young_card);
ysr@777 939 // We didn't take the branch, so we're already dirty: return.
ysr@777 940 // Use return-from-leaf
ysr@777 941 __ retl();
ysr@777 942 __ delayed()->nop();
ysr@777 943
ysr@777 944 // Not dirty.
ysr@777 945 __ bind(not_already_dirty);
johnc@3088 946
johnc@3088 947 // Get cardtable + tmp into a reg by itself
johnc@3088 948 __ add(addr, cardtable, tmp2);
johnc@3088 949
ysr@777 950 // First, dirty it.
ysr@777 951 __ stb(G0, tmp2, 0); // [cardPtr] := 0 (i.e., dirty).
ysr@777 952
ysr@777 953 Register tmp3 = cardtable;
ysr@777 954 Register tmp4 = tmp;
ysr@777 955
ysr@777 956 // these registers are now dead
ysr@777 957 addr = cardtable = tmp = noreg;
ysr@777 958
ysr@777 959 int dirty_card_q_index_byte_offset =
ysr@777 960 in_bytes(JavaThread::dirty_card_queue_offset() +
ysr@777 961 PtrQueue::byte_offset_of_index());
ysr@777 962 int dirty_card_q_buf_byte_offset =
ysr@777 963 in_bytes(JavaThread::dirty_card_queue_offset() +
ysr@777 964 PtrQueue::byte_offset_of_buf());
johnc@3088 965
ysr@777 966 __ bind(restart);
johnc@3088 967
johnc@3088 968 // Get the index into the update buffer. PtrQueue::_index is
johnc@3088 969 // a size_t so ld_ptr is appropriate here.
ysr@777 970 __ ld_ptr(G2_thread, dirty_card_q_index_byte_offset, tmp3);
ysr@777 971
johnc@3088 972 // index == 0?
johnc@3088 973 __ cmp_and_brx_short(tmp3, G0, Assembler::equal, Assembler::pn, refill);
johnc@3088 974
johnc@3088 975 __ ld_ptr(G2_thread, dirty_card_q_buf_byte_offset, tmp4);
ysr@777 976 __ sub(tmp3, oopSize, tmp3);
ysr@777 977
ysr@777 978 __ st_ptr(tmp2, tmp4, tmp3); // [_buf + index] := <address_of_card>
ysr@777 979 // Use return-from-leaf
ysr@777 980 __ retl();
ysr@777 981 __ delayed()->st_ptr(tmp3, G2_thread, dirty_card_q_index_byte_offset);
ysr@777 982
ysr@777 983 __ bind(refill);
ysr@777 984 __ save_frame(0);
ysr@777 985
ysr@777 986 __ mov(tmp2, L0);
ysr@777 987 __ mov(tmp3, L1);
ysr@777 988 __ mov(tmp4, L2);
ysr@777 989
ysr@777 990 __ call_VM_leaf(L7_thread_cache,
ysr@777 991 CAST_FROM_FN_PTR(address,
ysr@777 992 DirtyCardQueueSet::handle_zero_index_for_thread),
ysr@777 993 G2_thread);
ysr@777 994
ysr@777 995 __ mov(L0, tmp2);
ysr@777 996 __ mov(L1, tmp3);
ysr@777 997 __ mov(L2, tmp4);
ysr@777 998
ysr@777 999 __ br(Assembler::always, /*annul*/false, Assembler::pt, restart);
ysr@777 1000 __ delayed()->restore();
ysr@777 1001 }
ysr@777 1002 break;
jprovino@4542 1003 #endif // INCLUDE_ALL_GCS
ysr@777 1004
roland@4860 1005 case predicate_failed_trap_id:
roland@4860 1006 {
roland@4860 1007 __ set_info("predicate_failed_trap", dont_gc_arguments);
roland@4860 1008 OopMap* oop_map = save_live_registers(sasm);
roland@4860 1009
roland@4860 1010 int call_offset = __ call_RT(noreg, noreg, CAST_FROM_FN_PTR(address, predicate_failed_trap));
roland@4860 1011
roland@4860 1012 oop_maps = new OopMapSet();
roland@4860 1013 oop_maps->add_gc_map(call_offset, oop_map);
roland@4860 1014
roland@4860 1015 DeoptimizationBlob* deopt_blob = SharedRuntime::deopt_blob();
roland@4860 1016 assert(deopt_blob != NULL, "deoptimization blob must have been created");
roland@4860 1017 restore_live_registers(sasm);
roland@4945 1018
roland@4945 1019 AddressLiteral dest(deopt_blob->unpack_with_reexecution());
roland@4945 1020 __ jump_to(dest, O0);
roland@4945 1021 __ delayed()->restore();
roland@4860 1022 }
roland@4860 1023 break;
roland@4860 1024
duke@435 1025 default:
duke@435 1026 { __ set_info("unimplemented entry", dont_gc_arguments);
duke@435 1027 __ save_frame(0);
duke@435 1028 __ set((int)id, O1);
duke@435 1029 __ call_RT(noreg, noreg, CAST_FROM_FN_PTR(address, unimplemented_entry), O1);
duke@435 1030 __ should_not_reach_here();
duke@435 1031 }
duke@435 1032 break;
duke@435 1033 }
duke@435 1034 return oop_maps;
duke@435 1035 }
duke@435 1036
duke@435 1037
twisti@2603 1038 OopMapSet* Runtime1::generate_handle_exception(StubID id, StubAssembler* sasm) {
twisti@2603 1039 __ block_comment("generate_handle_exception");
twisti@2603 1040
twisti@2603 1041 // Save registers, if required.
twisti@2603 1042 OopMapSet* oop_maps = new OopMapSet();
twisti@2603 1043 OopMap* oop_map = NULL;
twisti@2603 1044 switch (id) {
twisti@2603 1045 case forward_exception_id:
twisti@2603 1046 // We're handling an exception in the context of a compiled frame.
twisti@2603 1047 // The registers have been saved in the standard places. Perform
twisti@2603 1048 // an exception lookup in the caller and dispatch to the handler
twisti@2603 1049 // if found. Otherwise unwind and dispatch to the callers
twisti@2603 1050 // exception handler.
twisti@2603 1051 oop_map = generate_oop_map(sasm, true);
twisti@2603 1052
twisti@2603 1053 // transfer the pending exception to the exception_oop
twisti@2603 1054 __ ld_ptr(G2_thread, in_bytes(JavaThread::pending_exception_offset()), Oexception);
twisti@2603 1055 __ ld_ptr(Oexception, 0, G0);
twisti@2603 1056 __ st_ptr(G0, G2_thread, in_bytes(JavaThread::pending_exception_offset()));
twisti@2603 1057 __ add(I7, frame::pc_return_offset, Oissuing_pc);
twisti@2603 1058 break;
twisti@2603 1059 case handle_exception_id:
twisti@2603 1060 // At this point all registers MAY be live.
twisti@2603 1061 oop_map = save_live_registers(sasm);
twisti@2603 1062 __ mov(Oexception->after_save(), Oexception);
twisti@2603 1063 __ mov(Oissuing_pc->after_save(), Oissuing_pc);
twisti@2603 1064 break;
twisti@2603 1065 case handle_exception_from_callee_id:
twisti@2603 1066 // At this point all registers except exception oop (Oexception)
twisti@2603 1067 // and exception pc (Oissuing_pc) are dead.
twisti@2603 1068 oop_map = new OopMap(frame_size_in_bytes / sizeof(jint), 0);
twisti@2603 1069 sasm->set_frame_size(frame_size_in_bytes / BytesPerWord);
twisti@2603 1070 __ save_frame_c1(frame_size_in_bytes);
twisti@2603 1071 __ mov(Oexception->after_save(), Oexception);
twisti@2603 1072 __ mov(Oissuing_pc->after_save(), Oissuing_pc);
twisti@2603 1073 break;
twisti@2603 1074 default: ShouldNotReachHere();
twisti@2603 1075 }
duke@435 1076
duke@435 1077 __ verify_not_null_oop(Oexception);
duke@435 1078
duke@435 1079 // save the exception and issuing pc in the thread
twisti@2603 1080 __ st_ptr(Oexception, G2_thread, in_bytes(JavaThread::exception_oop_offset()));
duke@435 1081 __ st_ptr(Oissuing_pc, G2_thread, in_bytes(JavaThread::exception_pc_offset()));
duke@435 1082
twisti@2603 1083 // use the throwing pc as the return address to lookup (has bci & oop map)
duke@435 1084 __ mov(Oissuing_pc, I7);
duke@435 1085 __ sub(I7, frame::pc_return_offset, I7);
duke@435 1086 int call_offset = __ call_RT(noreg, noreg, CAST_FROM_FN_PTR(address, exception_handler_for_pc));
twisti@2603 1087 oop_maps->add_gc_map(call_offset, oop_map);
duke@435 1088
duke@435 1089 // Note: if nmethod has been deoptimized then regardless of
duke@435 1090 // whether it had a handler or not we will deoptimize
duke@435 1091 // by entering the deopt blob with a pending exception.
duke@435 1092
twisti@2603 1093 // Restore the registers that were saved at the beginning, remove
twisti@2603 1094 // the frame and jump to the exception handler.
twisti@2603 1095 switch (id) {
twisti@2603 1096 case forward_exception_id:
twisti@2603 1097 case handle_exception_id:
twisti@2603 1098 restore_live_registers(sasm);
twisti@2603 1099 __ jmp(O0, 0);
twisti@2603 1100 __ delayed()->restore();
twisti@2603 1101 break;
twisti@2603 1102 case handle_exception_from_callee_id:
twisti@2603 1103 // Restore SP from L7 if the exception PC is a method handle call site.
twisti@2603 1104 __ mov(O0, G5); // Save the target address.
twisti@2603 1105 __ lduw(Address(G2_thread, JavaThread::is_method_handle_return_offset()), L0);
twisti@2603 1106 __ tst(L0); // Condition codes are preserved over the restore.
twisti@2603 1107 __ restore();
duke@435 1108
twisti@2603 1109 __ jmp(G5, 0); // jump to the exception handler
twisti@2603 1110 __ delayed()->movcc(Assembler::notZero, false, Assembler::icc, L7_mh_SP_save, SP); // Restore SP if required.
twisti@2603 1111 break;
twisti@2603 1112 default: ShouldNotReachHere();
twisti@2603 1113 }
duke@435 1114
twisti@2603 1115 return oop_maps;
duke@435 1116 }
duke@435 1117
duke@435 1118
duke@435 1119 #undef __
duke@435 1120
bobv@2036 1121 const char *Runtime1::pd_name_for_address(address entry) {
bobv@2036 1122 return "<unknown function>";
bobv@2036 1123 }

mercurial