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
|
/* SPDX-License-Identifier: copyleft-next-0.3.1 */
/* Copyright 2024 Kim Kuparinen < kimi.h.kuparinen@gmail.com > */
/** @file scope.c
*
* Implementations for scope handling stuff.
*/
#include <stddef.h>
#include <string.h>
#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>
#include <assert.h>
#include <fwd/debug.h>
#include <fwd/scope.h>
struct scope *create_scope()
{
/* if I ever try making the parser multithreaded, this should be atomic. */
static size_t counter = 0;
struct scope *scope = calloc(1, sizeof(struct scope));
if (!scope) {
internal_error("ran out of memory allocating scope");
return NULL;
}
scope->number = counter++;
return scope;
}
static void destroy_visible(struct visible *visible)
{
struct visible *prev = visible, *cur;
if (prev)
do {
cur = prev->next;
free(prev);
} while ((prev = cur));
}
void destroy_scope(struct scope *scope)
{
if (!scope)
return;
if (!scope->parent) {
free((void *)scope->fctx.fbuf);
free((void *)scope->fctx.fname);
}
destroy_visible(scope->symbols);
struct scope *prev = scope->children, *cur;
if (prev)
do {
cur = prev->next;
destroy_scope(prev);
} while ((prev = cur));
free(scope);
}
static struct visible *create_visible(char *id, struct ast *node)
{
struct visible *visible = calloc(1, sizeof(struct visible));
if (!visible)
return NULL;
visible->id = id;
visible->node = node;
return visible;
}
struct visible *create_var(struct scope *scope, char *id, struct ast *var)
{
struct visible *n = create_visible(id, var);
if (!n)
return NULL;
n->next = scope->symbols;
scope->symbols = n;
return n;
}
struct visible *create_proc(struct scope *scope, char *id, struct ast *proc)
{
struct visible *n = create_visible(id, proc);
if (!n)
return NULL;
n->next = scope->symbols;
scope->symbols = n;
return n;
}
int scope_add_var(struct scope *scope, struct ast *var)
{
struct ast *exists = scope_find_symbol(scope, var_id(var));
if (exists) {
semantic_error(scope, var, "var redefined");
semantic_info(scope, exists, "previously here");
return -1;
}
create_var(scope, var_id(var), var);
return 0;
}
int scope_add_proc(struct scope *scope, struct ast *proc)
{
assert(proc->k == AST_PROC_DEF);
struct ast *exists = file_scope_find_symbol(scope, proc_id(proc));
if (exists) {
semantic_error(scope, proc, "proc redefined");
semantic_info(scope, exists, "previously here");
return -1;
}
/* always add to scope, do resolve checking later */
create_proc(scope, proc_id(proc), proc);
return 0;
}
static struct ast *scope_find_visible(struct visible *v, char *id)
{
if (!v)
return NULL;
foreach_visible(n, v) {
struct ast *node = n->node;
if (same_id(node->s, id))
return node;
}
return NULL;
}
struct ast *scope_find_proc(struct scope *scope, char *id)
{
struct ast *n = scope_find_visible(scope->symbols, id);
if (!n)
return NULL;
if (n->k != AST_PROC_DEF)
return NULL;
return n;
}
struct ast *file_scope_find_proc(struct scope *scope, char *id)
{
struct ast *n = file_scope_find_symbol(scope, id);
if (!n)
return NULL;
if (n->k != AST_PROC_DEF)
return NULL;
return n;
}
struct ast *scope_find_symbol(struct scope *scope, char *id)
{
return scope_find_visible(scope->symbols, id);
}
struct ast *file_scope_find_symbol(struct scope *scope, char *id)
{
if (!scope)
return NULL;
struct ast *found = scope_find_symbol(scope, id);
if (found)
return found;
return file_scope_find_symbol(scope->parent, id);
}
struct ast *scope_find_var(struct scope *scope, char *id)
{
struct ast *n = scope_find_visible(scope->symbols, id);
if (!n)
return NULL;
if (n->k != AST_VAR_DEF)
return NULL;
return n;
}
struct ast *file_scope_find_var(struct scope *scope, char *id)
{
if (!scope)
return NULL;
struct ast *found = scope_find_var(scope, id);
if (found)
return found;
return file_scope_find_var(scope->parent, id);
}
void scope_add_scope(struct scope *parent, struct scope *child)
{
assert(parent);
assert(child);
child->fctx = parent->fctx;
child->parent = parent;
child->next = parent->children;
parent->children = child;
}
|
