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
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
|
#include "pr.h"
#include "dbg.h"
#include "errloc.h"
#include "fn.h"
#include "prv.h"
#include "parse.h"
#include "stmt.h"
#include "storage.h"
#include "sym.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
static int etc(const struct lex *, struct prv *);
static int using(const struct lex *, struct prv *);
static int s_returning(const struct lex *, struct prv *);
static const struct seq returning =
{(struct step[]){{ID, "returning"}, {0}}, .fn = s_returning};
static const struct seq seqs[] =
{
{(struct step[]){{ID, "using"}, {0}}, .fn = using},
returning,
{0}
};
static const struct seq useqs[] =
{
{(struct step[]){{ID, "etc"}, {0}}, .fn = etc},
returning,
{0}
};
static const struct tk *findparam(const char *s, const struct pr *pr)
{
for (size_t i = 0; i < pr->nparams; i++)
{
const struct param *p = &pr->params[i];
const struct tk *tk = p->tk;
if (!strcmp(tk->s, s))
return tk;
}
return NULL;
}
static int param(const struct tk *tk, const struct stentry *e, struct pr *pr)
{
size_t n = pr->nparams + 1;
struct param *params = realloc(pr->params, n * sizeof *params);
if (!params)
{
perror("realloc(3)");
return -1;
}
pr->params = params;
pr->params[pr->nparams++] = (struct param){.tk = tk, .entry = e};
return 0;
}
static int setret(const struct tk *tk, const struct stentry *e, struct pr *pr)
{
const struct tk *prm = findparam(tk->s, pr);
if (prm)
{
const struct loc *loc = &prm->loc;
errloc(tk, "return value \"%s\" already listed as "
"parameter at %s:%d:%d", tk->s, loc->f, loc->line, loc->col);
return -1;
}
else if (!(pr->ret = malloc(sizeof *pr->ret)))
{
perror("malloc(3)");
return -1;
}
*pr->ret = (struct param){.tk = tk, .entry = e};
return 0;
}
static int finalize(const struct lex *l, struct prv *p)
{
const struct fn *fn = fn_cur(p);
const struct pr *pr = fn->pr;
struct pos init =
{
.name = __func__,
.seq = stmts
};
if (pr->using && !pr->params)
{
errloc(p->stk, "missing parameters");
return -1;
}
else if (pr->returning && !pr->ret)
{
errloc(p->stk, "missing return variable");
return -1;
}
else if (p->proto)
{
if (pop(l, p))
return -1;
dbg("\t");
}
else if (push(&init, p))
return -1;
dbg("\tadd procedure to %s using %zu%s parameters and%s return value\n",
fn->tk->s, pr->nparams, pr->variadic ? " variadic" : "",
pr->ret ? "" : " no");
p->stk = p->tk;
return 0;
}
static int check(const struct lex *l, struct prv *p, const struct sym *s,
int param, const struct stentry **out)
{
const struct fn *fn = fn_cur(p);
const struct tk *tk = s->tk;
const struct stentry *e, *gle;
const struct storage *lk = fn->lk, *gl = fn->gl;
if (s->type != SYM_ID)
{
errloc(tk, "expected identifier");
return -1;
}
else if (!lk || !(e = storage_find(tk->s, lk)))
{
if (param && p->proto)
{
/* ambiguous syntax: param might be confused
* with next custom type. */
p->stk = s->tk;
return pop(l, p);
}
else
{
errloc(tk, "\"%s\" not in linkage section", tk->s);
return -1;
}
}
else if (gl && (gle = storage_find(tk->s, gl)))
{
const struct loc *loc = &gle->tk->loc;
errloc(tk, "\"%s\" also in %s at %d:%d", s, gl->name,
loc->line, loc->col);
return -1;
}
*out = e;
return 0;
}
static int usym(const struct lex *l, struct prv *p, const struct sym *s)
{
const struct tk *tk = s->tk;
const struct fn *fn = fn_cur(p);
const struct stentry *e = NULL;
if (check(l, p, s, 1, &e))
return -1;
else if (e)
return param(tk, e, fn->pr);
return 0;
}
static int etc(const struct lex *l, struct prv *p)
{
const struct fn *fn = fn_cur(p);
struct pr *pr = fn->pr;
if (pr->variadic)
{
errloc(p->stk, "procedure for \"%s\" already set as variadic",
fn->tk->s);
return -1;
}
pr->variadic = 1;
reset(p);
return 0;
}
static int rsym(const struct lex *l, struct prv *p, const struct sym *s)
{
const struct tk *tk = s->tk;
const struct fn *fn = fn_cur(p);
const struct stentry *e = NULL;
if (check(l, p, s, 0, &e))
return -1;
else if (e)
{
if (setret(tk, e, fn->pr))
return -1;
return pop(l, p);
}
return 0;
}
static int s_returning(const struct lex *l, struct prv *p)
{
const struct fn *fn = fn_cur(p);
struct pr *pr = fn->pr;
if (pr->returning)
{
errloc(p->stk, "\"returning\" for \"%s\" already set", fn->tk->s);
return -1;
}
pr->returning = 1;
return sym(p, rsym);
}
static int using(const struct lex *l, struct prv *p)
{
const struct fn *fn = fn_cur(p);
struct pr *pr = fn->pr;
struct pos init =
{
.name = __func__,
.seq = useqs
};
if (pr->using)
{
errloc(p->stk, "\"using\" for \"%s\" already set", fn->tk->s);
return -1;
}
if (push(&init, p))
return -1;
pr->using = 1;
return sym(p, usym);
}
void pr_free(struct pr *pr)
{
if (pr)
{
free(pr->params);
free(pr->ret);
}
free(pr);
}
int pr(const struct lex *l, struct prv *p)
{
const struct tk *tk = p->stk;
struct fn *fn = fn_cur(p);
struct pos init =
{
.name = __func__,
.seq = seqs,
.end = finalize
};
if (fn->pr)
{
const struct loc *loc = &fn->pr->tk->loc;
errloc(tk, "procedure already defined at %s:%d:%d", loc->f, loc->line,
loc->col);
return -1;
}
else if (!(fn->pr = malloc(sizeof *fn->pr)))
{
perror("malloc(3)");
return -1;
}
*fn->pr = (struct pr){.tk = tk};
if (push(&init, p))
return -1;
p->stk = p->tk;
return 0;
}
|