duke@435: /* coleenp@4037: * Copyright (c) 1999, 2012, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "c1/c1_MacroAssembler.hpp" stefank@2314: #include "c1/c1_Runtime1.hpp" stefank@2314: #include "classfile/systemDictionary.hpp" stefank@2314: #include "gc_interface/collectedHeap.hpp" stefank@2314: #include "interpreter/interpreter.hpp" stefank@2314: #include "oops/arrayOop.hpp" stefank@2314: #include "oops/markOop.hpp" stefank@2314: #include "runtime/basicLock.hpp" stefank@2314: #include "runtime/biasedLocking.hpp" stefank@2314: #include "runtime/os.hpp" stefank@2314: #include "runtime/stubRoutines.hpp" duke@435: duke@435: void C1_MacroAssembler::inline_cache_check(Register receiver, Register iCache) { duke@435: Label L; duke@435: const Register temp_reg = G3_scratch; duke@435: // Note: needs more testing of out-of-line vs. inline slow case duke@435: verify_oop(receiver); iveresov@2344: load_klass(receiver, temp_reg); kvn@3037: cmp_and_brx_short(temp_reg, iCache, Assembler::equal, Assembler::pt, L); twisti@1162: AddressLiteral ic_miss(SharedRuntime::get_ic_miss_stub()); twisti@1162: jump_to(ic_miss, temp_reg); duke@435: delayed()->nop(); duke@435: align(CodeEntryAlignment); duke@435: bind(L); duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::explicit_null_check(Register base) { duke@435: Unimplemented(); duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::build_frame(int frame_size_in_bytes) { duke@435: duke@435: generate_stack_overflow_check(frame_size_in_bytes); duke@435: // Create the frame. duke@435: save_frame_c1(frame_size_in_bytes); duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::unverified_entry(Register receiver, Register ic_klass) { duke@435: if (C1Breakpoint) breakpoint_trap(); duke@435: inline_cache_check(receiver, ic_klass); duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::verified_entry() { duke@435: if (C1Breakpoint) breakpoint_trap(); duke@435: // build frame duke@435: verify_FPU(0, "method_entry"); duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::lock_object(Register Rmark, Register Roop, Register Rbox, Register Rscratch, Label& slow_case) { duke@435: assert_different_registers(Rmark, Roop, Rbox, Rscratch); duke@435: duke@435: Label done; duke@435: twisti@1162: Address mark_addr(Roop, oopDesc::mark_offset_in_bytes()); duke@435: duke@435: // The following move must be the first instruction of emitted since debug duke@435: // information may be generated for it. duke@435: // Load object header duke@435: ld_ptr(mark_addr, Rmark); duke@435: duke@435: verify_oop(Roop); duke@435: duke@435: // save object being locked into the BasicObjectLock duke@435: st_ptr(Roop, Rbox, BasicObjectLock::obj_offset_in_bytes()); duke@435: duke@435: if (UseBiasedLocking) { duke@435: biased_locking_enter(Roop, Rmark, Rscratch, done, &slow_case); duke@435: } duke@435: duke@435: // Save Rbox in Rscratch to be used for the cas operation duke@435: mov(Rbox, Rscratch); duke@435: duke@435: // and mark it unlocked duke@435: or3(Rmark, markOopDesc::unlocked_value, Rmark); duke@435: duke@435: // save unlocked object header into the displaced header location on the stack duke@435: st_ptr(Rmark, Rbox, BasicLock::displaced_header_offset_in_bytes()); duke@435: duke@435: // compare object markOop with Rmark and if equal exchange Rscratch with object markOop duke@435: assert(mark_addr.disp() == 0, "cas must take a zero displacement"); morris@5283: cas_ptr(mark_addr.base(), Rmark, Rscratch); duke@435: // if compare/exchange succeeded we found an unlocked object and we now have locked it duke@435: // hence we are done duke@435: cmp(Rmark, Rscratch); duke@435: brx(Assembler::equal, false, Assembler::pt, done); duke@435: delayed()->sub(Rscratch, SP, Rscratch); //pull next instruction into delay slot duke@435: // we did not find an unlocked object so see if this is a recursive case duke@435: // sub(Rscratch, SP, Rscratch); duke@435: assert(os::vm_page_size() > 0xfff, "page size too small - change the constant"); duke@435: andcc(Rscratch, 0xfffff003, Rscratch); duke@435: brx(Assembler::notZero, false, Assembler::pn, slow_case); duke@435: delayed()->st_ptr(Rscratch, Rbox, BasicLock::displaced_header_offset_in_bytes()); duke@435: bind(done); duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::unlock_object(Register Rmark, Register Roop, Register Rbox, Label& slow_case) { duke@435: assert_different_registers(Rmark, Roop, Rbox); duke@435: duke@435: Label done; duke@435: twisti@1162: Address mark_addr(Roop, oopDesc::mark_offset_in_bytes()); duke@435: assert(mark_addr.disp() == 0, "cas must take a zero displacement"); duke@435: duke@435: if (UseBiasedLocking) { duke@435: // load the object out of the BasicObjectLock duke@435: ld_ptr(Rbox, BasicObjectLock::obj_offset_in_bytes(), Roop); duke@435: verify_oop(Roop); duke@435: biased_locking_exit(mark_addr, Rmark, done); duke@435: } duke@435: // Test first it it is a fast recursive unlock duke@435: ld_ptr(Rbox, BasicLock::displaced_header_offset_in_bytes(), Rmark); kvn@3037: br_null_short(Rmark, Assembler::pt, done); duke@435: if (!UseBiasedLocking) { duke@435: // load object duke@435: ld_ptr(Rbox, BasicObjectLock::obj_offset_in_bytes(), Roop); duke@435: verify_oop(Roop); duke@435: } duke@435: duke@435: // Check if it is still a light weight lock, this is is true if we see duke@435: // the stack address of the basicLock in the markOop of the object morris@5283: cas_ptr(mark_addr.base(), Rbox, Rmark); duke@435: cmp(Rbox, Rmark); duke@435: duke@435: brx(Assembler::notEqual, false, Assembler::pn, slow_case); duke@435: delayed()->nop(); duke@435: // Done duke@435: bind(done); duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::try_allocate( duke@435: Register obj, // result: pointer to object after successful allocation duke@435: Register var_size_in_bytes, // object size in bytes if unknown at compile time; invalid otherwise duke@435: int con_size_in_bytes, // object size in bytes if known at compile time phh@2423: Register t1, // temp register, must be global register for incr_allocated_bytes duke@435: Register t2, // temp register duke@435: Label& slow_case // continuation point if fast allocation fails duke@435: ) { phh@2447: RegisterOrConstant size_in_bytes = var_size_in_bytes->is_valid() phh@2447: ? RegisterOrConstant(var_size_in_bytes) : RegisterOrConstant(con_size_in_bytes); duke@435: if (UseTLAB) { duke@435: tlab_allocate(obj, var_size_in_bytes, con_size_in_bytes, t1, slow_case); duke@435: } else { duke@435: eden_allocate(obj, var_size_in_bytes, con_size_in_bytes, t1, t2, slow_case); phh@2447: incr_allocated_bytes(size_in_bytes, t1, t2); duke@435: } duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register len, Register t1, Register t2) { duke@435: assert_different_registers(obj, klass, len, t1, t2); duke@435: if (UseBiasedLocking && !len->is_valid()) { stefank@3391: ld_ptr(klass, in_bytes(Klass::prototype_header_offset()), t1); duke@435: } else { duke@435: set((intx)markOopDesc::prototype(), t1); duke@435: } iveresov@2344: st_ptr(t1, obj, oopDesc::mark_offset_in_bytes()); ehelin@5694: if (UseCompressedClassPointers) { iveresov@2344: // Save klass iveresov@2344: mov(klass, t1); roland@4159: encode_klass_not_null(t1); iveresov@2344: stw(t1, obj, oopDesc::klass_offset_in_bytes()); iveresov@2344: } else { iveresov@2344: st_ptr(klass, obj, oopDesc::klass_offset_in_bytes()); iveresov@2344: } coleenp@4037: if (len->is_valid()) { coleenp@4037: st(len, obj, arrayOopDesc::length_offset_in_bytes()); ehelin@5694: } else if (UseCompressedClassPointers) { coleenp@4037: // otherwise length is in the class gap iveresov@2344: store_klass_gap(G0, obj); iveresov@2344: } duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::initialize_body(Register base, Register index) { duke@435: assert_different_registers(base, index); duke@435: Label loop; duke@435: bind(loop); duke@435: subcc(index, HeapWordSize, index); duke@435: brx(Assembler::greaterEqual, true, Assembler::pt, loop); duke@435: delayed()->st_ptr(G0, base, index); duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::allocate_object( duke@435: Register obj, // result: pointer to object after successful allocation duke@435: Register t1, // temp register phh@2423: Register t2, // temp register, must be a global register for try_allocate duke@435: Register t3, // temp register duke@435: int hdr_size, // object header size in words duke@435: int obj_size, // object size in words duke@435: Register klass, // object klass duke@435: Label& slow_case // continuation point if fast allocation fails duke@435: ) { duke@435: assert_different_registers(obj, t1, t2, t3, klass); duke@435: assert(klass == G5, "must be G5"); duke@435: duke@435: // allocate space & initialize header duke@435: if (!is_simm13(obj_size * wordSize)) { duke@435: // would need to use extra register to load duke@435: // object size => go the slow case for now kvn@3037: ba(slow_case); duke@435: delayed()->nop(); duke@435: return; duke@435: } duke@435: try_allocate(obj, noreg, obj_size * wordSize, t2, t3, slow_case); duke@435: duke@435: initialize_object(obj, klass, noreg, obj_size * HeapWordSize, t1, t2); duke@435: } duke@435: duke@435: void C1_MacroAssembler::initialize_object( duke@435: Register obj, // result: pointer to object after successful allocation duke@435: Register klass, // object klass duke@435: Register var_size_in_bytes, // object size in bytes if unknown at compile time; invalid otherwise duke@435: int con_size_in_bytes, // object size in bytes if known at compile time duke@435: Register t1, // temp register duke@435: Register t2 // temp register duke@435: ) { iveresov@2344: const int hdr_size_in_bytes = instanceOopDesc::header_size() * HeapWordSize; duke@435: duke@435: initialize_header(obj, klass, noreg, t1, t2); duke@435: duke@435: #ifdef ASSERT duke@435: { duke@435: Label ok; stefank@3391: ld(klass, in_bytes(Klass::layout_helper_offset()), t1); duke@435: if (var_size_in_bytes != noreg) { kvn@3037: cmp_and_brx_short(t1, var_size_in_bytes, Assembler::equal, Assembler::pt, ok); duke@435: } else { kvn@3037: cmp_and_brx_short(t1, con_size_in_bytes, Assembler::equal, Assembler::pt, ok); duke@435: } duke@435: stop("bad size in initialize_object"); duke@435: should_not_reach_here(); duke@435: duke@435: bind(ok); duke@435: } duke@435: duke@435: #endif duke@435: duke@435: // initialize body duke@435: const int threshold = 5 * HeapWordSize; // approximate break even point for code size duke@435: if (var_size_in_bytes != noreg) { duke@435: // use a loop duke@435: add(obj, hdr_size_in_bytes, t1); // compute address of first element duke@435: sub(var_size_in_bytes, hdr_size_in_bytes, t2); // compute size of body duke@435: initialize_body(t1, t2); duke@435: #ifndef _LP64 morris@5283: } else if (con_size_in_bytes < threshold * 2) { duke@435: // on v9 we can do double word stores to fill twice as much space. duke@435: assert(hdr_size_in_bytes % 8 == 0, "double word aligned"); duke@435: assert(con_size_in_bytes % 8 == 0, "double word aligned"); duke@435: for (int i = hdr_size_in_bytes; i < con_size_in_bytes; i += 2 * HeapWordSize) stx(G0, obj, i); duke@435: #endif duke@435: } else if (con_size_in_bytes <= threshold) { duke@435: // use explicit NULL stores duke@435: for (int i = hdr_size_in_bytes; i < con_size_in_bytes; i += HeapWordSize) st_ptr(G0, obj, i); duke@435: } else if (con_size_in_bytes > hdr_size_in_bytes) { duke@435: // use a loop duke@435: const Register base = t1; duke@435: const Register index = t2; duke@435: add(obj, hdr_size_in_bytes, base); // compute address of first element duke@435: // compute index = number of words to clear duke@435: set(con_size_in_bytes - hdr_size_in_bytes, index); duke@435: initialize_body(base, index); duke@435: } duke@435: kvn@1215: if (CURRENT_ENV->dtrace_alloc_probes()) { duke@435: assert(obj == O0, "must be"); duke@435: call(CAST_FROM_FN_PTR(address, Runtime1::entry_for(Runtime1::dtrace_object_alloc_id)), duke@435: relocInfo::runtime_call_type); duke@435: delayed()->nop(); duke@435: } duke@435: duke@435: verify_oop(obj); duke@435: } duke@435: duke@435: duke@435: void C1_MacroAssembler::allocate_array( duke@435: Register obj, // result: pointer to array after successful allocation duke@435: Register len, // array length duke@435: Register t1, // temp register duke@435: Register t2, // temp register duke@435: Register t3, // temp register duke@435: int hdr_size, // object header size in words duke@435: int elt_size, // element size in bytes duke@435: Register klass, // object klass duke@435: Label& slow_case // continuation point if fast allocation fails duke@435: ) { duke@435: assert_different_registers(obj, len, t1, t2, t3, klass); duke@435: assert(klass == G5, "must be G5"); duke@435: assert(t1 == G1, "must be G1"); duke@435: duke@435: // determine alignment mask duke@435: assert(!(BytesPerWord & 1), "must be a multiple of 2 for masking code to work"); duke@435: duke@435: // check for negative or excessive length duke@435: // note: the maximum length allowed is chosen so that arrays of any duke@435: // element size with this length are always smaller or equal duke@435: // to the largest integer (i.e., array size computation will duke@435: // not overflow) duke@435: set(max_array_allocation_length, t1); duke@435: cmp(len, t1); duke@435: br(Assembler::greaterUnsigned, false, Assembler::pn, slow_case); duke@435: duke@435: // compute array size duke@435: // note: if 0 <= len <= max_length, len*elt_size + header + alignment is duke@435: // smaller or equal to the largest integer; also, since top is always duke@435: // aligned, we can do the alignment here instead of at the end address duke@435: // computation duke@435: const Register arr_size = t1; duke@435: switch (elt_size) { duke@435: case 1: delayed()->mov(len, arr_size); break; duke@435: case 2: delayed()->sll(len, 1, arr_size); break; duke@435: case 4: delayed()->sll(len, 2, arr_size); break; duke@435: case 8: delayed()->sll(len, 3, arr_size); break; duke@435: default: ShouldNotReachHere(); duke@435: } duke@435: add(arr_size, hdr_size * wordSize + MinObjAlignmentInBytesMask, arr_size); // add space for header & alignment duke@435: and3(arr_size, ~MinObjAlignmentInBytesMask, arr_size); // align array size duke@435: duke@435: // allocate space & initialize header duke@435: if (UseTLAB) { duke@435: tlab_allocate(obj, arr_size, 0, t2, slow_case); duke@435: } else { duke@435: eden_allocate(obj, arr_size, 0, t2, t3, slow_case); duke@435: } duke@435: initialize_header(obj, klass, len, t2, t3); duke@435: duke@435: // initialize body duke@435: const Register base = t2; duke@435: const Register index = t3; duke@435: add(obj, hdr_size * wordSize, base); // compute address of first element duke@435: sub(arr_size, hdr_size * wordSize, index); // compute index = number of words to clear duke@435: initialize_body(base, index); duke@435: kvn@1215: if (CURRENT_ENV->dtrace_alloc_probes()) { duke@435: assert(obj == O0, "must be"); duke@435: call(CAST_FROM_FN_PTR(address, Runtime1::entry_for(Runtime1::dtrace_object_alloc_id)), duke@435: relocInfo::runtime_call_type); duke@435: delayed()->nop(); duke@435: } duke@435: duke@435: verify_oop(obj); duke@435: } duke@435: duke@435: duke@435: #ifndef PRODUCT duke@435: duke@435: void C1_MacroAssembler::verify_stack_oop(int stack_offset) { duke@435: if (!VerifyOops) return; twisti@1162: verify_oop_addr(Address(SP, stack_offset + STACK_BIAS)); duke@435: } duke@435: duke@435: void C1_MacroAssembler::verify_not_null_oop(Register r) { duke@435: Label not_null; kvn@3037: br_notnull_short(r, Assembler::pt, not_null); duke@435: stop("non-null oop required"); duke@435: bind(not_null); duke@435: if (!VerifyOops) return; duke@435: verify_oop(r); duke@435: } duke@435: duke@435: void C1_MacroAssembler::invalidate_registers(bool iregisters, bool lregisters, bool oregisters, duke@435: Register preserve1, Register preserve2) { duke@435: if (iregisters) { duke@435: for (int i = 0; i < 6; i++) { duke@435: Register r = as_iRegister(i); duke@435: if (r != preserve1 && r != preserve2) set(0xdead, r); duke@435: } duke@435: } duke@435: if (oregisters) { duke@435: for (int i = 0; i < 6; i++) { duke@435: Register r = as_oRegister(i); duke@435: if (r != preserve1 && r != preserve2) set(0xdead, r); duke@435: } duke@435: } duke@435: if (lregisters) { duke@435: for (int i = 0; i < 8; i++) { duke@435: Register r = as_lRegister(i); duke@435: if (r != preserve1 && r != preserve2) set(0xdead, r); duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: #endif