annotate hotspot/src/cpu/sparc/vm/c1_LIRGenerator_sparc.cpp @ 1066:717c3345024f

5108146: Merge i486 and amd64 cpu directories 6459804: Want client (c1) compiler for x86_64 (amd64) for faster start-up Reviewed-by: kvn
author never
date Wed, 27 Aug 2008 00:21:55 -0700
parents ddf3e9583f2f
children 43b4b8b54e65
rev   line source
duke@1 1 /*
xdono@670 2 * Copyright 2005-2008 Sun Microsystems, Inc. All Rights Reserved.
duke@1 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@1 4 *
duke@1 5 * This code is free software; you can redistribute it and/or modify it
duke@1 6 * under the terms of the GNU General Public License version 2 only, as
duke@1 7 * published by the Free Software Foundation.
duke@1 8 *
duke@1 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@1 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@1 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@1 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@1 13 * accompanied this code).
duke@1 14 *
duke@1 15 * You should have received a copy of the GNU General Public License version
duke@1 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@1 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@1 18 *
duke@1 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@1 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@1 21 * have any questions.
duke@1 22 *
duke@1 23 */
duke@1 24
duke@1 25 # include "incls/_precompiled.incl"
duke@1 26 # include "incls/_c1_LIRGenerator_sparc.cpp.incl"
duke@1 27
duke@1 28 #ifdef ASSERT
duke@1 29 #define __ gen()->lir(__FILE__, __LINE__)->
duke@1 30 #else
duke@1 31 #define __ gen()->lir()->
duke@1 32 #endif
duke@1 33
duke@1 34 void LIRItem::load_byte_item() {
duke@1 35 // byte loads use same registers as other loads
duke@1 36 load_item();
duke@1 37 }
duke@1 38
duke@1 39
duke@1 40 void LIRItem::load_nonconstant() {
duke@1 41 LIR_Opr r = value()->operand();
duke@1 42 if (_gen->can_inline_as_constant(value())) {
duke@1 43 if (!r->is_constant()) {
duke@1 44 r = LIR_OprFact::value_type(value()->type());
duke@1 45 }
duke@1 46 _result = r;
duke@1 47 } else {
duke@1 48 load_item();
duke@1 49 }
duke@1 50 }
duke@1 51
duke@1 52
duke@1 53 //--------------------------------------------------------------
duke@1 54 // LIRGenerator
duke@1 55 //--------------------------------------------------------------
duke@1 56
duke@1 57 LIR_Opr LIRGenerator::exceptionOopOpr() { return FrameMap::Oexception_opr; }
duke@1 58 LIR_Opr LIRGenerator::exceptionPcOpr() { return FrameMap::Oissuing_pc_opr; }
duke@1 59 LIR_Opr LIRGenerator::syncTempOpr() { return new_register(T_OBJECT); }
duke@1 60 LIR_Opr LIRGenerator::getThreadTemp() { return rlock_callee_saved(T_INT); }
duke@1 61
duke@1 62 LIR_Opr LIRGenerator::result_register_for(ValueType* type, bool callee) {
duke@1 63 LIR_Opr opr;
duke@1 64 switch (type->tag()) {
duke@1 65 case intTag: opr = callee ? FrameMap::I0_opr : FrameMap::O0_opr; break;
duke@1 66 case objectTag: opr = callee ? FrameMap::I0_oop_opr : FrameMap::O0_oop_opr; break;
duke@1 67 case longTag: opr = callee ? FrameMap::in_long_opr : FrameMap::out_long_opr; break;
duke@1 68 case floatTag: opr = FrameMap::F0_opr; break;
duke@1 69 case doubleTag: opr = FrameMap::F0_double_opr; break;
duke@1 70
duke@1 71 case addressTag:
duke@1 72 default: ShouldNotReachHere(); return LIR_OprFact::illegalOpr;
duke@1 73 }
duke@1 74
duke@1 75 assert(opr->type_field() == as_OprType(as_BasicType(type)), "type mismatch");
duke@1 76 return opr;
duke@1 77 }
duke@1 78
duke@1 79 LIR_Opr LIRGenerator::rlock_callee_saved(BasicType type) {
duke@1 80 LIR_Opr reg = new_register(type);
duke@1 81 set_vreg_flag(reg, callee_saved);
duke@1 82 return reg;
duke@1 83 }
duke@1 84
duke@1 85
duke@1 86 LIR_Opr LIRGenerator::rlock_byte(BasicType type) {
duke@1 87 return new_register(T_INT);
duke@1 88 }
duke@1 89
duke@1 90
duke@1 91
duke@1 92
duke@1 93
duke@1 94 //--------- loading items into registers --------------------------------
duke@1 95
duke@1 96 // SPARC cannot inline all constants
duke@1 97 bool LIRGenerator::can_store_as_constant(Value v, BasicType type) const {
duke@1 98 if (v->type()->as_IntConstant() != NULL) {
duke@1 99 return v->type()->as_IntConstant()->value() == 0;
duke@1 100 } else if (v->type()->as_LongConstant() != NULL) {
duke@1 101 return v->type()->as_LongConstant()->value() == 0L;
duke@1 102 } else if (v->type()->as_ObjectConstant() != NULL) {
duke@1 103 return v->type()->as_ObjectConstant()->value()->is_null_object();
duke@1 104 } else {
duke@1 105 return false;
duke@1 106 }
duke@1 107 }
duke@1 108
duke@1 109
duke@1 110 // only simm13 constants can be inlined
duke@1 111 bool LIRGenerator:: can_inline_as_constant(Value i) const {
duke@1 112 if (i->type()->as_IntConstant() != NULL) {
duke@1 113 return Assembler::is_simm13(i->type()->as_IntConstant()->value());
duke@1 114 } else {
duke@1 115 return can_store_as_constant(i, as_BasicType(i->type()));
duke@1 116 }
duke@1 117 }
duke@1 118
duke@1 119
duke@1 120 bool LIRGenerator:: can_inline_as_constant(LIR_Const* c) const {
duke@1 121 if (c->type() == T_INT) {
duke@1 122 return Assembler::is_simm13(c->as_jint());
duke@1 123 }
duke@1 124 return false;
duke@1 125 }
duke@1 126
duke@1 127
duke@1 128 LIR_Opr LIRGenerator::safepoint_poll_register() {
duke@1 129 return new_register(T_INT);
duke@1 130 }
duke@1 131
duke@1 132
duke@1 133
duke@1 134 LIR_Address* LIRGenerator::generate_address(LIR_Opr base, LIR_Opr index,
duke@1 135 int shift, int disp, BasicType type) {
duke@1 136 assert(base->is_register(), "must be");
duke@1 137
duke@1 138 // accumulate fixed displacements
duke@1 139 if (index->is_constant()) {
duke@1 140 disp += index->as_constant_ptr()->as_jint() << shift;
duke@1 141 index = LIR_OprFact::illegalOpr;
duke@1 142 }
duke@1 143
duke@1 144 if (index->is_register()) {
duke@1 145 // apply the shift and accumulate the displacement
duke@1 146 if (shift > 0) {
duke@1 147 LIR_Opr tmp = new_register(T_INT);
duke@1 148 __ shift_left(index, shift, tmp);
duke@1 149 index = tmp;
duke@1 150 }
duke@1 151 if (disp != 0) {
duke@1 152 LIR_Opr tmp = new_register(T_INT);
duke@1 153 if (Assembler::is_simm13(disp)) {
duke@1 154 __ add(tmp, LIR_OprFact::intConst(disp), tmp);
duke@1 155 index = tmp;
duke@1 156 } else {
duke@1 157 __ move(LIR_OprFact::intConst(disp), tmp);
duke@1 158 __ add(tmp, index, tmp);
duke@1 159 index = tmp;
duke@1 160 }
duke@1 161 disp = 0;
duke@1 162 }
duke@1 163 } else if (disp != 0 && !Assembler::is_simm13(disp)) {
duke@1 164 // index is illegal so replace it with the displacement loaded into a register
duke@1 165 index = new_register(T_INT);
duke@1 166 __ move(LIR_OprFact::intConst(disp), index);
duke@1 167 disp = 0;
duke@1 168 }
duke@1 169
duke@1 170 // at this point we either have base + index or base + displacement
duke@1 171 if (disp == 0) {
duke@1 172 return new LIR_Address(base, index, type);
duke@1 173 } else {
duke@1 174 assert(Assembler::is_simm13(disp), "must be");
duke@1 175 return new LIR_Address(base, disp, type);
duke@1 176 }
duke@1 177 }
duke@1 178
duke@1 179
duke@1 180 LIR_Address* LIRGenerator::emit_array_address(LIR_Opr array_opr, LIR_Opr index_opr,
duke@1 181 BasicType type, bool needs_card_mark) {
kvn@202 182 int elem_size = type2aelembytes(type);
duke@1 183 int shift = exact_log2(elem_size);
duke@1 184
duke@1 185 LIR_Opr base_opr;
duke@1 186 int offset = arrayOopDesc::base_offset_in_bytes(type);
duke@1 187
duke@1 188 if (index_opr->is_constant()) {
duke@1 189 int i = index_opr->as_constant_ptr()->as_jint();
duke@1 190 int array_offset = i * elem_size;
duke@1 191 if (Assembler::is_simm13(array_offset + offset)) {
duke@1 192 base_opr = array_opr;
duke@1 193 offset = array_offset + offset;
duke@1 194 } else {
duke@1 195 base_opr = new_pointer_register();
duke@1 196 if (Assembler::is_simm13(array_offset)) {
duke@1 197 __ add(array_opr, LIR_OprFact::intptrConst(array_offset), base_opr);
duke@1 198 } else {
duke@1 199 __ move(LIR_OprFact::intptrConst(array_offset), base_opr);
duke@1 200 __ add(base_opr, array_opr, base_opr);
duke@1 201 }
duke@1 202 }
duke@1 203 } else {
duke@1 204 #ifdef _LP64
duke@1 205 if (index_opr->type() == T_INT) {
duke@1 206 LIR_Opr tmp = new_register(T_LONG);
duke@1 207 __ convert(Bytecodes::_i2l, index_opr, tmp);
duke@1 208 index_opr = tmp;
duke@1 209 }
duke@1 210 #endif
duke@1 211
duke@1 212 base_opr = new_pointer_register();
duke@1 213 assert (index_opr->is_register(), "Must be register");
duke@1 214 if (shift > 0) {
duke@1 215 __ shift_left(index_opr, shift, base_opr);
duke@1 216 __ add(base_opr, array_opr, base_opr);
duke@1 217 } else {
duke@1 218 __ add(index_opr, array_opr, base_opr);
duke@1 219 }
duke@1 220 }
duke@1 221 if (needs_card_mark) {
duke@1 222 LIR_Opr ptr = new_pointer_register();
duke@1 223 __ add(base_opr, LIR_OprFact::intptrConst(offset), ptr);
duke@1 224 return new LIR_Address(ptr, 0, type);
duke@1 225 } else {
duke@1 226 return new LIR_Address(base_opr, offset, type);
duke@1 227 }
duke@1 228 }
duke@1 229
duke@1 230
duke@1 231 void LIRGenerator::increment_counter(address counter, int step) {
duke@1 232 LIR_Opr pointer = new_pointer_register();
duke@1 233 __ move(LIR_OprFact::intptrConst(counter), pointer);
duke@1 234 LIR_Address* addr = new LIR_Address(pointer, 0, T_INT);
duke@1 235 increment_counter(addr, step);
duke@1 236 }
duke@1 237
duke@1 238 void LIRGenerator::increment_counter(LIR_Address* addr, int step) {
duke@1 239 LIR_Opr temp = new_register(T_INT);
duke@1 240 __ move(addr, temp);
duke@1 241 LIR_Opr c = LIR_OprFact::intConst(step);
duke@1 242 if (Assembler::is_simm13(step)) {
duke@1 243 __ add(temp, c, temp);
duke@1 244 } else {
duke@1 245 LIR_Opr temp2 = new_register(T_INT);
duke@1 246 __ move(c, temp2);
duke@1 247 __ add(temp, temp2, temp);
duke@1 248 }
duke@1 249 __ move(temp, addr);
duke@1 250 }
duke@1 251
duke@1 252
duke@1 253 void LIRGenerator::cmp_mem_int(LIR_Condition condition, LIR_Opr base, int disp, int c, CodeEmitInfo* info) {
duke@1 254 LIR_Opr o7opr = FrameMap::O7_opr;
duke@1 255 __ load(new LIR_Address(base, disp, T_INT), o7opr, info);
duke@1 256 __ cmp(condition, o7opr, c);
duke@1 257 }
duke@1 258
duke@1 259
duke@1 260 void LIRGenerator::cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Opr base, int disp, BasicType type, CodeEmitInfo* info) {
duke@1 261 LIR_Opr o7opr = FrameMap::O7_opr;
duke@1 262 __ load(new LIR_Address(base, disp, type), o7opr, info);
duke@1 263 __ cmp(condition, reg, o7opr);
duke@1 264 }
duke@1 265
duke@1 266
duke@1 267 void LIRGenerator::cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Opr base, LIR_Opr disp, BasicType type, CodeEmitInfo* info) {
duke@1 268 LIR_Opr o7opr = FrameMap::O7_opr;
duke@1 269 __ load(new LIR_Address(base, disp, type), o7opr, info);
duke@1 270 __ cmp(condition, reg, o7opr);
duke@1 271 }
duke@1 272
duke@1 273
duke@1 274 bool LIRGenerator::strength_reduce_multiply(LIR_Opr left, int c, LIR_Opr result, LIR_Opr tmp) {
duke@1 275 assert(left != result, "should be different registers");
duke@1 276 if (is_power_of_2(c + 1)) {
duke@1 277 __ shift_left(left, log2_intptr(c + 1), result);
duke@1 278 __ sub(result, left, result);
duke@1 279 return true;
duke@1 280 } else if (is_power_of_2(c - 1)) {
duke@1 281 __ shift_left(left, log2_intptr(c - 1), result);
duke@1 282 __ add(result, left, result);
duke@1 283 return true;
duke@1 284 }
duke@1 285 return false;
duke@1 286 }
duke@1 287
duke@1 288
duke@1 289 void LIRGenerator::store_stack_parameter (LIR_Opr item, ByteSize offset_from_sp) {
duke@1 290 BasicType t = item->type();
duke@1 291 LIR_Opr sp_opr = FrameMap::SP_opr;
duke@1 292 if ((t == T_LONG || t == T_DOUBLE) &&
duke@1 293 ((in_bytes(offset_from_sp) - STACK_BIAS) % 8 != 0)) {
duke@1 294 __ unaligned_move(item, new LIR_Address(sp_opr, in_bytes(offset_from_sp), t));
duke@1 295 } else {
duke@1 296 __ move(item, new LIR_Address(sp_opr, in_bytes(offset_from_sp), t));
duke@1 297 }
duke@1 298 }
duke@1 299
duke@1 300 //----------------------------------------------------------------------
duke@1 301 // visitor functions
duke@1 302 //----------------------------------------------------------------------
duke@1 303
duke@1 304
duke@1 305 void LIRGenerator::do_StoreIndexed(StoreIndexed* x) {
duke@1 306 assert(x->is_root(),"");
duke@1 307 bool needs_range_check = true;
duke@1 308 bool use_length = x->length() != NULL;
duke@1 309 bool obj_store = x->elt_type() == T_ARRAY || x->elt_type() == T_OBJECT;
duke@1 310 bool needs_store_check = obj_store && (x->value()->as_Constant() == NULL ||
duke@1 311 !get_jobject_constant(x->value())->is_null_object());
duke@1 312
duke@1 313 LIRItem array(x->array(), this);
duke@1 314 LIRItem index(x->index(), this);
duke@1 315 LIRItem value(x->value(), this);
duke@1 316 LIRItem length(this);
duke@1 317
duke@1 318 array.load_item();
duke@1 319 index.load_nonconstant();
duke@1 320
duke@1 321 if (use_length) {
duke@1 322 needs_range_check = x->compute_needs_range_check();
duke@1 323 if (needs_range_check) {
duke@1 324 length.set_instruction(x->length());
duke@1 325 length.load_item();
duke@1 326 }
duke@1 327 }
duke@1 328 if (needs_store_check) {
duke@1 329 value.load_item();
duke@1 330 } else {
duke@1 331 value.load_for_store(x->elt_type());
duke@1 332 }
duke@1 333
duke@1 334 set_no_result(x);
duke@1 335
duke@1 336 // the CodeEmitInfo must be duplicated for each different
duke@1 337 // LIR-instruction because spilling can occur anywhere between two
duke@1 338 // instructions and so the debug information must be different
duke@1 339 CodeEmitInfo* range_check_info = state_for(x);
duke@1 340 CodeEmitInfo* null_check_info = NULL;
duke@1 341 if (x->needs_null_check()) {
duke@1 342 null_check_info = new CodeEmitInfo(range_check_info);
duke@1 343 }
duke@1 344
duke@1 345 // emit array address setup early so it schedules better
duke@1 346 LIR_Address* array_addr = emit_array_address(array.result(), index.result(), x->elt_type(), obj_store);
duke@1 347
duke@1 348 if (GenerateRangeChecks && needs_range_check) {
duke@1 349 if (use_length) {
duke@1 350 __ cmp(lir_cond_belowEqual, length.result(), index.result());
duke@1 351 __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result()));
duke@1 352 } else {
duke@1 353 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
duke@1 354 // range_check also does the null check
duke@1 355 null_check_info = NULL;
duke@1 356 }
duke@1 357 }
duke@1 358
duke@1 359 if (GenerateArrayStoreCheck && needs_store_check) {
duke@1 360 LIR_Opr tmp1 = FrameMap::G1_opr;
duke@1 361 LIR_Opr tmp2 = FrameMap::G3_opr;
duke@1 362 LIR_Opr tmp3 = FrameMap::G5_opr;
duke@1 363
duke@1 364 CodeEmitInfo* store_check_info = new CodeEmitInfo(range_check_info);
duke@1 365 __ store_check(value.result(), array.result(), tmp1, tmp2, tmp3, store_check_info);
duke@1 366 }
duke@1 367
duke@1 368 __ move(value.result(), array_addr, null_check_info);
duke@1 369 if (obj_store) {
duke@1 370 // Is this precise?
duke@1 371 post_barrier(LIR_OprFact::address(array_addr), value.result());
duke@1 372 }
duke@1 373 }
duke@1 374
duke@1 375
duke@1 376 void LIRGenerator::do_MonitorEnter(MonitorEnter* x) {
duke@1 377 assert(x->is_root(),"");
duke@1 378 LIRItem obj(x->obj(), this);
duke@1 379 obj.load_item();
duke@1 380
duke@1 381 set_no_result(x);
duke@1 382
duke@1 383 LIR_Opr lock = FrameMap::G1_opr;
duke@1 384 LIR_Opr scratch = FrameMap::G3_opr;
duke@1 385 LIR_Opr hdr = FrameMap::G4_opr;
duke@1 386
duke@1 387 CodeEmitInfo* info_for_exception = NULL;
duke@1 388 if (x->needs_null_check()) {
duke@1 389 info_for_exception = state_for(x, x->lock_stack_before());
duke@1 390 }
duke@1 391
duke@1 392 // this CodeEmitInfo must not have the xhandlers because here the
duke@1 393 // object is already locked (xhandlers expects object to be unlocked)
duke@1 394 CodeEmitInfo* info = state_for(x, x->state(), true);
duke@1 395 monitor_enter(obj.result(), lock, hdr, scratch, x->monitor_no(), info_for_exception, info);
duke@1 396 }
duke@1 397
duke@1 398
duke@1 399 void LIRGenerator::do_MonitorExit(MonitorExit* x) {
duke@1 400 assert(x->is_root(),"");
duke@1 401 LIRItem obj(x->obj(), this);
duke@1 402 obj.dont_load_item();
duke@1 403
duke@1 404 set_no_result(x);
duke@1 405 LIR_Opr lock = FrameMap::G1_opr;
duke@1 406 LIR_Opr hdr = FrameMap::G3_opr;
duke@1 407 LIR_Opr obj_temp = FrameMap::G4_opr;
duke@1 408 monitor_exit(obj_temp, lock, hdr, x->monitor_no());
duke@1 409 }
duke@1 410
duke@1 411
duke@1 412 // _ineg, _lneg, _fneg, _dneg
duke@1 413 void LIRGenerator::do_NegateOp(NegateOp* x) {
duke@1 414 LIRItem value(x->x(), this);
duke@1 415 value.load_item();
duke@1 416 LIR_Opr reg = rlock_result(x);
duke@1 417 __ negate(value.result(), reg);
duke@1 418 }
duke@1 419
duke@1 420
duke@1 421
duke@1 422 // for _fadd, _fmul, _fsub, _fdiv, _frem
duke@1 423 // _dadd, _dmul, _dsub, _ddiv, _drem
duke@1 424 void LIRGenerator::do_ArithmeticOp_FPU(ArithmeticOp* x) {
duke@1 425 switch (x->op()) {
duke@1 426 case Bytecodes::_fadd:
duke@1 427 case Bytecodes::_fmul:
duke@1 428 case Bytecodes::_fsub:
duke@1 429 case Bytecodes::_fdiv:
duke@1 430 case Bytecodes::_dadd:
duke@1 431 case Bytecodes::_dmul:
duke@1 432 case Bytecodes::_dsub:
duke@1 433 case Bytecodes::_ddiv: {
duke@1 434 LIRItem left(x->x(), this);
duke@1 435 LIRItem right(x->y(), this);
duke@1 436 left.load_item();
duke@1 437 right.load_item();
duke@1 438 rlock_result(x);
duke@1 439 arithmetic_op_fpu(x->op(), x->operand(), left.result(), right.result(), x->is_strictfp());
duke@1 440 }
duke@1 441 break;
duke@1 442
duke@1 443 case Bytecodes::_frem:
duke@1 444 case Bytecodes::_drem: {
duke@1 445 address entry;
duke@1 446 switch (x->op()) {
duke@1 447 case Bytecodes::_frem:
duke@1 448 entry = CAST_FROM_FN_PTR(address, SharedRuntime::frem);
duke@1 449 break;
duke@1 450 case Bytecodes::_drem:
duke@1 451 entry = CAST_FROM_FN_PTR(address, SharedRuntime::drem);
duke@1 452 break;
duke@1 453 default:
duke@1 454 ShouldNotReachHere();
duke@1 455 }
duke@1 456 LIR_Opr result = call_runtime(x->x(), x->y(), entry, x->type(), NULL);
duke@1 457 set_result(x, result);
duke@1 458 }
duke@1 459 break;
duke@1 460
duke@1 461 default: ShouldNotReachHere();
duke@1 462 }
duke@1 463 }
duke@1 464
duke@1 465
duke@1 466 // for _ladd, _lmul, _lsub, _ldiv, _lrem
duke@1 467 void LIRGenerator::do_ArithmeticOp_Long(ArithmeticOp* x) {
duke@1 468 switch (x->op()) {
duke@1 469 case Bytecodes::_lrem:
duke@1 470 case Bytecodes::_lmul:
duke@1 471 case Bytecodes::_ldiv: {
duke@1 472
duke@1 473 if (x->op() == Bytecodes::_ldiv || x->op() == Bytecodes::_lrem) {
duke@1 474 LIRItem right(x->y(), this);
duke@1 475 right.load_item();
duke@1 476
duke@1 477 CodeEmitInfo* info = state_for(x);
duke@1 478 LIR_Opr item = right.result();
duke@1 479 assert(item->is_register(), "must be");
duke@1 480 __ cmp(lir_cond_equal, item, LIR_OprFact::longConst(0));
duke@1 481 __ branch(lir_cond_equal, T_LONG, new DivByZeroStub(info));
duke@1 482 }
duke@1 483
duke@1 484 address entry;
duke@1 485 switch (x->op()) {
duke@1 486 case Bytecodes::_lrem:
duke@1 487 entry = CAST_FROM_FN_PTR(address, SharedRuntime::lrem);
duke@1 488 break; // check if dividend is 0 is done elsewhere
duke@1 489 case Bytecodes::_ldiv:
duke@1 490 entry = CAST_FROM_FN_PTR(address, SharedRuntime::ldiv);
duke@1 491 break; // check if dividend is 0 is done elsewhere
duke@1 492 case Bytecodes::_lmul:
duke@1 493 entry = CAST_FROM_FN_PTR(address, SharedRuntime::lmul);
duke@1 494 break;
duke@1 495 default:
duke@1 496 ShouldNotReachHere();
duke@1 497 }
duke@1 498
duke@1 499 // order of arguments to runtime call is reversed.
duke@1 500 LIR_Opr result = call_runtime(x->y(), x->x(), entry, x->type(), NULL);
duke@1 501 set_result(x, result);
duke@1 502 break;
duke@1 503 }
duke@1 504 case Bytecodes::_ladd:
duke@1 505 case Bytecodes::_lsub: {
duke@1 506 LIRItem left(x->x(), this);
duke@1 507 LIRItem right(x->y(), this);
duke@1 508 left.load_item();
duke@1 509 right.load_item();
duke@1 510 rlock_result(x);
duke@1 511
duke@1 512 arithmetic_op_long(x->op(), x->operand(), left.result(), right.result(), NULL);
duke@1 513 break;
duke@1 514 }
duke@1 515 default: ShouldNotReachHere();
duke@1 516 }
duke@1 517 }
duke@1 518
duke@1 519
duke@1 520 // Returns if item is an int constant that can be represented by a simm13
duke@1 521 static bool is_simm13(LIR_Opr item) {
duke@1 522 if (item->is_constant() && item->type() == T_INT) {
duke@1 523 return Assembler::is_simm13(item->as_constant_ptr()->as_jint());
duke@1 524 } else {
duke@1 525 return false;
duke@1 526 }
duke@1 527 }
duke@1 528
duke@1 529
duke@1 530 // for: _iadd, _imul, _isub, _idiv, _irem
duke@1 531 void LIRGenerator::do_ArithmeticOp_Int(ArithmeticOp* x) {
duke@1 532 bool is_div_rem = x->op() == Bytecodes::_idiv || x->op() == Bytecodes::_irem;
duke@1 533 LIRItem left(x->x(), this);
duke@1 534 LIRItem right(x->y(), this);
duke@1 535 // missing test if instr is commutative and if we should swap
duke@1 536 right.load_nonconstant();
duke@1 537 assert(right.is_constant() || right.is_register(), "wrong state of right");
duke@1 538 left.load_item();
duke@1 539 rlock_result(x);
duke@1 540 if (is_div_rem) {
duke@1 541 CodeEmitInfo* info = state_for(x);
duke@1 542 LIR_Opr tmp = FrameMap::G1_opr;
duke@1 543 if (x->op() == Bytecodes::_irem) {
duke@1 544 __ irem(left.result(), right.result(), x->operand(), tmp, info);
duke@1 545 } else if (x->op() == Bytecodes::_idiv) {
duke@1 546 __ idiv(left.result(), right.result(), x->operand(), tmp, info);
duke@1 547 }
duke@1 548 } else {
duke@1 549 arithmetic_op_int(x->op(), x->operand(), left.result(), right.result(), FrameMap::G1_opr);
duke@1 550 }
duke@1 551 }
duke@1 552
duke@1 553
duke@1 554 void LIRGenerator::do_ArithmeticOp(ArithmeticOp* x) {
duke@1 555 ValueTag tag = x->type()->tag();
duke@1 556 assert(x->x()->type()->tag() == tag && x->y()->type()->tag() == tag, "wrong parameters");
duke@1 557 switch (tag) {
duke@1 558 case floatTag:
duke@1 559 case doubleTag: do_ArithmeticOp_FPU(x); return;
duke@1 560 case longTag: do_ArithmeticOp_Long(x); return;
duke@1 561 case intTag: do_ArithmeticOp_Int(x); return;
duke@1 562 }
duke@1 563 ShouldNotReachHere();
duke@1 564 }
duke@1 565
duke@1 566
duke@1 567 // _ishl, _lshl, _ishr, _lshr, _iushr, _lushr
duke@1 568 void LIRGenerator::do_ShiftOp(ShiftOp* x) {
duke@1 569 LIRItem value(x->x(), this);
duke@1 570 LIRItem count(x->y(), this);
duke@1 571 // Long shift destroys count register
duke@1 572 if (value.type()->is_long()) {
duke@1 573 count.set_destroys_register();
duke@1 574 }
duke@1 575 value.load_item();
duke@1 576 // the old backend doesn't support this
duke@1 577 if (count.is_constant() && count.type()->as_IntConstant() != NULL && value.type()->is_int()) {
duke@1 578 jint c = count.get_jint_constant() & 0x1f;
duke@1 579 assert(c >= 0 && c < 32, "should be small");
duke@1 580 count.dont_load_item();
duke@1 581 } else {
duke@1 582 count.load_item();
duke@1 583 }
duke@1 584 LIR_Opr reg = rlock_result(x);
duke@1 585 shift_op(x->op(), reg, value.result(), count.result(), LIR_OprFact::illegalOpr);
duke@1 586 }
duke@1 587
duke@1 588
duke@1 589 // _iand, _land, _ior, _lor, _ixor, _lxor
duke@1 590 void LIRGenerator::do_LogicOp(LogicOp* x) {
duke@1 591 LIRItem left(x->x(), this);
duke@1 592 LIRItem right(x->y(), this);
duke@1 593
duke@1 594 left.load_item();
duke@1 595 right.load_nonconstant();
duke@1 596 LIR_Opr reg = rlock_result(x);
duke@1 597
duke@1 598 logic_op(x->op(), reg, left.result(), right.result());
duke@1 599 }
duke@1 600
duke@1 601
duke@1 602
duke@1 603 // _lcmp, _fcmpl, _fcmpg, _dcmpl, _dcmpg
duke@1 604 void LIRGenerator::do_CompareOp(CompareOp* x) {
duke@1 605 LIRItem left(x->x(), this);
duke@1 606 LIRItem right(x->y(), this);
duke@1 607 left.load_item();
duke@1 608 right.load_item();
duke@1 609 LIR_Opr reg = rlock_result(x);
duke@1 610
duke@1 611 if (x->x()->type()->is_float_kind()) {
duke@1 612 Bytecodes::Code code = x->op();
duke@1 613 __ fcmp2int(left.result(), right.result(), reg, (code == Bytecodes::_fcmpl || code == Bytecodes::_dcmpl));
duke@1 614 } else if (x->x()->type()->tag() == longTag) {
duke@1 615 __ lcmp2int(left.result(), right.result(), reg);
duke@1 616 } else {
duke@1 617 Unimplemented();
duke@1 618 }
duke@1 619 }
duke@1 620
duke@1 621
duke@1 622 void LIRGenerator::do_AttemptUpdate(Intrinsic* x) {
duke@1 623 assert(x->number_of_arguments() == 3, "wrong type");
duke@1 624 LIRItem obj (x->argument_at(0), this); // AtomicLong object
duke@1 625 LIRItem cmp_value (x->argument_at(1), this); // value to compare with field
duke@1 626 LIRItem new_value (x->argument_at(2), this); // replace field with new_value if it matches cmp_value
duke@1 627
duke@1 628 obj.load_item();
duke@1 629 cmp_value.load_item();
duke@1 630 new_value.load_item();
duke@1 631
duke@1 632 // generate compare-and-swap and produce zero condition if swap occurs
duke@1 633 int value_offset = sun_misc_AtomicLongCSImpl::value_offset();
duke@1 634 LIR_Opr addr = FrameMap::O7_opr;
duke@1 635 __ add(obj.result(), LIR_OprFact::intConst(value_offset), addr);
duke@1 636 LIR_Opr t1 = FrameMap::G1_opr; // temp for 64-bit value
duke@1 637 LIR_Opr t2 = FrameMap::G3_opr; // temp for 64-bit value
duke@1 638 __ cas_long(addr, cmp_value.result(), new_value.result(), t1, t2);
duke@1 639
duke@1 640 // generate conditional move of boolean result
duke@1 641 LIR_Opr result = rlock_result(x);
duke@1 642 __ cmove(lir_cond_equal, LIR_OprFact::intConst(1), LIR_OprFact::intConst(0), result);
duke@1 643 }
duke@1 644
duke@1 645
duke@1 646 void LIRGenerator::do_CompareAndSwap(Intrinsic* x, ValueType* type) {
duke@1 647 assert(x->number_of_arguments() == 4, "wrong type");
duke@1 648 LIRItem obj (x->argument_at(0), this); // object
duke@1 649 LIRItem offset(x->argument_at(1), this); // offset of field
duke@1 650 LIRItem cmp (x->argument_at(2), this); // value to compare with field
duke@1 651 LIRItem val (x->argument_at(3), this); // replace field with val if matches cmp
duke@1 652
duke@1 653 // Use temps to avoid kills
duke@1 654 LIR_Opr t1 = FrameMap::G1_opr;
duke@1 655 LIR_Opr t2 = FrameMap::G3_opr;
duke@1 656 LIR_Opr addr = new_pointer_register();
duke@1 657
duke@1 658 // get address of field
duke@1 659 obj.load_item();
duke@1 660 offset.load_item();
duke@1 661 cmp.load_item();
duke@1 662 val.load_item();
duke@1 663
duke@1 664 __ add(obj.result(), offset.result(), addr);
duke@1 665
duke@1 666 if (type == objectType)
duke@1 667 __ cas_obj(addr, cmp.result(), val.result(), t1, t2);
duke@1 668 else if (type == intType)
duke@1 669 __ cas_int(addr, cmp.result(), val.result(), t1, t2);
duke@1 670 else if (type == longType)
duke@1 671 __ cas_long(addr, cmp.result(), val.result(), t1, t2);
duke@1 672 else {
duke@1 673 ShouldNotReachHere();
duke@1 674 }
duke@1 675
duke@1 676 // generate conditional move of boolean result
duke@1 677 LIR_Opr result = rlock_result(x);
duke@1 678 __ cmove(lir_cond_equal, LIR_OprFact::intConst(1), LIR_OprFact::intConst(0), result);
duke@1 679 if (type == objectType) { // Write-barrier needed for Object fields.
duke@1 680 post_barrier(obj.result(), val.result());
duke@1 681 }
duke@1 682 }
duke@1 683
duke@1 684
duke@1 685 void LIRGenerator::do_MathIntrinsic(Intrinsic* x) {
duke@1 686 switch (x->id()) {
duke@1 687 case vmIntrinsics::_dabs:
duke@1 688 case vmIntrinsics::_dsqrt: {
duke@1 689 assert(x->number_of_arguments() == 1, "wrong type");
duke@1 690 LIRItem value(x->argument_at(0), this);
duke@1 691 value.load_item();
duke@1 692 LIR_Opr dst = rlock_result(x);
duke@1 693
duke@1 694 switch (x->id()) {
duke@1 695 case vmIntrinsics::_dsqrt: {
duke@1 696 __ sqrt(value.result(), dst, LIR_OprFact::illegalOpr);
duke@1 697 break;
duke@1 698 }
duke@1 699 case vmIntrinsics::_dabs: {
duke@1 700 __ abs(value.result(), dst, LIR_OprFact::illegalOpr);
duke@1 701 break;
duke@1 702 }
duke@1 703 }
duke@1 704 break;
duke@1 705 }
duke@1 706 case vmIntrinsics::_dlog10: // fall through
duke@1 707 case vmIntrinsics::_dlog: // fall through
duke@1 708 case vmIntrinsics::_dsin: // fall through
duke@1 709 case vmIntrinsics::_dtan: // fall through
duke@1 710 case vmIntrinsics::_dcos: {
duke@1 711 assert(x->number_of_arguments() == 1, "wrong type");
duke@1 712
duke@1 713 address runtime_entry = NULL;
duke@1 714 switch (x->id()) {
duke@1 715 case vmIntrinsics::_dsin:
duke@1 716 runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dsin);
duke@1 717 break;
duke@1 718 case vmIntrinsics::_dcos:
duke@1 719 runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dcos);
duke@1 720 break;
duke@1 721 case vmIntrinsics::_dtan:
duke@1 722 runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dtan);
duke@1 723 break;
duke@1 724 case vmIntrinsics::_dlog:
duke@1 725 runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dlog);
duke@1 726 break;
duke@1 727 case vmIntrinsics::_dlog10:
duke@1 728 runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dlog10);
duke@1 729 break;
duke@1 730 default:
duke@1 731 ShouldNotReachHere();
duke@1 732 }
duke@1 733
duke@1 734 LIR_Opr result = call_runtime(x->argument_at(0), runtime_entry, x->type(), NULL);
duke@1 735 set_result(x, result);
duke@1 736 }
duke@1 737 }
duke@1 738 }
duke@1 739
duke@1 740
duke@1 741 void LIRGenerator::do_ArrayCopy(Intrinsic* x) {
duke@1 742 assert(x->number_of_arguments() == 5, "wrong type");
duke@1 743 // Note: spill caller save before setting the item
duke@1 744 LIRItem src (x->argument_at(0), this);
duke@1 745 LIRItem src_pos (x->argument_at(1), this);
duke@1 746 LIRItem dst (x->argument_at(2), this);
duke@1 747 LIRItem dst_pos (x->argument_at(3), this);
duke@1 748 LIRItem length (x->argument_at(4), this);
duke@1 749 // load all values in callee_save_registers, as this makes the
duke@1 750 // parameter passing to the fast case simpler
duke@1 751 src.load_item_force (rlock_callee_saved(T_OBJECT));
duke@1 752 src_pos.load_item_force (rlock_callee_saved(T_INT));
duke@1 753 dst.load_item_force (rlock_callee_saved(T_OBJECT));
duke@1 754 dst_pos.load_item_force (rlock_callee_saved(T_INT));
duke@1 755 length.load_item_force (rlock_callee_saved(T_INT));
duke@1 756
duke@1 757 int flags;
duke@1 758 ciArrayKlass* expected_type;
duke@1 759 arraycopy_helper(x, &flags, &expected_type);
duke@1 760
duke@1 761 CodeEmitInfo* info = state_for(x, x->state());
duke@1 762 __ arraycopy(src.result(), src_pos.result(), dst.result(), dst_pos.result(),
duke@1 763 length.result(), rlock_callee_saved(T_INT),
duke@1 764 expected_type, flags, info);
duke@1 765 set_no_result(x);
duke@1 766 }
duke@1 767
duke@1 768 // _i2l, _i2f, _i2d, _l2i, _l2f, _l2d, _f2i, _f2l, _f2d, _d2i, _d2l, _d2f
duke@1 769 // _i2b, _i2c, _i2s
duke@1 770 void LIRGenerator::do_Convert(Convert* x) {
duke@1 771
duke@1 772 switch (x->op()) {
duke@1 773 case Bytecodes::_f2l:
duke@1 774 case Bytecodes::_d2l:
duke@1 775 case Bytecodes::_d2i:
duke@1 776 case Bytecodes::_l2f:
duke@1 777 case Bytecodes::_l2d: {
duke@1 778
duke@1 779 address entry;
duke@1 780 switch (x->op()) {
duke@1 781 case Bytecodes::_l2f:
duke@1 782 entry = CAST_FROM_FN_PTR(address, SharedRuntime::l2f);
duke@1 783 break;
duke@1 784 case Bytecodes::_l2d:
duke@1 785 entry = CAST_FROM_FN_PTR(address, SharedRuntime::l2d);
duke@1 786 break;
duke@1 787 case Bytecodes::_f2l:
duke@1 788 entry = CAST_FROM_FN_PTR(address, SharedRuntime::f2l);
duke@1 789 break;
duke@1 790 case Bytecodes::_d2l:
duke@1 791 entry = CAST_FROM_FN_PTR(address, SharedRuntime::d2l);
duke@1 792 break;
duke@1 793 case Bytecodes::_d2i:
duke@1 794 entry = CAST_FROM_FN_PTR(address, SharedRuntime::d2i);
duke@1 795 break;
duke@1 796 default:
duke@1 797 ShouldNotReachHere();
duke@1 798 }
duke@1 799 LIR_Opr result = call_runtime(x->value(), entry, x->type(), NULL);
duke@1 800 set_result(x, result);
duke@1 801 break;
duke@1 802 }
duke@1 803
duke@1 804 case Bytecodes::_i2f:
duke@1 805 case Bytecodes::_i2d: {
duke@1 806 LIRItem value(x->value(), this);
duke@1 807
duke@1 808 LIR_Opr reg = rlock_result(x);
duke@1 809 // To convert an int to double, we need to load the 32-bit int
duke@1 810 // from memory into a single precision floating point register
duke@1 811 // (even numbered). Then the sparc fitod instruction takes care
duke@1 812 // of the conversion. This is a bit ugly, but is the best way to
duke@1 813 // get the int value in a single precision floating point register
duke@1 814 value.load_item();
duke@1 815 LIR_Opr tmp = force_to_spill(value.result(), T_FLOAT);
duke@1 816 __ convert(x->op(), tmp, reg);
duke@1 817 break;
duke@1 818 }
duke@1 819 break;
duke@1 820
duke@1 821 case Bytecodes::_i2l:
duke@1 822 case Bytecodes::_i2b:
duke@1 823 case Bytecodes::_i2c:
duke@1 824 case Bytecodes::_i2s:
duke@1 825 case Bytecodes::_l2i:
duke@1 826 case Bytecodes::_f2d:
duke@1 827 case Bytecodes::_d2f: { // inline code
duke@1 828 LIRItem value(x->value(), this);
duke@1 829
duke@1 830 value.load_item();
duke@1 831 LIR_Opr reg = rlock_result(x);
duke@1 832 __ convert(x->op(), value.result(), reg, false);
duke@1 833 }
duke@1 834 break;
duke@1 835
duke@1 836 case Bytecodes::_f2i: {
duke@1 837 LIRItem value (x->value(), this);
duke@1 838 value.set_destroys_register();
duke@1 839 value.load_item();
duke@1 840 LIR_Opr reg = rlock_result(x);
duke@1 841 set_vreg_flag(reg, must_start_in_memory);
duke@1 842 __ convert(x->op(), value.result(), reg, false);
duke@1 843 }
duke@1 844 break;
duke@1 845
duke@1 846 default: ShouldNotReachHere();
duke@1 847 }
duke@1 848 }
duke@1 849
duke@1 850
duke@1 851 void LIRGenerator::do_NewInstance(NewInstance* x) {
duke@1 852 // This instruction can be deoptimized in the slow path : use
duke@1 853 // O0 as result register.
duke@1 854 const LIR_Opr reg = result_register_for(x->type());
duke@1 855
duke@1 856 if (PrintNotLoaded && !x->klass()->is_loaded()) {
duke@1 857 tty->print_cr(" ###class not loaded at new bci %d", x->bci());
duke@1 858 }
duke@1 859 CodeEmitInfo* info = state_for(x, x->state());
duke@1 860 LIR_Opr tmp1 = FrameMap::G1_oop_opr;
duke@1 861 LIR_Opr tmp2 = FrameMap::G3_oop_opr;
duke@1 862 LIR_Opr tmp3 = FrameMap::G4_oop_opr;
duke@1 863 LIR_Opr tmp4 = FrameMap::O1_oop_opr;
duke@1 864 LIR_Opr klass_reg = FrameMap::G5_oop_opr;
duke@1 865 new_instance(reg, x->klass(), tmp1, tmp2, tmp3, tmp4, klass_reg, info);
duke@1 866 LIR_Opr result = rlock_result(x);
duke@1 867 __ move(reg, result);
duke@1 868 }
duke@1 869
duke@1 870
duke@1 871 void LIRGenerator::do_NewTypeArray(NewTypeArray* x) {
duke@1 872 LIRItem length(x->length(), this);
duke@1 873 length.load_item();
duke@1 874
duke@1 875 LIR_Opr reg = result_register_for(x->type());
duke@1 876 LIR_Opr tmp1 = FrameMap::G1_oop_opr;
duke@1 877 LIR_Opr tmp2 = FrameMap::G3_oop_opr;
duke@1 878 LIR_Opr tmp3 = FrameMap::G4_oop_opr;
duke@1 879 LIR_Opr tmp4 = FrameMap::O1_oop_opr;
duke@1 880 LIR_Opr klass_reg = FrameMap::G5_oop_opr;
duke@1 881 LIR_Opr len = length.result();
duke@1 882 BasicType elem_type = x->elt_type();
duke@1 883
duke@1 884 __ oop2reg(ciTypeArrayKlass::make(elem_type)->encoding(), klass_reg);
duke@1 885
duke@1 886 CodeEmitInfo* info = state_for(x, x->state());
duke@1 887 CodeStub* slow_path = new NewTypeArrayStub(klass_reg, len, reg, info);
duke@1 888 __ allocate_array(reg, len, tmp1, tmp2, tmp3, tmp4, elem_type, klass_reg, slow_path);
duke@1 889
duke@1 890 LIR_Opr result = rlock_result(x);
duke@1 891 __ move(reg, result);
duke@1 892 }
duke@1 893
duke@1 894
duke@1 895 void LIRGenerator::do_NewObjectArray(NewObjectArray* x) {
duke@1 896 LIRItem length(x->length(), this);
duke@1 897 // in case of patching (i.e., object class is not yet loaded), we need to reexecute the instruction
duke@1 898 // and therefore provide the state before the parameters have been consumed
duke@1 899 CodeEmitInfo* patching_info = NULL;
duke@1 900 if (!x->klass()->is_loaded() || PatchALot) {
duke@1 901 patching_info = state_for(x, x->state_before());
duke@1 902 }
duke@1 903
duke@1 904 length.load_item();
duke@1 905
duke@1 906 const LIR_Opr reg = result_register_for(x->type());
duke@1 907 LIR_Opr tmp1 = FrameMap::G1_oop_opr;
duke@1 908 LIR_Opr tmp2 = FrameMap::G3_oop_opr;
duke@1 909 LIR_Opr tmp3 = FrameMap::G4_oop_opr;
duke@1 910 LIR_Opr tmp4 = FrameMap::O1_oop_opr;
duke@1 911 LIR_Opr klass_reg = FrameMap::G5_oop_opr;
duke@1 912 LIR_Opr len = length.result();
duke@1 913 CodeEmitInfo* info = state_for(x, x->state());
duke@1 914
duke@1 915 CodeStub* slow_path = new NewObjectArrayStub(klass_reg, len, reg, info);
duke@1 916 ciObject* obj = (ciObject*) ciObjArrayKlass::make(x->klass());
duke@1 917 if (obj == ciEnv::unloaded_ciobjarrayklass()) {
duke@1 918 BAILOUT("encountered unloaded_ciobjarrayklass due to out of memory error");
duke@1 919 }
duke@1 920 jobject2reg_with_patching(klass_reg, obj, patching_info);
duke@1 921 __ allocate_array(reg, len, tmp1, tmp2, tmp3, tmp4, T_OBJECT, klass_reg, slow_path);
duke@1 922
duke@1 923 LIR_Opr result = rlock_result(x);
duke@1 924 __ move(reg, result);
duke@1 925 }
duke@1 926
duke@1 927
duke@1 928 void LIRGenerator::do_NewMultiArray(NewMultiArray* x) {
duke@1 929 Values* dims = x->dims();
duke@1 930 int i = dims->length();
duke@1 931 LIRItemList* items = new LIRItemList(dims->length(), NULL);
duke@1 932 while (i-- > 0) {
duke@1 933 LIRItem* size = new LIRItem(dims->at(i), this);
duke@1 934 items->at_put(i, size);
duke@1 935 }
duke@1 936
duke@1 937 // need to get the info before, as the items may become invalid through item_free
duke@1 938 CodeEmitInfo* patching_info = NULL;
duke@1 939 if (!x->klass()->is_loaded() || PatchALot) {
duke@1 940 patching_info = state_for(x, x->state_before());
duke@1 941
duke@1 942 // cannot re-use same xhandlers for multiple CodeEmitInfos, so
duke@1 943 // clone all handlers
duke@1 944 x->set_exception_handlers(new XHandlers(x->exception_handlers()));
duke@1 945 }
duke@1 946
duke@1 947 i = dims->length();
duke@1 948 while (i-- > 0) {
duke@1 949 LIRItem* size = items->at(i);
duke@1 950 // if a patching_info was generated above then debug information for the state before
duke@1 951 // the call is going to be emitted. The LIRGenerator calls above may have left some values
duke@1 952 // in registers and that's been recorded in the CodeEmitInfo. In that case the items
duke@1 953 // for those values can't simply be freed if they are registers because the values
duke@1 954 // might be destroyed by store_stack_parameter. So in the case of patching, delay the
duke@1 955 // freeing of the items that already were in registers
duke@1 956 size->load_item();
duke@1 957 store_stack_parameter (size->result(),
duke@1 958 in_ByteSize(STACK_BIAS +
never@1066 959 frame::memory_parameter_word_sp_offset * wordSize +
never@1066 960 i * sizeof(jint)));
duke@1 961 }
duke@1 962
duke@1 963 // This instruction can be deoptimized in the slow path : use
duke@1 964 // O0 as result register.
duke@1 965 const LIR_Opr reg = result_register_for(x->type());
duke@1 966 CodeEmitInfo* info = state_for(x, x->state());
duke@1 967
duke@1 968 jobject2reg_with_patching(reg, x->klass(), patching_info);
duke@1 969 LIR_Opr rank = FrameMap::O1_opr;
duke@1 970 __ move(LIR_OprFact::intConst(x->rank()), rank);
duke@1 971 LIR_Opr varargs = FrameMap::as_pointer_opr(O2);
duke@1 972 int offset_from_sp = (frame::memory_parameter_word_sp_offset * wordSize) + STACK_BIAS;
duke@1 973 __ add(FrameMap::SP_opr,
duke@1 974 LIR_OprFact::intptrConst(offset_from_sp),
duke@1 975 varargs);
duke@1 976 LIR_OprList* args = new LIR_OprList(3);
duke@1 977 args->append(reg);
duke@1 978 args->append(rank);
duke@1 979 args->append(varargs);
duke@1 980 __ call_runtime(Runtime1::entry_for(Runtime1::new_multi_array_id),
duke@1 981 LIR_OprFact::illegalOpr,
duke@1 982 reg, args, info);
duke@1 983
duke@1 984 LIR_Opr result = rlock_result(x);
duke@1 985 __ move(reg, result);
duke@1 986 }
duke@1 987
duke@1 988
duke@1 989 void LIRGenerator::do_BlockBegin(BlockBegin* x) {
duke@1 990 }
duke@1 991
duke@1 992
duke@1 993 void LIRGenerator::do_CheckCast(CheckCast* x) {
duke@1 994 LIRItem obj(x->obj(), this);
duke@1 995 CodeEmitInfo* patching_info = NULL;
duke@1 996 if (!x->klass()->is_loaded() || (PatchALot && !x->is_incompatible_class_change_check())) {
duke@1 997 // must do this before locking the destination register as an oop register,
duke@1 998 // and before the obj is loaded (so x->obj()->item() is valid for creating a debug info location)
duke@1 999 patching_info = state_for(x, x->state_before());
duke@1 1000 }
duke@1 1001 obj.load_item();
duke@1 1002 LIR_Opr out_reg = rlock_result(x);
duke@1 1003 CodeStub* stub;
duke@1 1004 CodeEmitInfo* info_for_exception = state_for(x, x->state()->copy_locks());
duke@1 1005
duke@1 1006 if (x->is_incompatible_class_change_check()) {
duke@1 1007 assert(patching_info == NULL, "can't patch this");
duke@1 1008 stub = new SimpleExceptionStub(Runtime1::throw_incompatible_class_change_error_id, LIR_OprFact::illegalOpr, info_for_exception);
duke@1 1009 } else {
duke@1 1010 stub = new SimpleExceptionStub(Runtime1::throw_class_cast_exception_id, obj.result(), info_for_exception);
duke@1 1011 }
duke@1 1012 LIR_Opr tmp1 = FrameMap::G1_oop_opr;
duke@1 1013 LIR_Opr tmp2 = FrameMap::G3_oop_opr;
duke@1 1014 LIR_Opr tmp3 = FrameMap::G4_oop_opr;
duke@1 1015 __ checkcast(out_reg, obj.result(), x->klass(), tmp1, tmp2, tmp3,
duke@1 1016 x->direct_compare(), info_for_exception, patching_info, stub,
duke@1 1017 x->profiled_method(), x->profiled_bci());
duke@1 1018 }
duke@1 1019
duke@1 1020
duke@1 1021 void LIRGenerator::do_InstanceOf(InstanceOf* x) {
duke@1 1022 LIRItem obj(x->obj(), this);
duke@1 1023 CodeEmitInfo* patching_info = NULL;
duke@1 1024 if (!x->klass()->is_loaded() || PatchALot) {
duke@1 1025 patching_info = state_for(x, x->state_before());
duke@1 1026 }
duke@1 1027 // ensure the result register is not the input register because the result is initialized before the patching safepoint
duke@1 1028 obj.load_item();
duke@1 1029 LIR_Opr out_reg = rlock_result(x);
duke@1 1030 LIR_Opr tmp1 = FrameMap::G1_oop_opr;
duke@1 1031 LIR_Opr tmp2 = FrameMap::G3_oop_opr;
duke@1 1032 LIR_Opr tmp3 = FrameMap::G4_oop_opr;
duke@1 1033 __ instanceof(out_reg, obj.result(), x->klass(), tmp1, tmp2, tmp3, x->direct_compare(), patching_info);
duke@1 1034 }
duke@1 1035
duke@1 1036
duke@1 1037 void LIRGenerator::do_If(If* x) {
duke@1 1038 assert(x->number_of_sux() == 2, "inconsistency");
duke@1 1039 ValueTag tag = x->x()->type()->tag();
duke@1 1040 LIRItem xitem(x->x(), this);
duke@1 1041 LIRItem yitem(x->y(), this);
duke@1 1042 LIRItem* xin = &xitem;
duke@1 1043 LIRItem* yin = &yitem;
duke@1 1044 If::Condition cond = x->cond();
duke@1 1045
duke@1 1046 if (tag == longTag) {
duke@1 1047 // for longs, only conditions "eql", "neq", "lss", "geq" are valid;
duke@1 1048 // mirror for other conditions
duke@1 1049 if (cond == If::gtr || cond == If::leq) {
duke@1 1050 // swap inputs
duke@1 1051 cond = Instruction::mirror(cond);
duke@1 1052 xin = &yitem;
duke@1 1053 yin = &xitem;
duke@1 1054 }
duke@1 1055 xin->set_destroys_register();
duke@1 1056 }
duke@1 1057
duke@1 1058 LIR_Opr left = LIR_OprFact::illegalOpr;
duke@1 1059 LIR_Opr right = LIR_OprFact::illegalOpr;
duke@1 1060
duke@1 1061 xin->load_item();
duke@1 1062 left = xin->result();
duke@1 1063
duke@1 1064 if (is_simm13(yin->result())) {
duke@1 1065 // inline int constants which are small enough to be immediate operands
duke@1 1066 right = LIR_OprFact::value_type(yin->value()->type());
duke@1 1067 } else if (tag == longTag && yin->is_constant() && yin->get_jlong_constant() == 0 &&
duke@1 1068 (cond == If::eql || cond == If::neq)) {
duke@1 1069 // inline long zero
duke@1 1070 right = LIR_OprFact::value_type(yin->value()->type());
duke@1 1071 } else if (tag == objectTag && yin->is_constant() && (yin->get_jobject_constant()->is_null_object())) {
duke@1 1072 right = LIR_OprFact::value_type(yin->value()->type());
duke@1 1073 } else {
duke@1 1074 yin->load_item();
duke@1 1075 right = yin->result();
duke@1 1076 }
duke@1 1077 set_no_result(x);
duke@1 1078
duke@1 1079 // add safepoint before generating condition code so it can be recomputed
duke@1 1080 if (x->is_safepoint()) {
duke@1 1081 // increment backedge counter if needed
duke@1 1082 increment_backedge_counter(state_for(x, x->state_before()));
duke@1 1083
duke@1 1084 __ safepoint(new_register(T_INT), state_for(x, x->state_before()));
duke@1 1085 }
duke@1 1086
duke@1 1087 __ cmp(lir_cond(cond), left, right);
duke@1 1088 profile_branch(x, cond);
duke@1 1089 move_to_phi(x->state());
duke@1 1090 if (x->x()->type()->is_float_kind()) {
duke@1 1091 __ branch(lir_cond(cond), right->type(), x->tsux(), x->usux());
duke@1 1092 } else {
duke@1 1093 __ branch(lir_cond(cond), right->type(), x->tsux());
duke@1 1094 }
duke@1 1095 assert(x->default_sux() == x->fsux(), "wrong destination above");
duke@1 1096 __ jump(x->default_sux());
duke@1 1097 }
duke@1 1098
duke@1 1099
duke@1 1100 LIR_Opr LIRGenerator::getThreadPointer() {
duke@1 1101 return FrameMap::as_pointer_opr(G2);
duke@1 1102 }
duke@1 1103
duke@1 1104
duke@1 1105 void LIRGenerator::trace_block_entry(BlockBegin* block) {
duke@1 1106 __ move(LIR_OprFact::intConst(block->block_id()), FrameMap::O0_opr);
duke@1 1107 LIR_OprList* args = new LIR_OprList(1);
duke@1 1108 args->append(FrameMap::O0_opr);
duke@1 1109 address func = CAST_FROM_FN_PTR(address, Runtime1::trace_block_entry);
duke@1 1110 __ call_runtime_leaf(func, rlock_callee_saved(T_INT), LIR_OprFact::illegalOpr, args);
duke@1 1111 }
duke@1 1112
duke@1 1113
duke@1 1114 void LIRGenerator::volatile_field_store(LIR_Opr value, LIR_Address* address,
duke@1 1115 CodeEmitInfo* info) {
duke@1 1116 #ifdef _LP64
duke@1 1117 __ store(value, address, info);
duke@1 1118 #else
duke@1 1119 __ volatile_store_mem_reg(value, address, info);
duke@1 1120 #endif
duke@1 1121 }
duke@1 1122
duke@1 1123 void LIRGenerator::volatile_field_load(LIR_Address* address, LIR_Opr result,
duke@1 1124 CodeEmitInfo* info) {
duke@1 1125 #ifdef _LP64
duke@1 1126 __ load(address, result, info);
duke@1 1127 #else
duke@1 1128 __ volatile_load_mem_reg(address, result, info);
duke@1 1129 #endif
duke@1 1130 }
duke@1 1131
duke@1 1132
duke@1 1133 void LIRGenerator::put_Object_unsafe(LIR_Opr src, LIR_Opr offset, LIR_Opr data,
duke@1 1134 BasicType type, bool is_volatile) {
duke@1 1135 LIR_Opr base_op = src;
duke@1 1136 LIR_Opr index_op = offset;
duke@1 1137
duke@1 1138 bool is_obj = (type == T_ARRAY || type == T_OBJECT);
duke@1 1139 #ifndef _LP64
duke@1 1140 if (is_volatile && type == T_LONG) {
duke@1 1141 __ volatile_store_unsafe_reg(data, src, offset, type, NULL, lir_patch_none);
duke@1 1142 } else
duke@1 1143 #endif
duke@1 1144 {
duke@1 1145 if (type == T_BOOLEAN) {
duke@1 1146 type = T_BYTE;
duke@1 1147 }
duke@1 1148 LIR_Address* addr;
duke@1 1149 if (type == T_ARRAY || type == T_OBJECT) {
duke@1 1150 LIR_Opr tmp = new_pointer_register();
duke@1 1151 __ add(base_op, index_op, tmp);
duke@1 1152 addr = new LIR_Address(tmp, 0, type);
duke@1 1153 } else {
duke@1 1154 addr = new LIR_Address(base_op, index_op, type);
duke@1 1155 }
duke@1 1156
duke@1 1157 __ move(data, addr);
duke@1 1158 if (is_obj) {
duke@1 1159 // This address is precise
duke@1 1160 post_barrier(LIR_OprFact::address(addr), data);
duke@1 1161 }
duke@1 1162 }
duke@1 1163 }
duke@1 1164
duke@1 1165
duke@1 1166 void LIRGenerator::get_Object_unsafe(LIR_Opr dst, LIR_Opr src, LIR_Opr offset,
duke@1 1167 BasicType type, bool is_volatile) {
duke@1 1168 #ifndef _LP64
duke@1 1169 if (is_volatile && type == T_LONG) {
duke@1 1170 __ volatile_load_unsafe_reg(src, offset, dst, type, NULL, lir_patch_none);
duke@1 1171 } else
duke@1 1172 #endif
duke@1 1173 {
duke@1 1174 LIR_Address* addr = new LIR_Address(src, offset, type);
duke@1 1175 __ load(addr, dst);
duke@1 1176 }
duke@1 1177 }