|
|
@@ -1525,1829 +1525,1744 @@ Listing:
|
|
|
1507 AND (et # SymTab.InvalidType)
|
|
|
1508 AND (SymTab.ClassOf(dt) #
|
|
|
1509 SymTab.ClClass) THEN
|
|
|
- 1510 IF sfx
|
|
|
- 1511 OR (dk = SymTab.KindField) THEN
|
|
|
- 1512 IF SymTab.ClassOf(dt) =
|
|
|
- 1513 SymTab.ClArray THEN
|
|
|
- 1514 IF (et # SymTab.InvalidType)
|
|
|
- 1515 AND (SymTab.ClassOf(et) = SymTab.ClUStr)
|
|
|
- 1516 AND SymTab.IsUCharArray(dt) THEN
|
|
|
- 1517 QbeGen.UAssign(qd, qe)
|
|
|
- 1518 ELSIF SymTab.StrCompat(dt,
|
|
|
- 1519 et) THEN
|
|
|
- 1520 QbeGen.StrAssign(qd,
|
|
|
- 1521 qe)
|
|
|
- 1522 ELSE
|
|
|
- 1523 QbeGen.CopyArray(qd,
|
|
|
- 1524 qe, dt)
|
|
|
- 1525 END
|
|
|
- 1526 ELSIF SymTab.ClassOf(dt) =
|
|
|
- 1527 SymTab.ClSet THEN
|
|
|
- 1528 QbeGen.CopySet(qd, qe,
|
|
|
- 1529 SymTab.SetWords(dt),
|
|
|
- 1530 SymTab.SetWords(et))
|
|
|
- 1531 ELSIF SymTab.ClassOf(dt) =
|
|
|
- 1532 SymTab.ClRecord THEN
|
|
|
- 1533 QbeGen.CopyRecord(qd, qe,
|
|
|
- 1534 dt)
|
|
|
- 1535 ELSIF SymTab.IsLongFamily(dt) THEN
|
|
|
- 1536 IF wconv THEN
|
|
|
- 1537 QbeGen.WidenLong(qe, ql);
|
|
|
- 1538 QbeGen.ElemStore(qd, ql,
|
|
|
- 1539 dt)
|
|
|
- 1540 ELSE QbeGen.ElemStore(qd, qe,
|
|
|
- 1541 dt)
|
|
|
- 1542 END
|
|
|
- 1543 ELSIF conv THEN
|
|
|
- 1544 QbeGen.ConvIR(qe, qt);
|
|
|
- 1545 QbeGen.ElemStore(qd, qt,
|
|
|
- 1546 dt)
|
|
|
- 1547 ELSE QbeGen.ElemStore(qd, qe,
|
|
|
- 1548 dt)
|
|
|
- 1549 END
|
|
|
- 1550 ELSIF SymTab.ClassOf(dt) =
|
|
|
- 1551 SymTab.ClArray THEN
|
|
|
- 1552 IF (et # SymTab.InvalidType)
|
|
|
- 1553 AND (SymTab.ClassOf(et) = SymTab.ClUStr)
|
|
|
- 1554 AND SymTab.IsUCharArray(dt) THEN
|
|
|
- 1555 QbeGen.UAssign(qd, qe)
|
|
|
- 1556 ELSIF SymTab.StrCompat(dt,
|
|
|
- 1557 et) THEN
|
|
|
- 1558 QbeGen.StrAssign(qd, qe)
|
|
|
- 1559 ELSE
|
|
|
- 1560 QbeGen.CopyArray(qd, qe,
|
|
|
- 1561 dt)
|
|
|
- 1562 END
|
|
|
- 1563 ELSIF SymTab.ClassOf(dt) =
|
|
|
- 1564 SymTab.ClSet THEN
|
|
|
- 1565 QbeGen.CopySet(qd, qe,
|
|
|
- 1566 SymTab.SetWords(dt),
|
|
|
- 1567 SymTab.SetWords(et))
|
|
|
- 1568 ELSIF SymTab.ClassOf(dt) =
|
|
|
- 1569 SymTab.ClRecord THEN
|
|
|
- 1570 QbeGen.CopyRecord(qd, qe, dt)
|
|
|
- 1571 ELSIF (SymTab.ClassOf(dt) =
|
|
|
- 1572 SymTab.ClPtr)
|
|
|
- 1573 OR (SymTab.ClassOf(dt) =
|
|
|
- 1574 SymTab.ClProc) THEN
|
|
|
- 1575 QbeGen.StorePtr(qn, qe)
|
|
|
- 1576 ELSIF SymTab.IsLongFamily(dt) THEN
|
|
|
- 1577 IF wconv THEN
|
|
|
- 1578 QbeGen.WidenLong(qe, ql);
|
|
|
- 1579 QbeGen.StoreLong(qn, ql)
|
|
|
- 1580 ELSE QbeGen.StoreLong(qn, qe)
|
|
|
- 1581 END
|
|
|
- 1582 ELSIF conv THEN
|
|
|
- 1583 QbeGen.ConvIR(qe, qt);
|
|
|
- 1584 QbeGen.StoreVar(qn, qt, TRUE)
|
|
|
- 1585 ELSE
|
|
|
- 1586 QbeGen.StoreVar(qn, qe, isR)
|
|
|
- 1587 END
|
|
|
- 1588 END; .)
|
|
|
- 1589 | ArgList<qn, dt, qd, FALSE, FALSE, methCls, ct2, q2, called>
|
|
|
- 1590 (. astStmt := AstCallNode(astLhs); .)
|
|
|
- 1591 | (* bare `P;`: proper parameterless
|
|
|
- 1592 procedure call; anything else
|
|
|
- 1593 here is 233 (was a bare syntax
|
|
|
- 1594 error before 4.2) *)
|
|
|
- 1595 (. astStmt := AstCallNode(astLhs);
|
|
|
- 1596 IF (dk = SymTab.KindProc)
|
|
|
- 1597 AND NOT sfx THEN
|
|
|
- 1598 res0 := SymTab.ProcRes(qn);
|
|
|
- 1599 IF res0 #
|
|
|
- 1600 SymTab.InvalidType THEN
|
|
|
- 1601 SemError(233)
|
|
|
- 1602 ELSIF SymTab.ProcNPar(qn) #
|
|
|
- 1603 0 THEN
|
|
|
- 1604 SemError(233)
|
|
|
- 1605 ELSE QbeGen.Mangled(qn,
|
|
|
- 1606 SymTab.ProcUid(qn), mg0);
|
|
|
- 1607 QbeGen.CallBegin(mg0,
|
|
|
- 1608 res0,
|
|
|
- 1609 SymTab.ProcDepthOf(qn),
|
|
|
- 1610 SymTab.IsExternal(qn));
|
|
|
- 1611 QbeGen.CallEnd(FALSE, q2)
|
|
|
- 1612 END
|
|
|
- 1613 ELSE SemError(233)
|
|
|
- 1614 END; .) ) .
|
|
|
- 1615 (* Actual-parameter list shared by statement and expression calls.
|
|
|
- 1616 want selects CallEnd's result handling; t/q carry the call
|
|
|
- 1617 value (statement calls discard). Arity/type failures are 233;
|
|
|
- 1618 evaluation code still emits so the .ssa stays assembleable. *)
|
|
|
- 1619 ArgList<pn: SymTab.Name; pt: SymTab.TypeIndex; callee: QbeGen.QVal;
|
|
|
- 1620 want: BOOLEAN; soft: BOOLEAN; methCls: SymTab.TypeIndex;
|
|
|
- 1621 VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal;
|
|
|
- 1622 VAR called: BOOLEAN> (. VAR i, np: CARDINAL;
|
|
|
- 1623 vs: INTEGER;
|
|
|
- 1624 res: SymTab.TypeIndex;
|
|
|
- 1625 mg: QbeGen.QVal;
|
|
|
- 1626 ok, ind, isMeth, va: BOOLEAN; .)
|
|
|
- 1627 = "(" (. called := TRUE;
|
|
|
- 1628 ok := TRUE;
|
|
|
- 1629 ind := FALSE;
|
|
|
- 1630 isMeth := methCls #
|
|
|
- 1631 SymTab.InvalidType;
|
|
|
- 1632 IF isMeth THEN
|
|
|
- 1633 res := SymTab.ClassMethodRes(methCls, pn)
|
|
|
- 1634 ELSIF SymTab.SymKind(pn) = SymTab.KindProc THEN
|
|
|
- 1635 res := SymTab.ProcRes(pn)
|
|
|
- 1636 ELSIF (pt # SymTab.InvalidType)
|
|
|
- 1637 AND (SymTab.ClassOf(pt) = SymTab.ClProc) THEN
|
|
|
- 1638 ind := TRUE;
|
|
|
- 1639 res := SymTab.ProcTypeRes(pt)
|
|
|
- 1640 ELSE SemError(233);
|
|
|
- 1641 ok := FALSE;
|
|
|
- 1642 res := SymTab.InvalidType
|
|
|
- 1643 END;
|
|
|
- 1644 i := 0; .)
|
|
|
- 1645 [ ActParam<pn, pt, ind, methCls, i> (. INC(i); .)
|
|
|
- 1646 { "," ActParam<pn, pt, ind, methCls, i> (. INC(i); .) } ]
|
|
|
- 1647 ")" (. IF ok THEN
|
|
|
- 1648 IF isMeth THEN
|
|
|
- 1649 np := SymTab.ClassMethodNPar(
|
|
|
- 1650 methCls, pn)
|
|
|
- 1651 ELSIF ind THEN
|
|
|
- 1652 np := SymTab.ProcTypeNPar(pt)
|
|
|
- 1653 ELSE np := SymTab.ProcNPar(pn)
|
|
|
- 1654 END;
|
|
|
- 1655 va := (NOT isMeth) AND (NOT ind)
|
|
|
- 1656 AND (SymTab.SymKind(pn) =
|
|
|
- 1657 SymTab.KindProc)
|
|
|
- 1658 AND SymTab.Varargs(pn);
|
|
|
- 1659 IF (i # np) AND NOT va THEN
|
|
|
- 1660 SemError(233); ok := FALSE
|
|
|
- 1661 END
|
|
|
- 1662 END;
|
|
|
- 1663 IF NOT ok THEN
|
|
|
- 1664 t := SymTab.InvalidType;
|
|
|
- 1665 QbeGen.CopyOp("0", q)
|
|
|
- 1666 ELSIF want THEN
|
|
|
- 1667 IF res =
|
|
|
- 1668 SymTab.InvalidType THEN
|
|
|
- 1669 SemError(233);
|
|
|
- 1670 t := SymTab.InvalidType;
|
|
|
- 1671 QbeGen.CopyOp("0", q)
|
|
|
- 1672 ELSE t := res;
|
|
|
- 1673 QbeGen.CopyOp("@", q)
|
|
|
- 1674 END
|
|
|
- 1675 ELSE
|
|
|
- 1676 IF res #
|
|
|
- 1677 SymTab.InvalidType THEN
|
|
|
- 1678 SemError(233)
|
|
|
- 1679 END;
|
|
|
- 1680 t := SymTab.InvalidType;
|
|
|
- 1681 QbeGen.CopyOp("0", q);
|
|
|
- 1682 END; .) .
|
|
|
- 1683 (* One actual: VAR formals take recorded designator addresses
|
|
|
- 1684 (233 otherwise); value formals take converted expressions. *)
|
|
|
- 1685 ActParam<pn: SymTab.Name; pt: SymTab.TypeIndex; ind: BOOLEAN;
|
|
|
- 1686 methCls: SymTab.TypeIndex; i: CARDINAL>
|
|
|
- 1687 (. VAR at, ft: SymTab.TypeIndex;
|
|
|
- 1688 qe, qa, qt: QbeGen.QVal;
|
|
|
- 1689 isV, conv, va: BOOLEAN;
|
|
|
- 1690 cl: CHAR;
|
|
|
- 1691 savedN, aj: CARDINAL;
|
|
|
- 1692 savedArgs: ARRAY [0 .. 31]
|
|
|
- 1693 OF AST.Node;
|
|
|
- 1694 astActual: AST.Node; .)
|
|
|
- 1695 = (. (* Parsing the actual can clobber
|
|
|
- 1696 the enclosing call's argument
|
|
|
- 1697 list (Factor resets astNArgs),
|
|
|
- 1698 so save/restore it. *)
|
|
|
- 1699 savedN := astNArgs; aj := 0;
|
|
|
- 1700 WHILE aj <= HIGH(astArgs) DO
|
|
|
- 1701 savedArgs[aj] := astArgs[aj];
|
|
|
- 1702 INC(aj)
|
|
|
- 1703 END; .)
|
|
|
- 1704 Expr<at, qe> (. astActual := astCur;
|
|
|
- 1705 astNArgs := savedN; aj := 0;
|
|
|
- 1706 WHILE aj <= HIGH(astArgs) DO
|
|
|
- 1707 astArgs[aj] := savedArgs[aj];
|
|
|
- 1708 INC(aj)
|
|
|
- 1709 END;
|
|
|
- 1710 IF astNArgs <= HIGH(astArgs) THEN
|
|
|
- 1711 astArgs[astNArgs] := astCur;
|
|
|
- 1712 INC(astNArgs)
|
|
|
- 1713 END;
|
|
|
- 1714 va := (NOT ind)
|
|
|
- 1715 AND (methCls =
|
|
|
- 1716 SymTab.InvalidType)
|
|
|
- 1717 AND (SymTab.SymKind(pn) =
|
|
|
- 1718 SymTab.KindProc)
|
|
|
- 1719 AND SymTab.Varargs(pn);
|
|
|
- 1720 IF ind THEN
|
|
|
- 1721 ft :=
|
|
|
- 1722 SymTab.ProcTypeParamType(pt,
|
|
|
- 1723 i);
|
|
|
- 1724 isV :=
|
|
|
- 1725 SymTab.ProcTypeParamIsVar(pt,
|
|
|
- 1726 i)
|
|
|
- 1727 ELSIF methCls #
|
|
|
- 1728 SymTab.InvalidType THEN
|
|
|
- 1729 ft :=
|
|
|
- 1730 SymTab.ClassMethodParamType(
|
|
|
- 1731 methCls, pn, i);
|
|
|
- 1732 isV :=
|
|
|
- 1733 SymTab.ClassMethodParamIsVar(
|
|
|
- 1734 methCls, pn, i)
|
|
|
- 1735 ELSE
|
|
|
- 1736 ft := SymTab.ParamType(pn, i);
|
|
|
- 1737 isV := SymTab.ParamIsVar(pn, i)
|
|
|
- 1738 END;
|
|
|
- 1739 IF (at = SymTab.InvalidType) THEN
|
|
|
- 1740 ELSIF ft = SymTab.InvalidType THEN
|
|
|
- 1741 ELSIF isV THEN
|
|
|
- 1742 IF (SymTab.ClassOf(at) = SymTab.ClChar)
|
|
|
- 1743 AND (SymTab.ClassOf(ft) = SymTab.ClArray)
|
|
|
- 1744 AND (SymTab.ClassOf(SymTab.ArrayElem(ft)) = SymTab.ClChar)
|
|
|
- 1745 AND QbeGen.IsImm(qe) THEN
|
|
|
- 1746 ELSIF (AST.Kind(astActual) #
|
|
|
- 1747 AST.NkDesignator)
|
|
|
- 1748 AND (AST.Kind(astActual) # AST.NkStrLit) THEN
|
|
|
- 1749 SemError(233)
|
|
|
- 1750 ELSIF NOT SymTab.VarParamOk(at, ft) THEN
|
|
|
- 1751 SemError(233)
|
|
|
- 1752 END
|
|
|
- 1753 ELSE
|
|
|
- 1754 IF (SymTab.ClassOf(at) = SymTab.ClChar)
|
|
|
- 1755 AND (SymTab.ClassOf(ft) = SymTab.ClArray)
|
|
|
- 1756 AND (SymTab.ClassOf(SymTab.ArrayElem(ft)) = SymTab.ClChar)
|
|
|
- 1757 AND QbeGen.IsImm(qe) THEN
|
|
|
- 1758 ELSIF NOT SymTab.Assignable(at, ft) THEN
|
|
|
- 1759 SemError(233)
|
|
|
- 1760 END
|
|
|
- 1761 END; .) .
|
|
|
- 1762 IfStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 1763 q: QbeGen.QVal;
|
|
|
- 1764 hasElse: BOOLEAN;
|
|
|
- 1765 astCond, astIf, astLast,
|
|
|
- 1766 astNode: AST.Node; .)
|
|
|
- 1767 = "IF" (. hasElse := FALSE; .)
|
|
|
- 1768 Expr<t, q> (. astCond := astCur; astStmt := AST.NoNode;
|
|
|
- 1769 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
- 1770 SemError(214) END; .)
|
|
|
- 1771 "THEN" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkIf);
|
|
|
- 1772 AST.SetChild(astNode, 0, astCond);
|
|
|
- 1773 AST.SetChild(astNode, 1, astStmt);
|
|
|
- 1774 astIf := astNode;
|
|
|
- 1775 astLast := astNode; .)
|
|
|
- 1776 { "ELSIF"
|
|
|
- 1777 Expr<t, q> (. astCond := astCur; astStmt := AST.NoNode;
|
|
|
- 1778 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
- 1779 SemError(214) END; .)
|
|
|
- 1780 "THEN" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkIf);
|
|
|
- 1781 AST.SetChild(astNode, 0, astCond);
|
|
|
- 1782 AST.SetChild(astNode, 1, astStmt);
|
|
|
- 1783 AST.SetChild(astLast, 2, astNode);
|
|
|
- 1784 astLast := astNode; .) }
|
|
|
- 1785 [ "ELSE" (. hasElse := TRUE;
|
|
|
- 1786 astStmt := AST.NoNode; .)
|
|
|
- 1787 [ StatSeq ] (. AST.SetChild(astLast, 2, astStmt); .) ]
|
|
|
- 1788 "END" (. astStmt := astIf; .) .
|
|
|
- 1789 WhileStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 1790 q: QbeGen.QVal;
|
|
|
- 1791 astCond, astNode: AST.Node; .)
|
|
|
- 1792 = "WHILE" (. astStmt := AST.NoNode; .)
|
|
|
- 1793 Expr<t, q> (. astCond := astCur;
|
|
|
- 1794 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
- 1795 SemError(214) END; .)
|
|
|
- 1796 "DO" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkWhile);
|
|
|
- 1797 AST.SetChild(astNode, 0, astCond);
|
|
|
- 1798 AST.SetChild(astNode, 1, astStmt);
|
|
|
- 1799 astStmt := astNode; .)
|
|
|
- 1800 "END" .
|
|
|
- 1801 RepeatStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 1802 q: QbeGen.QVal;
|
|
|
- 1803 astCond, astBody, astNode:
|
|
|
- 1804 AST.Node; .)
|
|
|
- 1805 = "REPEAT" (. astStmt := AST.NoNode; .)
|
|
|
- 1806 [ StatSeq ] (. astBody := astStmt; .)
|
|
|
- 1807 "UNTIL" Expr<t, q> (. astCond := astCur;
|
|
|
- 1808 astNode := AST.MakeNode(AST.NkRepeat);
|
|
|
- 1809 AST.SetChild(astNode, 0, astBody);
|
|
|
- 1810 AST.SetChild(astNode, 1, astCond);
|
|
|
- 1811 astStmt := astNode;
|
|
|
- 1812 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
- 1813 SemError(214) END; .) .
|
|
|
- 1814 LoopStat (. VAR lEnd: QbeGen.QVal; astNode: AST.Node; .)
|
|
|
- 1815 = "LOOP" (. astStmt := AST.NoNode;
|
|
|
- 1816 QbeGen.NewLabel(lEnd);
|
|
|
- 1817 QbeGen.PushLoop(lEnd); .)
|
|
|
- 1818 [ StatSeq ]
|
|
|
- 1819 "END" (. astNode := AST.MakeNode(AST.NkLoop);
|
|
|
- 1820 AST.SetChild(astNode, 0, astStmt);
|
|
|
- 1821 astStmt := astNode;
|
|
|
- 1822 QbeGen.PopLoop; .) .
|
|
|
- 1823 (* FOR with static-sign BY (literal, non-zero; 220 otherwise).
|
|
|
- 1824 Runtime direction would need a compare-select; the literal
|
|
|
- 1825 sign picks cslew/csegew at "DO" time. *)
|
|
|
- 1826 ForStat (. VAR lv: SymTab.Name;
|
|
|
- 1827 tlo, thi, tby:
|
|
|
- 1828 SymTab.TypeIndex;
|
|
|
- 1829 qlo, qhi, qby, qt, qk, qb:
|
|
|
- 1830 QbeGen.QVal;
|
|
|
- 1831 lTop, lBody, lEnd:
|
|
|
- 1832 QbeGen.QVal;
|
|
|
- 1833 by: INTEGER;
|
|
|
- 1834 ok: BOOLEAN;
|
|
|
- 1835 astVar, astLo, astHi, astBy,
|
|
|
- 1836 astNode: AST.Node; .)
|
|
|
- 1837 = "FOR" (. by := 1; .)
|
|
|
- 1838 GetIdent<lv> (. astVar := AST.MakeLeaf(AST.NkIdent, lv);
|
|
|
- 1839 astStmt := AST.NoNode;
|
|
|
- 1840 astBy := AST.NoNode;
|
|
|
- 1841 ok := SymTab.Lookup(lv);
|
|
|
- 1842 IF NOT ok THEN
|
|
|
- 1843 SemError(201)
|
|
|
- 1844 ELSIF (SymTab.SymKind(lv) #
|
|
|
- 1845 SymTab.KindVar)
|
|
|
- 1846 AND (SymTab.SymKind(lv) #
|
|
|
- 1847 SymTab.KindParam) THEN
|
|
|
- 1848 SemError(220); ok := FALSE
|
|
|
- 1849 ELSIF NOT SymTab.IsIntFamily(
|
|
|
- 1850 SymTab.SymType(lv)) THEN
|
|
|
- 1851 SemError(220); ok := FALSE
|
|
|
- 1852 END; .)
|
|
|
- 1853 ":=" Expr<tlo, qlo> (. astLo := astCur;
|
|
|
- 1854 IF NOT SymTab.IsIntFamily(tlo) THEN
|
|
|
- 1855 SemError(220); ok := FALSE
|
|
|
- 1856 END; .)
|
|
|
- 1857 "TO" Expr<thi, qhi> (. astHi := astCur;
|
|
|
- 1858 IF NOT SymTab.IsIntFamily(thi) THEN
|
|
|
- 1859 SemError(220); ok := FALSE
|
|
|
- 1860 END; .)
|
|
|
- 1861 [ "BY" Expr<tby, qby> (. astBy := astCur;
|
|
|
- 1862 IF (tby #
|
|
|
+ 1510 END; .)
|
|
|
+ 1511 | ArgList<qn, dt, qd, FALSE, FALSE, methCls, ct2, q2, called>
|
|
|
+ 1512 (. astStmt := AstCallNode(astLhs); .)
|
|
|
+ 1513 | (* bare `P;`: proper parameterless
|
|
|
+ 1514 procedure call; anything else
|
|
|
+ 1515 here is 233 (was a bare syntax
|
|
|
+ 1516 error before 4.2) *)
|
|
|
+ 1517 (. astStmt := AstCallNode(astLhs);
|
|
|
+ 1518 IF (dk = SymTab.KindProc)
|
|
|
+ 1519 AND NOT sfx THEN
|
|
|
+ 1520 res0 := SymTab.ProcRes(qn);
|
|
|
+ 1521 IF res0 #
|
|
|
+ 1522 SymTab.InvalidType THEN
|
|
|
+ 1523 SemError(233)
|
|
|
+ 1524 ELSIF SymTab.ProcNPar(qn) #
|
|
|
+ 1525 0 THEN
|
|
|
+ 1526 SemError(233)
|
|
|
+ 1527 END
|
|
|
+ 1528 ELSE SemError(233)
|
|
|
+ 1529 END; .) ) .
|
|
|
+ 1530 (* Actual-parameter list shared by statement and expression calls.
|
|
|
+ 1531 want selects CallEnd's result handling; t/q carry the call
|
|
|
+ 1532 value (statement calls discard). Arity/type failures are 233;
|
|
|
+ 1533 evaluation code still emits so the .ssa stays assembleable. *)
|
|
|
+ 1534 ArgList<pn: SymTab.Name; pt: SymTab.TypeIndex; callee: QbeGen.QVal;
|
|
|
+ 1535 want: BOOLEAN; soft: BOOLEAN; methCls: SymTab.TypeIndex;
|
|
|
+ 1536 VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal;
|
|
|
+ 1537 VAR called: BOOLEAN> (. VAR i, np: CARDINAL;
|
|
|
+ 1538 vs: INTEGER;
|
|
|
+ 1539 res: SymTab.TypeIndex;
|
|
|
+ 1540 mg: QbeGen.QVal;
|
|
|
+ 1541 ok, ind, isMeth, va: BOOLEAN; .)
|
|
|
+ 1542 = "(" (. called := TRUE;
|
|
|
+ 1543 ok := TRUE;
|
|
|
+ 1544 ind := FALSE;
|
|
|
+ 1545 isMeth := methCls #
|
|
|
+ 1546 SymTab.InvalidType;
|
|
|
+ 1547 IF isMeth THEN
|
|
|
+ 1548 res := SymTab.ClassMethodRes(methCls, pn)
|
|
|
+ 1549 ELSIF SymTab.SymKind(pn) = SymTab.KindProc THEN
|
|
|
+ 1550 res := SymTab.ProcRes(pn)
|
|
|
+ 1551 ELSIF (pt # SymTab.InvalidType)
|
|
|
+ 1552 AND (SymTab.ClassOf(pt) = SymTab.ClProc) THEN
|
|
|
+ 1553 ind := TRUE;
|
|
|
+ 1554 res := SymTab.ProcTypeRes(pt)
|
|
|
+ 1555 ELSE SemError(233);
|
|
|
+ 1556 ok := FALSE;
|
|
|
+ 1557 res := SymTab.InvalidType
|
|
|
+ 1558 END;
|
|
|
+ 1559 i := 0; .)
|
|
|
+ 1560 [ ActParam<pn, pt, ind, methCls, i> (. INC(i); .)
|
|
|
+ 1561 { "," ActParam<pn, pt, ind, methCls, i> (. INC(i); .) } ]
|
|
|
+ 1562 ")" (. IF ok THEN
|
|
|
+ 1563 IF isMeth THEN
|
|
|
+ 1564 np := SymTab.ClassMethodNPar(
|
|
|
+ 1565 methCls, pn)
|
|
|
+ 1566 ELSIF ind THEN
|
|
|
+ 1567 np := SymTab.ProcTypeNPar(pt)
|
|
|
+ 1568 ELSE np := SymTab.ProcNPar(pn)
|
|
|
+ 1569 END;
|
|
|
+ 1570 va := (NOT isMeth) AND (NOT ind)
|
|
|
+ 1571 AND (SymTab.SymKind(pn) =
|
|
|
+ 1572 SymTab.KindProc)
|
|
|
+ 1573 AND SymTab.Varargs(pn);
|
|
|
+ 1574 IF (i # np) AND NOT va THEN
|
|
|
+ 1575 SemError(233); ok := FALSE
|
|
|
+ 1576 END
|
|
|
+ 1577 END;
|
|
|
+ 1578 IF NOT ok THEN
|
|
|
+ 1579 t := SymTab.InvalidType;
|
|
|
+ 1580 QbeGen.CopyOp("0", q)
|
|
|
+ 1581 ELSIF want THEN
|
|
|
+ 1582 IF res =
|
|
|
+ 1583 SymTab.InvalidType THEN
|
|
|
+ 1584 SemError(233);
|
|
|
+ 1585 t := SymTab.InvalidType;
|
|
|
+ 1586 QbeGen.CopyOp("0", q)
|
|
|
+ 1587 ELSE t := res;
|
|
|
+ 1588 QbeGen.CopyOp("@", q)
|
|
|
+ 1589 END
|
|
|
+ 1590 ELSE
|
|
|
+ 1591 IF res #
|
|
|
+ 1592 SymTab.InvalidType THEN
|
|
|
+ 1593 SemError(233)
|
|
|
+ 1594 END;
|
|
|
+ 1595 t := SymTab.InvalidType;
|
|
|
+ 1596 QbeGen.CopyOp("0", q);
|
|
|
+ 1597 END; .) .
|
|
|
+ 1598 (* One actual: VAR formals take recorded designator addresses
|
|
|
+ 1599 (233 otherwise); value formals take converted expressions. *)
|
|
|
+ 1600 ActParam<pn: SymTab.Name; pt: SymTab.TypeIndex; ind: BOOLEAN;
|
|
|
+ 1601 methCls: SymTab.TypeIndex; i: CARDINAL>
|
|
|
+ 1602 (. VAR at, ft: SymTab.TypeIndex;
|
|
|
+ 1603 qe, qa, qt: QbeGen.QVal;
|
|
|
+ 1604 isV, conv, va: BOOLEAN;
|
|
|
+ 1605 cl: CHAR;
|
|
|
+ 1606 savedN, aj: CARDINAL;
|
|
|
+ 1607 savedArgs: ARRAY [0 .. 31]
|
|
|
+ 1608 OF AST.Node;
|
|
|
+ 1609 astActual: AST.Node; .)
|
|
|
+ 1610 = (. (* Parsing the actual can clobber
|
|
|
+ 1611 the enclosing call's argument
|
|
|
+ 1612 list (Factor resets astNArgs),
|
|
|
+ 1613 so save/restore it. *)
|
|
|
+ 1614 savedN := astNArgs; aj := 0;
|
|
|
+ 1615 WHILE aj <= HIGH(astArgs) DO
|
|
|
+ 1616 savedArgs[aj] := astArgs[aj];
|
|
|
+ 1617 INC(aj)
|
|
|
+ 1618 END; .)
|
|
|
+ 1619 Expr<at, qe> (. astActual := astCur;
|
|
|
+ 1620 astNArgs := savedN; aj := 0;
|
|
|
+ 1621 WHILE aj <= HIGH(astArgs) DO
|
|
|
+ 1622 astArgs[aj] := savedArgs[aj];
|
|
|
+ 1623 INC(aj)
|
|
|
+ 1624 END;
|
|
|
+ 1625 IF astNArgs <= HIGH(astArgs) THEN
|
|
|
+ 1626 astArgs[astNArgs] := astCur;
|
|
|
+ 1627 INC(astNArgs)
|
|
|
+ 1628 END;
|
|
|
+ 1629 va := (NOT ind)
|
|
|
+ 1630 AND (methCls =
|
|
|
+ 1631 SymTab.InvalidType)
|
|
|
+ 1632 AND (SymTab.SymKind(pn) =
|
|
|
+ 1633 SymTab.KindProc)
|
|
|
+ 1634 AND SymTab.Varargs(pn);
|
|
|
+ 1635 IF ind THEN
|
|
|
+ 1636 ft :=
|
|
|
+ 1637 SymTab.ProcTypeParamType(pt,
|
|
|
+ 1638 i);
|
|
|
+ 1639 isV :=
|
|
|
+ 1640 SymTab.ProcTypeParamIsVar(pt,
|
|
|
+ 1641 i)
|
|
|
+ 1642 ELSIF methCls #
|
|
|
+ 1643 SymTab.InvalidType THEN
|
|
|
+ 1644 ft :=
|
|
|
+ 1645 SymTab.ClassMethodParamType(
|
|
|
+ 1646 methCls, pn, i);
|
|
|
+ 1647 isV :=
|
|
|
+ 1648 SymTab.ClassMethodParamIsVar(
|
|
|
+ 1649 methCls, pn, i)
|
|
|
+ 1650 ELSE
|
|
|
+ 1651 ft := SymTab.ParamType(pn, i);
|
|
|
+ 1652 isV := SymTab.ParamIsVar(pn, i)
|
|
|
+ 1653 END;
|
|
|
+ 1654 IF (at = SymTab.InvalidType) THEN
|
|
|
+ 1655 ELSIF ft = SymTab.InvalidType THEN
|
|
|
+ 1656 ELSIF isV THEN
|
|
|
+ 1657 IF (SymTab.ClassOf(at) = SymTab.ClChar)
|
|
|
+ 1658 AND (SymTab.ClassOf(ft) = SymTab.ClArray)
|
|
|
+ 1659 AND (SymTab.ClassOf(SymTab.ArrayElem(ft)) = SymTab.ClChar)
|
|
|
+ 1660 AND QbeGen.IsImm(qe) THEN
|
|
|
+ 1661 ELSIF (AST.Kind(astActual) #
|
|
|
+ 1662 AST.NkDesignator)
|
|
|
+ 1663 AND (AST.Kind(astActual) # AST.NkStrLit) THEN
|
|
|
+ 1664 SemError(233)
|
|
|
+ 1665 ELSIF NOT SymTab.VarParamOk(at, ft) THEN
|
|
|
+ 1666 SemError(233)
|
|
|
+ 1667 END
|
|
|
+ 1668 ELSE
|
|
|
+ 1669 IF (SymTab.ClassOf(at) = SymTab.ClChar)
|
|
|
+ 1670 AND (SymTab.ClassOf(ft) = SymTab.ClArray)
|
|
|
+ 1671 AND (SymTab.ClassOf(SymTab.ArrayElem(ft)) = SymTab.ClChar)
|
|
|
+ 1672 AND QbeGen.IsImm(qe) THEN
|
|
|
+ 1673 ELSIF NOT SymTab.Assignable(at, ft) THEN
|
|
|
+ 1674 SemError(233)
|
|
|
+ 1675 END
|
|
|
+ 1676 END; .) .
|
|
|
+ 1677 IfStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 1678 q: QbeGen.QVal;
|
|
|
+ 1679 hasElse: BOOLEAN;
|
|
|
+ 1680 astCond, astIf, astLast,
|
|
|
+ 1681 astNode: AST.Node; .)
|
|
|
+ 1682 = "IF" (. hasElse := FALSE; .)
|
|
|
+ 1683 Expr<t, q> (. astCond := astCur; astStmt := AST.NoNode;
|
|
|
+ 1684 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
+ 1685 SemError(214) END; .)
|
|
|
+ 1686 "THEN" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkIf);
|
|
|
+ 1687 AST.SetChild(astNode, 0, astCond);
|
|
|
+ 1688 AST.SetChild(astNode, 1, astStmt);
|
|
|
+ 1689 astIf := astNode;
|
|
|
+ 1690 astLast := astNode; .)
|
|
|
+ 1691 { "ELSIF"
|
|
|
+ 1692 Expr<t, q> (. astCond := astCur; astStmt := AST.NoNode;
|
|
|
+ 1693 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
+ 1694 SemError(214) END; .)
|
|
|
+ 1695 "THEN" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkIf);
|
|
|
+ 1696 AST.SetChild(astNode, 0, astCond);
|
|
|
+ 1697 AST.SetChild(astNode, 1, astStmt);
|
|
|
+ 1698 AST.SetChild(astLast, 2, astNode);
|
|
|
+ 1699 astLast := astNode; .) }
|
|
|
+ 1700 [ "ELSE" (. hasElse := TRUE;
|
|
|
+ 1701 astStmt := AST.NoNode; .)
|
|
|
+ 1702 [ StatSeq ] (. AST.SetChild(astLast, 2, astStmt); .) ]
|
|
|
+ 1703 "END" (. astStmt := astIf; .) .
|
|
|
+ 1704 WhileStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 1705 q: QbeGen.QVal;
|
|
|
+ 1706 astCond, astNode: AST.Node; .)
|
|
|
+ 1707 = "WHILE" (. astStmt := AST.NoNode; .)
|
|
|
+ 1708 Expr<t, q> (. astCond := astCur;
|
|
|
+ 1709 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
+ 1710 SemError(214) END; .)
|
|
|
+ 1711 "DO" [ StatSeq ] (. astNode := AST.MakeNode(AST.NkWhile);
|
|
|
+ 1712 AST.SetChild(astNode, 0, astCond);
|
|
|
+ 1713 AST.SetChild(astNode, 1, astStmt);
|
|
|
+ 1714 astStmt := astNode; .)
|
|
|
+ 1715 "END" .
|
|
|
+ 1716 RepeatStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 1717 q: QbeGen.QVal;
|
|
|
+ 1718 astCond, astBody, astNode:
|
|
|
+ 1719 AST.Node; .)
|
|
|
+ 1720 = "REPEAT" (. astStmt := AST.NoNode; .)
|
|
|
+ 1721 [ StatSeq ] (. astBody := astStmt; .)
|
|
|
+ 1722 "UNTIL" Expr<t, q> (. astCond := astCur;
|
|
|
+ 1723 astNode := AST.MakeNode(AST.NkRepeat);
|
|
|
+ 1724 AST.SetChild(astNode, 0, astBody);
|
|
|
+ 1725 AST.SetChild(astNode, 1, astCond);
|
|
|
+ 1726 astStmt := astNode;
|
|
|
+ 1727 IF NOT SymTab.BoolCheck(t) THEN
|
|
|
+ 1728 SemError(214) END; .) .
|
|
|
+ 1729 LoopStat (. VAR lEnd: QbeGen.QVal; astNode: AST.Node; .)
|
|
|
+ 1730 = "LOOP" (. astStmt := AST.NoNode;
|
|
|
+ 1731 QbeGen.NewLabel(lEnd);
|
|
|
+ 1732 QbeGen.PushLoop(lEnd); .)
|
|
|
+ 1733 [ StatSeq ]
|
|
|
+ 1734 "END" (. astNode := AST.MakeNode(AST.NkLoop);
|
|
|
+ 1735 AST.SetChild(astNode, 0, astStmt);
|
|
|
+ 1736 astStmt := astNode;
|
|
|
+ 1737 QbeGen.PopLoop; .) .
|
|
|
+ 1738 (* FOR with static-sign BY (literal, non-zero; 220 otherwise).
|
|
|
+ 1739 Runtime direction would need a compare-select; the literal
|
|
|
+ 1740 sign picks cslew/csegew at "DO" time. *)
|
|
|
+ 1741 ForStat (. VAR lv: SymTab.Name;
|
|
|
+ 1742 tlo, thi, tby:
|
|
|
+ 1743 SymTab.TypeIndex;
|
|
|
+ 1744 qlo, qhi, qby, qt, qk, qb:
|
|
|
+ 1745 QbeGen.QVal;
|
|
|
+ 1746 lTop, lBody, lEnd:
|
|
|
+ 1747 QbeGen.QVal;
|
|
|
+ 1748 by: INTEGER;
|
|
|
+ 1749 ok: BOOLEAN;
|
|
|
+ 1750 astVar, astLo, astHi, astBy,
|
|
|
+ 1751 astNode: AST.Node; .)
|
|
|
+ 1752 = "FOR" (. by := 1; .)
|
|
|
+ 1753 GetIdent<lv> (. astVar := AST.MakeLeaf(AST.NkIdent, lv);
|
|
|
+ 1754 astStmt := AST.NoNode;
|
|
|
+ 1755 astBy := AST.NoNode;
|
|
|
+ 1756 ok := SymTab.Lookup(lv);
|
|
|
+ 1757 IF NOT ok THEN
|
|
|
+ 1758 SemError(201)
|
|
|
+ 1759 ELSIF (SymTab.SymKind(lv) #
|
|
|
+ 1760 SymTab.KindVar)
|
|
|
+ 1761 AND (SymTab.SymKind(lv) #
|
|
|
+ 1762 SymTab.KindParam) THEN
|
|
|
+ 1763 SemError(220); ok := FALSE
|
|
|
+ 1764 ELSIF NOT SymTab.IsIntFamily(
|
|
|
+ 1765 SymTab.SymType(lv)) THEN
|
|
|
+ 1766 SemError(220); ok := FALSE
|
|
|
+ 1767 END; .)
|
|
|
+ 1768 ":=" Expr<tlo, qlo> (. astLo := astCur;
|
|
|
+ 1769 IF NOT SymTab.IsIntFamily(tlo) THEN
|
|
|
+ 1770 SemError(220); ok := FALSE
|
|
|
+ 1771 END; .)
|
|
|
+ 1772 "TO" Expr<thi, qhi> (. astHi := astCur;
|
|
|
+ 1773 IF NOT SymTab.IsIntFamily(thi) THEN
|
|
|
+ 1774 SemError(220); ok := FALSE
|
|
|
+ 1775 END; .)
|
|
|
+ 1776 [ "BY" Expr<tby, qby> (. astBy := astCur;
|
|
|
+ 1777 IF (tby #
|
|
|
+ 1778 SymTab.InvalidType)
|
|
|
+ 1779 AND NOT SymTab.IsIntFamily(tby) THEN
|
|
|
+ 1780 SemError(220); ok := FALSE
|
|
|
+ 1781 END;
|
|
|
+ 1782 IF NOT SymTab.ConstInt(qby, by) THEN
|
|
|
+ 1783 SemError(230); by := 1
|
|
|
+ 1784 ELSIF by = 0 THEN
|
|
|
+ 1785 SemError(220); by := 1
|
|
|
+ 1786 END; .) ]
|
|
|
+ 1787 "DO"
|
|
|
+ 1788 [ StatSeq ]
|
|
|
+ 1789 "END" (. astNode := AST.MakeNode(AST.NkFor);
|
|
|
+ 1790 AST.SetChild(astNode, 0, astVar);
|
|
|
+ 1791 AST.SetChild(astNode, 1, astLo);
|
|
|
+ 1792 AST.SetChild(astNode, 2, astHi);
|
|
|
+ 1793 AST.SetChild(astNode, 3, astBy);
|
|
|
+ 1794 AST.SetChild(astNode, 4, astStmt);
|
|
|
+ 1795 astStmt := astNode;
|
|
|
+ 1796 .) .
|
|
|
+ 1797 CaseStat (. VAR tsel: SymTab.TypeIndex;
|
|
|
+ 1798 qsel, lEnd: QbeGen.QVal;
|
|
|
+ 1799 arm, astNode, astArms,
|
|
|
+ 1800 astArmsTail: AST.Node; .)
|
|
|
+ 1801 = "CASE" Expr<tsel, qsel> (. astNode := AST.MakeNode(AST.NkCase);
|
|
|
+ 1802 AST.SetChild(astNode, 0, astCur);
|
|
|
+ 1803 astArms := AST.NoNode;
|
|
|
+ 1804 astArmsTail := AST.NoNode;
|
|
|
+ 1805 .)
|
|
|
+ 1806 "OF" CaseAlt<tsel, qsel, lEnd, astArms, astArmsTail>
|
|
|
+ 1807 { "|" CaseAlt<tsel, qsel, lEnd, astArms, astArmsTail> }
|
|
|
+ 1808 [ "ELSE" (. astStmt := AST.NoNode; .)
|
|
|
+ 1809 [ StatSeq ] (. arm := AST.MakeNode(AST.NkCaseArm);
|
|
|
+ 1810 AST.SetOp(arm, 1);
|
|
|
+ 1811 AST.SetChild(arm, 0, astStmt);
|
|
|
+ 1812 AstAppend(AST.NkBlock,
|
|
|
+ 1813 astArms, astArmsTail, arm); .) ]
|
|
|
+ 1814 "END" (. AST.SetChild(astNode, 1, astArms);
|
|
|
+ 1815 astStmt := astNode;
|
|
|
+ 1816 .) .
|
|
|
+ 1817 (* Compare-chain lowering: each alternative ends its match-tests
|
|
|
+ 1818 with "jmp lAfter", so the no-match fallthrough skips the body:
|
|
|
+ 1819 "cmp; jnz(lBody,lF); lF: ... ; jmp lAfter; lBody: S; jmp lEnd;
|
|
|
+ 1820 lAfter:". Falls into the next alternative, ELSE, or END. *)
|
|
|
+ 1821 CaseAlt<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
+ 1822 lEnd: QbeGen.QVal; VAR arms, armsTail: AST.Node>
|
|
|
+ 1823 (. VAR arm: AST.Node; .)
|
|
|
+ 1824 = (. arm := AST.MakeNode(AST.NkCaseArm); .)
|
|
|
+ 1825 CaseLabel<tsel, qsel, arm>
|
|
|
+ 1826 { "," CaseLabel<tsel, qsel, arm> }
|
|
|
+ 1827 ":" (. astStmt := AST.NoNode; .)
|
|
|
+ 1828 [ StatSeq ] (. AST.SetChild(arm, AST.NChild(arm),
|
|
|
+ 1829 astStmt);
|
|
|
+ 1830 AstAppend(AST.NkBlock,
|
|
|
+ 1831 arms, armsTail, arm);
|
|
|
+ 1832 .) .
|
|
|
+ 1833 CaseLabel<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
+ 1834 arm: AST.Node>
|
|
|
+ 1835 (. VAR t2, t3: SymTab.TypeIndex;
|
|
|
+ 1836 q2, q3, qc, qd, qe:
|
|
|
+ 1837 QbeGen.QVal;
|
|
|
+ 1838 astLab: AST.Node;
|
|
|
+ 1839 lNext: QbeGen.QVal; .)
|
|
|
+ 1840 = Expr<t2, q2> (. astLab := astCur;
|
|
|
+ 1841 IF (t2 #
|
|
|
+ 1842 SymTab.InvalidType)
|
|
|
+ 1843 AND (tsel #
|
|
|
+ 1844 SymTab.InvalidType)
|
|
|
+ 1845 AND ((SymTab.ClassOf(t2) =
|
|
|
+ 1846 SymTab.ClSet)
|
|
|
+ 1847 OR (SymTab.ClassOf(tsel) =
|
|
|
+ 1848 SymTab.ClSet)) THEN
|
|
|
+ 1849 SemError(230)
|
|
|
+ 1850 ELSIF (t2 #
|
|
|
+ 1851 SymTab.InvalidType)
|
|
|
+ 1852 AND (tsel #
|
|
|
+ 1853 SymTab.InvalidType)
|
|
|
+ 1854 AND NOT SymTab.EqCheck(t2,
|
|
|
+ 1855 tsel) THEN
|
|
|
+ 1856 SemError(213) END;
|
|
|
+ 1857 IF NOT QbeGen.IsImm(q2) THEN
|
|
|
+ 1858 SemError(230)
|
|
|
+ 1859 END; .)
|
|
|
+ 1860 [ ".." Expr<t3, q3> (. astLab := AST.MakeBin(
|
|
|
+ 1861 AST.NkSubrange, 0, astLab, astCur);
|
|
|
+ 1862 IF (t3 #
|
|
|
1863 SymTab.InvalidType)
|
|
|
- 1864 AND NOT SymTab.IsIntFamily(tby) THEN
|
|
|
- 1865 SemError(220); ok := FALSE
|
|
|
- 1866 END;
|
|
|
- 1867 IF NOT SymTab.ConstInt(qby, by) THEN
|
|
|
- 1868 SemError(230); by := 1
|
|
|
- 1869 ELSIF by = 0 THEN
|
|
|
- 1870 SemError(220); by := 1
|
|
|
- 1871 END; .) ]
|
|
|
- 1872 "DO"
|
|
|
- 1873 [ StatSeq ]
|
|
|
- 1874 "END" (. astNode := AST.MakeNode(AST.NkFor);
|
|
|
- 1875 AST.SetChild(astNode, 0, astVar);
|
|
|
- 1876 AST.SetChild(astNode, 1, astLo);
|
|
|
- 1877 AST.SetChild(astNode, 2, astHi);
|
|
|
- 1878 AST.SetChild(astNode, 3, astBy);
|
|
|
- 1879 AST.SetChild(astNode, 4, astStmt);
|
|
|
- 1880 astStmt := astNode;
|
|
|
- 1881 .) .
|
|
|
- 1882 CaseStat (. VAR tsel: SymTab.TypeIndex;
|
|
|
- 1883 qsel, lEnd: QbeGen.QVal;
|
|
|
- 1884 arm, astNode, astArms,
|
|
|
- 1885 astArmsTail: AST.Node; .)
|
|
|
- 1886 = "CASE" Expr<tsel, qsel> (. astNode := AST.MakeNode(AST.NkCase);
|
|
|
- 1887 AST.SetChild(astNode, 0, astCur);
|
|
|
- 1888 astArms := AST.NoNode;
|
|
|
- 1889 astArmsTail := AST.NoNode;
|
|
|
- 1890 .)
|
|
|
- 1891 "OF" CaseAlt<tsel, qsel, lEnd, astArms, astArmsTail>
|
|
|
- 1892 { "|" CaseAlt<tsel, qsel, lEnd, astArms, astArmsTail> }
|
|
|
- 1893 [ "ELSE" (. astStmt := AST.NoNode; .)
|
|
|
- 1894 [ StatSeq ] (. arm := AST.MakeNode(AST.NkCaseArm);
|
|
|
- 1895 AST.SetOp(arm, 1);
|
|
|
- 1896 AST.SetChild(arm, 0, astStmt);
|
|
|
- 1897 AstAppend(AST.NkBlock,
|
|
|
- 1898 astArms, astArmsTail, arm); .) ]
|
|
|
- 1899 "END" (. AST.SetChild(astNode, 1, astArms);
|
|
|
- 1900 astStmt := astNode;
|
|
|
- 1901 .) .
|
|
|
- 1902 (* Compare-chain lowering: each alternative ends its match-tests
|
|
|
- 1903 with "jmp lAfter", so the no-match fallthrough skips the body:
|
|
|
- 1904 "cmp; jnz(lBody,lF); lF: ... ; jmp lAfter; lBody: S; jmp lEnd;
|
|
|
- 1905 lAfter:". Falls into the next alternative, ELSE, or END. *)
|
|
|
- 1906 CaseAlt<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
- 1907 lEnd: QbeGen.QVal; VAR arms, armsTail: AST.Node>
|
|
|
- 1908 (. VAR arm: AST.Node; .)
|
|
|
- 1909 = (. arm := AST.MakeNode(AST.NkCaseArm); .)
|
|
|
- 1910 CaseLabel<tsel, qsel, arm>
|
|
|
- 1911 { "," CaseLabel<tsel, qsel, arm> }
|
|
|
- 1912 ":" (. astStmt := AST.NoNode; .)
|
|
|
- 1913 [ StatSeq ] (. AST.SetChild(arm, AST.NChild(arm),
|
|
|
- 1914 astStmt);
|
|
|
- 1915 AstAppend(AST.NkBlock,
|
|
|
- 1916 arms, armsTail, arm);
|
|
|
- 1917 .) .
|
|
|
- 1918 CaseLabel<tsel: SymTab.TypeIndex; qsel: QbeGen.QVal;
|
|
|
- 1919 arm: AST.Node>
|
|
|
- 1920 (. VAR t2, t3: SymTab.TypeIndex;
|
|
|
- 1921 q2, q3, qc, qd, qe:
|
|
|
- 1922 QbeGen.QVal;
|
|
|
- 1923 astLab: AST.Node;
|
|
|
- 1924 lNext: QbeGen.QVal; .)
|
|
|
- 1925 = Expr<t2, q2> (. astLab := astCur;
|
|
|
- 1926 IF (t2 #
|
|
|
- 1927 SymTab.InvalidType)
|
|
|
- 1928 AND (tsel #
|
|
|
- 1929 SymTab.InvalidType)
|
|
|
- 1930 AND ((SymTab.ClassOf(t2) =
|
|
|
- 1931 SymTab.ClSet)
|
|
|
- 1932 OR (SymTab.ClassOf(tsel) =
|
|
|
- 1933 SymTab.ClSet)) THEN
|
|
|
- 1934 SemError(230)
|
|
|
- 1935 ELSIF (t2 #
|
|
|
- 1936 SymTab.InvalidType)
|
|
|
- 1937 AND (tsel #
|
|
|
- 1938 SymTab.InvalidType)
|
|
|
- 1939 AND NOT SymTab.EqCheck(t2,
|
|
|
- 1940 tsel) THEN
|
|
|
- 1941 SemError(213) END;
|
|
|
- 1942 IF NOT QbeGen.IsImm(q2) THEN
|
|
|
- 1943 SemError(230)
|
|
|
- 1944 END; .)
|
|
|
- 1945 [ ".." Expr<t3, q3> (. astLab := AST.MakeBin(
|
|
|
- 1946 AST.NkSubrange, 0, astLab, astCur);
|
|
|
- 1947 IF (t3 #
|
|
|
- 1948 SymTab.InvalidType)
|
|
|
- 1949 AND (tsel #
|
|
|
- 1950 SymTab.InvalidType)
|
|
|
- 1951 AND NOT SymTab.EqCheck(t3,
|
|
|
- 1952 tsel) THEN
|
|
|
- 1953 SemError(213) END;
|
|
|
- 1954 IF NOT QbeGen.IsImm(q3) THEN
|
|
|
- 1955 SemError(230)
|
|
|
- 1956 END; .) ]
|
|
|
- 1957 (. AST.SetChild(arm,
|
|
|
- 1958 AST.NChild(arm), astLab); .) .
|
|
|
- 1959 ReturnStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 1960 q, qt: QbeGen.QVal;
|
|
|
- 1961 res: SymTab.TypeIndex;
|
|
|
- 1962 hadE, conv: BOOLEAN;
|
|
|
- 1963 astVal, astNode: AST.Node; .)
|
|
|
- 1964 = "RETURN" (. hadE := FALSE; astStmt := AST.NoNode; .)
|
|
|
- 1965 [ Expr<t, q> (. hadE := TRUE; astVal := astCur; .) ]
|
|
|
- 1966 (. astNode := AST.MakeNode(AST.NkReturn);
|
|
|
- 1967 IF hadE THEN
|
|
|
- 1968 AST.SetChild(astNode, 0, astVal)
|
|
|
- 1969 END;
|
|
|
- 1970 astStmt := astNode;
|
|
|
- 1971 conv := FALSE;
|
|
|
- 1972 IF NOT SymTab.InProc() THEN
|
|
|
- 1973 SemError(232)
|
|
|
- 1974 ELSE res := SymTab.CurRes();
|
|
|
- 1975 IF NOT hadE THEN
|
|
|
- 1976 IF res #
|
|
|
- 1977 SymTab.InvalidType THEN
|
|
|
- 1978 SemError(232)
|
|
|
- 1979 END
|
|
|
- 1980 ELSIF (res =
|
|
|
- 1981 SymTab.InvalidType)
|
|
|
- 1982 OR (t #
|
|
|
- 1983 SymTab.InvalidType)
|
|
|
- 1984 AND NOT SymTab.Assignable(t,
|
|
|
- 1985 res) THEN
|
|
|
- 1986 SemError(232)
|
|
|
- 1987 END
|
|
|
- 1988 END; .) .
|
|
|
- 1989 HaltStat (. VAR t: SymTab.TypeIndex;
|
|
|
- 1990 q: QbeGen.QVal;
|
|
|
- 1991 astVal, astNode: AST.Node; .)
|
|
|
- 1992 = "HALT" (. astVal := AST.NoNode; .)
|
|
|
- 1993 [ "(" Expr<t, q> (. astVal := astCur; .) ")" ]
|
|
|
- 1994 (. astNode := AST.MakeNode(AST.NkHalt);
|
|
|
- 1995 IF astVal # AST.NoNode THEN
|
|
|
- 1996 AST.SetChild(astNode, 0, astVal)
|
|
|
- 1997 END;
|
|
|
- 1998 astStmt := astNode;
|
|
|
- 1999 .) .
|
|
|
- 2000 (* Designator: scalar loads, array addresses, and index suffixes.
|
|
|
- 2001 Each index descends one level (bounds-checked, trap on breach);
|
|
|
- 2002 nested levels reload the inner descriptor address. q ends as the
|
|
|
- 2003 value (scalars), the descriptor address (plain arrays), or the
|
|
|
- 2004 element address (indexed); sfx marks the indexed form. *)
|
|
|
- 2005 Design<VAR t: SymTab.TypeIndex; VAR k: INTEGER;
|
|
|
- 2006 VAR q: QbeGen.QVal; VAR qn: SymTab.Name; VAR sfx: BOOLEAN>
|
|
|
- 2007 (. VAR n, fn, mal: SymTab.Name;
|
|
|
- 2008 cls: INTEGER;
|
|
|
- 2009 ic: SymTab.TypeIndex;
|
|
|
- 2010 curT, it, eT, bt:
|
|
|
- 2011 SymTab.TypeIndex;
|
|
|
- 2012 iq, ql, qlo, qhi, qe:
|
|
|
- 2013 QbeGen.QVal;
|
|
|
- 2014 lo, hi: INTEGER;
|
|
|
- 2015 fo: INTEGER;
|
|
|
- 2016 isOpen: BOOLEAN;
|
|
|
- 2017 qb, cv: QbeGen.QVal;
|
|
|
- 2018 fid, fref, slot: INTEGER;
|
|
|
- 2019 r: BOOLEAN;
|
|
|
- 2020 astDes, astSel: AST.Node;
|
|
|
- 2021 fwd: BOOLEAN; .)
|
|
|
- 2022 = GetIdent<n> (. methCls := SymTab.InvalidType;
|
|
|
- 2023 QbeGen.CopyOp(n, qn);
|
|
|
- 2024 sfx := FALSE; fwd := FALSE;
|
|
|
- 2025 fid := 0; fref := 0; slot := 0;
|
|
|
- 2026 IF NOT SymTab.Lookup(n) THEN
|
|
|
- 2027 (* a bare method name inside
|
|
|
- 2028 a CLASS IMPLEMENTATION
|
|
|
- 2029 is a sibling call on
|
|
|
- 2030 THIS *)
|
|
|
- 2031 ic := SymTab.CurImplClass();
|
|
|
- 2032 IF (ic #
|
|
|
- 2033 SymTab.InvalidType)
|
|
|
- 2034 AND SymTab.MethodExists(ic, n) THEN
|
|
|
- 2035 sfx := FALSE;
|
|
|
- 2036 QbeGen.CopyOp("@", q);
|
|
|
- 2037 methCls := ic;
|
|
|
- 2038 k := SymTab.KindProc;
|
|
|
- 2039 t := SymTab.InvalidType
|
|
|
- 2040 ELSIF SymTab.InProc() THEN
|
|
|
- 2041 (* not declared yet: a
|
|
|
- 2042 forward reference to a
|
|
|
- 2043 module-level variable
|
|
|
- 2044 declared further down. *)
|
|
|
- 2045 k := SymTab.KindVar;
|
|
|
- 2046 r := SymTab.FwdVarRef(n, k,
|
|
|
- 2047 fref, t);
|
|
|
- 2048 slot := QbeGen.FwdDesignator();
|
|
|
- 2049 FwdVarNote(fref, slot);
|
|
|
- 2050 fid := slot;
|
|
|
- 2051 QbeGen.FwdAddrOper(fid, q);
|
|
|
- 2052 sfx := TRUE; fwd := TRUE
|
|
|
- 2053 ELSE
|
|
|
- 2054 SemError(201);
|
|
|
- 2055 t :=
|
|
|
- 2056 SymTab.InvalidType;
|
|
|
- 2057 k := -1;
|
|
|
- 2058 QbeGen.CopyOp("0", q)
|
|
|
- 2059 END
|
|
|
- 2060 ELSE
|
|
|
- 2061 t := SymTab.SymType(n);
|
|
|
- 2062 k := SymTab.SymKind(n);
|
|
|
- 2063 IF k = SymTab.KindConst THEN
|
|
|
- 2064 IF SymTab.Equal(n,
|
|
|
- 2065 "TRUE") THEN
|
|
|
- 2066 t := SymTab.BoolType();
|
|
|
- 2067 QbeGen.CopyOp("1", q)
|
|
|
- 2068 ELSIF SymTab.Equal(n,
|
|
|
- 2069 "FALSE") THEN
|
|
|
- 2070 t := SymTab.BoolType();
|
|
|
- 2071 QbeGen.CopyOp("0", q)
|
|
|
- 2072 ELSIF SymTab.Equal(n,
|
|
|
- 2073 "NIL") THEN
|
|
|
- 2074 QbeGen.CopyOp("0", q)
|
|
|
- 2075 ELSE
|
|
|
- 2076 cls :=
|
|
|
- 2077 SymTab.ClassOf(t);
|
|
|
- 2078 IF (t #
|
|
|
- 2079 SymTab.InvalidType)
|
|
|
- 2080 AND ((cls = SymTab.ClInt)
|
|
|
- 2081 OR (cls
|
|
|
- 2082 = SymTab.ClChar)
|
|
|
- 2083 OR (cls
|
|
|
- 2084 = SymTab.ClEnum)
|
|
|
- 2085 OR (cls
|
|
|
- 2086 = SymTab.ClReal)
|
|
|
- 2087 OR (cls
|
|
|
- 2088 = SymTab.ClLong)
|
|
|
- 2089 OR (cls
|
|
|
- 2090 = SymTab.ClNil)) THEN
|
|
|
- 2091 IF cls = SymTab.ClNil THEN
|
|
|
- 2092 QbeGen.CopyOp("0", q)
|
|
|
- 2093 ELSIF ((cls
|
|
|
- 2094 = SymTab.ClInt)
|
|
|
- 2095 OR (cls
|
|
|
- 2096 = SymTab.ClChar)
|
|
|
- 2097 OR (cls
|
|
|
- 2098 = SymTab.ClEnum)
|
|
|
- 2099 OR (cls
|
|
|
- 2100 = SymTab.ClLong))
|
|
|
- 2101 AND SymTab.GetSymVal(n, cv)
|
|
|
- 2102 AND QbeGen.IsImm(cv) THEN
|
|
|
- 2103 QbeGen.CopyOp(cv, q)
|
|
|
- 2104 ELSE
|
|
|
- 2105 QbeGen.LoadVar(n,
|
|
|
- 2106 cls = SymTab.ClReal,
|
|
|
- 2107 q)
|
|
|
- 2108 END
|
|
|
- 2109 ELSIF (cls = SymTab.ClArray)
|
|
|
- 2110 OR (cls = SymTab.ClRecord)
|
|
|
- 2111 OR (cls = SymTab.ClClass)
|
|
|
- 2112 OR (cls = SymTab.ClStr)
|
|
|
- 2113 OR (cls = SymTab.ClUStr) THEN
|
|
|
- 2114 (* aggregate constant:
|
|
|
- 2115 its value IS the
|
|
|
- 2116 descriptor address *)
|
|
|
- 2117 IF SymTab.GetSymVal(n, cv) THEN
|
|
|
- 2118 QbeGen.CopyOp(cv, q)
|
|
|
- 2119 ELSE
|
|
|
- 2120 QbeGen.CopyOp("0", q)
|
|
|
- 2121 END
|
|
|
- 2122 ELSE
|
|
|
- 2123 IF t #
|
|
|
- 2124 SymTab.InvalidType THEN
|
|
|
- 2125 SemError(230)
|
|
|
- 2126 END;
|
|
|
- 2127 QbeGen.CopyOp("0", q)
|
|
|
- 2128 END
|
|
|
- 2129 END
|
|
|
- 2130 ELSIF (k = SymTab.KindVar)
|
|
|
- 2131 OR (k = SymTab.KindParam) THEN
|
|
|
- 2132 cls := SymTab.ClassOf(t);
|
|
|
- 2133 IF (cls # SymTab.ClInt)
|
|
|
- 2134 AND (cls # SymTab.ClBool)
|
|
|
- 2135 AND (cls # SymTab.ClChar)
|
|
|
- 2136 AND (cls # SymTab.ClUChar)
|
|
|
- 2137 AND (cls # SymTab.ClEnum)
|
|
|
- 2138 AND (cls # SymTab.ClReal)
|
|
|
- 2139 AND (cls # SymTab.ClPtr)
|
|
|
- 2140 AND (cls # SymTab.ClProc)
|
|
|
- 2141 AND (cls # SymTab.ClLong)
|
|
|
- 2142 AND (cls # SymTab.ClArray)
|
|
|
- 2143 AND (cls # SymTab.ClSet)
|
|
|
- 2144 AND (cls # SymTab.ClRecord)
|
|
|
- 2145 AND (cls # SymTab.ClUStr)
|
|
|
- 2146 AND (cls # SymTab.ClClass) THEN
|
|
|
- 2147 SemError(230);
|
|
|
- 2148 QbeGen.CopyOp("0", q)
|
|
|
- 2149 ELSE QbeGen.CopyOp("@", q)
|
|
|
- 2150 END
|
|
|
- 2151 ELSE QbeGen.CopyOp("0", q);
|
|
|
- 2152 IF k = SymTab.KindImport THEN
|
|
|
- 2153 SemError(230)
|
|
|
- 2154 ELSIF k =
|
|
|
- 2155 SymTab.KindProc THEN
|
|
|
- 2156 (* bare procedure name:
|
|
|
- 2157 a following ArgList
|
|
|
- 2158 makes it a call;
|
|
|
- 2159 otherwise Fact
|
|
|
- 2160 reports 230 *)
|
|
|
- 2161 ELSE
|
|
|
- 2162 IF k = SymTab.KindField THEN
|
|
|
- 2163 IF QbeGen.TopWith(qb) THEN
|
|
|
- 2164 sfx := TRUE
|
|
|
- 2165 ELSE SemError(230);
|
|
|
- 2166 QbeGen.CopyOp("0", q)
|
|
|
- 2167 END
|
|
|
- 2168 END
|
|
|
- 2169 END
|
|
|
- 2170 END
|
|
|
- 2171 END; .)
|
|
|
- 2172 (. astDes := AST.MakeNode(AST.NkDesignator);
|
|
|
- 2173 AST.SetChild(astDes, AST.NChild(astDes), AST.MakeLeaf(AST.NkIdent, n));
|
|
|
- 2174 IF fwd THEN AST.SetOp(astDes, 1) END; .)
|
|
|
- 2175 { "[" Expr<it, iq>
|
|
|
- 2176 (. AST.SetChild(astDes, AST.NChild(astDes),
|
|
|
- 2177 AST.MakeUn(AST.NkSelector, AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
- 2178 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2179 SymTab.ClArray THEN
|
|
|
- 2180 SemError(217);
|
|
|
- 2181 t := SymTab.InvalidType
|
|
|
- 2182 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
- 2183 AND (SymTab.ClassOf(it) #
|
|
|
- 2184 SymTab.ClChar)
|
|
|
- 2185 AND (SymTab.ClassOf(it) #
|
|
|
- 2186 SymTab.ClEnum) THEN
|
|
|
- 2187 SemError(218);
|
|
|
- 2188 t := SymTab.InvalidType
|
|
|
- 2189 ELSE
|
|
|
- 2190 eT := SymTab.ArrayElem(t);
|
|
|
- 2191 t := eT; sfx := TRUE
|
|
|
- 2192 END; .)
|
|
|
- 2193 { "," Expr<it, iq>
|
|
|
- 2194 (. AST.SetChild(astDes, AST.NChild(astDes),
|
|
|
- 2195 AST.MakeUn(AST.NkSelector, AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
- 2196 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2197 SymTab.ClArray THEN
|
|
|
- 2198 SemError(217);
|
|
|
- 2199 t := SymTab.InvalidType
|
|
|
- 2200 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
- 2201 AND (SymTab.ClassOf(it) #
|
|
|
- 2202 SymTab.ClChar)
|
|
|
- 2203 AND (SymTab.ClassOf(it) #
|
|
|
- 2204 SymTab.ClEnum) THEN
|
|
|
- 2205 SemError(218);
|
|
|
- 2206 t := SymTab.InvalidType
|
|
|
- 2207 ELSE
|
|
|
- 2208 eT := SymTab.ArrayElem(t);
|
|
|
- 2209 t := eT; sfx := TRUE
|
|
|
- 2210 END; .) }
|
|
|
- 2211 "]"
|
|
|
- 2212 | "." GetIdent<fn>
|
|
|
- 2213 (. astSel := AST.MakeNode(AST.NkSelector);
|
|
|
- 2214 AST.SetOp(astSel, AST.SelField);
|
|
|
- 2215 AST.SetChild(astSel, 0, AST.MakeLeaf(AST.NkIdent, fn));
|
|
|
- 2216 AST.SetChild(astDes, AST.NChild(astDes), astSel); IF k = SymTab.KindModule THEN
|
|
|
- 2217 (* qualified L.x: materialize
|
|
|
- 2218 the export, then load it *)
|
|
|
- 2219 IF NOT SymTab.MaterializeAlias(n,
|
|
|
- 2220 fn, mal) THEN
|
|
|
- 2221 SemError(201);
|
|
|
- 2222 t := SymTab.InvalidType;
|
|
|
- 2223 QbeGen.CopyOp("0", q)
|
|
|
- 2224 ELSE
|
|
|
- 2225 QbeGen.CopyOp(mal, qn);
|
|
|
- 2226 t := SymTab.SymType(mal);
|
|
|
- 2227 k := SymTab.SymKind(mal);
|
|
|
- 2228 sfx := FALSE;
|
|
|
- 2229 IF k = SymTab.KindProc THEN
|
|
|
- 2230 (* call: ArgList supplies
|
|
|
- 2231 the value *)
|
|
|
- 2232 QbeGen.CopyOp("0", q)
|
|
|
- 2233 END
|
|
|
- 2234 END
|
|
|
- 2235 ELSIF t = SymTab.InvalidType THEN
|
|
|
- 2236 ELSIF (SymTab.ClassOf(t) #
|
|
|
- 2237 SymTab.ClRecord)
|
|
|
- 2238 AND (SymTab.ClassOf(t) #
|
|
|
- 2239 SymTab.ClClass) THEN
|
|
|
- 2240 SemError(215);
|
|
|
- 2241 t := SymTab.InvalidType
|
|
|
- 2242 ELSIF (SymTab.ClassOf(t) =
|
|
|
- 2243 SymTab.ClClass)
|
|
|
- 2244 AND SymTab.MethodExists(t, fn) THEN
|
|
|
- 2245 (* obj.Method: bind the
|
|
|
- 2246 method and pass obj as
|
|
|
- 2247 the hidden receiver; q
|
|
|
- 2248 already holds the
|
|
|
- 2249 object's address *)
|
|
|
- 2250 QbeGen.CopyOp(fn, n);
|
|
|
- 2251 QbeGen.CopyOp(fn, qn);
|
|
|
- 2252 methCls := t;
|
|
|
- 2253 k := SymTab.KindProc;
|
|
|
- 2254 t := SymTab.InvalidType
|
|
|
- 2255 ELSIF NOT SymTab.FieldExists(t,
|
|
|
- 2256 fn) THEN
|
|
|
- 2257 SemError(216);
|
|
|
- 2258 t := SymTab.InvalidType
|
|
|
- 2259 ELSE
|
|
|
- 2260 t := SymTab.FieldType(t, fn);
|
|
|
- 2261 sfx := TRUE
|
|
|
- 2262 END; .)
|
|
|
- 2263 | "^"
|
|
|
- 2264 (. astSel := AST.MakeNode(AST.NkSelector);
|
|
|
- 2265 AST.SetOp(astSel, AST.SelDeref);
|
|
|
- 2266 AST.SetChild(astDes, AST.NChild(astDes), astSel); IF t = SymTab.InvalidType THEN
|
|
|
- 2267 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2268 SymTab.ClPtr THEN
|
|
|
- 2269 SemError(219);
|
|
|
- 2270 t := SymTab.InvalidType
|
|
|
- 2271 ELSE
|
|
|
- 2272 bt := SymTab.PtrBase(t);
|
|
|
- 2273 IF bt = SymTab.InvalidType THEN
|
|
|
- 2274 ELSE
|
|
|
- 2275 t := bt;
|
|
|
- 2276 sfx := TRUE
|
|
|
- 2277 END
|
|
|
- 2278 END; .) } (. astCur := astDes; .) .
|
|
|
- 2279 (* Result suffix (ISO component after a function call): `F()^`,
|
|
|
- 2280 `F()[i]`, `F().field`. The call result is in t/q with sfx FALSE
|
|
|
- 2281 (a value, or a descriptor address for aggregates); each component
|
|
|
- 2282 descends one level exactly like the Design components. *)
|
|
|
- 2283 ResultComp<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal;
|
|
|
- 2284 VAR sfx: BOOLEAN; VAR node: AST.Node> (. VAR it, eT, bt: SymTab.TypeIndex;
|
|
|
- 2285 iq, ql, qlo, qhi, qe, qb:
|
|
|
- 2286 QbeGen.QVal;
|
|
|
- 2287 lo, hi, fo: INTEGER;
|
|
|
- 2288 isOpen: BOOLEAN;
|
|
|
- 2289 fname: SymTab.Name;
|
|
|
- 2290 astWrap, astSel: AST.Node; .)
|
|
|
- 2291 = "[" Expr<it, iq>
|
|
|
- 2292 (. IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
- 2293 astWrap := AST.MakeNode(
|
|
|
- 2294 AST.NkDesignator);
|
|
|
- 2295 AST.SetChild(astWrap, 0, node);
|
|
|
- 2296 node := astWrap
|
|
|
- 2297 END;
|
|
|
- 2298 AST.SetChild(node, AST.NChild(node),
|
|
|
- 2299 AST.MakeUn(AST.NkSelector,
|
|
|
- 2300 AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
- 2301 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2302 SymTab.ClArray THEN
|
|
|
- 2303 SemError(217);
|
|
|
- 2304 t := SymTab.InvalidType
|
|
|
- 2305 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
- 2306 AND (SymTab.ClassOf(it) # SymTab.ClChar)
|
|
|
- 2307 AND (SymTab.ClassOf(it) # SymTab.ClEnum) THEN
|
|
|
- 2308 SemError(218);
|
|
|
- 2309 t := SymTab.InvalidType
|
|
|
- 2310 ELSE
|
|
|
- 2311 eT := SymTab.ArrayElem(t);
|
|
|
- 2312 t := eT; sfx := TRUE
|
|
|
- 2313 END; .)
|
|
|
- 2314 "]"
|
|
|
- 2315 | "." GetIdent<fname>
|
|
|
- 2316 (. IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
- 2317 astWrap := AST.MakeNode(
|
|
|
- 2318 AST.NkDesignator);
|
|
|
- 2319 AST.SetChild(astWrap, 0, node);
|
|
|
- 2320 node := astWrap
|
|
|
- 2321 END;
|
|
|
- 2322 AST.SetChild(node, AST.NChild(node),
|
|
|
- 2323 AST.MakeUn(AST.NkSelector,
|
|
|
- 2324 AST.SelField,
|
|
|
- 2325 AST.MakeLeaf(AST.NkIdent,
|
|
|
- 2326 fname))); IF t = SymTab.InvalidType THEN
|
|
|
- 2327 ELSIF (SymTab.ClassOf(t) #
|
|
|
- 2328 SymTab.ClRecord)
|
|
|
- 2329 AND (SymTab.ClassOf(t) # SymTab.ClClass) THEN
|
|
|
- 2330 SemError(215);
|
|
|
- 2331 t := SymTab.InvalidType
|
|
|
- 2332 ELSIF NOT SymTab.FieldExists(t,
|
|
|
- 2333 fname) THEN
|
|
|
- 2334 SemError(216);
|
|
|
- 2335 t := SymTab.InvalidType
|
|
|
- 2336 ELSE
|
|
|
- 2337 t := SymTab.FieldType(t, fname);
|
|
|
- 2338 sfx := TRUE
|
|
|
- 2339 END; .)
|
|
|
- 2340 | "^" (. IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
- 2341 astWrap := AST.MakeNode(
|
|
|
- 2342 AST.NkDesignator);
|
|
|
- 2343 AST.SetChild(astWrap, 0, node);
|
|
|
- 2344 node := astWrap
|
|
|
- 2345 END;
|
|
|
- 2346 astSel := AST.MakeNode(AST.NkSelector);
|
|
|
- 2347 AST.SetOp(astSel, AST.SelDeref);
|
|
|
- 2348 AST.SetChild(node,
|
|
|
- 2349 AST.NChild(node), astSel); IF t = SymTab.InvalidType THEN
|
|
|
- 2350 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2351 SymTab.ClPtr THEN
|
|
|
- 2352 SemError(219);
|
|
|
- 2353 t := SymTab.InvalidType
|
|
|
- 2354 ELSE
|
|
|
- 2355 bt := SymTab.PtrBase(t);
|
|
|
- 2356 IF bt # SymTab.InvalidType THEN
|
|
|
- 2357 t := bt; sfx := TRUE
|
|
|
- 2358 END
|
|
|
- 2359 END; .) .
|
|
|
- 2360 Expr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2361 (. VAR t2: SymTab.TypeIndex;
|
|
|
- 2362 op: INTEGER;
|
|
|
- 2363 q2, qt, wl: QbeGen.QVal;
|
|
|
- 2364 astA, astB: AST.Node;
|
|
|
- 2365 astOp: INTEGER;
|
|
|
- 2366 astMade: BOOLEAN;
|
|
|
- 2367 isR: BOOLEAN; .)
|
|
|
- 2368 = SimExpr<t, q> (. astA := astCur; astMade := FALSE; .)
|
|
|
- 2369 [ Rel<op> SimExpr<t2, q2>
|
|
|
- 2370 (. astB := astCur; astMade := TRUE;
|
|
|
- 2371 astOp := AST.OpEq;
|
|
|
- 2372 IF op = SymTab.OpNeq1 THEN astOp := AST.OpNe
|
|
|
- 2373 ELSIF op = SymTab.OpNeq2 THEN astOp := AST.OpNe
|
|
|
- 2374 ELSIF op = SymTab.OpLt THEN astOp := AST.OpLt
|
|
|
- 2375 ELSIF op = SymTab.OpLe THEN astOp := AST.OpLe
|
|
|
- 2376 ELSIF op = SymTab.OpGt THEN astOp := AST.OpGt
|
|
|
- 2377 ELSIF op = SymTab.OpGe THEN astOp := AST.OpGe
|
|
|
- 2378 ELSIF op = SymTab.OpIn THEN astOp := AST.OpIn
|
|
|
- 2379 END;
|
|
|
- 2380 IF op = SymTab.OpIn THEN
|
|
|
- 2381 IF SymTab.InCheck(t, t2) THEN
|
|
|
- 2382 IF (t = SymTab.InvalidType)
|
|
|
- 2383 OR (t2 = SymTab.InvalidType) THEN
|
|
|
- 2384 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
- 2385 ELSE
|
|
|
- 2386 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2387 END
|
|
|
- 2388 ELSE SemError(222); t := SymTab.InvalidType;
|
|
|
- 2389 QbeGen.CopyOp("0", q)
|
|
|
- 2390 END
|
|
|
- 2391 ELSIF SymTab.RelCheck(t, t2, op) THEN
|
|
|
- 2392 IF (t = SymTab.InvalidType)
|
|
|
- 2393 OR (t2 = SymTab.InvalidType) THEN
|
|
|
- 2394 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
- 2395 ELSIF (SymTab.ClassOf(t) = SymTab.ClPtr)
|
|
|
- 2396 OR (SymTab.ClassOf(t2) = SymTab.ClPtr) THEN
|
|
|
- 2397 IF SymTab.IsFwdVar(t) OR SymTab.IsFwdVar(t2) THEN
|
|
|
- 2398 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2399 ELSIF (op # SymTab.OpEq) AND (op # SymTab.OpNeq1)
|
|
|
- 2400 AND (op # SymTab.OpNeq2) THEN
|
|
|
- 2401 SemError(213); t := SymTab.InvalidType;
|
|
|
- 2402 QbeGen.CopyOp("0", q)
|
|
|
- 2403 ELSE
|
|
|
- 2404 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2405 END
|
|
|
- 2406 ELSIF (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 2407 OR (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 2408 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2409 ELSIF SymTab.StrCompat(t, t2) THEN
|
|
|
- 2410 QbeGen.StrEq(op, q, q2, qt);
|
|
|
- 2411 t := SymTab.BoolType(); QbeGen.CopyOp(qt, q)
|
|
|
- 2412 ELSIF SymTab.IsLongFamily(t)
|
|
|
- 2413 OR SymTab.IsLongFamily(t2) THEN
|
|
|
- 2414 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2415 ELSE
|
|
|
- 2416 t := SymTab.BoolType();
|
|
|
- 2417 QbeGen.CopyOp("@", q)
|
|
|
- 2418 END
|
|
|
- 2419 ELSE SemError(213); t := SymTab.InvalidType;
|
|
|
- 2420 QbeGen.CopyOp("0", q)
|
|
|
- 2421 END;
|
|
|
- 2422 astCur := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB); .) ]
|
|
|
- 2423 (. IF NOT astMade THEN astCur := astA END; .) .
|
|
|
- 2424 Rel<VAR op: INTEGER>
|
|
|
- 2425 = "=" (. op := SymTab.OpEq; .)
|
|
|
- 2426 | "#" (. op := SymTab.OpNeq1; .)
|
|
|
- 2427 | "<" (. op := SymTab.OpLt; .)
|
|
|
- 2428 | "<=" (. op := SymTab.OpLe; .)
|
|
|
- 2429 | ">" (. op := SymTab.OpGt; .)
|
|
|
- 2430 | ">=" (. op := SymTab.OpGe; .)
|
|
|
- 2431 | "IN" (. op := SymTab.OpIn; .) .
|
|
|
- 2432 SimExpr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2433 (. VAR t2, res2, lt, rt:
|
|
|
- 2434 SymTab.TypeIndex;
|
|
|
- 2435 op: INTEGER;
|
|
|
- 2436 q2, qt, wq, qf, q2a, q2b:
|
|
|
- 2437 QbeGen.QVal;
|
|
|
- 2438 neg, isR, isL, folded:
|
|
|
- 2439 BOOLEAN;
|
|
|
- 2440 fok: BOOLEAN;
|
|
|
- 2441 lw, rw, mw: CARDINAL;
|
|
|
- 2442 lTrue, lNext, lDone, qr, qs: QbeGen.QVal;
|
|
|
- 2443 astA, astB: AST.Node;
|
|
|
- 2444 astSign, astOp: INTEGER; .)
|
|
|
- 2445 = (. neg := FALSE; astSign := 0; .)
|
|
|
- 2446 [ "+" (. neg := TRUE; astSign := 1; .)
|
|
|
- 2447 | "-" (. neg := TRUE; astSign := -1; .) ]
|
|
|
- 2448 Term<t, q> (. astA := astCur;
|
|
|
- 2449 IF neg AND QbeGen.IsImm(q) THEN
|
|
|
- 2450 QbeGen.NegFold(q, q)
|
|
|
- 2451 END;
|
|
|
- 2452 IF astSign < 0 THEN
|
|
|
- 2453 astCur := AST.MakeUn(
|
|
|
- 2454 AST.NkUnary, AST.OpSub, astA);
|
|
|
- 2455 astA := astCur
|
|
|
- 2456 END; .)
|
|
|
- 2457 { AddOp<op> (. IF op = SymTab.OpOr THEN
|
|
|
- 2458 QbeGen.DelayBegin END; .)
|
|
|
- 2459 Term<t2, q2> (. astB := astCur; IF op = SymTab.OpOr THEN
|
|
|
- 2460 QbeGen.DelayEnd END; .)
|
|
|
- 2461 (. astOp := AST.OpAdd;
|
|
|
- 2462 IF op = SymTab.OpSub THEN astOp := AST.OpSub
|
|
|
- 2463 ELSIF op = SymTab.OpOr THEN astOp := AST.OpOr END;
|
|
|
- 2464 astA := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB);
|
|
|
- 2465 astCur := astA;
|
|
|
- 2466 IF op = SymTab.OpOr THEN
|
|
|
- 2467 (* short-circuit: if q is true the RHS is skipped *)
|
|
|
- 2468 IF SymTab.BoolCheck(t) AND SymTab.BoolCheck(t2) THEN
|
|
|
- 2469 t := SymTab.BoolType()
|
|
|
- 2470 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
- 2471 IF t # SymTab.InvalidType THEN
|
|
|
- 2472 QbeGen.CopyOp("@", q)
|
|
|
- 2473 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2474 END
|
|
|
- 2475 ELSIF (op = SymTab.OpAdd)
|
|
|
- 2476 AND (SymTab.UStrCompat(t, t2)
|
|
|
- 2477 OR ((SymTab.ClassOf(t) = SymTab.ClUChar)
|
|
|
- 2478 AND (SymTab.ClassOf(t2) = SymTab.ClUStr))
|
|
|
- 2479 OR ((SymTab.ClassOf(t) = SymTab.ClUStr)
|
|
|
- 2480 AND (SymTab.ClassOf(t2) = SymTab.ClUChar))
|
|
|
- 2481 OR ((SymTab.ClassOf(t) = SymTab.ClUChar)
|
|
|
- 2482 AND (SymTab.ClassOf(t2) = SymTab.ClUChar))) THEN
|
|
|
- 2483 (* UString concatenation: a UCHAR operand becomes a
|
|
|
- 2484 1-codepoint UString; the result is a descriptor in the
|
|
|
- 2485 shim's concat buffer. Work on copies so neither
|
|
|
- 2486 operand is clobbered. *)
|
|
|
- 2487 t := SymTab.NewUStr();
|
|
|
- 2488 QbeGen.CopyOp("@", q)
|
|
|
- 2489 ELSIF (op = SymTab.OpAdd)
|
|
|
- 2490 AND (SymTab.StrCompat(t, t2)
|
|
|
- 2491 OR (SymTab.IsStrType(t)
|
|
|
- 2492 AND (SymTab.ClassOf(t2) = SymTab.ClChar))
|
|
|
- 2493 OR ((SymTab.ClassOf(t) = SymTab.ClChar)
|
|
|
- 2494 AND SymTab.IsStrType(t2))) THEN
|
|
|
- 2495 (* string concatenation; a CHAR operand becomes a
|
|
|
- 2496 1-character string literal. When both operands are
|
|
|
- 2497 constants, fold to a single string literal so a
|
|
|
- 2498 constructor element stays compile-time. *)
|
|
|
- 2499 QbeGen.StrFold(q, q2, SymTab.ClassOf(t), SymTab.ClassOf(t2),
|
|
|
- 2500 qt, fok);
|
|
|
- 2501 IF fok THEN QbeGen.CopyOp(qt, q)
|
|
|
- 2502 ELSE QbeGen.CopyOp("@", q)
|
|
|
- 2503 END;
|
|
|
- 2504 t := SymTab.NewStr()
|
|
|
- 2505 ELSIF (t # SymTab.InvalidType) AND (t2 # SymTab.InvalidType)
|
|
|
- 2506 AND (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 2507 AND (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 2508 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
- 2509 mw := lw;
|
|
|
- 2510 IF rw > mw THEN mw := rw END;
|
|
|
- 2511 t := SymTab.NewSet(
|
|
|
- 2512 SymTab.NewSubR(0,
|
|
|
- 2513 VAL(INTEGER, mw) * 32 - 1));
|
|
|
- 2514 QbeGen.CopyOp("@", q)
|
|
|
- 2515 ELSE
|
|
|
- 2516 IF SymTab.ArithCheck(t, t2, FALSE, res2) THEN
|
|
|
- 2517 lt := t; rt := t2; t := res2
|
|
|
- 2518 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
- 2519 IF t # SymTab.InvalidType THEN
|
|
|
- 2520 isL := SymTab.IsLongFamily(t);
|
|
|
- 2521 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
- 2522 folded := FALSE;
|
|
|
- 2523 IF (NOT isL) AND (NOT isR)
|
|
|
- 2524 AND QbeGen.IsImm(q) AND QbeGen.IsImm(q2) THEN
|
|
|
- 2525 IF op = SymTab.OpAdd THEN
|
|
|
- 2526 folded := QbeGen.Fold2(0, q, q2, qf)
|
|
|
- 2527 ELSE
|
|
|
- 2528 folded := QbeGen.Fold2(1, q, q2, qf)
|
|
|
- 2529 END
|
|
|
- 2530 END;
|
|
|
- 2531 IF folded THEN QbeGen.CopyOp(qf, q)
|
|
|
- 2532 ELSE
|
|
|
- 2533 QbeGen.CopyOp("@", q)
|
|
|
- 2534 END
|
|
|
- 2535 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2536 END
|
|
|
- 2537 END; .) } .
|
|
|
- 2538 AddOp<VAR op: INTEGER>
|
|
|
- 2539 = "+" (. op := SymTab.OpAdd; .)
|
|
|
- 2540 | "-" (. op := SymTab.OpSub; .)
|
|
|
- 2541 | "OR" (. op := SymTab.OpOr; .) .
|
|
|
- 2542 Term<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2543 (. VAR t2, res2, lt, rt:
|
|
|
- 2544 SymTab.TypeIndex;
|
|
|
- 2545 op: INTEGER;
|
|
|
- 2546 q2, qt, wq, qf:
|
|
|
- 2547 QbeGen.QVal;
|
|
|
- 2548 isR, isL, folded: BOOLEAN;
|
|
|
- 2549 lw, rw, mw: CARDINAL;
|
|
|
- 2550 lNext, lFalse, lDone, qr, qs: QbeGen.QVal;
|
|
|
- 2551 astA, astB: AST.Node;
|
|
|
- 2552 astOp: INTEGER; .)
|
|
|
- 2553 = Fact<t, q> (. astA := astCur; .) { MulOp<op>
|
|
|
- 2554 Fact<t2, q2> (. astB := astCur; .)
|
|
|
- 2555 (. astOp := AST.OpMul;
|
|
|
- 2556 IF op = SymTab.OpSlash THEN astOp := AST.OpDiv
|
|
|
- 2557 ELSIF op = SymTab.OpDiv THEN astOp := AST.OpDiv
|
|
|
- 2558 ELSIF op = SymTab.OpMod THEN astOp := AST.OpMod
|
|
|
- 2559 ELSIF op = SymTab.OpAnd THEN astOp := AST.OpAnd END;
|
|
|
- 2560 astA := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB);
|
|
|
- 2561 astCur := astA;
|
|
|
- 2562 IF op = SymTab.OpAnd THEN
|
|
|
- 2563 (* short-circuit: if q is false the RHS is skipped *)
|
|
|
- 2564 IF SymTab.BoolCheck(t) AND SymTab.BoolCheck(t2) THEN
|
|
|
- 2565 t := SymTab.BoolType()
|
|
|
- 2566 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
- 2567 IF t # SymTab.InvalidType THEN QbeGen.CopyOp("@", q)
|
|
|
- 2568 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2569 END
|
|
|
- 2570 ELSIF (t # SymTab.InvalidType) AND (t2 # SymTab.InvalidType)
|
|
|
- 2571 AND (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 2572 AND (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 2573 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
- 2574 mw := lw;
|
|
|
- 2575 IF rw > mw THEN mw := rw END;
|
|
|
- 2576 t := SymTab.NewSet(
|
|
|
- 2577 SymTab.NewSubR(0,
|
|
|
- 2578 VAL(INTEGER, mw) * 32 - 1));
|
|
|
- 2579 QbeGen.CopyOp("@", q)
|
|
|
- 2580 ELSE
|
|
|
- 2581 IF SymTab.ArithCheck(t, t2,
|
|
|
- 2582 (op = SymTab.OpDiv) OR (op = SymTab.OpMod),
|
|
|
- 2583 res2) THEN
|
|
|
- 2584 lt := t; rt := t2; t := res2
|
|
|
- 2585 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
- 2586 IF t # SymTab.InvalidType THEN
|
|
|
- 2587 isL := SymTab.IsLongFamily(t);
|
|
|
- 2588 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
- 2589 folded := FALSE;
|
|
|
- 2590 IF (NOT isL) AND (NOT isR)
|
|
|
- 2591 AND QbeGen.IsImm(q) AND QbeGen.IsImm(q2) THEN
|
|
|
- 2592 IF op = SymTab.OpTimes THEN
|
|
|
- 2593 folded := QbeGen.Fold2(2, q, q2, qf)
|
|
|
- 2594 ELSIF op = SymTab.OpDiv THEN
|
|
|
- 2595 folded := QbeGen.Fold2(3, q, q2, qf)
|
|
|
- 2596 ELSIF op = SymTab.OpMod THEN
|
|
|
- 2597 folded := QbeGen.Fold2(4, q, q2, qf)
|
|
|
- 2598 END
|
|
|
- 2599 END;
|
|
|
- 2600 IF folded THEN QbeGen.CopyOp(qf, q)
|
|
|
- 2601 ELSE
|
|
|
- 2602 QbeGen.CopyOp("@", q)
|
|
|
- 2603 END
|
|
|
- 2604 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2605 END
|
|
|
- 2606 END; .) } .
|
|
|
- 2607 MulOp<VAR op: INTEGER>
|
|
|
- 2608 = "*" (. op := SymTab.OpTimes; .)
|
|
|
- 2609 | "/" (. op := SymTab.OpSlash; .)
|
|
|
- 2610 | "DIV" (. op := SymTab.OpDiv; .)
|
|
|
- 2611 | "MOD" (. op := SymTab.OpMod; .)
|
|
|
- 2612 | ( "AND" | "&" ) (. op := SymTab.OpAnd; .) .
|
|
|
- 2613 Fact<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2614 (. VAR s: ARRAY [0 .. 255] OF CHAR;
|
|
|
- 2615 et, dt, t2, st, ct2, et2:
|
|
|
- 2616 SymTab.TypeIndex;
|
|
|
- 2617 dk: INTEGER;
|
|
|
- 2618 qd, q2, sq, qa, qm0, qr, qt:
|
|
|
- 2619 QbeGen.QVal;
|
|
|
- 2620 qn, vn: SymTab.Name;
|
|
|
- 2621 vt: SymTab.TypeIndex;
|
|
|
- 2622 c1, c2: INTEGER;
|
|
|
- 2623 lo, hi: INTEGER;
|
|
|
- 2624 isMax: BOOLEAN;
|
|
|
- 2625 called, isHigh, sfx, isCh,
|
|
|
- 2626 isU, uok, isStr: BOOLEAN;
|
|
|
- 2627 ucp: INTEGER; astIsLit: BOOLEAN;
|
|
|
- 2628 astD: AST.Node;
|
|
|
- 2629 astCall: BOOLEAN;
|
|
|
- 2630 astNode, astNot: AST.Node;
|
|
|
- 2631 j: CARDINAL;
|
|
|
- 2632 astArg2: AST.Node;
|
|
|
- 2633 astBrace: AST.Node;
|
|
|
- 2634 astRes: AST.Node; .)
|
|
|
- 2635 = (. astIsLit := FALSE; .)
|
|
|
- 2636 ( integer (. LexString(s);
|
|
|
- 2637 QbeGen.NormInt(s, q); IF twoPhase THEN astIsLit := TRUE; astCur := AST.MakeLeaf(AST.NkIntLit, s) END;
|
|
|
- 2638 t := SymTab.IntType(); .)
|
|
|
- 2639 | charConst (. LexString(s);
|
|
|
- 2640 QbeGen.NormLit(s, q, isCh);
|
|
|
- 2641 IF twoPhase THEN
|
|
|
- 2642 astIsLit := TRUE;
|
|
|
- 2643 astCur := AST.MakeLeaf(
|
|
|
- 2644 AST.NkCharLit, s)
|
|
|
- 2645 END;
|
|
|
- 2646 t := SymTab.CharType(); .)
|
|
|
- 2647 | real (. LexString(s);
|
|
|
- 2648 QbeGen.NormReal(s, q);
|
|
|
- 2649 IF twoPhase THEN
|
|
|
- 2650 astIsLit := TRUE;
|
|
|
- 2651 astCur := AST.MakeLeaf(
|
|
|
- 2652 AST.NkRealLit, s)
|
|
|
- 2653 END;
|
|
|
- 2654 t := SymTab.RealType(); .)
|
|
|
- 2655 | string (. LexString(s);
|
|
|
- 2656 IF twoPhase THEN
|
|
|
- 2657 astIsLit := TRUE;
|
|
|
- 2658 astCur := AST.MakeLeaf(
|
|
|
- 2659 AST.NkStrLit, s)
|
|
|
- 2660 END;
|
|
|
- 2661 IF SymTab.StrLen(s) = 3 THEN
|
|
|
- 2662 t := SymTab.CharType();
|
|
|
- 2663 QbeGen.IntStr(
|
|
|
- 2664 QbeGen.CharVal(s), q)
|
|
|
- 2665 ELSE t := SymTab.NewStr();
|
|
|
- 2666 QbeGen.DeclStr(s, q);
|
|
|
- 2667 (* a literal's value IS its
|
|
|
- 2668 static descriptor address *)
|
|
|
- 2669 END; .)
|
|
|
- 2670 | ustring (. LexString(s);
|
|
|
- 2671 IF twoPhase THEN
|
|
|
- 2672 astIsLit := TRUE;
|
|
|
- 2673 astCur := AST.MakeLeaf(
|
|
|
- 2674 AST.NkStrLit, s)
|
|
|
- 2675 END;
|
|
|
- 2676 QbeGen.DeclUStr(s, q, isU, ucp,
|
|
|
- 2677 uok);
|
|
|
- 2678 IF NOT uok THEN
|
|
|
- 2679 SemError(234);
|
|
|
- 2680 t := SymTab.InvalidType
|
|
|
- 2681 ELSIF isU THEN
|
|
|
- 2682 t := SymTab.UCharType();
|
|
|
- 2683 QbeGen.IntStr(ucp, q)
|
|
|
- 2684 ELSE
|
|
|
- 2685 t := SymTab.NewUStr();
|
|
|
- 2686 END; .)
|
|
|
- 2687 | Design<dt, dk, qd, qn, sfx> (. astD := astCur; astCall := FALSE; astBrace := AST.NoNode;
|
|
|
- 2688 astNArgs := 0; called := FALSE;
|
|
|
- 2689 t := dt;
|
|
|
- 2690 IF dk = SymTab.KindConst THEN
|
|
|
- 2691 QbeGen.CopyOp(qd, q)
|
|
|
- 2692 ELSE QbeGen.CopyOp("@", q)
|
|
|
- 2693 END; .)
|
|
|
- 2694 [ TypedBraceLit<dt, q> (. t := dt; astCall := TRUE;
|
|
|
- 2695 astBrace := astCur; .) ]
|
|
|
- 2696 [ ArgList<qn, dt, qd, TRUE, FALSE, methCls, ct2, q2, called>
|
|
|
- 2697 (. astCall := TRUE;
|
|
|
- 2698 astNode := AstCallNode(astD);
|
|
|
- 2699 astRes := astNode;
|
|
|
- 2700 t := ct2;
|
|
|
- 2701 QbeGen.CopyOp(q2, q);
|
|
|
- 2702 sfx := FALSE; .)
|
|
|
- 2703 { ResultComp<t, q, sfx, astRes> }
|
|
|
- 2704 (. IF sfx THEN
|
|
|
- 2705 IF t = SymTab.InvalidType THEN
|
|
|
- 2706 QbeGen.CopyOp("0", q)
|
|
|
- 2707 ELSIF (SymTab.ClassOf(t) #
|
|
|
- 2708 SymTab.ClRecord)
|
|
|
- 2709 AND (SymTab.ClassOf(t) # SymTab.ClSet)
|
|
|
- 2710 AND (SymTab.ClassOf(t) # SymTab.ClArray)
|
|
|
- 2711 AND (SymTab.ClassOf(t) # SymTab.ClClass) THEN
|
|
|
- 2712 QbeGen.CopyOp("@", q)
|
|
|
- 2713 END
|
|
|
- 2714 END; .) ]
|
|
|
- 2715 (. IF called THEN
|
|
|
- 2716 astCur := astRes
|
|
|
- 2717 ELSIF astCall THEN
|
|
|
- 2718 astCur := astBrace
|
|
|
- 2719 ELSE astCur := astD
|
|
|
- 2720 END;
|
|
|
- 2721 astIsLit := TRUE;
|
|
|
- 2722 IF NOT called
|
|
|
- 2723 AND (dk = SymTab.KindProc) THEN
|
|
|
- 2724 (* bare zero-arg function
|
|
|
- 2725 call (parentheses may be
|
|
|
- 2726 omitted); a proper or
|
|
|
- 2727 parameterised proc here
|
|
|
- 2728 is 230 *)
|
|
|
- 2729 IF (SymTab.ProcNPar(qn) = 0)
|
|
|
- 2730 AND (SymTab.ProcRes(qn) # SymTab.InvalidType) THEN
|
|
|
- 2731 t := SymTab.ProcRes(qn);
|
|
|
- 2732 QbeGen.CopyOp("@", q);
|
|
|
- 2733 astCur := AST.MakeNode(AST.NkCall);
|
|
|
- 2734 AST.SetChild(astCur, 0, astD)
|
|
|
- 2735 ELSE
|
|
|
- 2736 t := SymTab.ProcTypeOf(qn);
|
|
|
- 2737 QbeGen.CopyOp("@", q)
|
|
|
- 2738 END
|
|
|
- 2739 END; .)
|
|
|
- 2740 | ( "HIGH" (. isHigh := TRUE; .)
|
|
|
- 2741 | ( "LEN" | "LENGTH" ) (. isHigh := FALSE; .) )
|
|
|
- 2742 "(" ( Design<dt, dk, qd, qn, sfx> (. isStr := FALSE;
|
|
|
- 2743 isU := FALSE; .)
|
|
|
- 2744 | string (. LexString(s); astCur := AST.MakeLeaf(AST.NkStrLit, s);
|
|
|
- 2745 isStr := TRUE;
|
|
|
- 2746 isU := FALSE;
|
|
|
- 2747 IF SymTab.StrLen(s) = 3 THEN
|
|
|
- 2748 dt := SymTab.CharType();
|
|
|
- 2749 QbeGen.IntStr(QbeGen.CharVal(s),
|
|
|
- 2750 qd)
|
|
|
- 2751 ELSE
|
|
|
- 2752 dt := SymTab.NewStr();
|
|
|
- 2753 QbeGen.DeclStr(s, qd);
|
|
|
- 2754 QbeGen.NoteAddr(qd, qd)
|
|
|
- 2755 END;
|
|
|
- 2756 dk := -1;
|
|
|
- 2757 qn[0] := CHR(0); .)
|
|
|
- 2758 | ustring (. LexString(s); astCur := AST.MakeLeaf(AST.NkStrLit, s);
|
|
|
- 2759 QbeGen.DeclUStr(s, qd, isU, ucp,
|
|
|
- 2760 uok);
|
|
|
- 2761 isStr := FALSE;
|
|
|
- 2762 IF NOT uok THEN
|
|
|
- 2763 SemError(234);
|
|
|
- 2764 dt := SymTab.InvalidType
|
|
|
- 2765 ELSIF isU THEN
|
|
|
- 2766 (* one codepoint: a UCHAR;
|
|
|
- 2767 LEN is 1, HIGH is 0 *)
|
|
|
- 2768 dt := SymTab.UCharType();
|
|
|
- 2769 QbeGen.IntStr(ucp, qd)
|
|
|
- 2770 ELSE
|
|
|
- 2771 dt := SymTab.NewUStr();
|
|
|
- 2772 QbeGen.NoteAddr(qd, qd)
|
|
|
- 2773 END;
|
|
|
- 2774 dk := -1;
|
|
|
- 2775 qn[0] := CHR(0); .) )
|
|
|
- 2776 ")"
|
|
|
- 2777 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2778 IF isHigh THEN AST.SetChild(astNode, 0,
|
|
|
- 2779 AST.MakeLeaf(AST.NkIdent, "HIGH"))
|
|
|
- 2780 ELSE AST.SetChild(astNode, 0,
|
|
|
- 2781 AST.MakeLeaf(AST.NkIdent, "LEN")) END;
|
|
|
- 2782 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2783 astCur := astNode; astIsLit := TRUE;
|
|
|
- 2784 IF (dt # SymTab.InvalidType)
|
|
|
- 2785 AND (SymTab.ClassOf(dt) = SymTab.ClUStr) THEN
|
|
|
- 2786 (* UString: the count is
|
|
|
- 2787 the descriptor header *)
|
|
|
- 2788 IF isHigh THEN
|
|
|
- 2789 QbeGen.UStrLen(qd, qr);
|
|
|
- 2790 QbeGen.DecQ(qr)
|
|
|
- 2791 ELSE
|
|
|
- 2792 QbeGen.UStrLen(qd, qr)
|
|
|
- 2793 END;
|
|
|
- 2794 t := SymTab.IntType();
|
|
|
- 2795 QbeGen.CopyOp(qr, q)
|
|
|
- 2796 ELSIF (dt # SymTab.InvalidType)
|
|
|
- 2797 AND (SymTab.ClassOf(dt) = SymTab.ClUChar) THEN
|
|
|
- 2798 (* single UCHAR codepoint *)
|
|
|
- 2799 IF isHigh THEN
|
|
|
- 2800 QbeGen.CopyOp("0", qr)
|
|
|
- 2801 ELSE
|
|
|
- 2802 QbeGen.CopyOp("1", qr)
|
|
|
- 2803 END;
|
|
|
- 2804 t := SymTab.IntType();
|
|
|
- 2805 QbeGen.CopyOp(qr, q)
|
|
|
- 2806 ELSIF isStr THEN
|
|
|
- 2807 (* fold: content length at
|
|
|
- 2808 compile time *)
|
|
|
- 2809 IF SymTab.StrLen(s) = 3 THEN
|
|
|
- 2810 c1 := 1
|
|
|
- 2811 ELSE
|
|
|
- 2812 c1 :=
|
|
|
- 2813 SymTab.StrLen(s) - 2
|
|
|
- 2814 END;
|
|
|
- 2815 IF isHigh THEN
|
|
|
- 2816 DEC(c1)
|
|
|
- 2817 END;
|
|
|
- 2818 QbeGen.IntStr(c1, qr);
|
|
|
- 2819 t := SymTab.IntType();
|
|
|
- 2820 QbeGen.CopyOp(qr, q)
|
|
|
- 2821 ELSIF dt = SymTab.InvalidType THEN
|
|
|
- 2822 t := SymTab.InvalidType;
|
|
|
- 2823 QbeGen.CopyOp("0", q)
|
|
|
- 2824 ELSIF SymTab.ClassOf(dt) #
|
|
|
- 2825 SymTab.ClArray THEN
|
|
|
- 2826 SemError(217);
|
|
|
- 2827 t := SymTab.InvalidType;
|
|
|
- 2828 QbeGen.CopyOp("0", q)
|
|
|
- 2829 ELSE
|
|
|
- 2830 IF SymTab.IsOpenArray(dt) THEN
|
|
|
- 2831 t := SymTab.IntType();
|
|
|
- 2832 QbeGen.CopyOp("@", q)
|
|
|
- 2833 ELSE
|
|
|
- 2834 IF isHigh THEN
|
|
|
- 2835 QbeGen.IntStr(
|
|
|
- 2836 SymTab.ArrayHi(dt), qr)
|
|
|
- 2837 ELSE
|
|
|
- 2838 QbeGen.IntStr(VAL(
|
|
|
- 2839 INTEGER,
|
|
|
- 2840 SymTab.ArrayLen(dt)),
|
|
|
- 2841 qr)
|
|
|
- 2842 END;
|
|
|
- 2843 t := SymTab.IntType();
|
|
|
- 2844 QbeGen.CopyOp(qr, q)
|
|
|
- 2845 END
|
|
|
- 2846 END; .)
|
|
|
- 2847 | ( "SIZE" | "TSIZE" ) "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
- 2848 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2849 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "SIZE"));
|
|
|
- 2850 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2851 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2852 (. IF dt = SymTab.InvalidType THEN
|
|
|
- 2853 t := SymTab.InvalidType;
|
|
|
- 2854 QbeGen.CopyOp("0", q)
|
|
|
- 2855 ELSE
|
|
|
- 2856 QbeGen.IntStr(VAL(INTEGER,
|
|
|
- 2857 SymTab.ObjectSize(dt)), q);
|
|
|
- 2858 t := SymTab.IntType()
|
|
|
- 2859 END; .)
|
|
|
- 2860 | ( "SHIFT" (. isMax := FALSE; .)
|
|
|
- 2861 | "ROTATE" (. isMax := TRUE; .) )
|
|
|
- 2862 "(" Expr<et, q> (. astArg2 := astCur; .) "," Expr<et2, q2> ")"
|
|
|
- 2863 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2864 IF isMax THEN AST.SetChild(astNode, 0,
|
|
|
- 2865 AST.MakeLeaf(AST.NkIdent, "ROTATE"))
|
|
|
- 2866 ELSE AST.SetChild(astNode, 0,
|
|
|
- 2867 AST.MakeLeaf(AST.NkIdent, "SHIFT")) END;
|
|
|
- 2868 IF astArg2 # AST.NoNode THEN AST.SetChild(astNode, 1, astArg2) END;
|
|
|
- 2869 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 2, astCur) END;
|
|
|
- 2870 astCur := astNode; astIsLit := TRUE;
|
|
|
- 2871 (* set shift/rotate: isMax
|
|
|
- 2872 doubles as "rotate" *)
|
|
|
- 2873 IF (et # SymTab.InvalidType)
|
|
|
- 2874 AND (SymTab.ClassOf(et) =
|
|
|
- 2875 SymTab.ClSet) THEN
|
|
|
- 2876 t := et;
|
|
|
- 2877 QbeGen.CopyOp("@", q)
|
|
|
- 2878 ELSE SemError(230);
|
|
|
- 2879 t := SymTab.InvalidType;
|
|
|
- 2880 QbeGen.CopyOp("0", q)
|
|
|
- 2881 END; .)
|
|
|
- 2882 | ( "MIN" (. isMax := FALSE; .)
|
|
|
- 2883 | "MAX" (. isMax := TRUE; .) )
|
|
|
- 2884 "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
- 2885 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2886 IF isMax THEN AST.SetChild(astNode, 0,
|
|
|
- 2887 AST.MakeLeaf(AST.NkIdent, "MAX"))
|
|
|
- 2888 ELSE AST.SetChild(astNode, 0,
|
|
|
- 2889 AST.MakeLeaf(AST.NkIdent, "MIN")) END;
|
|
|
- 2890 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2891 astCur := astNode; astIsLit := TRUE;
|
|
|
- 2892 IF (dt # SymTab.InvalidType)
|
|
|
- 2893 AND (SymTab.ClassOf(dt) = SymTab.ClReal) THEN
|
|
|
- 2894 (* REAL/LONGREAL: the
|
|
|
- 2895 implementation bounds *)
|
|
|
- 2896 IF isMax THEN
|
|
|
- 2897 QbeGen.NormReal(
|
|
|
- 2898 "3.402823e38", q)
|
|
|
- 2899 ELSE QbeGen.NormReal(
|
|
|
- 2900 "-3.402823e38", q)
|
|
|
- 2901 END;
|
|
|
- 2902 t := SymTab.RealType()
|
|
|
- 2903 ELSIF (dt #
|
|
|
- 2904 SymTab.InvalidType)
|
|
|
- 2905 AND (SymTab.ClassOf(dt) =
|
|
|
- 2906 SymTab.ClLong) THEN
|
|
|
- 2907 IF isMax THEN
|
|
|
- 2908 QbeGen.CopyOp(
|
|
|
- 2909 "9223372036854775807", q)
|
|
|
- 2910 ELSE QbeGen.CopyOp(
|
|
|
- 2911 "-9223372036854775808", q)
|
|
|
- 2912 END;
|
|
|
- 2913 t := SymTab.LongType()
|
|
|
- 2914 ELSIF SymTab.TypeBounds(dt, lo,
|
|
|
- 2915 hi) THEN
|
|
|
- 2916 IF isMax THEN
|
|
|
- 2917 QbeGen.IntStr(hi, q)
|
|
|
- 2918 ELSE QbeGen.IntStr(lo, q)
|
|
|
- 2919 END;
|
|
|
- 2920 t := SymTab.IntType()
|
|
|
- 2921 ELSE SemError(230);
|
|
|
- 2922 t := SymTab.InvalidType;
|
|
|
- 2923 QbeGen.CopyOp("0", q)
|
|
|
- 2924 END; .)
|
|
|
- 2925 | "ADR" "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
- 2926 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2927 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ADR"));
|
|
|
- 2928 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2929 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2930 (. IF dt = SymTab.InvalidType THEN
|
|
|
- 2931 t := SymTab.InvalidType;
|
|
|
- 2932 QbeGen.CopyOp("0", q)
|
|
|
- 2933 ELSE
|
|
|
- 2934 IF sfx
|
|
|
- 2935 OR (dk = SymTab.KindVar)
|
|
|
- 2936 OR (dk = SymTab.KindParam) THEN
|
|
|
- 2937 QbeGen.CopyOp("@", q)
|
|
|
- 2938 ELSE SemError(230);
|
|
|
- 2939 QbeGen.CopyOp("0", q)
|
|
|
- 2940 END;
|
|
|
- 2941 t := SymTab.AddrType()
|
|
|
- 2942 END; .)
|
|
|
- 2943 | "CHR" "(" Expr<et, q> ")"
|
|
|
- 2944 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2945 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CHR"));
|
|
|
- 2946 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 1864 AND (tsel #
|
|
|
+ 1865 SymTab.InvalidType)
|
|
|
+ 1866 AND NOT SymTab.EqCheck(t3,
|
|
|
+ 1867 tsel) THEN
|
|
|
+ 1868 SemError(213) END;
|
|
|
+ 1869 IF NOT QbeGen.IsImm(q3) THEN
|
|
|
+ 1870 SemError(230)
|
|
|
+ 1871 END; .) ]
|
|
|
+ 1872 (. AST.SetChild(arm,
|
|
|
+ 1873 AST.NChild(arm), astLab); .) .
|
|
|
+ 1874 ReturnStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 1875 q, qt: QbeGen.QVal;
|
|
|
+ 1876 res: SymTab.TypeIndex;
|
|
|
+ 1877 hadE, conv: BOOLEAN;
|
|
|
+ 1878 astVal, astNode: AST.Node; .)
|
|
|
+ 1879 = "RETURN" (. hadE := FALSE; astStmt := AST.NoNode; .)
|
|
|
+ 1880 [ Expr<t, q> (. hadE := TRUE; astVal := astCur; .) ]
|
|
|
+ 1881 (. astNode := AST.MakeNode(AST.NkReturn);
|
|
|
+ 1882 IF hadE THEN
|
|
|
+ 1883 AST.SetChild(astNode, 0, astVal)
|
|
|
+ 1884 END;
|
|
|
+ 1885 astStmt := astNode;
|
|
|
+ 1886 conv := FALSE;
|
|
|
+ 1887 IF NOT SymTab.InProc() THEN
|
|
|
+ 1888 SemError(232)
|
|
|
+ 1889 ELSE res := SymTab.CurRes();
|
|
|
+ 1890 IF NOT hadE THEN
|
|
|
+ 1891 IF res #
|
|
|
+ 1892 SymTab.InvalidType THEN
|
|
|
+ 1893 SemError(232)
|
|
|
+ 1894 END
|
|
|
+ 1895 ELSIF (res =
|
|
|
+ 1896 SymTab.InvalidType)
|
|
|
+ 1897 OR (t #
|
|
|
+ 1898 SymTab.InvalidType)
|
|
|
+ 1899 AND NOT SymTab.Assignable(t,
|
|
|
+ 1900 res) THEN
|
|
|
+ 1901 SemError(232)
|
|
|
+ 1902 END
|
|
|
+ 1903 END; .) .
|
|
|
+ 1904 HaltStat (. VAR t: SymTab.TypeIndex;
|
|
|
+ 1905 q: QbeGen.QVal;
|
|
|
+ 1906 astVal, astNode: AST.Node; .)
|
|
|
+ 1907 = "HALT" (. astVal := AST.NoNode; .)
|
|
|
+ 1908 [ "(" Expr<t, q> (. astVal := astCur; .) ")" ]
|
|
|
+ 1909 (. astNode := AST.MakeNode(AST.NkHalt);
|
|
|
+ 1910 IF astVal # AST.NoNode THEN
|
|
|
+ 1911 AST.SetChild(astNode, 0, astVal)
|
|
|
+ 1912 END;
|
|
|
+ 1913 astStmt := astNode;
|
|
|
+ 1914 .) .
|
|
|
+ 1915 (* Designator: scalar loads, array addresses, and index suffixes.
|
|
|
+ 1916 Each index descends one level (bounds-checked, trap on breach);
|
|
|
+ 1917 nested levels reload the inner descriptor address. q ends as the
|
|
|
+ 1918 value (scalars), the descriptor address (plain arrays), or the
|
|
|
+ 1919 element address (indexed); sfx marks the indexed form. *)
|
|
|
+ 1920 Design<VAR t: SymTab.TypeIndex; VAR k: INTEGER;
|
|
|
+ 1921 VAR q: QbeGen.QVal; VAR qn: SymTab.Name; VAR sfx: BOOLEAN>
|
|
|
+ 1922 (. VAR n, fn, mal: SymTab.Name;
|
|
|
+ 1923 cls: INTEGER;
|
|
|
+ 1924 ic: SymTab.TypeIndex;
|
|
|
+ 1925 curT, it, eT, bt:
|
|
|
+ 1926 SymTab.TypeIndex;
|
|
|
+ 1927 iq, ql, qlo, qhi, qe:
|
|
|
+ 1928 QbeGen.QVal;
|
|
|
+ 1929 lo, hi: INTEGER;
|
|
|
+ 1930 fo: INTEGER;
|
|
|
+ 1931 isOpen: BOOLEAN;
|
|
|
+ 1932 qb, cv: QbeGen.QVal;
|
|
|
+ 1933 fid, fref, slot: INTEGER;
|
|
|
+ 1934 r: BOOLEAN;
|
|
|
+ 1935 astDes, astSel: AST.Node;
|
|
|
+ 1936 fwd: BOOLEAN; .)
|
|
|
+ 1937 = GetIdent<n> (. methCls := SymTab.InvalidType;
|
|
|
+ 1938 QbeGen.CopyOp(n, qn);
|
|
|
+ 1939 sfx := FALSE; fwd := FALSE;
|
|
|
+ 1940 fid := 0; fref := 0; slot := 0;
|
|
|
+ 1941 IF NOT SymTab.Lookup(n) THEN
|
|
|
+ 1942 (* a bare method name inside
|
|
|
+ 1943 a CLASS IMPLEMENTATION
|
|
|
+ 1944 is a sibling call on
|
|
|
+ 1945 THIS *)
|
|
|
+ 1946 ic := SymTab.CurImplClass();
|
|
|
+ 1947 IF (ic #
|
|
|
+ 1948 SymTab.InvalidType)
|
|
|
+ 1949 AND SymTab.MethodExists(ic, n) THEN
|
|
|
+ 1950 sfx := FALSE;
|
|
|
+ 1951 QbeGen.CopyOp("@", q);
|
|
|
+ 1952 methCls := ic;
|
|
|
+ 1953 k := SymTab.KindProc;
|
|
|
+ 1954 t := SymTab.InvalidType
|
|
|
+ 1955 ELSIF SymTab.InProc() THEN
|
|
|
+ 1956 (* not declared yet: a
|
|
|
+ 1957 forward reference to a
|
|
|
+ 1958 module-level variable
|
|
|
+ 1959 declared further down. *)
|
|
|
+ 1960 k := SymTab.KindVar;
|
|
|
+ 1961 r := SymTab.FwdVarRef(n, k,
|
|
|
+ 1962 fref, t);
|
|
|
+ 1963 slot := QbeGen.FwdDesignator();
|
|
|
+ 1964 FwdVarNote(fref, slot);
|
|
|
+ 1965 fid := slot;
|
|
|
+ 1966 QbeGen.FwdAddrOper(fid, q);
|
|
|
+ 1967 sfx := TRUE; fwd := TRUE
|
|
|
+ 1968 ELSE
|
|
|
+ 1969 SemError(201);
|
|
|
+ 1970 t :=
|
|
|
+ 1971 SymTab.InvalidType;
|
|
|
+ 1972 k := -1;
|
|
|
+ 1973 QbeGen.CopyOp("0", q)
|
|
|
+ 1974 END
|
|
|
+ 1975 ELSE
|
|
|
+ 1976 t := SymTab.SymType(n);
|
|
|
+ 1977 k := SymTab.SymKind(n);
|
|
|
+ 1978 IF k = SymTab.KindConst THEN
|
|
|
+ 1979 IF SymTab.Equal(n,
|
|
|
+ 1980 "TRUE") THEN
|
|
|
+ 1981 t := SymTab.BoolType();
|
|
|
+ 1982 QbeGen.CopyOp("1", q)
|
|
|
+ 1983 ELSIF SymTab.Equal(n,
|
|
|
+ 1984 "FALSE") THEN
|
|
|
+ 1985 t := SymTab.BoolType();
|
|
|
+ 1986 QbeGen.CopyOp("0", q)
|
|
|
+ 1987 ELSIF SymTab.Equal(n,
|
|
|
+ 1988 "NIL") THEN
|
|
|
+ 1989 QbeGen.CopyOp("0", q)
|
|
|
+ 1990 ELSE
|
|
|
+ 1991 cls :=
|
|
|
+ 1992 SymTab.ClassOf(t);
|
|
|
+ 1993 IF (t #
|
|
|
+ 1994 SymTab.InvalidType)
|
|
|
+ 1995 AND ((cls = SymTab.ClInt)
|
|
|
+ 1996 OR (cls
|
|
|
+ 1997 = SymTab.ClChar)
|
|
|
+ 1998 OR (cls
|
|
|
+ 1999 = SymTab.ClEnum)
|
|
|
+ 2000 OR (cls
|
|
|
+ 2001 = SymTab.ClReal)
|
|
|
+ 2002 OR (cls
|
|
|
+ 2003 = SymTab.ClLong)
|
|
|
+ 2004 OR (cls
|
|
|
+ 2005 = SymTab.ClNil)) THEN
|
|
|
+ 2006 IF cls = SymTab.ClNil THEN
|
|
|
+ 2007 QbeGen.CopyOp("0", q)
|
|
|
+ 2008 ELSIF ((cls
|
|
|
+ 2009 = SymTab.ClInt)
|
|
|
+ 2010 OR (cls
|
|
|
+ 2011 = SymTab.ClChar)
|
|
|
+ 2012 OR (cls
|
|
|
+ 2013 = SymTab.ClEnum)
|
|
|
+ 2014 OR (cls
|
|
|
+ 2015 = SymTab.ClLong))
|
|
|
+ 2016 AND SymTab.GetSymVal(n, cv)
|
|
|
+ 2017 AND QbeGen.IsImm(cv) THEN
|
|
|
+ 2018 QbeGen.CopyOp(cv, q)
|
|
|
+ 2019 ELSE
|
|
|
+ 2020 QbeGen.LoadVar(n,
|
|
|
+ 2021 cls = SymTab.ClReal,
|
|
|
+ 2022 q)
|
|
|
+ 2023 END
|
|
|
+ 2024 ELSIF (cls = SymTab.ClArray)
|
|
|
+ 2025 OR (cls = SymTab.ClRecord)
|
|
|
+ 2026 OR (cls = SymTab.ClClass)
|
|
|
+ 2027 OR (cls = SymTab.ClStr)
|
|
|
+ 2028 OR (cls = SymTab.ClUStr) THEN
|
|
|
+ 2029 (* aggregate constant:
|
|
|
+ 2030 its value IS the
|
|
|
+ 2031 descriptor address *)
|
|
|
+ 2032 IF SymTab.GetSymVal(n, cv) THEN
|
|
|
+ 2033 QbeGen.CopyOp(cv, q)
|
|
|
+ 2034 ELSE
|
|
|
+ 2035 QbeGen.CopyOp("0", q)
|
|
|
+ 2036 END
|
|
|
+ 2037 ELSE
|
|
|
+ 2038 IF t #
|
|
|
+ 2039 SymTab.InvalidType THEN
|
|
|
+ 2040 SemError(230)
|
|
|
+ 2041 END;
|
|
|
+ 2042 QbeGen.CopyOp("0", q)
|
|
|
+ 2043 END
|
|
|
+ 2044 END
|
|
|
+ 2045 ELSIF (k = SymTab.KindVar)
|
|
|
+ 2046 OR (k = SymTab.KindParam) THEN
|
|
|
+ 2047 cls := SymTab.ClassOf(t);
|
|
|
+ 2048 IF (cls # SymTab.ClInt)
|
|
|
+ 2049 AND (cls # SymTab.ClBool)
|
|
|
+ 2050 AND (cls # SymTab.ClChar)
|
|
|
+ 2051 AND (cls # SymTab.ClUChar)
|
|
|
+ 2052 AND (cls # SymTab.ClEnum)
|
|
|
+ 2053 AND (cls # SymTab.ClReal)
|
|
|
+ 2054 AND (cls # SymTab.ClPtr)
|
|
|
+ 2055 AND (cls # SymTab.ClProc)
|
|
|
+ 2056 AND (cls # SymTab.ClLong)
|
|
|
+ 2057 AND (cls # SymTab.ClArray)
|
|
|
+ 2058 AND (cls # SymTab.ClSet)
|
|
|
+ 2059 AND (cls # SymTab.ClRecord)
|
|
|
+ 2060 AND (cls # SymTab.ClUStr)
|
|
|
+ 2061 AND (cls # SymTab.ClClass) THEN
|
|
|
+ 2062 SemError(230);
|
|
|
+ 2063 QbeGen.CopyOp("0", q)
|
|
|
+ 2064 ELSE QbeGen.CopyOp("@", q)
|
|
|
+ 2065 END
|
|
|
+ 2066 ELSE QbeGen.CopyOp("0", q);
|
|
|
+ 2067 IF k = SymTab.KindImport THEN
|
|
|
+ 2068 SemError(230)
|
|
|
+ 2069 ELSIF k =
|
|
|
+ 2070 SymTab.KindProc THEN
|
|
|
+ 2071 (* bare procedure name:
|
|
|
+ 2072 a following ArgList
|
|
|
+ 2073 makes it a call;
|
|
|
+ 2074 otherwise Fact
|
|
|
+ 2075 reports 230 *)
|
|
|
+ 2076 ELSE
|
|
|
+ 2077 IF k = SymTab.KindField THEN
|
|
|
+ 2078 IF QbeGen.TopWith(qb) THEN
|
|
|
+ 2079 sfx := TRUE
|
|
|
+ 2080 ELSE SemError(230);
|
|
|
+ 2081 QbeGen.CopyOp("0", q)
|
|
|
+ 2082 END
|
|
|
+ 2083 END
|
|
|
+ 2084 END
|
|
|
+ 2085 END
|
|
|
+ 2086 END; .)
|
|
|
+ 2087 (. astDes := AST.MakeNode(AST.NkDesignator);
|
|
|
+ 2088 AST.SetChild(astDes, AST.NChild(astDes), AST.MakeLeaf(AST.NkIdent, n));
|
|
|
+ 2089 IF fwd THEN AST.SetOp(astDes, 1) END; .)
|
|
|
+ 2090 { "[" Expr<it, iq>
|
|
|
+ 2091 (. AST.SetChild(astDes, AST.NChild(astDes),
|
|
|
+ 2092 AST.MakeUn(AST.NkSelector, AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
+ 2093 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 2094 SymTab.ClArray THEN
|
|
|
+ 2095 SemError(217);
|
|
|
+ 2096 t := SymTab.InvalidType
|
|
|
+ 2097 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
+ 2098 AND (SymTab.ClassOf(it) #
|
|
|
+ 2099 SymTab.ClChar)
|
|
|
+ 2100 AND (SymTab.ClassOf(it) #
|
|
|
+ 2101 SymTab.ClEnum) THEN
|
|
|
+ 2102 SemError(218);
|
|
|
+ 2103 t := SymTab.InvalidType
|
|
|
+ 2104 ELSE
|
|
|
+ 2105 eT := SymTab.ArrayElem(t);
|
|
|
+ 2106 t := eT; sfx := TRUE
|
|
|
+ 2107 END; .)
|
|
|
+ 2108 { "," Expr<it, iq>
|
|
|
+ 2109 (. AST.SetChild(astDes, AST.NChild(astDes),
|
|
|
+ 2110 AST.MakeUn(AST.NkSelector, AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
+ 2111 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 2112 SymTab.ClArray THEN
|
|
|
+ 2113 SemError(217);
|
|
|
+ 2114 t := SymTab.InvalidType
|
|
|
+ 2115 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
+ 2116 AND (SymTab.ClassOf(it) #
|
|
|
+ 2117 SymTab.ClChar)
|
|
|
+ 2118 AND (SymTab.ClassOf(it) #
|
|
|
+ 2119 SymTab.ClEnum) THEN
|
|
|
+ 2120 SemError(218);
|
|
|
+ 2121 t := SymTab.InvalidType
|
|
|
+ 2122 ELSE
|
|
|
+ 2123 eT := SymTab.ArrayElem(t);
|
|
|
+ 2124 t := eT; sfx := TRUE
|
|
|
+ 2125 END; .) }
|
|
|
+ 2126 "]"
|
|
|
+ 2127 | "." GetIdent<fn>
|
|
|
+ 2128 (. astSel := AST.MakeNode(AST.NkSelector);
|
|
|
+ 2129 AST.SetOp(astSel, AST.SelField);
|
|
|
+ 2130 AST.SetChild(astSel, 0, AST.MakeLeaf(AST.NkIdent, fn));
|
|
|
+ 2131 AST.SetChild(astDes, AST.NChild(astDes), astSel); IF k = SymTab.KindModule THEN
|
|
|
+ 2132 (* qualified L.x: materialize
|
|
|
+ 2133 the export, then load it *)
|
|
|
+ 2134 IF NOT SymTab.MaterializeAlias(n,
|
|
|
+ 2135 fn, mal) THEN
|
|
|
+ 2136 SemError(201);
|
|
|
+ 2137 t := SymTab.InvalidType;
|
|
|
+ 2138 QbeGen.CopyOp("0", q)
|
|
|
+ 2139 ELSE
|
|
|
+ 2140 QbeGen.CopyOp(mal, qn);
|
|
|
+ 2141 t := SymTab.SymType(mal);
|
|
|
+ 2142 k := SymTab.SymKind(mal);
|
|
|
+ 2143 sfx := FALSE;
|
|
|
+ 2144 IF k = SymTab.KindProc THEN
|
|
|
+ 2145 (* call: ArgList supplies
|
|
|
+ 2146 the value *)
|
|
|
+ 2147 QbeGen.CopyOp("0", q)
|
|
|
+ 2148 END
|
|
|
+ 2149 END
|
|
|
+ 2150 ELSIF t = SymTab.InvalidType THEN
|
|
|
+ 2151 ELSIF (SymTab.ClassOf(t) #
|
|
|
+ 2152 SymTab.ClRecord)
|
|
|
+ 2153 AND (SymTab.ClassOf(t) #
|
|
|
+ 2154 SymTab.ClClass) THEN
|
|
|
+ 2155 SemError(215);
|
|
|
+ 2156 t := SymTab.InvalidType
|
|
|
+ 2157 ELSIF (SymTab.ClassOf(t) =
|
|
|
+ 2158 SymTab.ClClass)
|
|
|
+ 2159 AND SymTab.MethodExists(t, fn) THEN
|
|
|
+ 2160 (* obj.Method: bind the
|
|
|
+ 2161 method and pass obj as
|
|
|
+ 2162 the hidden receiver; q
|
|
|
+ 2163 already holds the
|
|
|
+ 2164 object's address *)
|
|
|
+ 2165 QbeGen.CopyOp(fn, n);
|
|
|
+ 2166 QbeGen.CopyOp(fn, qn);
|
|
|
+ 2167 methCls := t;
|
|
|
+ 2168 k := SymTab.KindProc;
|
|
|
+ 2169 t := SymTab.InvalidType
|
|
|
+ 2170 ELSIF NOT SymTab.FieldExists(t,
|
|
|
+ 2171 fn) THEN
|
|
|
+ 2172 SemError(216);
|
|
|
+ 2173 t := SymTab.InvalidType
|
|
|
+ 2174 ELSE
|
|
|
+ 2175 t := SymTab.FieldType(t, fn);
|
|
|
+ 2176 sfx := TRUE
|
|
|
+ 2177 END; .)
|
|
|
+ 2178 | "^"
|
|
|
+ 2179 (. astSel := AST.MakeNode(AST.NkSelector);
|
|
|
+ 2180 AST.SetOp(astSel, AST.SelDeref);
|
|
|
+ 2181 AST.SetChild(astDes, AST.NChild(astDes), astSel); IF t = SymTab.InvalidType THEN
|
|
|
+ 2182 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 2183 SymTab.ClPtr THEN
|
|
|
+ 2184 SemError(219);
|
|
|
+ 2185 t := SymTab.InvalidType
|
|
|
+ 2186 ELSE
|
|
|
+ 2187 bt := SymTab.PtrBase(t);
|
|
|
+ 2188 IF bt = SymTab.InvalidType THEN
|
|
|
+ 2189 ELSE
|
|
|
+ 2190 t := bt;
|
|
|
+ 2191 sfx := TRUE
|
|
|
+ 2192 END
|
|
|
+ 2193 END; .) } (. astCur := astDes; .) .
|
|
|
+ 2194 (* Result suffix (ISO component after a function call): `F()^`,
|
|
|
+ 2195 `F()[i]`, `F().field`. The call result is in t/q with sfx FALSE
|
|
|
+ 2196 (a value, or a descriptor address for aggregates); each component
|
|
|
+ 2197 descends one level exactly like the Design components. *)
|
|
|
+ 2198 ResultComp<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal;
|
|
|
+ 2199 VAR sfx: BOOLEAN; VAR node: AST.Node> (. VAR it, eT, bt: SymTab.TypeIndex;
|
|
|
+ 2200 iq, ql, qlo, qhi, qe, qb:
|
|
|
+ 2201 QbeGen.QVal;
|
|
|
+ 2202 lo, hi, fo: INTEGER;
|
|
|
+ 2203 isOpen: BOOLEAN;
|
|
|
+ 2204 fname: SymTab.Name;
|
|
|
+ 2205 astWrap, astSel: AST.Node; .)
|
|
|
+ 2206 = "[" Expr<it, iq>
|
|
|
+ 2207 (. IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
+ 2208 astWrap := AST.MakeNode(
|
|
|
+ 2209 AST.NkDesignator);
|
|
|
+ 2210 AST.SetChild(astWrap, 0, node);
|
|
|
+ 2211 node := astWrap
|
|
|
+ 2212 END;
|
|
|
+ 2213 AST.SetChild(node, AST.NChild(node),
|
|
|
+ 2214 AST.MakeUn(AST.NkSelector,
|
|
|
+ 2215 AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
+ 2216 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 2217 SymTab.ClArray THEN
|
|
|
+ 2218 SemError(217);
|
|
|
+ 2219 t := SymTab.InvalidType
|
|
|
+ 2220 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
+ 2221 AND (SymTab.ClassOf(it) # SymTab.ClChar)
|
|
|
+ 2222 AND (SymTab.ClassOf(it) # SymTab.ClEnum) THEN
|
|
|
+ 2223 SemError(218);
|
|
|
+ 2224 t := SymTab.InvalidType
|
|
|
+ 2225 ELSE
|
|
|
+ 2226 eT := SymTab.ArrayElem(t);
|
|
|
+ 2227 t := eT; sfx := TRUE
|
|
|
+ 2228 END; .)
|
|
|
+ 2229 "]"
|
|
|
+ 2230 | "." GetIdent<fname>
|
|
|
+ 2231 (. IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
+ 2232 astWrap := AST.MakeNode(
|
|
|
+ 2233 AST.NkDesignator);
|
|
|
+ 2234 AST.SetChild(astWrap, 0, node);
|
|
|
+ 2235 node := astWrap
|
|
|
+ 2236 END;
|
|
|
+ 2237 AST.SetChild(node, AST.NChild(node),
|
|
|
+ 2238 AST.MakeUn(AST.NkSelector,
|
|
|
+ 2239 AST.SelField,
|
|
|
+ 2240 AST.MakeLeaf(AST.NkIdent,
|
|
|
+ 2241 fname))); IF t = SymTab.InvalidType THEN
|
|
|
+ 2242 ELSIF (SymTab.ClassOf(t) #
|
|
|
+ 2243 SymTab.ClRecord)
|
|
|
+ 2244 AND (SymTab.ClassOf(t) # SymTab.ClClass) THEN
|
|
|
+ 2245 SemError(215);
|
|
|
+ 2246 t := SymTab.InvalidType
|
|
|
+ 2247 ELSIF NOT SymTab.FieldExists(t,
|
|
|
+ 2248 fname) THEN
|
|
|
+ 2249 SemError(216);
|
|
|
+ 2250 t := SymTab.InvalidType
|
|
|
+ 2251 ELSE
|
|
|
+ 2252 t := SymTab.FieldType(t, fname);
|
|
|
+ 2253 sfx := TRUE
|
|
|
+ 2254 END; .)
|
|
|
+ 2255 | "^" (. IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
+ 2256 astWrap := AST.MakeNode(
|
|
|
+ 2257 AST.NkDesignator);
|
|
|
+ 2258 AST.SetChild(astWrap, 0, node);
|
|
|
+ 2259 node := astWrap
|
|
|
+ 2260 END;
|
|
|
+ 2261 astSel := AST.MakeNode(AST.NkSelector);
|
|
|
+ 2262 AST.SetOp(astSel, AST.SelDeref);
|
|
|
+ 2263 AST.SetChild(node,
|
|
|
+ 2264 AST.NChild(node), astSel); IF t = SymTab.InvalidType THEN
|
|
|
+ 2265 ELSIF SymTab.ClassOf(t) #
|
|
|
+ 2266 SymTab.ClPtr THEN
|
|
|
+ 2267 SemError(219);
|
|
|
+ 2268 t := SymTab.InvalidType
|
|
|
+ 2269 ELSE
|
|
|
+ 2270 bt := SymTab.PtrBase(t);
|
|
|
+ 2271 IF bt # SymTab.InvalidType THEN
|
|
|
+ 2272 t := bt; sfx := TRUE
|
|
|
+ 2273 END
|
|
|
+ 2274 END; .) .
|
|
|
+ 2275 Expr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 2276 (. VAR t2: SymTab.TypeIndex;
|
|
|
+ 2277 op: INTEGER;
|
|
|
+ 2278 q2, qt, wl: QbeGen.QVal;
|
|
|
+ 2279 astA, astB: AST.Node;
|
|
|
+ 2280 astOp: INTEGER;
|
|
|
+ 2281 astMade: BOOLEAN;
|
|
|
+ 2282 isR: BOOLEAN; .)
|
|
|
+ 2283 = SimExpr<t, q> (. astA := astCur; astMade := FALSE; .)
|
|
|
+ 2284 [ Rel<op> SimExpr<t2, q2>
|
|
|
+ 2285 (. astB := astCur; astMade := TRUE;
|
|
|
+ 2286 astOp := AST.OpEq;
|
|
|
+ 2287 IF op = SymTab.OpNeq1 THEN astOp := AST.OpNe
|
|
|
+ 2288 ELSIF op = SymTab.OpNeq2 THEN astOp := AST.OpNe
|
|
|
+ 2289 ELSIF op = SymTab.OpLt THEN astOp := AST.OpLt
|
|
|
+ 2290 ELSIF op = SymTab.OpLe THEN astOp := AST.OpLe
|
|
|
+ 2291 ELSIF op = SymTab.OpGt THEN astOp := AST.OpGt
|
|
|
+ 2292 ELSIF op = SymTab.OpGe THEN astOp := AST.OpGe
|
|
|
+ 2293 ELSIF op = SymTab.OpIn THEN astOp := AST.OpIn
|
|
|
+ 2294 END;
|
|
|
+ 2295 IF op = SymTab.OpIn THEN
|
|
|
+ 2296 IF SymTab.InCheck(t, t2) THEN
|
|
|
+ 2297 IF (t = SymTab.InvalidType)
|
|
|
+ 2298 OR (t2 = SymTab.InvalidType) THEN
|
|
|
+ 2299 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
+ 2300 ELSE
|
|
|
+ 2301 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
+ 2302 END
|
|
|
+ 2303 ELSE SemError(222); t := SymTab.InvalidType;
|
|
|
+ 2304 QbeGen.CopyOp("0", q)
|
|
|
+ 2305 END
|
|
|
+ 2306 ELSIF SymTab.RelCheck(t, t2, op) THEN
|
|
|
+ 2307 IF (t = SymTab.InvalidType)
|
|
|
+ 2308 OR (t2 = SymTab.InvalidType) THEN
|
|
|
+ 2309 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
+ 2310 ELSIF (SymTab.ClassOf(t) = SymTab.ClPtr)
|
|
|
+ 2311 OR (SymTab.ClassOf(t2) = SymTab.ClPtr) THEN
|
|
|
+ 2312 IF SymTab.IsFwdVar(t) OR SymTab.IsFwdVar(t2) THEN
|
|
|
+ 2313 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
+ 2314 ELSIF (op # SymTab.OpEq) AND (op # SymTab.OpNeq1)
|
|
|
+ 2315 AND (op # SymTab.OpNeq2) THEN
|
|
|
+ 2316 SemError(213); t := SymTab.InvalidType;
|
|
|
+ 2317 QbeGen.CopyOp("0", q)
|
|
|
+ 2318 ELSE
|
|
|
+ 2319 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
+ 2320 END
|
|
|
+ 2321 ELSIF (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
+ 2322 OR (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
+ 2323 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
+ 2324 ELSIF SymTab.StrCompat(t, t2) THEN
|
|
|
+ 2325 QbeGen.StrEq(op, q, q2, qt);
|
|
|
+ 2326 t := SymTab.BoolType(); QbeGen.CopyOp(qt, q)
|
|
|
+ 2327 ELSIF SymTab.IsLongFamily(t)
|
|
|
+ 2328 OR SymTab.IsLongFamily(t2) THEN
|
|
|
+ 2329 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
+ 2330 ELSE
|
|
|
+ 2331 t := SymTab.BoolType();
|
|
|
+ 2332 QbeGen.CopyOp("@", q)
|
|
|
+ 2333 END
|
|
|
+ 2334 ELSE SemError(213); t := SymTab.InvalidType;
|
|
|
+ 2335 QbeGen.CopyOp("0", q)
|
|
|
+ 2336 END;
|
|
|
+ 2337 astCur := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB); .) ]
|
|
|
+ 2338 (. IF NOT astMade THEN astCur := astA END; .) .
|
|
|
+ 2339 Rel<VAR op: INTEGER>
|
|
|
+ 2340 = "=" (. op := SymTab.OpEq; .)
|
|
|
+ 2341 | "#" (. op := SymTab.OpNeq1; .)
|
|
|
+ 2342 | "<" (. op := SymTab.OpLt; .)
|
|
|
+ 2343 | "<=" (. op := SymTab.OpLe; .)
|
|
|
+ 2344 | ">" (. op := SymTab.OpGt; .)
|
|
|
+ 2345 | ">=" (. op := SymTab.OpGe; .)
|
|
|
+ 2346 | "IN" (. op := SymTab.OpIn; .) .
|
|
|
+ 2347 SimExpr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 2348 (. VAR t2, res2, lt, rt:
|
|
|
+ 2349 SymTab.TypeIndex;
|
|
|
+ 2350 op: INTEGER;
|
|
|
+ 2351 q2, qt, wq, qf, q2a, q2b:
|
|
|
+ 2352 QbeGen.QVal;
|
|
|
+ 2353 neg, isR, isL, folded:
|
|
|
+ 2354 BOOLEAN;
|
|
|
+ 2355 fok: BOOLEAN;
|
|
|
+ 2356 lw, rw, mw: CARDINAL;
|
|
|
+ 2357 lTrue, lNext, lDone, qr, qs: QbeGen.QVal;
|
|
|
+ 2358 astA, astB: AST.Node;
|
|
|
+ 2359 astSign, astOp: INTEGER; .)
|
|
|
+ 2360 = (. neg := FALSE; astSign := 0; .)
|
|
|
+ 2361 [ "+" (. neg := TRUE; astSign := 1; .)
|
|
|
+ 2362 | "-" (. neg := TRUE; astSign := -1; .) ]
|
|
|
+ 2363 Term<t, q> (. astA := astCur;
|
|
|
+ 2364 IF neg AND QbeGen.IsImm(q) THEN
|
|
|
+ 2365 QbeGen.NegFold(q, q)
|
|
|
+ 2366 END;
|
|
|
+ 2367 IF astSign < 0 THEN
|
|
|
+ 2368 astCur := AST.MakeUn(
|
|
|
+ 2369 AST.NkUnary, AST.OpSub, astA);
|
|
|
+ 2370 astA := astCur
|
|
|
+ 2371 END; .)
|
|
|
+ 2372 { AddOp<op> (. IF op = SymTab.OpOr THEN
|
|
|
+ 2373 QbeGen.DelayBegin END; .)
|
|
|
+ 2374 Term<t2, q2> (. astB := astCur; IF op = SymTab.OpOr THEN
|
|
|
+ 2375 QbeGen.DelayEnd END; .)
|
|
|
+ 2376 (. astOp := AST.OpAdd;
|
|
|
+ 2377 IF op = SymTab.OpSub THEN astOp := AST.OpSub
|
|
|
+ 2378 ELSIF op = SymTab.OpOr THEN astOp := AST.OpOr END;
|
|
|
+ 2379 astA := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB);
|
|
|
+ 2380 astCur := astA;
|
|
|
+ 2381 IF op = SymTab.OpOr THEN
|
|
|
+ 2382 (* short-circuit: if q is true the RHS is skipped *)
|
|
|
+ 2383 IF SymTab.BoolCheck(t) AND SymTab.BoolCheck(t2) THEN
|
|
|
+ 2384 t := SymTab.BoolType()
|
|
|
+ 2385 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
+ 2386 IF t # SymTab.InvalidType THEN
|
|
|
+ 2387 QbeGen.CopyOp("@", q)
|
|
|
+ 2388 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 2389 END
|
|
|
+ 2390 ELSIF (op = SymTab.OpAdd)
|
|
|
+ 2391 AND (SymTab.UStrCompat(t, t2)
|
|
|
+ 2392 OR ((SymTab.ClassOf(t) = SymTab.ClUChar)
|
|
|
+ 2393 AND (SymTab.ClassOf(t2) = SymTab.ClUStr))
|
|
|
+ 2394 OR ((SymTab.ClassOf(t) = SymTab.ClUStr)
|
|
|
+ 2395 AND (SymTab.ClassOf(t2) = SymTab.ClUChar))
|
|
|
+ 2396 OR ((SymTab.ClassOf(t) = SymTab.ClUChar)
|
|
|
+ 2397 AND (SymTab.ClassOf(t2) = SymTab.ClUChar))) THEN
|
|
|
+ 2398 (* UString concatenation: a UCHAR operand becomes a
|
|
|
+ 2399 1-codepoint UString; the result is a descriptor in the
|
|
|
+ 2400 shim's concat buffer. Work on copies so neither
|
|
|
+ 2401 operand is clobbered. *)
|
|
|
+ 2402 t := SymTab.NewUStr();
|
|
|
+ 2403 QbeGen.CopyOp("@", q)
|
|
|
+ 2404 ELSIF (op = SymTab.OpAdd)
|
|
|
+ 2405 AND (SymTab.StrCompat(t, t2)
|
|
|
+ 2406 OR (SymTab.IsStrType(t)
|
|
|
+ 2407 AND (SymTab.ClassOf(t2) = SymTab.ClChar))
|
|
|
+ 2408 OR ((SymTab.ClassOf(t) = SymTab.ClChar)
|
|
|
+ 2409 AND SymTab.IsStrType(t2))) THEN
|
|
|
+ 2410 (* string concatenation; a CHAR operand becomes a
|
|
|
+ 2411 1-character string literal. When both operands are
|
|
|
+ 2412 constants, fold to a single string literal so a
|
|
|
+ 2413 constructor element stays compile-time. *)
|
|
|
+ 2414 QbeGen.StrFold(q, q2, SymTab.ClassOf(t), SymTab.ClassOf(t2),
|
|
|
+ 2415 qt, fok);
|
|
|
+ 2416 IF fok THEN QbeGen.CopyOp(qt, q)
|
|
|
+ 2417 ELSE QbeGen.CopyOp("@", q)
|
|
|
+ 2418 END;
|
|
|
+ 2419 t := SymTab.NewStr()
|
|
|
+ 2420 ELSIF (t # SymTab.InvalidType) AND (t2 # SymTab.InvalidType)
|
|
|
+ 2421 AND (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
+ 2422 AND (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
+ 2423 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
+ 2424 mw := lw;
|
|
|
+ 2425 IF rw > mw THEN mw := rw END;
|
|
|
+ 2426 t := SymTab.NewSet(
|
|
|
+ 2427 SymTab.NewSubR(0,
|
|
|
+ 2428 VAL(INTEGER, mw) * 32 - 1));
|
|
|
+ 2429 QbeGen.CopyOp("@", q)
|
|
|
+ 2430 ELSE
|
|
|
+ 2431 IF SymTab.ArithCheck(t, t2, FALSE, res2) THEN
|
|
|
+ 2432 lt := t; rt := t2; t := res2
|
|
|
+ 2433 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
+ 2434 IF t # SymTab.InvalidType THEN
|
|
|
+ 2435 isL := SymTab.IsLongFamily(t);
|
|
|
+ 2436 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
+ 2437 folded := FALSE;
|
|
|
+ 2438 IF (NOT isL) AND (NOT isR)
|
|
|
+ 2439 AND QbeGen.IsImm(q) AND QbeGen.IsImm(q2) THEN
|
|
|
+ 2440 IF op = SymTab.OpAdd THEN
|
|
|
+ 2441 folded := QbeGen.Fold2(0, q, q2, qf)
|
|
|
+ 2442 ELSE
|
|
|
+ 2443 folded := QbeGen.Fold2(1, q, q2, qf)
|
|
|
+ 2444 END
|
|
|
+ 2445 END;
|
|
|
+ 2446 IF folded THEN QbeGen.CopyOp(qf, q)
|
|
|
+ 2447 ELSE
|
|
|
+ 2448 QbeGen.CopyOp("@", q)
|
|
|
+ 2449 END
|
|
|
+ 2450 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 2451 END
|
|
|
+ 2452 END; .) } .
|
|
|
+ 2453 AddOp<VAR op: INTEGER>
|
|
|
+ 2454 = "+" (. op := SymTab.OpAdd; .)
|
|
|
+ 2455 | "-" (. op := SymTab.OpSub; .)
|
|
|
+ 2456 | "OR" (. op := SymTab.OpOr; .) .
|
|
|
+ 2457 Term<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 2458 (. VAR t2, res2, lt, rt:
|
|
|
+ 2459 SymTab.TypeIndex;
|
|
|
+ 2460 op: INTEGER;
|
|
|
+ 2461 q2, qt, wq, qf:
|
|
|
+ 2462 QbeGen.QVal;
|
|
|
+ 2463 isR, isL, folded: BOOLEAN;
|
|
|
+ 2464 lw, rw, mw: CARDINAL;
|
|
|
+ 2465 lNext, lFalse, lDone, qr, qs: QbeGen.QVal;
|
|
|
+ 2466 astA, astB: AST.Node;
|
|
|
+ 2467 astOp: INTEGER; .)
|
|
|
+ 2468 = Fact<t, q> (. astA := astCur; .) { MulOp<op>
|
|
|
+ 2469 Fact<t2, q2> (. astB := astCur; .)
|
|
|
+ 2470 (. astOp := AST.OpMul;
|
|
|
+ 2471 IF op = SymTab.OpSlash THEN astOp := AST.OpDiv
|
|
|
+ 2472 ELSIF op = SymTab.OpDiv THEN astOp := AST.OpDiv
|
|
|
+ 2473 ELSIF op = SymTab.OpMod THEN astOp := AST.OpMod
|
|
|
+ 2474 ELSIF op = SymTab.OpAnd THEN astOp := AST.OpAnd END;
|
|
|
+ 2475 astA := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB);
|
|
|
+ 2476 astCur := astA;
|
|
|
+ 2477 IF op = SymTab.OpAnd THEN
|
|
|
+ 2478 (* short-circuit: if q is false the RHS is skipped *)
|
|
|
+ 2479 IF SymTab.BoolCheck(t) AND SymTab.BoolCheck(t2) THEN
|
|
|
+ 2480 t := SymTab.BoolType()
|
|
|
+ 2481 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
+ 2482 IF t # SymTab.InvalidType THEN QbeGen.CopyOp("@", q)
|
|
|
+ 2483 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 2484 END
|
|
|
+ 2485 ELSIF (t # SymTab.InvalidType) AND (t2 # SymTab.InvalidType)
|
|
|
+ 2486 AND (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
+ 2487 AND (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
+ 2488 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
+ 2489 mw := lw;
|
|
|
+ 2490 IF rw > mw THEN mw := rw END;
|
|
|
+ 2491 t := SymTab.NewSet(
|
|
|
+ 2492 SymTab.NewSubR(0,
|
|
|
+ 2493 VAL(INTEGER, mw) * 32 - 1));
|
|
|
+ 2494 QbeGen.CopyOp("@", q)
|
|
|
+ 2495 ELSE
|
|
|
+ 2496 IF SymTab.ArithCheck(t, t2,
|
|
|
+ 2497 (op = SymTab.OpDiv) OR (op = SymTab.OpMod),
|
|
|
+ 2498 res2) THEN
|
|
|
+ 2499 lt := t; rt := t2; t := res2
|
|
|
+ 2500 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
+ 2501 IF t # SymTab.InvalidType THEN
|
|
|
+ 2502 isL := SymTab.IsLongFamily(t);
|
|
|
+ 2503 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
+ 2504 folded := FALSE;
|
|
|
+ 2505 IF (NOT isL) AND (NOT isR)
|
|
|
+ 2506 AND QbeGen.IsImm(q) AND QbeGen.IsImm(q2) THEN
|
|
|
+ 2507 IF op = SymTab.OpTimes THEN
|
|
|
+ 2508 folded := QbeGen.Fold2(2, q, q2, qf)
|
|
|
+ 2509 ELSIF op = SymTab.OpDiv THEN
|
|
|
+ 2510 folded := QbeGen.Fold2(3, q, q2, qf)
|
|
|
+ 2511 ELSIF op = SymTab.OpMod THEN
|
|
|
+ 2512 folded := QbeGen.Fold2(4, q, q2, qf)
|
|
|
+ 2513 END
|
|
|
+ 2514 END;
|
|
|
+ 2515 IF folded THEN QbeGen.CopyOp(qf, q)
|
|
|
+ 2516 ELSE
|
|
|
+ 2517 QbeGen.CopyOp("@", q)
|
|
|
+ 2518 END
|
|
|
+ 2519 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 2520 END
|
|
|
+ 2521 END; .) } .
|
|
|
+ 2522 MulOp<VAR op: INTEGER>
|
|
|
+ 2523 = "*" (. op := SymTab.OpTimes; .)
|
|
|
+ 2524 | "/" (. op := SymTab.OpSlash; .)
|
|
|
+ 2525 | "DIV" (. op := SymTab.OpDiv; .)
|
|
|
+ 2526 | "MOD" (. op := SymTab.OpMod; .)
|
|
|
+ 2527 | ( "AND" | "&" ) (. op := SymTab.OpAnd; .) .
|
|
|
+ 2528 Fact<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 2529 (. VAR s: ARRAY [0 .. 255] OF CHAR;
|
|
|
+ 2530 et, dt, t2, st, ct2, et2:
|
|
|
+ 2531 SymTab.TypeIndex;
|
|
|
+ 2532 dk: INTEGER;
|
|
|
+ 2533 qd, q2, sq, qa, qm0, qr, qt:
|
|
|
+ 2534 QbeGen.QVal;
|
|
|
+ 2535 qn, vn: SymTab.Name;
|
|
|
+ 2536 vt: SymTab.TypeIndex;
|
|
|
+ 2537 c1, c2: INTEGER;
|
|
|
+ 2538 lo, hi: INTEGER;
|
|
|
+ 2539 isMax: BOOLEAN;
|
|
|
+ 2540 called, isHigh, sfx, isCh,
|
|
|
+ 2541 isU, uok, isStr: BOOLEAN;
|
|
|
+ 2542 ucp: INTEGER; astIsLit: BOOLEAN;
|
|
|
+ 2543 astD: AST.Node;
|
|
|
+ 2544 astCall: BOOLEAN;
|
|
|
+ 2545 astNode, astNot: AST.Node;
|
|
|
+ 2546 j: CARDINAL;
|
|
|
+ 2547 astArg2: AST.Node;
|
|
|
+ 2548 astBrace: AST.Node;
|
|
|
+ 2549 astRes: AST.Node; .)
|
|
|
+ 2550 = (. astIsLit := FALSE; .)
|
|
|
+ 2551 ( integer (. LexString(s);
|
|
|
+ 2552 QbeGen.NormInt(s, q); IF twoPhase THEN astIsLit := TRUE; astCur := AST.MakeLeaf(AST.NkIntLit, s) END;
|
|
|
+ 2553 t := SymTab.IntType(); .)
|
|
|
+ 2554 | charConst (. LexString(s);
|
|
|
+ 2555 QbeGen.NormLit(s, q, isCh);
|
|
|
+ 2556 IF twoPhase THEN
|
|
|
+ 2557 astIsLit := TRUE;
|
|
|
+ 2558 astCur := AST.MakeLeaf(
|
|
|
+ 2559 AST.NkCharLit, s)
|
|
|
+ 2560 END;
|
|
|
+ 2561 t := SymTab.CharType(); .)
|
|
|
+ 2562 | real (. LexString(s);
|
|
|
+ 2563 QbeGen.NormReal(s, q);
|
|
|
+ 2564 IF twoPhase THEN
|
|
|
+ 2565 astIsLit := TRUE;
|
|
|
+ 2566 astCur := AST.MakeLeaf(
|
|
|
+ 2567 AST.NkRealLit, s)
|
|
|
+ 2568 END;
|
|
|
+ 2569 t := SymTab.RealType(); .)
|
|
|
+ 2570 | string (. LexString(s);
|
|
|
+ 2571 IF twoPhase THEN
|
|
|
+ 2572 astIsLit := TRUE;
|
|
|
+ 2573 astCur := AST.MakeLeaf(
|
|
|
+ 2574 AST.NkStrLit, s)
|
|
|
+ 2575 END;
|
|
|
+ 2576 IF SymTab.StrLen(s) = 3 THEN
|
|
|
+ 2577 t := SymTab.CharType();
|
|
|
+ 2578 QbeGen.IntStr(
|
|
|
+ 2579 QbeGen.CharVal(s), q)
|
|
|
+ 2580 ELSE t := SymTab.NewStr();
|
|
|
+ 2581 QbeGen.DeclStr(s, q);
|
|
|
+ 2582 (* a literal's value IS its
|
|
|
+ 2583 static descriptor address *)
|
|
|
+ 2584 END; .)
|
|
|
+ 2585 | ustring (. LexString(s);
|
|
|
+ 2586 IF twoPhase THEN
|
|
|
+ 2587 astIsLit := TRUE;
|
|
|
+ 2588 astCur := AST.MakeLeaf(
|
|
|
+ 2589 AST.NkStrLit, s)
|
|
|
+ 2590 END;
|
|
|
+ 2591 QbeGen.DeclUStr(s, q, isU, ucp,
|
|
|
+ 2592 uok);
|
|
|
+ 2593 IF NOT uok THEN
|
|
|
+ 2594 SemError(234);
|
|
|
+ 2595 t := SymTab.InvalidType
|
|
|
+ 2596 ELSIF isU THEN
|
|
|
+ 2597 t := SymTab.UCharType();
|
|
|
+ 2598 QbeGen.IntStr(ucp, q)
|
|
|
+ 2599 ELSE
|
|
|
+ 2600 t := SymTab.NewUStr();
|
|
|
+ 2601 END; .)
|
|
|
+ 2602 | Design<dt, dk, qd, qn, sfx> (. astD := astCur; astCall := FALSE; astBrace := AST.NoNode;
|
|
|
+ 2603 astNArgs := 0; called := FALSE;
|
|
|
+ 2604 t := dt;
|
|
|
+ 2605 IF dk = SymTab.KindConst THEN
|
|
|
+ 2606 QbeGen.CopyOp(qd, q)
|
|
|
+ 2607 ELSE QbeGen.CopyOp("@", q)
|
|
|
+ 2608 END; .)
|
|
|
+ 2609 [ TypedBraceLit<dt, q> (. t := dt; astCall := TRUE;
|
|
|
+ 2610 astBrace := astCur; .) ]
|
|
|
+ 2611 [ ArgList<qn, dt, qd, TRUE, FALSE, methCls, ct2, q2, called>
|
|
|
+ 2612 (. astCall := TRUE;
|
|
|
+ 2613 astNode := AstCallNode(astD);
|
|
|
+ 2614 astRes := astNode;
|
|
|
+ 2615 t := ct2;
|
|
|
+ 2616 QbeGen.CopyOp(q2, q);
|
|
|
+ 2617 sfx := FALSE; .)
|
|
|
+ 2618 { ResultComp<t, q, sfx, astRes> }
|
|
|
+ 2619 (. IF sfx THEN
|
|
|
+ 2620 IF t = SymTab.InvalidType THEN
|
|
|
+ 2621 QbeGen.CopyOp("0", q)
|
|
|
+ 2622 ELSIF (SymTab.ClassOf(t) #
|
|
|
+ 2623 SymTab.ClRecord)
|
|
|
+ 2624 AND (SymTab.ClassOf(t) # SymTab.ClSet)
|
|
|
+ 2625 AND (SymTab.ClassOf(t) # SymTab.ClArray)
|
|
|
+ 2626 AND (SymTab.ClassOf(t) # SymTab.ClClass) THEN
|
|
|
+ 2627 QbeGen.CopyOp("@", q)
|
|
|
+ 2628 END
|
|
|
+ 2629 END; .) ]
|
|
|
+ 2630 (. IF called THEN
|
|
|
+ 2631 astCur := astRes
|
|
|
+ 2632 ELSIF astCall THEN
|
|
|
+ 2633 astCur := astBrace
|
|
|
+ 2634 ELSE astCur := astD
|
|
|
+ 2635 END;
|
|
|
+ 2636 astIsLit := TRUE;
|
|
|
+ 2637 IF NOT called
|
|
|
+ 2638 AND (dk = SymTab.KindProc) THEN
|
|
|
+ 2639 (* bare zero-arg function
|
|
|
+ 2640 call (parentheses may be
|
|
|
+ 2641 omitted); a proper or
|
|
|
+ 2642 parameterised proc here
|
|
|
+ 2643 is 230 *)
|
|
|
+ 2644 IF (SymTab.ProcNPar(qn) = 0)
|
|
|
+ 2645 AND (SymTab.ProcRes(qn) # SymTab.InvalidType) THEN
|
|
|
+ 2646 t := SymTab.ProcRes(qn);
|
|
|
+ 2647 QbeGen.CopyOp("@", q);
|
|
|
+ 2648 astCur := AST.MakeNode(AST.NkCall);
|
|
|
+ 2649 AST.SetChild(astCur, 0, astD)
|
|
|
+ 2650 ELSE
|
|
|
+ 2651 t := SymTab.ProcTypeOf(qn);
|
|
|
+ 2652 QbeGen.CopyOp("@", q)
|
|
|
+ 2653 END
|
|
|
+ 2654 END; .)
|
|
|
+ 2655 | ( "HIGH" (. isHigh := TRUE; .)
|
|
|
+ 2656 | ( "LEN" | "LENGTH" ) (. isHigh := FALSE; .) )
|
|
|
+ 2657 "(" ( Design<dt, dk, qd, qn, sfx> (. isStr := FALSE;
|
|
|
+ 2658 isU := FALSE; .)
|
|
|
+ 2659 | string (. LexString(s); astCur := AST.MakeLeaf(AST.NkStrLit, s);
|
|
|
+ 2660 isStr := TRUE;
|
|
|
+ 2661 isU := FALSE;
|
|
|
+ 2662 IF SymTab.StrLen(s) = 3 THEN
|
|
|
+ 2663 dt := SymTab.CharType();
|
|
|
+ 2664 QbeGen.IntStr(QbeGen.CharVal(s),
|
|
|
+ 2665 qd)
|
|
|
+ 2666 ELSE
|
|
|
+ 2667 dt := SymTab.NewStr();
|
|
|
+ 2668 QbeGen.DeclStr(s, qd);
|
|
|
+ 2669 QbeGen.NoteAddr(qd, qd)
|
|
|
+ 2670 END;
|
|
|
+ 2671 dk := -1;
|
|
|
+ 2672 qn[0] := CHR(0); .)
|
|
|
+ 2673 | ustring (. LexString(s); astCur := AST.MakeLeaf(AST.NkStrLit, s);
|
|
|
+ 2674 QbeGen.DeclUStr(s, qd, isU, ucp,
|
|
|
+ 2675 uok);
|
|
|
+ 2676 isStr := FALSE;
|
|
|
+ 2677 IF NOT uok THEN
|
|
|
+ 2678 SemError(234);
|
|
|
+ 2679 dt := SymTab.InvalidType
|
|
|
+ 2680 ELSIF isU THEN
|
|
|
+ 2681 (* one codepoint: a UCHAR;
|
|
|
+ 2682 LEN is 1, HIGH is 0 *)
|
|
|
+ 2683 dt := SymTab.UCharType();
|
|
|
+ 2684 QbeGen.IntStr(ucp, qd)
|
|
|
+ 2685 ELSE
|
|
|
+ 2686 dt := SymTab.NewUStr();
|
|
|
+ 2687 QbeGen.NoteAddr(qd, qd)
|
|
|
+ 2688 END;
|
|
|
+ 2689 dk := -1;
|
|
|
+ 2690 qn[0] := CHR(0); .) )
|
|
|
+ 2691 ")"
|
|
|
+ 2692 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2693 IF isHigh THEN AST.SetChild(astNode, 0,
|
|
|
+ 2694 AST.MakeLeaf(AST.NkIdent, "HIGH"))
|
|
|
+ 2695 ELSE AST.SetChild(astNode, 0,
|
|
|
+ 2696 AST.MakeLeaf(AST.NkIdent, "LEN")) END;
|
|
|
+ 2697 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2698 astCur := astNode; astIsLit := TRUE;
|
|
|
+ 2699 IF (dt # SymTab.InvalidType)
|
|
|
+ 2700 AND (SymTab.ClassOf(dt) = SymTab.ClUStr) THEN
|
|
|
+ 2701 (* UString: the count is
|
|
|
+ 2702 the descriptor header *)
|
|
|
+ 2703 IF isHigh THEN
|
|
|
+ 2704 QbeGen.UStrLen(qd, qr);
|
|
|
+ 2705 QbeGen.DecQ(qr)
|
|
|
+ 2706 ELSE
|
|
|
+ 2707 QbeGen.UStrLen(qd, qr)
|
|
|
+ 2708 END;
|
|
|
+ 2709 t := SymTab.IntType();
|
|
|
+ 2710 QbeGen.CopyOp(qr, q)
|
|
|
+ 2711 ELSIF (dt # SymTab.InvalidType)
|
|
|
+ 2712 AND (SymTab.ClassOf(dt) = SymTab.ClUChar) THEN
|
|
|
+ 2713 (* single UCHAR codepoint *)
|
|
|
+ 2714 IF isHigh THEN
|
|
|
+ 2715 QbeGen.CopyOp("0", qr)
|
|
|
+ 2716 ELSE
|
|
|
+ 2717 QbeGen.CopyOp("1", qr)
|
|
|
+ 2718 END;
|
|
|
+ 2719 t := SymTab.IntType();
|
|
|
+ 2720 QbeGen.CopyOp(qr, q)
|
|
|
+ 2721 ELSIF isStr THEN
|
|
|
+ 2722 (* fold: content length at
|
|
|
+ 2723 compile time *)
|
|
|
+ 2724 IF SymTab.StrLen(s) = 3 THEN
|
|
|
+ 2725 c1 := 1
|
|
|
+ 2726 ELSE
|
|
|
+ 2727 c1 :=
|
|
|
+ 2728 SymTab.StrLen(s) - 2
|
|
|
+ 2729 END;
|
|
|
+ 2730 IF isHigh THEN
|
|
|
+ 2731 DEC(c1)
|
|
|
+ 2732 END;
|
|
|
+ 2733 QbeGen.IntStr(c1, qr);
|
|
|
+ 2734 t := SymTab.IntType();
|
|
|
+ 2735 QbeGen.CopyOp(qr, q)
|
|
|
+ 2736 ELSIF dt = SymTab.InvalidType THEN
|
|
|
+ 2737 t := SymTab.InvalidType;
|
|
|
+ 2738 QbeGen.CopyOp("0", q)
|
|
|
+ 2739 ELSIF SymTab.ClassOf(dt) #
|
|
|
+ 2740 SymTab.ClArray THEN
|
|
|
+ 2741 SemError(217);
|
|
|
+ 2742 t := SymTab.InvalidType;
|
|
|
+ 2743 QbeGen.CopyOp("0", q)
|
|
|
+ 2744 ELSE
|
|
|
+ 2745 IF SymTab.IsOpenArray(dt) THEN
|
|
|
+ 2746 t := SymTab.IntType();
|
|
|
+ 2747 QbeGen.CopyOp("@", q)
|
|
|
+ 2748 ELSE
|
|
|
+ 2749 IF isHigh THEN
|
|
|
+ 2750 QbeGen.IntStr(
|
|
|
+ 2751 SymTab.ArrayHi(dt), qr)
|
|
|
+ 2752 ELSE
|
|
|
+ 2753 QbeGen.IntStr(VAL(
|
|
|
+ 2754 INTEGER,
|
|
|
+ 2755 SymTab.ArrayLen(dt)),
|
|
|
+ 2756 qr)
|
|
|
+ 2757 END;
|
|
|
+ 2758 t := SymTab.IntType();
|
|
|
+ 2759 QbeGen.CopyOp(qr, q)
|
|
|
+ 2760 END
|
|
|
+ 2761 END; .)
|
|
|
+ 2762 | ( "SIZE" | "TSIZE" ) "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
+ 2763 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2764 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "SIZE"));
|
|
|
+ 2765 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2766 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2767 (. IF dt = SymTab.InvalidType THEN
|
|
|
+ 2768 t := SymTab.InvalidType;
|
|
|
+ 2769 QbeGen.CopyOp("0", q)
|
|
|
+ 2770 ELSE
|
|
|
+ 2771 QbeGen.IntStr(VAL(INTEGER,
|
|
|
+ 2772 SymTab.ObjectSize(dt)), q);
|
|
|
+ 2773 t := SymTab.IntType()
|
|
|
+ 2774 END; .)
|
|
|
+ 2775 | ( "SHIFT" (. isMax := FALSE; .)
|
|
|
+ 2776 | "ROTATE" (. isMax := TRUE; .) )
|
|
|
+ 2777 "(" Expr<et, q> (. astArg2 := astCur; .) "," Expr<et2, q2> ")"
|
|
|
+ 2778 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2779 IF isMax THEN AST.SetChild(astNode, 0,
|
|
|
+ 2780 AST.MakeLeaf(AST.NkIdent, "ROTATE"))
|
|
|
+ 2781 ELSE AST.SetChild(astNode, 0,
|
|
|
+ 2782 AST.MakeLeaf(AST.NkIdent, "SHIFT")) END;
|
|
|
+ 2783 IF astArg2 # AST.NoNode THEN AST.SetChild(astNode, 1, astArg2) END;
|
|
|
+ 2784 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 2, astCur) END;
|
|
|
+ 2785 astCur := astNode; astIsLit := TRUE;
|
|
|
+ 2786 (* set shift/rotate: isMax
|
|
|
+ 2787 doubles as "rotate" *)
|
|
|
+ 2788 IF (et # SymTab.InvalidType)
|
|
|
+ 2789 AND (SymTab.ClassOf(et) =
|
|
|
+ 2790 SymTab.ClSet) THEN
|
|
|
+ 2791 t := et;
|
|
|
+ 2792 QbeGen.CopyOp("@", q)
|
|
|
+ 2793 ELSE SemError(230);
|
|
|
+ 2794 t := SymTab.InvalidType;
|
|
|
+ 2795 QbeGen.CopyOp("0", q)
|
|
|
+ 2796 END; .)
|
|
|
+ 2797 | ( "MIN" (. isMax := FALSE; .)
|
|
|
+ 2798 | "MAX" (. isMax := TRUE; .) )
|
|
|
+ 2799 "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
+ 2800 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2801 IF isMax THEN AST.SetChild(astNode, 0,
|
|
|
+ 2802 AST.MakeLeaf(AST.NkIdent, "MAX"))
|
|
|
+ 2803 ELSE AST.SetChild(astNode, 0,
|
|
|
+ 2804 AST.MakeLeaf(AST.NkIdent, "MIN")) END;
|
|
|
+ 2805 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2806 astCur := astNode; astIsLit := TRUE;
|
|
|
+ 2807 IF (dt # SymTab.InvalidType)
|
|
|
+ 2808 AND (SymTab.ClassOf(dt) = SymTab.ClReal) THEN
|
|
|
+ 2809 (* REAL/LONGREAL: the
|
|
|
+ 2810 implementation bounds *)
|
|
|
+ 2811 IF isMax THEN
|
|
|
+ 2812 QbeGen.NormReal(
|
|
|
+ 2813 "3.402823e38", q)
|
|
|
+ 2814 ELSE QbeGen.NormReal(
|
|
|
+ 2815 "-3.402823e38", q)
|
|
|
+ 2816 END;
|
|
|
+ 2817 t := SymTab.RealType()
|
|
|
+ 2818 ELSIF (dt #
|
|
|
+ 2819 SymTab.InvalidType)
|
|
|
+ 2820 AND (SymTab.ClassOf(dt) =
|
|
|
+ 2821 SymTab.ClLong) THEN
|
|
|
+ 2822 IF isMax THEN
|
|
|
+ 2823 QbeGen.CopyOp(
|
|
|
+ 2824 "9223372036854775807", q)
|
|
|
+ 2825 ELSE QbeGen.CopyOp(
|
|
|
+ 2826 "-9223372036854775808", q)
|
|
|
+ 2827 END;
|
|
|
+ 2828 t := SymTab.LongType()
|
|
|
+ 2829 ELSIF SymTab.TypeBounds(dt, lo,
|
|
|
+ 2830 hi) THEN
|
|
|
+ 2831 IF isMax THEN
|
|
|
+ 2832 QbeGen.IntStr(hi, q)
|
|
|
+ 2833 ELSE QbeGen.IntStr(lo, q)
|
|
|
+ 2834 END;
|
|
|
+ 2835 t := SymTab.IntType()
|
|
|
+ 2836 ELSE SemError(230);
|
|
|
+ 2837 t := SymTab.InvalidType;
|
|
|
+ 2838 QbeGen.CopyOp("0", q)
|
|
|
+ 2839 END; .)
|
|
|
+ 2840 | "ADR" "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
+ 2841 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2842 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ADR"));
|
|
|
+ 2843 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2844 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2845 (. IF dt = SymTab.InvalidType THEN
|
|
|
+ 2846 t := SymTab.InvalidType;
|
|
|
+ 2847 QbeGen.CopyOp("0", q)
|
|
|
+ 2848 ELSE
|
|
|
+ 2849 IF sfx
|
|
|
+ 2850 OR (dk = SymTab.KindVar)
|
|
|
+ 2851 OR (dk = SymTab.KindParam) THEN
|
|
|
+ 2852 QbeGen.CopyOp("@", q)
|
|
|
+ 2853 ELSE SemError(230);
|
|
|
+ 2854 QbeGen.CopyOp("0", q)
|
|
|
+ 2855 END;
|
|
|
+ 2856 t := SymTab.AddrType()
|
|
|
+ 2857 END; .)
|
|
|
+ 2858 | "CHR" "(" Expr<et, q> ")"
|
|
|
+ 2859 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2860 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CHR"));
|
|
|
+ 2861 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2862 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2863 (. IF (et # SymTab.InvalidType)
|
|
|
+ 2864 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
+ 2865 SemError(211) END;
|
|
|
+ 2866 t := SymTab.CharType(); .)
|
|
|
+ 2867 | ( "ORD" | "ORDL" ) "(" Expr<et, q> ")"
|
|
|
+ 2868 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2869 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ORD"));
|
|
|
+ 2870 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2871 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2872 (. IF et # SymTab.InvalidType THEN
|
|
|
+ 2873 IF (SymTab.ClassOf(et) #
|
|
|
+ 2874 SymTab.ClChar)
|
|
|
+ 2875 AND (SymTab.ClassOf(et) #
|
|
|
+ 2876 SymTab.ClBool)
|
|
|
+ 2877 AND (SymTab.ClassOf(et) #
|
|
|
+ 2878 SymTab.ClEnum)
|
|
|
+ 2879 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
+ 2880 SemError(211) END
|
|
|
+ 2881 END;
|
|
|
+ 2882 t := SymTab.IntType(); .)
|
|
|
+ 2883 | "CAP" "(" Expr<et, q> ")"
|
|
|
+ 2884 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2885 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CAP"));
|
|
|
+ 2886 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2887 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2888 (. QbeGen.CapQ(q, qa);
|
|
|
+ 2889 QbeGen.CopyOp(qa, q);
|
|
|
+ 2890 t := SymTab.CharType(); .)
|
|
|
+ 2891 | "UCHR" "(" Expr<et, q> ")"
|
|
|
+ 2892 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2893 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "UCHR"));
|
|
|
+ 2894 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2895 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2896 (. (* UCHR: the UCHAR constructor.
|
|
|
+ 2897 CHAR -> UCHAR (identity);
|
|
|
+ 2898 INTEGER familly -> UCHAR
|
|
|
+ 2899 (codepoint value). *)
|
|
|
+ 2900 IF (et # SymTab.InvalidType)
|
|
|
+ 2901 AND (SymTab.ClassOf(et) # SymTab.ClChar)
|
|
|
+ 2902 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
+ 2903 SemError(211) END;
|
|
|
+ 2904 t := SymTab.UCharType(); .)
|
|
|
+ 2905 | "CHR8" "(" Expr<et, q> ")"
|
|
|
+ 2906 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2907 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CHR8"));
|
|
|
+ 2908 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2909 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2910 (. IF (et # SymTab.InvalidType)
|
|
|
+ 2911 AND (SymTab.ClassOf(et) # SymTab.ClUChar) THEN
|
|
|
+ 2912 SemError(211) END;
|
|
|
+ 2913 t := SymTab.CharType(); .)
|
|
|
+ 2914 | "UORD" "(" Expr<et, q> ")"
|
|
|
+ 2915 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2916 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "UORD"));
|
|
|
+ 2917 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2918 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2919 (. (* UORD(u): the codepoint as a
|
|
|
+ 2920 32-bit ordinal (INTEGER),
|
|
|
+ 2921 cf. ORD for CHAR. *)
|
|
|
+ 2922 IF (et # SymTab.InvalidType)
|
|
|
+ 2923 AND (SymTab.ClassOf(et) # SymTab.ClUChar) THEN
|
|
|
+ 2924 SemError(211) END;
|
|
|
+ 2925 t := SymTab.IntType(); .)
|
|
|
+ 2926 | "ABS" "(" Expr<et, q> ")"
|
|
|
+ 2927 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2928 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ABS"));
|
|
|
+ 2929 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
+ 2930 astCur := astNode; astIsLit := TRUE; .)
|
|
|
+ 2931 (. IF (et # SymTab.InvalidType)
|
|
|
+ 2932 AND NOT SymTab.IsIntFamily(et)
|
|
|
+ 2933 AND (SymTab.ClassOf(et) #
|
|
|
+ 2934 SymTab.ClReal) THEN
|
|
|
+ 2935 SemError(211)
|
|
|
+ 2936 ELSE QbeGen.AbsQ(q, qa,
|
|
|
+ 2937 SymTab.ClassOf(et) =
|
|
|
+ 2938 SymTab.ClReal);
|
|
|
+ 2939 QbeGen.CopyOp(qa, q)
|
|
|
+ 2940 END;
|
|
|
+ 2941 t := et; .)
|
|
|
+ 2942 | "VAL" "(" GetIdent<vn> (. astArg2 := AST.MakeLeaf(AST.NkIdent, vn); .) "," Expr<et, q> ")"
|
|
|
+ 2943 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
+ 2944 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "VAL"));
|
|
|
+ 2945 IF astArg2 # AST.NoNode THEN AST.SetChild(astNode, 1, astArg2) END;
|
|
|
+ 2946 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 2, astCur) END;
|
|
|
2947 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2948 (. IF (et # SymTab.InvalidType)
|
|
|
- 2949 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
- 2950 SemError(211) END;
|
|
|
- 2951 t := SymTab.CharType(); .)
|
|
|
- 2952 | ( "ORD" | "ORDL" ) "(" Expr<et, q> ")"
|
|
|
- 2953 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2954 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ORD"));
|
|
|
- 2955 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2956 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2957 (. IF et # SymTab.InvalidType THEN
|
|
|
- 2958 IF (SymTab.ClassOf(et) #
|
|
|
- 2959 SymTab.ClChar)
|
|
|
- 2960 AND (SymTab.ClassOf(et) #
|
|
|
- 2961 SymTab.ClBool)
|
|
|
- 2962 AND (SymTab.ClassOf(et) #
|
|
|
- 2963 SymTab.ClEnum)
|
|
|
- 2964 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
- 2965 SemError(211) END
|
|
|
- 2966 END;
|
|
|
- 2967 t := SymTab.IntType(); .)
|
|
|
- 2968 | "CAP" "(" Expr<et, q> ")"
|
|
|
- 2969 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2970 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CAP"));
|
|
|
- 2971 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2972 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2973 (. QbeGen.CapQ(q, qa);
|
|
|
- 2974 QbeGen.CopyOp(qa, q);
|
|
|
- 2975 t := SymTab.CharType(); .)
|
|
|
- 2976 | "UCHR" "(" Expr<et, q> ")"
|
|
|
- 2977 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2978 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "UCHR"));
|
|
|
- 2979 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2980 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2981 (. (* UCHR: the UCHAR constructor.
|
|
|
- 2982 CHAR -> UCHAR (identity);
|
|
|
- 2983 INTEGER familly -> UCHAR
|
|
|
- 2984 (codepoint value). *)
|
|
|
- 2985 IF (et # SymTab.InvalidType)
|
|
|
- 2986 AND (SymTab.ClassOf(et) # SymTab.ClChar)
|
|
|
- 2987 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
- 2988 SemError(211) END;
|
|
|
- 2989 t := SymTab.UCharType(); .)
|
|
|
- 2990 | "CHR8" "(" Expr<et, q> ")"
|
|
|
- 2991 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2992 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CHR8"));
|
|
|
- 2993 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2994 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2995 (. IF (et # SymTab.InvalidType)
|
|
|
- 2996 AND (SymTab.ClassOf(et) # SymTab.ClUChar) THEN
|
|
|
- 2997 SemError(211) END;
|
|
|
- 2998 t := SymTab.CharType(); .)
|
|
|
- 2999 | "UORD" "(" Expr<et, q> ")"
|
|
|
- 3000 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3001 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "UORD"));
|
|
|
- 3002 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3003 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3004 (. (* UORD(u): the codepoint as a
|
|
|
- 3005 32-bit ordinal (INTEGER),
|
|
|
- 3006 cf. ORD for CHAR. *)
|
|
|
- 3007 IF (et # SymTab.InvalidType)
|
|
|
- 3008 AND (SymTab.ClassOf(et) # SymTab.ClUChar) THEN
|
|
|
- 3009 SemError(211) END;
|
|
|
- 3010 t := SymTab.IntType(); .)
|
|
|
- 3011 | "ABS" "(" Expr<et, q> ")"
|
|
|
- 3012 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3013 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ABS"));
|
|
|
- 3014 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3015 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3016 (. IF (et # SymTab.InvalidType)
|
|
|
- 3017 AND NOT SymTab.IsIntFamily(et)
|
|
|
- 3018 AND (SymTab.ClassOf(et) #
|
|
|
- 3019 SymTab.ClReal) THEN
|
|
|
- 3020 SemError(211)
|
|
|
- 3021 ELSE QbeGen.AbsQ(q, qa,
|
|
|
- 3022 SymTab.ClassOf(et) =
|
|
|
- 3023 SymTab.ClReal);
|
|
|
- 3024 QbeGen.CopyOp(qa, q)
|
|
|
- 3025 END;
|
|
|
- 3026 t := et; .)
|
|
|
- 3027 | "VAL" "(" GetIdent<vn> (. astArg2 := AST.MakeLeaf(AST.NkIdent, vn); .) "," Expr<et, q> ")"
|
|
|
- 3028 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3029 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "VAL"));
|
|
|
- 3030 IF astArg2 # AST.NoNode THEN AST.SetChild(astNode, 1, astArg2) END;
|
|
|
- 3031 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 2, astCur) END;
|
|
|
- 3032 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3033 (. IF NOT SymTab.Lookup(vn) THEN
|
|
|
- 3034 SemError(201);
|
|
|
- 3035 t := SymTab.InvalidType
|
|
|
- 3036 ELSE vt := SymTab.SymType(vn);
|
|
|
- 3037 IF vt = SymTab.InvalidType THEN
|
|
|
- 3038 t := SymTab.InvalidType
|
|
|
- 3039 ELSIF et =
|
|
|
- 3040 SymTab.InvalidType THEN
|
|
|
- 3041 t := vt
|
|
|
- 3042 ELSE
|
|
|
- 3043 c1 := SymTab.ClassOf(et);
|
|
|
- 3044 c2 := SymTab.ClassOf(vt);
|
|
|
- 3045 IF (c1 = SymTab.ClInt)
|
|
|
- 3046 AND (c2 = SymTab.ClLong) THEN
|
|
|
- 3047 QbeGen.WidenLong(q, qa);
|
|
|
- 3048 QbeGen.CopyOp(qa, q);
|
|
|
- 3049 t := vt
|
|
|
- 3050 ELSIF (c1 = SymTab.ClLong)
|
|
|
- 3051 AND (c2 = SymTab.ClInt) THEN
|
|
|
- 3052 QbeGen.NarrowLong(q, qa);
|
|
|
- 3053 QbeGen.CopyOp(qa, q);
|
|
|
- 3054 t := vt
|
|
|
- 3055 ELSIF (c1 = SymTab.ClInt)
|
|
|
- 3056 AND (c2 = SymTab.ClReal) THEN
|
|
|
- 3057 QbeGen.ConvIR(q, qa);
|
|
|
- 3058 QbeGen.CopyOp(qa, q);
|
|
|
- 3059 t := vt
|
|
|
- 3060 ELSIF (c1 = SymTab.ClLong)
|
|
|
- 3061 AND (c2 = SymTab.ClReal) THEN
|
|
|
- 3062 QbeGen.ConvLR(q, qa);
|
|
|
- 3063 QbeGen.CopyOp(qa, q);
|
|
|
- 3064 t := vt
|
|
|
- 3065 ELSIF (c1 = SymTab.ClReal)
|
|
|
- 3066 AND (c2 = SymTab.ClInt) THEN
|
|
|
- 3067 QbeGen.ConvRI(q, qa);
|
|
|
- 3068 QbeGen.CopyOp(qa, q);
|
|
|
- 3069 t := vt
|
|
|
- 3070 ELSIF (c1 = SymTab.ClReal)
|
|
|
- 3071 AND (c2 = SymTab.ClLong) THEN
|
|
|
- 3072 QbeGen.ConvRL(q, qa);
|
|
|
- 3073 QbeGen.CopyOp(qa, q);
|
|
|
- 3074 t := vt
|
|
|
- 3075 ELSIF ((c1 = SymTab.ClInt)
|
|
|
- 3076 OR (c1 =
|
|
|
- 3077 SymTab.ClChar)
|
|
|
- 3078 OR (c1 =
|
|
|
- 3079 SymTab.ClBool)
|
|
|
- 3080 OR (c1 =
|
|
|
- 3081 SymTab.ClEnum))
|
|
|
- 3082 AND ((c2 = SymTab.ClInt)
|
|
|
- 3083 OR (c2 =
|
|
|
- 3084 SymTab.ClChar)
|
|
|
- 3085 OR (c2 =
|
|
|
- 3086 SymTab.ClBool)
|
|
|
- 3087 OR (c2 =
|
|
|
- 3088 SymTab.ClEnum)) THEN
|
|
|
- 3089 t := vt
|
|
|
- 3090 ELSIF (c1 = SymTab.ClPtr)
|
|
|
- 3091 AND (c2 = SymTab.ClPtr) THEN
|
|
|
- 3092 t := vt
|
|
|
- 3093 ELSIF (c1 = SymTab.ClReal)
|
|
|
- 3094 AND (c2 = SymTab.ClReal) THEN
|
|
|
- 3095 t := vt
|
|
|
- 3096 ELSE SemError(230);
|
|
|
- 3097 t := SymTab.InvalidType
|
|
|
- 3098 END
|
|
|
- 3099 END
|
|
|
- 3100 END; .)
|
|
|
- 3101 | "(" Expr<et, q> ")" (. t := et; astIsLit := TRUE; .)
|
|
|
- 3102 | SetLit<st, sq> (. astIsLit := TRUE; t := st;
|
|
|
- 3103 QbeGen.CopyOp(sq, q); .)
|
|
|
- 3104 | ( "NOT" | "~" ) Fact<t2, q2> (. astNot := astCur;
|
|
|
- 3105 IF SymTab.BoolCheck(t2) THEN
|
|
|
- 3106 t := SymTab.BoolType()
|
|
|
- 3107 ELSE SemError(212);
|
|
|
- 3108 t := SymTab.InvalidType END;
|
|
|
- 3109 IF t # SymTab.InvalidType THEN
|
|
|
- 3110 QbeGen.NotQ(q2, q)
|
|
|
- 3111 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 3112 END;
|
|
|
- 3113 astIsLit := TRUE;
|
|
|
- 3114 astCur := AST.MakeUn(
|
|
|
- 3115 AST.NkUnary, AST.OpNot, astNot); .)
|
|
|
- 3116 )
|
|
|
- 3117 (. IF NOT astIsLit THEN astCur := AST.NoNode END; .) .
|
|
|
- 3118 (* Set literals are SET OF [0..255] (8 words); elements validated
|
|
|
- 3119 0..255 statically when foldable (222 otherwise), runtime trap
|
|
|
- 3120 for computed elements. Ranges always lower via SetRange. *)
|
|
|
- 3121 SetLit<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 3122 (. VAR astNode: AST.Node; .)
|
|
|
- 3123 = "{" (. t := SymTab.NewSet(
|
|
|
- 3124 SymTab.NewSubR(0, 255));
|
|
|
- 3125 astNode := AST.MakeNode(AST.NkSetLit);
|
|
|
- 3126 QbeGen.NewSetTemp(8, q);
|
|
|
- 3127 QbeGen.SetZero(q, 8); .)
|
|
|
- 3128 [ SetElem<t, q, astNode> { "," SetElem<t, q, astNode> } ]
|
|
|
- 3129 "}" (. astCur := astNode; .) .
|
|
|
- 3130 (* Typed brace constructor: TypeName{ elems } — BITSET{0} (a set)
|
|
|
- 3131 or ArrayName{...} (an array constructor, GNU Modula-2). The
|
|
|
- 3132 declared type sets the width (set) or element type (array). *)
|
|
|
- 3133 TypedBraceLit<vt: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 3134 (. VAR nw: CARDINAL;
|
|
|
- 3135 astNode, astTail: AST.Node;
|
|
|
- 3136 savedCls: INTEGER; .)
|
|
|
- 3137 = "{" (. savedCls := braceCls;
|
|
|
- 3138 astNode := AST.MakeNode(AST.NkBraceLit);
|
|
|
- 3139 AST.SetTy(astNode, vt);
|
|
|
- 3140 astTail := astNode;
|
|
|
- 3141 IF vt = SymTab.InvalidType THEN
|
|
|
- 3142 braceCls := -1
|
|
|
- 3143 ELSE braceCls :=
|
|
|
- 3144 SymTab.ClassOf(vt)
|
|
|
- 3145 END;
|
|
|
- 3146 IF braceCls = SymTab.ClSet THEN
|
|
|
- 3147 IF vt = SymTab.InvalidType THEN
|
|
|
- 3148 nw := 8
|
|
|
- 3149 ELSE nw := SymTab.SetWords(vt);
|
|
|
- 3150 IF nw = 0 THEN nw := 8 END
|
|
|
- 3151 END;
|
|
|
- 3152 QbeGen.NewSetTemp(nw, q);
|
|
|
- 3153 QbeGen.SetZero(q, nw)
|
|
|
- 3154 ELSIF (braceCls =
|
|
|
- 3155 SymTab.ClArray)
|
|
|
- 3156 OR (braceCls =
|
|
|
- 3157 SymTab.ClRecord)
|
|
|
+ 2948 (. IF NOT SymTab.Lookup(vn) THEN
|
|
|
+ 2949 SemError(201);
|
|
|
+ 2950 t := SymTab.InvalidType
|
|
|
+ 2951 ELSE vt := SymTab.SymType(vn);
|
|
|
+ 2952 IF vt = SymTab.InvalidType THEN
|
|
|
+ 2953 t := SymTab.InvalidType
|
|
|
+ 2954 ELSIF et =
|
|
|
+ 2955 SymTab.InvalidType THEN
|
|
|
+ 2956 t := vt
|
|
|
+ 2957 ELSE
|
|
|
+ 2958 c1 := SymTab.ClassOf(et);
|
|
|
+ 2959 c2 := SymTab.ClassOf(vt);
|
|
|
+ 2960 IF (c1 = SymTab.ClInt)
|
|
|
+ 2961 AND (c2 = SymTab.ClLong) THEN
|
|
|
+ 2962 QbeGen.WidenLong(q, qa);
|
|
|
+ 2963 QbeGen.CopyOp(qa, q);
|
|
|
+ 2964 t := vt
|
|
|
+ 2965 ELSIF (c1 = SymTab.ClLong)
|
|
|
+ 2966 AND (c2 = SymTab.ClInt) THEN
|
|
|
+ 2967 QbeGen.NarrowLong(q, qa);
|
|
|
+ 2968 QbeGen.CopyOp(qa, q);
|
|
|
+ 2969 t := vt
|
|
|
+ 2970 ELSIF (c1 = SymTab.ClInt)
|
|
|
+ 2971 AND (c2 = SymTab.ClReal) THEN
|
|
|
+ 2972 QbeGen.ConvIR(q, qa);
|
|
|
+ 2973 QbeGen.CopyOp(qa, q);
|
|
|
+ 2974 t := vt
|
|
|
+ 2975 ELSIF (c1 = SymTab.ClLong)
|
|
|
+ 2976 AND (c2 = SymTab.ClReal) THEN
|
|
|
+ 2977 QbeGen.ConvLR(q, qa);
|
|
|
+ 2978 QbeGen.CopyOp(qa, q);
|
|
|
+ 2979 t := vt
|
|
|
+ 2980 ELSIF (c1 = SymTab.ClReal)
|
|
|
+ 2981 AND (c2 = SymTab.ClInt) THEN
|
|
|
+ 2982 QbeGen.ConvRI(q, qa);
|
|
|
+ 2983 QbeGen.CopyOp(qa, q);
|
|
|
+ 2984 t := vt
|
|
|
+ 2985 ELSIF (c1 = SymTab.ClReal)
|
|
|
+ 2986 AND (c2 = SymTab.ClLong) THEN
|
|
|
+ 2987 QbeGen.ConvRL(q, qa);
|
|
|
+ 2988 QbeGen.CopyOp(qa, q);
|
|
|
+ 2989 t := vt
|
|
|
+ 2990 ELSIF ((c1 = SymTab.ClInt)
|
|
|
+ 2991 OR (c1 =
|
|
|
+ 2992 SymTab.ClChar)
|
|
|
+ 2993 OR (c1 =
|
|
|
+ 2994 SymTab.ClBool)
|
|
|
+ 2995 OR (c1 =
|
|
|
+ 2996 SymTab.ClEnum))
|
|
|
+ 2997 AND ((c2 = SymTab.ClInt)
|
|
|
+ 2998 OR (c2 =
|
|
|
+ 2999 SymTab.ClChar)
|
|
|
+ 3000 OR (c2 =
|
|
|
+ 3001 SymTab.ClBool)
|
|
|
+ 3002 OR (c2 =
|
|
|
+ 3003 SymTab.ClEnum)) THEN
|
|
|
+ 3004 t := vt
|
|
|
+ 3005 ELSIF (c1 = SymTab.ClPtr)
|
|
|
+ 3006 AND (c2 = SymTab.ClPtr) THEN
|
|
|
+ 3007 t := vt
|
|
|
+ 3008 ELSIF (c1 = SymTab.ClReal)
|
|
|
+ 3009 AND (c2 = SymTab.ClReal) THEN
|
|
|
+ 3010 t := vt
|
|
|
+ 3011 ELSE SemError(230);
|
|
|
+ 3012 t := SymTab.InvalidType
|
|
|
+ 3013 END
|
|
|
+ 3014 END
|
|
|
+ 3015 END; .)
|
|
|
+ 3016 | "(" Expr<et, q> ")" (. t := et; astIsLit := TRUE; .)
|
|
|
+ 3017 | SetLit<st, sq> (. astIsLit := TRUE; t := st;
|
|
|
+ 3018 QbeGen.CopyOp(sq, q); .)
|
|
|
+ 3019 | ( "NOT" | "~" ) Fact<t2, q2> (. astNot := astCur;
|
|
|
+ 3020 IF SymTab.BoolCheck(t2) THEN
|
|
|
+ 3021 t := SymTab.BoolType()
|
|
|
+ 3022 ELSE SemError(212);
|
|
|
+ 3023 t := SymTab.InvalidType END;
|
|
|
+ 3024 IF t # SymTab.InvalidType THEN
|
|
|
+ 3025 QbeGen.NotQ(q2, q)
|
|
|
+ 3026 ELSE QbeGen.CopyOp("0", q)
|
|
|
+ 3027 END;
|
|
|
+ 3028 astIsLit := TRUE;
|
|
|
+ 3029 astCur := AST.MakeUn(
|
|
|
+ 3030 AST.NkUnary, AST.OpNot, astNot); .)
|
|
|
+ 3031 )
|
|
|
+ 3032 (. IF NOT astIsLit THEN astCur := AST.NoNode END; .) .
|
|
|
+ 3033 (* Set literals are SET OF [0..255] (8 words); elements validated
|
|
|
+ 3034 0..255 statically when foldable (222 otherwise), runtime trap
|
|
|
+ 3035 for computed elements. Ranges always lower via SetRange. *)
|
|
|
+ 3036 SetLit<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 3037 (. VAR astNode: AST.Node; .)
|
|
|
+ 3038 = "{" (. t := SymTab.NewSet(
|
|
|
+ 3039 SymTab.NewSubR(0, 255));
|
|
|
+ 3040 astNode := AST.MakeNode(AST.NkSetLit);
|
|
|
+ 3041 QbeGen.NewSetTemp(8, q);
|
|
|
+ 3042 QbeGen.SetZero(q, 8); .)
|
|
|
+ 3043 [ SetElem<t, q, astNode> { "," SetElem<t, q, astNode> } ]
|
|
|
+ 3044 "}" (. astCur := astNode; .) .
|
|
|
+ 3045 (* Typed brace constructor: TypeName{ elems } — BITSET{0} (a set)
|
|
|
+ 3046 or ArrayName{...} (an array constructor, GNU Modula-2). The
|
|
|
+ 3047 declared type sets the width (set) or element type (array). *)
|
|
|
+ 3048 TypedBraceLit<vt: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
+ 3049 (. VAR nw: CARDINAL;
|
|
|
+ 3050 astNode, astTail: AST.Node;
|
|
|
+ 3051 savedCls: INTEGER; .)
|
|
|
+ 3052 = "{" (. savedCls := braceCls;
|
|
|
+ 3053 astNode := AST.MakeNode(AST.NkBraceLit);
|
|
|
+ 3054 AST.SetTy(astNode, vt);
|
|
|
+ 3055 astTail := astNode;
|
|
|
+ 3056 IF vt = SymTab.InvalidType THEN
|
|
|
+ 3057 braceCls := -1
|
|
|
+ 3058 ELSE braceCls :=
|
|
|
+ 3059 SymTab.ClassOf(vt)
|
|
|
+ 3060 END;
|
|
|
+ 3061 IF braceCls = SymTab.ClSet THEN
|
|
|
+ 3062 IF vt = SymTab.InvalidType THEN
|
|
|
+ 3063 nw := 8
|
|
|
+ 3064 ELSE nw := SymTab.SetWords(vt);
|
|
|
+ 3065 IF nw = 0 THEN nw := 8 END
|
|
|
+ 3066 END;
|
|
|
+ 3067 QbeGen.NewSetTemp(nw, q);
|
|
|
+ 3068 QbeGen.SetZero(q, nw)
|
|
|
+ 3069 ELSIF (braceCls =
|
|
|
+ 3070 SymTab.ClArray)
|
|
|
+ 3071 OR (braceCls =
|
|
|
+ 3072 SymTab.ClRecord)
|
|
|
+ 3073 OR (braceCls =
|
|
|
+ 3074 SymTab.ClClass) THEN
|
|
|
+ 3075 QbeGen.CtorBegin(vt)
|
|
|
+ 3076 ELSE
|
|
|
+ 3077 IF vt # SymTab.InvalidType THEN
|
|
|
+ 3078 SemError(230) END;
|
|
|
+ 3079 braceCls := -1
|
|
|
+ 3080 END; .)
|
|
|
+ 3081 [ BraceElem<vt, q, astNode, astTail>
|
|
|
+ 3082 { "," BraceElem<vt, q, astNode, astTail> } ]
|
|
|
+ 3083 "}" (. IF (braceCls = SymTab.ClArray)
|
|
|
+ 3084 OR (braceCls =
|
|
|
+ 3085 SymTab.ClRecord)
|
|
|
+ 3086 OR (braceCls =
|
|
|
+ 3087 SymTab.ClClass) THEN
|
|
|
+ 3088 QbeGen.CtorEnd(q)
|
|
|
+ 3089 ELSIF braceCls # SymTab.ClSet THEN
|
|
|
+ 3090 QbeGen.CopyOp("0", q)
|
|
|
+ 3091 END;
|
|
|
+ 3092 braceCls := savedCls; .)
|
|
|
+ 3093 (. astCur := astNode; .) .
|
|
|
+ 3094 BraceElem<vt: SymTab.TypeIndex; VAR sq: QbeGen.QVal;
|
|
|
+ 3095 VAR node, tail: AST.Node>
|
|
|
+ 3096 (. VAR et, et2: SymTab.TypeIndex;
|
|
|
+ 3097 qe, q2: QbeGen.QVal;
|
|
|
+ 3098 v, v2, reps, k: INTEGER;
|
|
|
+ 3099 elem: SymTab.TypeIndex;
|
|
|
+ 3100 lo: INTEGER;
|
|
|
+ 3101 span: CARDINAL;
|
|
|
+ 3102 cl, cl2: INTEGER;
|
|
|
+ 3103 hasR, hasB: BOOLEAN;
|
|
|
+ 3104 astEl: AST.Node; .)
|
|
|
+ 3105 = (. hasR := FALSE; hasB := FALSE;
|
|
|
+ 3106 reps := 1; .)
|
|
|
+ 3107 Expr<et, qe> (. astEl := astCur; .)
|
|
|
+ 3108 [ ".." Expr<et2, q2> (. astEl := AST.MakeBin(
|
|
|
+ 3109 AST.NkSubrange, 0, astEl, astCur);
|
|
|
+ 3110 hasR := TRUE; .) ]
|
|
|
+ 3111 [ "BY" Expr<et2, q2> (. hasB := TRUE; .) ]
|
|
|
+ 3112 (. IF braceCls = SymTab.ClSet THEN
|
|
|
+ 3113 IF hasB THEN SemError(230) END;
|
|
|
+ 3114 lo := SymTab.SetBaseLo(vt);
|
|
|
+ 3115 span := SymTab.SetCount(vt);
|
|
|
+ 3116 IF (et = SymTab.InvalidType)
|
|
|
+ 3117 OR (hasR AND (et2 =
|
|
|
+ 3118 SymTab.InvalidType)) THEN
|
|
|
+ 3119 ELSE cl :=
|
|
|
+ 3120 SymTab.ClassOf(et);
|
|
|
+ 3121 IF hasR THEN
|
|
|
+ 3122 cl2 :=
|
|
|
+ 3123 SymTab.ClassOf(et2)
|
|
|
+ 3124 ELSE cl2 := SymTab.ClInt
|
|
|
+ 3125 END;
|
|
|
+ 3126 IF NOT SymTab.SetElemClassOk(cl)
|
|
|
+ 3127 OR (hasR AND NOT
|
|
|
+ 3128 SymTab.SetElemClassOk(cl2))
|
|
|
+ 3129 THEN
|
|
|
+ 3130 SemError(222)
|
|
|
+ 3131 ELSIF hasR
|
|
|
+ 3132 AND SymTab.ConstInt(qe, v)
|
|
|
+ 3133 AND SymTab.ConstInt(q2,
|
|
|
+ 3134 v2)
|
|
|
+ 3135 AND ((v < lo)
|
|
|
+ 3136 OR (v2 < lo)
|
|
|
+ 3137 OR (v >= lo +
|
|
|
+ 3138 VAL(INTEGER, span))
|
|
|
+ 3139 OR (v2 >= lo +
|
|
|
+ 3140 VAL(INTEGER, span))
|
|
|
+ 3141 OR (v > v2)) THEN
|
|
|
+ 3142 SemError(222)
|
|
|
+ 3143 ELSIF hasR THEN
|
|
|
+ 3144 QbeGen.SetRange(sq, qe, q2,
|
|
|
+ 3145 lo, span)
|
|
|
+ 3146 ELSIF SymTab.ConstInt(qe,
|
|
|
+ 3147 v)
|
|
|
+ 3148 AND ((v < lo)
|
|
|
+ 3149 OR (v >= lo +
|
|
|
+ 3150 VAL(INTEGER,
|
|
|
+ 3151 span))) THEN
|
|
|
+ 3152 SemError(222)
|
|
|
+ 3153 ELSE QbeGen.SetBit(sq, qe,
|
|
|
+ 3154 lo, span)
|
|
|
+ 3155 END
|
|
|
+ 3156 END
|
|
|
+ 3157 ELSIF (braceCls = SymTab.ClArray)
|
|
|
3158 OR (braceCls =
|
|
|
- 3159 SymTab.ClClass) THEN
|
|
|
- 3160 QbeGen.CtorBegin(vt)
|
|
|
- 3161 ELSE
|
|
|
- 3162 IF vt # SymTab.InvalidType THEN
|
|
|
- 3163 SemError(230) END;
|
|
|
- 3164 braceCls := -1
|
|
|
- 3165 END; .)
|
|
|
- 3166 [ BraceElem<vt, q, astNode, astTail>
|
|
|
- 3167 { "," BraceElem<vt, q, astNode, astTail> } ]
|
|
|
- 3168 "}" (. IF (braceCls = SymTab.ClArray)
|
|
|
- 3169 OR (braceCls =
|
|
|
- 3170 SymTab.ClRecord)
|
|
|
- 3171 OR (braceCls =
|
|
|
- 3172 SymTab.ClClass) THEN
|
|
|
- 3173 QbeGen.CtorEnd(q)
|
|
|
- 3174 ELSIF braceCls # SymTab.ClSet THEN
|
|
|
- 3175 QbeGen.CopyOp("0", q)
|
|
|
- 3176 END;
|
|
|
- 3177 braceCls := savedCls; .)
|
|
|
- 3178 (. astCur := astNode; .) .
|
|
|
- 3179 BraceElem<vt: SymTab.TypeIndex; VAR sq: QbeGen.QVal;
|
|
|
- 3180 VAR node, tail: AST.Node>
|
|
|
- 3181 (. VAR et, et2: SymTab.TypeIndex;
|
|
|
- 3182 qe, q2: QbeGen.QVal;
|
|
|
- 3183 v, v2, reps, k: INTEGER;
|
|
|
- 3184 elem: SymTab.TypeIndex;
|
|
|
- 3185 lo: INTEGER;
|
|
|
- 3186 span: CARDINAL;
|
|
|
- 3187 cl, cl2: INTEGER;
|
|
|
- 3188 hasR, hasB: BOOLEAN;
|
|
|
- 3189 astEl: AST.Node; .)
|
|
|
- 3190 = (. hasR := FALSE; hasB := FALSE;
|
|
|
- 3191 reps := 1; .)
|
|
|
- 3192 Expr<et, qe> (. astEl := astCur; .)
|
|
|
- 3193 [ ".." Expr<et2, q2> (. astEl := AST.MakeBin(
|
|
|
- 3194 AST.NkSubrange, 0, astEl, astCur);
|
|
|
- 3195 hasR := TRUE; .) ]
|
|
|
- 3196 [ "BY" Expr<et2, q2> (. hasB := TRUE; .) ]
|
|
|
- 3197 (. IF braceCls = SymTab.ClSet THEN
|
|
|
- 3198 IF hasB THEN SemError(230) END;
|
|
|
- 3199 lo := SymTab.SetBaseLo(vt);
|
|
|
- 3200 span := SymTab.SetCount(vt);
|
|
|
- 3201 IF (et = SymTab.InvalidType)
|
|
|
- 3202 OR (hasR AND (et2 =
|
|
|
- 3203 SymTab.InvalidType)) THEN
|
|
|
- 3204 ELSE cl :=
|
|
|
- 3205 SymTab.ClassOf(et);
|
|
|
- 3206 IF hasR THEN
|
|
|
- 3207 cl2 :=
|
|
|
- 3208 SymTab.ClassOf(et2)
|
|
|
- 3209 ELSE cl2 := SymTab.ClInt
|
|
|
- 3210 END;
|
|
|
- 3211 IF NOT SymTab.SetElemClassOk(cl)
|
|
|
- 3212 OR (hasR AND NOT
|
|
|
- 3213 SymTab.SetElemClassOk(cl2))
|
|
|
- 3214 THEN
|
|
|
- 3215 SemError(222)
|
|
|
- 3216 ELSIF hasR
|
|
|
+ 3159 SymTab.ClRecord)
|
|
|
+ 3160 OR (braceCls =
|
|
|
+ 3161 SymTab.ClClass) THEN
|
|
|
+ 3162 IF hasR THEN SemError(230) END;
|
|
|
+ 3163 reps := 1;
|
|
|
+ 3164 IF hasB THEN
|
|
|
+ 3165 IF SymTab.ConstInt(q2, v2)
|
|
|
+ 3166 AND (v2 >= 1) THEN
|
|
|
+ 3167 reps := v2
|
|
|
+ 3168 ELSE SemError(230)
|
|
|
+ 3169 END
|
|
|
+ 3170 END;
|
|
|
+ 3171 k := 0;
|
|
|
+ 3172 WHILE k < reps DO
|
|
|
+ 3173 QbeGen.CtorElem(qe);
|
|
|
+ 3174 INC(k)
|
|
|
+ 3175 END
|
|
|
+ 3176 END; .)
|
|
|
+ 3177 (. (* the BY form repeats the
|
|
|
+ 3178 element; keep the AST in
|
|
|
+ 3179 step with CtorElem *)
|
|
|
+ 3180 k := 0;
|
|
|
+ 3181 WHILE k < reps DO
|
|
|
+ 3182 AstAppend(AST.NkBlock,
|
|
|
+ 3183 node, tail, astEl);
|
|
|
+ 3184 INC(k)
|
|
|
+ 3185 END; .) .
|
|
|
+ 3186 SetElem<st: SymTab.TypeIndex; sq: QbeGen.QVal; node: AST.Node> (. VAR et, et2: SymTab.TypeIndex;
|
|
|
+ 3187 qe, q2: QbeGen.QVal;
|
|
|
+ 3188 v, v2: INTEGER;
|
|
|
+ 3189 lo: INTEGER;
|
|
|
+ 3190 span: CARDINAL;
|
|
|
+ 3191 cl, cl2: INTEGER;
|
|
|
+ 3192 hasR: BOOLEAN;
|
|
|
+ 3193 astEl: AST.Node; .)
|
|
|
+ 3194 = (. hasR := FALSE; .)
|
|
|
+ 3195 Expr<et, qe> (. astEl := astCur; .)
|
|
|
+ 3196 [ ".." Expr<et2, q2> (. astEl := AST.MakeBin(
|
|
|
+ 3197 AST.NkSubrange, 0, astEl, astCur);
|
|
|
+ 3198 hasR := TRUE; .) ]
|
|
|
+ 3199 (. lo := SymTab.SetBaseLo(st);
|
|
|
+ 3200 span := SymTab.SetCount(st);
|
|
|
+ 3201 IF (et = SymTab.InvalidType)
|
|
|
+ 3202 OR (hasR AND (et2 =
|
|
|
+ 3203 SymTab.InvalidType)) THEN
|
|
|
+ 3204 ELSE cl :=
|
|
|
+ 3205 SymTab.ClassOf(et);
|
|
|
+ 3206 IF hasR THEN
|
|
|
+ 3207 cl2 :=
|
|
|
+ 3208 SymTab.ClassOf(et2)
|
|
|
+ 3209 ELSE cl2 := SymTab.ClInt
|
|
|
+ 3210 END;
|
|
|
+ 3211 IF NOT SymTab.SetElemClassOk(cl)
|
|
|
+ 3212 OR (hasR AND NOT
|
|
|
+ 3213 SymTab.SetElemClassOk(cl2))
|
|
|
+ 3214 THEN
|
|
|
+ 3215 SemError(222)
|
|
|
+ 3216 ELSIF hasR
|
|
|
3217 AND SymTab.ConstInt(qe, v)
|
|
|
3218 AND SymTab.ConstInt(q2,
|
|
|
- 3219 v2)
|
|
|
+ 3219 v2)
|
|
|
3220 AND ((v < lo)
|
|
|
- 3221 OR (v2 < lo)
|
|
|
- 3222 OR (v >= lo +
|
|
|
- 3223 VAL(INTEGER, span))
|
|
|
- 3224 OR (v2 >= lo +
|
|
|
- 3225 VAL(INTEGER, span))
|
|
|
- 3226 OR (v > v2)) THEN
|
|
|
- 3227 SemError(222)
|
|
|
- 3228 ELSIF hasR THEN
|
|
|
- 3229 QbeGen.SetRange(sq, qe, q2,
|
|
|
- 3230 lo, span)
|
|
|
- 3231 ELSIF SymTab.ConstInt(qe,
|
|
|
- 3232 v)
|
|
|
+ 3221 OR (v2 < lo)
|
|
|
+ 3222 OR (v >= lo +
|
|
|
+ 3223 VAL(INTEGER, span))
|
|
|
+ 3224 OR (v2 >= lo +
|
|
|
+ 3225 VAL(INTEGER, span))
|
|
|
+ 3226 OR (v > v2)) THEN
|
|
|
+ 3227 SemError(222)
|
|
|
+ 3228 ELSIF hasR THEN
|
|
|
+ 3229 QbeGen.SetRange(sq, qe, q2,
|
|
|
+ 3230 lo, span)
|
|
|
+ 3231 ELSIF SymTab.ConstInt(qe,
|
|
|
+ 3232 v)
|
|
|
3233 AND ((v < lo)
|
|
|
- 3234 OR (v >= lo +
|
|
|
- 3235 VAL(INTEGER,
|
|
|
- 3236 span))) THEN
|
|
|
- 3237 SemError(222)
|
|
|
- 3238 ELSE QbeGen.SetBit(sq, qe,
|
|
|
- 3239 lo, span)
|
|
|
- 3240 END
|
|
|
- 3241 END
|
|
|
- 3242 ELSIF (braceCls = SymTab.ClArray)
|
|
|
- 3243 OR (braceCls =
|
|
|
- 3244 SymTab.ClRecord)
|
|
|
- 3245 OR (braceCls =
|
|
|
- 3246 SymTab.ClClass) THEN
|
|
|
- 3247 IF hasR THEN SemError(230) END;
|
|
|
- 3248 reps := 1;
|
|
|
- 3249 IF hasB THEN
|
|
|
- 3250 IF SymTab.ConstInt(q2, v2)
|
|
|
- 3251 AND (v2 >= 1) THEN
|
|
|
- 3252 reps := v2
|
|
|
- 3253 ELSE SemError(230)
|
|
|
- 3254 END
|
|
|
- 3255 END;
|
|
|
- 3256 k := 0;
|
|
|
- 3257 WHILE k < reps DO
|
|
|
- 3258 QbeGen.CtorElem(qe);
|
|
|
- 3259 INC(k)
|
|
|
- 3260 END
|
|
|
- 3261 END; .)
|
|
|
- 3262 (. (* the BY form repeats the
|
|
|
- 3263 element; keep the AST in
|
|
|
- 3264 step with CtorElem *)
|
|
|
- 3265 k := 0;
|
|
|
- 3266 WHILE k < reps DO
|
|
|
- 3267 AstAppend(AST.NkBlock,
|
|
|
- 3268 node, tail, astEl);
|
|
|
- 3269 INC(k)
|
|
|
- 3270 END; .) .
|
|
|
- 3271 SetElem<st: SymTab.TypeIndex; sq: QbeGen.QVal; node: AST.Node> (. VAR et, et2: SymTab.TypeIndex;
|
|
|
- 3272 qe, q2: QbeGen.QVal;
|
|
|
- 3273 v, v2: INTEGER;
|
|
|
- 3274 lo: INTEGER;
|
|
|
- 3275 span: CARDINAL;
|
|
|
- 3276 cl, cl2: INTEGER;
|
|
|
- 3277 hasR: BOOLEAN;
|
|
|
- 3278 astEl: AST.Node; .)
|
|
|
- 3279 = (. hasR := FALSE; .)
|
|
|
- 3280 Expr<et, qe> (. astEl := astCur; .)
|
|
|
- 3281 [ ".." Expr<et2, q2> (. astEl := AST.MakeBin(
|
|
|
- 3282 AST.NkSubrange, 0, astEl, astCur);
|
|
|
- 3283 hasR := TRUE; .) ]
|
|
|
- 3284 (. lo := SymTab.SetBaseLo(st);
|
|
|
- 3285 span := SymTab.SetCount(st);
|
|
|
- 3286 IF (et = SymTab.InvalidType)
|
|
|
- 3287 OR (hasR AND (et2 =
|
|
|
- 3288 SymTab.InvalidType)) THEN
|
|
|
- 3289 ELSE cl :=
|
|
|
- 3290 SymTab.ClassOf(et);
|
|
|
- 3291 IF hasR THEN
|
|
|
- 3292 cl2 :=
|
|
|
- 3293 SymTab.ClassOf(et2)
|
|
|
- 3294 ELSE cl2 := SymTab.ClInt
|
|
|
- 3295 END;
|
|
|
- 3296 IF NOT SymTab.SetElemClassOk(cl)
|
|
|
- 3297 OR (hasR AND NOT
|
|
|
- 3298 SymTab.SetElemClassOk(cl2))
|
|
|
- 3299 THEN
|
|
|
- 3300 SemError(222)
|
|
|
- 3301 ELSIF hasR
|
|
|
- 3302 AND SymTab.ConstInt(qe, v)
|
|
|
- 3303 AND SymTab.ConstInt(q2,
|
|
|
- 3304 v2)
|
|
|
- 3305 AND ((v < lo)
|
|
|
- 3306 OR (v2 < lo)
|
|
|
- 3307 OR (v >= lo +
|
|
|
- 3308 VAL(INTEGER, span))
|
|
|
- 3309 OR (v2 >= lo +
|
|
|
- 3310 VAL(INTEGER, span))
|
|
|
- 3311 OR (v > v2)) THEN
|
|
|
- 3312 SemError(222)
|
|
|
- 3313 ELSIF hasR THEN
|
|
|
- 3314 QbeGen.SetRange(sq, qe, q2,
|
|
|
- 3315 lo, span)
|
|
|
- 3316 ELSIF SymTab.ConstInt(qe,
|
|
|
- 3317 v)
|
|
|
- 3318 AND ((v < lo)
|
|
|
- 3319 OR (v >= lo +
|
|
|
- 3320 VAL(INTEGER,
|
|
|
- 3321 span))) THEN
|
|
|
- 3322 SemError(222)
|
|
|
- 3323 ELSE QbeGen.SetBit(sq, qe,
|
|
|
- 3324 lo, span)
|
|
|
- 3325 END
|
|
|
- 3326 END; .)
|
|
|
- 3327 (. AST.SetChild(node,
|
|
|
- 3328 AST.NChild(node), astEl); .) .
|
|
|
- 3329 GetIdent<VAR n: SymTab.Name>
|
|
|
- 3330 = ident (. LexName(n); .) .
|
|
|
- 3331
|
|
|
- 3332 END M2.
|
|
|
+ 3234 OR (v >= lo +
|
|
|
+ 3235 VAL(INTEGER,
|
|
|
+ 3236 span))) THEN
|
|
|
+ 3237 SemError(222)
|
|
|
+ 3238 ELSE QbeGen.SetBit(sq, qe,
|
|
|
+ 3239 lo, span)
|
|
|
+ 3240 END
|
|
|
+ 3241 END; .)
|
|
|
+ 3242 (. AST.SetChild(node,
|
|
|
+ 3243 AST.NChild(node), astEl); .) .
|
|
|
+ 3244 GetIdent<VAR n: SymTab.Name>
|
|
|
+ 3245 = ident (. LexName(n); .) .
|
|
|
+ 3246
|
|
|
+ 3247 END M2.
|
|
|
|
|
|
0 errors
|
|
|
|
