Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(136)

Side by Side Diff: runtime/vm/intermediate_language_x64.cc

Issue 22851003: Initial support for length guards on final fields. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Created 7 years, 4 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « runtime/vm/intermediate_language_mips.cc ('k') | runtime/vm/object.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file
2 // for details. All rights reserved. Use of this source code is governed by a 2 // for details. All rights reserved. Use of this source code is governed by a
3 // BSD-style license that can be found in the LICENSE file. 3 // BSD-style license that can be found in the LICENSE file.
4 4
5 #include "vm/globals.h" // Needed here to get TARGET_ARCH_X64. 5 #include "vm/globals.h" // Needed here to get TARGET_ARCH_X64.
6 #if defined(TARGET_ARCH_X64) 6 #if defined(TARGET_ARCH_X64)
7 7
8 #include "vm/intermediate_language.h" 8 #include "vm/intermediate_language.h"
9 9
10 #include "vm/dart_entry.h" 10 #include "vm/dart_entry.h"
(...skipping 1518 matching lines...) Expand 10 before | Expand all | Expand 10 after
1529 UNREACHABLE(); 1529 UNREACHABLE();
1530 } 1530 }
1531 } 1531 }
1532 1532
1533 1533
1534 LocationSummary* GuardFieldInstr::MakeLocationSummary() const { 1534 LocationSummary* GuardFieldInstr::MakeLocationSummary() const {
1535 const intptr_t kNumInputs = 1; 1535 const intptr_t kNumInputs = 1;
1536 LocationSummary* summary = 1536 LocationSummary* summary =
1537 new LocationSummary(kNumInputs, 0, LocationSummary::kNoCall); 1537 new LocationSummary(kNumInputs, 0, LocationSummary::kNoCall);
1538 summary->set_in(0, Location::RequiresRegister()); 1538 summary->set_in(0, Location::RequiresRegister());
1539 if ((value()->Type()->ToCid() == kDynamicCid) && 1539 const bool field_has_length = field().needs_length_check();
1540 (field().guarded_cid() != kSmiCid)) { 1540 const bool need_value_temp_reg =
1541 (field_has_length || ((value()->Type()->ToCid() == kDynamicCid) &&
1542 (field().guarded_cid() != kSmiCid)));
1543 if (need_value_temp_reg) {
1541 summary->AddTemp(Location::RequiresRegister()); 1544 summary->AddTemp(Location::RequiresRegister());
1542 } 1545 }
1543 if (field().guarded_cid() == kIllegalCid) { 1546 const bool need_field_temp_reg =
1547 field_has_length || (field().guarded_cid() == kIllegalCid);
1548 if (need_field_temp_reg) {
1544 summary->AddTemp(Location::RequiresRegister()); 1549 summary->AddTemp(Location::RequiresRegister());
1545 } 1550 }
1546 return summary; 1551 return summary;
1547 } 1552 }
1548 1553
1549 1554
1550 void GuardFieldInstr::EmitNativeCode(FlowGraphCompiler* compiler) { 1555 void GuardFieldInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
1551 const intptr_t field_cid = field().guarded_cid(); 1556 const intptr_t field_cid = field().guarded_cid();
1552 const intptr_t nullability = field().is_nullable() ? kNullCid : kIllegalCid; 1557 const intptr_t nullability = field().is_nullable() ? kNullCid : kIllegalCid;
1558 const intptr_t field_length = field().guarded_list_length();
1559 const bool field_has_length = field().needs_length_check();
1560 const bool needs_value_temp_reg =
1561 (field_has_length || ((value()->Type()->ToCid() == kDynamicCid) &&
1562 (field().guarded_cid() != kSmiCid)));
1563 const bool needs_field_temp_reg =
1564 field_has_length || (field().guarded_cid() == kIllegalCid);
1565 if (field_has_length) {
1566 // Currently, we should only see final fields that remember length.
1567 ASSERT(field().is_final());
1568 }
1553 1569
1554 if (field_cid == kDynamicCid) { 1570 if (field_cid == kDynamicCid) {
1555 ASSERT(!compiler->is_optimizing()); 1571 ASSERT(!compiler->is_optimizing());
1556 return; // Nothing to emit. 1572 return; // Nothing to emit.
1557 } 1573 }
1558 1574
1559 const intptr_t value_cid = value()->Type()->ToCid(); 1575 const intptr_t value_cid = value()->Type()->ToCid();
1560 1576
1561 Register value_reg = locs()->in(0).reg(); 1577 Register value_reg = locs()->in(0).reg();
1562 1578
1563 Register value_cid_reg = ((value_cid == kDynamicCid) && 1579 Register value_cid_reg = needs_value_temp_reg ?
1564 (field_cid != kSmiCid)) ? locs()->temp(0).reg() : kNoRegister; 1580 locs()->temp(0).reg() : kNoRegister;
1565 1581
1566 Register field_reg = (field_cid == kIllegalCid) ? 1582 Register field_reg = needs_field_temp_reg ?
1567 locs()->temp(locs()->temp_count() - 1).reg() : kNoRegister; 1583 locs()->temp(locs()->temp_count() - 1).reg() : kNoRegister;
1568 1584
1569 Label ok, fail_label; 1585 Label ok, fail_label;
1570 1586
1571 Label* deopt = compiler->is_optimizing() ? 1587 Label* deopt = compiler->is_optimizing() ?
1572 compiler->AddDeoptStub(deopt_id(), kDeoptGuardField) : NULL; 1588 compiler->AddDeoptStub(deopt_id(), kDeoptGuardField) : NULL;
1573 1589
1574 Label* fail = (deopt != NULL) ? deopt : &fail_label; 1590 Label* fail = (deopt != NULL) ? deopt : &fail_label;
1575 1591
1576 const bool ok_is_fall_through = (deopt != NULL); 1592 const bool ok_is_fall_through = (deopt != NULL);
1577 1593
1578 if (!compiler->is_optimizing() || (field_cid == kIllegalCid)) { 1594 if (!compiler->is_optimizing() || (field_cid == kIllegalCid)) {
1579 if (!compiler->is_optimizing()) { 1595 if (!compiler->is_optimizing() && (field_reg == kNoRegister)) {
1580 // Currently we can't have different location summaries for optimized 1596 // Currently we can't have different location summaries for optimized
1581 // and non-optimized code. So instead we manually pick up a register 1597 // and non-optimized code. So instead we manually pick up a register
1582 // that is known to be free because we know how non-optimizing compiler 1598 // that is known to be free because we know how non-optimizing compiler
1583 // allocates registers. 1599 // allocates registers.
1584 field_reg = RBX; 1600 field_reg = RBX;
1585 ASSERT((field_reg != value_reg) && (field_reg != value_cid_reg)); 1601 ASSERT((field_reg != value_reg) && (field_reg != value_cid_reg));
1586 } 1602 }
1587 1603
1588 __ LoadObject(field_reg, Field::ZoneHandle(field().raw())); 1604 __ LoadObject(field_reg, Field::ZoneHandle(field().raw()));
1589 1605
1590 FieldAddress field_cid_operand(field_reg, Field::guarded_cid_offset()); 1606 FieldAddress field_cid_operand(field_reg, Field::guarded_cid_offset());
1591 FieldAddress field_nullability_operand( 1607 FieldAddress field_nullability_operand(
1592 field_reg, Field::is_nullable_offset()); 1608 field_reg, Field::is_nullable_offset());
1609 FieldAddress field_length_operand(
1610 field_reg, Field::guarded_list_length_offset());
1593 1611
1594 if (value_cid == kDynamicCid) { 1612 if (value_cid == kDynamicCid) {
1595 if (value_cid_reg == kNoRegister) { 1613 if (value_cid_reg == kNoRegister) {
1596 ASSERT(!compiler->is_optimizing()); 1614 ASSERT(!compiler->is_optimizing());
1597 value_cid_reg = RDX; 1615 value_cid_reg = RDX;
1598 ASSERT((value_cid_reg != value_reg) && (field_reg != value_cid_reg)); 1616 ASSERT((value_cid_reg != value_reg) && (field_reg != value_cid_reg));
1599 } 1617 }
1600 1618
1601 LoadValueCid(compiler, value_cid_reg, value_reg); 1619 LoadValueCid(compiler, value_cid_reg, value_reg);
1602 1620
1621 Label skip_length_check;
1603 __ cmpq(value_cid_reg, field_cid_operand); 1622 __ cmpq(value_cid_reg, field_cid_operand);
1604 __ j(EQUAL, &ok); 1623 __ j(NOT_EQUAL, &skip_length_check);
1624 if (field_has_length) {
1625 // Field guard may have remembered list length, check it.
1626 if ((field_cid == kArrayCid) || (field_cid == kImmutableArrayCid)) {
1627 __ pushq(value_cid_reg);
1628 __ movq(value_cid_reg,
1629 FieldAddress(value_reg, Array::length_offset()));
1630 __ cmpq(value_cid_reg, Immediate(field_length));
1631 __ popq(value_cid_reg);
1632 } else if (RawObject::IsTypedDataClassId(field_cid)) {
1633 __ pushq(value_cid_reg);
1634 __ movq(value_cid_reg,
1635 FieldAddress(value_reg, TypedData::length_offset()));
1636 __ cmpq(value_cid_reg, Immediate(field_length));
1637 __ popq(value_cid_reg);
1638 } else {
1639 ASSERT(field_cid == kIllegalCid);
1640 // Following jump cannot not occur, fall through.
1641 }
1642 __ j(NOT_EQUAL, fail);
1643 }
1644 __ Bind(&skip_length_check);
1605 __ cmpq(value_cid_reg, field_nullability_operand); 1645 __ cmpq(value_cid_reg, field_nullability_operand);
1606 } else if (value_cid == kNullCid) { 1646 } else if (value_cid == kNullCid) {
1607 __ cmpq(field_nullability_operand, Immediate(value_cid)); 1647 __ cmpq(field_nullability_operand, Immediate(value_cid));
1608 } else { 1648 } else {
1649 Label skip_length_check;
1609 __ cmpq(field_cid_operand, Immediate(value_cid)); 1650 __ cmpq(field_cid_operand, Immediate(value_cid));
1651 // If not equal, skip over length check.
1652 __ j(NOT_EQUAL, &skip_length_check);
1653 // Insert length check.
1654 if (field_has_length) {
1655 if (value_cid_reg == kNoRegister) {
1656 ASSERT(!compiler->is_optimizing());
1657 value_cid_reg = RDX;
1658 ASSERT((value_cid_reg != value_reg) && (field_reg != value_cid_reg));
1659 }
1660 ASSERT(value_cid_reg != kNoRegister);
1661 if ((field_cid == kArrayCid) || (field_cid == kImmutableArrayCid)) {
1662 __ pushq(value_cid_reg);
1663 __ movq(value_cid_reg,
1664 FieldAddress(value_reg, Array::length_offset()));
1665 __ cmpq(value_cid_reg, Immediate(field_length));
1666 __ popq(value_cid_reg);
1667 } else if (RawObject::IsTypedDataClassId(field_cid)) {
1668 __ pushq(value_cid_reg);
1669 __ movq(value_cid_reg,
1670 FieldAddress(value_reg, TypedData::length_offset()));
1671 __ cmpq(value_cid_reg, Immediate(field_length));
1672 __ popq(value_cid_reg);
1673 } else {
1674 ASSERT(field_cid == kIllegalCid);
1675 // Following jump cannot not occur, fall through.
1676 }
1677 }
1678 // Not identical, possibly null.
1679 __ Bind(&skip_length_check);
1610 } 1680 }
1611 __ j(EQUAL, &ok); 1681 __ j(EQUAL, &ok);
1612 1682
1613 __ cmpq(field_cid_operand, Immediate(kIllegalCid)); 1683 __ cmpq(field_cid_operand, Immediate(kIllegalCid));
1614 __ j(NOT_EQUAL, fail); 1684 __ j(NOT_EQUAL, fail);
1615 1685
1616 if (value_cid == kDynamicCid) { 1686 if (value_cid == kDynamicCid) {
1617 __ movq(field_cid_operand, value_cid_reg); 1687 __ movq(field_cid_operand, value_cid_reg);
1618 __ movq(field_nullability_operand, value_cid_reg); 1688 __ movq(field_nullability_operand, value_cid_reg);
1689 if (field_has_length) {
1690 Label check_array, local_exit, local_fail;
1691 __ cmpq(value_cid_reg, Immediate(kNullCid));
1692 __ j(EQUAL, &local_fail);
1693 // Check for typed data array.
1694 __ cmpq(value_cid_reg, Immediate(kTypedDataFloat32x4ArrayCid));
1695 __ j(GREATER, &local_fail); // Not a typed array or a regular array.
1696 __ cmpq(value_cid_reg, Immediate(kTypedDataInt8ArrayCid));
1697 __ j(LESS, &check_array); // Could still be a regular array.
1698 // Destroy value_cid_reg (safe because we are finished with it).
1699 __ movq(value_cid_reg,
1700 FieldAddress(value_reg, TypedData::length_offset()));
1701 __ movq(field_length_operand, value_cid_reg);
1702 __ jmp(&local_exit); // Updated field length typed data array.
1703 // Check for regular array.
1704 __ Bind(&check_array);
1705 __ cmpq(value_cid_reg, Immediate(kImmutableArrayCid));
1706 __ j(GREATER, &local_fail);
1707 __ cmpq(value_cid_reg, Immediate(kArrayCid));
1708 __ j(LESS, &local_fail);
1709 // Destroy value_cid_reg (safe because we are finished with it).
1710 __ movq(value_cid_reg,
1711 FieldAddress(value_reg, Array::length_offset()));
1712 __ movq(field_length_operand, value_cid_reg);
1713 __ jmp(&local_exit); // Updated field length from regular array.
1714
1715 __ Bind(&local_fail);
1716 __ movq(field_length_operand, Immediate(Field::kNoFixedLength));
1717
1718 __ Bind(&local_exit);
1719 }
1619 } else { 1720 } else {
1721 if (value_cid_reg == kNoRegister) {
1722 ASSERT(!compiler->is_optimizing());
1723 value_cid_reg = RDX;
1724 ASSERT((value_cid_reg != value_reg) && (field_reg != value_cid_reg));
1725 }
1726 ASSERT(value_cid_reg != kNoRegister);
1727 ASSERT(field_reg != kNoRegister);
1620 __ movq(field_cid_operand, Immediate(value_cid)); 1728 __ movq(field_cid_operand, Immediate(value_cid));
1621 __ movq(field_nullability_operand, Immediate(value_cid)); 1729 __ movq(field_nullability_operand, Immediate(value_cid));
1730 if ((value_cid == kArrayCid) || (value_cid == kImmutableArrayCid)) {
1731 // Destroy value_cid_reg (safe because we are finished with it).
1732 __ movq(value_cid_reg,
1733 FieldAddress(value_reg, Array::length_offset()));
1734 __ movq(field_length_operand, value_cid_reg);
1735 } else if (RawObject::IsTypedDataClassId(value_cid)) {
1736 // Destroy value_cid_reg (safe because we are finished with it).
1737 __ movq(value_cid_reg,
1738 FieldAddress(value_reg, TypedData::length_offset()));
1739 __ movq(field_length_operand, value_cid_reg);
1740 } else {
1741 __ movq(field_length_operand, Immediate(Field::kNoFixedLength));
1742 }
1622 } 1743 }
1623 1744
1624 if (!ok_is_fall_through) { 1745 if (!ok_is_fall_through) {
1625 __ jmp(&ok); 1746 __ jmp(&ok);
1626 } 1747 }
1627 } else { 1748 } else {
1749 if (field_reg != kNoRegister) {
1750 __ LoadObject(field_reg, Field::ZoneHandle(field().raw()));
1751 }
1752
1628 if (value_cid == kDynamicCid) { 1753 if (value_cid == kDynamicCid) {
1629 // Field's guarded class id is fixed but value's class id is not known. 1754 // Field's guarded class id is fixed but value's class id is not known.
1630 __ testq(value_reg, Immediate(kSmiTagMask)); 1755 __ testq(value_reg, Immediate(kSmiTagMask));
1631 1756
1632 if (field_cid != kSmiCid) { 1757 if (field_cid != kSmiCid) {
1633 __ j(ZERO, fail); 1758 __ j(ZERO, fail);
1634 __ LoadClassId(value_cid_reg, value_reg); 1759 __ LoadClassId(value_cid_reg, value_reg);
1635 __ cmpq(value_cid_reg, Immediate(field_cid)); 1760 __ cmpq(value_cid_reg, Immediate(field_cid));
1636 } 1761 }
1637 1762
1763 if (field_has_length) {
1764 // Jump when Value CID != Field guard CID
1765 __ j(NOT_EQUAL, fail);
1766
1767 // Classes are same, perform guarded list length check.
1768 ASSERT(field_reg != kNoRegister);
1769 ASSERT(value_cid_reg != kNoRegister);
1770 FieldAddress field_length_operand(
1771 field_reg, Field::guarded_list_length_offset());
1772 if ((field_cid == kArrayCid) || (field_cid == kImmutableArrayCid)) {
1773 // Destroy value_cid_reg (safe because we are finished with it).
1774 __ movq(value_cid_reg,
1775 FieldAddress(value_reg, Array::length_offset()));
1776 } else if (RawObject::IsTypedDataClassId(field_cid)) {
1777 // Destroy value_cid_reg (safe because we are finished with it).
1778 __ movq(value_cid_reg,
1779 FieldAddress(value_reg, TypedData::length_offset()));
1780 }
1781 __ cmpq(value_cid_reg, field_length_operand);
1782 }
1783
1638 if (field().is_nullable() && (field_cid != kNullCid)) { 1784 if (field().is_nullable() && (field_cid != kNullCid)) {
1639 __ j(EQUAL, &ok); 1785 __ j(EQUAL, &ok);
1640 const Immediate& raw_null = 1786 const Immediate& raw_null =
1641 Immediate(reinterpret_cast<intptr_t>(Object::null())); 1787 Immediate(reinterpret_cast<intptr_t>(Object::null()));
1642 __ cmpq(value_reg, raw_null); 1788 __ cmpq(value_reg, raw_null);
1643 } 1789 }
1644 1790
1645 if (ok_is_fall_through) { 1791 if (ok_is_fall_through) {
1646 __ j(NOT_EQUAL, fail); 1792 __ j(NOT_EQUAL, fail);
1647 } else { 1793 } else {
1648 __ j(EQUAL, &ok); 1794 __ j(EQUAL, &ok);
1649 } 1795 }
1650 } else { 1796 } else {
1651 // Both value's and field's class id is known. 1797 // Both value's and field's class id is known.
1652 if ((value_cid != field_cid) && (value_cid != nullability)) { 1798 if ((value_cid != field_cid) && (value_cid != nullability)) {
1653 if (ok_is_fall_through) { 1799 if (ok_is_fall_through) {
1654 __ jmp(fail); 1800 __ jmp(fail);
1655 } 1801 }
1802 } else if (field_has_length && (value_cid == field_cid)) {
1803 ASSERT(value_cid_reg != kNoRegister);
1804 if ((field_cid == kArrayCid) || (field_cid == kImmutableArrayCid)) {
1805 // Destroy value_cid_reg (safe because we are finished with it).
1806 __ movq(value_cid_reg,
1807 FieldAddress(value_reg, Array::length_offset()));
1808 } else if (RawObject::IsTypedDataClassId(field_cid)) {
1809 // Destroy value_cid_reg (safe because we are finished with it).
1810 __ movq(value_cid_reg,
1811 FieldAddress(value_reg, TypedData::length_offset()));
1812 }
1813 __ cmpq(value_cid_reg, Immediate(field_length));
1814 if (ok_is_fall_through) {
1815 __ j(NOT_EQUAL, fail);
1816 }
1656 } else { 1817 } else {
1657 // Nothing to emit. 1818 // Nothing to emit.
1658 ASSERT(!compiler->is_optimizing()); 1819 ASSERT(!compiler->is_optimizing());
1659 return; 1820 return;
1660 } 1821 }
1661 } 1822 }
1662 } 1823 }
1663 1824
1664 if (deopt == NULL) { 1825 if (deopt == NULL) {
1665 ASSERT(!compiler->is_optimizing()); 1826 ASSERT(!compiler->is_optimizing());
(...skipping 2968 matching lines...) Expand 10 before | Expand all | Expand 10 after
4634 PcDescriptors::kOther, 4795 PcDescriptors::kOther,
4635 locs()); 4796 locs());
4636 __ Drop(2); // Discard type arguments and receiver. 4797 __ Drop(2); // Discard type arguments and receiver.
4637 } 4798 }
4638 4799
4639 } // namespace dart 4800 } // namespace dart
4640 4801
4641 #undef __ 4802 #undef __
4642 4803
4643 #endif // defined TARGET_ARCH_X64 4804 #endif // defined TARGET_ARCH_X64
OLDNEW
« no previous file with comments | « runtime/vm/intermediate_language_mips.cc ('k') | runtime/vm/object.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698