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 "c1/c1_Compilation.hpp"
26 #include "c1/c1_Defs.hpp"
27 #include "c1/c1_FrameMap.hpp"
28 #include "c1/c1_Instruction.hpp"
29 #include "c1/c1_LIRAssembler.hpp"
30 #include "c1/c1_LIRGenerator.hpp"
31 #include "c1/c1_ValueStack.hpp"
32 #include "ci/ciArrayKlass.hpp"
33 #include "ci/ciInstance.hpp"
34 #include "ci/ciObjArray.hpp"
35 #include "ci/ciUtilities.hpp"
36 #include "compiler/compilerDefinitions.inline.hpp"
37 #include "compiler/compilerOracle.hpp"
38 #include "gc/shared/barrierSet.hpp"
39 #include "gc/shared/c1/barrierSetC1.hpp"
40 #include "oops/klass.inline.hpp"
41 #include "oops/methodCounters.hpp"
42 #include "runtime/sharedRuntime.hpp"
43 #include "runtime/stubRoutines.hpp"
44 #include "runtime/vm_version.hpp"
45 #include "utilities/bitMap.inline.hpp"
46 #include "utilities/macros.hpp"
47 #include "utilities/powerOfTwo.hpp"
48
49 #ifdef ASSERT
50 #define __ gen()->lir(__FILE__, __LINE__)->
51 #else
52 #define __ gen()->lir()->
53 #endif
54
55 #ifndef PATCHED_ADDR
56 #define PATCHED_ADDR (max_jint)
57 #endif
58
59 void PhiResolverState::reset() {
60 _virtual_operands.clear();
61 _other_operands.clear();
198 }
199
200
201 //--------------------------------------------------------------
202 // LIRItem
203
204 void LIRItem::set_result(LIR_Opr opr) {
205 assert(value()->operand()->is_illegal() || value()->operand()->is_constant(), "operand should never change");
206 value()->set_operand(opr);
207
208 #ifdef ASSERT
209 if (opr->is_virtual()) {
210 _gen->_instruction_for_operand.at_put_grow(opr->vreg_number(), value(), nullptr);
211 }
212 #endif
213
214 _result = opr;
215 }
216
217 void LIRItem::load_item() {
218 if (result()->is_illegal()) {
219 // update the items result
220 _result = value()->operand();
221 }
222 if (!result()->is_register()) {
223 LIR_Opr reg = _gen->new_register(value()->type());
224 __ move(result(), reg);
225 if (result()->is_constant()) {
226 _result = reg;
227 } else {
228 set_result(reg);
229 }
230 }
231 }
232
233
234 void LIRItem::load_for_store(BasicType type) {
235 if (_gen->can_store_as_constant(value(), type)) {
236 _result = value()->operand();
237 if (!_result->is_constant()) {
605 assert(right_op != result_op, "malformed");
606 __ move(left_op, result_op);
607 left_op = result_op;
608 }
609
610 switch(code) {
611 case Bytecodes::_iand:
612 case Bytecodes::_land: __ logical_and(left_op, right_op, result_op); break;
613
614 case Bytecodes::_ior:
615 case Bytecodes::_lor: __ logical_or(left_op, right_op, result_op); break;
616
617 case Bytecodes::_ixor:
618 case Bytecodes::_lxor: __ logical_xor(left_op, right_op, result_op); break;
619
620 default: ShouldNotReachHere();
621 }
622 }
623
624
625 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) {
626 // for slow path, use debug info for state after successful locking
627 CodeStub* slow_path = new MonitorEnterStub(object, lock, info);
628 __ load_stack_address_monitor(monitor_no, lock);
629 // for handling NullPointerException, use debug info representing just the lock stack before this monitorenter
630 __ lock_object(hdr, object, lock, scratch, slow_path, info_for_exception);
631 }
632
633
634 void LIRGenerator::monitor_exit(LIR_Opr object, LIR_Opr lock, LIR_Opr new_hdr, LIR_Opr scratch, int monitor_no) {
635 // setup registers
636 LIR_Opr hdr = lock;
637 lock = new_hdr;
638 CodeStub* slow_path = new MonitorExitStub(lock, monitor_no);
639 __ load_stack_address_monitor(monitor_no, lock);
640 __ unlock_object(hdr, object, lock, scratch, slow_path);
641 }
642
643 #ifndef PRODUCT
644 void LIRGenerator::print_if_not_loaded(const NewInstance* new_instance) {
645 if (PrintNotLoaded && !new_instance->klass()->is_loaded()) {
646 tty->print_cr(" ###class not loaded at new bci %d", new_instance->printable_bci());
647 } else if (PrintNotLoaded && (!CompilerConfig::is_c1_only() && new_instance->is_unresolved())) {
648 tty->print_cr(" ###class not resolved at new bci %d", new_instance->printable_bci());
649 }
650 }
651 #endif
652
653 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) {
654 klass2reg_with_patching(klass_reg, klass, info, is_unresolved);
655 // If klass is not loaded we do not know if the klass has finalizers:
656 if (UseFastNewInstance && klass->is_loaded()
657 && !Klass::layout_helper_needs_slow_path(klass->layout_helper())) {
658
659 StubId stub_id = klass->is_initialized() ? StubId::c1_fast_new_instance_id : StubId::c1_fast_new_instance_init_check_id;
660
661 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, stub_id);
662
663 assert(klass->is_loaded(), "must be loaded");
664 // allocate space for instance
665 assert(klass->size_helper() > 0, "illegal instance size");
666 const int instance_size = align_object_size(klass->size_helper());
667 __ allocate_object(dst, scratch1, scratch2, scratch3, scratch4,
668 oopDesc::header_size(), instance_size, klass_reg, !klass->is_initialized(), slow_path);
669 } else {
670 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, StubId::c1_new_instance_id);
671 __ branch(lir_cond_always, slow_path);
672 __ branch_destination(slow_path->continuation());
673 }
674 }
675
676
677 static bool is_constant_zero(Instruction* inst) {
678 IntConstant* c = inst->type()->as_IntConstant();
679 if (c) {
680 return (c->value() == 0);
681 }
682 return false;
683 }
684
685
686 static bool positive_constant(Instruction* inst) {
687 IntConstant* c = inst->type()->as_IntConstant();
688 if (c) {
689 return (c->value() >= 0);
690 }
691 return false;
743 } else if (dst_exact_type != nullptr && dst_exact_type->is_obj_array_klass()) {
744 ciArrayKlass* dst_type = (ciArrayKlass*) dst_exact_type;
745 ciArrayKlass* src_type = nullptr;
746 if (src_exact_type != nullptr && src_exact_type->is_obj_array_klass()) {
747 src_type = (ciArrayKlass*) src_exact_type;
748 } else if (src_declared_type != nullptr && src_declared_type->is_obj_array_klass()) {
749 src_type = (ciArrayKlass*) src_declared_type;
750 }
751 if (src_type != nullptr) {
752 if (src_type->element_type()->is_subtype_of(dst_type->element_type())) {
753 is_exact = true;
754 expected_type = dst_type;
755 }
756 }
757 }
758 // at least pass along a good guess
759 if (expected_type == nullptr) expected_type = dst_exact_type;
760 if (expected_type == nullptr) expected_type = src_declared_type;
761 if (expected_type == nullptr) expected_type = dst_declared_type;
762
763 src_objarray = (src_exact_type && src_exact_type->is_obj_array_klass()) || (src_declared_type && src_declared_type->is_obj_array_klass());
764 dst_objarray = (dst_exact_type && dst_exact_type->is_obj_array_klass()) || (dst_declared_type && dst_declared_type->is_obj_array_klass());
765 }
766
767 // if a probable array type has been identified, figure out if any
768 // of the required checks for a fast case can be elided.
769 int flags = LIR_OpArrayCopy::all_flags;
770
771 if (!src_objarray)
772 flags &= ~LIR_OpArrayCopy::src_objarray;
773 if (!dst_objarray)
774 flags &= ~LIR_OpArrayCopy::dst_objarray;
775
776 if (!x->arg_needs_null_check(0))
777 flags &= ~LIR_OpArrayCopy::src_null_check;
778 if (!x->arg_needs_null_check(2))
779 flags &= ~LIR_OpArrayCopy::dst_null_check;
780
781
782 if (expected_type != nullptr) {
783 Value length_limit = nullptr;
784
785 IfOp* ifop = length->as_IfOp();
786 if (ifop != nullptr) {
787 // look for expressions like min(v, a.length) which ends up as
788 // x > y ? y : x or x >= y ? y : x
789 if ((ifop->cond() == If::gtr || ifop->cond() == If::geq) &&
790 ifop->x() == ifop->fval() &&
1443 }
1444 return _vreg_flags.at(vreg_num, f);
1445 }
1446
1447
1448 // Block local constant handling. This code is useful for keeping
1449 // unpinned constants and constants which aren't exposed in the IR in
1450 // registers. Unpinned Constant instructions have their operands
1451 // cleared when the block is finished so that other blocks can't end
1452 // up referring to their registers.
1453
1454 LIR_Opr LIRGenerator::load_constant(Constant* x) {
1455 assert(!x->is_pinned(), "only for unpinned constants");
1456 _unpinned_constants.append(x);
1457 return load_constant(LIR_OprFact::value_type(x->type())->as_constant_ptr());
1458 }
1459
1460
1461 LIR_Opr LIRGenerator::load_constant(LIR_Const* c) {
1462 BasicType t = c->type();
1463 for (int i = 0; i < _constants.length(); i++) {
1464 LIR_Const* other = _constants.at(i);
1465 if (t == other->type()) {
1466 switch (t) {
1467 case T_INT:
1468 case T_FLOAT:
1469 if (c->as_jint_bits() != other->as_jint_bits()) continue;
1470 break;
1471 case T_LONG:
1472 case T_DOUBLE:
1473 if (c->as_jint_hi_bits() != other->as_jint_hi_bits()) continue;
1474 if (c->as_jint_lo_bits() != other->as_jint_lo_bits()) continue;
1475 break;
1476 case T_OBJECT:
1477 if (c->as_jobject() != other->as_jobject()) continue;
1478 break;
1479 default:
1480 break;
1481 }
1482 return _reg_for_constants.at(i);
1483 }
1484 }
1485
1486 LIR_Opr result = new_register(t);
1487 __ move((LIR_Opr)c, result);
1488 _constants.append(c);
1489 _reg_for_constants.append(result);
1490 return result;
1491 }
1492
1493 //------------------------field access--------------------------------------
1494
1495 void LIRGenerator::do_CompareAndSwap(Intrinsic* x, ValueType* type) {
1496 assert(x->number_of_arguments() == 4, "wrong type");
1497 LIRItem obj (x->argument_at(0), this); // object
1498 LIRItem offset(x->argument_at(1), this); // offset of field
1499 LIRItem cmp (x->argument_at(2), this); // value to compare with field
1500 LIRItem val (x->argument_at(3), this); // replace field with val if matches cmp
1501 assert(obj.type()->tag() == objectTag, "invalid type");
1502 assert(cmp.type()->tag() == type->tag(), "invalid type");
1503 assert(val.type()->tag() == type->tag(), "invalid type");
1504
1505 LIR_Opr result = access_atomic_cmpxchg_at(IN_HEAP, as_BasicType(type),
1506 obj, offset, cmp, val);
1507 set_result(x, result);
1508 }
1509
1510 // Comment copied form templateTable_i486.cpp
1511 // ----------------------------------------------------------------------------
1512 // Volatile variables demand their effects be made known to all CPU's in
1513 // order. Store buffers on most chips allow reads & writes to reorder; the
1514 // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of
1515 // memory barrier (i.e., it's not sufficient that the interpreter does not
1516 // reorder volatile references, the hardware also must not reorder them).
1517 //
1518 // According to the new Java Memory Model (JMM):
1519 // (1) All volatiles are serialized wrt to each other.
1520 // ALSO reads & writes act as acquire & release, so:
1521 // (2) A read cannot let unrelated NON-volatile memory refs that happen after
1522 // the read float up to before the read. It's OK for non-volatile memory refs
1523 // that happen before the volatile read to float down below it.
1524 // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs
1525 // that happen BEFORE the write float down to after the write. It's OK for
1526 // non-volatile memory refs that happen after the volatile write to float up
1527 // before it.
1528 //
1529 // We only put in barriers around volatile refs (they are expensive), not
1530 // _between_ memory refs (that would require us to track the flavor of the
1531 // previous memory refs). Requirements (2) and (3) require some barriers
1532 // before volatile stores and after volatile loads. These nearly cover
1533 // requirement (1) but miss the volatile-store-volatile-load case. This final
1534 // case is placed after volatile-stores although it could just as well go
1535 // before volatile-loads.
1536
1537
1538 void LIRGenerator::do_StoreField(StoreField* x) {
1539 bool needs_patching = x->needs_patching();
1540 bool is_volatile = x->field()->is_volatile();
1541 BasicType field_type = x->field_type();
1542
1543 CodeEmitInfo* info = nullptr;
1544 if (needs_patching) {
1545 assert(x->explicit_null_check() == nullptr, "can't fold null check into patching field access");
1546 info = state_for(x, x->state_before());
1547 } else if (x->needs_null_check()) {
1548 NullCheck* nc = x->explicit_null_check();
1549 if (nc == nullptr) {
1550 info = state_for(x);
1551 } else {
1552 info = state_for(nc);
1553 }
1554 }
1555
1556 LIRItem object(x->obj(), this);
1557 LIRItem value(x->value(), this);
1558
1559 object.load_item();
1560
1561 if (is_volatile || needs_patching) {
1562 // load item if field is volatile (fewer special cases for volatiles)
1563 // load item if field not initialized
1564 // load item if field not constant
1565 // because of code patching we cannot inline constants
1566 if (field_type == T_BYTE || field_type == T_BOOLEAN) {
1567 value.load_byte_item();
1568 } else {
1569 value.load_item();
1570 }
1571 } else {
1572 value.load_for_store(field_type);
1573 }
1574
1575 set_no_result(x);
1576
1577 #ifndef PRODUCT
1578 if (PrintNotLoaded && needs_patching) {
1579 tty->print_cr(" ###class not loaded at store_%s bci %d",
1580 x->is_static() ? "static" : "field", x->printable_bci());
1581 }
1582 #endif
1583
1584 if (x->needs_null_check() &&
1585 (needs_patching ||
1586 MacroAssembler::needs_explicit_null_check(x->offset()))) {
1587 // Emit an explicit null check because the offset is too large.
1588 // If the class is not loaded and the object is null, we need to deoptimize to throw a
1589 // NoClassDefFoundError in the interpreter instead of an implicit NPE from compiled code.
1590 __ null_check(object.result(), new CodeEmitInfo(info), /* deoptimize */ needs_patching);
1591 }
1592
1593 DecoratorSet decorators = IN_HEAP;
1594 if (is_volatile) {
1595 decorators |= MO_SEQ_CST;
1596 }
1597 if (needs_patching) {
1598 decorators |= C1_NEEDS_PATCHING;
1599 }
1600
1601 access_store_at(decorators, field_type, object, LIR_OprFact::intConst(x->offset()),
1602 value.result(), info != nullptr ? new CodeEmitInfo(info) : nullptr, info);
1603 }
1604
1605 void LIRGenerator::do_StoreIndexed(StoreIndexed* x) {
1606 assert(x->is_pinned(),"");
1607 bool needs_range_check = x->compute_needs_range_check();
1608 bool use_length = x->length() != nullptr;
1609 bool obj_store = is_reference_type(x->elt_type());
1610 bool needs_store_check = obj_store && (x->value()->as_Constant() == nullptr ||
1611 !get_jobject_constant(x->value())->is_null_object() ||
1612 x->should_profile());
1613
1614 LIRItem array(x->array(), this);
1615 LIRItem index(x->index(), this);
1616 LIRItem value(x->value(), this);
1617 LIRItem length(this);
1618
1619 array.load_item();
1620 index.load_nonconstant();
1621
1622 if (use_length && needs_range_check) {
1623 length.set_instruction(x->length());
1624 length.load_item();
1625
1626 }
1627 if (needs_store_check || x->check_boolean()) {
1628 value.load_item();
1629 } else {
1630 value.load_for_store(x->elt_type());
1631 }
1632
1633 set_no_result(x);
1634
1635 // the CodeEmitInfo must be duplicated for each different
1636 // LIR-instruction because spilling can occur anywhere between two
1637 // instructions and so the debug information must be different
1638 CodeEmitInfo* range_check_info = state_for(x);
1639 CodeEmitInfo* null_check_info = nullptr;
1640 if (x->needs_null_check()) {
1641 null_check_info = new CodeEmitInfo(range_check_info);
1642 }
1643
1644 if (needs_range_check) {
1645 if (use_length) {
1646 __ cmp(lir_cond_belowEqual, length.result(), index.result());
1647 __ branch(lir_cond_belowEqual, new RangeCheckStub(range_check_info, index.result(), array.result()));
1648 } else {
1649 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
1650 // range_check also does the null check
1651 null_check_info = nullptr;
1652 }
1653 }
1654
1655 if (GenerateArrayStoreCheck && needs_store_check) {
1656 CodeEmitInfo* store_check_info = new CodeEmitInfo(range_check_info);
1657 array_store_check(value.result(), array.result(), store_check_info, x->profiled_method(), x->profiled_bci());
1658 }
1659
1660 DecoratorSet decorators = IN_HEAP | IS_ARRAY;
1661 if (x->check_boolean()) {
1662 decorators |= C1_MASK_BOOLEAN;
1663 }
1664
1665 access_store_at(decorators, x->elt_type(), array, index.result(), value.result(),
1666 nullptr, null_check_info);
1667 }
1668
1669 void LIRGenerator::access_load_at(DecoratorSet decorators, BasicType type,
1670 LIRItem& base, LIR_Opr offset, LIR_Opr result,
1671 CodeEmitInfo* patch_info, CodeEmitInfo* load_emit_info) {
1672 decorators |= ACCESS_READ;
1673 LIRAccess access(this, decorators, base, offset, type, patch_info, load_emit_info);
1674 if (access.is_raw()) {
1675 _barrier_set->BarrierSetC1::load_at(access, result);
1676 } else {
1677 _barrier_set->load_at(access, result);
1678 }
1679 }
1680
1681 void LIRGenerator::access_load(DecoratorSet decorators, BasicType type,
1682 LIR_Opr addr, LIR_Opr result) {
1683 decorators |= ACCESS_READ;
1684 LIRAccess access(this, decorators, LIR_OprFact::illegalOpr, LIR_OprFact::illegalOpr, type);
1685 access.set_resolved_addr(addr);
1686 if (access.is_raw()) {
1687 _barrier_set->BarrierSetC1::load(access, result);
1688 } else {
1689 _barrier_set->load(access, result);
1690 }
1691 }
1692
1693 void LIRGenerator::access_store_at(DecoratorSet decorators, BasicType type,
1694 LIRItem& base, LIR_Opr offset, LIR_Opr value,
1695 CodeEmitInfo* patch_info, CodeEmitInfo* store_emit_info) {
1696 decorators |= ACCESS_WRITE;
1697 LIRAccess access(this, decorators, base, offset, type, patch_info, store_emit_info);
1698 if (access.is_raw()) {
1699 _barrier_set->BarrierSetC1::store_at(access, value);
1700 } else {
1701 _barrier_set->store_at(access, value);
1702 }
1703 }
1704
1705 LIR_Opr LIRGenerator::access_atomic_cmpxchg_at(DecoratorSet decorators, BasicType type,
1706 LIRItem& base, LIRItem& offset, LIRItem& cmp_value, LIRItem& new_value) {
1707 decorators |= ACCESS_READ;
1708 decorators |= ACCESS_WRITE;
1709 // Atomic operations are SEQ_CST by default
1710 decorators |= ((decorators & MO_DECORATOR_MASK) == 0) ? MO_SEQ_CST : 0;
1711 LIRAccess access(this, decorators, base, offset, type);
1712 if (access.is_raw()) {
1713 return _barrier_set->BarrierSetC1::atomic_cmpxchg_at(access, cmp_value, new_value);
1714 } else {
1715 return _barrier_set->atomic_cmpxchg_at(access, cmp_value, new_value);
1716 }
1717 }
1728 } else {
1729 return _barrier_set->atomic_xchg_at(access, value);
1730 }
1731 }
1732
1733 LIR_Opr LIRGenerator::access_atomic_add_at(DecoratorSet decorators, BasicType type,
1734 LIRItem& base, LIRItem& offset, LIRItem& value) {
1735 decorators |= ACCESS_READ;
1736 decorators |= ACCESS_WRITE;
1737 // Atomic operations are SEQ_CST by default
1738 decorators |= ((decorators & MO_DECORATOR_MASK) == 0) ? MO_SEQ_CST : 0;
1739 LIRAccess access(this, decorators, base, offset, type);
1740 if (access.is_raw()) {
1741 return _barrier_set->BarrierSetC1::atomic_add_at(access, value);
1742 } else {
1743 return _barrier_set->atomic_add_at(access, value);
1744 }
1745 }
1746
1747 void LIRGenerator::do_LoadField(LoadField* x) {
1748 bool needs_patching = x->needs_patching();
1749 bool is_volatile = x->field()->is_volatile();
1750 BasicType field_type = x->field_type();
1751
1752 CodeEmitInfo* info = nullptr;
1753 if (needs_patching) {
1754 assert(x->explicit_null_check() == nullptr, "can't fold null check into patching field access");
1755 info = state_for(x, x->state_before());
1756 } else if (x->needs_null_check()) {
1757 NullCheck* nc = x->explicit_null_check();
1758 if (nc == nullptr) {
1759 info = state_for(x);
1760 } else {
1761 info = state_for(nc);
1762 }
1763 }
1764
1765 LIRItem object(x->obj(), this);
1766
1767 object.load_item();
1768
1769 #ifndef PRODUCT
1780 stress_deopt)) {
1781 LIR_Opr obj = object.result();
1782 if (stress_deopt) {
1783 obj = new_register(T_OBJECT);
1784 __ move(LIR_OprFact::oopConst(nullptr), obj);
1785 }
1786 // Emit an explicit null check because the offset is too large.
1787 // If the class is not loaded and the object is null, we need to deoptimize to throw a
1788 // NoClassDefFoundError in the interpreter instead of an implicit NPE from compiled code.
1789 __ null_check(obj, new CodeEmitInfo(info), /* deoptimize */ needs_patching);
1790 }
1791
1792 DecoratorSet decorators = IN_HEAP;
1793 if (is_volatile) {
1794 decorators |= MO_SEQ_CST;
1795 }
1796 if (needs_patching) {
1797 decorators |= C1_NEEDS_PATCHING;
1798 }
1799
1800 LIR_Opr result = rlock_result(x, field_type);
1801 access_load_at(decorators, field_type,
1802 object, LIR_OprFact::intConst(x->offset()), result,
1803 info ? new CodeEmitInfo(info) : nullptr, info);
1804 }
1805
1806 // int/long jdk.internal.util.Preconditions.checkIndex
1807 void LIRGenerator::do_PreconditionsCheckIndex(Intrinsic* x, BasicType type) {
1808 assert(x->number_of_arguments() == 3, "wrong type");
1809 LIRItem index(x->argument_at(0), this);
1810 LIRItem length(x->argument_at(1), this);
1811 LIRItem oobef(x->argument_at(2), this);
1812
1813 index.load_item();
1814 length.load_item();
1815 oobef.load_item();
1816
1817 LIR_Opr result = rlock_result(x);
1818 // x->state() is created from copy_state_for_exception, it does not contains arguments
1819 // we should prepare them before entering into interpreter mode due to deoptimization.
1928 __ move(LIR_OprFact::oopConst(nullptr), obj);
1929 __ null_check(obj, new CodeEmitInfo(null_check_info));
1930 }
1931 }
1932
1933 if (needs_range_check) {
1934 if (StressLoopInvariantCodeMotion && range_check_info->deoptimize_on_exception()) {
1935 __ branch(lir_cond_always, new RangeCheckStub(range_check_info, index.result(), array.result()));
1936 } else if (use_length) {
1937 // TODO: use a (modified) version of array_range_check that does not require a
1938 // constant length to be loaded to a register
1939 __ cmp(lir_cond_belowEqual, length.result(), index.result());
1940 __ branch(lir_cond_belowEqual, new RangeCheckStub(range_check_info, index.result(), array.result()));
1941 } else {
1942 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
1943 // The range check performs the null check, so clear it out for the load
1944 null_check_info = nullptr;
1945 }
1946 }
1947
1948 DecoratorSet decorators = IN_HEAP | IS_ARRAY;
1949
1950 LIR_Opr result = rlock_result(x, x->elt_type());
1951 access_load_at(decorators, x->elt_type(),
1952 array, index.result(), result,
1953 nullptr, null_check_info);
1954 }
1955
1956
1957 void LIRGenerator::do_NullCheck(NullCheck* x) {
1958 if (x->can_trap()) {
1959 LIRItem value(x->obj(), this);
1960 value.load_item();
1961 CodeEmitInfo* info = state_for(x);
1962 __ null_check(value.result(), info);
1963 }
1964 }
1965
1966
1967 void LIRGenerator::do_TypeCast(TypeCast* x) {
1968 LIRItem value(x->obj(), this);
1969 value.load_item();
1970 // the result is the same as from the node we are casting
1971 set_result(x, value.result());
1972 }
1973
2416 Compilation* comp = Compilation::current();
2417 if (do_update) {
2418 // try to find exact type, using CHA if possible, so that loading
2419 // the klass from the object can be avoided
2420 ciType* type = obj->exact_type();
2421 if (type == nullptr) {
2422 type = obj->declared_type();
2423 type = comp->cha_exact_type(type);
2424 }
2425 assert(type == nullptr || type->is_klass(), "type should be class");
2426 exact_klass = (type != nullptr && type->is_loaded()) ? (ciKlass*)type : nullptr;
2427
2428 do_update = exact_klass == nullptr || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2429 }
2430
2431 if (!do_null && !do_update) {
2432 return result;
2433 }
2434
2435 ciKlass* exact_signature_k = nullptr;
2436 if (do_update) {
2437 // Is the type from the signature exact (the only one possible)?
2438 exact_signature_k = signature_at_call_k->exact_klass();
2439 if (exact_signature_k == nullptr) {
2440 exact_signature_k = comp->cha_exact_type(signature_at_call_k);
2441 } else {
2442 result = exact_signature_k;
2443 // Known statically. No need to emit any code: prevent
2444 // LIR_Assembler::emit_profile_type() from emitting useless code
2445 profiled_k = ciTypeEntries::with_status(result, profiled_k);
2446 }
2447 // exact_klass and exact_signature_k can be both non null but
2448 // different if exact_klass is loaded after the ciObject for
2449 // exact_signature_k is created.
2450 if (exact_klass == nullptr && exact_signature_k != nullptr && exact_klass != exact_signature_k) {
2451 // sometimes the type of the signature is better than the best type
2452 // the compiler has
2453 exact_klass = exact_signature_k;
2454 }
2455 if (callee_signature_k != nullptr &&
2456 callee_signature_k != signature_at_call_k) {
2457 ciKlass* improved_klass = callee_signature_k->exact_klass();
2458 if (improved_klass == nullptr) {
2459 improved_klass = comp->cha_exact_type(callee_signature_k);
2460 }
2461 if (exact_klass == nullptr && improved_klass != nullptr && exact_klass != improved_klass) {
2462 exact_klass = exact_signature_k;
2463 }
2464 }
2465 do_update = exact_klass == nullptr || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2466 }
2467
2468 if (!do_null && !do_update) {
2469 return result;
2470 }
2471
2472 if (mdp == LIR_OprFact::illegalOpr) {
2473 mdp = new_register(T_METADATA);
2474 __ metadata2reg(md->constant_encoding(), mdp);
2475 if (md_base_offset != 0) {
2476 LIR_Address* base_type_address = new LIR_Address(mdp, md_base_offset, T_ADDRESS);
2477 mdp = new_pointer_register();
2478 __ leal(LIR_OprFact::address(base_type_address), mdp);
2479 }
2480 }
2481 LIRItem value(obj, this);
2482 value.load_item();
2483 __ profile_type(new LIR_Address(mdp, md_offset, T_METADATA),
2484 value.result(), exact_klass, profiled_k, new_pointer_register(), not_null, exact_signature_k != nullptr);
2485 return result;
2486 }
2487
2501 assert(!src->is_illegal(), "check");
2502 BasicType t = src->type();
2503 if (is_reference_type(t)) {
2504 intptr_t profiled_k = parameters->type(j);
2505 Local* local = x->state()->local_at(java_index)->as_Local();
2506 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
2507 in_bytes(ParametersTypeData::type_offset(j)) - in_bytes(ParametersTypeData::type_offset(0)),
2508 profiled_k, local, mdp, false, local->declared_type()->as_klass(), nullptr);
2509 // If the profile is known statically set it once for all and do not emit any code
2510 if (exact != nullptr) {
2511 md->set_parameter_type(j, exact);
2512 }
2513 j++;
2514 }
2515 java_index += type2size[t];
2516 }
2517 }
2518 }
2519 }
2520
2521 void LIRGenerator::do_Base(Base* x) {
2522 __ std_entry(LIR_OprFact::illegalOpr);
2523 // Emit moves from physical registers / stack slots to virtual registers
2524 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2525 IRScope* irScope = compilation()->hir()->top_scope();
2526 int java_index = 0;
2527 for (int i = 0; i < args->length(); i++) {
2528 LIR_Opr src = args->at(i);
2529 assert(!src->is_illegal(), "check");
2530 BasicType t = src->type();
2531
2532 // Types which are smaller than int are passed as int, so
2533 // correct the type which passed.
2534 switch (t) {
2535 case T_BYTE:
2536 case T_BOOLEAN:
2537 case T_SHORT:
2538 case T_CHAR:
2539 t = T_INT;
2540 break;
2542 break;
2543 }
2544
2545 LIR_Opr dest = new_register(t);
2546 __ move(src, dest);
2547
2548 // Assign new location to Local instruction for this local
2549 Local* local = x->state()->local_at(java_index)->as_Local();
2550 assert(local != nullptr, "Locals for incoming arguments must have been created");
2551 #ifndef __SOFTFP__
2552 // The java calling convention passes double as long and float as int.
2553 assert(as_ValueType(t)->tag() == local->type()->tag(), "check");
2554 #endif // __SOFTFP__
2555 local->set_operand(dest);
2556 #ifdef ASSERT
2557 _instruction_for_operand.at_put_grow(dest->vreg_number(), local, nullptr);
2558 #endif
2559 java_index += type2size[t];
2560 }
2561
2562 if (compilation()->env()->dtrace_method_probes()) {
2563 BasicTypeList signature;
2564 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
2565 signature.append(T_METADATA); // Method*
2566 LIR_OprList* args = new LIR_OprList();
2567 args->append(getThreadPointer());
2568 LIR_Opr meth = new_register(T_METADATA);
2569 __ metadata2reg(method()->constant_encoding(), meth);
2570 args->append(meth);
2571 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), voidType, nullptr);
2572 }
2573
2574 if (method()->is_synchronized()) {
2575 LIR_Opr obj;
2576 if (method()->is_static()) {
2577 obj = new_register(T_OBJECT);
2578 __ oop2reg(method()->holder()->java_mirror()->constant_encoding(), obj);
2579 } else {
2580 Local* receiver = x->state()->local_at(0)->as_Local();
2581 assert(receiver != nullptr, "must already exist");
2583 }
2584 assert(obj->is_valid(), "must be valid");
2585
2586 if (method()->is_synchronized()) {
2587 LIR_Opr lock = syncLockOpr();
2588 __ load_stack_address_monitor(0, lock);
2589
2590 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), nullptr, x->check_flag(Instruction::DeoptimizeOnException));
2591 CodeStub* slow_path = new MonitorEnterStub(obj, lock, info);
2592
2593 // receiver is guaranteed non-null so don't need CodeEmitInfo
2594 __ lock_object(syncTempOpr(), obj, lock, new_register(T_OBJECT), slow_path, nullptr);
2595 }
2596 }
2597 // increment invocation counters if needed
2598 if (!method()->is_accessor()) { // Accessors do not have MDOs, so no counting.
2599 profile_parameters(x);
2600 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), nullptr, false);
2601 increment_invocation_counter(info);
2602 }
2603
2604 // all blocks with a successor must end with an unconditional jump
2605 // to the successor even if they are consecutive
2606 __ jump(x->default_sux());
2607 }
2608
2609
2610 void LIRGenerator::do_OsrEntry(OsrEntry* x) {
2611 // construct our frame and model the production of incoming pointer
2612 // to the OSR buffer.
2613 __ osr_entry(LIR_Assembler::osrBufferPointer());
2614 LIR_Opr result = rlock_result(x);
2615 __ move(LIR_Assembler::osrBufferPointer(), result);
2616 }
2617
2618
2619 void LIRGenerator::invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list) {
2620 assert(args->length() == arg_list->length(),
2621 "args=%d, arg_list=%d", args->length(), arg_list->length());
2622 for (int i = x->has_receiver() ? 1 : 0; i < args->length(); i++) {
2623 LIRItem* param = args->at(i);
2624 LIR_Opr loc = arg_list->at(i);
2625 if (loc->is_register()) {
2626 param->load_item_force(loc);
2627 } else {
2628 LIR_Address* addr = loc->as_address_ptr();
2629 param->load_for_store(addr->type());
2630 if (addr->type() == T_OBJECT) {
2631 __ move_wide(param->result(), addr);
2632 } else
2633 __ move(param->result(), addr);
2634 }
2635 }
2636
2637 if (x->has_receiver()) {
2638 LIRItem* receiver = args->at(0);
2639 LIR_Opr loc = arg_list->at(0);
2640 if (loc->is_register()) {
2641 receiver->load_item_force(loc);
2642 } else {
2643 assert(loc->is_address(), "just checking");
2644 receiver->load_for_store(T_OBJECT);
2645 __ move_wide(receiver->result(), loc->as_address_ptr());
2646 }
2647 }
2648 }
2649
2650
2651 // Visits all arguments, returns appropriate items without loading them
2652 LIRItemList* LIRGenerator::invoke_visit_arguments(Invoke* x) {
2653 LIRItemList* argument_items = new LIRItemList();
2654 if (x->has_receiver()) {
2761 __ move(tmp, reg);
2762 }
2763
2764
2765
2766 // Code for : x->x() {x->cond()} x->y() ? x->tval() : x->fval()
2767 void LIRGenerator::do_IfOp(IfOp* x) {
2768 #ifdef ASSERT
2769 {
2770 ValueTag xtag = x->x()->type()->tag();
2771 ValueTag ttag = x->tval()->type()->tag();
2772 assert(xtag == intTag || xtag == objectTag, "cannot handle others");
2773 assert(ttag == addressTag || ttag == intTag || ttag == objectTag || ttag == longTag, "cannot handle others");
2774 assert(ttag == x->fval()->type()->tag(), "cannot handle others");
2775 }
2776 #endif
2777
2778 LIRItem left(x->x(), this);
2779 LIRItem right(x->y(), this);
2780 left.load_item();
2781 if (can_inline_as_constant(right.value())) {
2782 right.dont_load_item();
2783 } else {
2784 right.load_item();
2785 }
2786
2787 LIRItem t_val(x->tval(), this);
2788 LIRItem f_val(x->fval(), this);
2789 t_val.dont_load_item();
2790 f_val.dont_load_item();
2791 LIR_Opr reg = rlock_result(x);
2792
2793 __ cmp(lir_cond(x->cond()), left.result(), right.result());
2794 __ cmove(lir_cond(x->cond()), t_val.result(), f_val.result(), reg, as_BasicType(x->x()->type()));
2795 }
2796
2797 void LIRGenerator::do_RuntimeCall(address routine, Intrinsic* x) {
2798 assert(x->number_of_arguments() == 0, "wrong type");
2799 // Enforce computation of _reserved_argument_area_size which is required on some platforms.
2800 BasicTypeList signature;
2801 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
2802 LIR_Opr reg = result_register_for(x->type());
2803 __ call_runtime_leaf(routine, getThreadTemp(),
2804 reg, new LIR_OprList());
2805 LIR_Opr result = rlock_result(x);
2806 __ move(reg, result);
2807 }
2808
2809
2810
2811 void LIRGenerator::do_Intrinsic(Intrinsic* x) {
2812 switch (x->id()) {
2813 case vmIntrinsics::_intBitsToFloat :
2814 case vmIntrinsics::_doubleToRawLongBits :
3049 if (x->recv() != nullptr || x->nb_profiled_args() > 0) {
3050 profile_parameters_at_call(x);
3051 }
3052
3053 if (x->recv() != nullptr) {
3054 LIRItem value(x->recv(), this);
3055 value.load_item();
3056 recv = new_register(T_OBJECT);
3057 __ move(value.result(), recv);
3058 }
3059 __ profile_call(x->method(), x->bci_of_invoke(), x->callee(), mdo, recv, tmp, x->known_holder());
3060 }
3061
3062 void LIRGenerator::do_ProfileReturnType(ProfileReturnType* x) {
3063 int bci = x->bci_of_invoke();
3064 ciMethodData* md = x->method()->method_data_or_null();
3065 assert(md != nullptr, "Sanity");
3066 ciProfileData* data = md->bci_to_data(bci);
3067 if (data != nullptr) {
3068 assert(data->is_CallTypeData() || data->is_VirtualCallTypeData(), "wrong profile data type");
3069 ciReturnTypeEntry* ret = data->is_CallTypeData() ? ((ciCallTypeData*)data)->ret() : ((ciVirtualCallTypeData*)data)->ret();
3070 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3071
3072 bool ignored_will_link;
3073 ciSignature* signature_at_call = nullptr;
3074 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3075
3076 // The offset within the MDO of the entry to update may be too large
3077 // to be used in load/store instructions on some platforms. So have
3078 // profile_type() compute the address of the profile in a register.
3079 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(data, ret->type_offset()), 0,
3080 ret->type(), x->ret(), mdp,
3081 !x->needs_null_check(),
3082 signature_at_call->return_type()->as_klass(),
3083 x->callee()->signature()->return_type()->as_klass());
3084 if (exact != nullptr) {
3085 md->set_return_type(bci, exact);
3086 }
3087 }
3088 }
3089
3090 void LIRGenerator::do_ProfileInvoke(ProfileInvoke* x) {
3091 // We can safely ignore accessors here, since c2 will inline them anyway,
3092 // accessors are also always mature.
3093 if (!x->inlinee()->is_accessor()) {
3094 CodeEmitInfo* info = state_for(x, x->state(), true);
3095 // Notify the runtime very infrequently only to take care of counter overflows
3096 int freq_log = Tier23InlineeNotifyFreqLog;
3097 double scale;
3098 if (_method->has_option_value(CompileCommandEnum::CompileThresholdScaling, scale)) {
3099 freq_log = CompilerConfig::scaled_freq_log(freq_log, scale);
3100 }
3101 increment_event_counter_impl(info, x->inlinee(), LIR_OprFact::intConst(InvocationCounter::count_increment), right_n_bits(freq_log), InvocationEntryBci, false, true);
3102 }
3103 }
3104
3105 void LIRGenerator::increment_backedge_counter_conditionally(LIR_Condition cond, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info, int left_bci, int right_bci, int bci) {
3106 if (compilation()->is_profiling()) {
3107 #if defined(X86) && !defined(_LP64)
3108 // BEWARE! On 32-bit x86 cmp clobbers its left argument so we need a temp copy.
3109 LIR_Opr left_copy = new_register(left->type());
|
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 "c1/c1_Compilation.hpp"
26 #include "c1/c1_Defs.hpp"
27 #include "c1/c1_FrameMap.hpp"
28 #include "c1/c1_Instruction.hpp"
29 #include "c1/c1_LIRAssembler.hpp"
30 #include "c1/c1_LIRGenerator.hpp"
31 #include "c1/c1_ValueStack.hpp"
32 #include "ci/ciArrayKlass.hpp"
33 #include "ci/ciFlatArrayKlass.hpp"
34 #include "ci/ciInlineKlass.hpp"
35 #include "ci/ciInstance.hpp"
36 #include "ci/ciObjArray.hpp"
37 #include "ci/ciObjArrayKlass.hpp"
38 #include "ci/ciUtilities.hpp"
39 #include "compiler/compilerDefinitions.inline.hpp"
40 #include "compiler/compilerOracle.hpp"
41 #include "gc/shared/barrierSet.hpp"
42 #include "gc/shared/c1/barrierSetC1.hpp"
43 #include "oops/klass.inline.hpp"
44 #include "oops/methodCounters.hpp"
45 #include "runtime/arguments.hpp"
46 #include "runtime/sharedRuntime.hpp"
47 #include "runtime/stubRoutines.hpp"
48 #include "runtime/vm_version.hpp"
49 #include "utilities/bitMap.inline.hpp"
50 #include "utilities/macros.hpp"
51 #include "utilities/powerOfTwo.hpp"
52
53 #ifdef ASSERT
54 #define __ gen()->lir(__FILE__, __LINE__)->
55 #else
56 #define __ gen()->lir()->
57 #endif
58
59 #ifndef PATCHED_ADDR
60 #define PATCHED_ADDR (max_jint)
61 #endif
62
63 void PhiResolverState::reset() {
64 _virtual_operands.clear();
65 _other_operands.clear();
202 }
203
204
205 //--------------------------------------------------------------
206 // LIRItem
207
208 void LIRItem::set_result(LIR_Opr opr) {
209 assert(value()->operand()->is_illegal() || value()->operand()->is_constant(), "operand should never change");
210 value()->set_operand(opr);
211
212 #ifdef ASSERT
213 if (opr->is_virtual()) {
214 _gen->_instruction_for_operand.at_put_grow(opr->vreg_number(), value(), nullptr);
215 }
216 #endif
217
218 _result = opr;
219 }
220
221 void LIRItem::load_item() {
222 assert(!_gen->in_conditional_code(), "LIRItem cannot be loaded in conditional code");
223
224 if (result()->is_illegal()) {
225 // update the items result
226 _result = value()->operand();
227 }
228 if (!result()->is_register()) {
229 LIR_Opr reg = _gen->new_register(value()->type());
230 __ move(result(), reg);
231 if (result()->is_constant()) {
232 _result = reg;
233 } else {
234 set_result(reg);
235 }
236 }
237 }
238
239
240 void LIRItem::load_for_store(BasicType type) {
241 if (_gen->can_store_as_constant(value(), type)) {
242 _result = value()->operand();
243 if (!_result->is_constant()) {
611 assert(right_op != result_op, "malformed");
612 __ move(left_op, result_op);
613 left_op = result_op;
614 }
615
616 switch(code) {
617 case Bytecodes::_iand:
618 case Bytecodes::_land: __ logical_and(left_op, right_op, result_op); break;
619
620 case Bytecodes::_ior:
621 case Bytecodes::_lor: __ logical_or(left_op, right_op, result_op); break;
622
623 case Bytecodes::_ixor:
624 case Bytecodes::_lxor: __ logical_xor(left_op, right_op, result_op); break;
625
626 default: ShouldNotReachHere();
627 }
628 }
629
630
631 void LIRGenerator::monitor_enter(LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, LIR_Opr scratch, int monitor_no,
632 CodeEmitInfo* info_for_exception, CodeEmitInfo* info, CodeStub* throw_ie_stub) {
633 // for slow path, use debug info for state after successful locking
634 CodeStub* slow_path = new MonitorEnterStub(object, lock, info, throw_ie_stub, scratch);
635 __ load_stack_address_monitor(monitor_no, lock);
636 // for handling NullPointerException, use debug info representing just the lock stack before this monitorenter
637 __ lock_object(hdr, object, lock, scratch, slow_path, info_for_exception, throw_ie_stub);
638 }
639
640
641 void LIRGenerator::monitor_exit(LIR_Opr object, LIR_Opr lock, LIR_Opr new_hdr, LIR_Opr scratch, int monitor_no) {
642 // setup registers
643 LIR_Opr hdr = lock;
644 lock = new_hdr;
645 CodeStub* slow_path = new MonitorExitStub(lock, monitor_no);
646 __ load_stack_address_monitor(monitor_no, lock);
647 __ unlock_object(hdr, object, lock, scratch, slow_path);
648 }
649
650 #ifndef PRODUCT
651 void LIRGenerator::print_if_not_loaded(const NewInstance* new_instance) {
652 if (PrintNotLoaded && !new_instance->klass()->is_loaded()) {
653 tty->print_cr(" ###class not loaded at new bci %d", new_instance->printable_bci());
654 } else if (PrintNotLoaded && (!CompilerConfig::is_c1_only() && new_instance->is_unresolved())) {
655 tty->print_cr(" ###class not resolved at new bci %d", new_instance->printable_bci());
656 }
657 }
658 #endif
659
660 void LIRGenerator::new_instance(LIR_Opr dst, ciInstanceKlass* klass, bool is_unresolved, bool allow_inline, LIR_Opr scratch1, LIR_Opr scratch2, LIR_Opr scratch3, LIR_Opr scratch4, LIR_Opr klass_reg, CodeEmitInfo* info) {
661 if (allow_inline) {
662 assert(!is_unresolved && klass->is_loaded(), "inline type klass should be resolved");
663 __ metadata2reg(klass->constant_encoding(), klass_reg);
664 } else {
665 klass2reg_with_patching(klass_reg, klass, info, is_unresolved);
666 }
667 // If klass is not loaded we do not know if the klass has finalizers or is an unexpected inline klass
668 if (UseFastNewInstance && klass->is_loaded() && (allow_inline || !klass->is_inlinetype())
669 && !Klass::layout_helper_needs_slow_path(klass->layout_helper())) {
670
671 StubId stub_id = klass->is_initialized() ? StubId::c1_fast_new_instance_id : StubId::c1_fast_new_instance_init_check_id;
672
673 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, stub_id);
674
675 assert(klass->is_loaded(), "must be loaded");
676 // allocate space for instance
677 assert(klass->size_helper() > 0, "illegal instance size");
678 const int instance_size = align_object_size(klass->size_helper());
679 __ allocate_object(dst, scratch1, scratch2, scratch3, scratch4,
680 oopDesc::header_size(), instance_size, klass_reg, !klass->is_initialized(), slow_path);
681 } else {
682 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, StubId::c1_new_instance_id);
683 __ jump(slow_path);
684 __ branch_destination(slow_path->continuation());
685 }
686 }
687
688
689 static bool is_constant_zero(Instruction* inst) {
690 IntConstant* c = inst->type()->as_IntConstant();
691 if (c) {
692 return (c->value() == 0);
693 }
694 return false;
695 }
696
697
698 static bool positive_constant(Instruction* inst) {
699 IntConstant* c = inst->type()->as_IntConstant();
700 if (c) {
701 return (c->value() >= 0);
702 }
703 return false;
755 } else if (dst_exact_type != nullptr && dst_exact_type->is_obj_array_klass()) {
756 ciArrayKlass* dst_type = (ciArrayKlass*) dst_exact_type;
757 ciArrayKlass* src_type = nullptr;
758 if (src_exact_type != nullptr && src_exact_type->is_obj_array_klass()) {
759 src_type = (ciArrayKlass*) src_exact_type;
760 } else if (src_declared_type != nullptr && src_declared_type->is_obj_array_klass()) {
761 src_type = (ciArrayKlass*) src_declared_type;
762 }
763 if (src_type != nullptr) {
764 if (src_type->element_type()->is_subtype_of(dst_type->element_type())) {
765 is_exact = true;
766 expected_type = dst_type;
767 }
768 }
769 }
770 // at least pass along a good guess
771 if (expected_type == nullptr) expected_type = dst_exact_type;
772 if (expected_type == nullptr) expected_type = src_declared_type;
773 if (expected_type == nullptr) expected_type = dst_declared_type;
774
775 if (expected_type != nullptr && expected_type->is_obj_array_klass()) {
776 // For a direct pointer comparison, we need the refined array klass pointer
777 expected_type = ciObjArrayKlass::make(expected_type->as_array_klass()->element_klass());
778 }
779
780 src_objarray = (src_exact_type && src_exact_type->is_obj_array_klass()) || (src_declared_type && src_declared_type->is_obj_array_klass());
781 dst_objarray = (dst_exact_type && dst_exact_type->is_obj_array_klass()) || (dst_declared_type && dst_declared_type->is_obj_array_klass());
782 }
783
784 // if a probable array type has been identified, figure out if any
785 // of the required checks for a fast case can be elided.
786 int flags = LIR_OpArrayCopy::all_flags;
787
788 // TODO 8251971 Compare ArrayKlass::properties() of source and destination
789 // array here instead, see also LIR_Assembler::arraycopy_inlinetype_check
790 if (!src->is_loaded_flat_array() && !dst->is_loaded_flat_array()) {
791 flags &= ~LIR_OpArrayCopy::always_slow_path;
792 }
793 if (!src->maybe_flat_array()) {
794 flags &= ~LIR_OpArrayCopy::src_inlinetype_check;
795 }
796 if (!dst->maybe_flat_array() && !dst->maybe_null_free_array()) {
797 flags &= ~LIR_OpArrayCopy::dst_inlinetype_check;
798 }
799
800 if (!src_objarray)
801 flags &= ~LIR_OpArrayCopy::src_objarray;
802 if (!dst_objarray)
803 flags &= ~LIR_OpArrayCopy::dst_objarray;
804
805 if (!x->arg_needs_null_check(0))
806 flags &= ~LIR_OpArrayCopy::src_null_check;
807 if (!x->arg_needs_null_check(2))
808 flags &= ~LIR_OpArrayCopy::dst_null_check;
809
810
811 if (expected_type != nullptr) {
812 Value length_limit = nullptr;
813
814 IfOp* ifop = length->as_IfOp();
815 if (ifop != nullptr) {
816 // look for expressions like min(v, a.length) which ends up as
817 // x > y ? y : x or x >= y ? y : x
818 if ((ifop->cond() == If::gtr || ifop->cond() == If::geq) &&
819 ifop->x() == ifop->fval() &&
1472 }
1473 return _vreg_flags.at(vreg_num, f);
1474 }
1475
1476
1477 // Block local constant handling. This code is useful for keeping
1478 // unpinned constants and constants which aren't exposed in the IR in
1479 // registers. Unpinned Constant instructions have their operands
1480 // cleared when the block is finished so that other blocks can't end
1481 // up referring to their registers.
1482
1483 LIR_Opr LIRGenerator::load_constant(Constant* x) {
1484 assert(!x->is_pinned(), "only for unpinned constants");
1485 _unpinned_constants.append(x);
1486 return load_constant(LIR_OprFact::value_type(x->type())->as_constant_ptr());
1487 }
1488
1489
1490 LIR_Opr LIRGenerator::load_constant(LIR_Const* c) {
1491 BasicType t = c->type();
1492 for (int i = 0; i < _constants.length() && !in_conditional_code(); i++) {
1493 LIR_Const* other = _constants.at(i);
1494 if (t == other->type()) {
1495 switch (t) {
1496 case T_INT:
1497 case T_FLOAT:
1498 if (c->as_jint_bits() != other->as_jint_bits()) continue;
1499 break;
1500 case T_LONG:
1501 case T_DOUBLE:
1502 if (c->as_jint_hi_bits() != other->as_jint_hi_bits()) continue;
1503 if (c->as_jint_lo_bits() != other->as_jint_lo_bits()) continue;
1504 break;
1505 case T_OBJECT:
1506 if (c->as_jobject() != other->as_jobject()) continue;
1507 break;
1508 default:
1509 break;
1510 }
1511 return _reg_for_constants.at(i);
1512 }
1513 }
1514
1515 LIR_Opr result = new_register(t);
1516 __ move((LIR_Opr)c, result);
1517 if (!in_conditional_code()) {
1518 _constants.append(c);
1519 _reg_for_constants.append(result);
1520 }
1521 return result;
1522 }
1523
1524 void LIRGenerator::set_in_conditional_code(bool v) {
1525 assert(v != _in_conditional_code, "must change state");
1526 _in_conditional_code = v;
1527 }
1528
1529
1530 //------------------------field access--------------------------------------
1531
1532 void LIRGenerator::do_CompareAndSwap(Intrinsic* x, ValueType* type) {
1533 assert(x->number_of_arguments() == 4, "wrong type");
1534 LIRItem obj (x->argument_at(0), this); // object
1535 LIRItem offset(x->argument_at(1), this); // offset of field
1536 LIRItem cmp (x->argument_at(2), this); // value to compare with field
1537 LIRItem val (x->argument_at(3), this); // replace field with val if matches cmp
1538 assert(obj.type()->tag() == objectTag, "invalid type");
1539 assert(cmp.type()->tag() == type->tag(), "invalid type");
1540 assert(val.type()->tag() == type->tag(), "invalid type");
1541
1542 LIR_Opr result = access_atomic_cmpxchg_at(IN_HEAP, as_BasicType(type),
1543 obj, offset, cmp, val);
1544 set_result(x, result);
1545 }
1546
1547 // Returns an int/long value with the null marker bit set.
1548 static LIR_Opr null_marker_mask(BasicType bt, int nm_offset) {
1549 assert(nm_offset >= 0, "field does not have null marker");
1550 jlong null_marker = 1ULL << (nm_offset << LogBitsPerByte);
1551 return (bt == T_LONG) ? LIR_OprFact::longConst(null_marker) : LIR_OprFact::intConst(null_marker);
1552 }
1553
1554 static LIR_Opr null_marker_mask(BasicType bt, ciField* field) {
1555 assert(field->null_marker_offset() != -1, "field does not have null marker");
1556 return null_marker_mask(bt, field->null_marker_offset() - field->offset_in_bytes());
1557 }
1558
1559 // Comment copied form templateTable_i486.cpp
1560 // ----------------------------------------------------------------------------
1561 // Volatile variables demand their effects be made known to all CPU's in
1562 // order. Store buffers on most chips allow reads & writes to reorder; the
1563 // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of
1564 // memory barrier (i.e., it's not sufficient that the interpreter does not
1565 // reorder volatile references, the hardware also must not reorder them).
1566 //
1567 // According to the new Java Memory Model (JMM):
1568 // (1) All volatiles are serialized wrt to each other.
1569 // ALSO reads & writes act as acquire & release, so:
1570 // (2) A read cannot let unrelated NON-volatile memory refs that happen after
1571 // the read float up to before the read. It's OK for non-volatile memory refs
1572 // that happen before the volatile read to float down below it.
1573 // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs
1574 // that happen BEFORE the write float down to after the write. It's OK for
1575 // non-volatile memory refs that happen after the volatile write to float up
1576 // before it.
1577 //
1578 // We only put in barriers around volatile refs (they are expensive), not
1579 // _between_ memory refs (that would require us to track the flavor of the
1580 // previous memory refs). Requirements (2) and (3) require some barriers
1581 // before volatile stores and after volatile loads. These nearly cover
1582 // requirement (1) but miss the volatile-store-volatile-load case. This final
1583 // case is placed after volatile-stores although it could just as well go
1584 // before volatile-loads.
1585
1586
1587 void LIRGenerator::do_StoreField(StoreField* x) {
1588 ciField* field = x->field();
1589 bool needs_patching = x->needs_patching();
1590 bool is_volatile = field->is_volatile();
1591 BasicType field_type = x->field_type();
1592
1593 CodeEmitInfo* info = nullptr;
1594 if (needs_patching) {
1595 assert(x->explicit_null_check() == nullptr, "can't fold null check into patching field access");
1596 info = state_for(x, x->state_before());
1597 } else if (x->needs_null_check()) {
1598 NullCheck* nc = x->explicit_null_check();
1599 if (nc == nullptr) {
1600 info = state_for(x);
1601 } else {
1602 info = state_for(nc);
1603 }
1604 }
1605
1606 LIRItem object(x->obj(), this);
1607 LIRItem value(x->value(), this);
1608
1609 object.load_item();
1610
1611 if (field->is_flat()) {
1612 value.load_item();
1613 } else {
1614 if (is_volatile || needs_patching) {
1615 // load item if field is volatile (fewer special cases for volatiles)
1616 // load item if field not initialized
1617 // load item if field not constant
1618 // because of code patching we cannot inline constants
1619 if (field_type == T_BYTE || field_type == T_BOOLEAN) {
1620 value.load_byte_item();
1621 } else {
1622 value.load_item();
1623 }
1624 } else {
1625 value.load_for_store(field_type);
1626 }
1627 }
1628
1629 set_no_result(x);
1630
1631 #ifndef PRODUCT
1632 if (PrintNotLoaded && needs_patching) {
1633 tty->print_cr(" ###class not loaded at store_%s bci %d",
1634 x->is_static() ? "static" : "field", x->printable_bci());
1635 }
1636 #endif
1637
1638 if (x->needs_null_check() &&
1639 (needs_patching ||
1640 MacroAssembler::needs_explicit_null_check(x->offset()))) {
1641 // Emit an explicit null check because the offset is too large.
1642 // If the class is not loaded and the object is null, we need to deoptimize to throw a
1643 // NoClassDefFoundError in the interpreter instead of an implicit NPE from compiled code.
1644 __ null_check(object.result(), new CodeEmitInfo(info), /* deoptimize */ needs_patching);
1645 }
1646
1647 DecoratorSet decorators = IN_HEAP;
1648 if (is_volatile) {
1649 decorators |= MO_SEQ_CST;
1650 }
1651 if (needs_patching) {
1652 decorators |= C1_NEEDS_PATCHING;
1653 }
1654
1655 if (field->is_flat()) {
1656 ciInlineKlass* vk = field->type()->as_inline_klass();
1657
1658 #ifdef ASSERT
1659 assert(field->is_atomic(), "No atomic access required %s.%s", field->holder()->name()->as_utf8(), field->name()->as_utf8());
1660 // ZGC does not support compressed oops, so only one oop can be in the payload which is written by a "normal" oop store.
1661 assert(!vk->contains_oops() || !UseZGC, "ZGC does not support embedded oops in flat fields");
1662 #endif
1663
1664 // Zero the payload
1665 BasicType bt = vk->atomic_size_to_basic_type(field->is_null_free());
1666 LIR_Opr payload = new_register((bt == T_LONG) ? bt : T_INT);
1667 LIR_Opr zero = (bt == T_LONG) ? LIR_OprFact::longConst(0) : LIR_OprFact::intConst(0);
1668 __ move(zero, payload);
1669
1670 bool is_constant_null = value.is_constant() && value.value()->is_null_obj();
1671 if (!is_constant_null) {
1672 LabelObj* L_isNull = new LabelObj();
1673 bool needs_null_check = !value.is_constant();
1674 if (needs_null_check) {
1675 __ cmp(lir_cond_equal, value.result(), LIR_OprFact::oopConst(nullptr));
1676 __ branch(lir_cond_equal, L_isNull->label());
1677 }
1678 // Load payload (if not empty) and set null marker (if not null-free)
1679 if (!vk->is_empty()) {
1680 access_load_at(decorators, bt, value, LIR_OprFact::intConst(vk->payload_offset()), payload);
1681 }
1682 if (!field->is_null_free()) {
1683 __ logical_or(payload, null_marker_mask(bt, field), payload);
1684 }
1685 if (needs_null_check) {
1686 __ branch_destination(L_isNull->label());
1687 }
1688 }
1689 access_store_at(decorators, bt, object, LIR_OprFact::intConst(x->offset()), payload,
1690 // Make sure to emit an implicit null check and pass the information
1691 // that this is a flat store that might require gc barriers for oop fields.
1692 info != nullptr ? new CodeEmitInfo(info) : nullptr, info, vk);
1693 return;
1694 }
1695
1696 access_store_at(decorators, field_type, object, LIR_OprFact::intConst(x->offset()),
1697 value.result(), info != nullptr ? new CodeEmitInfo(info) : nullptr, info);
1698 }
1699
1700 // Wrap an already computed address register as a C1 Instruction so it
1701 // can be passed as LIRItem into access_load_at() / access_store_at().
1702 class ComputedAddressValue: public Instruction {
1703 public:
1704 ComputedAddressValue(ValueType* type, LIR_Opr addr) : Instruction(type) {
1705 set_operand(addr);
1706 }
1707 virtual void input_values_do(ValueVisitor*) {}
1708 virtual void visit(InstructionVisitor* v) {}
1709 virtual const char* name() const { return "ComputedAddressValue"; }
1710 };
1711
1712 LIR_Opr LIRGenerator::get_and_load_element_address(LIRItem& array, LIRItem& index) {
1713 #ifndef _LP64
1714 // We need to be careful with overflows in 32-bit arithmetic
1715 Unimplemented();
1716 #endif
1717 ciType* array_type = array.value()->declared_type();
1718 ciFlatArrayKlass* flat_array_klass = array_type->as_flat_array_klass();
1719 assert(flat_array_klass->is_loaded(), "must be");
1720
1721 int array_header_size = flat_array_klass->array_header_in_bytes();
1722 int shift = flat_array_klass->log2_element_size();
1723
1724 LIR_Opr index_op = new_register(T_LONG);
1725 if (index.result()->is_constant()) {
1726 jint const_index = index.result()->as_jint();
1727 __ move(LIR_OprFact::longConst(static_cast<jlong>(const_index) << shift), index_op);
1728 } else {
1729 __ convert(Bytecodes::_i2l, index.result(), index_op);
1730 // Need to shift manually, as LIR_Address can scale only up to 3.
1731 __ shift_left(index_op, shift, index_op);
1732 }
1733
1734 LIR_Opr elm_op = new_pointer_register();
1735 LIR_Address* elm_address = generate_address(array.result(), index_op, 0, array_header_size, T_ADDRESS);
1736 __ leal(LIR_OprFact::address(elm_address), elm_op);
1737 return elm_op;
1738 }
1739
1740 void LIRGenerator::access_sub_element(LIRItem& array, LIRItem& index, LIR_Opr& result, ciField* field, size_t sub_offset) {
1741 assert(field != nullptr, "Need a subelement type specified");
1742
1743 // Find the starting address of the source (inside the array)
1744 LIR_Opr elm_op = get_and_load_element_address(array, index);
1745
1746 BasicType subelt_type = field->type()->basic_type();
1747 ComputedAddressValue* elm_resolved_addr = new ComputedAddressValue(as_ValueType(subelt_type), elm_op);
1748 LIRItem elm_item(elm_resolved_addr, this);
1749
1750 DecoratorSet decorators = IN_HEAP;
1751 access_load_at(decorators, subelt_type,
1752 elm_item, LIR_OprFact::longConst(sub_offset), result,
1753 nullptr, nullptr);
1754 }
1755
1756 LIR_Opr LIRGenerator::access_flat_array(bool is_load, LIRItem& array, LIRItem& index, LIRItem& obj_item,
1757 ciField* field, size_t sub_offset) {
1758 assert(sub_offset == 0 || field != nullptr, "Sanity check");
1759
1760 // Find the starting address of the source (inside the array)
1761 LIR_Opr elm_op = get_and_load_element_address(array, index);
1762
1763 ciFlatArrayKlass* array_klass = array.value()->declared_type()->as_flat_array_klass();
1764 ciInlineKlass* elem_klass = nullptr;
1765 if (field != nullptr) {
1766 elem_klass = field->type()->as_inline_klass();
1767 } else {
1768 elem_klass = array_klass->element_klass()->as_inline_klass();
1769 }
1770
1771 bool null_free = array_klass->is_elem_null_free();
1772 bool atomic = array_klass->is_elem_atomic();
1773 assert(null_free || atomic, "nullable flat arrays must use an atomic layout");
1774 if (atomic) {
1775 assert(field == nullptr && sub_offset == 0, "delayed sub-element access is only supported for non-atomic arrays");
1776 BasicType bt = elem_klass->atomic_size_to_basic_type(null_free);
1777 LIR_Opr payload = new_register((bt == T_LONG) ? bt : T_INT);
1778 ComputedAddressValue* elm_resolved_addr = new ComputedAddressValue(as_ValueType(bt), elm_op);
1779 LIRItem elm_item(elm_resolved_addr, this);
1780 DecoratorSet decorators = IN_HEAP;
1781 if (is_load) {
1782 access_load_at(decorators, bt, elm_item, LIR_OprFact::intConst(0), payload, nullptr, nullptr);
1783 access_store_at(decorators, bt, obj_item, LIR_OprFact::intConst(elem_klass->payload_offset()), payload,
1784 nullptr, nullptr, elem_klass);
1785 // Null check is performed in the caller
1786 } else {
1787 // Zero the payload
1788 LIR_Opr zero = (bt == T_LONG) ? LIR_OprFact::longConst(0) : LIR_OprFact::intConst(0);
1789 __ move(zero, payload);
1790
1791 if (null_free) {
1792 if (!elem_klass->is_empty()) {
1793 access_load_at(decorators, bt, obj_item, LIR_OprFact::intConst(elem_klass->payload_offset()), payload);
1794 }
1795 } else {
1796 bool is_constant_null = obj_item.is_constant() && obj_item.value()->is_null_obj();
1797 if (!is_constant_null) {
1798 LabelObj* L_isNull = new LabelObj();
1799 bool needs_null_check = !obj_item.is_constant();
1800 if (needs_null_check) {
1801 __ cmp(lir_cond_equal, obj_item.result(), LIR_OprFact::oopConst(nullptr));
1802 __ branch(lir_cond_equal, L_isNull->label());
1803 }
1804 // Load payload (if not empty) and set null marker.
1805 if (!elem_klass->is_empty()) {
1806 access_load_at(decorators, bt, obj_item, LIR_OprFact::intConst(elem_klass->payload_offset()), payload);
1807 }
1808 __ logical_or(payload, null_marker_mask(bt, elem_klass->null_marker_offset_in_payload()), payload);
1809 if (needs_null_check) {
1810 __ branch_destination(L_isNull->label());
1811 }
1812 }
1813 }
1814 access_store_at(decorators, bt, elm_item, LIR_OprFact::intConst(0), payload, nullptr, nullptr, elem_klass);
1815 }
1816 return payload;
1817 }
1818
1819 for (int i = 0; i < elem_klass->nof_nonstatic_fields(); i++) {
1820 ciField* inner_field = elem_klass->nonstatic_field_at(i);
1821 assert(!inner_field->is_flat(), "flat fields must have been expanded");
1822 int obj_offset = inner_field->offset_in_bytes();
1823 size_t elm_offset = obj_offset - elem_klass->payload_offset() + sub_offset; // object header is not stored in array.
1824 BasicType field_type = inner_field->type()->basic_type();
1825
1826 // Types which are smaller than int are still passed in an int register.
1827 BasicType reg_type = field_type;
1828 switch (reg_type) {
1829 case T_BYTE:
1830 case T_BOOLEAN:
1831 case T_SHORT:
1832 case T_CHAR:
1833 reg_type = T_INT;
1834 break;
1835 default:
1836 break;
1837 }
1838
1839 LIR_Opr temp = new_register(reg_type);
1840 ComputedAddressValue* elm_resolved_addr = new ComputedAddressValue(as_ValueType(field_type), elm_op);
1841 LIRItem elm_item(elm_resolved_addr, this);
1842
1843 DecoratorSet decorators = IN_HEAP;
1844 if (is_load) {
1845 access_load_at(decorators, field_type,
1846 elm_item, LIR_OprFact::longConst(elm_offset), temp,
1847 nullptr, nullptr);
1848 access_store_at(decorators, field_type,
1849 obj_item, LIR_OprFact::intConst(obj_offset), temp,
1850 nullptr, nullptr);
1851 } else {
1852 access_load_at(decorators, field_type,
1853 obj_item, LIR_OprFact::intConst(obj_offset), temp,
1854 nullptr, nullptr);
1855 access_store_at(decorators, field_type,
1856 elm_item, LIR_OprFact::longConst(elm_offset), temp,
1857 nullptr, nullptr);
1858 }
1859 }
1860 return LIR_OprFact::illegalOpr;
1861 }
1862
1863 void LIRGenerator::check_flat_array(LIR_Opr array, CodeStub* slow_path) {
1864 LIR_Opr tmp = new_register(T_METADATA);
1865 __ check_flat_array(array, tmp, slow_path);
1866 }
1867
1868 void LIRGenerator::check_null_free_array(LIRItem& array, LIRItem& value, CodeEmitInfo* info) {
1869 LabelObj* L_end = new LabelObj();
1870 LIR_Opr tmp = new_register(T_METADATA);
1871 __ check_null_free_array(array.result(), tmp);
1872 #ifdef RISCV
1873 // tmp is used to hold the result of null free array check on riscv
1874 // See LIR_Assembler::emit_opNullFreeArrayCheck
1875 __ cmp(lir_cond_equal, tmp, LIR_OprFact::metadataConst(nullptr));
1876 #endif
1877 __ branch(lir_cond_equal, L_end->label());
1878 __ null_check(value.result(), info);
1879 __ branch_destination(L_end->label());
1880 }
1881
1882 bool LIRGenerator::needs_flat_array_store_check(StoreIndexed* x) {
1883 if (x->elt_type() == T_OBJECT && x->array()->maybe_flat_array()) {
1884 ciType* type = x->value()->declared_type();
1885 if (type != nullptr && type->is_klass()) {
1886 ciKlass* klass = type->as_klass();
1887 if (!klass->can_be_inline_klass() || (klass->is_inlinetype() && !klass->as_inline_klass()->maybe_flat_in_array())) {
1888 // This is known to be a non-flat object. If the array is a flat array,
1889 // it will be caught by the code generated by array_store_check().
1890 return false;
1891 }
1892 }
1893 // We're not 100% sure, so let's do the flat_array_store_check.
1894 return true;
1895 }
1896 return false;
1897 }
1898
1899 bool LIRGenerator::needs_null_free_array_store_check(StoreIndexed* x) {
1900 return x->elt_type() == T_OBJECT && x->array()->maybe_null_free_array();
1901 }
1902
1903 void LIRGenerator::do_StoreIndexed(StoreIndexed* x) {
1904 assert(x->is_pinned(),"");
1905 assert(x->elt_type() != T_ARRAY, "never used");
1906 bool is_loaded_flat_array = x->array()->is_loaded_flat_array();
1907 bool needs_range_check = x->compute_needs_range_check();
1908 bool use_length = x->length() != nullptr;
1909 bool obj_store = is_reference_type(x->elt_type());
1910 bool needs_store_check = obj_store && !(is_loaded_flat_array && x->is_exact_flat_array_store()) &&
1911 (x->value()->as_Constant() == nullptr ||
1912 !get_jobject_constant(x->value())->is_null_object());
1913
1914 LIRItem array(x->array(), this);
1915 LIRItem index(x->index(), this);
1916 LIRItem value(x->value(), this);
1917 LIRItem length(this);
1918
1919 array.load_item();
1920 index.load_nonconstant();
1921
1922 if (use_length && needs_range_check) {
1923 length.set_instruction(x->length());
1924 length.load_item();
1925 }
1926
1927 if (needs_store_check || x->check_boolean()
1928 || is_loaded_flat_array || needs_flat_array_store_check(x) || needs_null_free_array_store_check(x)) {
1929 value.load_item();
1930 } else {
1931 value.load_for_store(x->elt_type());
1932 }
1933
1934 set_no_result(x);
1935
1936 // the CodeEmitInfo must be duplicated for each different
1937 // LIR-instruction because spilling can occur anywhere between two
1938 // instructions and so the debug information must be different
1939 CodeEmitInfo* range_check_info = state_for(x);
1940 CodeEmitInfo* null_check_info = nullptr;
1941 if (x->needs_null_check()) {
1942 null_check_info = new CodeEmitInfo(range_check_info);
1943 }
1944
1945 if (needs_range_check) {
1946 if (use_length) {
1947 __ cmp(lir_cond_belowEqual, length.result(), index.result());
1948 __ branch(lir_cond_belowEqual, new RangeCheckStub(range_check_info, index.result(), array.result()));
1949 } else {
1950 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
1951 // range_check also does the null check
1952 null_check_info = nullptr;
1953 }
1954 }
1955
1956 if (GenerateArrayStoreCheck && needs_store_check) {
1957 CodeEmitInfo* store_check_info = new CodeEmitInfo(range_check_info);
1958 array_store_check(value.result(), array.result(), store_check_info, x->profiled_method(), x->profiled_bci());
1959 }
1960
1961 if (x->should_profile()) {
1962 if (is_loaded_flat_array) {
1963 // No need to profile a store to a flat array of known type. This can happen if
1964 // the type only became known after optimizations (for example, after the PhiSimplifier).
1965 x->set_should_profile(false);
1966 } else {
1967 int bci = x->profiled_bci();
1968 ciMethodData* md = x->profiled_method()->method_data();
1969 assert(md != nullptr, "Sanity");
1970 ciProfileData* data = md->bci_to_data(bci);
1971 assert(data != nullptr && data->is_ArrayStoreData(), "incorrect profiling entry");
1972 ciArrayStoreData* store_data = (ciArrayStoreData*)data;
1973 profile_array_type(x, md, store_data);
1974 assert(store_data->is_ArrayStoreData(), "incorrect profiling entry");
1975 if (x->array()->maybe_null_free_array()) {
1976 profile_null_free_array(array, md, data);
1977 }
1978 }
1979 }
1980
1981 if (is_loaded_flat_array) {
1982 ciFlatArrayKlass* array_klass = x->array()->declared_type()->as_flat_array_klass();
1983 ciInlineKlass* elem_klass = array_klass->element_klass()->as_inline_klass();
1984 bool null_free = array_klass->is_elem_null_free();
1985 if (null_free && !x->value()->is_null_free()) {
1986 __ null_check(value.result(), new CodeEmitInfo(range_check_info));
1987 }
1988 // If array element is an empty null-free inline type, no need to copy anything.
1989 // Nullable empty arrays still need their null marker updated.
1990 if (!elem_klass->is_empty() || !null_free) {
1991 access_flat_array(false, array, index, value);
1992 }
1993 } else {
1994 StoreFlattenedArrayStub* slow_path = nullptr;
1995
1996 if (needs_flat_array_store_check(x)) {
1997 // Check if we indeed have a flat array
1998 index.load_item();
1999 slow_path = new StoreFlattenedArrayStub(array.result(), index.result(), value.result(), state_for(x, x->state_before()));
2000 check_flat_array(array.result(), slow_path);
2001 set_in_conditional_code(true);
2002 }
2003
2004 if (needs_null_free_array_store_check(x)) {
2005 CodeEmitInfo* info = new CodeEmitInfo(range_check_info);
2006 check_null_free_array(array, value, info);
2007 }
2008
2009 DecoratorSet decorators = IN_HEAP | IS_ARRAY;
2010 if (x->check_boolean()) {
2011 decorators |= C1_MASK_BOOLEAN;
2012 }
2013
2014 access_store_at(decorators, x->elt_type(), array, index.result(), value.result(), nullptr, null_check_info);
2015 if (slow_path != nullptr) {
2016 __ branch_destination(slow_path->continuation());
2017 set_in_conditional_code(false);
2018 }
2019 }
2020 }
2021
2022 void LIRGenerator::access_load_at(DecoratorSet decorators, BasicType type,
2023 LIRItem& base, LIR_Opr offset, LIR_Opr result,
2024 CodeEmitInfo* patch_info, CodeEmitInfo* load_emit_info) {
2025 decorators |= ACCESS_READ;
2026 LIRAccess access(this, decorators, base, offset, type, patch_info, load_emit_info);
2027 if (access.is_raw()) {
2028 _barrier_set->BarrierSetC1::load_at(access, result);
2029 } else {
2030 _barrier_set->load_at(access, result);
2031 }
2032 }
2033
2034 void LIRGenerator::access_load(DecoratorSet decorators, BasicType type,
2035 LIR_Opr addr, LIR_Opr result) {
2036 decorators |= ACCESS_READ;
2037 LIRAccess access(this, decorators, LIR_OprFact::illegalOpr, LIR_OprFact::illegalOpr, type);
2038 access.set_resolved_addr(addr);
2039 if (access.is_raw()) {
2040 _barrier_set->BarrierSetC1::load(access, result);
2041 } else {
2042 _barrier_set->load(access, result);
2043 }
2044 }
2045
2046 void LIRGenerator::access_store_at(DecoratorSet decorators, BasicType type,
2047 LIRItem& base, LIR_Opr offset, LIR_Opr value,
2048 CodeEmitInfo* patch_info, CodeEmitInfo* store_emit_info,
2049 ciInlineKlass* vk) {
2050 decorators |= ACCESS_WRITE;
2051 LIRAccess access(this, decorators, base, offset, type, patch_info, store_emit_info, vk);
2052 if (access.is_raw()) {
2053 _barrier_set->BarrierSetC1::store_at(access, value);
2054 } else {
2055 _barrier_set->store_at(access, value);
2056 }
2057 }
2058
2059 LIR_Opr LIRGenerator::access_atomic_cmpxchg_at(DecoratorSet decorators, BasicType type,
2060 LIRItem& base, LIRItem& offset, LIRItem& cmp_value, LIRItem& new_value) {
2061 decorators |= ACCESS_READ;
2062 decorators |= ACCESS_WRITE;
2063 // Atomic operations are SEQ_CST by default
2064 decorators |= ((decorators & MO_DECORATOR_MASK) == 0) ? MO_SEQ_CST : 0;
2065 LIRAccess access(this, decorators, base, offset, type);
2066 if (access.is_raw()) {
2067 return _barrier_set->BarrierSetC1::atomic_cmpxchg_at(access, cmp_value, new_value);
2068 } else {
2069 return _barrier_set->atomic_cmpxchg_at(access, cmp_value, new_value);
2070 }
2071 }
2082 } else {
2083 return _barrier_set->atomic_xchg_at(access, value);
2084 }
2085 }
2086
2087 LIR_Opr LIRGenerator::access_atomic_add_at(DecoratorSet decorators, BasicType type,
2088 LIRItem& base, LIRItem& offset, LIRItem& value) {
2089 decorators |= ACCESS_READ;
2090 decorators |= ACCESS_WRITE;
2091 // Atomic operations are SEQ_CST by default
2092 decorators |= ((decorators & MO_DECORATOR_MASK) == 0) ? MO_SEQ_CST : 0;
2093 LIRAccess access(this, decorators, base, offset, type);
2094 if (access.is_raw()) {
2095 return _barrier_set->BarrierSetC1::atomic_add_at(access, value);
2096 } else {
2097 return _barrier_set->atomic_add_at(access, value);
2098 }
2099 }
2100
2101 void LIRGenerator::do_LoadField(LoadField* x) {
2102 ciField* field = x->field();
2103 bool needs_patching = x->needs_patching();
2104 bool is_volatile = field->is_volatile();
2105 BasicType field_type = x->field_type();
2106
2107 CodeEmitInfo* info = nullptr;
2108 if (needs_patching) {
2109 assert(x->explicit_null_check() == nullptr, "can't fold null check into patching field access");
2110 info = state_for(x, x->state_before());
2111 } else if (x->needs_null_check()) {
2112 NullCheck* nc = x->explicit_null_check();
2113 if (nc == nullptr) {
2114 info = state_for(x);
2115 } else {
2116 info = state_for(nc);
2117 }
2118 }
2119
2120 LIRItem object(x->obj(), this);
2121
2122 object.load_item();
2123
2124 #ifndef PRODUCT
2135 stress_deopt)) {
2136 LIR_Opr obj = object.result();
2137 if (stress_deopt) {
2138 obj = new_register(T_OBJECT);
2139 __ move(LIR_OprFact::oopConst(nullptr), obj);
2140 }
2141 // Emit an explicit null check because the offset is too large.
2142 // If the class is not loaded and the object is null, we need to deoptimize to throw a
2143 // NoClassDefFoundError in the interpreter instead of an implicit NPE from compiled code.
2144 __ null_check(obj, new CodeEmitInfo(info), /* deoptimize */ needs_patching);
2145 }
2146
2147 DecoratorSet decorators = IN_HEAP;
2148 if (is_volatile) {
2149 decorators |= MO_SEQ_CST;
2150 }
2151 if (needs_patching) {
2152 decorators |= C1_NEEDS_PATCHING;
2153 }
2154
2155 if (field->is_flat()) {
2156 ciInlineKlass* vk = field->type()->as_inline_klass();
2157 #ifdef ASSERT
2158 assert(field->is_atomic(), "No atomic access required");
2159 assert(x->state_before() != nullptr, "Needs state before");
2160 #endif
2161
2162 // Allocate buffer (we can't easily do this conditionally on the null check below
2163 // because branches added in the LIR are opaque to the register allocator).
2164 NewInstance* buffer = new NewInstance(vk, x->state_before(), false, true);
2165 do_NewInstance(buffer);
2166 LIRItem dest(buffer, this);
2167
2168 // Copy the payload to the buffer
2169 BasicType bt = vk->atomic_size_to_basic_type(field->is_null_free());
2170 LIR_Opr payload = new_register((bt == T_LONG) ? bt : T_INT);
2171 access_load_at(decorators, bt, object, LIR_OprFact::intConst(field->offset_in_bytes()), payload,
2172 // Make sure to emit an implicit null check
2173 info ? new CodeEmitInfo(info) : nullptr, info);
2174 access_store_at(decorators, bt, dest, LIR_OprFact::intConst(vk->payload_offset()), payload);
2175
2176 if (field->is_null_free()) {
2177 set_result(x, buffer->operand());
2178 } else {
2179 // Check the null marker and set result to null if it's not set
2180 __ logical_and(payload, null_marker_mask(bt, field), payload);
2181 __ cmp(lir_cond_equal, payload, (bt == T_LONG) ? LIR_OprFact::longConst(0) : LIR_OprFact::intConst(0));
2182 __ cmove(lir_cond_equal, LIR_OprFact::oopConst(nullptr), buffer->operand(), rlock_result(x), T_OBJECT);
2183 }
2184
2185 // Ensure the copy is visible before any subsequent store that publishes the buffer.
2186 __ membar_storestore();
2187 return;
2188 }
2189
2190 LIR_Opr result = rlock_result(x, field_type);
2191 access_load_at(decorators, field_type,
2192 object, LIR_OprFact::intConst(x->offset()), result,
2193 info ? new CodeEmitInfo(info) : nullptr, info);
2194 }
2195
2196 // int/long jdk.internal.util.Preconditions.checkIndex
2197 void LIRGenerator::do_PreconditionsCheckIndex(Intrinsic* x, BasicType type) {
2198 assert(x->number_of_arguments() == 3, "wrong type");
2199 LIRItem index(x->argument_at(0), this);
2200 LIRItem length(x->argument_at(1), this);
2201 LIRItem oobef(x->argument_at(2), this);
2202
2203 index.load_item();
2204 length.load_item();
2205 oobef.load_item();
2206
2207 LIR_Opr result = rlock_result(x);
2208 // x->state() is created from copy_state_for_exception, it does not contains arguments
2209 // we should prepare them before entering into interpreter mode due to deoptimization.
2318 __ move(LIR_OprFact::oopConst(nullptr), obj);
2319 __ null_check(obj, new CodeEmitInfo(null_check_info));
2320 }
2321 }
2322
2323 if (needs_range_check) {
2324 if (StressLoopInvariantCodeMotion && range_check_info->deoptimize_on_exception()) {
2325 __ branch(lir_cond_always, new RangeCheckStub(range_check_info, index.result(), array.result()));
2326 } else if (use_length) {
2327 // TODO: use a (modified) version of array_range_check that does not require a
2328 // constant length to be loaded to a register
2329 __ cmp(lir_cond_belowEqual, length.result(), index.result());
2330 __ branch(lir_cond_belowEqual, new RangeCheckStub(range_check_info, index.result(), array.result()));
2331 } else {
2332 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
2333 // The range check performs the null check, so clear it out for the load
2334 null_check_info = nullptr;
2335 }
2336 }
2337
2338 ciMethodData* md = nullptr;
2339 ciProfileData* data = nullptr;
2340 if (x->should_profile()) {
2341 if (x->array()->is_loaded_flat_array()) {
2342 // No need to profile a load from a flat array of known type. This can happen if
2343 // the type only became known after optimizations (for example, after the PhiSimplifier).
2344 x->set_should_profile(false);
2345 } else {
2346 int bci = x->profiled_bci();
2347 md = x->profiled_method()->method_data();
2348 assert(md != nullptr, "Sanity");
2349 data = md->bci_to_data(bci);
2350 assert(data != nullptr && data->is_ArrayLoadData(), "incorrect profiling entry");
2351 ciArrayLoadData* load_data = (ciArrayLoadData*)data;
2352 profile_array_type(x, md, load_data);
2353 }
2354 }
2355
2356 Value element = nullptr;
2357 if (x->buffer() != nullptr) {
2358 assert(x->array()->is_loaded_flat_array(), "must be");
2359 // Find the destination address (of the NewInlineTypeInstance).
2360 LIRItem buffer(x->buffer(), this);
2361 LIR_Opr payload = access_flat_array(true, array, index, buffer,
2362 x->delayed() == nullptr ? nullptr : x->delayed()->field(),
2363 x->delayed() == nullptr ? 0 : x->delayed()->offset());
2364 ciFlatArrayKlass* array_klass = x->array()->declared_type()->as_flat_array_klass();
2365 if (array_klass->is_elem_null_free()) {
2366 set_result(x, x->buffer()->operand());
2367 } else {
2368 // Check the null marker and set result to null if it's not set
2369 ciInlineKlass* elem_klass = array_klass->element_klass()->as_inline_klass();
2370 BasicType bt = elem_klass->atomic_size_to_basic_type(false);
2371 assert(payload->is_valid(), "nullable flat array load must return the atomic payload");
2372 __ logical_and(payload, null_marker_mask(bt, elem_klass->null_marker_offset_in_payload()), payload);
2373 __ cmp(lir_cond_equal, payload, (bt == T_LONG) ? LIR_OprFact::longConst(0) : LIR_OprFact::intConst(0));
2374 __ cmove(lir_cond_equal, LIR_OprFact::oopConst(nullptr), buffer.result(), rlock_result(x), T_OBJECT);
2375 }
2376 } else if (x->delayed() != nullptr) {
2377 assert(x->array()->is_loaded_flat_array(), "must be");
2378 LIR_Opr result = rlock_result(x, x->delayed()->field()->type()->basic_type());
2379 access_sub_element(array, index, result, x->delayed()->field(), x->delayed()->offset());
2380 } else {
2381 LIR_Opr result = rlock_result(x, x->elt_type());
2382 LoadFlattenedArrayStub* slow_path = nullptr;
2383
2384 if (x->should_profile() && x->array()->maybe_null_free_array()) {
2385 profile_null_free_array(array, md, data);
2386 }
2387
2388 if (x->elt_type() == T_OBJECT && x->array()->maybe_flat_array()) {
2389 assert(x->delayed() == nullptr, "Delayed LoadIndexed only apply to loaded_flat_arrays");
2390 index.load_item();
2391 // if we are loading from a flat array, load it using a runtime call
2392 slow_path = new LoadFlattenedArrayStub(array.result(), index.result(), result, state_for(x, x->state_before()));
2393 check_flat_array(array.result(), slow_path);
2394 set_in_conditional_code(true);
2395 }
2396
2397 DecoratorSet decorators = IN_HEAP | IS_ARRAY;
2398 access_load_at(decorators, x->elt_type(),
2399 array, index.result(), result,
2400 nullptr, null_check_info);
2401
2402 if (slow_path != nullptr) {
2403 __ branch_destination(slow_path->continuation());
2404 set_in_conditional_code(false);
2405 }
2406
2407 element = x;
2408 }
2409
2410 if (x->should_profile()) {
2411 profile_element_type(element, md, (ciArrayLoadData*)data);
2412 }
2413 }
2414
2415
2416 void LIRGenerator::do_NullCheck(NullCheck* x) {
2417 if (x->can_trap()) {
2418 LIRItem value(x->obj(), this);
2419 value.load_item();
2420 CodeEmitInfo* info = state_for(x);
2421 __ null_check(value.result(), info);
2422 }
2423 }
2424
2425
2426 void LIRGenerator::do_TypeCast(TypeCast* x) {
2427 LIRItem value(x->obj(), this);
2428 value.load_item();
2429 // the result is the same as from the node we are casting
2430 set_result(x, value.result());
2431 }
2432
2875 Compilation* comp = Compilation::current();
2876 if (do_update) {
2877 // try to find exact type, using CHA if possible, so that loading
2878 // the klass from the object can be avoided
2879 ciType* type = obj->exact_type();
2880 if (type == nullptr) {
2881 type = obj->declared_type();
2882 type = comp->cha_exact_type(type);
2883 }
2884 assert(type == nullptr || type->is_klass(), "type should be class");
2885 exact_klass = (type != nullptr && type->is_loaded()) ? (ciKlass*)type : nullptr;
2886
2887 do_update = exact_klass == nullptr || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2888 }
2889
2890 if (!do_null && !do_update) {
2891 return result;
2892 }
2893
2894 ciKlass* exact_signature_k = nullptr;
2895 if (do_update && signature_at_call_k != nullptr) {
2896 // Is the type from the signature exact (the only one possible)?
2897 exact_signature_k = signature_at_call_k->exact_klass();
2898 if (exact_signature_k == nullptr) {
2899 exact_signature_k = comp->cha_exact_type(signature_at_call_k);
2900 } else {
2901 result = exact_signature_k;
2902 // Known statically. No need to emit any code: prevent
2903 // LIR_Assembler::emit_profile_type() from emitting useless code
2904 profiled_k = ciTypeEntries::with_status(result, profiled_k);
2905 }
2906 // exact_klass and exact_signature_k can be both non null but
2907 // different if exact_klass is loaded after the ciObject for
2908 // exact_signature_k is created.
2909 if (exact_klass == nullptr && exact_signature_k != nullptr && exact_klass != exact_signature_k) {
2910 // sometimes the type of the signature is better than the best type
2911 // the compiler has
2912 exact_klass = exact_signature_k;
2913 }
2914 if (callee_signature_k != nullptr &&
2915 callee_signature_k != signature_at_call_k) {
2916 ciKlass* improved_klass = callee_signature_k->exact_klass();
2917 if (improved_klass == nullptr) {
2918 improved_klass = comp->cha_exact_type(callee_signature_k);
2919 }
2920 if (exact_klass == nullptr && improved_klass != nullptr && exact_klass != improved_klass) {
2921 exact_klass = exact_signature_k;
2922 }
2923 }
2924 do_update = exact_klass == nullptr || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2925 }
2926
2927 if (exact_klass != nullptr && exact_klass->is_obj_array_klass()) {
2928 ciArrayKlass* exact_array_klass = exact_klass->as_array_klass();
2929 if (exact_array_klass->is_refined()) {
2930 do_update = ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2931 } else if (exact_klass->can_be_inline_array_klass()) {
2932 // Inline type arrays can have additional properties. Load the klass unless
2933 // the C1 type already carries refined array properties.
2934 exact_klass = nullptr;
2935 do_update = true;
2936 } else {
2937 // For a direct pointer comparison, we need the refined array klass pointer
2938 exact_klass = ciObjArrayKlass::make(exact_array_klass->element_klass());
2939 do_update = ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2940 }
2941 }
2942 if (!do_null && !do_update) {
2943 return result;
2944 }
2945
2946 if (mdp == LIR_OprFact::illegalOpr) {
2947 mdp = new_register(T_METADATA);
2948 __ metadata2reg(md->constant_encoding(), mdp);
2949 if (md_base_offset != 0) {
2950 LIR_Address* base_type_address = new LIR_Address(mdp, md_base_offset, T_ADDRESS);
2951 mdp = new_pointer_register();
2952 __ leal(LIR_OprFact::address(base_type_address), mdp);
2953 }
2954 }
2955 LIRItem value(obj, this);
2956 value.load_item();
2957 __ profile_type(new LIR_Address(mdp, md_offset, T_METADATA),
2958 value.result(), exact_klass, profiled_k, new_pointer_register(), not_null, exact_signature_k != nullptr);
2959 return result;
2960 }
2961
2975 assert(!src->is_illegal(), "check");
2976 BasicType t = src->type();
2977 if (is_reference_type(t)) {
2978 intptr_t profiled_k = parameters->type(j);
2979 Local* local = x->state()->local_at(java_index)->as_Local();
2980 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
2981 in_bytes(ParametersTypeData::type_offset(j)) - in_bytes(ParametersTypeData::type_offset(0)),
2982 profiled_k, local, mdp, false, local->declared_type()->as_klass(), nullptr);
2983 // If the profile is known statically set it once for all and do not emit any code
2984 if (exact != nullptr) {
2985 md->set_parameter_type(j, exact);
2986 }
2987 j++;
2988 }
2989 java_index += type2size[t];
2990 }
2991 }
2992 }
2993 }
2994
2995 void LIRGenerator::profile_flags(ciMethodData* md, ciProfileData* data, int flag, LIR_Condition condition) {
2996 assert(md != nullptr && data != nullptr, "should have been initialized");
2997 LIR_Opr mdp = new_register(T_METADATA);
2998 __ metadata2reg(md->constant_encoding(), mdp);
2999 LIR_Address* addr = new LIR_Address(mdp, md->byte_offset_of_slot(data, DataLayout::flags_offset()), T_BYTE);
3000 LIR_Opr flags = new_register(T_INT);
3001 __ move(addr, flags);
3002 LIR_Opr update;
3003 if (condition != lir_cond_always) {
3004 update = new_register(T_INT);
3005 __ cmove(condition, LIR_OprFact::intConst(0), LIR_OprFact::intConst(flag), update, T_INT);
3006 } else {
3007 update = LIR_OprFact::intConst(flag);
3008 }
3009 __ logical_or(flags, update, flags);
3010 __ store(flags, addr);
3011 }
3012
3013 void LIRGenerator::profile_null_free_array(LIRItem array, ciMethodData* md, ciProfileData* data) {
3014 assert(compilation()->profile_array_accesses(), "array access profiling is disabled");
3015 LabelObj* L_end = new LabelObj();
3016 LIR_Opr tmp = new_register(T_METADATA);
3017 __ check_null_free_array(array.result(), tmp);
3018 #ifdef RISCV
3019 // tmp is used to hold the result of null free array check on riscv
3020 // See LIR_Assembler::emit_opNullFreeArrayCheck
3021 __ cmp(lir_cond_equal, tmp, LIR_OprFact::metadataConst(nullptr));
3022 #endif
3023 profile_flags(md, data, ArrayStoreData::null_free_array_byte_constant(), lir_cond_equal);
3024 }
3025
3026 template <class ArrayData> void LIRGenerator::profile_array_type(AccessIndexed* x, ciMethodData*& md, ArrayData*& load_store) {
3027 assert(compilation()->profile_array_accesses(), "array access profiling is disabled");
3028 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3029 profile_type(md, md->byte_offset_of_slot(load_store, ArrayData::array_offset()), 0,
3030 load_store->array()->type(), x->array(), mdp, true, nullptr, nullptr);
3031 }
3032
3033 void LIRGenerator::profile_element_type(Value element, ciMethodData* md, ciArrayLoadData* load_data) {
3034 assert(compilation()->profile_array_accesses(), "array access profiling is disabled");
3035 assert(md != nullptr && load_data != nullptr, "should have been initialized");
3036 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3037 profile_type(md, md->byte_offset_of_slot(load_data, ArrayLoadData::element_offset()), 0,
3038 load_data->element()->type(), element, mdp, false, nullptr, nullptr);
3039 }
3040
3041 void LIRGenerator::do_Base(Base* x) {
3042 __ std_entry(LIR_OprFact::illegalOpr);
3043 // Emit moves from physical registers / stack slots to virtual registers
3044 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
3045 IRScope* irScope = compilation()->hir()->top_scope();
3046 int java_index = 0;
3047 for (int i = 0; i < args->length(); i++) {
3048 LIR_Opr src = args->at(i);
3049 assert(!src->is_illegal(), "check");
3050 BasicType t = src->type();
3051
3052 // Types which are smaller than int are passed as int, so
3053 // correct the type which passed.
3054 switch (t) {
3055 case T_BYTE:
3056 case T_BOOLEAN:
3057 case T_SHORT:
3058 case T_CHAR:
3059 t = T_INT;
3060 break;
3062 break;
3063 }
3064
3065 LIR_Opr dest = new_register(t);
3066 __ move(src, dest);
3067
3068 // Assign new location to Local instruction for this local
3069 Local* local = x->state()->local_at(java_index)->as_Local();
3070 assert(local != nullptr, "Locals for incoming arguments must have been created");
3071 #ifndef __SOFTFP__
3072 // The java calling convention passes double as long and float as int.
3073 assert(as_ValueType(t)->tag() == local->type()->tag(), "check");
3074 #endif // __SOFTFP__
3075 local->set_operand(dest);
3076 #ifdef ASSERT
3077 _instruction_for_operand.at_put_grow(dest->vreg_number(), local, nullptr);
3078 #endif
3079 java_index += type2size[t];
3080 }
3081
3082 // Check if we need a membar at the beginning of the java.lang.Object
3083 // constructor to satisfy the memory model for strict fields.
3084 if (Arguments::is_valhalla_enabled() && method()->intrinsic_id() == vmIntrinsics::_Object_init) {
3085 __ membar_storestore();
3086 }
3087
3088 if (compilation()->env()->dtrace_method_probes()) {
3089 BasicTypeList signature;
3090 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
3091 signature.append(T_METADATA); // Method*
3092 LIR_OprList* args = new LIR_OprList();
3093 args->append(getThreadPointer());
3094 LIR_Opr meth = new_register(T_METADATA);
3095 __ metadata2reg(method()->constant_encoding(), meth);
3096 args->append(meth);
3097 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), voidType, nullptr);
3098 }
3099
3100 if (method()->is_synchronized()) {
3101 LIR_Opr obj;
3102 if (method()->is_static()) {
3103 obj = new_register(T_OBJECT);
3104 __ oop2reg(method()->holder()->java_mirror()->constant_encoding(), obj);
3105 } else {
3106 Local* receiver = x->state()->local_at(0)->as_Local();
3107 assert(receiver != nullptr, "must already exist");
3109 }
3110 assert(obj->is_valid(), "must be valid");
3111
3112 if (method()->is_synchronized()) {
3113 LIR_Opr lock = syncLockOpr();
3114 __ load_stack_address_monitor(0, lock);
3115
3116 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), nullptr, x->check_flag(Instruction::DeoptimizeOnException));
3117 CodeStub* slow_path = new MonitorEnterStub(obj, lock, info);
3118
3119 // receiver is guaranteed non-null so don't need CodeEmitInfo
3120 __ lock_object(syncTempOpr(), obj, lock, new_register(T_OBJECT), slow_path, nullptr);
3121 }
3122 }
3123 // increment invocation counters if needed
3124 if (!method()->is_accessor()) { // Accessors do not have MDOs, so no counting.
3125 profile_parameters(x);
3126 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), nullptr, false);
3127 increment_invocation_counter(info);
3128 }
3129 if (method()->has_scalarized_args()) {
3130 // Check if deoptimization was triggered (i.e. orig_pc was set) while buffering scalarized inline type arguments
3131 // in the entry point (see comments in frame::deoptimize). If so, deoptimize only now that we have the right state.
3132 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, 0), nullptr, false);
3133 CodeStub* deopt_stub = new DeoptimizeStub(info, Deoptimization::Reason_none, Deoptimization::Action_none);
3134 __ append(new LIR_Op0(lir_check_orig_pc));
3135 __ branch(lir_cond_notEqual, deopt_stub);
3136 }
3137
3138 // all blocks with a successor must end with an unconditional jump
3139 // to the successor even if they are consecutive
3140 __ jump(x->default_sux());
3141 }
3142
3143
3144 void LIRGenerator::do_OsrEntry(OsrEntry* x) {
3145 // construct our frame and model the production of incoming pointer
3146 // to the OSR buffer.
3147 __ osr_entry(LIR_Assembler::osrBufferPointer());
3148 LIR_Opr result = rlock_result(x);
3149 __ move(LIR_Assembler::osrBufferPointer(), result);
3150 }
3151
3152 void LIRGenerator::invoke_load_one_argument(LIRItem* param, LIR_Opr loc) {
3153 if (loc->is_register()) {
3154 param->load_item_force(loc);
3155 } else {
3156 LIR_Address* addr = loc->as_address_ptr();
3157 param->load_for_store(addr->type());
3158 if (addr->type() == T_OBJECT) {
3159 __ move_wide(param->result(), addr);
3160 } else {
3161 __ move(param->result(), addr);
3162 }
3163 }
3164 }
3165
3166 void LIRGenerator::invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list) {
3167 assert(args->length() == arg_list->length(),
3168 "args=%d, arg_list=%d", args->length(), arg_list->length());
3169 for (int i = x->has_receiver() ? 1 : 0; i < args->length(); i++) {
3170 LIRItem* param = args->at(i);
3171 LIR_Opr loc = arg_list->at(i);
3172 invoke_load_one_argument(param, loc);
3173 }
3174
3175 if (x->has_receiver()) {
3176 LIRItem* receiver = args->at(0);
3177 LIR_Opr loc = arg_list->at(0);
3178 if (loc->is_register()) {
3179 receiver->load_item_force(loc);
3180 } else {
3181 assert(loc->is_address(), "just checking");
3182 receiver->load_for_store(T_OBJECT);
3183 __ move_wide(receiver->result(), loc->as_address_ptr());
3184 }
3185 }
3186 }
3187
3188
3189 // Visits all arguments, returns appropriate items without loading them
3190 LIRItemList* LIRGenerator::invoke_visit_arguments(Invoke* x) {
3191 LIRItemList* argument_items = new LIRItemList();
3192 if (x->has_receiver()) {
3299 __ move(tmp, reg);
3300 }
3301
3302
3303
3304 // Code for : x->x() {x->cond()} x->y() ? x->tval() : x->fval()
3305 void LIRGenerator::do_IfOp(IfOp* x) {
3306 #ifdef ASSERT
3307 {
3308 ValueTag xtag = x->x()->type()->tag();
3309 ValueTag ttag = x->tval()->type()->tag();
3310 assert(xtag == intTag || xtag == objectTag, "cannot handle others");
3311 assert(ttag == addressTag || ttag == intTag || ttag == objectTag || ttag == longTag, "cannot handle others");
3312 assert(ttag == x->fval()->type()->tag(), "cannot handle others");
3313 }
3314 #endif
3315
3316 LIRItem left(x->x(), this);
3317 LIRItem right(x->y(), this);
3318 left.load_item();
3319 if (can_inline_as_constant(right.value()) && !x->substitutability_check()) {
3320 right.dont_load_item();
3321 } else {
3322 // substitutability_check() needs to use right as a base register.
3323 right.load_item();
3324 }
3325
3326 LIRItem t_val(x->tval(), this);
3327 LIRItem f_val(x->fval(), this);
3328 t_val.dont_load_item();
3329 f_val.dont_load_item();
3330
3331 if (x->substitutability_check()) {
3332 substitutability_check(x, left, right, t_val, f_val);
3333 } else {
3334 LIR_Opr reg = rlock_result(x);
3335 __ cmp(lir_cond(x->cond()), left.result(), right.result());
3336 __ cmove(lir_cond(x->cond()), t_val.result(), f_val.result(), reg, as_BasicType(x->x()->type()));
3337 }
3338 }
3339
3340 void LIRGenerator::substitutability_check(IfOp* x, LIRItem& left, LIRItem& right, LIRItem& t_val, LIRItem& f_val) {
3341 assert(x->cond() == If::eql || x->cond() == If::neq, "must be");
3342 bool is_acmpeq = (x->cond() == If::eql);
3343 LIR_Opr equal_result = is_acmpeq ? t_val.result() : f_val.result();
3344 LIR_Opr not_equal_result = is_acmpeq ? f_val.result() : t_val.result();
3345 LIR_Opr result = rlock_result(x);
3346 CodeEmitInfo* info = state_for(x, x->state_before());
3347
3348 substitutability_check_common(x->x(), x->y(), left, right, equal_result, not_equal_result, result, info);
3349 }
3350
3351 void LIRGenerator::substitutability_check(If* x, LIRItem& left, LIRItem& right) {
3352 LIR_Opr equal_result = LIR_OprFact::intConst(1);
3353 LIR_Opr not_equal_result = LIR_OprFact::intConst(0);
3354 LIR_Opr result = new_register(T_INT);
3355 CodeEmitInfo* info = state_for(x, x->state_before());
3356
3357 substitutability_check_common(x->x(), x->y(), left, right, equal_result, not_equal_result, result, info);
3358
3359 assert(x->cond() == If::eql || x->cond() == If::neq, "must be");
3360 __ cmp(lir_cond(x->cond()), result, equal_result);
3361 }
3362
3363 void LIRGenerator::substitutability_check_common(Value left_val, Value right_val, LIRItem& left, LIRItem& right,
3364 LIR_Opr equal_result, LIR_Opr not_equal_result, LIR_Opr result,
3365 CodeEmitInfo* info) {
3366 LIR_Opr tmp1 = LIR_OprFact::illegalOpr;
3367 LIR_Opr tmp2 = LIR_OprFact::illegalOpr;
3368
3369 ciKlass* left_klass = left_val->as_loaded_klass_or_null();
3370 ciKlass* right_klass = right_val->as_loaded_klass_or_null();
3371 if (left_klass != nullptr && left_klass->is_inlinetype() && left_klass == right_klass) {
3372 // No need to load klass -- the operands are statically known to be the same inline klass.
3373 } else {
3374 BasicType t_klass = UseCompressedOops ? T_INT : T_METADATA;
3375 tmp1 = new_register(t_klass);
3376 tmp2 = new_register(t_klass);
3377 }
3378
3379 CodeStub* slow_path = new SubstitutabilityCheckStub(left.result(), right.result(), info);
3380 __ substitutability_check(result, left.result(), right.result(), equal_result, not_equal_result,
3381 left_klass, right_klass, tmp1, tmp2, info, slow_path);
3382 }
3383
3384 void LIRGenerator::do_RuntimeCall(address routine, Intrinsic* x) {
3385 assert(x->number_of_arguments() == 0, "wrong type");
3386 // Enforce computation of _reserved_argument_area_size which is required on some platforms.
3387 BasicTypeList signature;
3388 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
3389 LIR_Opr reg = result_register_for(x->type());
3390 __ call_runtime_leaf(routine, getThreadTemp(),
3391 reg, new LIR_OprList());
3392 LIR_Opr result = rlock_result(x);
3393 __ move(reg, result);
3394 }
3395
3396
3397
3398 void LIRGenerator::do_Intrinsic(Intrinsic* x) {
3399 switch (x->id()) {
3400 case vmIntrinsics::_intBitsToFloat :
3401 case vmIntrinsics::_doubleToRawLongBits :
3636 if (x->recv() != nullptr || x->nb_profiled_args() > 0) {
3637 profile_parameters_at_call(x);
3638 }
3639
3640 if (x->recv() != nullptr) {
3641 LIRItem value(x->recv(), this);
3642 value.load_item();
3643 recv = new_register(T_OBJECT);
3644 __ move(value.result(), recv);
3645 }
3646 __ profile_call(x->method(), x->bci_of_invoke(), x->callee(), mdo, recv, tmp, x->known_holder());
3647 }
3648
3649 void LIRGenerator::do_ProfileReturnType(ProfileReturnType* x) {
3650 int bci = x->bci_of_invoke();
3651 ciMethodData* md = x->method()->method_data_or_null();
3652 assert(md != nullptr, "Sanity");
3653 ciProfileData* data = md->bci_to_data(bci);
3654 if (data != nullptr) {
3655 assert(data->is_CallTypeData() || data->is_VirtualCallTypeData(), "wrong profile data type");
3656 ciSingleTypeEntry* ret = data->is_CallTypeData() ? ((ciCallTypeData*)data)->ret() : ((ciVirtualCallTypeData*)data)->ret();
3657 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3658
3659 bool ignored_will_link;
3660 ciSignature* signature_at_call = nullptr;
3661 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3662
3663 // The offset within the MDO of the entry to update may be too large
3664 // to be used in load/store instructions on some platforms. So have
3665 // profile_type() compute the address of the profile in a register.
3666 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(data, ret->type_offset()), 0,
3667 ret->type(), x->ret(), mdp,
3668 !x->needs_null_check(),
3669 signature_at_call->return_type()->as_klass(),
3670 x->callee()->signature()->return_type()->as_klass());
3671 if (exact != nullptr) {
3672 md->set_return_type(bci, exact);
3673 }
3674 }
3675 }
3676
3677 bool LIRGenerator::profile_inline_klass(ciMethodData* md, ciProfileData* data, Value value, int flag) {
3678 ciKlass* klass = value->as_loaded_klass_or_null();
3679 if (klass != nullptr) {
3680 if (klass->is_inlinetype()) {
3681 profile_flags(md, data, flag, lir_cond_always);
3682 } else if (klass->can_be_inline_klass()) {
3683 return false;
3684 }
3685 } else {
3686 return false;
3687 }
3688 return true;
3689 }
3690
3691 void LIRGenerator::do_ProfileACmpTypes(ProfileACmpTypes* x) {
3692 ciMethod* method = x->method();
3693 assert(method != nullptr, "method should be set if branch is profiled");
3694 ciMethodData* md = method->method_data_or_null();
3695 assert(md != nullptr, "Sanity");
3696 ciProfileData* data = md->bci_to_data(x->bci());
3697 assert(data != nullptr, "must have profiling data");
3698 assert(data->is_ACmpData(), "need BranchData for two-way branches");
3699 ciACmpData* acmp = (ciACmpData*)data;
3700 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3701 profile_type(md, md->byte_offset_of_slot(acmp, ACmpData::left_offset()), 0,
3702 acmp->left()->type(), x->left(), mdp, !x->left_maybe_null(), nullptr, nullptr);
3703 int flags_offset = md->byte_offset_of_slot(data, DataLayout::flags_offset());
3704 if (!profile_inline_klass(md, acmp, x->left(), ACmpData::left_inline_type_byte_constant())) {
3705 LIR_Opr mdp = new_register(T_METADATA);
3706 __ metadata2reg(md->constant_encoding(), mdp);
3707 LIRItem value(x->left(), this);
3708 value.load_item();
3709 __ profile_inline_type(new LIR_Address(mdp, flags_offset, T_INT), value.result(), ACmpData::left_inline_type_byte_constant(), new_register(T_INT), !x->left_maybe_null());
3710 }
3711 profile_type(md, md->byte_offset_of_slot(acmp, ACmpData::left_offset()),
3712 in_bytes(ACmpData::right_offset()) - in_bytes(ACmpData::left_offset()),
3713 acmp->right()->type(), x->right(), mdp, !x->right_maybe_null(), nullptr, nullptr);
3714 if (!profile_inline_klass(md, acmp, x->right(), ACmpData::right_inline_type_byte_constant())) {
3715 LIR_Opr mdp = new_register(T_METADATA);
3716 __ metadata2reg(md->constant_encoding(), mdp);
3717 LIRItem value(x->right(), this);
3718 value.load_item();
3719 __ profile_inline_type(new LIR_Address(mdp, flags_offset, T_INT), value.result(), ACmpData::right_inline_type_byte_constant(), new_register(T_INT), !x->left_maybe_null());
3720 }
3721 }
3722
3723 void LIRGenerator::do_ProfileInvoke(ProfileInvoke* x) {
3724 // We can safely ignore accessors here, since c2 will inline them anyway,
3725 // accessors are also always mature.
3726 if (!x->inlinee()->is_accessor()) {
3727 CodeEmitInfo* info = state_for(x, x->state(), true);
3728 // Notify the runtime very infrequently only to take care of counter overflows
3729 int freq_log = Tier23InlineeNotifyFreqLog;
3730 double scale;
3731 if (_method->has_option_value(CompileCommandEnum::CompileThresholdScaling, scale)) {
3732 freq_log = CompilerConfig::scaled_freq_log(freq_log, scale);
3733 }
3734 increment_event_counter_impl(info, x->inlinee(), LIR_OprFact::intConst(InvocationCounter::count_increment), right_n_bits(freq_log), InvocationEntryBci, false, true);
3735 }
3736 }
3737
3738 void LIRGenerator::increment_backedge_counter_conditionally(LIR_Condition cond, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info, int left_bci, int right_bci, int bci) {
3739 if (compilation()->is_profiling()) {
3740 #if defined(X86) && !defined(_LP64)
3741 // BEWARE! On 32-bit x86 cmp clobbers its left argument so we need a temp copy.
3742 LIR_Opr left_copy = new_register(left->type());
|