1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
|
//
//
// The Nimrod Compiler
// (c) Copyright 2009 Andreas Rumpf
//
// See the file "copying.txt", included in this
// distribution, for details about the copyright.
//
unit sem;
// This module implements the semantic checking pass.
interface
{$include 'config.inc'}
uses
sysutils, nsystem, charsets, strutils, nhashes,
lists, options, scanner, ast, astalgo, trees, treetab, wordrecg,
ropes, msgs, nos, condsyms, idents, rnimsyn, types, platform,
nmath, magicsys, pnimsyn, nversion, nimsets,
semdata, evals, semfold, importer, procfind, lookups, rodread,
pragmas, passes;
//var
// point: array [0..3] of int;
function semPass(): TPass;
implementation
function considerAcc(n: PNode): PIdent;
var
x: PNode;
begin
x := n;
if x.kind = nkAccQuoted then x := x.sons[0];
case x.kind of
nkIdent: result := x.ident;
nkSym: result := x.sym.name;
else begin
liMessage(n.info, errIdentifierExpected, renderTree(n));
result := nil
end
end
end;
function isTopLevel(c: PContext): bool;
begin
result := c.tab.tos <= 2
end;
function newSymS(const kind: TSymKind; n: PNode; c: PContext): PSym;
begin
result := newSym(kind, considerAcc(n), getCurrOwner());
result.info := n.info;
end;
procedure markUsed(n: PNode; s: PSym);
begin
include(s.flags, sfUsed);
if sfDeprecated in s.flags then liMessage(n.info, warnDeprecated, s.name.s);
end;
function semIdentVis(c: PContext; kind: TSymKind; n: PNode;
const allowed: TSymFlags): PSym; forward;
// identifier with visability
function semIdentWithPragma(c: PContext; kind: TSymKind;
n: PNode; const allowed: TSymFlags): PSym; forward;
function semStmtScope(c: PContext; n: PNode): PNode; forward;
type
TExprFlag = (efAllowType, efLValue, efWantIterator);
TExprFlags = set of TExprFlag;
function semExpr(c: PContext; n: PNode;
flags: TExprFlags = {@set}[]): PNode; forward;
function semExprWithType(c: PContext; n: PNode;
flags: TExprFlags = {@set}[]): PNode; forward;
function fitNode(c: PContext; formal: PType; arg: PNode): PNode; forward;
function semLambda(c: PContext; n: PNode): PNode; forward;
function semTypeNode(c: PContext; n: PNode; prev: PType): PType; forward;
function semStmt(c: PContext; n: PNode): PNode; forward;
procedure semParamList(c: PContext; n, genericParams: PNode; s: PSym); forward;
procedure addParams(c: PContext; n: PNode); forward;
procedure addResult(c: PContext; t: PType; const info: TLineInfo); forward;
procedure addResultNode(c: PContext; n: PNode); forward;
function instGenericContainer(c: PContext; n: PNode; header: PType): PType; forward;
function semConstExpr(c: PContext; n: PNode): PNode;
begin
result := semExprWithType(c, n);
if result = nil then begin
liMessage(n.info, errConstExprExpected);
exit
end;
result := getConstExpr(c.module, result);
if result = nil then
liMessage(n.info, errConstExprExpected);
end;
function semAndEvalConstExpr(c: PContext; n: PNode): PNode;
var
e: PNode;
begin
e := semExprWithType(c, n);
if e = nil then begin
liMessage(n.info, errConstExprExpected);
result := nil; exit
end;
result := getConstExpr(c.module, e);
if result = nil then begin
//writeln(output, renderTree(n));
result := evalConstExpr(c.module, e);
if (result = nil) or (result.kind = nkEmpty) then
liMessage(n.info, errConstExprExpected);
end
end;
function semAfterMacroCall(c: PContext; n: PNode; s: PSym): PNode;
begin
result := n;
case s.typ.sons[0].kind of
tyExpr: result := semExprWithType(c, result);
tyStmt: result := semStmt(c, result);
tyTypeDesc: result.typ := semTypeNode(c, result, nil);
else liMessage(s.info, errInvalidParamKindX, typeToString(s.typ.sons[0]))
end
end;
{$include 'semtempl.pas'}
function semMacroExpr(c: PContext; n: PNode; sym: PSym;
semCheck: bool = true): PNode;
var
p: PEvalContext;
s: PStackFrame;
begin
inc(evalTemplateCounter);
if evalTemplateCounter > 100 then
liMessage(n.info, errTemplateInstantiationTooNested);
markUsed(n, sym);
p := newEvalContext(c.module, '', false);
s := newStackFrame();
s.call := n;
setLength(s.params, 2);
s.params[0] := newNodeIT(nkNilLit, n.info, sym.typ.sons[0]);
s.params[1] := n;
pushStackFrame(p, s);
{@discard} eval(p, sym.ast.sons[codePos]);
result := s.params[0];
popStackFrame(p);
if cyclicTree(result) then liMessage(n.info, errCyclicTree);
if semCheck then
result := semAfterMacroCall(c, result, sym);
dec(evalTemplateCounter);
end;
{$include 'seminst.pas'}
{$include 'sigmatch.pas'}
procedure CheckBool(t: PNode);
begin
if (t.Typ = nil) or (skipTypes(t.Typ, {@set}[tyGenericInst,
tyVar, tyOrdinal]).kind <> tyBool) then
liMessage(t.Info, errExprMustBeBool);
end;
procedure typeMismatch(n: PNode; formal, actual: PType);
begin
liMessage(n.Info, errGenerated,
msgKindToString(errTypeMismatch) +{&} typeToString(actual) +{&} ') '
+{&} format(msgKindToString(errButExpectedX), [typeToString(formal)]));
end;
{$include 'semtypes.pas'}
{$include 'semexprs.pas'}
{$include 'semgnrc.pas'}
{$include 'semstmts.pas'}
procedure addCodeForGenerics(c: PContext; n: PNode);
var
i: int;
prc: PSym;
it: PNode;
begin
for i := c.lastGenericIdx to sonsLen(c.generics)-1 do begin
it := c.generics.sons[i].sons[1];
if it.kind <> nkSym then InternalError('addCodeForGenerics');
prc := it.sym;
if (prc.kind in [skProc, skMethod, skConverter])
and (prc.magic = mNone) then begin
if (prc.ast = nil) or (prc.ast.sons[codePos] = nil) then
InternalError(prc.info, 'no code for ' + prc.name.s);
addSon(n, prc.ast);
end
end;
c.lastGenericIdx := sonsLen(c.generics);
end;
function myOpen(module: PSym; const filename: string): PPassContext;
var
c: PContext;
begin
c := newContext(module, filename);
if (c.p <> nil) then InternalError(module.info, 'sem.myOpen');
c.semConstExpr := semConstExpr;
c.p := newProcCon(module);
pushOwner(c.module);
openScope(c.tab); // scope for imported symbols
SymTabAdd(c.tab, module); // a module knows itself
if sfSystemModule in module.flags then begin
magicsys.SystemModule := module; // set global variable!
InitSystem(c.tab); // currently does nothing
end
else begin
SymTabAdd(c.tab, magicsys.SystemModule); // import the "System" identifier
importAllSymbols(c, magicsys.SystemModule);
end;
openScope(c.tab); // scope for the module's symbols
result := c
end;
function myOpenCached(module: PSym; const filename: string;
rd: PRodReader): PPassContext;
var
c: PContext;
begin
c := PContext(myOpen(module, filename));
c.fromCache := true;
result := c
end;
function myProcess(context: PPassContext; n: PNode): PNode;
var
c: PContext;
a: PNode;
begin
result := nil;
c := PContext(context);
result := semStmt(c, n);
// BUGFIX: process newly generated generics here, not at the end!
if sonsLen(c.generics) > 0 then begin
a := newNodeI(nkStmtList, n.info);
addCodeForGenerics(c, a);
if sonsLen(a) > 0 then begin
// a generic has been added to `a`:
addSonIfNotNil(a, result);
result := a
end
end
end;
function myClose(context: PPassContext; n: PNode): PNode;
var
c: PContext;
begin
c := PContext(context);
closeScope(c.tab); // close module's scope
rawCloseScope(c.tab); // imported symbols; don't check for unused ones!
if n = nil then result := newNode(nkStmtList)
else InternalError(n.info, 'n is not nil');
//result := n;
addCodeForGenerics(c, result);
popOwner();
c.p := nil;
end;
function semPass(): TPass;
begin
initPass(result);
result.open := myOpen;
result.openCached := myOpenCached;
result.close := myClose;
result.process := myProcess;
end;
end.
|