1 /* 2 * Copyright (c) 2005, 2016, 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_Defs.hpp" 28 #include "c1/c1_FrameMap.hpp" 29 #include "c1/c1_Instruction.hpp" 30 #include "c1/c1_LIRAssembler.hpp" 31 #include "c1/c1_LIRGenerator.hpp" 32 #include "c1/c1_ValueStack.hpp" 33 #include "ci/ciArrayKlass.hpp" 34 #include "ci/ciInstance.hpp" 35 #include "ci/ciObjArray.hpp" 36 #include "gc/shared/cardTableModRefBS.hpp" 37 #include "runtime/arguments.hpp" 38 #include "runtime/sharedRuntime.hpp" 39 #include "runtime/stubRoutines.hpp" 40 #include "runtime/vm_version.hpp" 41 #include "utilities/bitMap.inline.hpp" 42 #include "utilities/macros.hpp" 43 #if INCLUDE_ALL_GCS 44 #include "gc/g1/heapRegion.hpp" 45 #endif // INCLUDE_ALL_GCS 46 #ifdef TRACE_HAVE_INTRINSICS 47 #include "trace/traceMacros.hpp" 48 #endif 49 50 #ifdef ASSERT 51 #define __ gen()->lir(__FILE__, __LINE__)-> 52 #else 53 #define __ gen()->lir()-> 54 #endif 55 56 #ifndef PATCHED_ADDR 57 #define PATCHED_ADDR (max_jint) 58 #endif 59 60 void PhiResolverState::reset(int max_vregs) { 61 // Initialize array sizes 62 _virtual_operands.at_put_grow(max_vregs - 1, NULL, NULL); 63 _virtual_operands.trunc_to(0); 64 _other_operands.at_put_grow(max_vregs - 1, NULL, NULL); 65 _other_operands.trunc_to(0); 66 _vreg_table.at_put_grow(max_vregs - 1, NULL, NULL); 67 _vreg_table.trunc_to(0); 68 } 69 70 71 72 //-------------------------------------------------------------- 73 // PhiResolver 74 75 // Resolves cycles: 76 // 77 // r1 := r2 becomes temp := r1 78 // r2 := r1 r1 := r2 79 // r2 := temp 80 // and orders moves: 81 // 82 // r2 := r3 becomes r1 := r2 83 // r1 := r2 r2 := r3 84 85 PhiResolver::PhiResolver(LIRGenerator* gen, int max_vregs) 86 : _gen(gen) 87 , _state(gen->resolver_state()) 88 , _temp(LIR_OprFact::illegalOpr) 89 { 90 // reinitialize the shared state arrays 91 _state.reset(max_vregs); 92 } 93 94 95 void PhiResolver::emit_move(LIR_Opr src, LIR_Opr dest) { 96 assert(src->is_valid(), ""); 97 assert(dest->is_valid(), ""); 98 __ move(src, dest); 99 } 100 101 102 void PhiResolver::move_temp_to(LIR_Opr dest) { 103 assert(_temp->is_valid(), ""); 104 emit_move(_temp, dest); 105 NOT_PRODUCT(_temp = LIR_OprFact::illegalOpr); 106 } 107 108 109 void PhiResolver::move_to_temp(LIR_Opr src) { 110 assert(_temp->is_illegal(), ""); 111 _temp = _gen->new_register(src->type()); 112 emit_move(src, _temp); 113 } 114 115 116 // Traverse assignment graph in depth first order and generate moves in post order 117 // ie. two assignments: b := c, a := b start with node c: 118 // Call graph: move(NULL, c) -> move(c, b) -> move(b, a) 119 // Generates moves in this order: move b to a and move c to b 120 // ie. cycle a := b, b := a start with node a 121 // Call graph: move(NULL, a) -> move(a, b) -> move(b, a) 122 // Generates moves in this order: move b to temp, move a to b, move temp to a 123 void PhiResolver::move(ResolveNode* src, ResolveNode* dest) { 124 if (!dest->visited()) { 125 dest->set_visited(); 126 for (int i = dest->no_of_destinations()-1; i >= 0; i --) { 127 move(dest, dest->destination_at(i)); 128 } 129 } else if (!dest->start_node()) { 130 // cylce in graph detected 131 assert(_loop == NULL, "only one loop valid!"); 132 _loop = dest; 133 move_to_temp(src->operand()); 134 return; 135 } // else dest is a start node 136 137 if (!dest->assigned()) { 138 if (_loop == dest) { 139 move_temp_to(dest->operand()); 140 dest->set_assigned(); 141 } else if (src != NULL) { 142 emit_move(src->operand(), dest->operand()); 143 dest->set_assigned(); 144 } 145 } 146 } 147 148 149 PhiResolver::~PhiResolver() { 150 int i; 151 // resolve any cycles in moves from and to virtual registers 152 for (i = virtual_operands().length() - 1; i >= 0; i --) { 153 ResolveNode* node = virtual_operands().at(i); 154 if (!node->visited()) { 155 _loop = NULL; 156 move(NULL, node); 157 node->set_start_node(); 158 assert(_temp->is_illegal(), "move_temp_to() call missing"); 159 } 160 } 161 162 // generate move for move from non virtual register to abitrary destination 163 for (i = other_operands().length() - 1; i >= 0; i --) { 164 ResolveNode* node = other_operands().at(i); 165 for (int j = node->no_of_destinations() - 1; j >= 0; j --) { 166 emit_move(node->operand(), node->destination_at(j)->operand()); 167 } 168 } 169 } 170 171 172 ResolveNode* PhiResolver::create_node(LIR_Opr opr, bool source) { 173 ResolveNode* node; 174 if (opr->is_virtual()) { 175 int vreg_num = opr->vreg_number(); 176 node = vreg_table().at_grow(vreg_num, NULL); 177 assert(node == NULL || node->operand() == opr, ""); 178 if (node == NULL) { 179 node = new ResolveNode(opr); 180 vreg_table().at_put(vreg_num, node); 181 } 182 // Make sure that all virtual operands show up in the list when 183 // they are used as the source of a move. 184 if (source && !virtual_operands().contains(node)) { 185 virtual_operands().append(node); 186 } 187 } else { 188 assert(source, ""); 189 node = new ResolveNode(opr); 190 other_operands().append(node); 191 } 192 return node; 193 } 194 195 196 void PhiResolver::move(LIR_Opr src, LIR_Opr dest) { 197 assert(dest->is_virtual(), ""); 198 // tty->print("move "); src->print(); tty->print(" to "); dest->print(); tty->cr(); 199 assert(src->is_valid(), ""); 200 assert(dest->is_valid(), ""); 201 ResolveNode* source = source_node(src); 202 source->append(destination_node(dest)); 203 } 204 205 206 //-------------------------------------------------------------- 207 // LIRItem 208 209 void LIRItem::set_result(LIR_Opr opr) { 210 assert(value()->operand()->is_illegal() || value()->operand()->is_constant(), "operand should never change"); 211 value()->set_operand(opr); 212 213 if (opr->is_virtual()) { 214 _gen->_instruction_for_operand.at_put_grow(opr->vreg_number(), value(), NULL); 215 } 216 217 _result = opr; 218 } 219 220 void LIRItem::load_item() { 221 if (result()->is_illegal()) { 222 // update the items result 223 _result = value()->operand(); 224 } 225 if (!result()->is_register()) { 226 LIR_Opr reg = _gen->new_register(value()->type()); 227 __ move(result(), reg); 228 if (result()->is_constant()) { 229 _result = reg; 230 } else { 231 set_result(reg); 232 } 233 } 234 } 235 236 237 void LIRItem::load_for_store(BasicType type) { 238 if (_gen->can_store_as_constant(value(), type)) { 239 _result = value()->operand(); 240 if (!_result->is_constant()) { 241 _result = LIR_OprFact::value_type(value()->type()); 242 } 243 } else if (type == T_BYTE || type == T_BOOLEAN) { 244 load_byte_item(); 245 } else { 246 load_item(); 247 } 248 } 249 250 void LIRItem::load_item_force(LIR_Opr reg) { 251 LIR_Opr r = result(); 252 if (r != reg) { 253 #if !defined(ARM) && !defined(E500V2) 254 if (r->type() != reg->type()) { 255 // moves between different types need an intervening spill slot 256 r = _gen->force_to_spill(r, reg->type()); 257 } 258 #endif 259 __ move(r, reg); 260 _result = reg; 261 } 262 } 263 264 ciObject* LIRItem::get_jobject_constant() const { 265 ObjectType* oc = type()->as_ObjectType(); 266 if (oc) { 267 return oc->constant_value(); 268 } 269 return NULL; 270 } 271 272 273 jint LIRItem::get_jint_constant() const { 274 assert(is_constant() && value() != NULL, ""); 275 assert(type()->as_IntConstant() != NULL, "type check"); 276 return type()->as_IntConstant()->value(); 277 } 278 279 280 jint LIRItem::get_address_constant() const { 281 assert(is_constant() && value() != NULL, ""); 282 assert(type()->as_AddressConstant() != NULL, "type check"); 283 return type()->as_AddressConstant()->value(); 284 } 285 286 287 jfloat LIRItem::get_jfloat_constant() const { 288 assert(is_constant() && value() != NULL, ""); 289 assert(type()->as_FloatConstant() != NULL, "type check"); 290 return type()->as_FloatConstant()->value(); 291 } 292 293 294 jdouble LIRItem::get_jdouble_constant() const { 295 assert(is_constant() && value() != NULL, ""); 296 assert(type()->as_DoubleConstant() != NULL, "type check"); 297 return type()->as_DoubleConstant()->value(); 298 } 299 300 301 jlong LIRItem::get_jlong_constant() const { 302 assert(is_constant() && value() != NULL, ""); 303 assert(type()->as_LongConstant() != NULL, "type check"); 304 return type()->as_LongConstant()->value(); 305 } 306 307 308 309 //-------------------------------------------------------------- 310 311 312 void LIRGenerator::init() { 313 _bs = Universe::heap()->barrier_set(); 314 } 315 316 317 void LIRGenerator::block_do_prolog(BlockBegin* block) { 318 #ifndef PRODUCT 319 if (PrintIRWithLIR) { 320 block->print(); 321 } 322 #endif 323 324 // set up the list of LIR instructions 325 assert(block->lir() == NULL, "LIR list already computed for this block"); 326 _lir = new LIR_List(compilation(), block); 327 block->set_lir(_lir); 328 329 __ branch_destination(block->label()); 330 331 if (LIRTraceExecution && 332 Compilation::current()->hir()->start()->block_id() != block->block_id() && 333 !block->is_set(BlockBegin::exception_entry_flag)) { 334 assert(block->lir()->instructions_list()->length() == 1, "should come right after br_dst"); 335 trace_block_entry(block); 336 } 337 } 338 339 340 void LIRGenerator::block_do_epilog(BlockBegin* block) { 341 #ifndef PRODUCT 342 if (PrintIRWithLIR) { 343 tty->cr(); 344 } 345 #endif 346 347 // LIR_Opr for unpinned constants shouldn't be referenced by other 348 // blocks so clear them out after processing the block. 349 for (int i = 0; i < _unpinned_constants.length(); i++) { 350 _unpinned_constants.at(i)->clear_operand(); 351 } 352 _unpinned_constants.trunc_to(0); 353 354 // clear our any registers for other local constants 355 _constants.trunc_to(0); 356 _reg_for_constants.trunc_to(0); 357 } 358 359 360 void LIRGenerator::block_do(BlockBegin* block) { 361 CHECK_BAILOUT(); 362 363 block_do_prolog(block); 364 set_block(block); 365 366 for (Instruction* instr = block; instr != NULL; instr = instr->next()) { 367 if (instr->is_pinned()) do_root(instr); 368 } 369 370 set_block(NULL); 371 block_do_epilog(block); 372 } 373 374 375 //-------------------------LIRGenerator----------------------------- 376 377 // This is where the tree-walk starts; instr must be root; 378 void LIRGenerator::do_root(Value instr) { 379 CHECK_BAILOUT(); 380 381 InstructionMark im(compilation(), instr); 382 383 assert(instr->is_pinned(), "use only with roots"); 384 assert(instr->subst() == instr, "shouldn't have missed substitution"); 385 386 instr->visit(this); 387 388 assert(!instr->has_uses() || instr->operand()->is_valid() || 389 instr->as_Constant() != NULL || bailed_out(), "invalid item set"); 390 } 391 392 393 // This is called for each node in tree; the walk stops if a root is reached 394 void LIRGenerator::walk(Value instr) { 395 InstructionMark im(compilation(), instr); 396 //stop walk when encounter a root 397 if (instr->is_pinned() && instr->as_Phi() == NULL || instr->operand()->is_valid()) { 398 assert(instr->operand() != LIR_OprFact::illegalOpr || instr->as_Constant() != NULL, "this root has not yet been visited"); 399 } else { 400 assert(instr->subst() == instr, "shouldn't have missed substitution"); 401 instr->visit(this); 402 // assert(instr->use_count() > 0 || instr->as_Phi() != NULL, "leaf instruction must have a use"); 403 } 404 } 405 406 407 CodeEmitInfo* LIRGenerator::state_for(Instruction* x, ValueStack* state, bool ignore_xhandler) { 408 assert(state != NULL, "state must be defined"); 409 410 #ifndef PRODUCT 411 state->verify(); 412 #endif 413 414 ValueStack* s = state; 415 for_each_state(s) { 416 if (s->kind() == ValueStack::EmptyExceptionState) { 417 assert(s->stack_size() == 0 && s->locals_size() == 0 && (s->locks_size() == 0 || s->locks_size() == 1), "state must be empty"); 418 continue; 419 } 420 421 int index; 422 Value value; 423 for_each_stack_value(s, index, value) { 424 assert(value->subst() == value, "missed substitution"); 425 if (!value->is_pinned() && value->as_Constant() == NULL && value->as_Local() == NULL) { 426 walk(value); 427 assert(value->operand()->is_valid(), "must be evaluated now"); 428 } 429 } 430 431 int bci = s->bci(); 432 IRScope* scope = s->scope(); 433 ciMethod* method = scope->method(); 434 435 MethodLivenessResult liveness = method->liveness_at_bci(bci); 436 if (bci == SynchronizationEntryBCI) { 437 if (x->as_ExceptionObject() || x->as_Throw()) { 438 // all locals are dead on exit from the synthetic unlocker 439 liveness.clear(); 440 } else { 441 assert(x->as_MonitorEnter() || x->as_ProfileInvoke(), "only other cases are MonitorEnter and ProfileInvoke"); 442 } 443 } 444 if (!liveness.is_valid()) { 445 // Degenerate or breakpointed method. 446 bailout("Degenerate or breakpointed method"); 447 } else { 448 assert((int)liveness.size() == s->locals_size(), "error in use of liveness"); 449 for_each_local_value(s, index, value) { 450 assert(value->subst() == value, "missed substition"); 451 if (liveness.at(index) && !value->type()->is_illegal()) { 452 if (!value->is_pinned() && value->as_Constant() == NULL && value->as_Local() == NULL) { 453 walk(value); 454 assert(value->operand()->is_valid(), "must be evaluated now"); 455 } 456 } else { 457 // NULL out this local so that linear scan can assume that all non-NULL values are live. 458 s->invalidate_local(index); 459 } 460 } 461 } 462 } 463 464 return new CodeEmitInfo(state, ignore_xhandler ? NULL : x->exception_handlers(), x->check_flag(Instruction::DeoptimizeOnException)); 465 } 466 467 468 CodeEmitInfo* LIRGenerator::state_for(Instruction* x) { 469 return state_for(x, x->exception_state()); 470 } 471 472 473 void LIRGenerator::klass2reg_with_patching(LIR_Opr r, ciMetadata* obj, CodeEmitInfo* info, bool need_resolve) { 474 /* C2 relies on constant pool entries being resolved (ciTypeFlow), so if TieredCompilation 475 * is active and the class hasn't yet been resolved we need to emit a patch that resolves 476 * the class. */ 477 if ((TieredCompilation && need_resolve) || !obj->is_loaded() || PatchALot) { 478 assert(info != NULL, "info must be set if class is not loaded"); 479 __ klass2reg_patch(NULL, r, info); 480 } else { 481 // no patching needed 482 __ metadata2reg(obj->constant_encoding(), r); 483 } 484 } 485 486 487 void LIRGenerator::array_range_check(LIR_Opr array, LIR_Opr index, 488 CodeEmitInfo* null_check_info, CodeEmitInfo* range_check_info) { 489 CodeStub* stub = new RangeCheckStub(range_check_info, index); 490 if (index->is_constant()) { 491 cmp_mem_int(lir_cond_belowEqual, array, arrayOopDesc::length_offset_in_bytes(), 492 index->as_jint(), null_check_info); 493 __ branch(lir_cond_belowEqual, T_INT, stub); // forward branch 494 } else { 495 cmp_reg_mem(lir_cond_aboveEqual, index, array, 496 arrayOopDesc::length_offset_in_bytes(), T_INT, null_check_info); 497 __ branch(lir_cond_aboveEqual, T_INT, stub); // forward branch 498 } 499 } 500 501 502 void LIRGenerator::nio_range_check(LIR_Opr buffer, LIR_Opr index, LIR_Opr result, CodeEmitInfo* info) { 503 CodeStub* stub = new RangeCheckStub(info, index, true); 504 if (index->is_constant()) { 505 cmp_mem_int(lir_cond_belowEqual, buffer, java_nio_Buffer::limit_offset(), index->as_jint(), info); 506 __ branch(lir_cond_belowEqual, T_INT, stub); // forward branch 507 } else { 508 cmp_reg_mem(lir_cond_aboveEqual, index, buffer, 509 java_nio_Buffer::limit_offset(), T_INT, info); 510 __ branch(lir_cond_aboveEqual, T_INT, stub); // forward branch 511 } 512 __ move(index, result); 513 } 514 515 516 517 void LIRGenerator::arithmetic_op(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp_op, CodeEmitInfo* info) { 518 LIR_Opr result_op = result; 519 LIR_Opr left_op = left; 520 LIR_Opr right_op = right; 521 522 if (TwoOperandLIRForm && left_op != result_op) { 523 assert(right_op != result_op, "malformed"); 524 __ move(left_op, result_op); 525 left_op = result_op; 526 } 527 528 switch(code) { 529 case Bytecodes::_dadd: 530 case Bytecodes::_fadd: 531 case Bytecodes::_ladd: 532 case Bytecodes::_iadd: __ add(left_op, right_op, result_op); break; 533 case Bytecodes::_fmul: 534 case Bytecodes::_lmul: __ mul(left_op, right_op, result_op); break; 535 536 case Bytecodes::_dmul: 537 { 538 if (is_strictfp) { 539 __ mul_strictfp(left_op, right_op, result_op, tmp_op); break; 540 } else { 541 __ mul(left_op, right_op, result_op); break; 542 } 543 } 544 break; 545 546 case Bytecodes::_imul: 547 { 548 bool did_strength_reduce = false; 549 550 if (right->is_constant()) { 551 int c = right->as_jint(); 552 if (is_power_of_2(c)) { 553 // do not need tmp here 554 __ shift_left(left_op, exact_log2(c), result_op); 555 did_strength_reduce = true; 556 } else { 557 did_strength_reduce = strength_reduce_multiply(left_op, c, result_op, tmp_op); 558 } 559 } 560 // we couldn't strength reduce so just emit the multiply 561 if (!did_strength_reduce) { 562 __ mul(left_op, right_op, result_op); 563 } 564 } 565 break; 566 567 case Bytecodes::_dsub: 568 case Bytecodes::_fsub: 569 case Bytecodes::_lsub: 570 case Bytecodes::_isub: __ sub(left_op, right_op, result_op); break; 571 572 case Bytecodes::_fdiv: __ div (left_op, right_op, result_op); break; 573 // ldiv and lrem are implemented with a direct runtime call 574 575 case Bytecodes::_ddiv: 576 { 577 if (is_strictfp) { 578 __ div_strictfp (left_op, right_op, result_op, tmp_op); break; 579 } else { 580 __ div (left_op, right_op, result_op); break; 581 } 582 } 583 break; 584 585 case Bytecodes::_drem: 586 case Bytecodes::_frem: __ rem (left_op, right_op, result_op); break; 587 588 default: ShouldNotReachHere(); 589 } 590 } 591 592 593 void LIRGenerator::arithmetic_op_int(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, LIR_Opr tmp) { 594 arithmetic_op(code, result, left, right, false, tmp); 595 } 596 597 598 void LIRGenerator::arithmetic_op_long(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info) { 599 arithmetic_op(code, result, left, right, false, LIR_OprFact::illegalOpr, info); 600 } 601 602 603 void LIRGenerator::arithmetic_op_fpu(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp) { 604 arithmetic_op(code, result, left, right, is_strictfp, tmp); 605 } 606 607 608 void LIRGenerator::shift_op(Bytecodes::Code code, LIR_Opr result_op, LIR_Opr value, LIR_Opr count, LIR_Opr tmp) { 609 if (TwoOperandLIRForm && value != result_op) { 610 assert(count != result_op, "malformed"); 611 __ move(value, result_op); 612 value = result_op; 613 } 614 615 assert(count->is_constant() || count->is_register(), "must be"); 616 switch(code) { 617 case Bytecodes::_ishl: 618 case Bytecodes::_lshl: __ shift_left(value, count, result_op, tmp); break; 619 case Bytecodes::_ishr: 620 case Bytecodes::_lshr: __ shift_right(value, count, result_op, tmp); break; 621 case Bytecodes::_iushr: 622 case Bytecodes::_lushr: __ unsigned_shift_right(value, count, result_op, tmp); break; 623 default: ShouldNotReachHere(); 624 } 625 } 626 627 628 void LIRGenerator::logic_op (Bytecodes::Code code, LIR_Opr result_op, LIR_Opr left_op, LIR_Opr right_op) { 629 if (TwoOperandLIRForm && left_op != result_op) { 630 assert(right_op != result_op, "malformed"); 631 __ move(left_op, result_op); 632 left_op = result_op; 633 } 634 635 switch(code) { 636 case Bytecodes::_iand: 637 case Bytecodes::_land: __ logical_and(left_op, right_op, result_op); break; 638 639 case Bytecodes::_ior: 640 case Bytecodes::_lor: __ logical_or(left_op, right_op, result_op); break; 641 642 case Bytecodes::_ixor: 643 case Bytecodes::_lxor: __ logical_xor(left_op, right_op, result_op); break; 644 645 default: ShouldNotReachHere(); 646 } 647 } 648 649 650 void LIRGenerator::monitor_enter(LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, LIR_Opr scratch, int monitor_no, CodeEmitInfo* info_for_exception, CodeEmitInfo* info) { 651 if (!GenerateSynchronizationCode) return; 652 // for slow path, use debug info for state after successful locking 653 CodeStub* slow_path = new MonitorEnterStub(object, lock, info); 654 __ load_stack_address_monitor(monitor_no, lock); 655 // for handling NullPointerException, use debug info representing just the lock stack before this monitorenter 656 __ lock_object(hdr, object, lock, scratch, slow_path, info_for_exception); 657 } 658 659 660 void LIRGenerator::monitor_exit(LIR_Opr object, LIR_Opr lock, LIR_Opr new_hdr, LIR_Opr scratch, int monitor_no) { 661 if (!GenerateSynchronizationCode) return; 662 // setup registers 663 LIR_Opr hdr = lock; 664 lock = new_hdr; 665 CodeStub* slow_path = new MonitorExitStub(lock, UseFastLocking, monitor_no); 666 __ load_stack_address_monitor(monitor_no, lock); 667 __ unlock_object(hdr, object, lock, scratch, slow_path); 668 } 669 670 #ifndef PRODUCT 671 void LIRGenerator::print_if_not_loaded(const NewInstance* new_instance) { 672 if (PrintNotLoaded && !new_instance->klass()->is_loaded()) { 673 tty->print_cr(" ###class not loaded at new bci %d", new_instance->printable_bci()); 674 } else if (PrintNotLoaded && (TieredCompilation && new_instance->is_unresolved())) { 675 tty->print_cr(" ###class not resolved at new bci %d", new_instance->printable_bci()); 676 } 677 } 678 #endif 679 680 void LIRGenerator::new_instance(LIR_Opr dst, ciInstanceKlass* klass, bool is_unresolved, LIR_Opr scratch1, LIR_Opr scratch2, LIR_Opr scratch3, LIR_Opr scratch4, LIR_Opr klass_reg, CodeEmitInfo* info) { 681 klass2reg_with_patching(klass_reg, klass, info, is_unresolved); 682 // If klass is not loaded we do not know if the klass has finalizers: 683 if (UseFastNewInstance && klass->is_loaded() 684 && !Klass::layout_helper_needs_slow_path(klass->layout_helper())) { 685 686 Runtime1::StubID stub_id = klass->is_initialized() ? Runtime1::fast_new_instance_id : Runtime1::fast_new_instance_init_check_id; 687 688 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, stub_id); 689 690 assert(klass->is_loaded(), "must be loaded"); 691 // allocate space for instance 692 assert(klass->size_helper() >= 0, "illegal instance size"); 693 const int instance_size = align_object_size(klass->size_helper()); 694 __ allocate_object(dst, scratch1, scratch2, scratch3, scratch4, 695 oopDesc::header_size(), instance_size, klass_reg, !klass->is_initialized(), slow_path); 696 } else { 697 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, Runtime1::new_instance_id); 698 __ branch(lir_cond_always, T_ILLEGAL, slow_path); 699 __ branch_destination(slow_path->continuation()); 700 } 701 } 702 703 704 static bool is_constant_zero(Instruction* inst) { 705 IntConstant* c = inst->type()->as_IntConstant(); 706 if (c) { 707 return (c->value() == 0); 708 } 709 return false; 710 } 711 712 713 static bool positive_constant(Instruction* inst) { 714 IntConstant* c = inst->type()->as_IntConstant(); 715 if (c) { 716 return (c->value() >= 0); 717 } 718 return false; 719 } 720 721 722 static ciArrayKlass* as_array_klass(ciType* type) { 723 if (type != NULL && type->is_array_klass() && type->is_loaded()) { 724 return (ciArrayKlass*)type; 725 } else { 726 return NULL; 727 } 728 } 729 730 static ciType* phi_declared_type(Phi* phi) { 731 ciType* t = phi->operand_at(0)->declared_type(); 732 if (t == NULL) { 733 return NULL; 734 } 735 for(int i = 1; i < phi->operand_count(); i++) { 736 if (t != phi->operand_at(i)->declared_type()) { 737 return NULL; 738 } 739 } 740 return t; 741 } 742 743 void LIRGenerator::arraycopy_helper(Intrinsic* x, int* flagsp, ciArrayKlass** expected_typep) { 744 Instruction* src = x->argument_at(0); 745 Instruction* src_pos = x->argument_at(1); 746 Instruction* dst = x->argument_at(2); 747 Instruction* dst_pos = x->argument_at(3); 748 Instruction* length = x->argument_at(4); 749 750 // first try to identify the likely type of the arrays involved 751 ciArrayKlass* expected_type = NULL; 752 bool is_exact = false, src_objarray = false, dst_objarray = false; 753 { 754 ciArrayKlass* src_exact_type = as_array_klass(src->exact_type()); 755 ciArrayKlass* src_declared_type = as_array_klass(src->declared_type()); 756 Phi* phi; 757 if (src_declared_type == NULL && (phi = src->as_Phi()) != NULL) { 758 src_declared_type = as_array_klass(phi_declared_type(phi)); 759 } 760 ciArrayKlass* dst_exact_type = as_array_klass(dst->exact_type()); 761 ciArrayKlass* dst_declared_type = as_array_klass(dst->declared_type()); 762 if (dst_declared_type == NULL && (phi = dst->as_Phi()) != NULL) { 763 dst_declared_type = as_array_klass(phi_declared_type(phi)); 764 } 765 766 if (src_exact_type != NULL && src_exact_type == dst_exact_type) { 767 // the types exactly match so the type is fully known 768 is_exact = true; 769 expected_type = src_exact_type; 770 } else if (dst_exact_type != NULL && dst_exact_type->is_obj_array_klass()) { 771 ciArrayKlass* dst_type = (ciArrayKlass*) dst_exact_type; 772 ciArrayKlass* src_type = NULL; 773 if (src_exact_type != NULL && src_exact_type->is_obj_array_klass()) { 774 src_type = (ciArrayKlass*) src_exact_type; 775 } else if (src_declared_type != NULL && src_declared_type->is_obj_array_klass()) { 776 src_type = (ciArrayKlass*) src_declared_type; 777 } 778 if (src_type != NULL) { 779 if (src_type->element_type()->is_subtype_of(dst_type->element_type())) { 780 is_exact = true; 781 expected_type = dst_type; 782 } 783 } 784 } 785 // at least pass along a good guess 786 if (expected_type == NULL) expected_type = dst_exact_type; 787 if (expected_type == NULL) expected_type = src_declared_type; 788 if (expected_type == NULL) expected_type = dst_declared_type; 789 790 src_objarray = (src_exact_type && src_exact_type->is_obj_array_klass()) || (src_declared_type && src_declared_type->is_obj_array_klass()); 791 dst_objarray = (dst_exact_type && dst_exact_type->is_obj_array_klass()) || (dst_declared_type && dst_declared_type->is_obj_array_klass()); 792 } 793 794 // if a probable array type has been identified, figure out if any 795 // of the required checks for a fast case can be elided. 796 int flags = LIR_OpArrayCopy::all_flags; 797 798 if (!src_objarray) 799 flags &= ~LIR_OpArrayCopy::src_objarray; 800 if (!dst_objarray) 801 flags &= ~LIR_OpArrayCopy::dst_objarray; 802 803 if (!x->arg_needs_null_check(0)) 804 flags &= ~LIR_OpArrayCopy::src_null_check; 805 if (!x->arg_needs_null_check(2)) 806 flags &= ~LIR_OpArrayCopy::dst_null_check; 807 808 809 if (expected_type != NULL) { 810 Value length_limit = NULL; 811 812 IfOp* ifop = length->as_IfOp(); 813 if (ifop != NULL) { 814 // look for expressions like min(v, a.length) which ends up as 815 // x > y ? y : x or x >= y ? y : x 816 if ((ifop->cond() == If::gtr || ifop->cond() == If::geq) && 817 ifop->x() == ifop->fval() && 818 ifop->y() == ifop->tval()) { 819 length_limit = ifop->y(); 820 } 821 } 822 823 // try to skip null checks and range checks 824 NewArray* src_array = src->as_NewArray(); 825 if (src_array != NULL) { 826 flags &= ~LIR_OpArrayCopy::src_null_check; 827 if (length_limit != NULL && 828 src_array->length() == length_limit && 829 is_constant_zero(src_pos)) { 830 flags &= ~LIR_OpArrayCopy::src_range_check; 831 } 832 } 833 834 NewArray* dst_array = dst->as_NewArray(); 835 if (dst_array != NULL) { 836 flags &= ~LIR_OpArrayCopy::dst_null_check; 837 if (length_limit != NULL && 838 dst_array->length() == length_limit && 839 is_constant_zero(dst_pos)) { 840 flags &= ~LIR_OpArrayCopy::dst_range_check; 841 } 842 } 843 844 // check from incoming constant values 845 if (positive_constant(src_pos)) 846 flags &= ~LIR_OpArrayCopy::src_pos_positive_check; 847 if (positive_constant(dst_pos)) 848 flags &= ~LIR_OpArrayCopy::dst_pos_positive_check; 849 if (positive_constant(length)) 850 flags &= ~LIR_OpArrayCopy::length_positive_check; 851 852 // see if the range check can be elided, which might also imply 853 // that src or dst is non-null. 854 ArrayLength* al = length->as_ArrayLength(); 855 if (al != NULL) { 856 if (al->array() == src) { 857 // it's the length of the source array 858 flags &= ~LIR_OpArrayCopy::length_positive_check; 859 flags &= ~LIR_OpArrayCopy::src_null_check; 860 if (is_constant_zero(src_pos)) 861 flags &= ~LIR_OpArrayCopy::src_range_check; 862 } 863 if (al->array() == dst) { 864 // it's the length of the destination array 865 flags &= ~LIR_OpArrayCopy::length_positive_check; 866 flags &= ~LIR_OpArrayCopy::dst_null_check; 867 if (is_constant_zero(dst_pos)) 868 flags &= ~LIR_OpArrayCopy::dst_range_check; 869 } 870 } 871 if (is_exact) { 872 flags &= ~LIR_OpArrayCopy::type_check; 873 } 874 } 875 876 IntConstant* src_int = src_pos->type()->as_IntConstant(); 877 IntConstant* dst_int = dst_pos->type()->as_IntConstant(); 878 if (src_int && dst_int) { 879 int s_offs = src_int->value(); 880 int d_offs = dst_int->value(); 881 if (src_int->value() >= dst_int->value()) { 882 flags &= ~LIR_OpArrayCopy::overlapping; 883 } 884 if (expected_type != NULL) { 885 BasicType t = expected_type->element_type()->basic_type(); 886 int element_size = type2aelembytes(t); 887 if (((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) && 888 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0)) { 889 flags &= ~LIR_OpArrayCopy::unaligned; 890 } 891 } 892 } else if (src_pos == dst_pos || is_constant_zero(dst_pos)) { 893 // src and dest positions are the same, or dst is zero so assume 894 // nonoverlapping copy. 895 flags &= ~LIR_OpArrayCopy::overlapping; 896 } 897 898 if (src == dst) { 899 // moving within a single array so no type checks are needed 900 if (flags & LIR_OpArrayCopy::type_check) { 901 flags &= ~LIR_OpArrayCopy::type_check; 902 } 903 } 904 *flagsp = flags; 905 *expected_typep = (ciArrayKlass*)expected_type; 906 } 907 908 909 LIR_Opr LIRGenerator::round_item(LIR_Opr opr) { 910 assert(opr->is_register(), "why spill if item is not register?"); 911 912 if (RoundFPResults && UseSSE < 1 && opr->is_single_fpu()) { 913 LIR_Opr result = new_register(T_FLOAT); 914 set_vreg_flag(result, must_start_in_memory); 915 assert(opr->is_register(), "only a register can be spilled"); 916 assert(opr->value_type()->is_float(), "rounding only for floats available"); 917 __ roundfp(opr, LIR_OprFact::illegalOpr, result); 918 return result; 919 } 920 return opr; 921 } 922 923 924 LIR_Opr LIRGenerator::force_to_spill(LIR_Opr value, BasicType t) { 925 assert(type2size[t] == type2size[value->type()], 926 "size mismatch: t=%s, value->type()=%s", type2name(t), type2name(value->type())); 927 if (!value->is_register()) { 928 // force into a register 929 LIR_Opr r = new_register(value->type()); 930 __ move(value, r); 931 value = r; 932 } 933 934 // create a spill location 935 LIR_Opr tmp = new_register(t); 936 set_vreg_flag(tmp, LIRGenerator::must_start_in_memory); 937 938 // move from register to spill 939 __ move(value, tmp); 940 return tmp; 941 } 942 943 void LIRGenerator::profile_branch(If* if_instr, If::Condition cond) { 944 if (if_instr->should_profile()) { 945 ciMethod* method = if_instr->profiled_method(); 946 assert(method != NULL, "method should be set if branch is profiled"); 947 ciMethodData* md = method->method_data_or_null(); 948 assert(md != NULL, "Sanity"); 949 ciProfileData* data = md->bci_to_data(if_instr->profiled_bci()); 950 assert(data != NULL, "must have profiling data"); 951 assert(data->is_BranchData(), "need BranchData for two-way branches"); 952 int taken_count_offset = md->byte_offset_of_slot(data, BranchData::taken_offset()); 953 int not_taken_count_offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset()); 954 if (if_instr->is_swapped()) { 955 int t = taken_count_offset; 956 taken_count_offset = not_taken_count_offset; 957 not_taken_count_offset = t; 958 } 959 960 LIR_Opr md_reg = new_register(T_METADATA); 961 __ metadata2reg(md->constant_encoding(), md_reg); 962 963 LIR_Opr data_offset_reg = new_pointer_register(); 964 __ cmove(lir_cond(cond), 965 LIR_OprFact::intptrConst(taken_count_offset), 966 LIR_OprFact::intptrConst(not_taken_count_offset), 967 data_offset_reg, as_BasicType(if_instr->x()->type())); 968 969 // MDO cells are intptr_t, so the data_reg width is arch-dependent. 970 LIR_Opr data_reg = new_pointer_register(); 971 LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type()); 972 __ move(data_addr, data_reg); 973 // Use leal instead of add to avoid destroying condition codes on x86 974 LIR_Address* fake_incr_value = new LIR_Address(data_reg, DataLayout::counter_increment, T_INT); 975 __ leal(LIR_OprFact::address(fake_incr_value), data_reg); 976 __ move(data_reg, data_addr); 977 } 978 } 979 980 // Phi technique: 981 // This is about passing live values from one basic block to the other. 982 // In code generated with Java it is rather rare that more than one 983 // value is on the stack from one basic block to the other. 984 // We optimize our technique for efficient passing of one value 985 // (of type long, int, double..) but it can be extended. 986 // When entering or leaving a basic block, all registers and all spill 987 // slots are release and empty. We use the released registers 988 // and spill slots to pass the live values from one block 989 // to the other. The topmost value, i.e., the value on TOS of expression 990 // stack is passed in registers. All other values are stored in spilling 991 // area. Every Phi has an index which designates its spill slot 992 // At exit of a basic block, we fill the register(s) and spill slots. 993 // At entry of a basic block, the block_prolog sets up the content of phi nodes 994 // and locks necessary registers and spilling slots. 995 996 997 // move current value to referenced phi function 998 void LIRGenerator::move_to_phi(PhiResolver* resolver, Value cur_val, Value sux_val) { 999 Phi* phi = sux_val->as_Phi(); 1000 // cur_val can be null without phi being null in conjunction with inlining 1001 if (phi != NULL && cur_val != NULL && cur_val != phi && !phi->is_illegal()) { 1002 Phi* cur_phi = cur_val->as_Phi(); 1003 if (cur_phi != NULL && cur_phi->is_illegal()) { 1004 // Phi and local would need to get invalidated 1005 // (which is unexpected for Linear Scan). 1006 // But this case is very rare so we simply bail out. 1007 bailout("propagation of illegal phi"); 1008 return; 1009 } 1010 LIR_Opr operand = cur_val->operand(); 1011 if (operand->is_illegal()) { 1012 assert(cur_val->as_Constant() != NULL || cur_val->as_Local() != NULL, 1013 "these can be produced lazily"); 1014 operand = operand_for_instruction(cur_val); 1015 } 1016 resolver->move(operand, operand_for_instruction(phi)); 1017 } 1018 } 1019 1020 1021 // Moves all stack values into their PHI position 1022 void LIRGenerator::move_to_phi(ValueStack* cur_state) { 1023 BlockBegin* bb = block(); 1024 if (bb->number_of_sux() == 1) { 1025 BlockBegin* sux = bb->sux_at(0); 1026 assert(sux->number_of_preds() > 0, "invalid CFG"); 1027 1028 // a block with only one predecessor never has phi functions 1029 if (sux->number_of_preds() > 1) { 1030 int max_phis = cur_state->stack_size() + cur_state->locals_size(); 1031 PhiResolver resolver(this, _virtual_register_number + max_phis * 2); 1032 1033 ValueStack* sux_state = sux->state(); 1034 Value sux_value; 1035 int index; 1036 1037 assert(cur_state->scope() == sux_state->scope(), "not matching"); 1038 assert(cur_state->locals_size() == sux_state->locals_size(), "not matching"); 1039 assert(cur_state->stack_size() == sux_state->stack_size(), "not matching"); 1040 1041 for_each_stack_value(sux_state, index, sux_value) { 1042 move_to_phi(&resolver, cur_state->stack_at(index), sux_value); 1043 } 1044 1045 for_each_local_value(sux_state, index, sux_value) { 1046 move_to_phi(&resolver, cur_state->local_at(index), sux_value); 1047 } 1048 1049 assert(cur_state->caller_state() == sux_state->caller_state(), "caller states must be equal"); 1050 } 1051 } 1052 } 1053 1054 1055 LIR_Opr LIRGenerator::new_register(BasicType type) { 1056 int vreg = _virtual_register_number; 1057 // add a little fudge factor for the bailout, since the bailout is 1058 // only checked periodically. This gives a few extra registers to 1059 // hand out before we really run out, which helps us keep from 1060 // tripping over assertions. 1061 if (vreg + 20 >= LIR_OprDesc::vreg_max) { 1062 bailout("out of virtual registers"); 1063 if (vreg + 2 >= LIR_OprDesc::vreg_max) { 1064 // wrap it around 1065 _virtual_register_number = LIR_OprDesc::vreg_base; 1066 } 1067 } 1068 _virtual_register_number += 1; 1069 return LIR_OprFact::virtual_register(vreg, type); 1070 } 1071 1072 1073 // Try to lock using register in hint 1074 LIR_Opr LIRGenerator::rlock(Value instr) { 1075 return new_register(instr->type()); 1076 } 1077 1078 1079 // does an rlock and sets result 1080 LIR_Opr LIRGenerator::rlock_result(Value x) { 1081 LIR_Opr reg = rlock(x); 1082 set_result(x, reg); 1083 return reg; 1084 } 1085 1086 1087 // does an rlock and sets result 1088 LIR_Opr LIRGenerator::rlock_result(Value x, BasicType type) { 1089 LIR_Opr reg; 1090 switch (type) { 1091 case T_BYTE: 1092 case T_BOOLEAN: 1093 reg = rlock_byte(type); 1094 break; 1095 default: 1096 reg = rlock(x); 1097 break; 1098 } 1099 1100 set_result(x, reg); 1101 return reg; 1102 } 1103 1104 1105 //--------------------------------------------------------------------- 1106 ciObject* LIRGenerator::get_jobject_constant(Value value) { 1107 ObjectType* oc = value->type()->as_ObjectType(); 1108 if (oc) { 1109 return oc->constant_value(); 1110 } 1111 return NULL; 1112 } 1113 1114 1115 void LIRGenerator::do_ExceptionObject(ExceptionObject* x) { 1116 assert(block()->is_set(BlockBegin::exception_entry_flag), "ExceptionObject only allowed in exception handler block"); 1117 assert(block()->next() == x, "ExceptionObject must be first instruction of block"); 1118 1119 // no moves are created for phi functions at the begin of exception 1120 // handlers, so assign operands manually here 1121 for_each_phi_fun(block(), phi, 1122 operand_for_instruction(phi)); 1123 1124 LIR_Opr thread_reg = getThreadPointer(); 1125 __ move_wide(new LIR_Address(thread_reg, in_bytes(JavaThread::exception_oop_offset()), T_OBJECT), 1126 exceptionOopOpr()); 1127 __ move_wide(LIR_OprFact::oopConst(NULL), 1128 new LIR_Address(thread_reg, in_bytes(JavaThread::exception_oop_offset()), T_OBJECT)); 1129 __ move_wide(LIR_OprFact::oopConst(NULL), 1130 new LIR_Address(thread_reg, in_bytes(JavaThread::exception_pc_offset()), T_OBJECT)); 1131 1132 LIR_Opr result = new_register(T_OBJECT); 1133 __ move(exceptionOopOpr(), result); 1134 set_result(x, result); 1135 } 1136 1137 1138 //---------------------------------------------------------------------- 1139 //---------------------------------------------------------------------- 1140 //---------------------------------------------------------------------- 1141 //---------------------------------------------------------------------- 1142 // visitor functions 1143 //---------------------------------------------------------------------- 1144 //---------------------------------------------------------------------- 1145 //---------------------------------------------------------------------- 1146 //---------------------------------------------------------------------- 1147 1148 void LIRGenerator::do_Phi(Phi* x) { 1149 // phi functions are never visited directly 1150 ShouldNotReachHere(); 1151 } 1152 1153 1154 // Code for a constant is generated lazily unless the constant is frequently used and can't be inlined. 1155 void LIRGenerator::do_Constant(Constant* x) { 1156 if (x->state_before() != NULL) { 1157 // Any constant with a ValueStack requires patching so emit the patch here 1158 LIR_Opr reg = rlock_result(x); 1159 CodeEmitInfo* info = state_for(x, x->state_before()); 1160 __ oop2reg_patch(NULL, reg, info); 1161 } else if (x->use_count() > 1 && !can_inline_as_constant(x)) { 1162 if (!x->is_pinned()) { 1163 // unpinned constants are handled specially so that they can be 1164 // put into registers when they are used multiple times within a 1165 // block. After the block completes their operand will be 1166 // cleared so that other blocks can't refer to that register. 1167 set_result(x, load_constant(x)); 1168 } else { 1169 LIR_Opr res = x->operand(); 1170 if (!res->is_valid()) { 1171 res = LIR_OprFact::value_type(x->type()); 1172 } 1173 if (res->is_constant()) { 1174 LIR_Opr reg = rlock_result(x); 1175 __ move(res, reg); 1176 } else { 1177 set_result(x, res); 1178 } 1179 } 1180 } else { 1181 set_result(x, LIR_OprFact::value_type(x->type())); 1182 } 1183 } 1184 1185 1186 void LIRGenerator::do_Local(Local* x) { 1187 // operand_for_instruction has the side effect of setting the result 1188 // so there's no need to do it here. 1189 operand_for_instruction(x); 1190 } 1191 1192 1193 void LIRGenerator::do_IfInstanceOf(IfInstanceOf* x) { 1194 Unimplemented(); 1195 } 1196 1197 1198 void LIRGenerator::do_Return(Return* x) { 1199 if (compilation()->env()->dtrace_method_probes()) { 1200 BasicTypeList signature; 1201 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread 1202 signature.append(T_METADATA); // Method* 1203 LIR_OprList* args = new LIR_OprList(); 1204 args->append(getThreadPointer()); 1205 LIR_Opr meth = new_register(T_METADATA); 1206 __ metadata2reg(method()->constant_encoding(), meth); 1207 args->append(meth); 1208 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), voidType, NULL); 1209 } 1210 1211 if (x->type()->is_void()) { 1212 __ return_op(LIR_OprFact::illegalOpr); 1213 } else { 1214 LIR_Opr reg = result_register_for(x->type(), /*callee=*/true); 1215 LIRItem result(x->result(), this); 1216 1217 result.load_item_force(reg); 1218 __ return_op(result.result()); 1219 } 1220 set_no_result(x); 1221 } 1222 1223 // Examble: ref.get() 1224 // Combination of LoadField and g1 pre-write barrier 1225 void LIRGenerator::do_Reference_get(Intrinsic* x) { 1226 1227 const int referent_offset = java_lang_ref_Reference::referent_offset; 1228 guarantee(referent_offset > 0, "referent offset not initialized"); 1229 1230 assert(x->number_of_arguments() == 1, "wrong type"); 1231 1232 LIRItem reference(x->argument_at(0), this); 1233 reference.load_item(); 1234 1235 // need to perform the null check on the reference objecy 1236 CodeEmitInfo* info = NULL; 1237 if (x->needs_null_check()) { 1238 info = state_for(x); 1239 } 1240 1241 LIR_Address* referent_field_adr = 1242 new LIR_Address(reference.result(), referent_offset, T_OBJECT); 1243 1244 LIR_Opr result = rlock_result(x); 1245 1246 __ load(referent_field_adr, result, info); 1247 1248 // Register the value in the referent field with the pre-barrier 1249 pre_barrier(LIR_OprFact::illegalOpr /* addr_opr */, 1250 result /* pre_val */, 1251 false /* do_load */, 1252 false /* patch */, 1253 NULL /* info */); 1254 } 1255 1256 // Example: clazz.isInstance(object) 1257 void LIRGenerator::do_isInstance(Intrinsic* x) { 1258 assert(x->number_of_arguments() == 2, "wrong type"); 1259 1260 // TODO could try to substitute this node with an equivalent InstanceOf 1261 // if clazz is known to be a constant Class. This will pick up newly found 1262 // constants after HIR construction. I'll leave this to a future change. 1263 1264 // as a first cut, make a simple leaf call to runtime to stay platform independent. 1265 // could follow the aastore example in a future change. 1266 1267 LIRItem clazz(x->argument_at(0), this); 1268 LIRItem object(x->argument_at(1), this); 1269 clazz.load_item(); 1270 object.load_item(); 1271 LIR_Opr result = rlock_result(x); 1272 1273 // need to perform null check on clazz 1274 if (x->needs_null_check()) { 1275 CodeEmitInfo* info = state_for(x); 1276 __ null_check(clazz.result(), info); 1277 } 1278 1279 LIR_Opr call_result = call_runtime(clazz.value(), object.value(), 1280 CAST_FROM_FN_PTR(address, Runtime1::is_instance_of), 1281 x->type(), 1282 NULL); // NULL CodeEmitInfo results in a leaf call 1283 __ move(call_result, result); 1284 } 1285 1286 // Example: object.getClass () 1287 void LIRGenerator::do_getClass(Intrinsic* x) { 1288 assert(x->number_of_arguments() == 1, "wrong type"); 1289 1290 LIRItem rcvr(x->argument_at(0), this); 1291 rcvr.load_item(); 1292 LIR_Opr temp = new_register(T_METADATA); 1293 LIR_Opr result = rlock_result(x); 1294 1295 // need to perform the null check on the rcvr 1296 CodeEmitInfo* info = NULL; 1297 if (x->needs_null_check()) { 1298 info = state_for(x); 1299 } 1300 1301 // FIXME T_ADDRESS should actually be T_METADATA but it can't because the 1302 // meaning of these two is mixed up (see JDK-8026837). 1303 __ move(new LIR_Address(rcvr.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), temp, info); 1304 __ move_wide(new LIR_Address(temp, in_bytes(Klass::java_mirror_offset()), T_OBJECT), result); 1305 } 1306 1307 // java.lang.Class::isPrimitive() 1308 void LIRGenerator::do_isPrimitive(Intrinsic* x) { 1309 assert(x->number_of_arguments() == 1, "wrong type"); 1310 1311 LIRItem rcvr(x->argument_at(0), this); 1312 rcvr.load_item(); 1313 LIR_Opr temp = new_register(T_METADATA); 1314 LIR_Opr result = rlock_result(x); 1315 1316 CodeEmitInfo* info = NULL; 1317 if (x->needs_null_check()) { 1318 info = state_for(x); 1319 } 1320 1321 __ move(new LIR_Address(rcvr.result(), java_lang_Class::klass_offset_in_bytes(), T_ADDRESS), temp, info); 1322 __ cmp(lir_cond_notEqual, temp, LIR_OprFact::intConst(0)); 1323 __ cmove(lir_cond_notEqual, LIR_OprFact::intConst(0), LIR_OprFact::intConst(1), result, T_BOOLEAN); 1324 } 1325 1326 1327 // Example: Thread.currentThread() 1328 void LIRGenerator::do_currentThread(Intrinsic* x) { 1329 assert(x->number_of_arguments() == 0, "wrong type"); 1330 LIR_Opr reg = rlock_result(x); 1331 __ move_wide(new LIR_Address(getThreadPointer(), in_bytes(JavaThread::threadObj_offset()), T_OBJECT), reg); 1332 } 1333 1334 1335 void LIRGenerator::do_RegisterFinalizer(Intrinsic* x) { 1336 assert(x->number_of_arguments() == 1, "wrong type"); 1337 LIRItem receiver(x->argument_at(0), this); 1338 1339 receiver.load_item(); 1340 BasicTypeList signature; 1341 signature.append(T_OBJECT); // receiver 1342 LIR_OprList* args = new LIR_OprList(); 1343 args->append(receiver.result()); 1344 CodeEmitInfo* info = state_for(x, x->state()); 1345 call_runtime(&signature, args, 1346 CAST_FROM_FN_PTR(address, Runtime1::entry_for(Runtime1::register_finalizer_id)), 1347 voidType, info); 1348 1349 set_no_result(x); 1350 } 1351 1352 1353 //------------------------local access-------------------------------------- 1354 1355 LIR_Opr LIRGenerator::operand_for_instruction(Instruction* x) { 1356 if (x->operand()->is_illegal()) { 1357 Constant* c = x->as_Constant(); 1358 if (c != NULL) { 1359 x->set_operand(LIR_OprFact::value_type(c->type())); 1360 } else { 1361 assert(x->as_Phi() || x->as_Local() != NULL, "only for Phi and Local"); 1362 // allocate a virtual register for this local or phi 1363 x->set_operand(rlock(x)); 1364 _instruction_for_operand.at_put_grow(x->operand()->vreg_number(), x, NULL); 1365 } 1366 } 1367 return x->operand(); 1368 } 1369 1370 1371 Instruction* LIRGenerator::instruction_for_opr(LIR_Opr opr) { 1372 if (opr->is_virtual()) { 1373 return instruction_for_vreg(opr->vreg_number()); 1374 } 1375 return NULL; 1376 } 1377 1378 1379 Instruction* LIRGenerator::instruction_for_vreg(int reg_num) { 1380 if (reg_num < _instruction_for_operand.length()) { 1381 return _instruction_for_operand.at(reg_num); 1382 } 1383 return NULL; 1384 } 1385 1386 1387 void LIRGenerator::set_vreg_flag(int vreg_num, VregFlag f) { 1388 if (_vreg_flags.size_in_bits() == 0) { 1389 BitMap2D temp(100, num_vreg_flags); 1390 temp.clear(); 1391 _vreg_flags = temp; 1392 } 1393 _vreg_flags.at_put_grow(vreg_num, f, true); 1394 } 1395 1396 bool LIRGenerator::is_vreg_flag_set(int vreg_num, VregFlag f) { 1397 if (!_vreg_flags.is_valid_index(vreg_num, f)) { 1398 return false; 1399 } 1400 return _vreg_flags.at(vreg_num, f); 1401 } 1402 1403 1404 // Block local constant handling. This code is useful for keeping 1405 // unpinned constants and constants which aren't exposed in the IR in 1406 // registers. Unpinned Constant instructions have their operands 1407 // cleared when the block is finished so that other blocks can't end 1408 // up referring to their registers. 1409 1410 LIR_Opr LIRGenerator::load_constant(Constant* x) { 1411 assert(!x->is_pinned(), "only for unpinned constants"); 1412 _unpinned_constants.append(x); 1413 return load_constant(LIR_OprFact::value_type(x->type())->as_constant_ptr()); 1414 } 1415 1416 1417 LIR_Opr LIRGenerator::load_constant(LIR_Const* c) { 1418 BasicType t = c->type(); 1419 for (int i = 0; i < _constants.length(); i++) { 1420 LIR_Const* other = _constants.at(i); 1421 if (t == other->type()) { 1422 switch (t) { 1423 case T_INT: 1424 case T_FLOAT: 1425 if (c->as_jint_bits() != other->as_jint_bits()) continue; 1426 break; 1427 case T_LONG: 1428 case T_DOUBLE: 1429 if (c->as_jint_hi_bits() != other->as_jint_hi_bits()) continue; 1430 if (c->as_jint_lo_bits() != other->as_jint_lo_bits()) continue; 1431 break; 1432 case T_OBJECT: 1433 if (c->as_jobject() != other->as_jobject()) continue; 1434 break; 1435 } 1436 return _reg_for_constants.at(i); 1437 } 1438 } 1439 1440 LIR_Opr result = new_register(t); 1441 __ move((LIR_Opr)c, result); 1442 _constants.append(c); 1443 _reg_for_constants.append(result); 1444 return result; 1445 } 1446 1447 // Various barriers 1448 1449 void LIRGenerator::pre_barrier(LIR_Opr addr_opr, LIR_Opr pre_val, 1450 bool do_load, bool patch, CodeEmitInfo* info) { 1451 // Do the pre-write barrier, if any. 1452 switch (_bs->kind()) { 1453 #if INCLUDE_ALL_GCS 1454 case BarrierSet::G1SATBCTLogging: 1455 G1SATBCardTableModRef_pre_barrier(addr_opr, pre_val, do_load, patch, info); 1456 break; 1457 #endif // INCLUDE_ALL_GCS 1458 case BarrierSet::CardTableForRS: 1459 case BarrierSet::CardTableExtension: 1460 // No pre barriers 1461 break; 1462 case BarrierSet::ModRef: 1463 // No pre barriers 1464 break; 1465 default : 1466 ShouldNotReachHere(); 1467 1468 } 1469 } 1470 1471 void LIRGenerator::post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) { 1472 switch (_bs->kind()) { 1473 #if INCLUDE_ALL_GCS 1474 case BarrierSet::G1SATBCTLogging: 1475 G1SATBCardTableModRef_post_barrier(addr, new_val); 1476 break; 1477 #endif // INCLUDE_ALL_GCS 1478 case BarrierSet::CardTableForRS: 1479 case BarrierSet::CardTableExtension: 1480 CardTableModRef_post_barrier(addr, new_val); 1481 break; 1482 case BarrierSet::ModRef: 1483 // No post barriers 1484 break; 1485 default : 1486 ShouldNotReachHere(); 1487 } 1488 } 1489 1490 //////////////////////////////////////////////////////////////////////// 1491 #if INCLUDE_ALL_GCS 1492 1493 void LIRGenerator::G1SATBCardTableModRef_pre_barrier(LIR_Opr addr_opr, LIR_Opr pre_val, 1494 bool do_load, bool patch, CodeEmitInfo* info) { 1495 // First we test whether marking is in progress. 1496 BasicType flag_type; 1497 if (in_bytes(SATBMarkQueue::byte_width_of_active()) == 4) { 1498 flag_type = T_INT; 1499 } else { 1500 guarantee(in_bytes(SATBMarkQueue::byte_width_of_active()) == 1, 1501 "Assumption"); 1502 // Use unsigned type T_BOOLEAN here rather than signed T_BYTE since some platforms, eg. ARM, 1503 // need to use unsigned instructions to use the large offset to load the satb_mark_queue. 1504 flag_type = T_BOOLEAN; 1505 } 1506 LIR_Opr thrd = getThreadPointer(); 1507 LIR_Address* mark_active_flag_addr = 1508 new LIR_Address(thrd, 1509 in_bytes(JavaThread::satb_mark_queue_offset() + 1510 SATBMarkQueue::byte_offset_of_active()), 1511 flag_type); 1512 // Read the marking-in-progress flag. 1513 LIR_Opr flag_val = new_register(T_INT); 1514 __ load(mark_active_flag_addr, flag_val); 1515 __ cmp(lir_cond_notEqual, flag_val, LIR_OprFact::intConst(0)); 1516 1517 LIR_PatchCode pre_val_patch_code = lir_patch_none; 1518 1519 CodeStub* slow; 1520 1521 if (do_load) { 1522 assert(pre_val == LIR_OprFact::illegalOpr, "sanity"); 1523 assert(addr_opr != LIR_OprFact::illegalOpr, "sanity"); 1524 1525 if (patch) 1526 pre_val_patch_code = lir_patch_normal; 1527 1528 pre_val = new_register(T_OBJECT); 1529 1530 if (!addr_opr->is_address()) { 1531 assert(addr_opr->is_register(), "must be"); 1532 addr_opr = LIR_OprFact::address(new LIR_Address(addr_opr, T_OBJECT)); 1533 } 1534 slow = new G1PreBarrierStub(addr_opr, pre_val, pre_val_patch_code, info); 1535 } else { 1536 assert(addr_opr == LIR_OprFact::illegalOpr, "sanity"); 1537 assert(pre_val->is_register(), "must be"); 1538 assert(pre_val->type() == T_OBJECT, "must be an object"); 1539 assert(info == NULL, "sanity"); 1540 1541 slow = new G1PreBarrierStub(pre_val); 1542 } 1543 1544 __ branch(lir_cond_notEqual, T_INT, slow); 1545 __ branch_destination(slow->continuation()); 1546 } 1547 1548 void LIRGenerator::G1SATBCardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) { 1549 // If the "new_val" is a constant NULL, no barrier is necessary. 1550 if (new_val->is_constant() && 1551 new_val->as_constant_ptr()->as_jobject() == NULL) return; 1552 1553 if (!new_val->is_register()) { 1554 LIR_Opr new_val_reg = new_register(T_OBJECT); 1555 if (new_val->is_constant()) { 1556 __ move(new_val, new_val_reg); 1557 } else { 1558 __ leal(new_val, new_val_reg); 1559 } 1560 new_val = new_val_reg; 1561 } 1562 assert(new_val->is_register(), "must be a register at this point"); 1563 1564 if (addr->is_address()) { 1565 LIR_Address* address = addr->as_address_ptr(); 1566 LIR_Opr ptr = new_pointer_register(); 1567 if (!address->index()->is_valid() && address->disp() == 0) { 1568 __ move(address->base(), ptr); 1569 } else { 1570 assert(address->disp() != max_jint, "lea doesn't support patched addresses!"); 1571 __ leal(addr, ptr); 1572 } 1573 addr = ptr; 1574 } 1575 assert(addr->is_register(), "must be a register at this point"); 1576 1577 LIR_Opr xor_res = new_pointer_register(); 1578 LIR_Opr xor_shift_res = new_pointer_register(); 1579 if (TwoOperandLIRForm ) { 1580 __ move(addr, xor_res); 1581 __ logical_xor(xor_res, new_val, xor_res); 1582 __ move(xor_res, xor_shift_res); 1583 __ unsigned_shift_right(xor_shift_res, 1584 LIR_OprFact::intConst(HeapRegion::LogOfHRGrainBytes), 1585 xor_shift_res, 1586 LIR_OprDesc::illegalOpr()); 1587 } else { 1588 __ logical_xor(addr, new_val, xor_res); 1589 __ unsigned_shift_right(xor_res, 1590 LIR_OprFact::intConst(HeapRegion::LogOfHRGrainBytes), 1591 xor_shift_res, 1592 LIR_OprDesc::illegalOpr()); 1593 } 1594 1595 if (!new_val->is_register()) { 1596 LIR_Opr new_val_reg = new_register(T_OBJECT); 1597 __ leal(new_val, new_val_reg); 1598 new_val = new_val_reg; 1599 } 1600 assert(new_val->is_register(), "must be a register at this point"); 1601 1602 __ cmp(lir_cond_notEqual, xor_shift_res, LIR_OprFact::intptrConst(NULL_WORD)); 1603 1604 CodeStub* slow = new G1PostBarrierStub(addr, new_val); 1605 __ branch(lir_cond_notEqual, LP64_ONLY(T_LONG) NOT_LP64(T_INT), slow); 1606 __ branch_destination(slow->continuation()); 1607 } 1608 1609 #endif // INCLUDE_ALL_GCS 1610 //////////////////////////////////////////////////////////////////////// 1611 1612 void LIRGenerator::CardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) { 1613 CardTableModRefBS* ct = barrier_set_cast<CardTableModRefBS>(_bs); 1614 assert(sizeof(*(ct->byte_map_base)) == sizeof(jbyte), "adjust this code"); 1615 LIR_Const* card_table_base = new LIR_Const(ct->byte_map_base); 1616 if (addr->is_address()) { 1617 LIR_Address* address = addr->as_address_ptr(); 1618 // ptr cannot be an object because we use this barrier for array card marks 1619 // and addr can point in the middle of an array. 1620 LIR_Opr ptr = new_pointer_register(); 1621 if (!address->index()->is_valid() && address->disp() == 0) { 1622 __ move(address->base(), ptr); 1623 } else { 1624 assert(address->disp() != max_jint, "lea doesn't support patched addresses!"); 1625 __ leal(addr, ptr); 1626 } 1627 addr = ptr; 1628 } 1629 assert(addr->is_register(), "must be a register at this point"); 1630 1631 #ifdef CARDTABLEMODREF_POST_BARRIER_HELPER 1632 CardTableModRef_post_barrier_helper(addr, card_table_base); 1633 #else 1634 LIR_Opr tmp = new_pointer_register(); 1635 if (TwoOperandLIRForm) { 1636 __ move(addr, tmp); 1637 __ unsigned_shift_right(tmp, CardTableModRefBS::card_shift, tmp); 1638 } else { 1639 __ unsigned_shift_right(addr, CardTableModRefBS::card_shift, tmp); 1640 } 1641 1642 LIR_Address* card_addr; 1643 if (can_inline_as_constant(card_table_base)) { 1644 card_addr = new LIR_Address(tmp, card_table_base->as_jint(), T_BYTE); 1645 } else { 1646 card_addr = new LIR_Address(tmp, load_constant(card_table_base), T_BYTE); 1647 } 1648 1649 LIR_Opr dirty = LIR_OprFact::intConst(CardTableModRefBS::dirty_card_val()); 1650 if (UseCondCardMark) { 1651 LIR_Opr cur_value = new_register(T_INT); 1652 if (UseConcMarkSweepGC) { 1653 __ membar_storeload(); 1654 } 1655 __ move(card_addr, cur_value); 1656 1657 LabelObj* L_already_dirty = new LabelObj(); 1658 __ cmp(lir_cond_equal, cur_value, dirty); 1659 __ branch(lir_cond_equal, T_BYTE, L_already_dirty->label()); 1660 __ move(dirty, card_addr); 1661 __ branch_destination(L_already_dirty->label()); 1662 } else { 1663 if (UseConcMarkSweepGC && CMSPrecleaningEnabled) { 1664 __ membar_storestore(); 1665 } 1666 __ move(dirty, card_addr); 1667 } 1668 #endif 1669 } 1670 1671 1672 //------------------------field access-------------------------------------- 1673 1674 // Comment copied form templateTable_i486.cpp 1675 // ---------------------------------------------------------------------------- 1676 // Volatile variables demand their effects be made known to all CPU's in 1677 // order. Store buffers on most chips allow reads & writes to reorder; the 1678 // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of 1679 // memory barrier (i.e., it's not sufficient that the interpreter does not 1680 // reorder volatile references, the hardware also must not reorder them). 1681 // 1682 // According to the new Java Memory Model (JMM): 1683 // (1) All volatiles are serialized wrt to each other. 1684 // ALSO reads & writes act as aquire & release, so: 1685 // (2) A read cannot let unrelated NON-volatile memory refs that happen after 1686 // the read float up to before the read. It's OK for non-volatile memory refs 1687 // that happen before the volatile read to float down below it. 1688 // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs 1689 // that happen BEFORE the write float down to after the write. It's OK for 1690 // non-volatile memory refs that happen after the volatile write to float up 1691 // before it. 1692 // 1693 // We only put in barriers around volatile refs (they are expensive), not 1694 // _between_ memory refs (that would require us to track the flavor of the 1695 // previous memory refs). Requirements (2) and (3) require some barriers 1696 // before volatile stores and after volatile loads. These nearly cover 1697 // requirement (1) but miss the volatile-store-volatile-load case. This final 1698 // case is placed after volatile-stores although it could just as well go 1699 // before volatile-loads. 1700 1701 1702 void LIRGenerator::do_StoreField(StoreField* x) { 1703 bool needs_patching = x->needs_patching(); 1704 bool is_volatile = x->field()->is_volatile(); 1705 BasicType field_type = x->field_type(); 1706 bool is_oop = (field_type == T_ARRAY || field_type == T_OBJECT); 1707 1708 CodeEmitInfo* info = NULL; 1709 if (needs_patching) { 1710 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access"); 1711 info = state_for(x, x->state_before()); 1712 } else if (x->needs_null_check()) { 1713 NullCheck* nc = x->explicit_null_check(); 1714 if (nc == NULL) { 1715 info = state_for(x); 1716 } else { 1717 info = state_for(nc); 1718 } 1719 } 1720 1721 1722 LIRItem object(x->obj(), this); 1723 LIRItem value(x->value(), this); 1724 1725 object.load_item(); 1726 1727 if (is_volatile || needs_patching) { 1728 // load item if field is volatile (fewer special cases for volatiles) 1729 // load item if field not initialized 1730 // load item if field not constant 1731 // because of code patching we cannot inline constants 1732 if (field_type == T_BYTE || field_type == T_BOOLEAN) { 1733 value.load_byte_item(); 1734 } else { 1735 value.load_item(); 1736 } 1737 } else { 1738 value.load_for_store(field_type); 1739 } 1740 1741 set_no_result(x); 1742 1743 #ifndef PRODUCT 1744 if (PrintNotLoaded && needs_patching) { 1745 tty->print_cr(" ###class not loaded at store_%s bci %d", 1746 x->is_static() ? "static" : "field", x->printable_bci()); 1747 } 1748 #endif 1749 1750 if (x->needs_null_check() && 1751 (needs_patching || 1752 MacroAssembler::needs_explicit_null_check(x->offset()))) { 1753 // emit an explicit null check because the offset is too large 1754 __ null_check(object.result(), new CodeEmitInfo(info)); 1755 } 1756 1757 LIR_Address* address; 1758 if (needs_patching) { 1759 // we need to patch the offset in the instruction so don't allow 1760 // generate_address to try to be smart about emitting the -1. 1761 // Otherwise the patching code won't know how to find the 1762 // instruction to patch. 1763 address = new LIR_Address(object.result(), PATCHED_ADDR, field_type); 1764 } else { 1765 address = generate_address(object.result(), x->offset(), field_type); 1766 } 1767 1768 if (is_volatile && os::is_MP()) { 1769 __ membar_release(); 1770 } 1771 1772 if (is_oop) { 1773 // Do the pre-write barrier, if any. 1774 pre_barrier(LIR_OprFact::address(address), 1775 LIR_OprFact::illegalOpr /* pre_val */, 1776 true /* do_load*/, 1777 needs_patching, 1778 (info ? new CodeEmitInfo(info) : NULL)); 1779 } 1780 1781 bool needs_atomic_access = is_volatile || AlwaysAtomicAccesses; 1782 if (needs_atomic_access && !needs_patching) { 1783 volatile_field_store(value.result(), address, info); 1784 } else { 1785 LIR_PatchCode patch_code = needs_patching ? lir_patch_normal : lir_patch_none; 1786 __ store(value.result(), address, info, patch_code); 1787 } 1788 1789 if (is_oop) { 1790 // Store to object so mark the card of the header 1791 post_barrier(object.result(), value.result()); 1792 } 1793 1794 if (!support_IRIW_for_not_multiple_copy_atomic_cpu && is_volatile && os::is_MP()) { 1795 __ membar(); 1796 } 1797 } 1798 1799 1800 void LIRGenerator::do_LoadField(LoadField* x) { 1801 bool needs_patching = x->needs_patching(); 1802 bool is_volatile = x->field()->is_volatile(); 1803 BasicType field_type = x->field_type(); 1804 1805 CodeEmitInfo* info = NULL; 1806 if (needs_patching) { 1807 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access"); 1808 info = state_for(x, x->state_before()); 1809 } else if (x->needs_null_check()) { 1810 NullCheck* nc = x->explicit_null_check(); 1811 if (nc == NULL) { 1812 info = state_for(x); 1813 } else { 1814 info = state_for(nc); 1815 } 1816 } 1817 1818 LIRItem object(x->obj(), this); 1819 1820 object.load_item(); 1821 1822 #ifndef PRODUCT 1823 if (PrintNotLoaded && needs_patching) { 1824 tty->print_cr(" ###class not loaded at load_%s bci %d", 1825 x->is_static() ? "static" : "field", x->printable_bci()); 1826 } 1827 #endif 1828 1829 bool stress_deopt = StressLoopInvariantCodeMotion && info && info->deoptimize_on_exception(); 1830 if (x->needs_null_check() && 1831 (needs_patching || 1832 MacroAssembler::needs_explicit_null_check(x->offset()) || 1833 stress_deopt)) { 1834 LIR_Opr obj = object.result(); 1835 if (stress_deopt) { 1836 obj = new_register(T_OBJECT); 1837 __ move(LIR_OprFact::oopConst(NULL), obj); 1838 } 1839 // emit an explicit null check because the offset is too large 1840 __ null_check(obj, new CodeEmitInfo(info)); 1841 } 1842 1843 LIR_Opr reg = rlock_result(x, field_type); 1844 LIR_Address* address; 1845 if (needs_patching) { 1846 // we need to patch the offset in the instruction so don't allow 1847 // generate_address to try to be smart about emitting the -1. 1848 // Otherwise the patching code won't know how to find the 1849 // instruction to patch. 1850 address = new LIR_Address(object.result(), PATCHED_ADDR, field_type); 1851 } else { 1852 address = generate_address(object.result(), x->offset(), field_type); 1853 } 1854 1855 if (support_IRIW_for_not_multiple_copy_atomic_cpu && is_volatile && os::is_MP()) { 1856 __ membar(); 1857 } 1858 1859 bool needs_atomic_access = is_volatile || AlwaysAtomicAccesses; 1860 if (needs_atomic_access && !needs_patching) { 1861 volatile_field_load(address, reg, info); 1862 } else { 1863 LIR_PatchCode patch_code = needs_patching ? lir_patch_normal : lir_patch_none; 1864 __ load(address, reg, info, patch_code); 1865 } 1866 1867 if (is_volatile && os::is_MP()) { 1868 __ membar_acquire(); 1869 } 1870 } 1871 1872 1873 //------------------------java.nio.Buffer.checkIndex------------------------ 1874 1875 // int java.nio.Buffer.checkIndex(int) 1876 void LIRGenerator::do_NIOCheckIndex(Intrinsic* x) { 1877 // NOTE: by the time we are in checkIndex() we are guaranteed that 1878 // the buffer is non-null (because checkIndex is package-private and 1879 // only called from within other methods in the buffer). 1880 assert(x->number_of_arguments() == 2, "wrong type"); 1881 LIRItem buf (x->argument_at(0), this); 1882 LIRItem index(x->argument_at(1), this); 1883 buf.load_item(); 1884 index.load_item(); 1885 1886 LIR_Opr result = rlock_result(x); 1887 if (GenerateRangeChecks) { 1888 CodeEmitInfo* info = state_for(x); 1889 CodeStub* stub = new RangeCheckStub(info, index.result(), true); 1890 if (index.result()->is_constant()) { 1891 cmp_mem_int(lir_cond_belowEqual, buf.result(), java_nio_Buffer::limit_offset(), index.result()->as_jint(), info); 1892 __ branch(lir_cond_belowEqual, T_INT, stub); 1893 } else { 1894 cmp_reg_mem(lir_cond_aboveEqual, index.result(), buf.result(), 1895 java_nio_Buffer::limit_offset(), T_INT, info); 1896 __ branch(lir_cond_aboveEqual, T_INT, stub); 1897 } 1898 __ move(index.result(), result); 1899 } else { 1900 // Just load the index into the result register 1901 __ move(index.result(), result); 1902 } 1903 } 1904 1905 1906 //------------------------array access-------------------------------------- 1907 1908 1909 void LIRGenerator::do_ArrayLength(ArrayLength* x) { 1910 LIRItem array(x->array(), this); 1911 array.load_item(); 1912 LIR_Opr reg = rlock_result(x); 1913 1914 CodeEmitInfo* info = NULL; 1915 if (x->needs_null_check()) { 1916 NullCheck* nc = x->explicit_null_check(); 1917 if (nc == NULL) { 1918 info = state_for(x); 1919 } else { 1920 info = state_for(nc); 1921 } 1922 if (StressLoopInvariantCodeMotion && info->deoptimize_on_exception()) { 1923 LIR_Opr obj = new_register(T_OBJECT); 1924 __ move(LIR_OprFact::oopConst(NULL), obj); 1925 __ null_check(obj, new CodeEmitInfo(info)); 1926 } 1927 } 1928 __ load(new LIR_Address(array.result(), arrayOopDesc::length_offset_in_bytes(), T_INT), reg, info, lir_patch_none); 1929 } 1930 1931 1932 void LIRGenerator::do_LoadIndexed(LoadIndexed* x) { 1933 bool use_length = x->length() != NULL; 1934 LIRItem array(x->array(), this); 1935 LIRItem index(x->index(), this); 1936 LIRItem length(this); 1937 bool needs_range_check = x->compute_needs_range_check(); 1938 1939 if (use_length && needs_range_check) { 1940 length.set_instruction(x->length()); 1941 length.load_item(); 1942 } 1943 1944 array.load_item(); 1945 if (index.is_constant() && can_inline_as_constant(x->index())) { 1946 // let it be a constant 1947 index.dont_load_item(); 1948 } else { 1949 index.load_item(); 1950 } 1951 1952 CodeEmitInfo* range_check_info = state_for(x); 1953 CodeEmitInfo* null_check_info = NULL; 1954 if (x->needs_null_check()) { 1955 NullCheck* nc = x->explicit_null_check(); 1956 if (nc != NULL) { 1957 null_check_info = state_for(nc); 1958 } else { 1959 null_check_info = range_check_info; 1960 } 1961 if (StressLoopInvariantCodeMotion && null_check_info->deoptimize_on_exception()) { 1962 LIR_Opr obj = new_register(T_OBJECT); 1963 __ move(LIR_OprFact::oopConst(NULL), obj); 1964 __ null_check(obj, new CodeEmitInfo(null_check_info)); 1965 } 1966 } 1967 1968 // emit array address setup early so it schedules better 1969 LIR_Address* array_addr = emit_array_address(array.result(), index.result(), x->elt_type(), false); 1970 1971 if (GenerateRangeChecks && needs_range_check) { 1972 if (StressLoopInvariantCodeMotion && range_check_info->deoptimize_on_exception()) { 1973 __ branch(lir_cond_always, T_ILLEGAL, new RangeCheckStub(range_check_info, index.result())); 1974 } else if (use_length) { 1975 // TODO: use a (modified) version of array_range_check that does not require a 1976 // constant length to be loaded to a register 1977 __ cmp(lir_cond_belowEqual, length.result(), index.result()); 1978 __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result())); 1979 } else { 1980 array_range_check(array.result(), index.result(), null_check_info, range_check_info); 1981 // The range check performs the null check, so clear it out for the load 1982 null_check_info = NULL; 1983 } 1984 } 1985 1986 __ move(array_addr, rlock_result(x, x->elt_type()), null_check_info); 1987 } 1988 1989 1990 void LIRGenerator::do_NullCheck(NullCheck* x) { 1991 if (x->can_trap()) { 1992 LIRItem value(x->obj(), this); 1993 value.load_item(); 1994 CodeEmitInfo* info = state_for(x); 1995 __ null_check(value.result(), info); 1996 } 1997 } 1998 1999 2000 void LIRGenerator::do_TypeCast(TypeCast* x) { 2001 LIRItem value(x->obj(), this); 2002 value.load_item(); 2003 // the result is the same as from the node we are casting 2004 set_result(x, value.result()); 2005 } 2006 2007 2008 void LIRGenerator::do_Throw(Throw* x) { 2009 LIRItem exception(x->exception(), this); 2010 exception.load_item(); 2011 set_no_result(x); 2012 LIR_Opr exception_opr = exception.result(); 2013 CodeEmitInfo* info = state_for(x, x->state()); 2014 2015 #ifndef PRODUCT 2016 if (PrintC1Statistics) { 2017 increment_counter(Runtime1::throw_count_address(), T_INT); 2018 } 2019 #endif 2020 2021 // check if the instruction has an xhandler in any of the nested scopes 2022 bool unwind = false; 2023 if (info->exception_handlers()->length() == 0) { 2024 // this throw is not inside an xhandler 2025 unwind = true; 2026 } else { 2027 // get some idea of the throw type 2028 bool type_is_exact = true; 2029 ciType* throw_type = x->exception()->exact_type(); 2030 if (throw_type == NULL) { 2031 type_is_exact = false; 2032 throw_type = x->exception()->declared_type(); 2033 } 2034 if (throw_type != NULL && throw_type->is_instance_klass()) { 2035 ciInstanceKlass* throw_klass = (ciInstanceKlass*)throw_type; 2036 unwind = !x->exception_handlers()->could_catch(throw_klass, type_is_exact); 2037 } 2038 } 2039 2040 // do null check before moving exception oop into fixed register 2041 // to avoid a fixed interval with an oop during the null check. 2042 // Use a copy of the CodeEmitInfo because debug information is 2043 // different for null_check and throw. 2044 if (GenerateCompilerNullChecks && 2045 (x->exception()->as_NewInstance() == NULL && x->exception()->as_ExceptionObject() == NULL)) { 2046 // if the exception object wasn't created using new then it might be null. 2047 __ null_check(exception_opr, new CodeEmitInfo(info, x->state()->copy(ValueStack::ExceptionState, x->state()->bci()))); 2048 } 2049 2050 if (compilation()->env()->jvmti_can_post_on_exceptions()) { 2051 // we need to go through the exception lookup path to get JVMTI 2052 // notification done 2053 unwind = false; 2054 } 2055 2056 // move exception oop into fixed register 2057 __ move(exception_opr, exceptionOopOpr()); 2058 2059 if (unwind) { 2060 __ unwind_exception(exceptionOopOpr()); 2061 } else { 2062 __ throw_exception(exceptionPcOpr(), exceptionOopOpr(), info); 2063 } 2064 } 2065 2066 2067 void LIRGenerator::do_RoundFP(RoundFP* x) { 2068 LIRItem input(x->input(), this); 2069 input.load_item(); 2070 LIR_Opr input_opr = input.result(); 2071 assert(input_opr->is_register(), "why round if value is not in a register?"); 2072 assert(input_opr->is_single_fpu() || input_opr->is_double_fpu(), "input should be floating-point value"); 2073 if (input_opr->is_single_fpu()) { 2074 set_result(x, round_item(input_opr)); // This code path not currently taken 2075 } else { 2076 LIR_Opr result = new_register(T_DOUBLE); 2077 set_vreg_flag(result, must_start_in_memory); 2078 __ roundfp(input_opr, LIR_OprFact::illegalOpr, result); 2079 set_result(x, result); 2080 } 2081 } 2082 2083 // Here UnsafeGetRaw may have x->base() and x->index() be int or long 2084 // on both 64 and 32 bits. Expecting x->base() to be always long on 64bit. 2085 void LIRGenerator::do_UnsafeGetRaw(UnsafeGetRaw* x) { 2086 LIRItem base(x->base(), this); 2087 LIRItem idx(this); 2088 2089 base.load_item(); 2090 if (x->has_index()) { 2091 idx.set_instruction(x->index()); 2092 idx.load_nonconstant(); 2093 } 2094 2095 LIR_Opr reg = rlock_result(x, x->basic_type()); 2096 2097 int log2_scale = 0; 2098 if (x->has_index()) { 2099 log2_scale = x->log2_scale(); 2100 } 2101 2102 assert(!x->has_index() || idx.value() == x->index(), "should match"); 2103 2104 LIR_Opr base_op = base.result(); 2105 LIR_Opr index_op = idx.result(); 2106 #ifndef _LP64 2107 if (base_op->type() == T_LONG) { 2108 base_op = new_register(T_INT); 2109 __ convert(Bytecodes::_l2i, base.result(), base_op); 2110 } 2111 if (x->has_index()) { 2112 if (index_op->type() == T_LONG) { 2113 LIR_Opr long_index_op = index_op; 2114 if (index_op->is_constant()) { 2115 long_index_op = new_register(T_LONG); 2116 __ move(index_op, long_index_op); 2117 } 2118 index_op = new_register(T_INT); 2119 __ convert(Bytecodes::_l2i, long_index_op, index_op); 2120 } else { 2121 assert(x->index()->type()->tag() == intTag, "must be"); 2122 } 2123 } 2124 // At this point base and index should be all ints. 2125 assert(base_op->type() == T_INT && !base_op->is_constant(), "base should be an non-constant int"); 2126 assert(!x->has_index() || index_op->type() == T_INT, "index should be an int"); 2127 #else 2128 if (x->has_index()) { 2129 if (index_op->type() == T_INT) { 2130 if (!index_op->is_constant()) { 2131 index_op = new_register(T_LONG); 2132 __ convert(Bytecodes::_i2l, idx.result(), index_op); 2133 } 2134 } else { 2135 assert(index_op->type() == T_LONG, "must be"); 2136 if (index_op->is_constant()) { 2137 index_op = new_register(T_LONG); 2138 __ move(idx.result(), index_op); 2139 } 2140 } 2141 } 2142 // At this point base is a long non-constant 2143 // Index is a long register or a int constant. 2144 // We allow the constant to stay an int because that would allow us a more compact encoding by 2145 // embedding an immediate offset in the address expression. If we have a long constant, we have to 2146 // move it into a register first. 2147 assert(base_op->type() == T_LONG && !base_op->is_constant(), "base must be a long non-constant"); 2148 assert(!x->has_index() || (index_op->type() == T_INT && index_op->is_constant()) || 2149 (index_op->type() == T_LONG && !index_op->is_constant()), "unexpected index type"); 2150 #endif 2151 2152 BasicType dst_type = x->basic_type(); 2153 2154 LIR_Address* addr; 2155 if (index_op->is_constant()) { 2156 assert(log2_scale == 0, "must not have a scale"); 2157 assert(index_op->type() == T_INT, "only int constants supported"); 2158 addr = new LIR_Address(base_op, index_op->as_jint(), dst_type); 2159 } else { 2160 #ifdef X86 2161 addr = new LIR_Address(base_op, index_op, LIR_Address::Scale(log2_scale), 0, dst_type); 2162 #elif defined(GENERATE_ADDRESS_IS_PREFERRED) 2163 addr = generate_address(base_op, index_op, log2_scale, 0, dst_type); 2164 #else 2165 if (index_op->is_illegal() || log2_scale == 0) { 2166 addr = new LIR_Address(base_op, index_op, dst_type); 2167 } else { 2168 LIR_Opr tmp = new_pointer_register(); 2169 __ shift_left(index_op, log2_scale, tmp); 2170 addr = new LIR_Address(base_op, tmp, dst_type); 2171 } 2172 #endif 2173 } 2174 2175 if (x->may_be_unaligned() && (dst_type == T_LONG || dst_type == T_DOUBLE)) { 2176 __ unaligned_move(addr, reg); 2177 } else { 2178 if (dst_type == T_OBJECT && x->is_wide()) { 2179 __ move_wide(addr, reg); 2180 } else { 2181 __ move(addr, reg); 2182 } 2183 } 2184 } 2185 2186 2187 void LIRGenerator::do_UnsafePutRaw(UnsafePutRaw* x) { 2188 int log2_scale = 0; 2189 BasicType type = x->basic_type(); 2190 2191 if (x->has_index()) { 2192 log2_scale = x->log2_scale(); 2193 } 2194 2195 LIRItem base(x->base(), this); 2196 LIRItem value(x->value(), this); 2197 LIRItem idx(this); 2198 2199 base.load_item(); 2200 if (x->has_index()) { 2201 idx.set_instruction(x->index()); 2202 idx.load_item(); 2203 } 2204 2205 if (type == T_BYTE || type == T_BOOLEAN) { 2206 value.load_byte_item(); 2207 } else { 2208 value.load_item(); 2209 } 2210 2211 set_no_result(x); 2212 2213 LIR_Opr base_op = base.result(); 2214 LIR_Opr index_op = idx.result(); 2215 2216 #ifdef GENERATE_ADDRESS_IS_PREFERRED 2217 LIR_Address* addr = generate_address(base_op, index_op, log2_scale, 0, x->basic_type()); 2218 #else 2219 #ifndef _LP64 2220 if (base_op->type() == T_LONG) { 2221 base_op = new_register(T_INT); 2222 __ convert(Bytecodes::_l2i, base.result(), base_op); 2223 } 2224 if (x->has_index()) { 2225 if (index_op->type() == T_LONG) { 2226 index_op = new_register(T_INT); 2227 __ convert(Bytecodes::_l2i, idx.result(), index_op); 2228 } 2229 } 2230 // At this point base and index should be all ints and not constants 2231 assert(base_op->type() == T_INT && !base_op->is_constant(), "base should be an non-constant int"); 2232 assert(!x->has_index() || (index_op->type() == T_INT && !index_op->is_constant()), "index should be an non-constant int"); 2233 #else 2234 if (x->has_index()) { 2235 if (index_op->type() == T_INT) { 2236 index_op = new_register(T_LONG); 2237 __ convert(Bytecodes::_i2l, idx.result(), index_op); 2238 } 2239 } 2240 // At this point base and index are long and non-constant 2241 assert(base_op->type() == T_LONG && !base_op->is_constant(), "base must be a non-constant long"); 2242 assert(!x->has_index() || (index_op->type() == T_LONG && !index_op->is_constant()), "index must be a non-constant long"); 2243 #endif 2244 2245 if (log2_scale != 0) { 2246 // temporary fix (platform dependent code without shift on Intel would be better) 2247 // TODO: ARM also allows embedded shift in the address 2248 LIR_Opr tmp = new_pointer_register(); 2249 if (TwoOperandLIRForm) { 2250 __ move(index_op, tmp); 2251 index_op = tmp; 2252 } 2253 __ shift_left(index_op, log2_scale, tmp); 2254 if (!TwoOperandLIRForm) { 2255 index_op = tmp; 2256 } 2257 } 2258 2259 LIR_Address* addr = new LIR_Address(base_op, index_op, x->basic_type()); 2260 #endif // !GENERATE_ADDRESS_IS_PREFERRED 2261 __ move(value.result(), addr); 2262 } 2263 2264 2265 void LIRGenerator::do_UnsafeGetObject(UnsafeGetObject* x) { 2266 BasicType type = x->basic_type(); 2267 LIRItem src(x->object(), this); 2268 LIRItem off(x->offset(), this); 2269 2270 off.load_item(); 2271 src.load_item(); 2272 2273 LIR_Opr value = rlock_result(x, x->basic_type()); 2274 2275 if (support_IRIW_for_not_multiple_copy_atomic_cpu && x->is_volatile() && os::is_MP()) { 2276 __ membar(); 2277 } 2278 2279 get_Object_unsafe(value, src.result(), off.result(), type, x->is_volatile()); 2280 2281 #if INCLUDE_ALL_GCS 2282 // We might be reading the value of the referent field of a 2283 // Reference object in order to attach it back to the live 2284 // object graph. If G1 is enabled then we need to record 2285 // the value that is being returned in an SATB log buffer. 2286 // 2287 // We need to generate code similar to the following... 2288 // 2289 // if (offset == java_lang_ref_Reference::referent_offset) { 2290 // if (src != NULL) { 2291 // if (klass(src)->reference_type() != REF_NONE) { 2292 // pre_barrier(..., value, ...); 2293 // } 2294 // } 2295 // } 2296 2297 if (UseG1GC && type == T_OBJECT) { 2298 bool gen_pre_barrier = true; // Assume we need to generate pre_barrier. 2299 bool gen_offset_check = true; // Assume we need to generate the offset guard. 2300 bool gen_source_check = true; // Assume we need to check the src object for null. 2301 bool gen_type_check = true; // Assume we need to check the reference_type. 2302 2303 if (off.is_constant()) { 2304 jlong off_con = (off.type()->is_int() ? 2305 (jlong) off.get_jint_constant() : 2306 off.get_jlong_constant()); 2307 2308 2309 if (off_con != (jlong) java_lang_ref_Reference::referent_offset) { 2310 // The constant offset is something other than referent_offset. 2311 // We can skip generating/checking the remaining guards and 2312 // skip generation of the code stub. 2313 gen_pre_barrier = false; 2314 } else { 2315 // The constant offset is the same as referent_offset - 2316 // we do not need to generate a runtime offset check. 2317 gen_offset_check = false; 2318 } 2319 } 2320 2321 // We don't need to generate stub if the source object is an array 2322 if (gen_pre_barrier && src.type()->is_array()) { 2323 gen_pre_barrier = false; 2324 } 2325 2326 if (gen_pre_barrier) { 2327 // We still need to continue with the checks. 2328 if (src.is_constant()) { 2329 ciObject* src_con = src.get_jobject_constant(); 2330 guarantee(src_con != NULL, "no source constant"); 2331 2332 if (src_con->is_null_object()) { 2333 // The constant src object is null - We can skip 2334 // generating the code stub. 2335 gen_pre_barrier = false; 2336 } else { 2337 // Non-null constant source object. We still have to generate 2338 // the slow stub - but we don't need to generate the runtime 2339 // null object check. 2340 gen_source_check = false; 2341 } 2342 } 2343 } 2344 if (gen_pre_barrier && !PatchALot) { 2345 // Can the klass of object be statically determined to be 2346 // a sub-class of Reference? 2347 ciType* type = src.value()->declared_type(); 2348 if ((type != NULL) && type->is_loaded()) { 2349 if (type->is_subtype_of(compilation()->env()->Reference_klass())) { 2350 gen_type_check = false; 2351 } else if (type->is_klass() && 2352 !compilation()->env()->Object_klass()->is_subtype_of(type->as_klass())) { 2353 // Not Reference and not Object klass. 2354 gen_pre_barrier = false; 2355 } 2356 } 2357 } 2358 2359 if (gen_pre_barrier) { 2360 LabelObj* Lcont = new LabelObj(); 2361 2362 // We can have generate one runtime check here. Let's start with 2363 // the offset check. 2364 if (gen_offset_check) { 2365 // if (offset != referent_offset) -> continue 2366 // If offset is an int then we can do the comparison with the 2367 // referent_offset constant; otherwise we need to move 2368 // referent_offset into a temporary register and generate 2369 // a reg-reg compare. 2370 2371 LIR_Opr referent_off; 2372 2373 if (off.type()->is_int()) { 2374 referent_off = LIR_OprFact::intConst(java_lang_ref_Reference::referent_offset); 2375 } else { 2376 assert(off.type()->is_long(), "what else?"); 2377 referent_off = new_register(T_LONG); 2378 __ move(LIR_OprFact::longConst(java_lang_ref_Reference::referent_offset), referent_off); 2379 } 2380 __ cmp(lir_cond_notEqual, off.result(), referent_off); 2381 __ branch(lir_cond_notEqual, as_BasicType(off.type()), Lcont->label()); 2382 } 2383 if (gen_source_check) { 2384 // offset is a const and equals referent offset 2385 // if (source == null) -> continue 2386 __ cmp(lir_cond_equal, src.result(), LIR_OprFact::oopConst(NULL)); 2387 __ branch(lir_cond_equal, T_OBJECT, Lcont->label()); 2388 } 2389 LIR_Opr src_klass = new_register(T_OBJECT); 2390 if (gen_type_check) { 2391 // We have determined that offset == referent_offset && src != null. 2392 // if (src->_klass->_reference_type == REF_NONE) -> continue 2393 __ move(new LIR_Address(src.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), src_klass); 2394 LIR_Address* reference_type_addr = new LIR_Address(src_klass, in_bytes(InstanceKlass::reference_type_offset()), T_BYTE); 2395 LIR_Opr reference_type = new_register(T_INT); 2396 __ move(reference_type_addr, reference_type); 2397 __ cmp(lir_cond_equal, reference_type, LIR_OprFact::intConst(REF_NONE)); 2398 __ branch(lir_cond_equal, T_INT, Lcont->label()); 2399 } 2400 { 2401 // We have determined that src->_klass->_reference_type != REF_NONE 2402 // so register the value in the referent field with the pre-barrier. 2403 pre_barrier(LIR_OprFact::illegalOpr /* addr_opr */, 2404 value /* pre_val */, 2405 false /* do_load */, 2406 false /* patch */, 2407 NULL /* info */); 2408 } 2409 __ branch_destination(Lcont->label()); 2410 } 2411 } 2412 #endif // INCLUDE_ALL_GCS 2413 2414 if (x->is_volatile() && os::is_MP()) __ membar_acquire(); 2415 } 2416 2417 2418 void LIRGenerator::do_UnsafePutObject(UnsafePutObject* x) { 2419 BasicType type = x->basic_type(); 2420 LIRItem src(x->object(), this); 2421 LIRItem off(x->offset(), this); 2422 LIRItem data(x->value(), this); 2423 2424 src.load_item(); 2425 if (type == T_BOOLEAN || type == T_BYTE) { 2426 data.load_byte_item(); 2427 } else { 2428 data.load_item(); 2429 } 2430 off.load_item(); 2431 2432 set_no_result(x); 2433 2434 if (x->is_volatile() && os::is_MP()) __ membar_release(); 2435 put_Object_unsafe(src.result(), off.result(), data.result(), type, x->is_volatile()); 2436 if (!support_IRIW_for_not_multiple_copy_atomic_cpu && x->is_volatile() && os::is_MP()) __ membar(); 2437 } 2438 2439 2440 void LIRGenerator::do_SwitchRanges(SwitchRangeArray* x, LIR_Opr value, BlockBegin* default_sux) { 2441 int lng = x->length(); 2442 2443 for (int i = 0; i < lng; i++) { 2444 SwitchRange* one_range = x->at(i); 2445 int low_key = one_range->low_key(); 2446 int high_key = one_range->high_key(); 2447 BlockBegin* dest = one_range->sux(); 2448 if (low_key == high_key) { 2449 __ cmp(lir_cond_equal, value, low_key); 2450 __ branch(lir_cond_equal, T_INT, dest); 2451 } else if (high_key - low_key == 1) { 2452 __ cmp(lir_cond_equal, value, low_key); 2453 __ branch(lir_cond_equal, T_INT, dest); 2454 __ cmp(lir_cond_equal, value, high_key); 2455 __ branch(lir_cond_equal, T_INT, dest); 2456 } else { 2457 LabelObj* L = new LabelObj(); 2458 __ cmp(lir_cond_less, value, low_key); 2459 __ branch(lir_cond_less, T_INT, L->label()); 2460 __ cmp(lir_cond_lessEqual, value, high_key); 2461 __ branch(lir_cond_lessEqual, T_INT, dest); 2462 __ branch_destination(L->label()); 2463 } 2464 } 2465 __ jump(default_sux); 2466 } 2467 2468 2469 SwitchRangeArray* LIRGenerator::create_lookup_ranges(TableSwitch* x) { 2470 SwitchRangeList* res = new SwitchRangeList(); 2471 int len = x->length(); 2472 if (len > 0) { 2473 BlockBegin* sux = x->sux_at(0); 2474 int key = x->lo_key(); 2475 BlockBegin* default_sux = x->default_sux(); 2476 SwitchRange* range = new SwitchRange(key, sux); 2477 for (int i = 0; i < len; i++, key++) { 2478 BlockBegin* new_sux = x->sux_at(i); 2479 if (sux == new_sux) { 2480 // still in same range 2481 range->set_high_key(key); 2482 } else { 2483 // skip tests which explicitly dispatch to the default 2484 if (sux != default_sux) { 2485 res->append(range); 2486 } 2487 range = new SwitchRange(key, new_sux); 2488 } 2489 sux = new_sux; 2490 } 2491 if (res->length() == 0 || res->last() != range) res->append(range); 2492 } 2493 return res; 2494 } 2495 2496 2497 // we expect the keys to be sorted by increasing value 2498 SwitchRangeArray* LIRGenerator::create_lookup_ranges(LookupSwitch* x) { 2499 SwitchRangeList* res = new SwitchRangeList(); 2500 int len = x->length(); 2501 if (len > 0) { 2502 BlockBegin* default_sux = x->default_sux(); 2503 int key = x->key_at(0); 2504 BlockBegin* sux = x->sux_at(0); 2505 SwitchRange* range = new SwitchRange(key, sux); 2506 for (int i = 1; i < len; i++) { 2507 int new_key = x->key_at(i); 2508 BlockBegin* new_sux = x->sux_at(i); 2509 if (key+1 == new_key && sux == new_sux) { 2510 // still in same range 2511 range->set_high_key(new_key); 2512 } else { 2513 // skip tests which explicitly dispatch to the default 2514 if (range->sux() != default_sux) { 2515 res->append(range); 2516 } 2517 range = new SwitchRange(new_key, new_sux); 2518 } 2519 key = new_key; 2520 sux = new_sux; 2521 } 2522 if (res->length() == 0 || res->last() != range) res->append(range); 2523 } 2524 return res; 2525 } 2526 2527 2528 void LIRGenerator::do_TableSwitch(TableSwitch* x) { 2529 LIRItem tag(x->tag(), this); 2530 tag.load_item(); 2531 set_no_result(x); 2532 2533 if (x->is_safepoint()) { 2534 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before())); 2535 } 2536 2537 // move values into phi locations 2538 move_to_phi(x->state()); 2539 2540 int lo_key = x->lo_key(); 2541 int hi_key = x->hi_key(); 2542 int len = x->length(); 2543 LIR_Opr value = tag.result(); 2544 if (UseTableRanges) { 2545 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux()); 2546 } else { 2547 for (int i = 0; i < len; i++) { 2548 __ cmp(lir_cond_equal, value, i + lo_key); 2549 __ branch(lir_cond_equal, T_INT, x->sux_at(i)); 2550 } 2551 __ jump(x->default_sux()); 2552 } 2553 } 2554 2555 2556 void LIRGenerator::do_LookupSwitch(LookupSwitch* x) { 2557 LIRItem tag(x->tag(), this); 2558 tag.load_item(); 2559 set_no_result(x); 2560 2561 if (x->is_safepoint()) { 2562 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before())); 2563 } 2564 2565 // move values into phi locations 2566 move_to_phi(x->state()); 2567 2568 LIR_Opr value = tag.result(); 2569 if (UseTableRanges) { 2570 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux()); 2571 } else { 2572 int len = x->length(); 2573 for (int i = 0; i < len; i++) { 2574 __ cmp(lir_cond_equal, value, x->key_at(i)); 2575 __ branch(lir_cond_equal, T_INT, x->sux_at(i)); 2576 } 2577 __ jump(x->default_sux()); 2578 } 2579 } 2580 2581 2582 void LIRGenerator::do_Goto(Goto* x) { 2583 set_no_result(x); 2584 2585 if (block()->next()->as_OsrEntry()) { 2586 // need to free up storage used for OSR entry point 2587 LIR_Opr osrBuffer = block()->next()->operand(); 2588 BasicTypeList signature; 2589 signature.append(NOT_LP64(T_INT) LP64_ONLY(T_LONG)); // pass a pointer to osrBuffer 2590 CallingConvention* cc = frame_map()->c_calling_convention(&signature); 2591 __ move(osrBuffer, cc->args()->at(0)); 2592 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end), 2593 getThreadTemp(), LIR_OprFact::illegalOpr, cc->args()); 2594 } 2595 2596 if (x->is_safepoint()) { 2597 ValueStack* state = x->state_before() ? x->state_before() : x->state(); 2598 2599 // increment backedge counter if needed 2600 CodeEmitInfo* info = state_for(x, state); 2601 increment_backedge_counter(info, x->profiled_bci()); 2602 CodeEmitInfo* safepoint_info = state_for(x, state); 2603 __ safepoint(safepoint_poll_register(), safepoint_info); 2604 } 2605 2606 // Gotos can be folded Ifs, handle this case. 2607 if (x->should_profile()) { 2608 ciMethod* method = x->profiled_method(); 2609 assert(method != NULL, "method should be set if branch is profiled"); 2610 ciMethodData* md = method->method_data_or_null(); 2611 assert(md != NULL, "Sanity"); 2612 ciProfileData* data = md->bci_to_data(x->profiled_bci()); 2613 assert(data != NULL, "must have profiling data"); 2614 int offset; 2615 if (x->direction() == Goto::taken) { 2616 assert(data->is_BranchData(), "need BranchData for two-way branches"); 2617 offset = md->byte_offset_of_slot(data, BranchData::taken_offset()); 2618 } else if (x->direction() == Goto::not_taken) { 2619 assert(data->is_BranchData(), "need BranchData for two-way branches"); 2620 offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset()); 2621 } else { 2622 assert(data->is_JumpData(), "need JumpData for branches"); 2623 offset = md->byte_offset_of_slot(data, JumpData::taken_offset()); 2624 } 2625 LIR_Opr md_reg = new_register(T_METADATA); 2626 __ metadata2reg(md->constant_encoding(), md_reg); 2627 2628 increment_counter(new LIR_Address(md_reg, offset, 2629 NOT_LP64(T_INT) LP64_ONLY(T_LONG)), DataLayout::counter_increment); 2630 } 2631 2632 // emit phi-instruction move after safepoint since this simplifies 2633 // describing the state as the safepoint. 2634 move_to_phi(x->state()); 2635 2636 __ jump(x->default_sux()); 2637 } 2638 2639 /** 2640 * Emit profiling code if needed for arguments, parameters, return value types 2641 * 2642 * @param md MDO the code will update at runtime 2643 * @param md_base_offset common offset in the MDO for this profile and subsequent ones 2644 * @param md_offset offset in the MDO (on top of md_base_offset) for this profile 2645 * @param profiled_k current profile 2646 * @param obj IR node for the object to be profiled 2647 * @param mdp register to hold the pointer inside the MDO (md + md_base_offset). 2648 * Set once we find an update to make and use for next ones. 2649 * @param not_null true if we know obj cannot be null 2650 * @param signature_at_call_k signature at call for obj 2651 * @param callee_signature_k signature of callee for obj 2652 * at call and callee signatures differ at method handle call 2653 * @return the only klass we know will ever be seen at this profile point 2654 */ 2655 ciKlass* LIRGenerator::profile_type(ciMethodData* md, int md_base_offset, int md_offset, intptr_t profiled_k, 2656 Value obj, LIR_Opr& mdp, bool not_null, ciKlass* signature_at_call_k, 2657 ciKlass* callee_signature_k) { 2658 ciKlass* result = NULL; 2659 bool do_null = !not_null && !TypeEntries::was_null_seen(profiled_k); 2660 bool do_update = !TypeEntries::is_type_unknown(profiled_k); 2661 // known not to be null or null bit already set and already set to 2662 // unknown: nothing we can do to improve profiling 2663 if (!do_null && !do_update) { 2664 return result; 2665 } 2666 2667 ciKlass* exact_klass = NULL; 2668 Compilation* comp = Compilation::current(); 2669 if (do_update) { 2670 // try to find exact type, using CHA if possible, so that loading 2671 // the klass from the object can be avoided 2672 ciType* type = obj->exact_type(); 2673 if (type == NULL) { 2674 type = obj->declared_type(); 2675 type = comp->cha_exact_type(type); 2676 } 2677 assert(type == NULL || type->is_klass(), "type should be class"); 2678 exact_klass = (type != NULL && type->is_loaded()) ? (ciKlass*)type : NULL; 2679 2680 do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass; 2681 } 2682 2683 if (!do_null && !do_update) { 2684 return result; 2685 } 2686 2687 ciKlass* exact_signature_k = NULL; 2688 if (do_update) { 2689 // Is the type from the signature exact (the only one possible)? 2690 exact_signature_k = signature_at_call_k->exact_klass(); 2691 if (exact_signature_k == NULL) { 2692 exact_signature_k = comp->cha_exact_type(signature_at_call_k); 2693 } else { 2694 result = exact_signature_k; 2695 // Known statically. No need to emit any code: prevent 2696 // LIR_Assembler::emit_profile_type() from emitting useless code 2697 profiled_k = ciTypeEntries::with_status(result, profiled_k); 2698 } 2699 // exact_klass and exact_signature_k can be both non NULL but 2700 // different if exact_klass is loaded after the ciObject for 2701 // exact_signature_k is created. 2702 if (exact_klass == NULL && exact_signature_k != NULL && exact_klass != exact_signature_k) { 2703 // sometimes the type of the signature is better than the best type 2704 // the compiler has 2705 exact_klass = exact_signature_k; 2706 } 2707 if (callee_signature_k != NULL && 2708 callee_signature_k != signature_at_call_k) { 2709 ciKlass* improved_klass = callee_signature_k->exact_klass(); 2710 if (improved_klass == NULL) { 2711 improved_klass = comp->cha_exact_type(callee_signature_k); 2712 } 2713 if (exact_klass == NULL && improved_klass != NULL && exact_klass != improved_klass) { 2714 exact_klass = exact_signature_k; 2715 } 2716 } 2717 do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass; 2718 } 2719 2720 if (!do_null && !do_update) { 2721 return result; 2722 } 2723 2724 if (mdp == LIR_OprFact::illegalOpr) { 2725 mdp = new_register(T_METADATA); 2726 __ metadata2reg(md->constant_encoding(), mdp); 2727 if (md_base_offset != 0) { 2728 LIR_Address* base_type_address = new LIR_Address(mdp, md_base_offset, T_ADDRESS); 2729 mdp = new_pointer_register(); 2730 __ leal(LIR_OprFact::address(base_type_address), mdp); 2731 } 2732 } 2733 LIRItem value(obj, this); 2734 value.load_item(); 2735 __ profile_type(new LIR_Address(mdp, md_offset, T_METADATA), 2736 value.result(), exact_klass, profiled_k, new_pointer_register(), not_null, exact_signature_k != NULL); 2737 return result; 2738 } 2739 2740 // profile parameters on entry to the root of the compilation 2741 void LIRGenerator::profile_parameters(Base* x) { 2742 if (compilation()->profile_parameters()) { 2743 CallingConvention* args = compilation()->frame_map()->incoming_arguments(); 2744 ciMethodData* md = scope()->method()->method_data_or_null(); 2745 assert(md != NULL, "Sanity"); 2746 2747 if (md->parameters_type_data() != NULL) { 2748 ciParametersTypeData* parameters_type_data = md->parameters_type_data(); 2749 ciTypeStackSlotEntries* parameters = parameters_type_data->parameters(); 2750 LIR_Opr mdp = LIR_OprFact::illegalOpr; 2751 for (int java_index = 0, i = 0, j = 0; j < parameters_type_data->number_of_parameters(); i++) { 2752 LIR_Opr src = args->at(i); 2753 assert(!src->is_illegal(), "check"); 2754 BasicType t = src->type(); 2755 if (t == T_OBJECT || t == T_ARRAY) { 2756 intptr_t profiled_k = parameters->type(j); 2757 Local* local = x->state()->local_at(java_index)->as_Local(); 2758 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)), 2759 in_bytes(ParametersTypeData::type_offset(j)) - in_bytes(ParametersTypeData::type_offset(0)), 2760 profiled_k, local, mdp, false, local->declared_type()->as_klass(), NULL); 2761 // If the profile is known statically set it once for all and do not emit any code 2762 if (exact != NULL) { 2763 md->set_parameter_type(j, exact); 2764 } 2765 j++; 2766 } 2767 java_index += type2size[t]; 2768 } 2769 } 2770 } 2771 } 2772 2773 void LIRGenerator::do_Base(Base* x) { 2774 __ std_entry(LIR_OprFact::illegalOpr); 2775 // Emit moves from physical registers / stack slots to virtual registers 2776 CallingConvention* args = compilation()->frame_map()->incoming_arguments(); 2777 IRScope* irScope = compilation()->hir()->top_scope(); 2778 int java_index = 0; 2779 for (int i = 0; i < args->length(); i++) { 2780 LIR_Opr src = args->at(i); 2781 assert(!src->is_illegal(), "check"); 2782 BasicType t = src->type(); 2783 2784 // Types which are smaller than int are passed as int, so 2785 // correct the type which passed. 2786 switch (t) { 2787 case T_BYTE: 2788 case T_BOOLEAN: 2789 case T_SHORT: 2790 case T_CHAR: 2791 t = T_INT; 2792 break; 2793 } 2794 2795 LIR_Opr dest = new_register(t); 2796 __ move(src, dest); 2797 2798 // Assign new location to Local instruction for this local 2799 Local* local = x->state()->local_at(java_index)->as_Local(); 2800 assert(local != NULL, "Locals for incoming arguments must have been created"); 2801 #ifndef __SOFTFP__ 2802 // The java calling convention passes double as long and float as int. 2803 assert(as_ValueType(t)->tag() == local->type()->tag(), "check"); 2804 #endif // __SOFTFP__ 2805 local->set_operand(dest); 2806 _instruction_for_operand.at_put_grow(dest->vreg_number(), local, NULL); 2807 java_index += type2size[t]; 2808 } 2809 2810 if (compilation()->env()->dtrace_method_probes()) { 2811 BasicTypeList signature; 2812 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread 2813 signature.append(T_METADATA); // Method* 2814 LIR_OprList* args = new LIR_OprList(); 2815 args->append(getThreadPointer()); 2816 LIR_Opr meth = new_register(T_METADATA); 2817 __ metadata2reg(method()->constant_encoding(), meth); 2818 args->append(meth); 2819 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), voidType, NULL); 2820 } 2821 2822 if (method()->is_synchronized()) { 2823 LIR_Opr obj; 2824 if (method()->is_static()) { 2825 obj = new_register(T_OBJECT); 2826 __ oop2reg(method()->holder()->java_mirror()->constant_encoding(), obj); 2827 } else { 2828 Local* receiver = x->state()->local_at(0)->as_Local(); 2829 assert(receiver != NULL, "must already exist"); 2830 obj = receiver->operand(); 2831 } 2832 assert(obj->is_valid(), "must be valid"); 2833 2834 if (method()->is_synchronized() && GenerateSynchronizationCode) { 2835 LIR_Opr lock = syncLockOpr(); 2836 __ load_stack_address_monitor(0, lock); 2837 2838 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, x->check_flag(Instruction::DeoptimizeOnException)); 2839 CodeStub* slow_path = new MonitorEnterStub(obj, lock, info); 2840 2841 // receiver is guaranteed non-NULL so don't need CodeEmitInfo 2842 __ lock_object(syncTempOpr(), obj, lock, new_register(T_OBJECT), slow_path, NULL); 2843 } 2844 } 2845 if (compilation()->age_code()) { 2846 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, 0), NULL, false); 2847 decrement_age(info); 2848 } 2849 // increment invocation counters if needed 2850 if (!method()->is_accessor()) { // Accessors do not have MDOs, so no counting. 2851 profile_parameters(x); 2852 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, false); 2853 increment_invocation_counter(info); 2854 } 2855 2856 // all blocks with a successor must end with an unconditional jump 2857 // to the successor even if they are consecutive 2858 __ jump(x->default_sux()); 2859 } 2860 2861 2862 void LIRGenerator::do_OsrEntry(OsrEntry* x) { 2863 // construct our frame and model the production of incoming pointer 2864 // to the OSR buffer. 2865 __ osr_entry(LIR_Assembler::osrBufferPointer()); 2866 LIR_Opr result = rlock_result(x); 2867 __ move(LIR_Assembler::osrBufferPointer(), result); 2868 } 2869 2870 2871 void LIRGenerator::invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list) { 2872 assert(args->length() == arg_list->length(), 2873 "args=%d, arg_list=%d", args->length(), arg_list->length()); 2874 for (int i = x->has_receiver() ? 1 : 0; i < args->length(); i++) { 2875 LIRItem* param = args->at(i); 2876 LIR_Opr loc = arg_list->at(i); 2877 if (loc->is_register()) { 2878 param->load_item_force(loc); 2879 } else { 2880 LIR_Address* addr = loc->as_address_ptr(); 2881 param->load_for_store(addr->type()); 2882 if (addr->type() == T_OBJECT) { 2883 __ move_wide(param->result(), addr); 2884 } else 2885 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) { 2886 __ unaligned_move(param->result(), addr); 2887 } else { 2888 __ move(param->result(), addr); 2889 } 2890 } 2891 } 2892 2893 if (x->has_receiver()) { 2894 LIRItem* receiver = args->at(0); 2895 LIR_Opr loc = arg_list->at(0); 2896 if (loc->is_register()) { 2897 receiver->load_item_force(loc); 2898 } else { 2899 assert(loc->is_address(), "just checking"); 2900 receiver->load_for_store(T_OBJECT); 2901 __ move_wide(receiver->result(), loc->as_address_ptr()); 2902 } 2903 } 2904 } 2905 2906 2907 // Visits all arguments, returns appropriate items without loading them 2908 LIRItemList* LIRGenerator::invoke_visit_arguments(Invoke* x) { 2909 LIRItemList* argument_items = new LIRItemList(); 2910 if (x->has_receiver()) { 2911 LIRItem* receiver = new LIRItem(x->receiver(), this); 2912 argument_items->append(receiver); 2913 } 2914 for (int i = 0; i < x->number_of_arguments(); i++) { 2915 LIRItem* param = new LIRItem(x->argument_at(i), this); 2916 argument_items->append(param); 2917 } 2918 return argument_items; 2919 } 2920 2921 2922 // The invoke with receiver has following phases: 2923 // a) traverse and load/lock receiver; 2924 // b) traverse all arguments -> item-array (invoke_visit_argument) 2925 // c) push receiver on stack 2926 // d) load each of the items and push on stack 2927 // e) unlock receiver 2928 // f) move receiver into receiver-register %o0 2929 // g) lock result registers and emit call operation 2930 // 2931 // Before issuing a call, we must spill-save all values on stack 2932 // that are in caller-save register. "spill-save" moves those registers 2933 // either in a free callee-save register or spills them if no free 2934 // callee save register is available. 2935 // 2936 // The problem is where to invoke spill-save. 2937 // - if invoked between e) and f), we may lock callee save 2938 // register in "spill-save" that destroys the receiver register 2939 // before f) is executed 2940 // - if we rearrange f) to be earlier (by loading %o0) it 2941 // may destroy a value on the stack that is currently in %o0 2942 // and is waiting to be spilled 2943 // - if we keep the receiver locked while doing spill-save, 2944 // we cannot spill it as it is spill-locked 2945 // 2946 void LIRGenerator::do_Invoke(Invoke* x) { 2947 CallingConvention* cc = frame_map()->java_calling_convention(x->signature(), true); 2948 2949 LIR_OprList* arg_list = cc->args(); 2950 LIRItemList* args = invoke_visit_arguments(x); 2951 LIR_Opr receiver = LIR_OprFact::illegalOpr; 2952 2953 // setup result register 2954 LIR_Opr result_register = LIR_OprFact::illegalOpr; 2955 if (x->type() != voidType) { 2956 result_register = result_register_for(x->type()); 2957 } 2958 2959 CodeEmitInfo* info = state_for(x, x->state()); 2960 2961 invoke_load_arguments(x, args, arg_list); 2962 2963 if (x->has_receiver()) { 2964 args->at(0)->load_item_force(LIR_Assembler::receiverOpr()); 2965 receiver = args->at(0)->result(); 2966 } 2967 2968 // emit invoke code 2969 bool optimized = x->target_is_loaded() && x->target_is_final(); 2970 assert(receiver->is_illegal() || receiver->is_equal(LIR_Assembler::receiverOpr()), "must match"); 2971 2972 // JSR 292 2973 // Preserve the SP over MethodHandle call sites, if needed. 2974 ciMethod* target = x->target(); 2975 bool is_method_handle_invoke = (// %%% FIXME: Are both of these relevant? 2976 target->is_method_handle_intrinsic() || 2977 target->is_compiled_lambda_form()); 2978 if (is_method_handle_invoke) { 2979 info->set_is_method_handle_invoke(true); 2980 if(FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr) { 2981 __ move(FrameMap::stack_pointer(), FrameMap::method_handle_invoke_SP_save_opr()); 2982 } 2983 } 2984 2985 switch (x->code()) { 2986 case Bytecodes::_invokestatic: 2987 __ call_static(target, result_register, 2988 SharedRuntime::get_resolve_static_call_stub(), 2989 arg_list, info); 2990 break; 2991 case Bytecodes::_invokespecial: 2992 case Bytecodes::_invokevirtual: 2993 case Bytecodes::_invokeinterface: 2994 // for final target we still produce an inline cache, in order 2995 // to be able to call mixed mode 2996 if (x->code() == Bytecodes::_invokespecial || optimized) { 2997 __ call_opt_virtual(target, receiver, result_register, 2998 SharedRuntime::get_resolve_opt_virtual_call_stub(), 2999 arg_list, info); 3000 } else if (x->vtable_index() < 0) { 3001 __ call_icvirtual(target, receiver, result_register, 3002 SharedRuntime::get_resolve_virtual_call_stub(), 3003 arg_list, info); 3004 } else { 3005 int entry_offset = in_bytes(Klass::vtable_start_offset()) + x->vtable_index() * vtableEntry::size_in_bytes(); 3006 int vtable_offset = entry_offset + vtableEntry::method_offset_in_bytes(); 3007 __ call_virtual(target, receiver, result_register, vtable_offset, arg_list, info); 3008 } 3009 break; 3010 case Bytecodes::_invokedynamic: { 3011 __ call_dynamic(target, receiver, result_register, 3012 SharedRuntime::get_resolve_static_call_stub(), 3013 arg_list, info); 3014 break; 3015 } 3016 default: 3017 fatal("unexpected bytecode: %s", Bytecodes::name(x->code())); 3018 break; 3019 } 3020 3021 // JSR 292 3022 // Restore the SP after MethodHandle call sites, if needed. 3023 if (is_method_handle_invoke 3024 && FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr) { 3025 __ move(FrameMap::method_handle_invoke_SP_save_opr(), FrameMap::stack_pointer()); 3026 } 3027 3028 if (x->type()->is_float() || x->type()->is_double()) { 3029 // Force rounding of results from non-strictfp when in strictfp 3030 // scope (or when we don't know the strictness of the callee, to 3031 // be safe.) 3032 if (method()->is_strict()) { 3033 if (!x->target_is_loaded() || !x->target_is_strictfp()) { 3034 result_register = round_item(result_register); 3035 } 3036 } 3037 } 3038 3039 if (result_register->is_valid()) { 3040 LIR_Opr result = rlock_result(x); 3041 __ move(result_register, result); 3042 } 3043 } 3044 3045 3046 void LIRGenerator::do_FPIntrinsics(Intrinsic* x) { 3047 assert(x->number_of_arguments() == 1, "wrong type"); 3048 LIRItem value (x->argument_at(0), this); 3049 LIR_Opr reg = rlock_result(x); 3050 value.load_item(); 3051 LIR_Opr tmp = force_to_spill(value.result(), as_BasicType(x->type())); 3052 __ move(tmp, reg); 3053 } 3054 3055 3056 3057 // Code for : x->x() {x->cond()} x->y() ? x->tval() : x->fval() 3058 void LIRGenerator::do_IfOp(IfOp* x) { 3059 #ifdef ASSERT 3060 { 3061 ValueTag xtag = x->x()->type()->tag(); 3062 ValueTag ttag = x->tval()->type()->tag(); 3063 assert(xtag == intTag || xtag == objectTag, "cannot handle others"); 3064 assert(ttag == addressTag || ttag == intTag || ttag == objectTag || ttag == longTag, "cannot handle others"); 3065 assert(ttag == x->fval()->type()->tag(), "cannot handle others"); 3066 } 3067 #endif 3068 3069 LIRItem left(x->x(), this); 3070 LIRItem right(x->y(), this); 3071 left.load_item(); 3072 if (can_inline_as_constant(right.value())) { 3073 right.dont_load_item(); 3074 } else { 3075 right.load_item(); 3076 } 3077 3078 LIRItem t_val(x->tval(), this); 3079 LIRItem f_val(x->fval(), this); 3080 t_val.dont_load_item(); 3081 f_val.dont_load_item(); 3082 LIR_Opr reg = rlock_result(x); 3083 3084 __ cmp(lir_cond(x->cond()), left.result(), right.result()); 3085 __ cmove(lir_cond(x->cond()), t_val.result(), f_val.result(), reg, as_BasicType(x->x()->type())); 3086 } 3087 3088 void LIRGenerator::do_RuntimeCall(address routine, Intrinsic* x) { 3089 assert(x->number_of_arguments() == 0, "wrong type"); 3090 // Enforce computation of _reserved_argument_area_size which is required on some platforms. 3091 BasicTypeList signature; 3092 CallingConvention* cc = frame_map()->c_calling_convention(&signature); 3093 LIR_Opr reg = result_register_for(x->type()); 3094 __ call_runtime_leaf(routine, getThreadTemp(), 3095 reg, new LIR_OprList()); 3096 LIR_Opr result = rlock_result(x); 3097 __ move(reg, result); 3098 } 3099 3100 3101 3102 void LIRGenerator::do_Intrinsic(Intrinsic* x) { 3103 switch (x->id()) { 3104 case vmIntrinsics::_intBitsToFloat : 3105 case vmIntrinsics::_doubleToRawLongBits : 3106 case vmIntrinsics::_longBitsToDouble : 3107 case vmIntrinsics::_floatToRawIntBits : { 3108 do_FPIntrinsics(x); 3109 break; 3110 } 3111 3112 #ifdef TRACE_HAVE_INTRINSICS 3113 case vmIntrinsics::_counterTime: 3114 do_RuntimeCall(CAST_FROM_FN_PTR(address, TRACE_TIME_METHOD), x); 3115 break; 3116 #endif 3117 3118 case vmIntrinsics::_currentTimeMillis: 3119 do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeMillis), x); 3120 break; 3121 3122 case vmIntrinsics::_nanoTime: 3123 do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeNanos), x); 3124 break; 3125 3126 case vmIntrinsics::_Object_init: do_RegisterFinalizer(x); break; 3127 case vmIntrinsics::_isInstance: do_isInstance(x); break; 3128 case vmIntrinsics::_isPrimitive: do_isPrimitive(x); break; 3129 case vmIntrinsics::_getClass: do_getClass(x); break; 3130 case vmIntrinsics::_currentThread: do_currentThread(x); break; 3131 3132 case vmIntrinsics::_dlog: // fall through 3133 case vmIntrinsics::_dlog10: // fall through 3134 case vmIntrinsics::_dabs: // fall through 3135 case vmIntrinsics::_dsqrt: // fall through 3136 case vmIntrinsics::_dtan: // fall through 3137 case vmIntrinsics::_dsin : // fall through 3138 case vmIntrinsics::_dcos : // fall through 3139 case vmIntrinsics::_dexp : // fall through 3140 case vmIntrinsics::_dpow : do_MathIntrinsic(x); break; 3141 case vmIntrinsics::_arraycopy: do_ArrayCopy(x); break; 3142 3143 // java.nio.Buffer.checkIndex 3144 case vmIntrinsics::_checkIndex: do_NIOCheckIndex(x); break; 3145 3146 case vmIntrinsics::_compareAndSwapObject: 3147 do_CompareAndSwap(x, objectType); 3148 break; 3149 case vmIntrinsics::_compareAndSwapInt: 3150 do_CompareAndSwap(x, intType); 3151 break; 3152 case vmIntrinsics::_compareAndSwapLong: 3153 do_CompareAndSwap(x, longType); 3154 break; 3155 3156 case vmIntrinsics::_loadFence : 3157 if (os::is_MP()) __ membar_acquire(); 3158 break; 3159 case vmIntrinsics::_storeFence: 3160 if (os::is_MP()) __ membar_release(); 3161 break; 3162 case vmIntrinsics::_fullFence : 3163 if (os::is_MP()) __ membar(); 3164 break; 3165 3166 case vmIntrinsics::_Reference_get: 3167 do_Reference_get(x); 3168 break; 3169 3170 case vmIntrinsics::_updateCRC32: 3171 case vmIntrinsics::_updateBytesCRC32: 3172 case vmIntrinsics::_updateByteBufferCRC32: 3173 do_update_CRC32(x); 3174 break; 3175 3176 default: ShouldNotReachHere(); break; 3177 } 3178 } 3179 3180 void LIRGenerator::profile_arguments(ProfileCall* x) { 3181 if (compilation()->profile_arguments()) { 3182 int bci = x->bci_of_invoke(); 3183 ciMethodData* md = x->method()->method_data_or_null(); 3184 ciProfileData* data = md->bci_to_data(bci); 3185 if ((data->is_CallTypeData() && data->as_CallTypeData()->has_arguments()) || 3186 (data->is_VirtualCallTypeData() && data->as_VirtualCallTypeData()->has_arguments())) { 3187 ByteSize extra = data->is_CallTypeData() ? CallTypeData::args_data_offset() : VirtualCallTypeData::args_data_offset(); 3188 int base_offset = md->byte_offset_of_slot(data, extra); 3189 LIR_Opr mdp = LIR_OprFact::illegalOpr; 3190 ciTypeStackSlotEntries* args = data->is_CallTypeData() ? ((ciCallTypeData*)data)->args() : ((ciVirtualCallTypeData*)data)->args(); 3191 3192 Bytecodes::Code bc = x->method()->java_code_at_bci(bci); 3193 int start = 0; 3194 int stop = data->is_CallTypeData() ? ((ciCallTypeData*)data)->number_of_arguments() : ((ciVirtualCallTypeData*)data)->number_of_arguments(); 3195 if (x->inlined() && x->callee()->is_static() && Bytecodes::has_receiver(bc)) { 3196 // first argument is not profiled at call (method handle invoke) 3197 assert(x->method()->raw_code_at_bci(bci) == Bytecodes::_invokehandle, "invokehandle expected"); 3198 start = 1; 3199 } 3200 ciSignature* callee_signature = x->callee()->signature(); 3201 // method handle call to virtual method 3202 bool has_receiver = x->inlined() && !x->callee()->is_static() && !Bytecodes::has_receiver(bc); 3203 ciSignatureStream callee_signature_stream(callee_signature, has_receiver ? x->callee()->holder() : NULL); 3204 3205 bool ignored_will_link; 3206 ciSignature* signature_at_call = NULL; 3207 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call); 3208 ciSignatureStream signature_at_call_stream(signature_at_call); 3209 3210 // if called through method handle invoke, some arguments may have been popped 3211 for (int i = 0; i < stop && i+start < x->nb_profiled_args(); i++) { 3212 int off = in_bytes(TypeEntriesAtCall::argument_type_offset(i)) - in_bytes(TypeEntriesAtCall::args_data_offset()); 3213 ciKlass* exact = profile_type(md, base_offset, off, 3214 args->type(i), x->profiled_arg_at(i+start), mdp, 3215 !x->arg_needs_null_check(i+start), 3216 signature_at_call_stream.next_klass(), callee_signature_stream.next_klass()); 3217 if (exact != NULL) { 3218 md->set_argument_type(bci, i, exact); 3219 } 3220 } 3221 } else { 3222 #ifdef ASSERT 3223 Bytecodes::Code code = x->method()->raw_code_at_bci(x->bci_of_invoke()); 3224 int n = x->nb_profiled_args(); 3225 assert(MethodData::profile_parameters() && (MethodData::profile_arguments_jsr292_only() || 3226 (x->inlined() && ((code == Bytecodes::_invokedynamic && n <= 1) || (code == Bytecodes::_invokehandle && n <= 2)))), 3227 "only at JSR292 bytecodes"); 3228 #endif 3229 } 3230 } 3231 } 3232 3233 // profile parameters on entry to an inlined method 3234 void LIRGenerator::profile_parameters_at_call(ProfileCall* x) { 3235 if (compilation()->profile_parameters() && x->inlined()) { 3236 ciMethodData* md = x->callee()->method_data_or_null(); 3237 if (md != NULL) { 3238 ciParametersTypeData* parameters_type_data = md->parameters_type_data(); 3239 if (parameters_type_data != NULL) { 3240 ciTypeStackSlotEntries* parameters = parameters_type_data->parameters(); 3241 LIR_Opr mdp = LIR_OprFact::illegalOpr; 3242 bool has_receiver = !x->callee()->is_static(); 3243 ciSignature* sig = x->callee()->signature(); 3244 ciSignatureStream sig_stream(sig, has_receiver ? x->callee()->holder() : NULL); 3245 int i = 0; // to iterate on the Instructions 3246 Value arg = x->recv(); 3247 bool not_null = false; 3248 int bci = x->bci_of_invoke(); 3249 Bytecodes::Code bc = x->method()->java_code_at_bci(bci); 3250 // The first parameter is the receiver so that's what we start 3251 // with if it exists. One exception is method handle call to 3252 // virtual method: the receiver is in the args list 3253 if (arg == NULL || !Bytecodes::has_receiver(bc)) { 3254 i = 1; 3255 arg = x->profiled_arg_at(0); 3256 not_null = !x->arg_needs_null_check(0); 3257 } 3258 int k = 0; // to iterate on the profile data 3259 for (;;) { 3260 intptr_t profiled_k = parameters->type(k); 3261 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)), 3262 in_bytes(ParametersTypeData::type_offset(k)) - in_bytes(ParametersTypeData::type_offset(0)), 3263 profiled_k, arg, mdp, not_null, sig_stream.next_klass(), NULL); 3264 // If the profile is known statically set it once for all and do not emit any code 3265 if (exact != NULL) { 3266 md->set_parameter_type(k, exact); 3267 } 3268 k++; 3269 if (k >= parameters_type_data->number_of_parameters()) { 3270 #ifdef ASSERT 3271 int extra = 0; 3272 if (MethodData::profile_arguments() && TypeProfileParmsLimit != -1 && 3273 x->nb_profiled_args() >= TypeProfileParmsLimit && 3274 x->recv() != NULL && Bytecodes::has_receiver(bc)) { 3275 extra += 1; 3276 } 3277 assert(i == x->nb_profiled_args() - extra || (TypeProfileParmsLimit != -1 && TypeProfileArgsLimit > TypeProfileParmsLimit), "unused parameters?"); 3278 #endif 3279 break; 3280 } 3281 arg = x->profiled_arg_at(i); 3282 not_null = !x->arg_needs_null_check(i); 3283 i++; 3284 } 3285 } 3286 } 3287 } 3288 } 3289 3290 void LIRGenerator::do_ProfileCall(ProfileCall* x) { 3291 // Need recv in a temporary register so it interferes with the other temporaries 3292 LIR_Opr recv = LIR_OprFact::illegalOpr; 3293 LIR_Opr mdo = new_register(T_OBJECT); 3294 // tmp is used to hold the counters on SPARC 3295 LIR_Opr tmp = new_pointer_register(); 3296 3297 if (x->nb_profiled_args() > 0) { 3298 profile_arguments(x); 3299 } 3300 3301 // profile parameters on inlined method entry including receiver 3302 if (x->recv() != NULL || x->nb_profiled_args() > 0) { 3303 profile_parameters_at_call(x); 3304 } 3305 3306 if (x->recv() != NULL) { 3307 LIRItem value(x->recv(), this); 3308 value.load_item(); 3309 recv = new_register(T_OBJECT); 3310 __ move(value.result(), recv); 3311 } 3312 __ profile_call(x->method(), x->bci_of_invoke(), x->callee(), mdo, recv, tmp, x->known_holder()); 3313 } 3314 3315 void LIRGenerator::do_ProfileReturnType(ProfileReturnType* x) { 3316 int bci = x->bci_of_invoke(); 3317 ciMethodData* md = x->method()->method_data_or_null(); 3318 ciProfileData* data = md->bci_to_data(bci); 3319 assert(data->is_CallTypeData() || data->is_VirtualCallTypeData(), "wrong profile data type"); 3320 ciReturnTypeEntry* ret = data->is_CallTypeData() ? ((ciCallTypeData*)data)->ret() : ((ciVirtualCallTypeData*)data)->ret(); 3321 LIR_Opr mdp = LIR_OprFact::illegalOpr; 3322 3323 bool ignored_will_link; 3324 ciSignature* signature_at_call = NULL; 3325 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call); 3326 3327 // The offset within the MDO of the entry to update may be too large 3328 // to be used in load/store instructions on some platforms. So have 3329 // profile_type() compute the address of the profile in a register. 3330 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(data, ret->type_offset()), 0, 3331 ret->type(), x->ret(), mdp, 3332 !x->needs_null_check(), 3333 signature_at_call->return_type()->as_klass(), 3334 x->callee()->signature()->return_type()->as_klass()); 3335 if (exact != NULL) { 3336 md->set_return_type(bci, exact); 3337 } 3338 } 3339 3340 void LIRGenerator::do_ProfileInvoke(ProfileInvoke* x) { 3341 // We can safely ignore accessors here, since c2 will inline them anyway, 3342 // accessors are also always mature. 3343 if (!x->inlinee()->is_accessor()) { 3344 CodeEmitInfo* info = state_for(x, x->state(), true); 3345 // Notify the runtime very infrequently only to take care of counter overflows 3346 int freq_log = Tier23InlineeNotifyFreqLog; 3347 double scale; 3348 if (_method->has_option_value("CompileThresholdScaling", scale)) { 3349 freq_log = Arguments::scaled_freq_log(freq_log, scale); 3350 } 3351 increment_event_counter_impl(info, x->inlinee(), right_n_bits(freq_log), InvocationEntryBci, false, true); 3352 } 3353 } 3354 3355 void LIRGenerator::increment_event_counter(CodeEmitInfo* info, int bci, bool backedge) { 3356 int freq_log = 0; 3357 int level = compilation()->env()->comp_level(); 3358 if (level == CompLevel_limited_profile) { 3359 freq_log = (backedge ? Tier2BackedgeNotifyFreqLog : Tier2InvokeNotifyFreqLog); 3360 } else if (level == CompLevel_full_profile) { 3361 freq_log = (backedge ? Tier3BackedgeNotifyFreqLog : Tier3InvokeNotifyFreqLog); 3362 } else { 3363 ShouldNotReachHere(); 3364 } 3365 // Increment the appropriate invocation/backedge counter and notify the runtime. 3366 double scale; 3367 if (_method->has_option_value("CompileThresholdScaling", scale)) { 3368 freq_log = Arguments::scaled_freq_log(freq_log, scale); 3369 } 3370 increment_event_counter_impl(info, info->scope()->method(), right_n_bits(freq_log), bci, backedge, true); 3371 } 3372 3373 void LIRGenerator::decrement_age(CodeEmitInfo* info) { 3374 ciMethod* method = info->scope()->method(); 3375 MethodCounters* mc_adr = method->ensure_method_counters(); 3376 if (mc_adr != NULL) { 3377 LIR_Opr mc = new_pointer_register(); 3378 __ move(LIR_OprFact::intptrConst(mc_adr), mc); 3379 int offset = in_bytes(MethodCounters::nmethod_age_offset()); 3380 LIR_Address* counter = new LIR_Address(mc, offset, T_INT); 3381 LIR_Opr result = new_register(T_INT); 3382 __ load(counter, result); 3383 __ sub(result, LIR_OprFact::intConst(1), result); 3384 __ store(result, counter); 3385 // DeoptimizeStub will reexecute from the current state in code info. 3386 CodeStub* deopt = new DeoptimizeStub(info, Deoptimization::Reason_tenured, 3387 Deoptimization::Action_make_not_entrant); 3388 __ cmp(lir_cond_lessEqual, result, LIR_OprFact::intConst(0)); 3389 __ branch(lir_cond_lessEqual, T_INT, deopt); 3390 } 3391 } 3392 3393 3394 void LIRGenerator::increment_event_counter_impl(CodeEmitInfo* info, 3395 ciMethod *method, int frequency, 3396 int bci, bool backedge, bool notify) { 3397 assert(frequency == 0 || is_power_of_2(frequency + 1), "Frequency must be x^2 - 1 or 0"); 3398 int level = _compilation->env()->comp_level(); 3399 assert(level > CompLevel_simple, "Shouldn't be here"); 3400 3401 int offset = -1; 3402 LIR_Opr counter_holder = NULL; 3403 if (level == CompLevel_limited_profile) { 3404 MethodCounters* counters_adr = method->ensure_method_counters(); 3405 if (counters_adr == NULL) { 3406 bailout("method counters allocation failed"); 3407 return; 3408 } 3409 counter_holder = new_pointer_register(); 3410 __ move(LIR_OprFact::intptrConst(counters_adr), counter_holder); 3411 offset = in_bytes(backedge ? MethodCounters::backedge_counter_offset() : 3412 MethodCounters::invocation_counter_offset()); 3413 } else if (level == CompLevel_full_profile) { 3414 counter_holder = new_register(T_METADATA); 3415 offset = in_bytes(backedge ? MethodData::backedge_counter_offset() : 3416 MethodData::invocation_counter_offset()); 3417 ciMethodData* md = method->method_data_or_null(); 3418 assert(md != NULL, "Sanity"); 3419 __ metadata2reg(md->constant_encoding(), counter_holder); 3420 } else { 3421 ShouldNotReachHere(); 3422 } 3423 LIR_Address* counter = new LIR_Address(counter_holder, offset, T_INT); 3424 LIR_Opr result = new_register(T_INT); 3425 __ load(counter, result); 3426 __ add(result, LIR_OprFact::intConst(InvocationCounter::count_increment), result); 3427 __ store(result, counter); 3428 if (notify) { 3429 LIR_Opr meth = LIR_OprFact::metadataConst(method->constant_encoding()); 3430 // The bci for info can point to cmp for if's we want the if bci 3431 CodeStub* overflow = new CounterOverflowStub(info, bci, meth); 3432 int freq = frequency << InvocationCounter::count_shift; 3433 if (freq == 0) { 3434 __ branch(lir_cond_always, T_ILLEGAL, overflow); 3435 } else { 3436 LIR_Opr mask = load_immediate(freq, T_INT); 3437 __ logical_and(result, mask, result); 3438 __ cmp(lir_cond_equal, result, LIR_OprFact::intConst(0)); 3439 __ branch(lir_cond_equal, T_INT, overflow); 3440 } 3441 __ branch_destination(overflow->continuation()); 3442 } 3443 } 3444 3445 void LIRGenerator::do_RuntimeCall(RuntimeCall* x) { 3446 LIR_OprList* args = new LIR_OprList(x->number_of_arguments()); 3447 BasicTypeList* signature = new BasicTypeList(x->number_of_arguments()); 3448 3449 if (x->pass_thread()) { 3450 signature->append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread 3451 args->append(getThreadPointer()); 3452 } 3453 3454 for (int i = 0; i < x->number_of_arguments(); i++) { 3455 Value a = x->argument_at(i); 3456 LIRItem* item = new LIRItem(a, this); 3457 item->load_item(); 3458 args->append(item->result()); 3459 signature->append(as_BasicType(a->type())); 3460 } 3461 3462 LIR_Opr result = call_runtime(signature, args, x->entry(), x->type(), NULL); 3463 if (x->type() == voidType) { 3464 set_no_result(x); 3465 } else { 3466 __ move(result, rlock_result(x)); 3467 } 3468 } 3469 3470 #ifdef ASSERT 3471 void LIRGenerator::do_Assert(Assert *x) { 3472 ValueTag tag = x->x()->type()->tag(); 3473 If::Condition cond = x->cond(); 3474 3475 LIRItem xitem(x->x(), this); 3476 LIRItem yitem(x->y(), this); 3477 LIRItem* xin = &xitem; 3478 LIRItem* yin = &yitem; 3479 3480 assert(tag == intTag, "Only integer assertions are valid!"); 3481 3482 xin->load_item(); 3483 yin->dont_load_item(); 3484 3485 set_no_result(x); 3486 3487 LIR_Opr left = xin->result(); 3488 LIR_Opr right = yin->result(); 3489 3490 __ lir_assert(lir_cond(x->cond()), left, right, x->message(), true); 3491 } 3492 #endif 3493 3494 void LIRGenerator::do_RangeCheckPredicate(RangeCheckPredicate *x) { 3495 3496 3497 Instruction *a = x->x(); 3498 Instruction *b = x->y(); 3499 if (!a || StressRangeCheckElimination) { 3500 assert(!b || StressRangeCheckElimination, "B must also be null"); 3501 3502 CodeEmitInfo *info = state_for(x, x->state()); 3503 CodeStub* stub = new PredicateFailedStub(info); 3504 3505 __ jump(stub); 3506 } else if (a->type()->as_IntConstant() && b->type()->as_IntConstant()) { 3507 int a_int = a->type()->as_IntConstant()->value(); 3508 int b_int = b->type()->as_IntConstant()->value(); 3509 3510 bool ok = false; 3511 3512 switch(x->cond()) { 3513 case Instruction::eql: ok = (a_int == b_int); break; 3514 case Instruction::neq: ok = (a_int != b_int); break; 3515 case Instruction::lss: ok = (a_int < b_int); break; 3516 case Instruction::leq: ok = (a_int <= b_int); break; 3517 case Instruction::gtr: ok = (a_int > b_int); break; 3518 case Instruction::geq: ok = (a_int >= b_int); break; 3519 case Instruction::aeq: ok = ((unsigned int)a_int >= (unsigned int)b_int); break; 3520 case Instruction::beq: ok = ((unsigned int)a_int <= (unsigned int)b_int); break; 3521 default: ShouldNotReachHere(); 3522 } 3523 3524 if (ok) { 3525 3526 CodeEmitInfo *info = state_for(x, x->state()); 3527 CodeStub* stub = new PredicateFailedStub(info); 3528 3529 __ jump(stub); 3530 } 3531 } else { 3532 3533 ValueTag tag = x->x()->type()->tag(); 3534 If::Condition cond = x->cond(); 3535 LIRItem xitem(x->x(), this); 3536 LIRItem yitem(x->y(), this); 3537 LIRItem* xin = &xitem; 3538 LIRItem* yin = &yitem; 3539 3540 assert(tag == intTag, "Only integer deoptimizations are valid!"); 3541 3542 xin->load_item(); 3543 yin->dont_load_item(); 3544 set_no_result(x); 3545 3546 LIR_Opr left = xin->result(); 3547 LIR_Opr right = yin->result(); 3548 3549 CodeEmitInfo *info = state_for(x, x->state()); 3550 CodeStub* stub = new PredicateFailedStub(info); 3551 3552 __ cmp(lir_cond(cond), left, right); 3553 __ branch(lir_cond(cond), right->type(), stub); 3554 } 3555 } 3556 3557 3558 LIR_Opr LIRGenerator::call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info) { 3559 LIRItemList args(1); 3560 LIRItem value(arg1, this); 3561 args.append(&value); 3562 BasicTypeList signature; 3563 signature.append(as_BasicType(arg1->type())); 3564 3565 return call_runtime(&signature, &args, entry, result_type, info); 3566 } 3567 3568 3569 LIR_Opr LIRGenerator::call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info) { 3570 LIRItemList args(2); 3571 LIRItem value1(arg1, this); 3572 LIRItem value2(arg2, this); 3573 args.append(&value1); 3574 args.append(&value2); 3575 BasicTypeList signature; 3576 signature.append(as_BasicType(arg1->type())); 3577 signature.append(as_BasicType(arg2->type())); 3578 3579 return call_runtime(&signature, &args, entry, result_type, info); 3580 } 3581 3582 3583 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIR_OprList* args, 3584 address entry, ValueType* result_type, CodeEmitInfo* info) { 3585 // get a result register 3586 LIR_Opr phys_reg = LIR_OprFact::illegalOpr; 3587 LIR_Opr result = LIR_OprFact::illegalOpr; 3588 if (result_type->tag() != voidTag) { 3589 result = new_register(result_type); 3590 phys_reg = result_register_for(result_type); 3591 } 3592 3593 // move the arguments into the correct location 3594 CallingConvention* cc = frame_map()->c_calling_convention(signature); 3595 assert(cc->length() == args->length(), "argument mismatch"); 3596 for (int i = 0; i < args->length(); i++) { 3597 LIR_Opr arg = args->at(i); 3598 LIR_Opr loc = cc->at(i); 3599 if (loc->is_register()) { 3600 __ move(arg, loc); 3601 } else { 3602 LIR_Address* addr = loc->as_address_ptr(); 3603 // if (!can_store_as_constant(arg)) { 3604 // LIR_Opr tmp = new_register(arg->type()); 3605 // __ move(arg, tmp); 3606 // arg = tmp; 3607 // } 3608 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) { 3609 __ unaligned_move(arg, addr); 3610 } else { 3611 __ move(arg, addr); 3612 } 3613 } 3614 } 3615 3616 if (info) { 3617 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info); 3618 } else { 3619 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args()); 3620 } 3621 if (result->is_valid()) { 3622 __ move(phys_reg, result); 3623 } 3624 return result; 3625 } 3626 3627 3628 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIRItemList* args, 3629 address entry, ValueType* result_type, CodeEmitInfo* info) { 3630 // get a result register 3631 LIR_Opr phys_reg = LIR_OprFact::illegalOpr; 3632 LIR_Opr result = LIR_OprFact::illegalOpr; 3633 if (result_type->tag() != voidTag) { 3634 result = new_register(result_type); 3635 phys_reg = result_register_for(result_type); 3636 } 3637 3638 // move the arguments into the correct location 3639 CallingConvention* cc = frame_map()->c_calling_convention(signature); 3640 3641 assert(cc->length() == args->length(), "argument mismatch"); 3642 for (int i = 0; i < args->length(); i++) { 3643 LIRItem* arg = args->at(i); 3644 LIR_Opr loc = cc->at(i); 3645 if (loc->is_register()) { 3646 arg->load_item_force(loc); 3647 } else { 3648 LIR_Address* addr = loc->as_address_ptr(); 3649 arg->load_for_store(addr->type()); 3650 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) { 3651 __ unaligned_move(arg->result(), addr); 3652 } else { 3653 __ move(arg->result(), addr); 3654 } 3655 } 3656 } 3657 3658 if (info) { 3659 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info); 3660 } else { 3661 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args()); 3662 } 3663 if (result->is_valid()) { 3664 __ move(phys_reg, result); 3665 } 3666 return result; 3667 } 3668 3669 void LIRGenerator::do_MemBar(MemBar* x) { 3670 if (os::is_MP()) { 3671 LIR_Code code = x->code(); 3672 switch(code) { 3673 case lir_membar_acquire : __ membar_acquire(); break; 3674 case lir_membar_release : __ membar_release(); break; 3675 case lir_membar : __ membar(); break; 3676 case lir_membar_loadload : __ membar_loadload(); break; 3677 case lir_membar_storestore: __ membar_storestore(); break; 3678 case lir_membar_loadstore : __ membar_loadstore(); break; 3679 case lir_membar_storeload : __ membar_storeload(); break; 3680 default : ShouldNotReachHere(); break; 3681 } 3682 } 3683 }