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
|
#include <fwd/move.h>
struct ast_pair {
struct ast *def;
struct ast *use;
};
#define SPTREE_TYPE struct ast_pair
#define SPTREE_CMP(a, b) ((a).def - (b).def)
#define SPTREE_NAME moved
#include <fwd/sptree.h>
struct state {
struct moved moved;
struct state *parent;
};
static struct state create_state(struct state *parent)
{
struct state state = {};
state.parent = parent;
state.moved = moved_create();
return state;
}
static void destroy_state(struct state *state)
{
moved_destroy(&state->moved);
}
static struct ast_pair *find_move(struct state *state, struct ast *def)
{
if (!state)
return NULL;
struct ast_pair search = {.def = def};
struct ast_pair *found = moved_find(&state->moved, search);
if (found)
return found;
return find_move(state->parent, def);
}
static void insert_move(struct state *state, struct ast *def, struct ast *use)
{
struct ast_pair pair = {.def = def, .use = use};
moved_insert(&state->moved, pair);
}
static void push_up(struct state *state)
{
struct state *parent = state->parent;
if (!parent)
return;
if (moved_len(&state->moved) == 0)
return;
foreach(moved, n, &state->moved) {
moved_insert(&parent->moved, *n);
}
}
static int mvcheck(struct state *state, struct ast *node);
static int mvcheck_list(struct state *state, struct ast *nodes);
static int mvcheck_proc(struct state *state, struct ast *node)
{
/* extern, can't really do anything so just say it's fine */
if (!proc_body(node))
return 0;
struct state new_state = create_state(state);
/* we don't need to merge things into the parent state */
int ret = mvcheck(&new_state, proc_body(node));
destroy_state(&new_state);
return ret;
}
static int mvcheck_block(struct state *state, struct ast *node)
{
return mvcheck_list(state, block_body(node));
}
static int mvcheck_list(struct state *state, struct ast *nodes)
{
foreach_node(node, nodes) {
if (mvcheck(state, node))
return -1;
}
return 0;
}
static int mvcheck_call(struct state *state, struct ast *node)
{
return mvcheck_list(state, call_args(node));
}
static int mvcheck_closure(struct state *state, struct ast *node)
{
struct state new_state = create_state(state);
int ret = mvcheck(&new_state, closure_body(node));
push_up(&new_state);
destroy_state(&new_state);
return ret;
}
static int mvcheck_id(struct state *state, struct ast *node)
{
struct ast *def = file_scope_find_symbol(node->scope, id_str(node));
assert(def);
struct ast_pair *prev = find_move(state, def);
if (prev) {
move_error(node, prev->use);
return -1;
}
insert_move(state, def, node);
return 0;
}
static int mvcheck(struct state *state, struct ast *node)
{
switch (node->k) {
case AST_PROC_DEF: return mvcheck_proc (state, node);
case AST_BLOCK: return mvcheck_block (state, node);
case AST_CALL: return mvcheck_call (state, node);
case AST_CLOSURE: return mvcheck_closure (state, node);
case AST_ID: return mvcheck_id (state, node);
default: break;
}
internal_error("missing move check for %s", ast_str(node->k));
return -1;
}
int mvcheck_root(struct ast *root)
{
foreach_node(node, root) {
struct state state = create_state(NULL);
if (mvcheck(&state, node))
return -1;
}
return 0;
}
|
