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