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
| | /*
* Copyright (C) 2024 olang maintainers
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "checker.h"
#include "scope.h"
#include <assert.h>
#include <errno.h>
#include <stdio.h>
static void
populate_scope(checker_t *checker, scope_t *scope, ast_node_t *ast);
checker_t *
checker_new(arena_t *arena)
{
assert(arena);
checker_t *checker = (checker_t *)arena_alloc(arena, sizeof(checker_t));
if (checker == NULL) {
fprintf(stderr, "[FATAL] Out of memory: checker_new: %s\n", strerror(errno));
exit(EXIT_FAILURE);
}
checker->arena = arena;
return checker;
}
void
checker_check(checker_t *checker, ast_node_t *ast)
{
assert(checker);
assert(ast);
scope_t *scope = scope_new(checker->arena);
populate_scope(checker, scope, ast);
// TODO: traverse the ast tree to verify semantics
}
static void
populate_scope(checker_t *checker, scope_t *scope, ast_node_t *ast)
{
switch (ast->kind) {
case AST_NODE_TRANSLATION_UNIT: {
list_item_t *item = list_head(ast->as_translation_unit.decls);
while (item != NULL) {
populate_scope(checker, scope, (ast_node_t *)item->value);
item = list_next(item);
}
return;
}
case AST_NODE_FN_DEF: {
ast->as_fn_def.scope = scope;
// FIXME: insert function symbol to scope
populate_scope(checker, scope, ast->as_fn_def.block);
return;
}
case AST_NODE_IF_STMT: {
populate_scope(checker, scope, ast->as_if_stmt.cond);
populate_scope(checker, scope, ast->as_if_stmt.then);
if (ast->as_if_stmt._else) {
populate_scope(checker, scope, ast->as_if_stmt._else);
}
return;
}
case AST_NODE_BINARY_OP: {
ast_binary_op_t bin_op = ast->as_bin_op;
populate_scope(checker, scope, bin_op.lhs);
populate_scope(checker, scope, bin_op.rhs);
return;
}
case AST_NODE_RETURN_STMT: {
ast_return_stmt_t return_stmt = ast->as_return_stmt;
populate_scope(checker, scope, return_stmt.expr);
return;
}
case AST_NODE_BLOCK: {
ast_block_t block = ast->as_block;
scope = scope_push(scope);
list_item_t *item = list_head(block.nodes);
while (item != NULL) {
populate_scope(checker, scope, (ast_node_t *)item->value);
item = list_next(item);
}
return;
}
case AST_NODE_VAR_DEF: {
string_view_t id = ast->as_var_def.id;
symbol_t *symbol = symbol_new(checker->arena, id, type_from_id(ast->as_var_def.type));
scope_insert(scope, symbol);
ast->as_var_def.scope = scope;
return;
}
case AST_NODE_REF: {
ast->as_ref.scope = scope;
return;
}
case AST_NODE_LITERAL:
case AST_NODE_UNKNOWN:
case AST_NODE_FN_CALL:
return;
}
}
|