src/cpu/sparc/vm/assembler_sparc.hpp

Fri, 20 Mar 2009 23:19:36 -0700

author
jrose
date
Fri, 20 Mar 2009 23:19:36 -0700
changeset 1100
c89f86385056
parent 1079
c517646eef23
child 1145
e5b0439ef4ae
permissions
-rw-r--r--

6814659: separable cleanups and subroutines for 6655638
Summary: preparatory but separable changes for method handles
Reviewed-by: kvn, never

duke@435 1 /*
jrose@1100 2 * Copyright 1997-2009 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 class BiasedLockingCounters;
duke@435 26
duke@435 27 // <sys/trap.h> promises that the system will not use traps 16-31
duke@435 28 #define ST_RESERVED_FOR_USER_0 0x10
duke@435 29
duke@435 30 /* Written: David Ungar 4/19/97 */
duke@435 31
duke@435 32 // Contains all the definitions needed for sparc assembly code generation.
duke@435 33
duke@435 34 // Register aliases for parts of the system:
duke@435 35
duke@435 36 // 64 bit values can be kept in g1-g5, o1-o5 and o7 and all 64 bits are safe
duke@435 37 // across context switches in V8+ ABI. Of course, there are no 64 bit regs
duke@435 38 // in V8 ABI. All 64 bits are preserved in V9 ABI for all registers.
duke@435 39
duke@435 40 // g2-g4 are scratch registers called "application globals". Their
duke@435 41 // meaning is reserved to the "compilation system"--which means us!
duke@435 42 // They are are not supposed to be touched by ordinary C code, although
duke@435 43 // highly-optimized C code might steal them for temps. They are safe
duke@435 44 // across thread switches, and the ABI requires that they be safe
duke@435 45 // across function calls.
duke@435 46 //
duke@435 47 // g1 and g3 are touched by more modules. V8 allows g1 to be clobbered
duke@435 48 // across func calls, and V8+ also allows g5 to be clobbered across
duke@435 49 // func calls. Also, g1 and g5 can get touched while doing shared
duke@435 50 // library loading.
duke@435 51 //
duke@435 52 // We must not touch g7 (it is the thread-self register) and g6 is
duke@435 53 // reserved for certain tools. g0, of course, is always zero.
duke@435 54 //
duke@435 55 // (Sources: SunSoft Compilers Group, thread library engineers.)
duke@435 56
duke@435 57 // %%%% The interpreter should be revisited to reduce global scratch regs.
duke@435 58
duke@435 59 // This global always holds the current JavaThread pointer:
duke@435 60
duke@435 61 REGISTER_DECLARATION(Register, G2_thread , G2);
coleenp@548 62 REGISTER_DECLARATION(Register, G6_heapbase , G6);
duke@435 63
duke@435 64 // The following globals are part of the Java calling convention:
duke@435 65
duke@435 66 REGISTER_DECLARATION(Register, G5_method , G5);
duke@435 67 REGISTER_DECLARATION(Register, G5_megamorphic_method , G5_method);
duke@435 68 REGISTER_DECLARATION(Register, G5_inline_cache_reg , G5_method);
duke@435 69
duke@435 70 // The following globals are used for the new C1 & interpreter calling convention:
duke@435 71 REGISTER_DECLARATION(Register, Gargs , G4); // pointing to the last argument
duke@435 72
duke@435 73 // This local is used to preserve G2_thread in the interpreter and in stubs:
duke@435 74 REGISTER_DECLARATION(Register, L7_thread_cache , L7);
duke@435 75
duke@435 76 // These globals are used as scratch registers in the interpreter:
duke@435 77
duke@435 78 REGISTER_DECLARATION(Register, Gframe_size , G1); // SAME REG as G1_scratch
duke@435 79 REGISTER_DECLARATION(Register, G1_scratch , G1); // also SAME
duke@435 80 REGISTER_DECLARATION(Register, G3_scratch , G3);
duke@435 81 REGISTER_DECLARATION(Register, G4_scratch , G4);
duke@435 82
duke@435 83 // These globals are used as short-lived scratch registers in the compiler:
duke@435 84
duke@435 85 REGISTER_DECLARATION(Register, Gtemp , G5);
duke@435 86
duke@435 87 // The compiler requires that G5_megamorphic_method is G5_inline_cache_klass,
duke@435 88 // because a single patchable "set" instruction (NativeMovConstReg,
duke@435 89 // or NativeMovConstPatching for compiler1) instruction
duke@435 90 // serves to set up either quantity, depending on whether the compiled
duke@435 91 // call site is an inline cache or is megamorphic. See the function
duke@435 92 // CompiledIC::set_to_megamorphic.
duke@435 93 //
duke@435 94 // On the other hand, G5_inline_cache_klass must differ from G5_method,
duke@435 95 // because both registers are needed for an inline cache that calls
duke@435 96 // an interpreted method.
duke@435 97 //
duke@435 98 // Note that G5_method is only the method-self for the interpreter,
duke@435 99 // and is logically unrelated to G5_megamorphic_method.
duke@435 100 //
duke@435 101 // Invariants on G2_thread (the JavaThread pointer):
duke@435 102 // - it should not be used for any other purpose anywhere
duke@435 103 // - it must be re-initialized by StubRoutines::call_stub()
duke@435 104 // - it must be preserved around every use of call_VM
duke@435 105
duke@435 106 // We can consider using g2/g3/g4 to cache more values than the
duke@435 107 // JavaThread, such as the card-marking base or perhaps pointers into
duke@435 108 // Eden. It's something of a waste to use them as scratch temporaries,
duke@435 109 // since they are not supposed to be volatile. (Of course, if we find
duke@435 110 // that Java doesn't benefit from application globals, then we can just
duke@435 111 // use them as ordinary temporaries.)
duke@435 112 //
duke@435 113 // Since g1 and g5 (and/or g6) are the volatile (caller-save) registers,
duke@435 114 // it makes sense to use them routinely for procedure linkage,
duke@435 115 // whenever the On registers are not applicable. Examples: G5_method,
duke@435 116 // G5_inline_cache_klass, and a double handful of miscellaneous compiler
duke@435 117 // stubs. This means that compiler stubs, etc., should be kept to a
duke@435 118 // maximum of two or three G-register arguments.
duke@435 119
duke@435 120
duke@435 121 // stub frames
duke@435 122
duke@435 123 REGISTER_DECLARATION(Register, Lentry_args , L0); // pointer to args passed to callee (interpreter) not stub itself
duke@435 124
duke@435 125 // Interpreter frames
duke@435 126
duke@435 127 #ifdef CC_INTERP
duke@435 128 REGISTER_DECLARATION(Register, Lstate , L0); // interpreter state object pointer
duke@435 129 REGISTER_DECLARATION(Register, L1_scratch , L1); // scratch
duke@435 130 REGISTER_DECLARATION(Register, Lmirror , L1); // mirror (for native methods only)
duke@435 131 REGISTER_DECLARATION(Register, L2_scratch , L2);
duke@435 132 REGISTER_DECLARATION(Register, L3_scratch , L3);
duke@435 133 REGISTER_DECLARATION(Register, L4_scratch , L4);
duke@435 134 REGISTER_DECLARATION(Register, Lscratch , L5); // C1 uses
duke@435 135 REGISTER_DECLARATION(Register, Lscratch2 , L6); // C1 uses
duke@435 136 REGISTER_DECLARATION(Register, L7_scratch , L7); // constant pool cache
duke@435 137 REGISTER_DECLARATION(Register, O5_savedSP , O5);
duke@435 138 REGISTER_DECLARATION(Register, I5_savedSP , I5); // Saved SP before bumping for locals. This is simply
duke@435 139 // a copy SP, so in 64-bit it's a biased value. The bias
duke@435 140 // is added and removed as needed in the frame code.
duke@435 141 // Interface to signature handler
duke@435 142 REGISTER_DECLARATION(Register, Llocals , L7); // pointer to locals for signature handler
duke@435 143 REGISTER_DECLARATION(Register, Lmethod , L6); // methodOop when calling signature handler
duke@435 144
duke@435 145 #else
duke@435 146 REGISTER_DECLARATION(Register, Lesp , L0); // expression stack pointer
duke@435 147 REGISTER_DECLARATION(Register, Lbcp , L1); // pointer to next bytecode
duke@435 148 REGISTER_DECLARATION(Register, Lmethod , L2);
duke@435 149 REGISTER_DECLARATION(Register, Llocals , L3);
duke@435 150 REGISTER_DECLARATION(Register, Largs , L3); // pointer to locals for signature handler
duke@435 151 // must match Llocals in asm interpreter
duke@435 152 REGISTER_DECLARATION(Register, Lmonitors , L4);
duke@435 153 REGISTER_DECLARATION(Register, Lbyte_code , L5);
duke@435 154 // When calling out from the interpreter we record SP so that we can remove any extra stack
duke@435 155 // space allocated during adapter transitions. This register is only live from the point
duke@435 156 // of the call until we return.
duke@435 157 REGISTER_DECLARATION(Register, Llast_SP , L5);
duke@435 158 REGISTER_DECLARATION(Register, Lscratch , L5);
duke@435 159 REGISTER_DECLARATION(Register, Lscratch2 , L6);
duke@435 160 REGISTER_DECLARATION(Register, LcpoolCache , L6); // constant pool cache
duke@435 161
duke@435 162 REGISTER_DECLARATION(Register, O5_savedSP , O5);
duke@435 163 REGISTER_DECLARATION(Register, I5_savedSP , I5); // Saved SP before bumping for locals. This is simply
duke@435 164 // a copy SP, so in 64-bit it's a biased value. The bias
duke@435 165 // is added and removed as needed in the frame code.
duke@435 166 REGISTER_DECLARATION(Register, IdispatchTables , I4); // Base address of the bytecode dispatch tables
duke@435 167 REGISTER_DECLARATION(Register, IdispatchAddress , I3); // Register which saves the dispatch address for each bytecode
duke@435 168 REGISTER_DECLARATION(Register, ImethodDataPtr , I2); // Pointer to the current method data
duke@435 169 #endif /* CC_INTERP */
duke@435 170
duke@435 171 // NOTE: Lscratch2 and LcpoolCache point to the same registers in
duke@435 172 // the interpreter code. If Lscratch2 needs to be used for some
duke@435 173 // purpose than LcpoolCache should be restore after that for
duke@435 174 // the interpreter to work right
duke@435 175 // (These assignments must be compatible with L7_thread_cache; see above.)
duke@435 176
duke@435 177 // Since Lbcp points into the middle of the method object,
duke@435 178 // it is temporarily converted into a "bcx" during GC.
duke@435 179
duke@435 180 // Exception processing
duke@435 181 // These registers are passed into exception handlers.
duke@435 182 // All exception handlers require the exception object being thrown.
duke@435 183 // In addition, an nmethod's exception handler must be passed
duke@435 184 // the address of the call site within the nmethod, to allow
duke@435 185 // proper selection of the applicable catch block.
duke@435 186 // (Interpreter frames use their own bcp() for this purpose.)
duke@435 187 //
duke@435 188 // The Oissuing_pc value is not always needed. When jumping to a
duke@435 189 // handler that is known to be interpreted, the Oissuing_pc value can be
duke@435 190 // omitted. An actual catch block in compiled code receives (from its
duke@435 191 // nmethod's exception handler) the thrown exception in the Oexception,
duke@435 192 // but it doesn't need the Oissuing_pc.
duke@435 193 //
duke@435 194 // If an exception handler (either interpreted or compiled)
duke@435 195 // discovers there is no applicable catch block, it updates
duke@435 196 // the Oissuing_pc to the continuation PC of its own caller,
duke@435 197 // pops back to that caller's stack frame, and executes that
duke@435 198 // caller's exception handler. Obviously, this process will
duke@435 199 // iterate until the control stack is popped back to a method
duke@435 200 // containing an applicable catch block. A key invariant is
duke@435 201 // that the Oissuing_pc value is always a value local to
duke@435 202 // the method whose exception handler is currently executing.
duke@435 203 //
duke@435 204 // Note: The issuing PC value is __not__ a raw return address (I7 value).
duke@435 205 // It is a "return pc", the address __following__ the call.
duke@435 206 // Raw return addresses are converted to issuing PCs by frame::pc(),
duke@435 207 // or by stubs. Issuing PCs can be used directly with PC range tables.
duke@435 208 //
duke@435 209 REGISTER_DECLARATION(Register, Oexception , O0); // exception being thrown
duke@435 210 REGISTER_DECLARATION(Register, Oissuing_pc , O1); // where the exception is coming from
duke@435 211
duke@435 212
duke@435 213 // These must occur after the declarations above
duke@435 214 #ifndef DONT_USE_REGISTER_DEFINES
duke@435 215
duke@435 216 #define Gthread AS_REGISTER(Register, Gthread)
duke@435 217 #define Gmethod AS_REGISTER(Register, Gmethod)
duke@435 218 #define Gmegamorphic_method AS_REGISTER(Register, Gmegamorphic_method)
duke@435 219 #define Ginline_cache_reg AS_REGISTER(Register, Ginline_cache_reg)
duke@435 220 #define Gargs AS_REGISTER(Register, Gargs)
duke@435 221 #define Lthread_cache AS_REGISTER(Register, Lthread_cache)
duke@435 222 #define Gframe_size AS_REGISTER(Register, Gframe_size)
duke@435 223 #define Gtemp AS_REGISTER(Register, Gtemp)
duke@435 224
duke@435 225 #ifdef CC_INTERP
duke@435 226 #define Lstate AS_REGISTER(Register, Lstate)
duke@435 227 #define Lesp AS_REGISTER(Register, Lesp)
duke@435 228 #define L1_scratch AS_REGISTER(Register, L1_scratch)
duke@435 229 #define Lmirror AS_REGISTER(Register, Lmirror)
duke@435 230 #define L2_scratch AS_REGISTER(Register, L2_scratch)
duke@435 231 #define L3_scratch AS_REGISTER(Register, L3_scratch)
duke@435 232 #define L4_scratch AS_REGISTER(Register, L4_scratch)
duke@435 233 #define Lscratch AS_REGISTER(Register, Lscratch)
duke@435 234 #define Lscratch2 AS_REGISTER(Register, Lscratch2)
duke@435 235 #define L7_scratch AS_REGISTER(Register, L7_scratch)
duke@435 236 #define Ostate AS_REGISTER(Register, Ostate)
duke@435 237 #else
duke@435 238 #define Lesp AS_REGISTER(Register, Lesp)
duke@435 239 #define Lbcp AS_REGISTER(Register, Lbcp)
duke@435 240 #define Lmethod AS_REGISTER(Register, Lmethod)
duke@435 241 #define Llocals AS_REGISTER(Register, Llocals)
duke@435 242 #define Lmonitors AS_REGISTER(Register, Lmonitors)
duke@435 243 #define Lbyte_code AS_REGISTER(Register, Lbyte_code)
duke@435 244 #define Lscratch AS_REGISTER(Register, Lscratch)
duke@435 245 #define Lscratch2 AS_REGISTER(Register, Lscratch2)
duke@435 246 #define LcpoolCache AS_REGISTER(Register, LcpoolCache)
duke@435 247 #endif /* ! CC_INTERP */
duke@435 248
duke@435 249 #define Lentry_args AS_REGISTER(Register, Lentry_args)
duke@435 250 #define I5_savedSP AS_REGISTER(Register, I5_savedSP)
duke@435 251 #define O5_savedSP AS_REGISTER(Register, O5_savedSP)
duke@435 252 #define IdispatchAddress AS_REGISTER(Register, IdispatchAddress)
duke@435 253 #define ImethodDataPtr AS_REGISTER(Register, ImethodDataPtr)
duke@435 254 #define IdispatchTables AS_REGISTER(Register, IdispatchTables)
duke@435 255
duke@435 256 #define Oexception AS_REGISTER(Register, Oexception)
duke@435 257 #define Oissuing_pc AS_REGISTER(Register, Oissuing_pc)
duke@435 258
duke@435 259
duke@435 260 #endif
duke@435 261
duke@435 262 // Address is an abstraction used to represent a memory location.
duke@435 263 //
duke@435 264 // Note: A register location is represented via a Register, not
duke@435 265 // via an address for efficiency & simplicity reasons.
duke@435 266
duke@435 267 class Address VALUE_OBJ_CLASS_SPEC {
duke@435 268 private:
duke@435 269 Register _base;
duke@435 270 #ifdef _LP64
duke@435 271 int _hi32; // bits 63::32
duke@435 272 int _low32; // bits 31::0
duke@435 273 #endif
duke@435 274 int _hi;
duke@435 275 int _disp;
duke@435 276 RelocationHolder _rspec;
duke@435 277
duke@435 278 RelocationHolder rspec_from_rtype(relocInfo::relocType rt, address a = NULL) {
duke@435 279 switch (rt) {
duke@435 280 case relocInfo::external_word_type:
duke@435 281 return external_word_Relocation::spec(a);
duke@435 282 case relocInfo::internal_word_type:
duke@435 283 return internal_word_Relocation::spec(a);
duke@435 284 #ifdef _LP64
duke@435 285 case relocInfo::opt_virtual_call_type:
duke@435 286 return opt_virtual_call_Relocation::spec();
duke@435 287 case relocInfo::static_call_type:
duke@435 288 return static_call_Relocation::spec();
duke@435 289 case relocInfo::runtime_call_type:
duke@435 290 return runtime_call_Relocation::spec();
duke@435 291 #endif
duke@435 292 case relocInfo::none:
duke@435 293 return RelocationHolder();
duke@435 294 default:
duke@435 295 ShouldNotReachHere();
duke@435 296 return RelocationHolder();
duke@435 297 }
duke@435 298 }
duke@435 299
duke@435 300 public:
duke@435 301 Address(Register b, address a, relocInfo::relocType rt = relocInfo::none)
duke@435 302 : _rspec(rspec_from_rtype(rt, a))
duke@435 303 {
duke@435 304 _base = b;
duke@435 305 #ifdef _LP64
duke@435 306 _hi32 = (intptr_t)a >> 32; // top 32 bits in 64 bit word
duke@435 307 _low32 = (intptr_t)a & ~0; // low 32 bits in 64 bit word
duke@435 308 #endif
duke@435 309 _hi = (intptr_t)a & ~0x3ff; // top 22 bits in low word
duke@435 310 _disp = (intptr_t)a & 0x3ff; // bottom 10 bits
duke@435 311 }
duke@435 312
duke@435 313 Address(Register b, address a, RelocationHolder const& rspec)
duke@435 314 : _rspec(rspec)
duke@435 315 {
duke@435 316 _base = b;
duke@435 317 #ifdef _LP64
duke@435 318 _hi32 = (intptr_t)a >> 32; // top 32 bits in 64 bit word
duke@435 319 _low32 = (intptr_t)a & ~0; // low 32 bits in 64 bit word
duke@435 320 #endif
duke@435 321 _hi = (intptr_t)a & ~0x3ff; // top 22 bits
duke@435 322 _disp = (intptr_t)a & 0x3ff; // bottom 10 bits
duke@435 323 }
duke@435 324
duke@435 325 Address(Register b, intptr_t h, intptr_t d, RelocationHolder const& rspec = RelocationHolder())
duke@435 326 : _rspec(rspec)
duke@435 327 {
duke@435 328 _base = b;
duke@435 329 #ifdef _LP64
duke@435 330 // [RGV] Put in Assert to force me to check usage of this constructor
duke@435 331 assert( h == 0, "Check usage of this constructor" );
duke@435 332 _hi32 = h;
duke@435 333 _low32 = d;
duke@435 334 _hi = h;
duke@435 335 _disp = d;
duke@435 336 #else
duke@435 337 _hi = h;
duke@435 338 _disp = d;
duke@435 339 #endif
duke@435 340 }
duke@435 341
duke@435 342 Address()
duke@435 343 : _rspec(RelocationHolder())
duke@435 344 {
duke@435 345 _base = G0;
duke@435 346 #ifdef _LP64
duke@435 347 _hi32 = 0;
duke@435 348 _low32 = 0;
duke@435 349 #endif
duke@435 350 _hi = 0;
duke@435 351 _disp = 0;
duke@435 352 }
duke@435 353
duke@435 354 // fancier constructors
duke@435 355
duke@435 356 enum addr_type {
duke@435 357 extra_in_argument, // in the In registers
duke@435 358 extra_out_argument // in the Outs
duke@435 359 };
duke@435 360
duke@435 361 Address( addr_type, int );
duke@435 362
duke@435 363 // accessors
duke@435 364
duke@435 365 Register base() const { return _base; }
duke@435 366 #ifdef _LP64
duke@435 367 int hi32() const { return _hi32; }
duke@435 368 int low32() const { return _low32; }
duke@435 369 #endif
duke@435 370 int hi() const { return _hi; }
duke@435 371 int disp() const { return _disp; }
duke@435 372 #ifdef _LP64
duke@435 373 intptr_t value() const { return ((intptr_t)_hi32 << 32) |
duke@435 374 (intptr_t)(uint32_t)_low32; }
duke@435 375 #else
duke@435 376 int value() const { return _hi | _disp; }
duke@435 377 #endif
duke@435 378 const relocInfo::relocType rtype() { return _rspec.type(); }
duke@435 379 const RelocationHolder& rspec() { return _rspec; }
duke@435 380
duke@435 381 RelocationHolder rspec(int offset) const {
duke@435 382 return offset == 0 ? _rspec : _rspec.plus(offset);
duke@435 383 }
duke@435 384
duke@435 385 inline bool is_simm13(int offset = 0); // check disp+offset for overflow
duke@435 386
jrose@1057 387 Address plus_disp(int disp) const { // bump disp by a small amount
jrose@1057 388 Address a = (*this);
jrose@1057 389 a._disp += disp;
jrose@1057 390 return a;
jrose@1057 391 }
jrose@1057 392
duke@435 393 Address split_disp() const { // deal with disp overflow
duke@435 394 Address a = (*this);
duke@435 395 int hi_disp = _disp & ~0x3ff;
duke@435 396 if (hi_disp != 0) {
duke@435 397 a._disp -= hi_disp;
duke@435 398 a._hi += hi_disp;
duke@435 399 }
duke@435 400 return a;
duke@435 401 }
duke@435 402
duke@435 403 Address after_save() const {
duke@435 404 Address a = (*this);
duke@435 405 a._base = a._base->after_save();
duke@435 406 return a;
duke@435 407 }
duke@435 408
duke@435 409 Address after_restore() const {
duke@435 410 Address a = (*this);
duke@435 411 a._base = a._base->after_restore();
duke@435 412 return a;
duke@435 413 }
duke@435 414
duke@435 415 friend class Assembler;
duke@435 416 };
duke@435 417
duke@435 418
duke@435 419 inline Address RegisterImpl::address_in_saved_window() const {
duke@435 420 return (Address(SP, 0, (sp_offset_in_saved_window() * wordSize) + STACK_BIAS));
duke@435 421 }
duke@435 422
duke@435 423
duke@435 424
duke@435 425 // Argument is an abstraction used to represent an outgoing
duke@435 426 // actual argument or an incoming formal parameter, whether
duke@435 427 // it resides in memory or in a register, in a manner consistent
duke@435 428 // with the SPARC Application Binary Interface, or ABI. This is
duke@435 429 // often referred to as the native or C calling convention.
duke@435 430
duke@435 431 class Argument VALUE_OBJ_CLASS_SPEC {
duke@435 432 private:
duke@435 433 int _number;
duke@435 434 bool _is_in;
duke@435 435
duke@435 436 public:
duke@435 437 #ifdef _LP64
duke@435 438 enum {
duke@435 439 n_register_parameters = 6, // only 6 registers may contain integer parameters
duke@435 440 n_float_register_parameters = 16 // Can have up to 16 floating registers
duke@435 441 };
duke@435 442 #else
duke@435 443 enum {
duke@435 444 n_register_parameters = 6 // only 6 registers may contain integer parameters
duke@435 445 };
duke@435 446 #endif
duke@435 447
duke@435 448 // creation
duke@435 449 Argument(int number, bool is_in) : _number(number), _is_in(is_in) {}
duke@435 450
duke@435 451 int number() const { return _number; }
duke@435 452 bool is_in() const { return _is_in; }
duke@435 453 bool is_out() const { return !is_in(); }
duke@435 454
duke@435 455 Argument successor() const { return Argument(number() + 1, is_in()); }
duke@435 456 Argument as_in() const { return Argument(number(), true ); }
duke@435 457 Argument as_out() const { return Argument(number(), false); }
duke@435 458
duke@435 459 // locating register-based arguments:
duke@435 460 bool is_register() const { return _number < n_register_parameters; }
duke@435 461
duke@435 462 #ifdef _LP64
duke@435 463 // locating Floating Point register-based arguments:
duke@435 464 bool is_float_register() const { return _number < n_float_register_parameters; }
duke@435 465
duke@435 466 FloatRegister as_float_register() const {
duke@435 467 assert(is_float_register(), "must be a register argument");
duke@435 468 return as_FloatRegister(( number() *2 ) + 1);
duke@435 469 }
duke@435 470 FloatRegister as_double_register() const {
duke@435 471 assert(is_float_register(), "must be a register argument");
duke@435 472 return as_FloatRegister(( number() *2 ));
duke@435 473 }
duke@435 474 #endif
duke@435 475
duke@435 476 Register as_register() const {
duke@435 477 assert(is_register(), "must be a register argument");
duke@435 478 return is_in() ? as_iRegister(number()) : as_oRegister(number());
duke@435 479 }
duke@435 480
duke@435 481 // locating memory-based arguments
duke@435 482 Address as_address() const {
duke@435 483 assert(!is_register(), "must be a memory argument");
duke@435 484 return address_in_frame();
duke@435 485 }
duke@435 486
duke@435 487 // When applied to a register-based argument, give the corresponding address
duke@435 488 // into the 6-word area "into which callee may store register arguments"
duke@435 489 // (This is a different place than the corresponding register-save area location.)
duke@435 490 Address address_in_frame() const {
duke@435 491 return Address( is_in() ? Address::extra_in_argument
duke@435 492 : Address::extra_out_argument,
duke@435 493 _number );
duke@435 494 }
duke@435 495
duke@435 496 // debugging
duke@435 497 const char* name() const;
duke@435 498
duke@435 499 friend class Assembler;
duke@435 500 };
duke@435 501
duke@435 502
duke@435 503 // The SPARC Assembler: Pure assembler doing NO optimizations on the instruction
duke@435 504 // level; i.e., what you write
duke@435 505 // is what you get. The Assembler is generating code into a CodeBuffer.
duke@435 506
duke@435 507 class Assembler : public AbstractAssembler {
duke@435 508 protected:
duke@435 509
duke@435 510 static void print_instruction(int inst);
duke@435 511 static int patched_branch(int dest_pos, int inst, int inst_pos);
duke@435 512 static int branch_destination(int inst, int pos);
duke@435 513
duke@435 514
duke@435 515 friend class AbstractAssembler;
duke@435 516
duke@435 517 // code patchers need various routines like inv_wdisp()
duke@435 518 friend class NativeInstruction;
duke@435 519 friend class NativeGeneralJump;
duke@435 520 friend class Relocation;
duke@435 521 friend class Label;
duke@435 522
duke@435 523 public:
duke@435 524 // op carries format info; see page 62 & 267
duke@435 525
duke@435 526 enum ops {
duke@435 527 call_op = 1, // fmt 1
duke@435 528 branch_op = 0, // also sethi (fmt2)
duke@435 529 arith_op = 2, // fmt 3, arith & misc
duke@435 530 ldst_op = 3 // fmt 3, load/store
duke@435 531 };
duke@435 532
duke@435 533 enum op2s {
duke@435 534 bpr_op2 = 3,
duke@435 535 fb_op2 = 6,
duke@435 536 fbp_op2 = 5,
duke@435 537 br_op2 = 2,
duke@435 538 bp_op2 = 1,
duke@435 539 cb_op2 = 7, // V8
duke@435 540 sethi_op2 = 4
duke@435 541 };
duke@435 542
duke@435 543 enum op3s {
duke@435 544 // selected op3s
duke@435 545 add_op3 = 0x00,
duke@435 546 and_op3 = 0x01,
duke@435 547 or_op3 = 0x02,
duke@435 548 xor_op3 = 0x03,
duke@435 549 sub_op3 = 0x04,
duke@435 550 andn_op3 = 0x05,
duke@435 551 orn_op3 = 0x06,
duke@435 552 xnor_op3 = 0x07,
duke@435 553 addc_op3 = 0x08,
duke@435 554 mulx_op3 = 0x09,
duke@435 555 umul_op3 = 0x0a,
duke@435 556 smul_op3 = 0x0b,
duke@435 557 subc_op3 = 0x0c,
duke@435 558 udivx_op3 = 0x0d,
duke@435 559 udiv_op3 = 0x0e,
duke@435 560 sdiv_op3 = 0x0f,
duke@435 561
duke@435 562 addcc_op3 = 0x10,
duke@435 563 andcc_op3 = 0x11,
duke@435 564 orcc_op3 = 0x12,
duke@435 565 xorcc_op3 = 0x13,
duke@435 566 subcc_op3 = 0x14,
duke@435 567 andncc_op3 = 0x15,
duke@435 568 orncc_op3 = 0x16,
duke@435 569 xnorcc_op3 = 0x17,
duke@435 570 addccc_op3 = 0x18,
duke@435 571 umulcc_op3 = 0x1a,
duke@435 572 smulcc_op3 = 0x1b,
duke@435 573 subccc_op3 = 0x1c,
duke@435 574 udivcc_op3 = 0x1e,
duke@435 575 sdivcc_op3 = 0x1f,
duke@435 576
duke@435 577 taddcc_op3 = 0x20,
duke@435 578 tsubcc_op3 = 0x21,
duke@435 579 taddcctv_op3 = 0x22,
duke@435 580 tsubcctv_op3 = 0x23,
duke@435 581 mulscc_op3 = 0x24,
duke@435 582 sll_op3 = 0x25,
duke@435 583 sllx_op3 = 0x25,
duke@435 584 srl_op3 = 0x26,
duke@435 585 srlx_op3 = 0x26,
duke@435 586 sra_op3 = 0x27,
duke@435 587 srax_op3 = 0x27,
duke@435 588 rdreg_op3 = 0x28,
duke@435 589 membar_op3 = 0x28,
duke@435 590
duke@435 591 flushw_op3 = 0x2b,
duke@435 592 movcc_op3 = 0x2c,
duke@435 593 sdivx_op3 = 0x2d,
duke@435 594 popc_op3 = 0x2e,
duke@435 595 movr_op3 = 0x2f,
duke@435 596
duke@435 597 sir_op3 = 0x30,
duke@435 598 wrreg_op3 = 0x30,
duke@435 599 saved_op3 = 0x31,
duke@435 600
duke@435 601 fpop1_op3 = 0x34,
duke@435 602 fpop2_op3 = 0x35,
duke@435 603 impdep1_op3 = 0x36,
duke@435 604 impdep2_op3 = 0x37,
duke@435 605 jmpl_op3 = 0x38,
duke@435 606 rett_op3 = 0x39,
duke@435 607 trap_op3 = 0x3a,
duke@435 608 flush_op3 = 0x3b,
duke@435 609 save_op3 = 0x3c,
duke@435 610 restore_op3 = 0x3d,
duke@435 611 done_op3 = 0x3e,
duke@435 612 retry_op3 = 0x3e,
duke@435 613
duke@435 614 lduw_op3 = 0x00,
duke@435 615 ldub_op3 = 0x01,
duke@435 616 lduh_op3 = 0x02,
duke@435 617 ldd_op3 = 0x03,
duke@435 618 stw_op3 = 0x04,
duke@435 619 stb_op3 = 0x05,
duke@435 620 sth_op3 = 0x06,
duke@435 621 std_op3 = 0x07,
duke@435 622 ldsw_op3 = 0x08,
duke@435 623 ldsb_op3 = 0x09,
duke@435 624 ldsh_op3 = 0x0a,
duke@435 625 ldx_op3 = 0x0b,
duke@435 626
duke@435 627 ldstub_op3 = 0x0d,
duke@435 628 stx_op3 = 0x0e,
duke@435 629 swap_op3 = 0x0f,
duke@435 630
duke@435 631 lduwa_op3 = 0x10,
duke@435 632 ldxa_op3 = 0x1b,
duke@435 633
duke@435 634 stwa_op3 = 0x14,
duke@435 635 stxa_op3 = 0x1e,
duke@435 636
duke@435 637 ldf_op3 = 0x20,
duke@435 638 ldfsr_op3 = 0x21,
duke@435 639 ldqf_op3 = 0x22,
duke@435 640 lddf_op3 = 0x23,
duke@435 641 stf_op3 = 0x24,
duke@435 642 stfsr_op3 = 0x25,
duke@435 643 stqf_op3 = 0x26,
duke@435 644 stdf_op3 = 0x27,
duke@435 645
duke@435 646 prefetch_op3 = 0x2d,
duke@435 647
duke@435 648
duke@435 649 ldc_op3 = 0x30,
duke@435 650 ldcsr_op3 = 0x31,
duke@435 651 lddc_op3 = 0x33,
duke@435 652 stc_op3 = 0x34,
duke@435 653 stcsr_op3 = 0x35,
duke@435 654 stdcq_op3 = 0x36,
duke@435 655 stdc_op3 = 0x37,
duke@435 656
duke@435 657 casa_op3 = 0x3c,
duke@435 658 casxa_op3 = 0x3e,
duke@435 659
duke@435 660 alt_bit_op3 = 0x10,
duke@435 661 cc_bit_op3 = 0x10
duke@435 662 };
duke@435 663
duke@435 664 enum opfs {
duke@435 665 // selected opfs
duke@435 666 fmovs_opf = 0x01,
duke@435 667 fmovd_opf = 0x02,
duke@435 668
duke@435 669 fnegs_opf = 0x05,
duke@435 670 fnegd_opf = 0x06,
duke@435 671
duke@435 672 fadds_opf = 0x41,
duke@435 673 faddd_opf = 0x42,
duke@435 674 fsubs_opf = 0x45,
duke@435 675 fsubd_opf = 0x46,
duke@435 676
duke@435 677 fmuls_opf = 0x49,
duke@435 678 fmuld_opf = 0x4a,
duke@435 679 fdivs_opf = 0x4d,
duke@435 680 fdivd_opf = 0x4e,
duke@435 681
duke@435 682 fcmps_opf = 0x51,
duke@435 683 fcmpd_opf = 0x52,
duke@435 684
duke@435 685 fstox_opf = 0x81,
duke@435 686 fdtox_opf = 0x82,
duke@435 687 fxtos_opf = 0x84,
duke@435 688 fxtod_opf = 0x88,
duke@435 689 fitos_opf = 0xc4,
duke@435 690 fdtos_opf = 0xc6,
duke@435 691 fitod_opf = 0xc8,
duke@435 692 fstod_opf = 0xc9,
duke@435 693 fstoi_opf = 0xd1,
duke@435 694 fdtoi_opf = 0xd2
duke@435 695 };
duke@435 696
duke@435 697 enum RCondition { rc_z = 1, rc_lez = 2, rc_lz = 3, rc_nz = 5, rc_gz = 6, rc_gez = 7 };
duke@435 698
duke@435 699 enum Condition {
duke@435 700 // for FBfcc & FBPfcc instruction
duke@435 701 f_never = 0,
duke@435 702 f_notEqual = 1,
duke@435 703 f_notZero = 1,
duke@435 704 f_lessOrGreater = 2,
duke@435 705 f_unorderedOrLess = 3,
duke@435 706 f_less = 4,
duke@435 707 f_unorderedOrGreater = 5,
duke@435 708 f_greater = 6,
duke@435 709 f_unordered = 7,
duke@435 710 f_always = 8,
duke@435 711 f_equal = 9,
duke@435 712 f_zero = 9,
duke@435 713 f_unorderedOrEqual = 10,
duke@435 714 f_greaterOrEqual = 11,
duke@435 715 f_unorderedOrGreaterOrEqual = 12,
duke@435 716 f_lessOrEqual = 13,
duke@435 717 f_unorderedOrLessOrEqual = 14,
duke@435 718 f_ordered = 15,
duke@435 719
duke@435 720 // V8 coproc, pp 123 v8 manual
duke@435 721
duke@435 722 cp_always = 8,
duke@435 723 cp_never = 0,
duke@435 724 cp_3 = 7,
duke@435 725 cp_2 = 6,
duke@435 726 cp_2or3 = 5,
duke@435 727 cp_1 = 4,
duke@435 728 cp_1or3 = 3,
duke@435 729 cp_1or2 = 2,
duke@435 730 cp_1or2or3 = 1,
duke@435 731 cp_0 = 9,
duke@435 732 cp_0or3 = 10,
duke@435 733 cp_0or2 = 11,
duke@435 734 cp_0or2or3 = 12,
duke@435 735 cp_0or1 = 13,
duke@435 736 cp_0or1or3 = 14,
duke@435 737 cp_0or1or2 = 15,
duke@435 738
duke@435 739
duke@435 740 // for integers
duke@435 741
duke@435 742 never = 0,
duke@435 743 equal = 1,
duke@435 744 zero = 1,
duke@435 745 lessEqual = 2,
duke@435 746 less = 3,
duke@435 747 lessEqualUnsigned = 4,
duke@435 748 lessUnsigned = 5,
duke@435 749 carrySet = 5,
duke@435 750 negative = 6,
duke@435 751 overflowSet = 7,
duke@435 752 always = 8,
duke@435 753 notEqual = 9,
duke@435 754 notZero = 9,
duke@435 755 greater = 10,
duke@435 756 greaterEqual = 11,
duke@435 757 greaterUnsigned = 12,
duke@435 758 greaterEqualUnsigned = 13,
duke@435 759 carryClear = 13,
duke@435 760 positive = 14,
duke@435 761 overflowClear = 15
duke@435 762 };
duke@435 763
duke@435 764 enum CC {
duke@435 765 icc = 0, xcc = 2,
duke@435 766 // ptr_cc is the correct condition code for a pointer or intptr_t:
duke@435 767 ptr_cc = NOT_LP64(icc) LP64_ONLY(xcc),
duke@435 768 fcc0 = 0, fcc1 = 1, fcc2 = 2, fcc3 = 3
duke@435 769 };
duke@435 770
duke@435 771 enum PrefetchFcn {
duke@435 772 severalReads = 0, oneRead = 1, severalWritesAndPossiblyReads = 2, oneWrite = 3, page = 4
duke@435 773 };
duke@435 774
duke@435 775 public:
duke@435 776 // Helper functions for groups of instructions
duke@435 777
duke@435 778 enum Predict { pt = 1, pn = 0 }; // pt = predict taken
duke@435 779
duke@435 780 enum Membar_mask_bits { // page 184, v9
duke@435 781 StoreStore = 1 << 3,
duke@435 782 LoadStore = 1 << 2,
duke@435 783 StoreLoad = 1 << 1,
duke@435 784 LoadLoad = 1 << 0,
duke@435 785
duke@435 786 Sync = 1 << 6,
duke@435 787 MemIssue = 1 << 5,
duke@435 788 Lookaside = 1 << 4
duke@435 789 };
duke@435 790
duke@435 791 // test if x is within signed immediate range for nbits
duke@435 792 static bool is_simm(int x, int nbits) { return -( 1 << nbits-1 ) <= x && x < ( 1 << nbits-1 ); }
duke@435 793
duke@435 794 // test if -4096 <= x <= 4095
duke@435 795 static bool is_simm13(int x) { return is_simm(x, 13); }
duke@435 796
duke@435 797 enum ASIs { // page 72, v9
duke@435 798 ASI_PRIMARY = 0x80,
duke@435 799 ASI_PRIMARY_LITTLE = 0x88
duke@435 800 // add more from book as needed
duke@435 801 };
duke@435 802
duke@435 803 protected:
duke@435 804 // helpers
duke@435 805
duke@435 806 // x is supposed to fit in a field "nbits" wide
duke@435 807 // and be sign-extended. Check the range.
duke@435 808
duke@435 809 static void assert_signed_range(intptr_t x, int nbits) {
duke@435 810 assert( nbits == 32
duke@435 811 || -(1 << nbits-1) <= x && x < ( 1 << nbits-1),
duke@435 812 "value out of range");
duke@435 813 }
duke@435 814
duke@435 815 static void assert_signed_word_disp_range(intptr_t x, int nbits) {
duke@435 816 assert( (x & 3) == 0, "not word aligned");
duke@435 817 assert_signed_range(x, nbits + 2);
duke@435 818 }
duke@435 819
duke@435 820 static void assert_unsigned_const(int x, int nbits) {
duke@435 821 assert( juint(x) < juint(1 << nbits), "unsigned constant out of range");
duke@435 822 }
duke@435 823
duke@435 824 // fields: note bits numbered from LSB = 0,
duke@435 825 // fields known by inclusive bit range
duke@435 826
duke@435 827 static int fmask(juint hi_bit, juint lo_bit) {
duke@435 828 assert( hi_bit >= lo_bit && 0 <= lo_bit && hi_bit < 32, "bad bits");
duke@435 829 return (1 << ( hi_bit-lo_bit + 1 )) - 1;
duke@435 830 }
duke@435 831
duke@435 832 // inverse of u_field
duke@435 833
duke@435 834 static int inv_u_field(int x, int hi_bit, int lo_bit) {
duke@435 835 juint r = juint(x) >> lo_bit;
duke@435 836 r &= fmask( hi_bit, lo_bit);
duke@435 837 return int(r);
duke@435 838 }
duke@435 839
duke@435 840
duke@435 841 // signed version: extract from field and sign-extend
duke@435 842
duke@435 843 static int inv_s_field(int x, int hi_bit, int lo_bit) {
duke@435 844 int sign_shift = 31 - hi_bit;
duke@435 845 return inv_u_field( ((x << sign_shift) >> sign_shift), hi_bit, lo_bit);
duke@435 846 }
duke@435 847
duke@435 848 // given a field that ranges from hi_bit to lo_bit (inclusive,
duke@435 849 // LSB = 0), and an unsigned value for the field,
duke@435 850 // shift it into the field
duke@435 851
duke@435 852 #ifdef ASSERT
duke@435 853 static int u_field(int x, int hi_bit, int lo_bit) {
duke@435 854 assert( ( x & ~fmask(hi_bit, lo_bit)) == 0,
duke@435 855 "value out of range");
duke@435 856 int r = x << lo_bit;
duke@435 857 assert( inv_u_field(r, hi_bit, lo_bit) == x, "just checking");
duke@435 858 return r;
duke@435 859 }
duke@435 860 #else
duke@435 861 // make sure this is inlined as it will reduce code size significantly
duke@435 862 #define u_field(x, hi_bit, lo_bit) ((x) << (lo_bit))
duke@435 863 #endif
duke@435 864
duke@435 865 static int inv_op( int x ) { return inv_u_field(x, 31, 30); }
duke@435 866 static int inv_op2( int x ) { return inv_u_field(x, 24, 22); }
duke@435 867 static int inv_op3( int x ) { return inv_u_field(x, 24, 19); }
duke@435 868 static int inv_cond( int x ){ return inv_u_field(x, 28, 25); }
duke@435 869
duke@435 870 static bool inv_immed( int x ) { return (x & Assembler::immed(true)) != 0; }
duke@435 871
duke@435 872 static Register inv_rd( int x ) { return as_Register(inv_u_field(x, 29, 25)); }
duke@435 873 static Register inv_rs1( int x ) { return as_Register(inv_u_field(x, 18, 14)); }
duke@435 874 static Register inv_rs2( int x ) { return as_Register(inv_u_field(x, 4, 0)); }
duke@435 875
duke@435 876 static int op( int x) { return u_field(x, 31, 30); }
duke@435 877 static int rd( Register r) { return u_field(r->encoding(), 29, 25); }
duke@435 878 static int fcn( int x) { return u_field(x, 29, 25); }
duke@435 879 static int op3( int x) { return u_field(x, 24, 19); }
duke@435 880 static int rs1( Register r) { return u_field(r->encoding(), 18, 14); }
duke@435 881 static int rs2( Register r) { return u_field(r->encoding(), 4, 0); }
duke@435 882 static int annul( bool a) { return u_field(a ? 1 : 0, 29, 29); }
duke@435 883 static int cond( int x) { return u_field(x, 28, 25); }
duke@435 884 static int cond_mov( int x) { return u_field(x, 17, 14); }
duke@435 885 static int rcond( RCondition x) { return u_field(x, 12, 10); }
duke@435 886 static int op2( int x) { return u_field(x, 24, 22); }
duke@435 887 static int predict( bool p) { return u_field(p ? 1 : 0, 19, 19); }
duke@435 888 static int branchcc( CC fcca) { return u_field(fcca, 21, 20); }
duke@435 889 static int cmpcc( CC fcca) { return u_field(fcca, 26, 25); }
duke@435 890 static int imm_asi( int x) { return u_field(x, 12, 5); }
duke@435 891 static int immed( bool i) { return u_field(i ? 1 : 0, 13, 13); }
duke@435 892 static int opf_low6( int w) { return u_field(w, 10, 5); }
duke@435 893 static int opf_low5( int w) { return u_field(w, 9, 5); }
duke@435 894 static int trapcc( CC cc) { return u_field(cc, 12, 11); }
duke@435 895 static int sx( int i) { return u_field(i, 12, 12); } // shift x=1 means 64-bit
duke@435 896 static int opf( int x) { return u_field(x, 13, 5); }
duke@435 897
duke@435 898 static int opf_cc( CC c, bool useFloat ) { return u_field((useFloat ? 0 : 4) + c, 13, 11); }
duke@435 899 static int mov_cc( CC c, bool useFloat ) { return u_field(useFloat ? 0 : 1, 18, 18) | u_field(c, 12, 11); }
duke@435 900
duke@435 901 static int fd( FloatRegister r, FloatRegisterImpl::Width fwa) { return u_field(r->encoding(fwa), 29, 25); };
duke@435 902 static int fs1(FloatRegister r, FloatRegisterImpl::Width fwa) { return u_field(r->encoding(fwa), 18, 14); };
duke@435 903 static int fs2(FloatRegister r, FloatRegisterImpl::Width fwa) { return u_field(r->encoding(fwa), 4, 0); };
duke@435 904
duke@435 905 // some float instructions use this encoding on the op3 field
duke@435 906 static int alt_op3(int op, FloatRegisterImpl::Width w) {
duke@435 907 int r;
duke@435 908 switch(w) {
duke@435 909 case FloatRegisterImpl::S: r = op + 0; break;
duke@435 910 case FloatRegisterImpl::D: r = op + 3; break;
duke@435 911 case FloatRegisterImpl::Q: r = op + 2; break;
duke@435 912 default: ShouldNotReachHere(); break;
duke@435 913 }
duke@435 914 return op3(r);
duke@435 915 }
duke@435 916
duke@435 917
duke@435 918 // compute inverse of simm
duke@435 919 static int inv_simm(int x, int nbits) {
duke@435 920 return (int)(x << (32 - nbits)) >> (32 - nbits);
duke@435 921 }
duke@435 922
duke@435 923 static int inv_simm13( int x ) { return inv_simm(x, 13); }
duke@435 924
duke@435 925 // signed immediate, in low bits, nbits long
duke@435 926 static int simm(int x, int nbits) {
duke@435 927 assert_signed_range(x, nbits);
duke@435 928 return x & (( 1 << nbits ) - 1);
duke@435 929 }
duke@435 930
duke@435 931 // compute inverse of wdisp16
duke@435 932 static intptr_t inv_wdisp16(int x, intptr_t pos) {
duke@435 933 int lo = x & (( 1 << 14 ) - 1);
duke@435 934 int hi = (x >> 20) & 3;
duke@435 935 if (hi >= 2) hi |= ~1;
duke@435 936 return (((hi << 14) | lo) << 2) + pos;
duke@435 937 }
duke@435 938
duke@435 939 // word offset, 14 bits at LSend, 2 bits at B21, B20
duke@435 940 static int wdisp16(intptr_t x, intptr_t off) {
duke@435 941 intptr_t xx = x - off;
duke@435 942 assert_signed_word_disp_range(xx, 16);
duke@435 943 int r = (xx >> 2) & ((1 << 14) - 1)
duke@435 944 | ( ( (xx>>(2+14)) & 3 ) << 20 );
duke@435 945 assert( inv_wdisp16(r, off) == x, "inverse is not inverse");
duke@435 946 return r;
duke@435 947 }
duke@435 948
duke@435 949
duke@435 950 // word displacement in low-order nbits bits
duke@435 951
duke@435 952 static intptr_t inv_wdisp( int x, intptr_t pos, int nbits ) {
duke@435 953 int pre_sign_extend = x & (( 1 << nbits ) - 1);
duke@435 954 int r = pre_sign_extend >= ( 1 << (nbits-1) )
duke@435 955 ? pre_sign_extend | ~(( 1 << nbits ) - 1)
duke@435 956 : pre_sign_extend;
duke@435 957 return (r << 2) + pos;
duke@435 958 }
duke@435 959
duke@435 960 static int wdisp( intptr_t x, intptr_t off, int nbits ) {
duke@435 961 intptr_t xx = x - off;
duke@435 962 assert_signed_word_disp_range(xx, nbits);
duke@435 963 int r = (xx >> 2) & (( 1 << nbits ) - 1);
duke@435 964 assert( inv_wdisp( r, off, nbits ) == x, "inverse not inverse");
duke@435 965 return r;
duke@435 966 }
duke@435 967
duke@435 968
duke@435 969 // Extract the top 32 bits in a 64 bit word
duke@435 970 static int32_t hi32( int64_t x ) {
duke@435 971 int32_t r = int32_t( (uint64_t)x >> 32 );
duke@435 972 return r;
duke@435 973 }
duke@435 974
duke@435 975 // given a sethi instruction, extract the constant, left-justified
duke@435 976 static int inv_hi22( int x ) {
duke@435 977 return x << 10;
duke@435 978 }
duke@435 979
duke@435 980 // create an imm22 field, given a 32-bit left-justified constant
duke@435 981 static int hi22( int x ) {
duke@435 982 int r = int( juint(x) >> 10 );
duke@435 983 assert( (r & ~((1 << 22) - 1)) == 0, "just checkin'");
duke@435 984 return r;
duke@435 985 }
duke@435 986
duke@435 987 // create a low10 __value__ (not a field) for a given a 32-bit constant
duke@435 988 static int low10( int x ) {
duke@435 989 return x & ((1 << 10) - 1);
duke@435 990 }
duke@435 991
duke@435 992 // instruction only in v9
duke@435 993 static void v9_only() { assert( VM_Version::v9_instructions_work(), "This instruction only works on SPARC V9"); }
duke@435 994
duke@435 995 // instruction only in v8
duke@435 996 static void v8_only() { assert( VM_Version::v8_instructions_work(), "This instruction only works on SPARC V8"); }
duke@435 997
duke@435 998 // instruction deprecated in v9
duke@435 999 static void v9_dep() { } // do nothing for now
duke@435 1000
duke@435 1001 // some float instructions only exist for single prec. on v8
duke@435 1002 static void v8_s_only(FloatRegisterImpl::Width w) { if (w != FloatRegisterImpl::S) v9_only(); }
duke@435 1003
duke@435 1004 // v8 has no CC field
duke@435 1005 static void v8_no_cc(CC cc) { if (cc) v9_only(); }
duke@435 1006
duke@435 1007 protected:
duke@435 1008 // Simple delay-slot scheme:
duke@435 1009 // In order to check the programmer, the assembler keeps track of deley slots.
duke@435 1010 // It forbids CTIs in delay slots (conservative, but should be OK).
duke@435 1011 // Also, when putting an instruction into a delay slot, you must say
duke@435 1012 // asm->delayed()->add(...), in order to check that you don't omit
duke@435 1013 // delay-slot instructions.
duke@435 1014 // To implement this, we use a simple FSA
duke@435 1015
duke@435 1016 #ifdef ASSERT
duke@435 1017 #define CHECK_DELAY
duke@435 1018 #endif
duke@435 1019 #ifdef CHECK_DELAY
duke@435 1020 enum Delay_state { no_delay, at_delay_slot, filling_delay_slot } delay_state;
duke@435 1021 #endif
duke@435 1022
duke@435 1023 public:
duke@435 1024 // Tells assembler next instruction must NOT be in delay slot.
duke@435 1025 // Use at start of multinstruction macros.
duke@435 1026 void assert_not_delayed() {
duke@435 1027 // This is a separate overloading to avoid creation of string constants
duke@435 1028 // in non-asserted code--with some compilers this pollutes the object code.
duke@435 1029 #ifdef CHECK_DELAY
duke@435 1030 assert_not_delayed("next instruction should not be a delay slot");
duke@435 1031 #endif
duke@435 1032 }
duke@435 1033 void assert_not_delayed(const char* msg) {
duke@435 1034 #ifdef CHECK_DELAY
duke@435 1035 assert_msg ( delay_state == no_delay, msg);
duke@435 1036 #endif
duke@435 1037 }
duke@435 1038
duke@435 1039 protected:
duke@435 1040 // Delay slot helpers
duke@435 1041 // cti is called when emitting control-transfer instruction,
duke@435 1042 // BEFORE doing the emitting.
duke@435 1043 // Only effective when assertion-checking is enabled.
duke@435 1044 void cti() {
duke@435 1045 #ifdef CHECK_DELAY
duke@435 1046 assert_not_delayed("cti should not be in delay slot");
duke@435 1047 #endif
duke@435 1048 }
duke@435 1049
duke@435 1050 // called when emitting cti with a delay slot, AFTER emitting
duke@435 1051 void has_delay_slot() {
duke@435 1052 #ifdef CHECK_DELAY
duke@435 1053 assert_not_delayed("just checking");
duke@435 1054 delay_state = at_delay_slot;
duke@435 1055 #endif
duke@435 1056 }
duke@435 1057
duke@435 1058 public:
duke@435 1059 // Tells assembler you know that next instruction is delayed
duke@435 1060 Assembler* delayed() {
duke@435 1061 #ifdef CHECK_DELAY
duke@435 1062 assert ( delay_state == at_delay_slot, "delayed instruction is not in delay slot");
duke@435 1063 delay_state = filling_delay_slot;
duke@435 1064 #endif
duke@435 1065 return this;
duke@435 1066 }
duke@435 1067
duke@435 1068 void flush() {
duke@435 1069 #ifdef CHECK_DELAY
duke@435 1070 assert ( delay_state == no_delay, "ending code with a delay slot");
duke@435 1071 #endif
duke@435 1072 AbstractAssembler::flush();
duke@435 1073 }
duke@435 1074
duke@435 1075 inline void emit_long(int); // shadows AbstractAssembler::emit_long
duke@435 1076 inline void emit_data(int x) { emit_long(x); }
duke@435 1077 inline void emit_data(int, RelocationHolder const&);
duke@435 1078 inline void emit_data(int, relocInfo::relocType rtype);
duke@435 1079 // helper for above fcns
duke@435 1080 inline void check_delay();
duke@435 1081
duke@435 1082
duke@435 1083 public:
duke@435 1084 // instructions, refer to page numbers in the SPARC Architecture Manual, V9
duke@435 1085
duke@435 1086 // pp 135 (addc was addx in v8)
duke@435 1087
duke@435 1088 inline void add( Register s1, Register s2, Register d );
duke@435 1089 inline void add( Register s1, int simm13a, Register d, relocInfo::relocType rtype = relocInfo::none);
duke@435 1090 inline void add( Register s1, int simm13a, Register d, RelocationHolder const& rspec);
jrose@1100 1091 inline void add( Register s1, RegisterOrConstant s2, Register d, int offset = 0);
jrose@1100 1092 inline void add( const Address& a, Register d, int offset = 0);
duke@435 1093
duke@435 1094 void addcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(add_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1095 void addcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(add_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1096 void addc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(addc_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1097 void addc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(addc_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1098 void addccc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(addc_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1099 void addccc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(addc_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1100
duke@435 1101 // pp 136
duke@435 1102
duke@435 1103 inline void bpr( RCondition c, bool a, Predict p, Register s1, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1104 inline void bpr( RCondition c, bool a, Predict p, Register s1, Label& L);
duke@435 1105
duke@435 1106 protected: // use MacroAssembler::br instead
duke@435 1107
duke@435 1108 // pp 138
duke@435 1109
duke@435 1110 inline void fb( Condition c, bool a, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1111 inline void fb( Condition c, bool a, Label& L );
duke@435 1112
duke@435 1113 // pp 141
duke@435 1114
duke@435 1115 inline void fbp( Condition c, bool a, CC cc, Predict p, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1116 inline void fbp( Condition c, bool a, CC cc, Predict p, Label& L );
duke@435 1117
duke@435 1118 public:
duke@435 1119
duke@435 1120 // pp 144
duke@435 1121
duke@435 1122 inline void br( Condition c, bool a, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1123 inline void br( Condition c, bool a, Label& L );
duke@435 1124
duke@435 1125 // pp 146
duke@435 1126
duke@435 1127 inline void bp( Condition c, bool a, CC cc, Predict p, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1128 inline void bp( Condition c, bool a, CC cc, Predict p, Label& L );
duke@435 1129
duke@435 1130 // pp 121 (V8)
duke@435 1131
duke@435 1132 inline void cb( Condition c, bool a, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1133 inline void cb( Condition c, bool a, Label& L );
duke@435 1134
duke@435 1135 // pp 149
duke@435 1136
duke@435 1137 inline void call( address d, relocInfo::relocType rt = relocInfo::runtime_call_type );
duke@435 1138 inline void call( Label& L, relocInfo::relocType rt = relocInfo::runtime_call_type );
duke@435 1139
duke@435 1140 // pp 150
duke@435 1141
duke@435 1142 // These instructions compare the contents of s2 with the contents of
duke@435 1143 // memory at address in s1. If the values are equal, the contents of memory
duke@435 1144 // at address s1 is swapped with the data in d. If the values are not equal,
duke@435 1145 // the the contents of memory at s1 is loaded into d, without the swap.
duke@435 1146
duke@435 1147 void casa( Register s1, Register s2, Register d, int ia = -1 ) { v9_only(); emit_long( op(ldst_op) | rd(d) | op3(casa_op3 ) | rs1(s1) | (ia == -1 ? immed(true) : imm_asi(ia)) | rs2(s2)); }
duke@435 1148 void casxa( Register s1, Register s2, Register d, int ia = -1 ) { v9_only(); emit_long( op(ldst_op) | rd(d) | op3(casxa_op3) | rs1(s1) | (ia == -1 ? immed(true) : imm_asi(ia)) | rs2(s2)); }
duke@435 1149
duke@435 1150 // pp 152
duke@435 1151
duke@435 1152 void udiv( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(udiv_op3 ) | rs1(s1) | rs2(s2)); }
duke@435 1153 void udiv( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(udiv_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1154 void sdiv( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sdiv_op3 ) | rs1(s1) | rs2(s2)); }
duke@435 1155 void sdiv( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sdiv_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1156 void udivcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(udiv_op3 | cc_bit_op3) | rs1(s1) | rs2(s2)); }
duke@435 1157 void udivcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(udiv_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1158 void sdivcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sdiv_op3 | cc_bit_op3) | rs1(s1) | rs2(s2)); }
duke@435 1159 void sdivcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sdiv_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1160
duke@435 1161 // pp 155
duke@435 1162
duke@435 1163 void done() { v9_only(); cti(); emit_long( op(arith_op) | fcn(0) | op3(done_op3) ); }
duke@435 1164 void retry() { v9_only(); cti(); emit_long( op(arith_op) | fcn(1) | op3(retry_op3) ); }
duke@435 1165
duke@435 1166 // pp 156
duke@435 1167
duke@435 1168 void fadd( FloatRegisterImpl::Width w, FloatRegister s1, FloatRegister s2, FloatRegister d ) { emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | fs1(s1, w) | opf(0x40 + w) | fs2(s2, w)); }
duke@435 1169 void fsub( FloatRegisterImpl::Width w, FloatRegister s1, FloatRegister s2, FloatRegister d ) { emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | fs1(s1, w) | opf(0x44 + w) | fs2(s2, w)); }
duke@435 1170
duke@435 1171 // pp 157
duke@435 1172
duke@435 1173 void fcmp( FloatRegisterImpl::Width w, CC cc, FloatRegister s1, FloatRegister s2) { v8_no_cc(cc); emit_long( op(arith_op) | cmpcc(cc) | op3(fpop2_op3) | fs1(s1, w) | opf(0x50 + w) | fs2(s2, w)); }
duke@435 1174 void fcmpe( FloatRegisterImpl::Width w, CC cc, FloatRegister s1, FloatRegister s2) { v8_no_cc(cc); emit_long( op(arith_op) | cmpcc(cc) | op3(fpop2_op3) | fs1(s1, w) | opf(0x54 + w) | fs2(s2, w)); }
duke@435 1175
duke@435 1176 // pp 159
duke@435 1177
duke@435 1178 void ftox( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d ) { v9_only(); emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | opf(0x80 + w) | fs2(s, w)); }
duke@435 1179 void ftoi( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d ) { emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | opf(0xd0 + w) | fs2(s, w)); }
duke@435 1180
duke@435 1181 // pp 160
duke@435 1182
duke@435 1183 void ftof( FloatRegisterImpl::Width sw, FloatRegisterImpl::Width dw, FloatRegister s, FloatRegister d ) { emit_long( op(arith_op) | fd(d, dw) | op3(fpop1_op3) | opf(0xc0 + sw + dw*4) | fs2(s, sw)); }
duke@435 1184
duke@435 1185 // pp 161
duke@435 1186
duke@435 1187 void fxtof( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d ) { v9_only(); emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | opf(0x80 + w*4) | fs2(s, w)); }
duke@435 1188 void fitof( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d ) { emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | opf(0xc0 + w*4) | fs2(s, w)); }
duke@435 1189
duke@435 1190 // pp 162
duke@435 1191
duke@435 1192 void fmov( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d ) { v8_s_only(w); emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | opf(0x00 + w) | fs2(s, w)); }
duke@435 1193
duke@435 1194 void fneg( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d ) { v8_s_only(w); emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | opf(0x04 + w) | fs2(s, w)); }
duke@435 1195
duke@435 1196 // page 144 sparc v8 architecture (double prec works on v8 if the source and destination registers are the same). fnegs is the only instruction available
duke@435 1197 // on v8 to do negation of single, double and quad precision floats.
duke@435 1198
duke@435 1199 void fneg( FloatRegisterImpl::Width w, FloatRegister sd ) { if (VM_Version::v9_instructions_work()) emit_long( op(arith_op) | fd(sd, w) | op3(fpop1_op3) | opf(0x04 + w) | fs2(sd, w)); else emit_long( op(arith_op) | fd(sd, w) | op3(fpop1_op3) | opf(0x05) | fs2(sd, w)); }
duke@435 1200
duke@435 1201 void fabs( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d ) { v8_s_only(w); emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | opf(0x08 + w) | fs2(s, w)); }
duke@435 1202
duke@435 1203 // page 144 sparc v8 architecture (double prec works on v8 if the source and destination registers are the same). fabss is the only instruction available
duke@435 1204 // on v8 to do abs operation on single/double/quad precision floats.
duke@435 1205
duke@435 1206 void fabs( FloatRegisterImpl::Width w, FloatRegister sd ) { if (VM_Version::v9_instructions_work()) emit_long( op(arith_op) | fd(sd, w) | op3(fpop1_op3) | opf(0x08 + w) | fs2(sd, w)); else emit_long( op(arith_op) | fd(sd, w) | op3(fpop1_op3) | opf(0x09) | fs2(sd, w)); }
duke@435 1207
duke@435 1208 // pp 163
duke@435 1209
duke@435 1210 void fmul( FloatRegisterImpl::Width w, FloatRegister s1, FloatRegister s2, FloatRegister d ) { emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | fs1(s1, w) | opf(0x48 + w) | fs2(s2, w)); }
duke@435 1211 void fmul( FloatRegisterImpl::Width sw, FloatRegisterImpl::Width dw, FloatRegister s1, FloatRegister s2, FloatRegister d ) { emit_long( op(arith_op) | fd(d, dw) | op3(fpop1_op3) | fs1(s1, sw) | opf(0x60 + sw + dw*4) | fs2(s2, sw)); }
duke@435 1212 void fdiv( FloatRegisterImpl::Width w, FloatRegister s1, FloatRegister s2, FloatRegister d ) { emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | fs1(s1, w) | opf(0x4c + w) | fs2(s2, w)); }
duke@435 1213
duke@435 1214 // pp 164
duke@435 1215
duke@435 1216 void fsqrt( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d ) { emit_long( op(arith_op) | fd(d, w) | op3(fpop1_op3) | opf(0x28 + w) | fs2(s, w)); }
duke@435 1217
duke@435 1218 // pp 165
duke@435 1219
duke@435 1220 inline void flush( Register s1, Register s2 );
duke@435 1221 inline void flush( Register s1, int simm13a);
duke@435 1222
duke@435 1223 // pp 167
duke@435 1224
duke@435 1225 void flushw() { v9_only(); emit_long( op(arith_op) | op3(flushw_op3) ); }
duke@435 1226
duke@435 1227 // pp 168
duke@435 1228
duke@435 1229 void illtrap( int const22a) { if (const22a != 0) v9_only(); emit_long( op(branch_op) | u_field(const22a, 21, 0) ); }
duke@435 1230 // v8 unimp == illtrap(0)
duke@435 1231
duke@435 1232 // pp 169
duke@435 1233
duke@435 1234 void impdep1( int id1, int const19a ) { v9_only(); emit_long( op(arith_op) | fcn(id1) | op3(impdep1_op3) | u_field(const19a, 18, 0)); }
duke@435 1235 void impdep2( int id1, int const19a ) { v9_only(); emit_long( op(arith_op) | fcn(id1) | op3(impdep2_op3) | u_field(const19a, 18, 0)); }
duke@435 1236
duke@435 1237 // pp 149 (v8)
duke@435 1238
duke@435 1239 void cpop1( int opc, int cr1, int cr2, int crd ) { v8_only(); emit_long( op(arith_op) | fcn(crd) | op3(impdep1_op3) | u_field(cr1, 18, 14) | opf(opc) | u_field(cr2, 4, 0)); }
duke@435 1240 void cpop2( int opc, int cr1, int cr2, int crd ) { v8_only(); emit_long( op(arith_op) | fcn(crd) | op3(impdep2_op3) | u_field(cr1, 18, 14) | opf(opc) | u_field(cr2, 4, 0)); }
duke@435 1241
duke@435 1242 // pp 170
duke@435 1243
duke@435 1244 void jmpl( Register s1, Register s2, Register d );
duke@435 1245 void jmpl( Register s1, int simm13a, Register d, RelocationHolder const& rspec = RelocationHolder() );
duke@435 1246
duke@435 1247 inline void jmpl( Address& a, Register d, int offset = 0);
duke@435 1248
duke@435 1249 // 171
duke@435 1250
duke@435 1251 inline void ldf( FloatRegisterImpl::Width w, Register s1, Register s2, FloatRegister d );
duke@435 1252 inline void ldf( FloatRegisterImpl::Width w, Register s1, int simm13a, FloatRegister d );
duke@435 1253
duke@435 1254 inline void ldf( FloatRegisterImpl::Width w, const Address& a, FloatRegister d, int offset = 0);
duke@435 1255
duke@435 1256
duke@435 1257 inline void ldfsr( Register s1, Register s2 );
duke@435 1258 inline void ldfsr( Register s1, int simm13a);
duke@435 1259 inline void ldxfsr( Register s1, Register s2 );
duke@435 1260 inline void ldxfsr( Register s1, int simm13a);
duke@435 1261
duke@435 1262 // pp 94 (v8)
duke@435 1263
duke@435 1264 inline void ldc( Register s1, Register s2, int crd );
duke@435 1265 inline void ldc( Register s1, int simm13a, int crd);
duke@435 1266 inline void lddc( Register s1, Register s2, int crd );
duke@435 1267 inline void lddc( Register s1, int simm13a, int crd);
duke@435 1268 inline void ldcsr( Register s1, Register s2, int crd );
duke@435 1269 inline void ldcsr( Register s1, int simm13a, int crd);
duke@435 1270
duke@435 1271
duke@435 1272 // 173
duke@435 1273
duke@435 1274 void ldfa( FloatRegisterImpl::Width w, Register s1, Register s2, int ia, FloatRegister d ) { v9_only(); emit_long( op(ldst_op) | fd(d, w) | alt_op3(ldf_op3 | alt_bit_op3, w) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1275 void ldfa( FloatRegisterImpl::Width w, Register s1, int simm13a, FloatRegister d ) { v9_only(); emit_long( op(ldst_op) | fd(d, w) | alt_op3(ldf_op3 | alt_bit_op3, w) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1276
duke@435 1277 // pp 175, lduw is ld on v8
duke@435 1278
duke@435 1279 inline void ldsb( Register s1, Register s2, Register d );
duke@435 1280 inline void ldsb( Register s1, int simm13a, Register d);
duke@435 1281 inline void ldsh( Register s1, Register s2, Register d );
duke@435 1282 inline void ldsh( Register s1, int simm13a, Register d);
duke@435 1283 inline void ldsw( Register s1, Register s2, Register d );
duke@435 1284 inline void ldsw( Register s1, int simm13a, Register d);
duke@435 1285 inline void ldub( Register s1, Register s2, Register d );
duke@435 1286 inline void ldub( Register s1, int simm13a, Register d);
duke@435 1287 inline void lduh( Register s1, Register s2, Register d );
duke@435 1288 inline void lduh( Register s1, int simm13a, Register d);
duke@435 1289 inline void lduw( Register s1, Register s2, Register d );
duke@435 1290 inline void lduw( Register s1, int simm13a, Register d);
duke@435 1291 inline void ldx( Register s1, Register s2, Register d );
duke@435 1292 inline void ldx( Register s1, int simm13a, Register d);
duke@435 1293 inline void ld( Register s1, Register s2, Register d );
duke@435 1294 inline void ld( Register s1, int simm13a, Register d);
duke@435 1295 inline void ldd( Register s1, Register s2, Register d );
duke@435 1296 inline void ldd( Register s1, int simm13a, Register d);
duke@435 1297
duke@435 1298 inline void ldsb( const Address& a, Register d, int offset = 0 );
duke@435 1299 inline void ldsh( const Address& a, Register d, int offset = 0 );
duke@435 1300 inline void ldsw( const Address& a, Register d, int offset = 0 );
duke@435 1301 inline void ldub( const Address& a, Register d, int offset = 0 );
duke@435 1302 inline void lduh( const Address& a, Register d, int offset = 0 );
duke@435 1303 inline void lduw( const Address& a, Register d, int offset = 0 );
duke@435 1304 inline void ldx( const Address& a, Register d, int offset = 0 );
duke@435 1305 inline void ld( const Address& a, Register d, int offset = 0 );
duke@435 1306 inline void ldd( const Address& a, Register d, int offset = 0 );
duke@435 1307
jrose@1100 1308 inline void ldub( Register s1, RegisterOrConstant s2, Register d );
jrose@1100 1309 inline void ldsb( Register s1, RegisterOrConstant s2, Register d );
jrose@1100 1310 inline void lduh( Register s1, RegisterOrConstant s2, Register d );
jrose@1100 1311 inline void ldsh( Register s1, RegisterOrConstant s2, Register d );
jrose@1100 1312 inline void lduw( Register s1, RegisterOrConstant s2, Register d );
jrose@1100 1313 inline void ldsw( Register s1, RegisterOrConstant s2, Register d );
jrose@1100 1314 inline void ldx( Register s1, RegisterOrConstant s2, Register d );
jrose@1100 1315 inline void ld( Register s1, RegisterOrConstant s2, Register d );
jrose@1100 1316 inline void ldd( Register s1, RegisterOrConstant s2, Register d );
jrose@1057 1317
duke@435 1318 // pp 177
duke@435 1319
duke@435 1320 void ldsba( Register s1, Register s2, int ia, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(ldsb_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1321 void ldsba( Register s1, int simm13a, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(ldsb_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1322 void ldsha( Register s1, Register s2, int ia, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(ldsh_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1323 void ldsha( Register s1, int simm13a, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(ldsh_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1324 void ldswa( Register s1, Register s2, int ia, Register d ) { v9_only(); emit_long( op(ldst_op) | rd(d) | op3(ldsw_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1325 void ldswa( Register s1, int simm13a, Register d ) { v9_only(); emit_long( op(ldst_op) | rd(d) | op3(ldsw_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1326 void lduba( Register s1, Register s2, int ia, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(ldub_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1327 void lduba( Register s1, int simm13a, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(ldub_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1328 void lduha( Register s1, Register s2, int ia, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(lduh_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1329 void lduha( Register s1, int simm13a, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(lduh_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1330 void lduwa( Register s1, Register s2, int ia, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(lduw_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1331 void lduwa( Register s1, int simm13a, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(lduw_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1332 void ldxa( Register s1, Register s2, int ia, Register d ) { v9_only(); emit_long( op(ldst_op) | rd(d) | op3(ldx_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1333 void ldxa( Register s1, int simm13a, Register d ) { v9_only(); emit_long( op(ldst_op) | rd(d) | op3(ldx_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1334 void ldda( Register s1, Register s2, int ia, Register d ) { v9_dep(); emit_long( op(ldst_op) | rd(d) | op3(ldd_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1335 void ldda( Register s1, int simm13a, Register d ) { v9_dep(); emit_long( op(ldst_op) | rd(d) | op3(ldd_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1336
duke@435 1337 // pp 179
duke@435 1338
duke@435 1339 inline void ldstub( Register s1, Register s2, Register d );
duke@435 1340 inline void ldstub( Register s1, int simm13a, Register d);
duke@435 1341
duke@435 1342 // pp 180
duke@435 1343
duke@435 1344 void ldstuba( Register s1, Register s2, int ia, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(ldstub_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1345 void ldstuba( Register s1, int simm13a, Register d ) { emit_long( op(ldst_op) | rd(d) | op3(ldstub_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1346
duke@435 1347 // pp 181
duke@435 1348
duke@435 1349 void and3( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(and_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1350 void and3( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(and_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1351 void andcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(and_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1352 void andcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(and_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1353 void andn( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(andn_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1354 void andn( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(andn_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1355 void andncc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(andn_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1356 void andncc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(andn_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1357 void or3( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(or_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1358 void or3( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(or_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1359 void orcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(or_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1360 void orcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(or_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1361 void orn( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(orn_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1362 void orn( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(orn_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1363 void orncc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(orn_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1364 void orncc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(orn_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1365 void xor3( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(xor_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1366 void xor3( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(xor_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1367 void xorcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(xor_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1368 void xorcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(xor_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1369 void xnor( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(xnor_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1370 void xnor( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(xnor_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1371 void xnorcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(xnor_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1372 void xnorcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(xnor_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1373
duke@435 1374 // pp 183
duke@435 1375
duke@435 1376 void membar( Membar_mask_bits const7a ) { v9_only(); emit_long( op(arith_op) | op3(membar_op3) | rs1(O7) | immed(true) | u_field( int(const7a), 6, 0)); }
duke@435 1377
duke@435 1378 // pp 185
duke@435 1379
duke@435 1380 void fmov( FloatRegisterImpl::Width w, Condition c, bool floatCC, CC cca, FloatRegister s2, FloatRegister d ) { v9_only(); emit_long( op(arith_op) | fd(d, w) | op3(fpop2_op3) | cond_mov(c) | opf_cc(cca, floatCC) | opf_low6(w) | fs2(s2, w)); }
duke@435 1381
duke@435 1382 // pp 189
duke@435 1383
duke@435 1384 void fmov( FloatRegisterImpl::Width w, RCondition c, Register s1, FloatRegister s2, FloatRegister d ) { v9_only(); emit_long( op(arith_op) | fd(d, w) | op3(fpop2_op3) | rs1(s1) | rcond(c) | opf_low5(4 + w) | fs2(s2, w)); }
duke@435 1385
duke@435 1386 // pp 191
duke@435 1387
duke@435 1388 void movcc( Condition c, bool floatCC, CC cca, Register s2, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(movcc_op3) | mov_cc(cca, floatCC) | cond_mov(c) | rs2(s2) ); }
duke@435 1389 void movcc( Condition c, bool floatCC, CC cca, int simm11a, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(movcc_op3) | mov_cc(cca, floatCC) | cond_mov(c) | immed(true) | simm(simm11a, 11) ); }
duke@435 1390
duke@435 1391 // pp 195
duke@435 1392
duke@435 1393 void movr( RCondition c, Register s1, Register s2, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(movr_op3) | rs1(s1) | rcond(c) | rs2(s2) ); }
duke@435 1394 void movr( RCondition c, Register s1, int simm10a, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(movr_op3) | rs1(s1) | rcond(c) | immed(true) | simm(simm10a, 10) ); }
duke@435 1395
duke@435 1396 // pp 196
duke@435 1397
duke@435 1398 void mulx( Register s1, Register s2, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(mulx_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1399 void mulx( Register s1, int simm13a, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(mulx_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1400 void sdivx( Register s1, Register s2, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(sdivx_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1401 void sdivx( Register s1, int simm13a, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(sdivx_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1402 void udivx( Register s1, Register s2, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(udivx_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1403 void udivx( Register s1, int simm13a, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(udivx_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1404
duke@435 1405 // pp 197
duke@435 1406
duke@435 1407 void umul( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(umul_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1408 void umul( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(umul_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1409 void smul( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(smul_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1410 void smul( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(smul_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1411 void umulcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(umul_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1412 void umulcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(umul_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1413 void smulcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(smul_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1414 void smulcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(smul_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1415
duke@435 1416 // pp 199
duke@435 1417
duke@435 1418 void mulscc( Register s1, Register s2, Register d ) { v9_dep(); emit_long( op(arith_op) | rd(d) | op3(mulscc_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1419 void mulscc( Register s1, int simm13a, Register d ) { v9_dep(); emit_long( op(arith_op) | rd(d) | op3(mulscc_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1420
duke@435 1421 // pp 201
duke@435 1422
duke@435 1423 void nop() { emit_long( op(branch_op) | op2(sethi_op2) ); }
duke@435 1424
duke@435 1425
duke@435 1426 // pp 202
duke@435 1427
duke@435 1428 void popc( Register s, Register d) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(popc_op3) | rs2(s)); }
duke@435 1429 void popc( int simm13a, Register d) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(popc_op3) | immed(true) | simm(simm13a, 13)); }
duke@435 1430
duke@435 1431 // pp 203
duke@435 1432
duke@435 1433 void prefetch( Register s1, Register s2, PrefetchFcn f);
duke@435 1434 void prefetch( Register s1, int simm13a, PrefetchFcn f);
duke@435 1435 void prefetcha( Register s1, Register s2, int ia, PrefetchFcn f ) { v9_only(); emit_long( op(ldst_op) | fcn(f) | op3(prefetch_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1436 void prefetcha( Register s1, int simm13a, PrefetchFcn f ) { v9_only(); emit_long( op(ldst_op) | fcn(f) | op3(prefetch_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1437
duke@435 1438 inline void prefetch(const Address& a, PrefetchFcn F, int offset = 0);
duke@435 1439
duke@435 1440 // pp 208
duke@435 1441
duke@435 1442 // not implementing read privileged register
duke@435 1443
duke@435 1444 inline void rdy( Register d) { v9_dep(); emit_long( op(arith_op) | rd(d) | op3(rdreg_op3) | u_field(0, 18, 14)); }
duke@435 1445 inline void rdccr( Register d) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(rdreg_op3) | u_field(2, 18, 14)); }
duke@435 1446 inline void rdasi( Register d) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(rdreg_op3) | u_field(3, 18, 14)); }
duke@435 1447 inline void rdtick( Register d) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(rdreg_op3) | u_field(4, 18, 14)); } // Spoon!
duke@435 1448 inline void rdpc( Register d) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(rdreg_op3) | u_field(5, 18, 14)); }
duke@435 1449 inline void rdfprs( Register d) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(rdreg_op3) | u_field(6, 18, 14)); }
duke@435 1450
duke@435 1451 // pp 213
duke@435 1452
duke@435 1453 inline void rett( Register s1, Register s2);
duke@435 1454 inline void rett( Register s1, int simm13a, relocInfo::relocType rt = relocInfo::none);
duke@435 1455
duke@435 1456 // pp 214
duke@435 1457
duke@435 1458 void save( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(save_op3) | rs1(s1) | rs2(s2) ); }
ysr@777 1459 void save( Register s1, int simm13a, Register d ) {
ysr@777 1460 // make sure frame is at least large enough for the register save area
ysr@777 1461 assert(-simm13a >= 16 * wordSize, "frame too small");
ysr@777 1462 emit_long( op(arith_op) | rd(d) | op3(save_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) );
ysr@777 1463 }
duke@435 1464
duke@435 1465 void restore( Register s1 = G0, Register s2 = G0, Register d = G0 ) { emit_long( op(arith_op) | rd(d) | op3(restore_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1466 void restore( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(restore_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1467
duke@435 1468 // pp 216
duke@435 1469
duke@435 1470 void saved() { v9_only(); emit_long( op(arith_op) | fcn(0) | op3(saved_op3)); }
duke@435 1471 void restored() { v9_only(); emit_long( op(arith_op) | fcn(1) | op3(saved_op3)); }
duke@435 1472
duke@435 1473 // pp 217
duke@435 1474
duke@435 1475 inline void sethi( int imm22a, Register d, RelocationHolder const& rspec = RelocationHolder() );
duke@435 1476 // pp 218
duke@435 1477
duke@435 1478 void sll( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sll_op3) | rs1(s1) | sx(0) | rs2(s2) ); }
duke@435 1479 void sll( Register s1, int imm5a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sll_op3) | rs1(s1) | sx(0) | immed(true) | u_field(imm5a, 4, 0) ); }
duke@435 1480 void srl( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(srl_op3) | rs1(s1) | sx(0) | rs2(s2) ); }
duke@435 1481 void srl( Register s1, int imm5a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(srl_op3) | rs1(s1) | sx(0) | immed(true) | u_field(imm5a, 4, 0) ); }
duke@435 1482 void sra( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sra_op3) | rs1(s1) | sx(0) | rs2(s2) ); }
duke@435 1483 void sra( Register s1, int imm5a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sra_op3) | rs1(s1) | sx(0) | immed(true) | u_field(imm5a, 4, 0) ); }
duke@435 1484
duke@435 1485 void sllx( Register s1, Register s2, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(sll_op3) | rs1(s1) | sx(1) | rs2(s2) ); }
duke@435 1486 void sllx( Register s1, int imm6a, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(sll_op3) | rs1(s1) | sx(1) | immed(true) | u_field(imm6a, 5, 0) ); }
duke@435 1487 void srlx( Register s1, Register s2, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(srl_op3) | rs1(s1) | sx(1) | rs2(s2) ); }
duke@435 1488 void srlx( Register s1, int imm6a, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(srl_op3) | rs1(s1) | sx(1) | immed(true) | u_field(imm6a, 5, 0) ); }
duke@435 1489 void srax( Register s1, Register s2, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(sra_op3) | rs1(s1) | sx(1) | rs2(s2) ); }
duke@435 1490 void srax( Register s1, int imm6a, Register d ) { v9_only(); emit_long( op(arith_op) | rd(d) | op3(sra_op3) | rs1(s1) | sx(1) | immed(true) | u_field(imm6a, 5, 0) ); }
duke@435 1491
duke@435 1492 // pp 220
duke@435 1493
duke@435 1494 void sir( int simm13a ) { emit_long( op(arith_op) | fcn(15) | op3(sir_op3) | immed(true) | simm(simm13a, 13)); }
duke@435 1495
duke@435 1496 // pp 221
duke@435 1497
duke@435 1498 void stbar() { emit_long( op(arith_op) | op3(membar_op3) | u_field(15, 18, 14)); }
duke@435 1499
duke@435 1500 // pp 222
duke@435 1501
duke@435 1502 inline void stf( FloatRegisterImpl::Width w, FloatRegister d, Register s1, Register s2 );
duke@435 1503 inline void stf( FloatRegisterImpl::Width w, FloatRegister d, Register s1, int simm13a);
duke@435 1504 inline void stf( FloatRegisterImpl::Width w, FloatRegister d, const Address& a, int offset = 0);
duke@435 1505
duke@435 1506 inline void stfsr( Register s1, Register s2 );
duke@435 1507 inline void stfsr( Register s1, int simm13a);
duke@435 1508 inline void stxfsr( Register s1, Register s2 );
duke@435 1509 inline void stxfsr( Register s1, int simm13a);
duke@435 1510
duke@435 1511 // pp 224
duke@435 1512
duke@435 1513 void stfa( FloatRegisterImpl::Width w, FloatRegister d, Register s1, Register s2, int ia ) { v9_only(); emit_long( op(ldst_op) | fd(d, w) | alt_op3(stf_op3 | alt_bit_op3, w) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1514 void stfa( FloatRegisterImpl::Width w, FloatRegister d, Register s1, int simm13a ) { v9_only(); emit_long( op(ldst_op) | fd(d, w) | alt_op3(stf_op3 | alt_bit_op3, w) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1515
duke@435 1516 // p 226
duke@435 1517
duke@435 1518 inline void stb( Register d, Register s1, Register s2 );
duke@435 1519 inline void stb( Register d, Register s1, int simm13a);
duke@435 1520 inline void sth( Register d, Register s1, Register s2 );
duke@435 1521 inline void sth( Register d, Register s1, int simm13a);
duke@435 1522 inline void stw( Register d, Register s1, Register s2 );
duke@435 1523 inline void stw( Register d, Register s1, int simm13a);
duke@435 1524 inline void st( Register d, Register s1, Register s2 );
duke@435 1525 inline void st( Register d, Register s1, int simm13a);
duke@435 1526 inline void stx( Register d, Register s1, Register s2 );
duke@435 1527 inline void stx( Register d, Register s1, int simm13a);
duke@435 1528 inline void std( Register d, Register s1, Register s2 );
duke@435 1529 inline void std( Register d, Register s1, int simm13a);
duke@435 1530
duke@435 1531 inline void stb( Register d, const Address& a, int offset = 0 );
duke@435 1532 inline void sth( Register d, const Address& a, int offset = 0 );
duke@435 1533 inline void stw( Register d, const Address& a, int offset = 0 );
duke@435 1534 inline void stx( Register d, const Address& a, int offset = 0 );
duke@435 1535 inline void st( Register d, const Address& a, int offset = 0 );
duke@435 1536 inline void std( Register d, const Address& a, int offset = 0 );
duke@435 1537
jrose@1100 1538 inline void stb( Register d, Register s1, RegisterOrConstant s2 );
jrose@1100 1539 inline void sth( Register d, Register s1, RegisterOrConstant s2 );
jrose@1100 1540 inline void stw( Register d, Register s1, RegisterOrConstant s2 );
jrose@1100 1541 inline void stx( Register d, Register s1, RegisterOrConstant s2 );
jrose@1100 1542 inline void std( Register d, Register s1, RegisterOrConstant s2 );
jrose@1100 1543 inline void st( Register d, Register s1, RegisterOrConstant s2 );
jrose@1057 1544
duke@435 1545 // pp 177
duke@435 1546
duke@435 1547 void stba( Register d, Register s1, Register s2, int ia ) { emit_long( op(ldst_op) | rd(d) | op3(stb_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1548 void stba( Register d, Register s1, int simm13a ) { emit_long( op(ldst_op) | rd(d) | op3(stb_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1549 void stha( Register d, Register s1, Register s2, int ia ) { emit_long( op(ldst_op) | rd(d) | op3(sth_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1550 void stha( Register d, Register s1, int simm13a ) { emit_long( op(ldst_op) | rd(d) | op3(sth_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1551 void stwa( Register d, Register s1, Register s2, int ia ) { emit_long( op(ldst_op) | rd(d) | op3(stw_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1552 void stwa( Register d, Register s1, int simm13a ) { emit_long( op(ldst_op) | rd(d) | op3(stw_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1553 void stxa( Register d, Register s1, Register s2, int ia ) { v9_only(); emit_long( op(ldst_op) | rd(d) | op3(stx_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1554 void stxa( Register d, Register s1, int simm13a ) { v9_only(); emit_long( op(ldst_op) | rd(d) | op3(stx_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1555 void stda( Register d, Register s1, Register s2, int ia ) { emit_long( op(ldst_op) | rd(d) | op3(std_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1556 void stda( Register d, Register s1, int simm13a ) { emit_long( op(ldst_op) | rd(d) | op3(std_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1557
duke@435 1558 // pp 97 (v8)
duke@435 1559
duke@435 1560 inline void stc( int crd, Register s1, Register s2 );
duke@435 1561 inline void stc( int crd, Register s1, int simm13a);
duke@435 1562 inline void stdc( int crd, Register s1, Register s2 );
duke@435 1563 inline void stdc( int crd, Register s1, int simm13a);
duke@435 1564 inline void stcsr( int crd, Register s1, Register s2 );
duke@435 1565 inline void stcsr( int crd, Register s1, int simm13a);
duke@435 1566 inline void stdcq( int crd, Register s1, Register s2 );
duke@435 1567 inline void stdcq( int crd, Register s1, int simm13a);
duke@435 1568
duke@435 1569 // pp 230
duke@435 1570
duke@435 1571 void sub( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sub_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1572 void sub( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sub_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1573 void subcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sub_op3 | cc_bit_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1574 void subcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(sub_op3 | cc_bit_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1575 void subc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(subc_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1576 void subc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(subc_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1577 void subccc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(subc_op3 | cc_bit_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1578 void subccc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(subc_op3 | cc_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1579
duke@435 1580 // pp 231
duke@435 1581
duke@435 1582 inline void swap( Register s1, Register s2, Register d );
duke@435 1583 inline void swap( Register s1, int simm13a, Register d);
duke@435 1584 inline void swap( Address& a, Register d, int offset = 0 );
duke@435 1585
duke@435 1586 // pp 232
duke@435 1587
duke@435 1588 void swapa( Register s1, Register s2, int ia, Register d ) { v9_dep(); emit_long( op(ldst_op) | rd(d) | op3(swap_op3 | alt_bit_op3) | rs1(s1) | imm_asi(ia) | rs2(s2) ); }
duke@435 1589 void swapa( Register s1, int simm13a, Register d ) { v9_dep(); emit_long( op(ldst_op) | rd(d) | op3(swap_op3 | alt_bit_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1590
duke@435 1591 // pp 234, note op in book is wrong, see pp 268
duke@435 1592
duke@435 1593 void taddcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(taddcc_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1594 void taddcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(taddcc_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1595 void taddcctv( Register s1, Register s2, Register d ) { v9_dep(); emit_long( op(arith_op) | rd(d) | op3(taddcctv_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1596 void taddcctv( Register s1, int simm13a, Register d ) { v9_dep(); emit_long( op(arith_op) | rd(d) | op3(taddcctv_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1597
duke@435 1598 // pp 235
duke@435 1599
duke@435 1600 void tsubcc( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(tsubcc_op3 ) | rs1(s1) | rs2(s2) ); }
duke@435 1601 void tsubcc( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(tsubcc_op3 ) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1602 void tsubcctv( Register s1, Register s2, Register d ) { emit_long( op(arith_op) | rd(d) | op3(tsubcctv_op3) | rs1(s1) | rs2(s2) ); }
duke@435 1603 void tsubcctv( Register s1, int simm13a, Register d ) { emit_long( op(arith_op) | rd(d) | op3(tsubcctv_op3) | rs1(s1) | immed(true) | simm(simm13a, 13) ); }
duke@435 1604
duke@435 1605 // pp 237
duke@435 1606
duke@435 1607 void trap( Condition c, CC cc, Register s1, Register s2 ) { v8_no_cc(cc); emit_long( op(arith_op) | cond(c) | op3(trap_op3) | rs1(s1) | trapcc(cc) | rs2(s2)); }
duke@435 1608 void trap( Condition c, CC cc, Register s1, int trapa ) { v8_no_cc(cc); emit_long( op(arith_op) | cond(c) | op3(trap_op3) | rs1(s1) | trapcc(cc) | immed(true) | u_field(trapa, 6, 0)); }
duke@435 1609 // simple uncond. trap
duke@435 1610 void trap( int trapa ) { trap( always, icc, G0, trapa ); }
duke@435 1611
duke@435 1612 // pp 239 omit write priv register for now
duke@435 1613
duke@435 1614 inline void wry( Register d) { v9_dep(); emit_long( op(arith_op) | rs1(d) | op3(wrreg_op3) | u_field(0, 29, 25)); }
duke@435 1615 inline void wrccr(Register s) { v9_only(); emit_long( op(arith_op) | rs1(s) | op3(wrreg_op3) | u_field(2, 29, 25)); }
duke@435 1616 inline void wrccr(Register s, int simm13a) { v9_only(); emit_long( op(arith_op) |
duke@435 1617 rs1(s) |
duke@435 1618 op3(wrreg_op3) |
duke@435 1619 u_field(2, 29, 25) |
duke@435 1620 u_field(1, 13, 13) |
duke@435 1621 simm(simm13a, 13)); }
duke@435 1622 inline void wrasi( Register d) { v9_only(); emit_long( op(arith_op) | rs1(d) | op3(wrreg_op3) | u_field(3, 29, 25)); }
duke@435 1623 inline void wrfprs( Register d) { v9_only(); emit_long( op(arith_op) | rs1(d) | op3(wrreg_op3) | u_field(6, 29, 25)); }
duke@435 1624
ysr@777 1625 // For a given register condition, return the appropriate condition code
ysr@777 1626 // Condition (the one you would use to get the same effect after "tst" on
ysr@777 1627 // the target register.)
ysr@777 1628 Assembler::Condition reg_cond_to_cc_cond(RCondition in);
ysr@777 1629
duke@435 1630
duke@435 1631 // Creation
duke@435 1632 Assembler(CodeBuffer* code) : AbstractAssembler(code) {
duke@435 1633 #ifdef CHECK_DELAY
duke@435 1634 delay_state = no_delay;
duke@435 1635 #endif
duke@435 1636 }
duke@435 1637
duke@435 1638 // Testing
duke@435 1639 #ifndef PRODUCT
duke@435 1640 void test_v9();
duke@435 1641 void test_v8_onlys();
duke@435 1642 #endif
duke@435 1643 };
duke@435 1644
duke@435 1645
duke@435 1646 class RegistersForDebugging : public StackObj {
duke@435 1647 public:
duke@435 1648 intptr_t i[8], l[8], o[8], g[8];
duke@435 1649 float f[32];
duke@435 1650 double d[32];
duke@435 1651
duke@435 1652 void print(outputStream* s);
duke@435 1653
duke@435 1654 static int i_offset(int j) { return offset_of(RegistersForDebugging, i[j]); }
duke@435 1655 static int l_offset(int j) { return offset_of(RegistersForDebugging, l[j]); }
duke@435 1656 static int o_offset(int j) { return offset_of(RegistersForDebugging, o[j]); }
duke@435 1657 static int g_offset(int j) { return offset_of(RegistersForDebugging, g[j]); }
duke@435 1658 static int f_offset(int j) { return offset_of(RegistersForDebugging, f[j]); }
duke@435 1659 static int d_offset(int j) { return offset_of(RegistersForDebugging, d[j / 2]); }
duke@435 1660
duke@435 1661 // gen asm code to save regs
duke@435 1662 static void save_registers(MacroAssembler* a);
duke@435 1663
duke@435 1664 // restore global registers in case C code disturbed them
duke@435 1665 static void restore_registers(MacroAssembler* a, Register r);
ysr@777 1666
ysr@777 1667
duke@435 1668 };
duke@435 1669
duke@435 1670
duke@435 1671 // MacroAssembler extends Assembler by a few frequently used macros.
duke@435 1672 //
duke@435 1673 // Most of the standard SPARC synthetic ops are defined here.
duke@435 1674 // Instructions for which a 'better' code sequence exists depending
duke@435 1675 // on arguments should also go in here.
duke@435 1676
duke@435 1677 #define JMP2(r1, r2) jmp(r1, r2, __FILE__, __LINE__)
duke@435 1678 #define JMP(r1, off) jmp(r1, off, __FILE__, __LINE__)
duke@435 1679 #define JUMP(a, off) jump(a, off, __FILE__, __LINE__)
duke@435 1680 #define JUMPL(a, d, off) jumpl(a, d, off, __FILE__, __LINE__)
duke@435 1681
duke@435 1682
duke@435 1683 class MacroAssembler: public Assembler {
duke@435 1684 protected:
duke@435 1685 // Support for VM calls
duke@435 1686 // This is the base routine called by the different versions of call_VM_leaf. The interpreter
duke@435 1687 // may customize this version by overriding it for its purposes (e.g., to save/restore
duke@435 1688 // additional registers when doing a VM call).
duke@435 1689 #ifdef CC_INTERP
duke@435 1690 #define VIRTUAL
duke@435 1691 #else
duke@435 1692 #define VIRTUAL virtual
duke@435 1693 #endif
duke@435 1694
duke@435 1695 VIRTUAL void call_VM_leaf_base(Register thread_cache, address entry_point, int number_of_arguments);
duke@435 1696
duke@435 1697 //
duke@435 1698 // It is imperative that all calls into the VM are handled via the call_VM macros.
duke@435 1699 // They make sure that the stack linkage is setup correctly. call_VM's correspond
duke@435 1700 // to ENTRY/ENTRY_X entry points while call_VM_leaf's correspond to LEAF entry points.
duke@435 1701 //
duke@435 1702 // This is the base routine called by the different versions of call_VM. The interpreter
duke@435 1703 // may customize this version by overriding it for its purposes (e.g., to save/restore
duke@435 1704 // additional registers when doing a VM call).
duke@435 1705 //
duke@435 1706 // A non-volatile java_thread_cache register should be specified so
duke@435 1707 // that the G2_thread value can be preserved across the call.
duke@435 1708 // (If java_thread_cache is noreg, then a slow get_thread call
duke@435 1709 // will re-initialize the G2_thread.) call_VM_base returns the register that contains the
duke@435 1710 // thread.
duke@435 1711 //
duke@435 1712 // If no last_java_sp is specified (noreg) than SP will be used instead.
duke@435 1713
duke@435 1714 virtual void call_VM_base(
duke@435 1715 Register oop_result, // where an oop-result ends up if any; use noreg otherwise
duke@435 1716 Register java_thread_cache, // the thread if computed before ; use noreg otherwise
duke@435 1717 Register last_java_sp, // to set up last_Java_frame in stubs; use noreg otherwise
duke@435 1718 address entry_point, // the entry point
duke@435 1719 int number_of_arguments, // the number of arguments (w/o thread) to pop after call
duke@435 1720 bool check_exception=true // flag which indicates if exception should be checked
duke@435 1721 );
duke@435 1722
duke@435 1723 // This routine should emit JVMTI PopFrame and ForceEarlyReturn handling code.
duke@435 1724 // The implementation is only non-empty for the InterpreterMacroAssembler,
duke@435 1725 // as only the interpreter handles and ForceEarlyReturn PopFrame requests.
duke@435 1726 virtual void check_and_handle_popframe(Register scratch_reg);
duke@435 1727 virtual void check_and_handle_earlyret(Register scratch_reg);
duke@435 1728
duke@435 1729 public:
duke@435 1730 MacroAssembler(CodeBuffer* code) : Assembler(code) {}
duke@435 1731
duke@435 1732 // Support for NULL-checks
duke@435 1733 //
duke@435 1734 // Generates code that causes a NULL OS exception if the content of reg is NULL.
duke@435 1735 // If the accessed location is M[reg + offset] and the offset is known, provide the
duke@435 1736 // offset. No explicit code generation is needed if the offset is within a certain
duke@435 1737 // range (0 <= offset <= page_size).
duke@435 1738 //
duke@435 1739 // %%%%%% Currently not done for SPARC
duke@435 1740
duke@435 1741 void null_check(Register reg, int offset = -1);
duke@435 1742 static bool needs_explicit_null_check(intptr_t offset);
duke@435 1743
duke@435 1744 // support for delayed instructions
duke@435 1745 MacroAssembler* delayed() { Assembler::delayed(); return this; }
duke@435 1746
duke@435 1747 // branches that use right instruction for v8 vs. v9
duke@435 1748 inline void br( Condition c, bool a, Predict p, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1749 inline void br( Condition c, bool a, Predict p, Label& L );
duke@435 1750 inline void fb( Condition c, bool a, Predict p, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1751 inline void fb( Condition c, bool a, Predict p, Label& L );
duke@435 1752
duke@435 1753 // compares register with zero and branches (V9 and V8 instructions)
duke@435 1754 void br_zero( Condition c, bool a, Predict p, Register s1, Label& L);
duke@435 1755 // Compares a pointer register with zero and branches on (not)null.
duke@435 1756 // Does a test & branch on 32-bit systems and a register-branch on 64-bit.
duke@435 1757 void br_null ( Register s1, bool a, Predict p, Label& L );
duke@435 1758 void br_notnull( Register s1, bool a, Predict p, Label& L );
duke@435 1759
ysr@777 1760 // These versions will do the most efficient thing on v8 and v9. Perhaps
ysr@777 1761 // this is what the routine above was meant to do, but it didn't (and
ysr@777 1762 // didn't cover both target address kinds.)
ysr@777 1763 void br_on_reg_cond( RCondition c, bool a, Predict p, Register s1, address d, relocInfo::relocType rt = relocInfo::none );
ysr@777 1764 void br_on_reg_cond( RCondition c, bool a, Predict p, Register s1, Label& L);
ysr@777 1765
duke@435 1766 inline void bp( Condition c, bool a, CC cc, Predict p, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1767 inline void bp( Condition c, bool a, CC cc, Predict p, Label& L );
duke@435 1768
duke@435 1769 // Branch that tests xcc in LP64 and icc in !LP64
duke@435 1770 inline void brx( Condition c, bool a, Predict p, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1771 inline void brx( Condition c, bool a, Predict p, Label& L );
duke@435 1772
duke@435 1773 // unconditional short branch
duke@435 1774 inline void ba( bool a, Label& L );
duke@435 1775
duke@435 1776 // Branch that tests fp condition codes
duke@435 1777 inline void fbp( Condition c, bool a, CC cc, Predict p, address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1778 inline void fbp( Condition c, bool a, CC cc, Predict p, Label& L );
duke@435 1779
duke@435 1780 // get PC the best way
duke@435 1781 inline int get_pc( Register d );
duke@435 1782
duke@435 1783 // Sparc shorthands(pp 85, V8 manual, pp 289 V9 manual)
duke@435 1784 inline void cmp( Register s1, Register s2 ) { subcc( s1, s2, G0 ); }
duke@435 1785 inline void cmp( Register s1, int simm13a ) { subcc( s1, simm13a, G0 ); }
duke@435 1786
duke@435 1787 inline void jmp( Register s1, Register s2 );
duke@435 1788 inline void jmp( Register s1, int simm13a, RelocationHolder const& rspec = RelocationHolder() );
duke@435 1789
duke@435 1790 inline void call( address d, relocInfo::relocType rt = relocInfo::runtime_call_type );
duke@435 1791 inline void call( Label& L, relocInfo::relocType rt = relocInfo::runtime_call_type );
duke@435 1792 inline void callr( Register s1, Register s2 );
duke@435 1793 inline void callr( Register s1, int simm13a, RelocationHolder const& rspec = RelocationHolder() );
duke@435 1794
duke@435 1795 // Emits nothing on V8
duke@435 1796 inline void iprefetch( address d, relocInfo::relocType rt = relocInfo::none );
duke@435 1797 inline void iprefetch( Label& L);
duke@435 1798
duke@435 1799 inline void tst( Register s ) { orcc( G0, s, G0 ); }
duke@435 1800
duke@435 1801 #ifdef PRODUCT
duke@435 1802 inline void ret( bool trace = TraceJumps ) { if (trace) {
duke@435 1803 mov(I7, O7); // traceable register
duke@435 1804 JMP(O7, 2 * BytesPerInstWord);
duke@435 1805 } else {
duke@435 1806 jmpl( I7, 2 * BytesPerInstWord, G0 );
duke@435 1807 }
duke@435 1808 }
duke@435 1809
duke@435 1810 inline void retl( bool trace = TraceJumps ) { if (trace) JMP(O7, 2 * BytesPerInstWord);
duke@435 1811 else jmpl( O7, 2 * BytesPerInstWord, G0 ); }
duke@435 1812 #else
duke@435 1813 void ret( bool trace = TraceJumps );
duke@435 1814 void retl( bool trace = TraceJumps );
duke@435 1815 #endif /* PRODUCT */
duke@435 1816
duke@435 1817 // Required platform-specific helpers for Label::patch_instructions.
duke@435 1818 // They _shadow_ the declarations in AbstractAssembler, which are undefined.
duke@435 1819 void pd_patch_instruction(address branch, address target);
duke@435 1820 #ifndef PRODUCT
duke@435 1821 static void pd_print_patched_instruction(address branch);
duke@435 1822 #endif
duke@435 1823
duke@435 1824 // sethi Macro handles optimizations and relocations
duke@435 1825 void sethi( Address& a, bool ForceRelocatable = false );
duke@435 1826 void sethi( intptr_t imm22a, Register d, bool ForceRelocatable = false, RelocationHolder const& rspec = RelocationHolder());
duke@435 1827
duke@435 1828 // compute the size of a sethi/set
duke@435 1829 static int size_of_sethi( address a, bool worst_case = false );
duke@435 1830 static int worst_case_size_of_set();
duke@435 1831
duke@435 1832 // set may be either setsw or setuw (high 32 bits may be zero or sign)
duke@435 1833 void set( intptr_t value, Register d, RelocationHolder const& rspec = RelocationHolder() );
duke@435 1834 void setsw( int value, Register d, RelocationHolder const& rspec = RelocationHolder() );
duke@435 1835 void set64( jlong value, Register d, Register tmp);
duke@435 1836
duke@435 1837 // sign-extend 32 to 64
duke@435 1838 inline void signx( Register s, Register d ) { sra( s, G0, d); }
duke@435 1839 inline void signx( Register d ) { sra( d, G0, d); }
duke@435 1840
duke@435 1841 inline void not1( Register s, Register d ) { xnor( s, G0, d ); }
duke@435 1842 inline void not1( Register d ) { xnor( d, G0, d ); }
duke@435 1843
duke@435 1844 inline void neg( Register s, Register d ) { sub( G0, s, d ); }
duke@435 1845 inline void neg( Register d ) { sub( G0, d, d ); }
duke@435 1846
duke@435 1847 inline void cas( Register s1, Register s2, Register d) { casa( s1, s2, d, ASI_PRIMARY); }
duke@435 1848 inline void casx( Register s1, Register s2, Register d) { casxa(s1, s2, d, ASI_PRIMARY); }
duke@435 1849 // Functions for isolating 64 bit atomic swaps for LP64
duke@435 1850 // cas_ptr will perform cas for 32 bit VM's and casx for 64 bit VM's
duke@435 1851 inline void cas_ptr( Register s1, Register s2, Register d) {
duke@435 1852 #ifdef _LP64
duke@435 1853 casx( s1, s2, d );
duke@435 1854 #else
duke@435 1855 cas( s1, s2, d );
duke@435 1856 #endif
duke@435 1857 }
duke@435 1858
duke@435 1859 // Functions for isolating 64 bit shifts for LP64
duke@435 1860 inline void sll_ptr( Register s1, Register s2, Register d );
duke@435 1861 inline void sll_ptr( Register s1, int imm6a, Register d );
jrose@1100 1862 inline void sll_ptr( Register s1, RegisterOrConstant s2, Register d );
duke@435 1863 inline void srl_ptr( Register s1, Register s2, Register d );
duke@435 1864 inline void srl_ptr( Register s1, int imm6a, Register d );
duke@435 1865
duke@435 1866 // little-endian
duke@435 1867 inline void casl( Register s1, Register s2, Register d) { casa( s1, s2, d, ASI_PRIMARY_LITTLE); }
duke@435 1868 inline void casxl( Register s1, Register s2, Register d) { casxa(s1, s2, d, ASI_PRIMARY_LITTLE); }
duke@435 1869
duke@435 1870 inline void inc( Register d, int const13 = 1 ) { add( d, const13, d); }
duke@435 1871 inline void inccc( Register d, int const13 = 1 ) { addcc( d, const13, d); }
duke@435 1872
duke@435 1873 inline void dec( Register d, int const13 = 1 ) { sub( d, const13, d); }
duke@435 1874 inline void deccc( Register d, int const13 = 1 ) { subcc( d, const13, d); }
duke@435 1875
duke@435 1876 inline void btst( Register s1, Register s2 ) { andcc( s1, s2, G0 ); }
duke@435 1877 inline void btst( int simm13a, Register s ) { andcc( s, simm13a, G0 ); }
duke@435 1878
duke@435 1879 inline void bset( Register s1, Register s2 ) { or3( s1, s2, s2 ); }
duke@435 1880 inline void bset( int simm13a, Register s ) { or3( s, simm13a, s ); }
duke@435 1881
duke@435 1882 inline void bclr( Register s1, Register s2 ) { andn( s1, s2, s2 ); }
duke@435 1883 inline void bclr( int simm13a, Register s ) { andn( s, simm13a, s ); }
duke@435 1884
duke@435 1885 inline void btog( Register s1, Register s2 ) { xor3( s1, s2, s2 ); }
duke@435 1886 inline void btog( int simm13a, Register s ) { xor3( s, simm13a, s ); }
duke@435 1887
duke@435 1888 inline void clr( Register d ) { or3( G0, G0, d ); }
duke@435 1889
duke@435 1890 inline void clrb( Register s1, Register s2);
duke@435 1891 inline void clrh( Register s1, Register s2);
duke@435 1892 inline void clr( Register s1, Register s2);
duke@435 1893 inline void clrx( Register s1, Register s2);
duke@435 1894
duke@435 1895 inline void clrb( Register s1, int simm13a);
duke@435 1896 inline void clrh( Register s1, int simm13a);
duke@435 1897 inline void clr( Register s1, int simm13a);
duke@435 1898 inline void clrx( Register s1, int simm13a);
duke@435 1899
duke@435 1900 // copy & clear upper word
duke@435 1901 inline void clruw( Register s, Register d ) { srl( s, G0, d); }
duke@435 1902 // clear upper word
duke@435 1903 inline void clruwu( Register d ) { srl( d, G0, d); }
duke@435 1904
duke@435 1905 // membar psuedo instruction. takes into account target memory model.
duke@435 1906 inline void membar( Assembler::Membar_mask_bits const7a );
duke@435 1907
duke@435 1908 // returns if membar generates anything.
duke@435 1909 inline bool membar_has_effect( Assembler::Membar_mask_bits const7a );
duke@435 1910
duke@435 1911 // mov pseudo instructions
duke@435 1912 inline void mov( Register s, Register d) {
duke@435 1913 if ( s != d ) or3( G0, s, d);
duke@435 1914 else assert_not_delayed(); // Put something useful in the delay slot!
duke@435 1915 }
duke@435 1916
duke@435 1917 inline void mov_or_nop( Register s, Register d) {
duke@435 1918 if ( s != d ) or3( G0, s, d);
duke@435 1919 else nop();
duke@435 1920 }
duke@435 1921
duke@435 1922 inline void mov( int simm13a, Register d) { or3( G0, simm13a, d); }
duke@435 1923
duke@435 1924 // address pseudos: make these names unlike instruction names to avoid confusion
duke@435 1925 inline void split_disp( Address& a, Register temp );
duke@435 1926 inline intptr_t load_pc_address( Register reg, int bytes_to_skip );
duke@435 1927 inline void load_address( Address& a, int offset = 0 );
duke@435 1928 inline void load_contents( Address& a, Register d, int offset = 0 );
duke@435 1929 inline void load_ptr_contents( Address& a, Register d, int offset = 0 );
duke@435 1930 inline void store_contents( Register s, Address& a, int offset = 0 );
duke@435 1931 inline void store_ptr_contents( Register s, Address& a, int offset = 0 );
duke@435 1932 inline void jumpl_to( Address& a, Register d, int offset = 0 );
duke@435 1933 inline void jump_to( Address& a, int offset = 0 );
duke@435 1934
duke@435 1935 // ring buffer traceable jumps
duke@435 1936
duke@435 1937 void jmp2( Register r1, Register r2, const char* file, int line );
duke@435 1938 void jmp ( Register r1, int offset, const char* file, int line );
duke@435 1939
duke@435 1940 void jumpl( Address& a, Register d, int offset, const char* file, int line );
duke@435 1941 void jump ( Address& a, int offset, const char* file, int line );
duke@435 1942
duke@435 1943
duke@435 1944 // argument pseudos:
duke@435 1945
duke@435 1946 inline void load_argument( Argument& a, Register d );
duke@435 1947 inline void store_argument( Register s, Argument& a );
duke@435 1948 inline void store_ptr_argument( Register s, Argument& a );
duke@435 1949 inline void store_float_argument( FloatRegister s, Argument& a );
duke@435 1950 inline void store_double_argument( FloatRegister s, Argument& a );
duke@435 1951 inline void store_long_argument( Register s, Argument& a );
duke@435 1952
duke@435 1953 // handy macros:
duke@435 1954
duke@435 1955 inline void round_to( Register r, int modulus ) {
duke@435 1956 assert_not_delayed();
duke@435 1957 inc( r, modulus - 1 );
duke@435 1958 and3( r, -modulus, r );
duke@435 1959 }
duke@435 1960
duke@435 1961 // --------------------------------------------------
duke@435 1962
duke@435 1963 // Functions for isolating 64 bit loads for LP64
duke@435 1964 // ld_ptr will perform ld for 32 bit VM's and ldx for 64 bit VM's
duke@435 1965 // st_ptr will perform st for 32 bit VM's and stx for 64 bit VM's
duke@435 1966 inline void ld_ptr( Register s1, Register s2, Register d );
duke@435 1967 inline void ld_ptr( Register s1, int simm13a, Register d);
jrose@1100 1968 inline void ld_ptr( Register s1, RegisterOrConstant s2, Register d );
duke@435 1969 inline void ld_ptr( const Address& a, Register d, int offset = 0 );
duke@435 1970 inline void st_ptr( Register d, Register s1, Register s2 );
duke@435 1971 inline void st_ptr( Register d, Register s1, int simm13a);
jrose@1100 1972 inline void st_ptr( Register d, Register s1, RegisterOrConstant s2 );
duke@435 1973 inline void st_ptr( Register d, const Address& a, int offset = 0 );
duke@435 1974
duke@435 1975 // ld_long will perform ld for 32 bit VM's and ldx for 64 bit VM's
duke@435 1976 // st_long will perform st for 32 bit VM's and stx for 64 bit VM's
duke@435 1977 inline void ld_long( Register s1, Register s2, Register d );
duke@435 1978 inline void ld_long( Register s1, int simm13a, Register d );
jrose@1100 1979 inline void ld_long( Register s1, RegisterOrConstant s2, Register d );
duke@435 1980 inline void ld_long( const Address& a, Register d, int offset = 0 );
duke@435 1981 inline void st_long( Register d, Register s1, Register s2 );
duke@435 1982 inline void st_long( Register d, Register s1, int simm13a );
jrose@1100 1983 inline void st_long( Register d, Register s1, RegisterOrConstant s2 );
duke@435 1984 inline void st_long( Register d, const Address& a, int offset = 0 );
duke@435 1985
jrose@1057 1986 // Loading values by size and signed-ness
jrose@1100 1987 void load_sized_value(Register s1, RegisterOrConstant s2, Register d,
jrose@1057 1988 int size_in_bytes, bool is_signed);
jrose@1057 1989
jrose@1058 1990 // Helpers for address formation.
jrose@1058 1991 // They update the dest in place, whether it is a register or constant.
jrose@1058 1992 // They emit no code at all if src is a constant zero.
jrose@1058 1993 // If dest is a constant and src is a register, the temp argument
jrose@1058 1994 // is required, and becomes the result.
jrose@1058 1995 // If dest is a register and src is a non-simm13 constant,
jrose@1058 1996 // the temp argument is required, and is used to materialize the constant.
jrose@1100 1997 void regcon_inc_ptr( RegisterOrConstant& dest, RegisterOrConstant src,
jrose@1058 1998 Register temp = noreg );
jrose@1100 1999 void regcon_sll_ptr( RegisterOrConstant& dest, RegisterOrConstant src,
jrose@1058 2000 Register temp = noreg );
jrose@1100 2001 RegisterOrConstant ensure_rs2(RegisterOrConstant rs2, Register sethi_temp) {
jrose@1058 2002 guarantee(sethi_temp != noreg, "constant offset overflow");
jrose@1058 2003 if (is_simm13(rs2.constant_or_zero()))
jrose@1058 2004 return rs2; // register or short constant
jrose@1058 2005 set(rs2.as_constant(), sethi_temp);
jrose@1058 2006 return sethi_temp;
jrose@1058 2007 }
jrose@1058 2008
duke@435 2009 // --------------------------------------------------
duke@435 2010
duke@435 2011 public:
duke@435 2012 // traps as per trap.h (SPARC ABI?)
duke@435 2013
duke@435 2014 void breakpoint_trap();
duke@435 2015 void breakpoint_trap(Condition c, CC cc = icc);
duke@435 2016 void flush_windows_trap();
duke@435 2017 void clean_windows_trap();
duke@435 2018 void get_psr_trap();
duke@435 2019 void set_psr_trap();
duke@435 2020
duke@435 2021 // V8/V9 flush_windows
duke@435 2022 void flush_windows();
duke@435 2023
duke@435 2024 // Support for serializing memory accesses between threads
duke@435 2025 void serialize_memory(Register thread, Register tmp1, Register tmp2);
duke@435 2026
duke@435 2027 // Stack frame creation/removal
duke@435 2028 void enter();
duke@435 2029 void leave();
duke@435 2030
duke@435 2031 // V8/V9 integer multiply
duke@435 2032 void mult(Register s1, Register s2, Register d);
duke@435 2033 void mult(Register s1, int simm13a, Register d);
duke@435 2034
duke@435 2035 // V8/V9 read and write of condition codes.
duke@435 2036 void read_ccr(Register d);
duke@435 2037 void write_ccr(Register s);
duke@435 2038
duke@435 2039 // Manipulation of C++ bools
duke@435 2040 // These are idioms to flag the need for care with accessing bools but on
duke@435 2041 // this platform we assume byte size
duke@435 2042
duke@435 2043 inline void stbool( Register d, const Address& a, int offset = 0 ) { stb(d, a, offset); }
duke@435 2044 inline void ldbool( const Address& a, Register d, int offset = 0 ) { ldsb( a, d, offset ); }
duke@435 2045 inline void tstbool( Register s ) { tst(s); }
duke@435 2046 inline void movbool( bool boolconst, Register d) { mov( (int) boolconst, d); }
duke@435 2047
coleenp@548 2048 // klass oop manipulations if compressed
kvn@599 2049 void load_klass(Register src_oop, Register klass);
kvn@599 2050 void store_klass(Register klass, Register dst_oop);
coleenp@602 2051 void store_klass_gap(Register s, Register dst_oop);
coleenp@548 2052
coleenp@548 2053 // oop manipulations
coleenp@548 2054 void load_heap_oop(const Address& s, Register d, int offset = 0);
coleenp@548 2055 void load_heap_oop(Register s1, Register s2, Register d);
coleenp@548 2056 void load_heap_oop(Register s1, int simm13a, Register d);
coleenp@548 2057 void store_heap_oop(Register d, Register s1, Register s2);
coleenp@548 2058 void store_heap_oop(Register d, Register s1, int simm13a);
coleenp@548 2059 void store_heap_oop(Register d, const Address& a, int offset = 0);
coleenp@548 2060
coleenp@548 2061 void encode_heap_oop(Register src, Register dst);
coleenp@548 2062 void encode_heap_oop(Register r) {
coleenp@548 2063 encode_heap_oop(r, r);
coleenp@548 2064 }
coleenp@548 2065 void decode_heap_oop(Register src, Register dst);
coleenp@548 2066 void decode_heap_oop(Register r) {
coleenp@548 2067 decode_heap_oop(r, r);
coleenp@548 2068 }
coleenp@548 2069 void encode_heap_oop_not_null(Register r);
coleenp@548 2070 void decode_heap_oop_not_null(Register r);
kvn@559 2071 void encode_heap_oop_not_null(Register src, Register dst);
kvn@559 2072 void decode_heap_oop_not_null(Register src, Register dst);
coleenp@548 2073
duke@435 2074 // Support for managing the JavaThread pointer (i.e.; the reference to
duke@435 2075 // thread-local information).
duke@435 2076 void get_thread(); // load G2_thread
duke@435 2077 void verify_thread(); // verify G2_thread contents
duke@435 2078 void save_thread (const Register threache); // save to cache
duke@435 2079 void restore_thread(const Register thread_cache); // restore from cache
duke@435 2080
duke@435 2081 // Support for last Java frame (but use call_VM instead where possible)
duke@435 2082 void set_last_Java_frame(Register last_java_sp, Register last_Java_pc);
duke@435 2083 void reset_last_Java_frame(void);
duke@435 2084
duke@435 2085 // Call into the VM.
duke@435 2086 // Passes the thread pointer (in O0) as a prepended argument.
duke@435 2087 // Makes sure oop return values are visible to the GC.
duke@435 2088 void call_VM(Register oop_result, address entry_point, int number_of_arguments = 0, bool check_exceptions = true);
duke@435 2089 void call_VM(Register oop_result, address entry_point, Register arg_1, bool check_exceptions = true);
duke@435 2090 void call_VM(Register oop_result, address entry_point, Register arg_1, Register arg_2, bool check_exceptions = true);
duke@435 2091 void call_VM(Register oop_result, address entry_point, Register arg_1, Register arg_2, Register arg_3, bool check_exceptions = true);
duke@435 2092
duke@435 2093 // these overloadings are not presently used on SPARC:
duke@435 2094 void call_VM(Register oop_result, Register last_java_sp, address entry_point, int number_of_arguments = 0, bool check_exceptions = true);
duke@435 2095 void call_VM(Register oop_result, Register last_java_sp, address entry_point, Register arg_1, bool check_exceptions = true);
duke@435 2096 void call_VM(Register oop_result, Register last_java_sp, address entry_point, Register arg_1, Register arg_2, bool check_exceptions = true);
duke@435 2097 void call_VM(Register oop_result, Register last_java_sp, address entry_point, Register arg_1, Register arg_2, Register arg_3, bool check_exceptions = true);
duke@435 2098
duke@435 2099 void call_VM_leaf(Register thread_cache, address entry_point, int number_of_arguments = 0);
duke@435 2100 void call_VM_leaf(Register thread_cache, address entry_point, Register arg_1);
duke@435 2101 void call_VM_leaf(Register thread_cache, address entry_point, Register arg_1, Register arg_2);
duke@435 2102 void call_VM_leaf(Register thread_cache, address entry_point, Register arg_1, Register arg_2, Register arg_3);
duke@435 2103
duke@435 2104 void get_vm_result (Register oop_result);
duke@435 2105 void get_vm_result_2(Register oop_result);
duke@435 2106
duke@435 2107 // vm result is currently getting hijacked to for oop preservation
duke@435 2108 void set_vm_result(Register oop_result);
duke@435 2109
duke@435 2110 // if call_VM_base was called with check_exceptions=false, then call
duke@435 2111 // check_and_forward_exception to handle exceptions when it is safe
duke@435 2112 void check_and_forward_exception(Register scratch_reg);
duke@435 2113
duke@435 2114 private:
duke@435 2115 // For V8
duke@435 2116 void read_ccr_trap(Register ccr_save);
duke@435 2117 void write_ccr_trap(Register ccr_save1, Register scratch1, Register scratch2);
duke@435 2118
duke@435 2119 #ifdef ASSERT
duke@435 2120 // For V8 debugging. Uses V8 instruction sequence and checks
duke@435 2121 // result with V9 insturctions rdccr and wrccr.
duke@435 2122 // Uses Gscatch and Gscatch2
duke@435 2123 void read_ccr_v8_assert(Register ccr_save);
duke@435 2124 void write_ccr_v8_assert(Register ccr_save);
duke@435 2125 #endif // ASSERT
duke@435 2126
duke@435 2127 public:
ysr@777 2128
ysr@777 2129 // Write to card table for - register is destroyed afterwards.
ysr@777 2130 void card_table_write(jbyte* byte_map_base, Register tmp, Register obj);
ysr@777 2131
ysr@777 2132 void card_write_barrier_post(Register store_addr, Register new_val, Register tmp);
ysr@777 2133
ysr@777 2134 #ifndef SERIALGC
ysr@777 2135 // Array store and offset
ysr@777 2136 void g1_write_barrier_pre(Register obj, Register index, int offset, Register tmp, bool preserve_o_regs);
ysr@777 2137
ysr@777 2138 void g1_write_barrier_post(Register store_addr, Register new_val, Register tmp);
ysr@777 2139
ysr@777 2140 // May do filtering, depending on the boolean arguments.
ysr@777 2141 void g1_card_table_write(jbyte* byte_map_base,
ysr@777 2142 Register tmp, Register obj, Register new_val,
ysr@777 2143 bool region_filter, bool null_filter);
ysr@777 2144 #endif // SERIALGC
duke@435 2145
duke@435 2146 // pushes double TOS element of FPU stack on CPU stack; pops from FPU stack
duke@435 2147 void push_fTOS();
duke@435 2148
duke@435 2149 // pops double TOS element from CPU stack and pushes on FPU stack
duke@435 2150 void pop_fTOS();
duke@435 2151
duke@435 2152 void empty_FPU_stack();
duke@435 2153
duke@435 2154 void push_IU_state();
duke@435 2155 void pop_IU_state();
duke@435 2156
duke@435 2157 void push_FPU_state();
duke@435 2158 void pop_FPU_state();
duke@435 2159
duke@435 2160 void push_CPU_state();
duke@435 2161 void pop_CPU_state();
duke@435 2162
coleenp@548 2163 // if heap base register is used - reinit it with the correct value
coleenp@548 2164 void reinit_heapbase();
coleenp@548 2165
duke@435 2166 // Debugging
duke@435 2167 void _verify_oop(Register reg, const char * msg, const char * file, int line);
duke@435 2168 void _verify_oop_addr(Address addr, const char * msg, const char * file, int line);
duke@435 2169
duke@435 2170 #define verify_oop(reg) _verify_oop(reg, "broken oop " #reg, __FILE__, __LINE__)
duke@435 2171 #define verify_oop_addr(addr) _verify_oop_addr(addr, "broken oop addr ", __FILE__, __LINE__)
duke@435 2172
duke@435 2173 // only if +VerifyOops
duke@435 2174 void verify_FPU(int stack_depth, const char* s = "illegal FPU state");
duke@435 2175 // only if +VerifyFPU
duke@435 2176 void stop(const char* msg); // prints msg, dumps registers and stops execution
duke@435 2177 void warn(const char* msg); // prints msg, but don't stop
duke@435 2178 void untested(const char* what = "");
duke@435 2179 void unimplemented(const char* what = "") { char* b = new char[1024]; sprintf(b, "unimplemented: %s", what); stop(b); }
duke@435 2180 void should_not_reach_here() { stop("should not reach here"); }
duke@435 2181 void print_CPU_state();
duke@435 2182
duke@435 2183 // oops in code
duke@435 2184 Address allocate_oop_address( jobject obj, Register d ); // allocate_index
duke@435 2185 Address constant_oop_address( jobject obj, Register d ); // find_index
duke@435 2186 inline void set_oop ( jobject obj, Register d ); // uses allocate_oop_address
duke@435 2187 inline void set_oop_constant( jobject obj, Register d ); // uses constant_oop_address
duke@435 2188 inline void set_oop ( Address obj_addr ); // same as load_address
duke@435 2189
kvn@599 2190 void set_narrow_oop( jobject obj, Register d );
kvn@599 2191
duke@435 2192 // nop padding
duke@435 2193 void align(int modulus);
duke@435 2194
duke@435 2195 // declare a safepoint
duke@435 2196 void safepoint();
duke@435 2197
duke@435 2198 // factor out part of stop into subroutine to save space
duke@435 2199 void stop_subroutine();
duke@435 2200 // factor out part of verify_oop into subroutine to save space
duke@435 2201 void verify_oop_subroutine();
duke@435 2202
duke@435 2203 // side-door communication with signalHandler in os_solaris.cpp
duke@435 2204 static address _verify_oop_implicit_branch[3];
duke@435 2205
duke@435 2206 #ifndef PRODUCT
duke@435 2207 static void test();
duke@435 2208 #endif
duke@435 2209
duke@435 2210 // convert an incoming arglist to varargs format; put the pointer in d
duke@435 2211 void set_varargs( Argument a, Register d );
duke@435 2212
duke@435 2213 int total_frame_size_in_bytes(int extraWords);
duke@435 2214
duke@435 2215 // used when extraWords known statically
duke@435 2216 void save_frame(int extraWords);
duke@435 2217 void save_frame_c1(int size_in_bytes);
duke@435 2218 // make a frame, and simultaneously pass up one or two register value
duke@435 2219 // into the new register window
duke@435 2220 void save_frame_and_mov(int extraWords, Register s1, Register d1, Register s2 = Register(), Register d2 = Register());
duke@435 2221
duke@435 2222 // give no. (outgoing) params, calc # of words will need on frame
duke@435 2223 void calc_mem_param_words(Register Rparam_words, Register Rresult);
duke@435 2224
duke@435 2225 // used to calculate frame size dynamically
duke@435 2226 // result is in bytes and must be negated for save inst
duke@435 2227 void calc_frame_size(Register extraWords, Register resultReg);
duke@435 2228
duke@435 2229 // calc and also save
duke@435 2230 void calc_frame_size_and_save(Register extraWords, Register resultReg);
duke@435 2231
duke@435 2232 static void debug(char* msg, RegistersForDebugging* outWindow);
duke@435 2233
duke@435 2234 // implementations of bytecodes used by both interpreter and compiler
duke@435 2235
duke@435 2236 void lcmp( Register Ra_hi, Register Ra_low,
duke@435 2237 Register Rb_hi, Register Rb_low,
duke@435 2238 Register Rresult);
duke@435 2239
duke@435 2240 void lneg( Register Rhi, Register Rlow );
duke@435 2241
duke@435 2242 void lshl( Register Rin_high, Register Rin_low, Register Rcount,
duke@435 2243 Register Rout_high, Register Rout_low, Register Rtemp );
duke@435 2244
duke@435 2245 void lshr( Register Rin_high, Register Rin_low, Register Rcount,
duke@435 2246 Register Rout_high, Register Rout_low, Register Rtemp );
duke@435 2247
duke@435 2248 void lushr( Register Rin_high, Register Rin_low, Register Rcount,
duke@435 2249 Register Rout_high, Register Rout_low, Register Rtemp );
duke@435 2250
duke@435 2251 #ifdef _LP64
duke@435 2252 void lcmp( Register Ra, Register Rb, Register Rresult);
duke@435 2253 #endif
duke@435 2254
duke@435 2255 void float_cmp( bool is_float, int unordered_result,
duke@435 2256 FloatRegister Fa, FloatRegister Fb,
duke@435 2257 Register Rresult);
duke@435 2258
duke@435 2259 void fneg( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d);
duke@435 2260 void fneg( FloatRegisterImpl::Width w, FloatRegister sd ) { Assembler::fneg(w, sd); }
duke@435 2261 void fmov( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d);
duke@435 2262 void fabs( FloatRegisterImpl::Width w, FloatRegister s, FloatRegister d);
duke@435 2263
duke@435 2264 void save_all_globals_into_locals();
duke@435 2265 void restore_globals_from_locals();
duke@435 2266
duke@435 2267 void casx_under_lock(Register top_ptr_reg, Register top_reg, Register ptr_reg,
duke@435 2268 address lock_addr=0, bool use_call_vm=false);
duke@435 2269 void cas_under_lock(Register top_ptr_reg, Register top_reg, Register ptr_reg,
duke@435 2270 address lock_addr=0, bool use_call_vm=false);
duke@435 2271 void casn (Register addr_reg, Register cmp_reg, Register set_reg) ;
duke@435 2272
duke@435 2273 // These set the icc condition code to equal if the lock succeeded
duke@435 2274 // and notEqual if it failed and requires a slow case
kvn@855 2275 void compiler_lock_object(Register Roop, Register Rmark, Register Rbox,
kvn@855 2276 Register Rscratch,
kvn@855 2277 BiasedLockingCounters* counters = NULL,
kvn@855 2278 bool try_bias = UseBiasedLocking);
kvn@855 2279 void compiler_unlock_object(Register Roop, Register Rmark, Register Rbox,
kvn@855 2280 Register Rscratch,
kvn@855 2281 bool try_bias = UseBiasedLocking);
duke@435 2282
duke@435 2283 // Biased locking support
duke@435 2284 // Upon entry, lock_reg must point to the lock record on the stack,
duke@435 2285 // obj_reg must contain the target object, and mark_reg must contain
duke@435 2286 // the target object's header.
duke@435 2287 // Destroys mark_reg if an attempt is made to bias an anonymously
duke@435 2288 // biased lock. In this case a failure will go either to the slow
duke@435 2289 // case or fall through with the notEqual condition code set with
duke@435 2290 // the expectation that the slow case in the runtime will be called.
duke@435 2291 // In the fall-through case where the CAS-based lock is done,
duke@435 2292 // mark_reg is not destroyed.
duke@435 2293 void biased_locking_enter(Register obj_reg, Register mark_reg, Register temp_reg,
duke@435 2294 Label& done, Label* slow_case = NULL,
duke@435 2295 BiasedLockingCounters* counters = NULL);
duke@435 2296 // Upon entry, the base register of mark_addr must contain the oop.
duke@435 2297 // Destroys temp_reg.
duke@435 2298
duke@435 2299 // If allow_delay_slot_filling is set to true, the next instruction
duke@435 2300 // emitted after this one will go in an annulled delay slot if the
duke@435 2301 // biased locking exit case failed.
duke@435 2302 void biased_locking_exit(Address mark_addr, Register temp_reg, Label& done, bool allow_delay_slot_filling = false);
duke@435 2303
duke@435 2304 // allocation
duke@435 2305 void eden_allocate(
duke@435 2306 Register obj, // result: pointer to object after successful allocation
duke@435 2307 Register var_size_in_bytes, // object size in bytes if unknown at compile time; invalid otherwise
duke@435 2308 int con_size_in_bytes, // object size in bytes if known at compile time
duke@435 2309 Register t1, // temp register
duke@435 2310 Register t2, // temp register
duke@435 2311 Label& slow_case // continuation point if fast allocation fails
duke@435 2312 );
duke@435 2313 void tlab_allocate(
duke@435 2314 Register obj, // result: pointer to object after successful allocation
duke@435 2315 Register var_size_in_bytes, // object size in bytes if unknown at compile time; invalid otherwise
duke@435 2316 int con_size_in_bytes, // object size in bytes if known at compile time
duke@435 2317 Register t1, // temp register
duke@435 2318 Label& slow_case // continuation point if fast allocation fails
duke@435 2319 );
duke@435 2320 void tlab_refill(Label& retry_tlab, Label& try_eden, Label& slow_case);
duke@435 2321
jrose@1058 2322 // interface method calling
jrose@1058 2323 void lookup_interface_method(Register recv_klass,
jrose@1058 2324 Register intf_klass,
jrose@1100 2325 RegisterOrConstant itable_index,
jrose@1058 2326 Register method_result,
jrose@1058 2327 Register temp_reg, Register temp2_reg,
jrose@1058 2328 Label& no_such_interface);
jrose@1058 2329
jrose@1079 2330 // Test sub_klass against super_klass, with fast and slow paths.
jrose@1079 2331
jrose@1079 2332 // The fast path produces a tri-state answer: yes / no / maybe-slow.
jrose@1079 2333 // One of the three labels can be NULL, meaning take the fall-through.
jrose@1079 2334 // If super_check_offset is -1, the value is loaded up from super_klass.
jrose@1079 2335 // No registers are killed, except temp_reg and temp2_reg.
jrose@1079 2336 // If super_check_offset is not -1, temp2_reg is not used and can be noreg.
jrose@1079 2337 void check_klass_subtype_fast_path(Register sub_klass,
jrose@1079 2338 Register super_klass,
jrose@1079 2339 Register temp_reg,
jrose@1079 2340 Register temp2_reg,
jrose@1079 2341 Label* L_success,
jrose@1079 2342 Label* L_failure,
jrose@1079 2343 Label* L_slow_path,
jrose@1100 2344 RegisterOrConstant super_check_offset = RegisterOrConstant(-1),
jrose@1079 2345 Register instanceof_hack = noreg);
jrose@1079 2346
jrose@1079 2347 // The rest of the type check; must be wired to a corresponding fast path.
jrose@1079 2348 // It does not repeat the fast path logic, so don't use it standalone.
jrose@1079 2349 // The temp_reg can be noreg, if no temps are available.
jrose@1079 2350 // It can also be sub_klass or super_klass, meaning it's OK to kill that one.
jrose@1079 2351 // Updates the sub's secondary super cache as necessary.
jrose@1079 2352 void check_klass_subtype_slow_path(Register sub_klass,
jrose@1079 2353 Register super_klass,
jrose@1079 2354 Register temp_reg,
jrose@1079 2355 Register temp2_reg,
jrose@1079 2356 Register temp3_reg,
jrose@1079 2357 Register temp4_reg,
jrose@1079 2358 Label* L_success,
jrose@1079 2359 Label* L_failure);
jrose@1079 2360
jrose@1079 2361 // Simplified, combined version, good for typical uses.
jrose@1079 2362 // Falls through on failure.
jrose@1079 2363 void check_klass_subtype(Register sub_klass,
jrose@1079 2364 Register super_klass,
jrose@1079 2365 Register temp_reg,
jrose@1079 2366 Register temp2_reg,
jrose@1079 2367 Label& L_success);
jrose@1079 2368
jrose@1079 2369
duke@435 2370 // Stack overflow checking
duke@435 2371
duke@435 2372 // Note: this clobbers G3_scratch
duke@435 2373 void bang_stack_with_offset(int offset) {
duke@435 2374 // stack grows down, caller passes positive offset
duke@435 2375 assert(offset > 0, "must bang with negative offset");
duke@435 2376 set((-offset)+STACK_BIAS, G3_scratch);
duke@435 2377 st(G0, SP, G3_scratch);
duke@435 2378 }
duke@435 2379
duke@435 2380 // Writes to stack successive pages until offset reached to check for
duke@435 2381 // stack overflow + shadow pages. Clobbers tsp and scratch registers.
duke@435 2382 void bang_stack_size(Register Rsize, Register Rtsp, Register Rscratch);
duke@435 2383
jrose@1100 2384 virtual RegisterOrConstant delayed_value_impl(intptr_t* delayed_value_addr, Register tmp, int offset);
jrose@1057 2385
duke@435 2386 void verify_tlab();
duke@435 2387
duke@435 2388 Condition negate_condition(Condition cond);
duke@435 2389
duke@435 2390 // Helper functions for statistics gathering.
duke@435 2391 // Conditionally (non-atomically) increments passed counter address, preserving condition codes.
duke@435 2392 void cond_inc(Condition cond, address counter_addr, Register Rtemp1, Register Rtemp2);
duke@435 2393 // Unconditional increment.
duke@435 2394 void inc_counter(address counter_addr, Register Rtemp1, Register Rtemp2);
duke@435 2395
duke@435 2396 #undef VIRTUAL
duke@435 2397
duke@435 2398 };
duke@435 2399
duke@435 2400 /**
duke@435 2401 * class SkipIfEqual:
duke@435 2402 *
duke@435 2403 * Instantiating this class will result in assembly code being output that will
duke@435 2404 * jump around any code emitted between the creation of the instance and it's
duke@435 2405 * automatic destruction at the end of a scope block, depending on the value of
duke@435 2406 * the flag passed to the constructor, which will be checked at run-time.
duke@435 2407 */
duke@435 2408 class SkipIfEqual : public StackObj {
duke@435 2409 private:
duke@435 2410 MacroAssembler* _masm;
duke@435 2411 Label _label;
duke@435 2412
duke@435 2413 public:
duke@435 2414 // 'temp' is a temp register that this object can use (and trash)
duke@435 2415 SkipIfEqual(MacroAssembler*, Register temp,
duke@435 2416 const bool* flag_addr, Assembler::Condition condition);
duke@435 2417 ~SkipIfEqual();
duke@435 2418 };
duke@435 2419
duke@435 2420 #ifdef ASSERT
duke@435 2421 // On RISC, there's no benefit to verifying instruction boundaries.
duke@435 2422 inline bool AbstractAssembler::pd_check_instruction_mark() { return false; }
duke@435 2423 #endif

mercurial