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