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