|
|
@@ -2051,164 +2051,164 @@ Listing:
|
|
|
2033 SymTab.InvalidType)
|
|
|
2034 AND SymTab.MethodExists(ic, n) THEN
|
|
|
2035 sfx := FALSE;
|
|
|
- 2036 QbeGen.ThisBase(q);
|
|
|
- 2037 QbeGen.ArmRecv(q);
|
|
|
- 2038 methCls := ic;
|
|
|
- 2039 k := SymTab.KindProc;
|
|
|
- 2040 t := SymTab.InvalidType
|
|
|
- 2041 ELSIF SymTab.InProc() THEN
|
|
|
- 2042 (* not declared yet: a
|
|
|
- 2043 forward reference to a
|
|
|
- 2044 module-level variable
|
|
|
- 2045 declared further down. *)
|
|
|
- 2046 k := SymTab.KindVar;
|
|
|
- 2047 r := SymTab.FwdVarRef(n, k,
|
|
|
- 2048 fref, t);
|
|
|
- 2049 slot := QbeGen.FwdDesignator();
|
|
|
- 2050 FwdVarNote(fref, slot);
|
|
|
- 2051 fid := slot;
|
|
|
- 2052 QbeGen.FwdAddrOper(fid, q);
|
|
|
- 2053 sfx := TRUE; fwd := TRUE
|
|
|
- 2054 ELSE
|
|
|
- 2055 SemError(201);
|
|
|
- 2056 t :=
|
|
|
- 2057 SymTab.InvalidType;
|
|
|
- 2058 k := -1;
|
|
|
- 2059 QbeGen.CopyOp("0", q)
|
|
|
- 2060 END
|
|
|
- 2061 ELSE
|
|
|
- 2062 t := SymTab.SymType(n);
|
|
|
- 2063 k := SymTab.SymKind(n);
|
|
|
- 2064 IF k = SymTab.KindConst THEN
|
|
|
- 2065 IF SymTab.Equal(n,
|
|
|
- 2066 "TRUE") THEN
|
|
|
- 2067 t := SymTab.BoolType();
|
|
|
- 2068 QbeGen.CopyOp("1", q)
|
|
|
- 2069 ELSIF SymTab.Equal(n,
|
|
|
- 2070 "FALSE") THEN
|
|
|
- 2071 t := SymTab.BoolType();
|
|
|
- 2072 QbeGen.CopyOp("0", q)
|
|
|
- 2073 ELSIF SymTab.Equal(n,
|
|
|
- 2074 "NIL") THEN
|
|
|
- 2075 QbeGen.CopyOp("0", q)
|
|
|
- 2076 ELSE
|
|
|
- 2077 cls :=
|
|
|
- 2078 SymTab.ClassOf(t);
|
|
|
- 2079 IF (t #
|
|
|
- 2080 SymTab.InvalidType)
|
|
|
- 2081 AND ((cls = SymTab.ClInt)
|
|
|
- 2082 OR (cls
|
|
|
- 2083 = SymTab.ClChar)
|
|
|
- 2084 OR (cls
|
|
|
- 2085 = SymTab.ClEnum)
|
|
|
- 2086 OR (cls
|
|
|
- 2087 = SymTab.ClReal)
|
|
|
- 2088 OR (cls
|
|
|
- 2089 = SymTab.ClLong)
|
|
|
- 2090 OR (cls
|
|
|
- 2091 = SymTab.ClNil)) THEN
|
|
|
- 2092 IF cls = SymTab.ClNil THEN
|
|
|
- 2093 QbeGen.CopyOp("0", q)
|
|
|
- 2094 ELSIF ((cls
|
|
|
- 2095 = SymTab.ClInt)
|
|
|
- 2096 OR (cls
|
|
|
- 2097 = SymTab.ClChar)
|
|
|
- 2098 OR (cls
|
|
|
- 2099 = SymTab.ClEnum)
|
|
|
- 2100 OR (cls
|
|
|
- 2101 = SymTab.ClLong))
|
|
|
- 2102 AND SymTab.GetSymVal(n, cv)
|
|
|
- 2103 AND QbeGen.IsImm(cv) THEN
|
|
|
- 2104 QbeGen.CopyOp(cv, q)
|
|
|
- 2105 ELSE
|
|
|
- 2106 QbeGen.LoadVar(n,
|
|
|
- 2107 cls = SymTab.ClReal,
|
|
|
- 2108 q)
|
|
|
- 2109 END
|
|
|
- 2110 ELSIF (cls = SymTab.ClArray)
|
|
|
- 2111 OR (cls = SymTab.ClRecord)
|
|
|
- 2112 OR (cls = SymTab.ClClass)
|
|
|
- 2113 OR (cls = SymTab.ClStr)
|
|
|
- 2114 OR (cls = SymTab.ClUStr) THEN
|
|
|
- 2115 (* aggregate constant:
|
|
|
- 2116 its value IS the
|
|
|
- 2117 descriptor address *)
|
|
|
- 2118 IF SymTab.GetSymVal(n, cv) THEN
|
|
|
- 2119 QbeGen.CopyOp(cv, q)
|
|
|
- 2120 ELSE
|
|
|
- 2121 QbeGen.CopyOp("0", q)
|
|
|
- 2122 END
|
|
|
- 2123 ELSE
|
|
|
- 2124 IF t #
|
|
|
- 2125 SymTab.InvalidType THEN
|
|
|
- 2126 SemError(230)
|
|
|
- 2127 END;
|
|
|
- 2128 QbeGen.CopyOp("0", q)
|
|
|
- 2129 END
|
|
|
- 2130 END
|
|
|
- 2131 ELSIF (k = SymTab.KindVar)
|
|
|
- 2132 OR (k = SymTab.KindParam) THEN
|
|
|
- 2133 cls :=
|
|
|
- 2134 SymTab.ClassOf(t);
|
|
|
- 2135 IF (cls = SymTab.ClInt)
|
|
|
- 2136 OR (cls = SymTab.ClBool)
|
|
|
- 2137 OR (cls = SymTab.ClChar)
|
|
|
- 2138 OR (cls = SymTab.ClUChar)
|
|
|
- 2139 OR (cls = SymTab.ClEnum)
|
|
|
- 2140 OR (cls
|
|
|
- 2141 = SymTab.ClReal) THEN
|
|
|
- 2142 QbeGen.LoadVar(n,
|
|
|
- 2143 cls = SymTab.ClReal, q)
|
|
|
- 2144 ELSIF (cls = SymTab.ClPtr)
|
|
|
- 2145 OR (cls = SymTab.ClProc) THEN
|
|
|
- 2146 QbeGen.LoadPtr(n, q)
|
|
|
- 2147 ELSIF cls = SymTab.ClLong THEN
|
|
|
- 2148 QbeGen.LoadLong(n, q)
|
|
|
- 2149 ELSIF (cls
|
|
|
- 2150 = SymTab.ClArray)
|
|
|
- 2151 OR (cls
|
|
|
- 2152 = SymTab.ClSet)
|
|
|
- 2153 OR (cls
|
|
|
- 2154 = SymTab.ClRecord)
|
|
|
- 2155 OR (cls
|
|
|
- 2156 = SymTab.ClUStr)
|
|
|
- 2157 OR (cls
|
|
|
- 2158 = SymTab.ClClass) THEN
|
|
|
- 2159 QbeGen.AddrOf(n, q)
|
|
|
- 2160 ELSE SemError(230);
|
|
|
- 2161 QbeGen.CopyOp("0", q)
|
|
|
- 2162 END
|
|
|
- 2163 ELSE QbeGen.CopyOp("0", q);
|
|
|
- 2164 IF k = SymTab.KindImport THEN
|
|
|
- 2165 SemError(230)
|
|
|
- 2166 ELSIF k =
|
|
|
- 2167 SymTab.KindProc THEN
|
|
|
- 2168 (* bare procedure name:
|
|
|
- 2169 a following ArgList
|
|
|
- 2170 makes it a call;
|
|
|
- 2171 otherwise Fact
|
|
|
- 2172 reports 230 *)
|
|
|
- 2173 ELSE
|
|
|
- 2174 IF k = SymTab.KindField THEN
|
|
|
- 2175 IF QbeGen.TopWith(qb) THEN
|
|
|
- 2176 fo :=
|
|
|
- 2177 SymTab.FieldOffset(
|
|
|
- 2178 SymTab.FieldOwner(n),
|
|
|
- 2179 n);
|
|
|
- 2180 QbeGen.FieldAddr(qb,
|
|
|
- 2181 fo, q);
|
|
|
- 2182 sfx := TRUE
|
|
|
- 2183 ELSE SemError(230);
|
|
|
- 2184 QbeGen.CopyOp("0", q)
|
|
|
- 2185 END
|
|
|
- 2186 END
|
|
|
- 2187 END
|
|
|
- 2188 END
|
|
|
- 2189 END; .)
|
|
|
- 2190 (. astDes := AST.MakeNode(AST.NkDesignator);
|
|
|
- 2191 AST.SetChild(astDes, AST.NChild(astDes), AST.MakeLeaf(AST.NkIdent, n));
|
|
|
- 2192 IF fwd THEN AST.SetOp(astDes, 1) END; .)
|
|
|
- 2193 { "[" Expr<it, iq>
|
|
|
+ 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) #
|
|
|
@@ -2222,1268 +2222,1132 @@ Listing:
|
|
|
2204 SymTab.ClEnum) THEN
|
|
|
2205 SemError(218);
|
|
|
2206 t := SymTab.InvalidType
|
|
|
- 2207 ELSE
|
|
|
- 2208 QbeGen.WidenIndex(iq, ql);
|
|
|
- 2209 isOpen :=
|
|
|
- 2210 SymTab.IsOpenArray(t);
|
|
|
- 2211 IF isOpen THEN
|
|
|
- 2212 QbeGen.CopyOp("0", qlo);
|
|
|
- 2213 IF SymTab.IsCharArray(t)
|
|
|
- 2214 OR SymTab.IsUCharArray(t) THEN
|
|
|
- 2215 QbeGen.OpenHiChar(q, qhi)
|
|
|
- 2216 ELSE QbeGen.OpenHi(q, qhi)
|
|
|
- 2217 END
|
|
|
- 2218 ELSE
|
|
|
- 2219 lo := SymTab.ArrayLo(t);
|
|
|
- 2220 hi := SymTab.ArrayHi(t);
|
|
|
- 2221 IF SymTab.IsCharArray(t)
|
|
|
- 2222 OR SymTab.IsUCharArray(t) THEN
|
|
|
- 2223 hi := hi + 1
|
|
|
- 2224 END;
|
|
|
- 2225 QbeGen.IntStr(lo, qlo);
|
|
|
- 2226 QbeGen.IntStr(hi, qhi)
|
|
|
- 2227 END;
|
|
|
- 2228 QbeGen.CheckRange(ql, qlo,
|
|
|
- 2229 qhi);
|
|
|
- 2230 eT := SymTab.ArrayElem(t);
|
|
|
- 2231 QbeGen.ElemAddr(q, ql, qlo,
|
|
|
- 2232 t, qe);
|
|
|
- 2233 IF SymTab.ClassOf(eT) =
|
|
|
- 2234 SymTab.ClArray THEN
|
|
|
- 2235 QbeGen.ElemLoad(qe, eT, q)
|
|
|
- 2236 ELSE QbeGen.CopyOp(qe, q)
|
|
|
- 2237 END;
|
|
|
- 2238 t := eT; sfx := TRUE
|
|
|
- 2239 END; .)
|
|
|
- 2240 { "," Expr<it, iq>
|
|
|
- 2241 (. AST.SetChild(astDes, AST.NChild(astDes),
|
|
|
- 2242 AST.MakeUn(AST.NkSelector, AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
- 2243 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2244 SymTab.ClArray THEN
|
|
|
- 2245 SemError(217);
|
|
|
- 2246 t := SymTab.InvalidType
|
|
|
- 2247 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
- 2248 AND (SymTab.ClassOf(it) #
|
|
|
- 2249 SymTab.ClChar)
|
|
|
- 2250 AND (SymTab.ClassOf(it) #
|
|
|
- 2251 SymTab.ClEnum) THEN
|
|
|
- 2252 SemError(218);
|
|
|
- 2253 t := SymTab.InvalidType
|
|
|
- 2254 ELSE
|
|
|
- 2255 QbeGen.WidenIndex(iq, ql);
|
|
|
- 2256 isOpen :=
|
|
|
- 2257 SymTab.IsOpenArray(t);
|
|
|
- 2258 IF isOpen THEN
|
|
|
- 2259 QbeGen.CopyOp("0", qlo);
|
|
|
- 2260 IF SymTab.IsCharArray(t)
|
|
|
- 2261 OR SymTab.IsUCharArray(t) THEN
|
|
|
- 2262 QbeGen.OpenHiChar(q, qhi)
|
|
|
- 2263 ELSE QbeGen.OpenHi(q, qhi)
|
|
|
- 2264 END
|
|
|
- 2265 ELSE
|
|
|
- 2266 lo := SymTab.ArrayLo(t);
|
|
|
- 2267 hi := SymTab.ArrayHi(t);
|
|
|
- 2268 IF SymTab.IsCharArray(t)
|
|
|
- 2269 OR SymTab.IsUCharArray(t) THEN
|
|
|
- 2270 hi := hi + 1
|
|
|
- 2271 END;
|
|
|
- 2272 QbeGen.IntStr(lo, qlo);
|
|
|
- 2273 QbeGen.IntStr(hi, qhi)
|
|
|
- 2274 END;
|
|
|
- 2275 QbeGen.CheckRange(ql, qlo,
|
|
|
- 2276 qhi);
|
|
|
- 2277 eT := SymTab.ArrayElem(t);
|
|
|
- 2278 QbeGen.ElemAddr(q, ql, qlo,
|
|
|
- 2279 t, qe);
|
|
|
- 2280 IF SymTab.ClassOf(eT) =
|
|
|
- 2281 SymTab.ClArray THEN
|
|
|
- 2282 QbeGen.ElemLoad(qe, eT, q)
|
|
|
- 2283 ELSE QbeGen.CopyOp(qe, q)
|
|
|
- 2284 END;
|
|
|
- 2285 t := eT; sfx := TRUE
|
|
|
- 2286 END; .) }
|
|
|
- 2287 "]"
|
|
|
- 2288 | "." GetIdent<fn>
|
|
|
- 2289 (. astSel := AST.MakeNode(AST.NkSelector);
|
|
|
- 2290 AST.SetOp(astSel, AST.SelField);
|
|
|
- 2291 AST.SetChild(astSel, 0, AST.MakeLeaf(AST.NkIdent, fn));
|
|
|
- 2292 AST.SetChild(astDes, AST.NChild(astDes), astSel); IF k = SymTab.KindModule THEN
|
|
|
- 2293 (* qualified L.x: materialize
|
|
|
- 2294 the export, then load it *)
|
|
|
- 2295 IF NOT SymTab.MaterializeAlias(n,
|
|
|
- 2296 fn, mal) THEN
|
|
|
- 2297 SemError(201);
|
|
|
- 2298 t := SymTab.InvalidType;
|
|
|
- 2299 QbeGen.CopyOp("0", q)
|
|
|
- 2300 ELSE
|
|
|
- 2301 QbeGen.CopyOp(mal, qn);
|
|
|
- 2302 t := SymTab.SymType(mal);
|
|
|
- 2303 k := SymTab.SymKind(mal);
|
|
|
- 2304 sfx := FALSE;
|
|
|
- 2305 IF k = SymTab.KindProc THEN
|
|
|
- 2306 (* call: ArgList supplies
|
|
|
- 2307 the value *)
|
|
|
- 2308 QbeGen.CopyOp("0", q)
|
|
|
- 2309 ELSIF NOT QbeGen.LoadDesignator(
|
|
|
- 2310 mal, t, k, q) THEN
|
|
|
- 2311 SemError(230);
|
|
|
- 2312 QbeGen.CopyOp("0", q)
|
|
|
- 2313 END
|
|
|
- 2314 END
|
|
|
- 2315 ELSIF t = SymTab.InvalidType THEN
|
|
|
- 2316 ELSIF (SymTab.ClassOf(t) #
|
|
|
- 2317 SymTab.ClRecord)
|
|
|
- 2318 AND (SymTab.ClassOf(t) #
|
|
|
- 2319 SymTab.ClClass) THEN
|
|
|
- 2320 SemError(215);
|
|
|
- 2321 t := SymTab.InvalidType
|
|
|
- 2322 ELSIF (SymTab.ClassOf(t) =
|
|
|
- 2323 SymTab.ClClass)
|
|
|
- 2324 AND SymTab.MethodExists(t, fn) THEN
|
|
|
- 2325 (* obj.Method: bind the
|
|
|
- 2326 method and pass obj as
|
|
|
- 2327 the hidden receiver; q
|
|
|
- 2328 already holds the
|
|
|
- 2329 object's address *)
|
|
|
- 2330 QbeGen.ArmRecv(q);
|
|
|
- 2331 QbeGen.CopyOp(fn, n);
|
|
|
- 2332 QbeGen.CopyOp(fn, qn);
|
|
|
- 2333 methCls := t;
|
|
|
- 2334 k := SymTab.KindProc;
|
|
|
+ 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 ELSIF NOT SymTab.FieldExists(t,
|
|
|
- 2337 fn) THEN
|
|
|
- 2338 SemError(216);
|
|
|
- 2339 t := SymTab.InvalidType
|
|
|
- 2340 ELSE
|
|
|
- 2341 fo := SymTab.FieldOffset(t,
|
|
|
- 2342 fn);
|
|
|
- 2343 t := SymTab.FieldType(t, fn);
|
|
|
- 2344 QbeGen.FieldAddr(q, fo, qe);
|
|
|
- 2345 (* array fields are inline:
|
|
|
- 2346 the field address is the
|
|
|
- 2347 descriptor, like records *)
|
|
|
- 2348 QbeGen.CopyOp(qe, q);
|
|
|
- 2349 sfx := TRUE
|
|
|
- 2350 END; .)
|
|
|
- 2351 | "^"
|
|
|
- 2352 (. astSel := AST.MakeNode(AST.NkSelector);
|
|
|
- 2353 AST.SetOp(astSel, AST.SelDeref);
|
|
|
- 2354 AST.SetChild(astDes, AST.NChild(astDes), astSel); IF t = SymTab.InvalidType THEN
|
|
|
- 2355 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2356 SymTab.ClPtr THEN
|
|
|
- 2357 SemError(219);
|
|
|
- 2358 t := SymTab.InvalidType
|
|
|
- 2359 ELSE
|
|
|
- 2360 bt := SymTab.PtrBase(t);
|
|
|
- 2361 IF bt = SymTab.InvalidType THEN
|
|
|
- 2362 ELSE
|
|
|
- 2363 IF sfx THEN
|
|
|
- 2364 QbeGen.ElemLoad(q, t,
|
|
|
- 2365 qb);
|
|
|
- 2366 QbeGen.CopyOp(qb, q)
|
|
|
- 2367 END;
|
|
|
- 2368 t := bt;
|
|
|
- 2369 (* q holds the pointee
|
|
|
- 2370 address: Fact loads
|
|
|
- 2371 scalars/pointers and uses
|
|
|
- 2372 the address for
|
|
|
- 2373 aggregates; the VAR-actual
|
|
|
- 2374 note is q itself. *)
|
|
|
- 2375 sfx := TRUE
|
|
|
- 2376 END
|
|
|
- 2377 END; .) } (. astCur := astDes; .) .
|
|
|
- 2378 (* Result suffix (ISO component after a function call): `F()^`,
|
|
|
- 2379 `F()[i]`, `F().field`. The call result is in t/q with sfx FALSE
|
|
|
- 2380 (a value, or a descriptor address for aggregates); each component
|
|
|
- 2381 descends one level exactly like the Design components. *)
|
|
|
- 2382 ResultComp<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal;
|
|
|
- 2383 VAR sfx: BOOLEAN; VAR node: AST.Node> (. VAR it, eT, bt: SymTab.TypeIndex;
|
|
|
- 2384 iq, ql, qlo, qhi, qe, qb:
|
|
|
- 2385 QbeGen.QVal;
|
|
|
- 2386 lo, hi, fo: INTEGER;
|
|
|
- 2387 isOpen: BOOLEAN;
|
|
|
- 2388 fname: SymTab.Name;
|
|
|
- 2389 astWrap, astSel: AST.Node; .)
|
|
|
- 2390 = "[" Expr<it, iq>
|
|
|
- 2391 (. IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
- 2392 astWrap := AST.MakeNode(
|
|
|
- 2393 AST.NkDesignator);
|
|
|
- 2394 AST.SetChild(astWrap, 0, node);
|
|
|
- 2395 node := astWrap
|
|
|
- 2396 END;
|
|
|
- 2397 AST.SetChild(node, AST.NChild(node),
|
|
|
- 2398 AST.MakeUn(AST.NkSelector,
|
|
|
- 2399 AST.SelIndex, astCur)); IF t = SymTab.InvalidType THEN
|
|
|
- 2400 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2401 SymTab.ClArray THEN
|
|
|
- 2402 SemError(217);
|
|
|
- 2403 t := SymTab.InvalidType
|
|
|
- 2404 ELSIF NOT SymTab.IsIntFamily(it)
|
|
|
- 2405 AND (SymTab.ClassOf(it) # SymTab.ClChar)
|
|
|
- 2406 AND (SymTab.ClassOf(it) # SymTab.ClEnum) THEN
|
|
|
- 2407 SemError(218);
|
|
|
- 2408 t := SymTab.InvalidType
|
|
|
- 2409 ELSE
|
|
|
- 2410 QbeGen.WidenIndex(iq, ql);
|
|
|
- 2411 isOpen :=
|
|
|
- 2412 SymTab.IsOpenArray(t);
|
|
|
- 2413 IF isOpen THEN
|
|
|
- 2414 QbeGen.CopyOp("0", qlo);
|
|
|
- 2415 IF SymTab.IsCharArray(t)
|
|
|
- 2416 OR SymTab.IsUCharArray(t) THEN
|
|
|
- 2417 QbeGen.OpenHiChar(q, qhi)
|
|
|
- 2418 ELSE QbeGen.OpenHi(q, qhi)
|
|
|
- 2419 END
|
|
|
- 2420 ELSE
|
|
|
- 2421 lo := SymTab.ArrayLo(t);
|
|
|
- 2422 hi := SymTab.ArrayHi(t);
|
|
|
- 2423 IF SymTab.IsCharArray(t)
|
|
|
- 2424 OR SymTab.IsUCharArray(t) THEN
|
|
|
- 2425 hi := hi + 1
|
|
|
- 2426 END;
|
|
|
- 2427 QbeGen.IntStr(lo, qlo);
|
|
|
- 2428 QbeGen.IntStr(hi, qhi)
|
|
|
- 2429 END;
|
|
|
- 2430 QbeGen.CheckRange(ql, qlo,
|
|
|
- 2431 qhi);
|
|
|
- 2432 eT := SymTab.ArrayElem(t);
|
|
|
- 2433 QbeGen.ElemAddr(q, ql, qlo,
|
|
|
- 2434 t, qe);
|
|
|
- 2435 IF SymTab.ClassOf(eT) =
|
|
|
- 2436 SymTab.ClArray THEN
|
|
|
- 2437 QbeGen.ElemLoad(qe, eT, q)
|
|
|
- 2438 ELSE QbeGen.CopyOp(qe, q)
|
|
|
- 2439 END;
|
|
|
- 2440 t := eT; sfx := TRUE
|
|
|
- 2441 END; .)
|
|
|
- 2442 "]"
|
|
|
- 2443 | "." GetIdent<fname>
|
|
|
- 2444 (. IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
- 2445 astWrap := AST.MakeNode(
|
|
|
- 2446 AST.NkDesignator);
|
|
|
- 2447 AST.SetChild(astWrap, 0, node);
|
|
|
- 2448 node := astWrap
|
|
|
- 2449 END;
|
|
|
- 2450 AST.SetChild(node, AST.NChild(node),
|
|
|
- 2451 AST.MakeUn(AST.NkSelector,
|
|
|
- 2452 AST.SelField,
|
|
|
- 2453 AST.MakeLeaf(AST.NkIdent,
|
|
|
- 2454 fname))); IF t = SymTab.InvalidType THEN
|
|
|
- 2455 ELSIF (SymTab.ClassOf(t) #
|
|
|
- 2456 SymTab.ClRecord)
|
|
|
- 2457 AND (SymTab.ClassOf(t) # SymTab.ClClass) THEN
|
|
|
- 2458 SemError(215);
|
|
|
- 2459 t := SymTab.InvalidType
|
|
|
- 2460 ELSIF NOT SymTab.FieldExists(t,
|
|
|
- 2461 fname) THEN
|
|
|
- 2462 SemError(216);
|
|
|
- 2463 t := SymTab.InvalidType
|
|
|
- 2464 ELSE
|
|
|
- 2465 fo := SymTab.FieldOffset(t,
|
|
|
- 2466 fname);
|
|
|
- 2467 t := SymTab.FieldType(t, fname);
|
|
|
- 2468 QbeGen.FieldAddr(q, fo, qe);
|
|
|
- 2469 QbeGen.CopyOp(qe, q);
|
|
|
- 2470 sfx := TRUE
|
|
|
- 2471 END; .)
|
|
|
- 2472 | "^" (. IF AST.Kind(node) # AST.NkDesignator THEN
|
|
|
- 2473 astWrap := AST.MakeNode(
|
|
|
- 2474 AST.NkDesignator);
|
|
|
- 2475 AST.SetChild(astWrap, 0, node);
|
|
|
- 2476 node := astWrap
|
|
|
- 2477 END;
|
|
|
- 2478 astSel := AST.MakeNode(AST.NkSelector);
|
|
|
- 2479 AST.SetOp(astSel, AST.SelDeref);
|
|
|
- 2480 AST.SetChild(node,
|
|
|
- 2481 AST.NChild(node), astSel); IF t = SymTab.InvalidType THEN
|
|
|
- 2482 ELSIF SymTab.ClassOf(t) #
|
|
|
- 2483 SymTab.ClPtr THEN
|
|
|
- 2484 SemError(219);
|
|
|
- 2485 t := SymTab.InvalidType
|
|
|
- 2486 ELSE
|
|
|
- 2487 bt := SymTab.PtrBase(t);
|
|
|
- 2488 IF bt # SymTab.InvalidType THEN
|
|
|
- 2489 IF sfx THEN
|
|
|
- 2490 QbeGen.ElemLoad(q, t, qb);
|
|
|
- 2491 QbeGen.CopyOp(qb, q)
|
|
|
- 2492 END;
|
|
|
- 2493 t := bt; sfx := TRUE
|
|
|
- 2494 END
|
|
|
- 2495 END; .) .
|
|
|
- 2496 Expr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2497 (. VAR t2: SymTab.TypeIndex;
|
|
|
- 2498 op: INTEGER;
|
|
|
- 2499 q2, qt, wl: QbeGen.QVal;
|
|
|
- 2500 astA, astB: AST.Node;
|
|
|
- 2501 astOp: INTEGER;
|
|
|
- 2502 astMade: BOOLEAN;
|
|
|
- 2503 isR: BOOLEAN; .)
|
|
|
- 2504 = SimExpr<t, q> (. astA := astCur; astMade := FALSE; .)
|
|
|
- 2505 [ Rel<op> SimExpr<t2, q2>
|
|
|
- 2506 (. astB := astCur; astMade := TRUE;
|
|
|
- 2507 astOp := AST.OpEq;
|
|
|
- 2508 IF op = SymTab.OpNeq1 THEN astOp := AST.OpNe
|
|
|
- 2509 ELSIF op = SymTab.OpNeq2 THEN astOp := AST.OpNe
|
|
|
- 2510 ELSIF op = SymTab.OpLt THEN astOp := AST.OpLt
|
|
|
- 2511 ELSIF op = SymTab.OpLe THEN astOp := AST.OpLe
|
|
|
- 2512 ELSIF op = SymTab.OpGt THEN astOp := AST.OpGt
|
|
|
- 2513 ELSIF op = SymTab.OpGe THEN astOp := AST.OpGe
|
|
|
- 2514 ELSIF op = SymTab.OpIn THEN astOp := AST.OpIn
|
|
|
- 2515 END;
|
|
|
- 2516 IF op = SymTab.OpIn THEN
|
|
|
- 2517 IF SymTab.InCheck(t, t2) THEN
|
|
|
- 2518 IF (t = SymTab.InvalidType)
|
|
|
- 2519 OR (t2 = SymTab.InvalidType) THEN
|
|
|
- 2520 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
- 2521 ELSE
|
|
|
- 2522 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2523 END
|
|
|
- 2524 ELSE SemError(222); t := SymTab.InvalidType;
|
|
|
- 2525 QbeGen.CopyOp("0", q)
|
|
|
- 2526 END
|
|
|
- 2527 ELSIF SymTab.RelCheck(t, t2, op) THEN
|
|
|
- 2528 IF (t = SymTab.InvalidType)
|
|
|
- 2529 OR (t2 = SymTab.InvalidType) THEN
|
|
|
- 2530 t := SymTab.BoolType(); QbeGen.CopyOp("0", q)
|
|
|
- 2531 ELSIF (SymTab.ClassOf(t) = SymTab.ClPtr)
|
|
|
- 2532 OR (SymTab.ClassOf(t2) = SymTab.ClPtr) THEN
|
|
|
- 2533 IF SymTab.IsFwdVar(t) OR SymTab.IsFwdVar(t2) THEN
|
|
|
- 2534 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2535 ELSIF (op # SymTab.OpEq) AND (op # SymTab.OpNeq1)
|
|
|
- 2536 AND (op # SymTab.OpNeq2) THEN
|
|
|
- 2537 SemError(213); t := SymTab.InvalidType;
|
|
|
- 2538 QbeGen.CopyOp("0", q)
|
|
|
- 2539 ELSE
|
|
|
- 2540 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2541 END
|
|
|
- 2542 ELSIF (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 2543 OR (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 2544 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2545 ELSIF SymTab.StrCompat(t, t2) THEN
|
|
|
- 2546 QbeGen.StrEq(op, q, q2, qt);
|
|
|
- 2547 t := SymTab.BoolType(); QbeGen.CopyOp(qt, q)
|
|
|
- 2548 ELSIF SymTab.IsLongFamily(t)
|
|
|
- 2549 OR SymTab.IsLongFamily(t2) THEN
|
|
|
- 2550 t := SymTab.BoolType(); QbeGen.CopyOp("@", q)
|
|
|
- 2551 ELSE
|
|
|
- 2552 t := SymTab.BoolType();
|
|
|
- 2553 QbeGen.CopyOp("@", q)
|
|
|
- 2554 END
|
|
|
- 2555 ELSE SemError(213); t := SymTab.InvalidType;
|
|
|
- 2556 QbeGen.CopyOp("0", q)
|
|
|
- 2557 END;
|
|
|
- 2558 astCur := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB); .) ]
|
|
|
- 2559 (. IF NOT astMade THEN astCur := astA END; .) .
|
|
|
- 2560 Rel<VAR op: INTEGER>
|
|
|
- 2561 = "=" (. op := SymTab.OpEq; .)
|
|
|
- 2562 | "#" (. op := SymTab.OpNeq1; .)
|
|
|
- 2563 | "<" (. op := SymTab.OpLt; .)
|
|
|
- 2564 | "<=" (. op := SymTab.OpLe; .)
|
|
|
- 2565 | ">" (. op := SymTab.OpGt; .)
|
|
|
- 2566 | ">=" (. op := SymTab.OpGe; .)
|
|
|
- 2567 | "IN" (. op := SymTab.OpIn; .) .
|
|
|
- 2568 SimExpr<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2569 (. VAR t2, res2, lt, rt:
|
|
|
- 2570 SymTab.TypeIndex;
|
|
|
- 2571 op: INTEGER;
|
|
|
- 2572 q2, qt, wq, qf, q2a, q2b:
|
|
|
- 2573 QbeGen.QVal;
|
|
|
- 2574 neg, isR, isL, folded:
|
|
|
- 2575 BOOLEAN;
|
|
|
- 2576 fok: BOOLEAN;
|
|
|
- 2577 lw, rw, mw: CARDINAL;
|
|
|
- 2578 lTrue, lNext, lDone, qr, qs: QbeGen.QVal;
|
|
|
- 2579 astA, astB: AST.Node;
|
|
|
- 2580 astSign, astOp: INTEGER; .)
|
|
|
- 2581 = (. neg := FALSE; astSign := 0; .)
|
|
|
- 2582 [ "+" (. neg := TRUE; astSign := 1; .)
|
|
|
- 2583 | "-" (. neg := TRUE; astSign := -1; .) ]
|
|
|
- 2584 Term<t, q> (. astA := astCur;
|
|
|
- 2585 IF neg AND QbeGen.IsImm(q) THEN
|
|
|
- 2586 QbeGen.NegFold(q, q)
|
|
|
- 2587 END;
|
|
|
- 2588 IF astSign < 0 THEN
|
|
|
- 2589 astCur := AST.MakeUn(
|
|
|
- 2590 AST.NkUnary, AST.OpSub, astA);
|
|
|
- 2591 astA := astCur
|
|
|
- 2592 END; .)
|
|
|
- 2593 { AddOp<op> (. IF op = SymTab.OpOr THEN
|
|
|
- 2594 QbeGen.DelayBegin END; .)
|
|
|
- 2595 Term<t2, q2> (. astB := astCur; IF op = SymTab.OpOr THEN
|
|
|
- 2596 QbeGen.DelayEnd END; .)
|
|
|
- 2597 (. astOp := AST.OpAdd;
|
|
|
- 2598 IF op = SymTab.OpSub THEN astOp := AST.OpSub
|
|
|
- 2599 ELSIF op = SymTab.OpOr THEN astOp := AST.OpOr END;
|
|
|
- 2600 astA := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB);
|
|
|
- 2601 astCur := astA;
|
|
|
- 2602 IF op = SymTab.OpOr THEN
|
|
|
- 2603 (* short-circuit: if q is true the RHS is skipped *)
|
|
|
- 2604 IF SymTab.BoolCheck(t) AND SymTab.BoolCheck(t2) THEN
|
|
|
- 2605 t := SymTab.BoolType()
|
|
|
- 2606 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
- 2607 IF t # SymTab.InvalidType THEN
|
|
|
- 2608 QbeGen.CopyOp("@", q)
|
|
|
- 2609 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2610 END
|
|
|
- 2611 ELSIF (op = SymTab.OpAdd)
|
|
|
- 2612 AND (SymTab.UStrCompat(t, t2)
|
|
|
- 2613 OR ((SymTab.ClassOf(t) = SymTab.ClUChar)
|
|
|
- 2614 AND (SymTab.ClassOf(t2) = SymTab.ClUStr))
|
|
|
- 2615 OR ((SymTab.ClassOf(t) = SymTab.ClUStr)
|
|
|
- 2616 AND (SymTab.ClassOf(t2) = SymTab.ClUChar))
|
|
|
- 2617 OR ((SymTab.ClassOf(t) = SymTab.ClUChar)
|
|
|
- 2618 AND (SymTab.ClassOf(t2) = SymTab.ClUChar))) THEN
|
|
|
- 2619 (* UString concatenation: a UCHAR operand becomes a
|
|
|
- 2620 1-codepoint UString; the result is a descriptor in the
|
|
|
- 2621 shim's concat buffer. Work on copies so neither
|
|
|
- 2622 operand is clobbered. *)
|
|
|
- 2623 t := SymTab.NewUStr();
|
|
|
- 2624 QbeGen.CopyOp("@", q)
|
|
|
- 2625 ELSIF (op = SymTab.OpAdd)
|
|
|
- 2626 AND (SymTab.StrCompat(t, t2)
|
|
|
- 2627 OR (SymTab.IsStrType(t)
|
|
|
- 2628 AND (SymTab.ClassOf(t2) = SymTab.ClChar))
|
|
|
- 2629 OR ((SymTab.ClassOf(t) = SymTab.ClChar)
|
|
|
- 2630 AND SymTab.IsStrType(t2))) THEN
|
|
|
- 2631 (* string concatenation; a CHAR operand becomes a
|
|
|
- 2632 1-character string literal. When both operands are
|
|
|
- 2633 constants, fold to a single string literal so a
|
|
|
- 2634 constructor element stays compile-time. *)
|
|
|
- 2635 QbeGen.StrFold(q, q2, SymTab.ClassOf(t), SymTab.ClassOf(t2),
|
|
|
- 2636 qt, fok);
|
|
|
- 2637 IF fok THEN QbeGen.CopyOp(qt, q)
|
|
|
- 2638 ELSE QbeGen.CopyOp("@", q)
|
|
|
- 2639 END;
|
|
|
- 2640 t := SymTab.NewStr()
|
|
|
- 2641 ELSIF (t # SymTab.InvalidType) AND (t2 # SymTab.InvalidType)
|
|
|
- 2642 AND (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 2643 AND (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 2644 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
- 2645 mw := lw;
|
|
|
- 2646 IF rw > mw THEN mw := rw END;
|
|
|
- 2647 t := SymTab.NewSet(
|
|
|
- 2648 SymTab.NewSubR(0,
|
|
|
- 2649 VAL(INTEGER, mw) * 32 - 1));
|
|
|
- 2650 QbeGen.CopyOp("@", q)
|
|
|
- 2651 ELSE
|
|
|
- 2652 IF SymTab.ArithCheck(t, t2, FALSE, res2) THEN
|
|
|
- 2653 lt := t; rt := t2; t := res2
|
|
|
- 2654 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
- 2655 IF t # SymTab.InvalidType THEN
|
|
|
- 2656 isL := SymTab.IsLongFamily(t);
|
|
|
- 2657 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
- 2658 folded := FALSE;
|
|
|
- 2659 IF (NOT isL) AND (NOT isR)
|
|
|
- 2660 AND QbeGen.IsImm(q) AND QbeGen.IsImm(q2) THEN
|
|
|
- 2661 IF op = SymTab.OpAdd THEN
|
|
|
- 2662 folded := QbeGen.Fold2(0, q, q2, qf)
|
|
|
- 2663 ELSE
|
|
|
- 2664 folded := QbeGen.Fold2(1, q, q2, qf)
|
|
|
- 2665 END
|
|
|
- 2666 END;
|
|
|
- 2667 IF folded THEN QbeGen.CopyOp(qf, q)
|
|
|
- 2668 ELSE
|
|
|
- 2669 QbeGen.CopyOp("@", q)
|
|
|
- 2670 END
|
|
|
- 2671 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2672 END
|
|
|
- 2673 END; .) } .
|
|
|
- 2674 AddOp<VAR op: INTEGER>
|
|
|
- 2675 = "+" (. op := SymTab.OpAdd; .)
|
|
|
- 2676 | "-" (. op := SymTab.OpSub; .)
|
|
|
- 2677 | "OR" (. op := SymTab.OpOr; .) .
|
|
|
- 2678 Term<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2679 (. VAR t2, res2, lt, rt:
|
|
|
- 2680 SymTab.TypeIndex;
|
|
|
- 2681 op: INTEGER;
|
|
|
- 2682 q2, qt, wq, qf:
|
|
|
- 2683 QbeGen.QVal;
|
|
|
- 2684 isR, isL, folded: BOOLEAN;
|
|
|
- 2685 lw, rw, mw: CARDINAL;
|
|
|
- 2686 lNext, lFalse, lDone, qr, qs: QbeGen.QVal;
|
|
|
- 2687 astA, astB: AST.Node;
|
|
|
- 2688 astOp: INTEGER; .)
|
|
|
- 2689 = Fact<t, q> (. astA := astCur; .) { MulOp<op>
|
|
|
- 2690 Fact<t2, q2> (. astB := astCur; .)
|
|
|
- 2691 (. astOp := AST.OpMul;
|
|
|
- 2692 IF op = SymTab.OpSlash THEN astOp := AST.OpDiv
|
|
|
- 2693 ELSIF op = SymTab.OpDiv THEN astOp := AST.OpDiv
|
|
|
- 2694 ELSIF op = SymTab.OpMod THEN astOp := AST.OpMod
|
|
|
- 2695 ELSIF op = SymTab.OpAnd THEN astOp := AST.OpAnd END;
|
|
|
- 2696 astA := AST.MakeBin(AST.NkBinExpr, astOp, astA, astB);
|
|
|
- 2697 astCur := astA;
|
|
|
- 2698 IF op = SymTab.OpAnd THEN
|
|
|
- 2699 (* short-circuit: if q is false the RHS is skipped *)
|
|
|
- 2700 IF SymTab.BoolCheck(t) AND SymTab.BoolCheck(t2) THEN
|
|
|
- 2701 t := SymTab.BoolType()
|
|
|
- 2702 ELSE SemError(212); t := SymTab.InvalidType END;
|
|
|
- 2703 IF t # SymTab.InvalidType THEN QbeGen.CopyOp("@", q)
|
|
|
- 2704 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2705 END
|
|
|
- 2706 ELSIF (t # SymTab.InvalidType) AND (t2 # SymTab.InvalidType)
|
|
|
- 2707 AND (SymTab.ClassOf(t) = SymTab.ClSet)
|
|
|
- 2708 AND (SymTab.ClassOf(t2) = SymTab.ClSet) THEN
|
|
|
- 2709 lw := SymTab.SetWords(t); rw := SymTab.SetWords(t2);
|
|
|
- 2710 mw := lw;
|
|
|
- 2711 IF rw > mw THEN mw := rw END;
|
|
|
- 2712 t := SymTab.NewSet(
|
|
|
- 2713 SymTab.NewSubR(0,
|
|
|
- 2714 VAL(INTEGER, mw) * 32 - 1));
|
|
|
- 2715 QbeGen.CopyOp("@", q)
|
|
|
- 2716 ELSE
|
|
|
- 2717 IF SymTab.ArithCheck(t, t2,
|
|
|
- 2718 (op = SymTab.OpDiv) OR (op = SymTab.OpMod),
|
|
|
- 2719 res2) THEN
|
|
|
- 2720 lt := t; rt := t2; t := res2
|
|
|
- 2721 ELSE SemError(211); t := SymTab.InvalidType END;
|
|
|
- 2722 IF t # SymTab.InvalidType THEN
|
|
|
- 2723 isL := SymTab.IsLongFamily(t);
|
|
|
- 2724 isR := SymTab.ClassOf(t) = SymTab.ClReal;
|
|
|
- 2725 folded := FALSE;
|
|
|
- 2726 IF (NOT isL) AND (NOT isR)
|
|
|
- 2727 AND QbeGen.IsImm(q) AND QbeGen.IsImm(q2) THEN
|
|
|
- 2728 IF op = SymTab.OpTimes THEN
|
|
|
- 2729 folded := QbeGen.Fold2(2, q, q2, qf)
|
|
|
- 2730 ELSIF op = SymTab.OpDiv THEN
|
|
|
- 2731 folded := QbeGen.Fold2(3, q, q2, qf)
|
|
|
- 2732 ELSIF op = SymTab.OpMod THEN
|
|
|
- 2733 folded := QbeGen.Fold2(4, q, q2, qf)
|
|
|
- 2734 END
|
|
|
- 2735 END;
|
|
|
- 2736 IF folded THEN QbeGen.CopyOp(qf, q)
|
|
|
- 2737 ELSE
|
|
|
- 2738 QbeGen.CopyOp("@", q)
|
|
|
- 2739 END
|
|
|
- 2740 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 2741 END
|
|
|
- 2742 END; .) } .
|
|
|
- 2743 MulOp<VAR op: INTEGER>
|
|
|
- 2744 = "*" (. op := SymTab.OpTimes; .)
|
|
|
- 2745 | "/" (. op := SymTab.OpSlash; .)
|
|
|
- 2746 | "DIV" (. op := SymTab.OpDiv; .)
|
|
|
- 2747 | "MOD" (. op := SymTab.OpMod; .)
|
|
|
- 2748 | ( "AND" | "&" ) (. op := SymTab.OpAnd; .) .
|
|
|
- 2749 Fact<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 2750 (. VAR s: ARRAY [0 .. 255] OF CHAR;
|
|
|
- 2751 et, dt, t2, st, ct2, et2:
|
|
|
- 2752 SymTab.TypeIndex;
|
|
|
- 2753 dk: INTEGER;
|
|
|
- 2754 qd, q2, sq, qa, qm0, qr, qt:
|
|
|
- 2755 QbeGen.QVal;
|
|
|
- 2756 qn, vn: SymTab.Name;
|
|
|
- 2757 vt: SymTab.TypeIndex;
|
|
|
- 2758 c1, c2: INTEGER;
|
|
|
- 2759 lo, hi: INTEGER;
|
|
|
- 2760 isMax: BOOLEAN;
|
|
|
- 2761 called, isHigh, sfx, isCh,
|
|
|
- 2762 isU, uok, isStr: BOOLEAN;
|
|
|
- 2763 ucp: INTEGER; astIsLit: BOOLEAN;
|
|
|
- 2764 astD: AST.Node;
|
|
|
- 2765 astCall: BOOLEAN;
|
|
|
- 2766 astNode, astNot: AST.Node;
|
|
|
- 2767 j: CARDINAL;
|
|
|
- 2768 astArg2: AST.Node;
|
|
|
- 2769 astBrace: AST.Node;
|
|
|
- 2770 astRes: AST.Node; .)
|
|
|
- 2771 = (. astIsLit := FALSE; .)
|
|
|
- 2772 ( integer (. LexString(s);
|
|
|
- 2773 QbeGen.NormInt(s, q); IF twoPhase THEN astIsLit := TRUE; astCur := AST.MakeLeaf(AST.NkIntLit, s) END;
|
|
|
- 2774 t := SymTab.IntType(); .)
|
|
|
- 2775 | charConst (. LexString(s);
|
|
|
- 2776 QbeGen.NormLit(s, q, isCh);
|
|
|
- 2777 IF twoPhase THEN
|
|
|
- 2778 astIsLit := TRUE;
|
|
|
- 2779 astCur := AST.MakeLeaf(
|
|
|
- 2780 AST.NkCharLit, s)
|
|
|
- 2781 END;
|
|
|
- 2782 t := SymTab.CharType(); .)
|
|
|
- 2783 | real (. LexString(s);
|
|
|
- 2784 QbeGen.NormReal(s, q);
|
|
|
- 2785 IF twoPhase THEN
|
|
|
- 2786 astIsLit := TRUE;
|
|
|
- 2787 astCur := AST.MakeLeaf(
|
|
|
- 2788 AST.NkRealLit, s)
|
|
|
- 2789 END;
|
|
|
- 2790 t := SymTab.RealType(); .)
|
|
|
- 2791 | string (. LexString(s);
|
|
|
- 2792 IF twoPhase THEN
|
|
|
- 2793 astIsLit := TRUE;
|
|
|
- 2794 astCur := AST.MakeLeaf(
|
|
|
- 2795 AST.NkStrLit, s)
|
|
|
- 2796 END;
|
|
|
- 2797 IF SymTab.StrLen(s) = 3 THEN
|
|
|
- 2798 t := SymTab.CharType();
|
|
|
- 2799 QbeGen.IntStr(
|
|
|
- 2800 QbeGen.CharVal(s), q)
|
|
|
- 2801 ELSE t := SymTab.NewStr();
|
|
|
- 2802 QbeGen.DeclStr(s, q);
|
|
|
- 2803 (* a literal's value IS its
|
|
|
- 2804 static descriptor address *)
|
|
|
- 2805 END; .)
|
|
|
- 2806 | ustring (. LexString(s);
|
|
|
- 2807 IF twoPhase THEN
|
|
|
- 2808 astIsLit := TRUE;
|
|
|
- 2809 astCur := AST.MakeLeaf(
|
|
|
- 2810 AST.NkStrLit, s)
|
|
|
- 2811 END;
|
|
|
- 2812 QbeGen.DeclUStr(s, q, isU, ucp,
|
|
|
- 2813 uok);
|
|
|
- 2814 IF NOT uok THEN
|
|
|
- 2815 SemError(234);
|
|
|
- 2816 t := SymTab.InvalidType
|
|
|
- 2817 ELSIF isU THEN
|
|
|
- 2818 t := SymTab.UCharType();
|
|
|
- 2819 QbeGen.IntStr(ucp, q)
|
|
|
- 2820 ELSE
|
|
|
- 2821 t := SymTab.NewUStr();
|
|
|
- 2822 END; .)
|
|
|
- 2823 | Design<dt, dk, qd, qn, sfx> (. astD := astCur; astCall := FALSE; astBrace := AST.NoNode;
|
|
|
- 2824 astNArgs := 0; called := FALSE;
|
|
|
- 2825 t := dt;
|
|
|
- 2826 IF dk = SymTab.KindConst THEN
|
|
|
- 2827 QbeGen.CopyOp(qd, q)
|
|
|
- 2828 ELSE QbeGen.CopyOp("@", q)
|
|
|
- 2829 END; .)
|
|
|
- 2830 [ TypedBraceLit<dt, q> (. t := dt; astCall := TRUE;
|
|
|
- 2831 astBrace := astCur; .) ]
|
|
|
- 2832 [ ArgList<qn, dt, qd, TRUE, FALSE, methCls, ct2, q2, called>
|
|
|
- 2833 (. astCall := TRUE;
|
|
|
- 2834 astNode := AstCallNode(astD);
|
|
|
- 2835 astRes := astNode;
|
|
|
- 2836 t := ct2;
|
|
|
- 2837 QbeGen.CopyOp(q2, q);
|
|
|
- 2838 sfx := FALSE; .)
|
|
|
- 2839 { ResultComp<t, q, sfx, astRes> }
|
|
|
- 2840 (. IF sfx THEN
|
|
|
- 2841 IF t = SymTab.InvalidType THEN
|
|
|
- 2842 QbeGen.CopyOp("0", q)
|
|
|
- 2843 ELSIF (SymTab.ClassOf(t) #
|
|
|
- 2844 SymTab.ClRecord)
|
|
|
- 2845 AND (SymTab.ClassOf(t) # SymTab.ClSet)
|
|
|
- 2846 AND (SymTab.ClassOf(t) # SymTab.ClArray)
|
|
|
- 2847 AND (SymTab.ClassOf(t) # SymTab.ClClass) THEN
|
|
|
- 2848 QbeGen.CopyOp("@", q)
|
|
|
- 2849 END
|
|
|
- 2850 END; .) ]
|
|
|
- 2851 (. IF called THEN
|
|
|
- 2852 astCur := astRes
|
|
|
- 2853 ELSIF astCall THEN
|
|
|
- 2854 astCur := astBrace
|
|
|
- 2855 ELSE astCur := astD
|
|
|
- 2856 END;
|
|
|
- 2857 astIsLit := TRUE;
|
|
|
- 2858 IF NOT called
|
|
|
- 2859 AND (dk = SymTab.KindProc) THEN
|
|
|
- 2860 (* bare zero-arg function
|
|
|
- 2861 call (parentheses may be
|
|
|
- 2862 omitted); a proper or
|
|
|
- 2863 parameterised proc here
|
|
|
- 2864 is 230 *)
|
|
|
- 2865 IF (SymTab.ProcNPar(qn) = 0)
|
|
|
- 2866 AND (SymTab.ProcRes(qn) # SymTab.InvalidType) THEN
|
|
|
- 2867 t := SymTab.ProcRes(qn);
|
|
|
- 2868 QbeGen.CopyOp("@", q);
|
|
|
- 2869 astCur := AST.MakeNode(AST.NkCall);
|
|
|
- 2870 AST.SetChild(astCur, 0, astD)
|
|
|
- 2871 ELSE
|
|
|
- 2872 t := SymTab.ProcTypeOf(qn);
|
|
|
- 2873 QbeGen.CopyOp("@", q)
|
|
|
- 2874 END
|
|
|
- 2875 END; .)
|
|
|
- 2876 | ( "HIGH" (. isHigh := TRUE; .)
|
|
|
- 2877 | ( "LEN" | "LENGTH" ) (. isHigh := FALSE; .) )
|
|
|
- 2878 "(" ( Design<dt, dk, qd, qn, sfx> (. isStr := FALSE;
|
|
|
- 2879 isU := FALSE; .)
|
|
|
- 2880 | string (. LexString(s); astCur := AST.MakeLeaf(AST.NkStrLit, s);
|
|
|
- 2881 isStr := TRUE;
|
|
|
- 2882 isU := FALSE;
|
|
|
- 2883 IF SymTab.StrLen(s) = 3 THEN
|
|
|
- 2884 dt := SymTab.CharType();
|
|
|
- 2885 QbeGen.IntStr(QbeGen.CharVal(s),
|
|
|
- 2886 qd)
|
|
|
- 2887 ELSE
|
|
|
- 2888 dt := SymTab.NewStr();
|
|
|
- 2889 QbeGen.DeclStr(s, qd);
|
|
|
- 2890 QbeGen.NoteAddr(qd, qd)
|
|
|
- 2891 END;
|
|
|
- 2892 dk := -1;
|
|
|
- 2893 qn[0] := CHR(0); .)
|
|
|
- 2894 | ustring (. LexString(s); astCur := AST.MakeLeaf(AST.NkStrLit, s);
|
|
|
- 2895 QbeGen.DeclUStr(s, qd, isU, ucp,
|
|
|
- 2896 uok);
|
|
|
- 2897 isStr := FALSE;
|
|
|
- 2898 IF NOT uok THEN
|
|
|
- 2899 SemError(234);
|
|
|
- 2900 dt := SymTab.InvalidType
|
|
|
- 2901 ELSIF isU THEN
|
|
|
- 2902 (* one codepoint: a UCHAR;
|
|
|
- 2903 LEN is 1, HIGH is 0 *)
|
|
|
- 2904 dt := SymTab.UCharType();
|
|
|
- 2905 QbeGen.IntStr(ucp, qd)
|
|
|
- 2906 ELSE
|
|
|
- 2907 dt := SymTab.NewUStr();
|
|
|
- 2908 QbeGen.NoteAddr(qd, qd)
|
|
|
- 2909 END;
|
|
|
- 2910 dk := -1;
|
|
|
- 2911 qn[0] := CHR(0); .) )
|
|
|
- 2912 ")"
|
|
|
- 2913 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2914 IF isHigh THEN AST.SetChild(astNode, 0,
|
|
|
- 2915 AST.MakeLeaf(AST.NkIdent, "HIGH"))
|
|
|
- 2916 ELSE AST.SetChild(astNode, 0,
|
|
|
- 2917 AST.MakeLeaf(AST.NkIdent, "LEN")) END;
|
|
|
- 2918 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2919 astCur := astNode; astIsLit := TRUE;
|
|
|
- 2920 IF (dt # SymTab.InvalidType)
|
|
|
- 2921 AND (SymTab.ClassOf(dt) = SymTab.ClUStr) THEN
|
|
|
- 2922 (* UString: the count is
|
|
|
- 2923 the descriptor header *)
|
|
|
- 2924 IF isHigh THEN
|
|
|
- 2925 QbeGen.UStrLen(qd, qr);
|
|
|
- 2926 QbeGen.DecQ(qr)
|
|
|
- 2927 ELSE
|
|
|
- 2928 QbeGen.UStrLen(qd, qr)
|
|
|
- 2929 END;
|
|
|
- 2930 t := SymTab.IntType();
|
|
|
- 2931 QbeGen.CopyOp(qr, q)
|
|
|
- 2932 ELSIF (dt # SymTab.InvalidType)
|
|
|
- 2933 AND (SymTab.ClassOf(dt) = SymTab.ClUChar) THEN
|
|
|
- 2934 (* single UCHAR codepoint *)
|
|
|
- 2935 IF isHigh THEN
|
|
|
- 2936 QbeGen.CopyOp("0", qr)
|
|
|
- 2937 ELSE
|
|
|
- 2938 QbeGen.CopyOp("1", qr)
|
|
|
- 2939 END;
|
|
|
- 2940 t := SymTab.IntType();
|
|
|
- 2941 QbeGen.CopyOp(qr, q)
|
|
|
- 2942 ELSIF isStr THEN
|
|
|
- 2943 (* fold: content length at
|
|
|
- 2944 compile time *)
|
|
|
- 2945 IF SymTab.StrLen(s) = 3 THEN
|
|
|
- 2946 c1 := 1
|
|
|
- 2947 ELSE
|
|
|
- 2948 c1 :=
|
|
|
- 2949 SymTab.StrLen(s) - 2
|
|
|
- 2950 END;
|
|
|
- 2951 IF isHigh THEN
|
|
|
- 2952 DEC(c1)
|
|
|
- 2953 END;
|
|
|
- 2954 QbeGen.IntStr(c1, qr);
|
|
|
- 2955 t := SymTab.IntType();
|
|
|
- 2956 QbeGen.CopyOp(qr, q)
|
|
|
- 2957 ELSIF dt = SymTab.InvalidType THEN
|
|
|
- 2958 t := SymTab.InvalidType;
|
|
|
- 2959 QbeGen.CopyOp("0", q)
|
|
|
- 2960 ELSIF SymTab.ClassOf(dt) #
|
|
|
- 2961 SymTab.ClArray THEN
|
|
|
- 2962 SemError(217);
|
|
|
- 2963 t := SymTab.InvalidType;
|
|
|
- 2964 QbeGen.CopyOp("0", q)
|
|
|
- 2965 ELSE
|
|
|
- 2966 IF SymTab.IsOpenArray(dt) THEN
|
|
|
- 2967 t := SymTab.IntType();
|
|
|
- 2968 QbeGen.CopyOp("@", q)
|
|
|
- 2969 ELSE
|
|
|
- 2970 IF isHigh THEN
|
|
|
- 2971 QbeGen.IntStr(
|
|
|
- 2972 SymTab.ArrayHi(dt), qr)
|
|
|
- 2973 ELSE
|
|
|
- 2974 QbeGen.IntStr(VAL(
|
|
|
- 2975 INTEGER,
|
|
|
- 2976 SymTab.ArrayLen(dt)),
|
|
|
- 2977 qr)
|
|
|
- 2978 END;
|
|
|
- 2979 t := SymTab.IntType();
|
|
|
- 2980 QbeGen.CopyOp(qr, q)
|
|
|
- 2981 END
|
|
|
- 2982 END; .)
|
|
|
- 2983 | ( "SIZE" | "TSIZE" ) "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
- 2984 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 2985 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "SIZE"));
|
|
|
- 2986 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 2987 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 2988 (. IF dt = SymTab.InvalidType THEN
|
|
|
- 2989 t := SymTab.InvalidType;
|
|
|
- 2990 QbeGen.CopyOp("0", q)
|
|
|
- 2991 ELSE
|
|
|
- 2992 QbeGen.IntStr(VAL(INTEGER,
|
|
|
- 2993 SymTab.ObjectSize(dt)), q);
|
|
|
- 2994 t := SymTab.IntType()
|
|
|
- 2995 END; .)
|
|
|
- 2996 | ( "SHIFT" (. isMax := FALSE; .)
|
|
|
- 2997 | "ROTATE" (. isMax := TRUE; .) )
|
|
|
- 2998 "(" Expr<et, q> (. astArg2 := astCur; .) "," Expr<et2, q2> ")"
|
|
|
- 2999 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3000 IF isMax THEN AST.SetChild(astNode, 0,
|
|
|
- 3001 AST.MakeLeaf(AST.NkIdent, "ROTATE"))
|
|
|
- 3002 ELSE AST.SetChild(astNode, 0,
|
|
|
- 3003 AST.MakeLeaf(AST.NkIdent, "SHIFT")) END;
|
|
|
- 3004 IF astArg2 # AST.NoNode THEN AST.SetChild(astNode, 1, astArg2) END;
|
|
|
- 3005 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 2, astCur) END;
|
|
|
- 3006 astCur := astNode; astIsLit := TRUE;
|
|
|
- 3007 (* set shift/rotate: isMax
|
|
|
- 3008 doubles as "rotate" *)
|
|
|
- 3009 IF (et # SymTab.InvalidType)
|
|
|
- 3010 AND (SymTab.ClassOf(et) =
|
|
|
- 3011 SymTab.ClSet) THEN
|
|
|
- 3012 t := et;
|
|
|
- 3013 QbeGen.CopyOp("@", q)
|
|
|
- 3014 ELSE SemError(230);
|
|
|
- 3015 t := SymTab.InvalidType;
|
|
|
- 3016 QbeGen.CopyOp("0", q)
|
|
|
- 3017 END; .)
|
|
|
- 3018 | ( "MIN" (. isMax := FALSE; .)
|
|
|
- 3019 | "MAX" (. isMax := TRUE; .) )
|
|
|
- 3020 "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
- 3021 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3022 IF isMax THEN AST.SetChild(astNode, 0,
|
|
|
- 3023 AST.MakeLeaf(AST.NkIdent, "MAX"))
|
|
|
- 3024 ELSE AST.SetChild(astNode, 0,
|
|
|
- 3025 AST.MakeLeaf(AST.NkIdent, "MIN")) END;
|
|
|
- 3026 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3027 astCur := astNode; astIsLit := TRUE;
|
|
|
- 3028 IF (dt # SymTab.InvalidType)
|
|
|
- 3029 AND (SymTab.ClassOf(dt) = SymTab.ClReal) THEN
|
|
|
- 3030 (* REAL/LONGREAL: the
|
|
|
- 3031 implementation bounds *)
|
|
|
- 3032 IF isMax THEN
|
|
|
- 3033 QbeGen.NormReal(
|
|
|
- 3034 "3.402823e38", q)
|
|
|
- 3035 ELSE QbeGen.NormReal(
|
|
|
- 3036 "-3.402823e38", q)
|
|
|
- 3037 END;
|
|
|
- 3038 t := SymTab.RealType()
|
|
|
- 3039 ELSIF (dt #
|
|
|
- 3040 SymTab.InvalidType)
|
|
|
- 3041 AND (SymTab.ClassOf(dt) =
|
|
|
- 3042 SymTab.ClLong) THEN
|
|
|
- 3043 IF isMax THEN
|
|
|
- 3044 QbeGen.CopyOp(
|
|
|
- 3045 "9223372036854775807", q)
|
|
|
- 3046 ELSE QbeGen.CopyOp(
|
|
|
- 3047 "-9223372036854775808", q)
|
|
|
- 3048 END;
|
|
|
- 3049 t := SymTab.LongType()
|
|
|
- 3050 ELSIF SymTab.TypeBounds(dt, lo,
|
|
|
- 3051 hi) THEN
|
|
|
- 3052 IF isMax THEN
|
|
|
- 3053 QbeGen.IntStr(hi, q)
|
|
|
- 3054 ELSE QbeGen.IntStr(lo, q)
|
|
|
- 3055 END;
|
|
|
- 3056 t := SymTab.IntType()
|
|
|
- 3057 ELSE SemError(230);
|
|
|
- 3058 t := SymTab.InvalidType;
|
|
|
- 3059 QbeGen.CopyOp("0", q)
|
|
|
- 3060 END; .)
|
|
|
- 3061 | "ADR" "(" Design<dt, dk, qd, qn, sfx> ")"
|
|
|
- 3062 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3063 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ADR"));
|
|
|
- 3064 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3065 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3066 (. IF dt = SymTab.InvalidType THEN
|
|
|
- 3067 t := SymTab.InvalidType;
|
|
|
- 3068 QbeGen.CopyOp("0", q)
|
|
|
- 3069 ELSE
|
|
|
- 3070 IF sfx
|
|
|
- 3071 OR (dk = SymTab.KindVar)
|
|
|
- 3072 OR (dk = SymTab.KindParam) THEN
|
|
|
- 3073 QbeGen.CopyOp("@", q)
|
|
|
- 3074 ELSE SemError(230);
|
|
|
- 3075 QbeGen.CopyOp("0", q)
|
|
|
- 3076 END;
|
|
|
- 3077 t := SymTab.AddrType()
|
|
|
- 3078 END; .)
|
|
|
- 3079 | "CHR" "(" Expr<et, q> ")"
|
|
|
- 3080 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3081 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CHR"));
|
|
|
- 3082 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3083 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3084 (. IF (et # SymTab.InvalidType)
|
|
|
- 3085 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
- 3086 SemError(211) END;
|
|
|
- 3087 t := SymTab.CharType(); .)
|
|
|
- 3088 | ( "ORD" | "ORDL" ) "(" Expr<et, q> ")"
|
|
|
- 3089 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3090 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ORD"));
|
|
|
- 3091 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3092 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3093 (. IF et # SymTab.InvalidType THEN
|
|
|
- 3094 IF (SymTab.ClassOf(et) #
|
|
|
- 3095 SymTab.ClChar)
|
|
|
- 3096 AND (SymTab.ClassOf(et) #
|
|
|
- 3097 SymTab.ClBool)
|
|
|
- 3098 AND (SymTab.ClassOf(et) #
|
|
|
- 3099 SymTab.ClEnum)
|
|
|
- 3100 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
- 3101 SemError(211) END
|
|
|
- 3102 END;
|
|
|
- 3103 t := SymTab.IntType(); .)
|
|
|
- 3104 | "CAP" "(" Expr<et, q> ")"
|
|
|
- 3105 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3106 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CAP"));
|
|
|
- 3107 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3108 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3109 (. QbeGen.CapQ(q, qa);
|
|
|
- 3110 QbeGen.CopyOp(qa, q);
|
|
|
- 3111 t := SymTab.CharType(); .)
|
|
|
- 3112 | "UCHR" "(" Expr<et, q> ")"
|
|
|
- 3113 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3114 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "UCHR"));
|
|
|
- 3115 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3116 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3117 (. (* UCHR: the UCHAR constructor.
|
|
|
- 3118 CHAR -> UCHAR (identity);
|
|
|
- 3119 INTEGER familly -> UCHAR
|
|
|
- 3120 (codepoint value). *)
|
|
|
- 3121 IF (et # SymTab.InvalidType)
|
|
|
- 3122 AND (SymTab.ClassOf(et) # SymTab.ClChar)
|
|
|
- 3123 AND NOT SymTab.IsIntFamily(et) THEN
|
|
|
- 3124 SemError(211) END;
|
|
|
- 3125 t := SymTab.UCharType(); .)
|
|
|
- 3126 | "CHR8" "(" Expr<et, q> ")"
|
|
|
- 3127 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3128 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "CHR8"));
|
|
|
- 3129 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3130 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3131 (. IF (et # SymTab.InvalidType)
|
|
|
- 3132 AND (SymTab.ClassOf(et) # SymTab.ClUChar) THEN
|
|
|
- 3133 SemError(211) END;
|
|
|
- 3134 t := SymTab.CharType(); .)
|
|
|
- 3135 | "UORD" "(" Expr<et, q> ")"
|
|
|
- 3136 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3137 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "UORD"));
|
|
|
- 3138 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3139 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3140 (. (* UORD(u): the codepoint as a
|
|
|
- 3141 32-bit ordinal (INTEGER),
|
|
|
- 3142 cf. ORD for CHAR. *)
|
|
|
- 3143 IF (et # SymTab.InvalidType)
|
|
|
- 3144 AND (SymTab.ClassOf(et) # SymTab.ClUChar) THEN
|
|
|
- 3145 SemError(211) END;
|
|
|
- 3146 t := SymTab.IntType(); .)
|
|
|
- 3147 | "ABS" "(" Expr<et, q> ")"
|
|
|
- 3148 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3149 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "ABS"));
|
|
|
- 3150 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 1, astCur) END;
|
|
|
- 3151 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3152 (. IF (et # SymTab.InvalidType)
|
|
|
- 3153 AND NOT SymTab.IsIntFamily(et)
|
|
|
- 3154 AND (SymTab.ClassOf(et) #
|
|
|
- 3155 SymTab.ClReal) THEN
|
|
|
- 3156 SemError(211)
|
|
|
- 3157 ELSE QbeGen.AbsQ(q, qa,
|
|
|
- 3158 SymTab.ClassOf(et) =
|
|
|
- 3159 SymTab.ClReal);
|
|
|
- 3160 QbeGen.CopyOp(qa, q)
|
|
|
- 3161 END;
|
|
|
- 3162 t := et; .)
|
|
|
- 3163 | "VAL" "(" GetIdent<vn> (. astArg2 := AST.MakeLeaf(AST.NkIdent, vn); .) "," Expr<et, q> ")"
|
|
|
- 3164 (. astNode := AST.MakeNode(AST.NkCall);
|
|
|
- 3165 AST.SetChild(astNode, 0, AST.MakeLeaf(AST.NkIdent, "VAL"));
|
|
|
- 3166 IF astArg2 # AST.NoNode THEN AST.SetChild(astNode, 1, astArg2) END;
|
|
|
- 3167 IF astCur # AST.NoNode THEN AST.SetChild(astNode, 2, astCur) END;
|
|
|
- 3168 astCur := astNode; astIsLit := TRUE; .)
|
|
|
- 3169 (. IF NOT SymTab.Lookup(vn) THEN
|
|
|
- 3170 SemError(201);
|
|
|
- 3171 t := SymTab.InvalidType
|
|
|
- 3172 ELSE vt := SymTab.SymType(vn);
|
|
|
- 3173 IF vt = SymTab.InvalidType THEN
|
|
|
- 3174 t := SymTab.InvalidType
|
|
|
- 3175 ELSIF et =
|
|
|
- 3176 SymTab.InvalidType THEN
|
|
|
- 3177 t := vt
|
|
|
- 3178 ELSE
|
|
|
- 3179 c1 := SymTab.ClassOf(et);
|
|
|
- 3180 c2 := SymTab.ClassOf(vt);
|
|
|
- 3181 IF (c1 = SymTab.ClInt)
|
|
|
- 3182 AND (c2 = SymTab.ClLong) THEN
|
|
|
- 3183 QbeGen.WidenLong(q, qa);
|
|
|
- 3184 QbeGen.CopyOp(qa, q);
|
|
|
- 3185 t := vt
|
|
|
- 3186 ELSIF (c1 = SymTab.ClLong)
|
|
|
- 3187 AND (c2 = SymTab.ClInt) THEN
|
|
|
- 3188 QbeGen.NarrowLong(q, qa);
|
|
|
- 3189 QbeGen.CopyOp(qa, q);
|
|
|
- 3190 t := vt
|
|
|
- 3191 ELSIF (c1 = SymTab.ClInt)
|
|
|
- 3192 AND (c2 = SymTab.ClReal) THEN
|
|
|
- 3193 QbeGen.ConvIR(q, qa);
|
|
|
- 3194 QbeGen.CopyOp(qa, q);
|
|
|
- 3195 t := vt
|
|
|
- 3196 ELSIF (c1 = SymTab.ClLong)
|
|
|
- 3197 AND (c2 = SymTab.ClReal) THEN
|
|
|
- 3198 QbeGen.ConvLR(q, qa);
|
|
|
- 3199 QbeGen.CopyOp(qa, q);
|
|
|
- 3200 t := vt
|
|
|
- 3201 ELSIF (c1 = SymTab.ClReal)
|
|
|
- 3202 AND (c2 = SymTab.ClInt) THEN
|
|
|
- 3203 QbeGen.ConvRI(q, qa);
|
|
|
- 3204 QbeGen.CopyOp(qa, q);
|
|
|
- 3205 t := vt
|
|
|
- 3206 ELSIF (c1 = SymTab.ClReal)
|
|
|
- 3207 AND (c2 = SymTab.ClLong) THEN
|
|
|
- 3208 QbeGen.ConvRL(q, qa);
|
|
|
- 3209 QbeGen.CopyOp(qa, q);
|
|
|
- 3210 t := vt
|
|
|
- 3211 ELSIF ((c1 = SymTab.ClInt)
|
|
|
- 3212 OR (c1 =
|
|
|
- 3213 SymTab.ClChar)
|
|
|
- 3214 OR (c1 =
|
|
|
- 3215 SymTab.ClBool)
|
|
|
- 3216 OR (c1 =
|
|
|
- 3217 SymTab.ClEnum))
|
|
|
- 3218 AND ((c2 = SymTab.ClInt)
|
|
|
- 3219 OR (c2 =
|
|
|
- 3220 SymTab.ClChar)
|
|
|
- 3221 OR (c2 =
|
|
|
- 3222 SymTab.ClBool)
|
|
|
- 3223 OR (c2 =
|
|
|
- 3224 SymTab.ClEnum)) THEN
|
|
|
- 3225 t := vt
|
|
|
- 3226 ELSIF (c1 = SymTab.ClPtr)
|
|
|
- 3227 AND (c2 = SymTab.ClPtr) THEN
|
|
|
- 3228 t := vt
|
|
|
- 3229 ELSIF (c1 = SymTab.ClReal)
|
|
|
- 3230 AND (c2 = SymTab.ClReal) THEN
|
|
|
- 3231 t := vt
|
|
|
- 3232 ELSE SemError(230);
|
|
|
- 3233 t := SymTab.InvalidType
|
|
|
- 3234 END
|
|
|
- 3235 END
|
|
|
- 3236 END; .)
|
|
|
- 3237 | "(" Expr<et, q> ")" (. t := et; astIsLit := TRUE; .)
|
|
|
- 3238 | SetLit<st, sq> (. astIsLit := TRUE; t := st;
|
|
|
- 3239 QbeGen.CopyOp(sq, q); .)
|
|
|
- 3240 | ( "NOT" | "~" ) Fact<t2, q2> (. astNot := astCur;
|
|
|
- 3241 IF SymTab.BoolCheck(t2) THEN
|
|
|
- 3242 t := SymTab.BoolType()
|
|
|
- 3243 ELSE SemError(212);
|
|
|
- 3244 t := SymTab.InvalidType END;
|
|
|
- 3245 IF t # SymTab.InvalidType THEN
|
|
|
- 3246 QbeGen.NotQ(q2, q)
|
|
|
- 3247 ELSE QbeGen.CopyOp("0", q)
|
|
|
- 3248 END;
|
|
|
- 3249 astIsLit := TRUE;
|
|
|
- 3250 astCur := AST.MakeUn(
|
|
|
- 3251 AST.NkUnary, AST.OpNot, astNot); .)
|
|
|
- 3252 )
|
|
|
- 3253 (. IF NOT astIsLit THEN astCur := AST.NoNode END; .) .
|
|
|
- 3254 (* Set literals are SET OF [0..255] (8 words); elements validated
|
|
|
- 3255 0..255 statically when foldable (222 otherwise), runtime trap
|
|
|
- 3256 for computed elements. Ranges always lower via SetRange. *)
|
|
|
- 3257 SetLit<VAR t: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 3258 (. VAR astNode: AST.Node; .)
|
|
|
- 3259 = "{" (. t := SymTab.NewSet(
|
|
|
- 3260 SymTab.NewSubR(0, 255));
|
|
|
- 3261 astNode := AST.MakeNode(AST.NkSetLit);
|
|
|
- 3262 QbeGen.NewSetTemp(8, q);
|
|
|
- 3263 QbeGen.SetZero(q, 8); .)
|
|
|
- 3264 [ SetElem<t, q, astNode> { "," SetElem<t, q, astNode> } ]
|
|
|
- 3265 "}" (. astCur := astNode; .) .
|
|
|
- 3266 (* Typed brace constructor: TypeName{ elems } — BITSET{0} (a set)
|
|
|
- 3267 or ArrayName{...} (an array constructor, GNU Modula-2). The
|
|
|
- 3268 declared type sets the width (set) or element type (array). *)
|
|
|
- 3269 TypedBraceLit<vt: SymTab.TypeIndex; VAR q: QbeGen.QVal>
|
|
|
- 3270 (. VAR nw: CARDINAL;
|
|
|
- 3271 astNode, astTail: AST.Node;
|
|
|
- 3272 savedCls: INTEGER; .)
|
|
|
- 3273 = "{" (. savedCls := braceCls;
|
|
|
- 3274 astNode := AST.MakeNode(AST.NkBraceLit);
|
|
|
- 3275 AST.SetTy(astNode, vt);
|
|
|
- 3276 astTail := astNode;
|
|
|
- 3277 IF vt = SymTab.InvalidType THEN
|
|
|
- 3278 braceCls := -1
|
|
|
- 3279 ELSE braceCls :=
|
|
|
- 3280 SymTab.ClassOf(vt)
|
|
|
- 3281 END;
|
|
|
- 3282 IF braceCls = SymTab.ClSet THEN
|
|
|
- 3283 IF vt = SymTab.InvalidType THEN
|
|
|
- 3284 nw := 8
|
|
|
- 3285 ELSE nw := SymTab.SetWords(vt);
|
|
|
- 3286 IF nw = 0 THEN nw := 8 END
|
|
|
- 3287 END;
|
|
|
- 3288 QbeGen.NewSetTemp(nw, q);
|
|
|
- 3289 QbeGen.SetZero(q, nw)
|
|
|
- 3290 ELSIF (braceCls =
|
|
|
- 3291 SymTab.ClArray)
|
|
|
- 3292 OR (braceCls =
|
|
|
- 3293 SymTab.ClRecord)
|
|
|
- 3294 OR (braceCls =
|
|
|
- 3295 SymTab.ClClass) THEN
|
|
|
- 3296 QbeGen.CtorBegin(vt)
|
|
|
- 3297 ELSE
|
|
|
- 3298 IF vt # SymTab.InvalidType THEN
|
|
|
- 3299 SemError(230) END;
|
|
|
- 3300 braceCls := -1
|
|
|
- 3301 END; .)
|
|
|
- 3302 [ BraceElem<vt, q, astNode, astTail>
|
|
|
- 3303 { "," BraceElem<vt, q, astNode, astTail> } ]
|
|
|
- 3304 "}" (. IF (braceCls = SymTab.ClArray)
|
|
|
- 3305 OR (braceCls =
|
|
|
- 3306 SymTab.ClRecord)
|
|
|
- 3307 OR (braceCls =
|
|
|
- 3308 SymTab.ClClass) THEN
|
|
|
- 3309 QbeGen.CtorEnd(q)
|
|
|
- 3310 ELSIF braceCls # SymTab.ClSet THEN
|
|
|
- 3311 QbeGen.CopyOp("0", q)
|
|
|
- 3312 END;
|
|
|
- 3313 braceCls := savedCls; .)
|
|
|
- 3314 (. astCur := astNode; .) .
|
|
|
- 3315 BraceElem<vt: SymTab.TypeIndex; VAR sq: QbeGen.QVal;
|
|
|
- 3316 VAR node, tail: AST.Node>
|
|
|
- 3317 (. VAR et, et2: SymTab.TypeIndex;
|
|
|
- 3318 qe, q2: QbeGen.QVal;
|
|
|
- 3319 v, v2, reps, k: INTEGER;
|
|
|
- 3320 elem: SymTab.TypeIndex;
|
|
|
- 3321 lo: INTEGER;
|
|
|
- 3322 span: CARDINAL;
|
|
|
- 3323 cl, cl2: INTEGER;
|
|
|
- 3324 hasR, hasB: BOOLEAN;
|
|
|
- 3325 astEl: AST.Node; .)
|
|
|
- 3326 = (. hasR := FALSE; hasB := FALSE;
|
|
|
- 3327 reps := 1; .)
|
|
|
- 3328 Expr<et, qe> (. astEl := astCur; .)
|
|
|
- 3329 [ ".." Expr<et2, q2> (. astEl := AST.MakeBin(
|
|
|
- 3330 AST.NkSubrange, 0, astEl, astCur);
|
|
|
- 3331 hasR := TRUE; .) ]
|
|
|
- 3332 [ "BY" Expr<et2, q2> (. hasB := TRUE; .) ]
|
|
|
- 3333 (. IF braceCls = SymTab.ClSet THEN
|
|
|
- 3334 IF hasB THEN SemError(230) END;
|
|
|
- 3335 lo := SymTab.SetBaseLo(vt);
|
|
|
- 3336 span := SymTab.SetCount(vt);
|
|
|
- 3337 IF (et = SymTab.InvalidType)
|
|
|
- 3338 OR (hasR AND (et2 =
|
|
|
- 3339 SymTab.InvalidType)) THEN
|
|
|
- 3340 ELSE cl :=
|
|
|
- 3341 SymTab.ClassOf(et);
|
|
|
- 3342 IF hasR THEN
|
|
|
- 3343 cl2 :=
|
|
|
- 3344 SymTab.ClassOf(et2)
|
|
|
- 3345 ELSE cl2 := SymTab.ClInt
|
|
|
- 3346 END;
|
|
|
- 3347 IF NOT SymTab.SetElemClassOk(cl)
|
|
|
- 3348 OR (hasR AND NOT
|
|
|
- 3349 SymTab.SetElemClassOk(cl2))
|
|
|
- 3350 THEN
|
|
|
- 3351 SemError(222)
|
|
|
- 3352 ELSIF hasR
|
|
|
- 3353 AND SymTab.ConstInt(qe, v)
|
|
|
- 3354 AND SymTab.ConstInt(q2,
|
|
|
- 3355 v2)
|
|
|
- 3356 AND ((v < lo)
|
|
|
- 3357 OR (v2 < lo)
|
|
|
- 3358 OR (v >= lo +
|
|
|
- 3359 VAL(INTEGER, span))
|
|
|
- 3360 OR (v2 >= lo +
|
|
|
- 3361 VAL(INTEGER, span))
|
|
|
- 3362 OR (v > v2)) THEN
|
|
|
- 3363 SemError(222)
|
|
|
- 3364 ELSIF hasR THEN
|
|
|
- 3365 QbeGen.SetRange(sq, qe, q2,
|
|
|
- 3366 lo, span)
|
|
|
- 3367 ELSIF SymTab.ConstInt(qe,
|
|
|
- 3368 v)
|
|
|
- 3369 AND ((v < lo)
|
|
|
- 3370 OR (v >= lo +
|
|
|
- 3371 VAL(INTEGER,
|
|
|
- 3372 span))) THEN
|
|
|
- 3373 SemError(222)
|
|
|
- 3374 ELSE QbeGen.SetBit(sq, qe,
|
|
|
- 3375 lo, span)
|
|
|
- 3376 END
|
|
|
- 3377 END
|
|
|
- 3378 ELSIF (braceCls = SymTab.ClArray)
|
|
|
- 3379 OR (braceCls =
|
|
|
- 3380 SymTab.ClRecord)
|
|
|
- 3381 OR (braceCls =
|
|
|
- 3382 SymTab.ClClass) THEN
|
|
|
- 3383 IF hasR THEN SemError(230) END;
|
|
|
- 3384 reps := 1;
|
|
|
- 3385 IF hasB THEN
|
|
|
- 3386 IF SymTab.ConstInt(q2, v2)
|
|
|
- 3387 AND (v2 >= 1) THEN
|
|
|
- 3388 reps := v2
|
|
|
- 3389 ELSE SemError(230)
|
|
|
- 3390 END
|
|
|
- 3391 END;
|
|
|
- 3392 k := 0;
|
|
|
- 3393 WHILE k < reps DO
|
|
|
- 3394 QbeGen.CtorElem(qe);
|
|
|
- 3395 INC(k)
|
|
|
- 3396 END
|
|
|
- 3397 END; .)
|
|
|
- 3398 (. (* the BY form repeats the
|
|
|
- 3399 element; keep the AST in
|
|
|
- 3400 step with CtorElem *)
|
|
|
- 3401 k := 0;
|
|
|
- 3402 WHILE k < reps DO
|
|
|
- 3403 AstAppend(AST.NkBlock,
|
|
|
- 3404 node, tail, astEl);
|
|
|
- 3405 INC(k)
|
|
|
- 3406 END; .) .
|
|
|
- 3407 SetElem<st: SymTab.TypeIndex; sq: QbeGen.QVal; node: AST.Node> (. VAR et, et2: SymTab.TypeIndex;
|
|
|
- 3408 qe, q2: QbeGen.QVal;
|
|
|
- 3409 v, v2: INTEGER;
|
|
|
- 3410 lo: INTEGER;
|
|
|
- 3411 span: CARDINAL;
|
|
|
- 3412 cl, cl2: INTEGER;
|
|
|
- 3413 hasR: BOOLEAN;
|
|
|
- 3414 astEl: AST.Node; .)
|
|
|
- 3415 = (. hasR := FALSE; .)
|
|
|
- 3416 Expr<et, qe> (. astEl := astCur; .)
|
|
|
- 3417 [ ".." Expr<et2, q2> (. astEl := AST.MakeBin(
|
|
|
- 3418 AST.NkSubrange, 0, astEl, astCur);
|
|
|
- 3419 hasR := TRUE; .) ]
|
|
|
- 3420 (. lo := SymTab.SetBaseLo(st);
|
|
|
- 3421 span := SymTab.SetCount(st);
|
|
|
- 3422 IF (et = SymTab.InvalidType)
|
|
|
- 3423 OR (hasR AND (et2 =
|
|
|
- 3424 SymTab.InvalidType)) THEN
|
|
|
- 3425 ELSE cl :=
|
|
|
- 3426 SymTab.ClassOf(et);
|
|
|
- 3427 IF hasR THEN
|
|
|
- 3428 cl2 :=
|
|
|
- 3429 SymTab.ClassOf(et2)
|
|
|
- 3430 ELSE cl2 := SymTab.ClInt
|
|
|
- 3431 END;
|
|
|
- 3432 IF NOT SymTab.SetElemClassOk(cl)
|
|
|
- 3433 OR (hasR AND NOT
|
|
|
- 3434 SymTab.SetElemClassOk(cl2))
|
|
|
- 3435 THEN
|
|
|
- 3436 SemError(222)
|
|
|
- 3437 ELSIF hasR
|
|
|
- 3438 AND SymTab.ConstInt(qe, v)
|
|
|
- 3439 AND SymTab.ConstInt(q2,
|
|
|
- 3440 v2)
|
|
|
- 3441 AND ((v < lo)
|
|
|
- 3442 OR (v2 < lo)
|
|
|
- 3443 OR (v >= lo +
|
|
|
- 3444 VAL(INTEGER, span))
|
|
|
- 3445 OR (v2 >= lo +
|
|
|
- 3446 VAL(INTEGER, span))
|
|
|
- 3447 OR (v > v2)) THEN
|
|
|
- 3448 SemError(222)
|
|
|
- 3449 ELSIF hasR THEN
|
|
|
- 3450 QbeGen.SetRange(sq, qe, q2,
|
|
|
- 3451 lo, span)
|
|
|
- 3452 ELSIF SymTab.ConstInt(qe,
|
|
|
- 3453 v)
|
|
|
- 3454 AND ((v < lo)
|
|
|
- 3455 OR (v >= lo +
|
|
|
- 3456 VAL(INTEGER,
|
|
|
- 3457 span))) THEN
|
|
|
- 3458 SemError(222)
|
|
|
- 3459 ELSE QbeGen.SetBit(sq, qe,
|
|
|
- 3460 lo, span)
|
|
|
- 3461 END
|
|
|
- 3462 END; .)
|
|
|
- 3463 (. AST.SetChild(node,
|
|
|
- 3464 AST.NChild(node), astEl); .) .
|
|
|
- 3465 GetIdent<VAR n: SymTab.Name>
|
|
|
- 3466 = ident (. LexName(n); .) .
|
|
|
- 3467
|
|
|
- 3468 END M2.
|
|
|
+ 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;
|
|
|
+ 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)
|
|
|
+ 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
|
|
|
+ 3217 AND SymTab.ConstInt(qe, v)
|
|
|
+ 3218 AND SymTab.ConstInt(q2,
|
|
|
+ 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)
|
|
|
+ 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.
|
|
|
|
|
|
0 errors
|
|
|
|
