Wed, 08 Apr 2009 10:56:49 -0700
6655638: dynamic languages need method handles
Summary: initial implementation, with known omissions (x86/64, sparc, compiler optim., c-oops, C++ interp.)
Reviewed-by: kvn, twisti, never
duke@435 | 1 | /* |
xdono@631 | 2 | * Copyright 1999-2008 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_c1_MacroAssembler_sparc.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | void C1_MacroAssembler::inline_cache_check(Register receiver, Register iCache) { |
duke@435 | 29 | Label L; |
duke@435 | 30 | const Register temp_reg = G3_scratch; |
duke@435 | 31 | // Note: needs more testing of out-of-line vs. inline slow case |
duke@435 | 32 | Address ic_miss(temp_reg, SharedRuntime::get_ic_miss_stub()); |
duke@435 | 33 | verify_oop(receiver); |
duke@435 | 34 | ld_ptr(receiver, oopDesc::klass_offset_in_bytes(), temp_reg); |
duke@435 | 35 | cmp(temp_reg, iCache); |
duke@435 | 36 | brx(Assembler::equal, true, Assembler::pt, L); |
duke@435 | 37 | delayed()->nop(); |
duke@435 | 38 | jump_to(ic_miss, 0); |
duke@435 | 39 | delayed()->nop(); |
duke@435 | 40 | align(CodeEntryAlignment); |
duke@435 | 41 | bind(L); |
duke@435 | 42 | } |
duke@435 | 43 | |
duke@435 | 44 | |
duke@435 | 45 | void C1_MacroAssembler::method_exit(bool restore_frame) { |
duke@435 | 46 | // this code must be structured this way so that the return |
duke@435 | 47 | // instruction can be a safepoint. |
duke@435 | 48 | if (restore_frame) { |
duke@435 | 49 | restore(); |
duke@435 | 50 | } |
duke@435 | 51 | retl(); |
duke@435 | 52 | delayed()->nop(); |
duke@435 | 53 | } |
duke@435 | 54 | |
duke@435 | 55 | |
duke@435 | 56 | void C1_MacroAssembler::explicit_null_check(Register base) { |
duke@435 | 57 | Unimplemented(); |
duke@435 | 58 | } |
duke@435 | 59 | |
duke@435 | 60 | |
duke@435 | 61 | void C1_MacroAssembler::build_frame(int frame_size_in_bytes) { |
duke@435 | 62 | |
duke@435 | 63 | generate_stack_overflow_check(frame_size_in_bytes); |
duke@435 | 64 | // Create the frame. |
duke@435 | 65 | save_frame_c1(frame_size_in_bytes); |
duke@435 | 66 | } |
duke@435 | 67 | |
duke@435 | 68 | |
duke@435 | 69 | void C1_MacroAssembler::unverified_entry(Register receiver, Register ic_klass) { |
duke@435 | 70 | if (C1Breakpoint) breakpoint_trap(); |
duke@435 | 71 | inline_cache_check(receiver, ic_klass); |
duke@435 | 72 | } |
duke@435 | 73 | |
duke@435 | 74 | |
duke@435 | 75 | void C1_MacroAssembler::verified_entry() { |
duke@435 | 76 | if (C1Breakpoint) breakpoint_trap(); |
duke@435 | 77 | // build frame |
duke@435 | 78 | verify_FPU(0, "method_entry"); |
duke@435 | 79 | } |
duke@435 | 80 | |
duke@435 | 81 | |
duke@435 | 82 | void C1_MacroAssembler::lock_object(Register Rmark, Register Roop, Register Rbox, Register Rscratch, Label& slow_case) { |
duke@435 | 83 | assert_different_registers(Rmark, Roop, Rbox, Rscratch); |
duke@435 | 84 | |
duke@435 | 85 | Label done; |
duke@435 | 86 | |
duke@435 | 87 | Address mark_addr(Roop, 0, oopDesc::mark_offset_in_bytes()); |
duke@435 | 88 | |
duke@435 | 89 | // The following move must be the first instruction of emitted since debug |
duke@435 | 90 | // information may be generated for it. |
duke@435 | 91 | // Load object header |
duke@435 | 92 | ld_ptr(mark_addr, Rmark); |
duke@435 | 93 | |
duke@435 | 94 | verify_oop(Roop); |
duke@435 | 95 | |
duke@435 | 96 | // save object being locked into the BasicObjectLock |
duke@435 | 97 | st_ptr(Roop, Rbox, BasicObjectLock::obj_offset_in_bytes()); |
duke@435 | 98 | |
duke@435 | 99 | if (UseBiasedLocking) { |
duke@435 | 100 | biased_locking_enter(Roop, Rmark, Rscratch, done, &slow_case); |
duke@435 | 101 | } |
duke@435 | 102 | |
duke@435 | 103 | // Save Rbox in Rscratch to be used for the cas operation |
duke@435 | 104 | mov(Rbox, Rscratch); |
duke@435 | 105 | |
duke@435 | 106 | // and mark it unlocked |
duke@435 | 107 | or3(Rmark, markOopDesc::unlocked_value, Rmark); |
duke@435 | 108 | |
duke@435 | 109 | // save unlocked object header into the displaced header location on the stack |
duke@435 | 110 | st_ptr(Rmark, Rbox, BasicLock::displaced_header_offset_in_bytes()); |
duke@435 | 111 | |
duke@435 | 112 | // compare object markOop with Rmark and if equal exchange Rscratch with object markOop |
duke@435 | 113 | assert(mark_addr.disp() == 0, "cas must take a zero displacement"); |
duke@435 | 114 | casx_under_lock(mark_addr.base(), Rmark, Rscratch, (address)StubRoutines::Sparc::atomic_memory_operation_lock_addr()); |
duke@435 | 115 | // if compare/exchange succeeded we found an unlocked object and we now have locked it |
duke@435 | 116 | // hence we are done |
duke@435 | 117 | cmp(Rmark, Rscratch); |
duke@435 | 118 | brx(Assembler::equal, false, Assembler::pt, done); |
duke@435 | 119 | delayed()->sub(Rscratch, SP, Rscratch); //pull next instruction into delay slot |
duke@435 | 120 | // we did not find an unlocked object so see if this is a recursive case |
duke@435 | 121 | // sub(Rscratch, SP, Rscratch); |
duke@435 | 122 | assert(os::vm_page_size() > 0xfff, "page size too small - change the constant"); |
duke@435 | 123 | andcc(Rscratch, 0xfffff003, Rscratch); |
duke@435 | 124 | brx(Assembler::notZero, false, Assembler::pn, slow_case); |
duke@435 | 125 | delayed()->st_ptr(Rscratch, Rbox, BasicLock::displaced_header_offset_in_bytes()); |
duke@435 | 126 | bind(done); |
duke@435 | 127 | } |
duke@435 | 128 | |
duke@435 | 129 | |
duke@435 | 130 | void C1_MacroAssembler::unlock_object(Register Rmark, Register Roop, Register Rbox, Label& slow_case) { |
duke@435 | 131 | assert_different_registers(Rmark, Roop, Rbox); |
duke@435 | 132 | |
duke@435 | 133 | Label done; |
duke@435 | 134 | |
duke@435 | 135 | Address mark_addr(Roop, 0, oopDesc::mark_offset_in_bytes()); |
duke@435 | 136 | assert(mark_addr.disp() == 0, "cas must take a zero displacement"); |
duke@435 | 137 | |
duke@435 | 138 | if (UseBiasedLocking) { |
duke@435 | 139 | // load the object out of the BasicObjectLock |
duke@435 | 140 | ld_ptr(Rbox, BasicObjectLock::obj_offset_in_bytes(), Roop); |
duke@435 | 141 | verify_oop(Roop); |
duke@435 | 142 | biased_locking_exit(mark_addr, Rmark, done); |
duke@435 | 143 | } |
duke@435 | 144 | // Test first it it is a fast recursive unlock |
duke@435 | 145 | ld_ptr(Rbox, BasicLock::displaced_header_offset_in_bytes(), Rmark); |
duke@435 | 146 | br_null(Rmark, false, Assembler::pt, done); |
duke@435 | 147 | delayed()->nop(); |
duke@435 | 148 | if (!UseBiasedLocking) { |
duke@435 | 149 | // load object |
duke@435 | 150 | ld_ptr(Rbox, BasicObjectLock::obj_offset_in_bytes(), Roop); |
duke@435 | 151 | verify_oop(Roop); |
duke@435 | 152 | } |
duke@435 | 153 | |
duke@435 | 154 | // Check if it is still a light weight lock, this is is true if we see |
duke@435 | 155 | // the stack address of the basicLock in the markOop of the object |
duke@435 | 156 | casx_under_lock(mark_addr.base(), Rbox, Rmark, (address)StubRoutines::Sparc::atomic_memory_operation_lock_addr()); |
duke@435 | 157 | cmp(Rbox, Rmark); |
duke@435 | 158 | |
duke@435 | 159 | brx(Assembler::notEqual, false, Assembler::pn, slow_case); |
duke@435 | 160 | delayed()->nop(); |
duke@435 | 161 | // Done |
duke@435 | 162 | bind(done); |
duke@435 | 163 | } |
duke@435 | 164 | |
duke@435 | 165 | |
duke@435 | 166 | void C1_MacroAssembler::try_allocate( |
duke@435 | 167 | Register obj, // result: pointer to object after successful allocation |
duke@435 | 168 | Register var_size_in_bytes, // object size in bytes if unknown at compile time; invalid otherwise |
duke@435 | 169 | int con_size_in_bytes, // object size in bytes if known at compile time |
duke@435 | 170 | Register t1, // temp register |
duke@435 | 171 | Register t2, // temp register |
duke@435 | 172 | Label& slow_case // continuation point if fast allocation fails |
duke@435 | 173 | ) { |
duke@435 | 174 | if (UseTLAB) { |
duke@435 | 175 | tlab_allocate(obj, var_size_in_bytes, con_size_in_bytes, t1, slow_case); |
duke@435 | 176 | } else { |
duke@435 | 177 | eden_allocate(obj, var_size_in_bytes, con_size_in_bytes, t1, t2, slow_case); |
duke@435 | 178 | } |
duke@435 | 179 | } |
duke@435 | 180 | |
duke@435 | 181 | |
duke@435 | 182 | void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register len, Register t1, Register t2) { |
duke@435 | 183 | assert_different_registers(obj, klass, len, t1, t2); |
duke@435 | 184 | if (UseBiasedLocking && !len->is_valid()) { |
duke@435 | 185 | ld_ptr(klass, Klass::prototype_header_offset_in_bytes() + klassOopDesc::klass_part_offset_in_bytes(), t1); |
duke@435 | 186 | } else { |
duke@435 | 187 | set((intx)markOopDesc::prototype(), t1); |
duke@435 | 188 | } |
duke@435 | 189 | st_ptr(t1 , obj, oopDesc::mark_offset_in_bytes ()); |
duke@435 | 190 | st_ptr(klass, obj, oopDesc::klass_offset_in_bytes ()); |
duke@435 | 191 | if (len->is_valid()) st(len , obj, arrayOopDesc::length_offset_in_bytes()); |
duke@435 | 192 | } |
duke@435 | 193 | |
duke@435 | 194 | |
duke@435 | 195 | void C1_MacroAssembler::initialize_body(Register base, Register index) { |
duke@435 | 196 | assert_different_registers(base, index); |
duke@435 | 197 | Label loop; |
duke@435 | 198 | bind(loop); |
duke@435 | 199 | subcc(index, HeapWordSize, index); |
duke@435 | 200 | brx(Assembler::greaterEqual, true, Assembler::pt, loop); |
duke@435 | 201 | delayed()->st_ptr(G0, base, index); |
duke@435 | 202 | } |
duke@435 | 203 | |
duke@435 | 204 | |
duke@435 | 205 | void C1_MacroAssembler::allocate_object( |
duke@435 | 206 | Register obj, // result: pointer to object after successful allocation |
duke@435 | 207 | Register t1, // temp register |
duke@435 | 208 | Register t2, // temp register |
duke@435 | 209 | Register t3, // temp register |
duke@435 | 210 | int hdr_size, // object header size in words |
duke@435 | 211 | int obj_size, // object size in words |
duke@435 | 212 | Register klass, // object klass |
duke@435 | 213 | Label& slow_case // continuation point if fast allocation fails |
duke@435 | 214 | ) { |
duke@435 | 215 | assert_different_registers(obj, t1, t2, t3, klass); |
duke@435 | 216 | assert(klass == G5, "must be G5"); |
duke@435 | 217 | |
duke@435 | 218 | // allocate space & initialize header |
duke@435 | 219 | if (!is_simm13(obj_size * wordSize)) { |
duke@435 | 220 | // would need to use extra register to load |
duke@435 | 221 | // object size => go the slow case for now |
duke@435 | 222 | br(Assembler::always, false, Assembler::pt, slow_case); |
duke@435 | 223 | delayed()->nop(); |
duke@435 | 224 | return; |
duke@435 | 225 | } |
duke@435 | 226 | try_allocate(obj, noreg, obj_size * wordSize, t2, t3, slow_case); |
duke@435 | 227 | |
duke@435 | 228 | initialize_object(obj, klass, noreg, obj_size * HeapWordSize, t1, t2); |
duke@435 | 229 | } |
duke@435 | 230 | |
duke@435 | 231 | void C1_MacroAssembler::initialize_object( |
duke@435 | 232 | Register obj, // result: pointer to object after successful allocation |
duke@435 | 233 | Register klass, // object klass |
duke@435 | 234 | Register var_size_in_bytes, // object size in bytes if unknown at compile time; invalid otherwise |
duke@435 | 235 | int con_size_in_bytes, // object size in bytes if known at compile time |
duke@435 | 236 | Register t1, // temp register |
duke@435 | 237 | Register t2 // temp register |
duke@435 | 238 | ) { |
coleenp@548 | 239 | const int hdr_size_in_bytes = instanceOopDesc::base_offset_in_bytes(); |
duke@435 | 240 | |
duke@435 | 241 | initialize_header(obj, klass, noreg, t1, t2); |
duke@435 | 242 | |
duke@435 | 243 | #ifdef ASSERT |
duke@435 | 244 | { |
duke@435 | 245 | Label ok; |
duke@435 | 246 | ld(klass, klassOopDesc::header_size() * HeapWordSize + Klass::layout_helper_offset_in_bytes(), t1); |
duke@435 | 247 | if (var_size_in_bytes != noreg) { |
duke@435 | 248 | cmp(t1, var_size_in_bytes); |
duke@435 | 249 | } else { |
duke@435 | 250 | cmp(t1, con_size_in_bytes); |
duke@435 | 251 | } |
duke@435 | 252 | brx(Assembler::equal, false, Assembler::pt, ok); |
duke@435 | 253 | delayed()->nop(); |
duke@435 | 254 | stop("bad size in initialize_object"); |
duke@435 | 255 | should_not_reach_here(); |
duke@435 | 256 | |
duke@435 | 257 | bind(ok); |
duke@435 | 258 | } |
duke@435 | 259 | |
duke@435 | 260 | #endif |
duke@435 | 261 | |
duke@435 | 262 | // initialize body |
duke@435 | 263 | const int threshold = 5 * HeapWordSize; // approximate break even point for code size |
duke@435 | 264 | if (var_size_in_bytes != noreg) { |
duke@435 | 265 | // use a loop |
duke@435 | 266 | add(obj, hdr_size_in_bytes, t1); // compute address of first element |
duke@435 | 267 | sub(var_size_in_bytes, hdr_size_in_bytes, t2); // compute size of body |
duke@435 | 268 | initialize_body(t1, t2); |
duke@435 | 269 | #ifndef _LP64 |
duke@435 | 270 | } else if (VM_Version::v9_instructions_work() && con_size_in_bytes < threshold * 2) { |
duke@435 | 271 | // on v9 we can do double word stores to fill twice as much space. |
duke@435 | 272 | assert(hdr_size_in_bytes % 8 == 0, "double word aligned"); |
duke@435 | 273 | assert(con_size_in_bytes % 8 == 0, "double word aligned"); |
duke@435 | 274 | for (int i = hdr_size_in_bytes; i < con_size_in_bytes; i += 2 * HeapWordSize) stx(G0, obj, i); |
duke@435 | 275 | #endif |
duke@435 | 276 | } else if (con_size_in_bytes <= threshold) { |
duke@435 | 277 | // use explicit NULL stores |
duke@435 | 278 | for (int i = hdr_size_in_bytes; i < con_size_in_bytes; i += HeapWordSize) st_ptr(G0, obj, i); |
duke@435 | 279 | } else if (con_size_in_bytes > hdr_size_in_bytes) { |
duke@435 | 280 | // use a loop |
duke@435 | 281 | const Register base = t1; |
duke@435 | 282 | const Register index = t2; |
duke@435 | 283 | add(obj, hdr_size_in_bytes, base); // compute address of first element |
duke@435 | 284 | // compute index = number of words to clear |
duke@435 | 285 | set(con_size_in_bytes - hdr_size_in_bytes, index); |
duke@435 | 286 | initialize_body(base, index); |
duke@435 | 287 | } |
duke@435 | 288 | |
duke@435 | 289 | if (DTraceAllocProbes) { |
duke@435 | 290 | assert(obj == O0, "must be"); |
duke@435 | 291 | call(CAST_FROM_FN_PTR(address, Runtime1::entry_for(Runtime1::dtrace_object_alloc_id)), |
duke@435 | 292 | relocInfo::runtime_call_type); |
duke@435 | 293 | delayed()->nop(); |
duke@435 | 294 | } |
duke@435 | 295 | |
duke@435 | 296 | verify_oop(obj); |
duke@435 | 297 | } |
duke@435 | 298 | |
duke@435 | 299 | |
duke@435 | 300 | void C1_MacroAssembler::allocate_array( |
duke@435 | 301 | Register obj, // result: pointer to array after successful allocation |
duke@435 | 302 | Register len, // array length |
duke@435 | 303 | Register t1, // temp register |
duke@435 | 304 | Register t2, // temp register |
duke@435 | 305 | Register t3, // temp register |
duke@435 | 306 | int hdr_size, // object header size in words |
duke@435 | 307 | int elt_size, // element size in bytes |
duke@435 | 308 | Register klass, // object klass |
duke@435 | 309 | Label& slow_case // continuation point if fast allocation fails |
duke@435 | 310 | ) { |
duke@435 | 311 | assert_different_registers(obj, len, t1, t2, t3, klass); |
duke@435 | 312 | assert(klass == G5, "must be G5"); |
duke@435 | 313 | assert(t1 == G1, "must be G1"); |
duke@435 | 314 | |
duke@435 | 315 | // determine alignment mask |
duke@435 | 316 | assert(!(BytesPerWord & 1), "must be a multiple of 2 for masking code to work"); |
duke@435 | 317 | |
duke@435 | 318 | // check for negative or excessive length |
duke@435 | 319 | // note: the maximum length allowed is chosen so that arrays of any |
duke@435 | 320 | // element size with this length are always smaller or equal |
duke@435 | 321 | // to the largest integer (i.e., array size computation will |
duke@435 | 322 | // not overflow) |
duke@435 | 323 | set(max_array_allocation_length, t1); |
duke@435 | 324 | cmp(len, t1); |
duke@435 | 325 | br(Assembler::greaterUnsigned, false, Assembler::pn, slow_case); |
duke@435 | 326 | |
duke@435 | 327 | // compute array size |
duke@435 | 328 | // note: if 0 <= len <= max_length, len*elt_size + header + alignment is |
duke@435 | 329 | // smaller or equal to the largest integer; also, since top is always |
duke@435 | 330 | // aligned, we can do the alignment here instead of at the end address |
duke@435 | 331 | // computation |
duke@435 | 332 | const Register arr_size = t1; |
duke@435 | 333 | switch (elt_size) { |
duke@435 | 334 | case 1: delayed()->mov(len, arr_size); break; |
duke@435 | 335 | case 2: delayed()->sll(len, 1, arr_size); break; |
duke@435 | 336 | case 4: delayed()->sll(len, 2, arr_size); break; |
duke@435 | 337 | case 8: delayed()->sll(len, 3, arr_size); break; |
duke@435 | 338 | default: ShouldNotReachHere(); |
duke@435 | 339 | } |
duke@435 | 340 | add(arr_size, hdr_size * wordSize + MinObjAlignmentInBytesMask, arr_size); // add space for header & alignment |
duke@435 | 341 | and3(arr_size, ~MinObjAlignmentInBytesMask, arr_size); // align array size |
duke@435 | 342 | |
duke@435 | 343 | // allocate space & initialize header |
duke@435 | 344 | if (UseTLAB) { |
duke@435 | 345 | tlab_allocate(obj, arr_size, 0, t2, slow_case); |
duke@435 | 346 | } else { |
duke@435 | 347 | eden_allocate(obj, arr_size, 0, t2, t3, slow_case); |
duke@435 | 348 | } |
duke@435 | 349 | initialize_header(obj, klass, len, t2, t3); |
duke@435 | 350 | |
duke@435 | 351 | // initialize body |
duke@435 | 352 | const Register base = t2; |
duke@435 | 353 | const Register index = t3; |
duke@435 | 354 | add(obj, hdr_size * wordSize, base); // compute address of first element |
duke@435 | 355 | sub(arr_size, hdr_size * wordSize, index); // compute index = number of words to clear |
duke@435 | 356 | initialize_body(base, index); |
duke@435 | 357 | |
duke@435 | 358 | if (DTraceAllocProbes) { |
duke@435 | 359 | assert(obj == O0, "must be"); |
duke@435 | 360 | call(CAST_FROM_FN_PTR(address, Runtime1::entry_for(Runtime1::dtrace_object_alloc_id)), |
duke@435 | 361 | relocInfo::runtime_call_type); |
duke@435 | 362 | delayed()->nop(); |
duke@435 | 363 | } |
duke@435 | 364 | |
duke@435 | 365 | verify_oop(obj); |
duke@435 | 366 | } |
duke@435 | 367 | |
duke@435 | 368 | |
duke@435 | 369 | #ifndef PRODUCT |
duke@435 | 370 | |
duke@435 | 371 | void C1_MacroAssembler::verify_stack_oop(int stack_offset) { |
duke@435 | 372 | if (!VerifyOops) return; |
duke@435 | 373 | verify_oop_addr(Address(SP, 0, stack_offset + STACK_BIAS)); |
duke@435 | 374 | } |
duke@435 | 375 | |
duke@435 | 376 | void C1_MacroAssembler::verify_not_null_oop(Register r) { |
duke@435 | 377 | Label not_null; |
duke@435 | 378 | br_zero(Assembler::notEqual, false, Assembler::pt, r, not_null); |
duke@435 | 379 | delayed()->nop(); |
duke@435 | 380 | stop("non-null oop required"); |
duke@435 | 381 | bind(not_null); |
duke@435 | 382 | if (!VerifyOops) return; |
duke@435 | 383 | verify_oop(r); |
duke@435 | 384 | } |
duke@435 | 385 | |
duke@435 | 386 | void C1_MacroAssembler::invalidate_registers(bool iregisters, bool lregisters, bool oregisters, |
duke@435 | 387 | Register preserve1, Register preserve2) { |
duke@435 | 388 | if (iregisters) { |
duke@435 | 389 | for (int i = 0; i < 6; i++) { |
duke@435 | 390 | Register r = as_iRegister(i); |
duke@435 | 391 | if (r != preserve1 && r != preserve2) set(0xdead, r); |
duke@435 | 392 | } |
duke@435 | 393 | } |
duke@435 | 394 | if (oregisters) { |
duke@435 | 395 | for (int i = 0; i < 6; i++) { |
duke@435 | 396 | Register r = as_oRegister(i); |
duke@435 | 397 | if (r != preserve1 && r != preserve2) set(0xdead, r); |
duke@435 | 398 | } |
duke@435 | 399 | } |
duke@435 | 400 | if (lregisters) { |
duke@435 | 401 | for (int i = 0; i < 8; i++) { |
duke@435 | 402 | Register r = as_lRegister(i); |
duke@435 | 403 | if (r != preserve1 && r != preserve2) set(0xdead, r); |
duke@435 | 404 | } |
duke@435 | 405 | } |
duke@435 | 406 | } |
duke@435 | 407 | |
duke@435 | 408 | |
duke@435 | 409 | #endif |