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
|
#include "err.h"
#include "analyse.h"
#include <assert.h>
#include <string.h>
struct analyse_result_s analyse(struct parse_result_s pr)
{
struct analyse_result_s ar = {
.uses_bool = false,
.uses_string = false,
.uses_id = false,
.uses_int = false,
.uses_intl = false,
.uses_intll = false,
.uses_uint = false,
.uses_uintl = false,
.uses_uintll = false,
.uses_float = false,
.uses_double = false,
.uses_doublel = false,
};
struct parse_deftype_s *dtp, *tmp_dtp;
struct parse_var_s *vtp, *tmp_vtp;
struct analyse_tree_s *cur;
unsigned i;
ar.deftype_tree.branch_count = 0;
ar.deftype_tree.is_terminal = false;
if (pr.deftypes != NULL) {
HASH_ITER(hh, pr.deftypes, dtp, tmp_dtp) {
cur = &(ar.deftype_tree);
/* walk down the tree, creating nodes when necessary */
for (i = 0; dtp->name[i] != '\0'; i++) {
if (cur->branch_count == 0
|| cur->branch_chars[cur->branch_count - 1]
!= dtp->name[i]
) {
cur->branch_count++;
cur->branch_chars[cur->branch_count - 1] = dtp->name[i];
TRYALLOC(cur->branches[cur->branch_count - 1], 1);
cur = cur->branches[cur->branch_count - 1];
cur->branch_count = 0;
cur->is_terminal = false;
} else {
cur = cur->branches[cur->branch_count - 1];
}
}
cur->is_terminal = true;
strcpy(cur->name, dtp->name);
}
}
ar.var_tree.branch_count = 0;
ar.var_tree.is_terminal = false;
if (pr.vars != NULL) {
HASH_ITER(hh, pr.vars, vtp, tmp_vtp) {
cur = &(ar.var_tree);
/* walk down the tree, creating nodes when necessary */
for (i = 0; vtp->name[i] != '\0'; i++) {
if (cur->branch_count == 0
|| cur->branch_chars[cur->branch_count - 1]
!= vtp->name[i]
) {
cur->branch_count++;
cur->branch_chars[cur->branch_count - 1] = vtp->name[i];
TRYALLOC(cur->branches[cur->branch_count - 1], 1);
cur = cur->branches[cur->branch_count - 1];
cur->branch_count = 0;
cur->is_terminal = false;
} else {
cur = cur->branches[cur->branch_count - 1];
}
}
cur->is_terminal = true;
strcpy(cur->name, vtp->name);
}
}
HASH_ITER(hh, pr.vars, vtp, tmp_vtp) {
switch (vtp->type
- (PARSE_TYPE_ARRAY_BOOL * (vtp->type >= PARSE_TYPE_ARRAY_BOOL))
- (PARSE_TYPE_ARRAY_BOOL * (vtp->type >= PARSE_TYPE_HASH_BOOL))
) {
case PARSE_TYPE_BOOL:
ar.uses_bool = true;
break;
case PARSE_TYPE_STRING:
ar.uses_string = true;
break;
case PARSE_TYPE_ID:
ar.uses_id = true;
break;
case PARSE_TYPE_INT:
ar.uses_int = true;
break;
case PARSE_TYPE_INTL:
ar.uses_intl = true;
break;
case PARSE_TYPE_INTLL:
ar.uses_intll = true;
break;
case PARSE_TYPE_UINT:
ar.uses_uint = true;
break;
case PARSE_TYPE_UINTL:
ar.uses_uintl = true;
break;
case PARSE_TYPE_UINTLL:
ar.uses_uintll = true;
break;
case PARSE_TYPE_FLOAT:
ar.uses_float = true;
break;
case PARSE_TYPE_DOUBLE:
ar.uses_double = true;
break;
case PARSE_TYPE_DOUBLEL:
ar.uses_doublel = true;
break;
default:
HASH_FIND_STR(pr.deftypes, vtp->deftype_name, dtp);
assert(dtp != NULL);
for (i = 0; i < dtp->member_list_len; i++) {
switch (dtp->member_type_list[i]
- (PARSE_TYPE_ARRAY_BOOL *
(dtp->member_type_list[i] >= PARSE_TYPE_ARRAY_BOOL)
)
- (PARSE_TYPE_ARRAY_BOOL *
(dtp->member_type_list[i] >= PARSE_TYPE_HASH_BOOL)
)
) {
case PARSE_TYPE_BOOL:
ar.uses_bool = true;
break;
case PARSE_TYPE_STRING:
ar.uses_string = true;
break;
case PARSE_TYPE_ID:
ar.uses_id = true;
break;
case PARSE_TYPE_INT:
ar.uses_int = true;
break;
case PARSE_TYPE_INTL:
ar.uses_intl = true;
break;
case PARSE_TYPE_INTLL:
ar.uses_intll = true;
break;
case PARSE_TYPE_UINT:
ar.uses_uint = true;
break;
case PARSE_TYPE_UINTL:
ar.uses_uintl = true;
break;
case PARSE_TYPE_UINTLL:
ar.uses_uintll = true;
break;
case PARSE_TYPE_FLOAT:
ar.uses_float = true;
break;
case PARSE_TYPE_DOUBLE:
ar.uses_double = true;
break;
case PARSE_TYPE_DOUBLEL:
ar.uses_doublel = true;
break;
default:
assert(false);
}
}
}
}
return ar;
}
static void sub_recurse_free(struct analyse_tree_s *t)
{
unsigned i;
for (i = 0; i < t->branch_count; i++) {
sub_recurse_free(t->branches[i]);
free(t->branches[i]);
}
}
void analyse_result_wipe(struct analyse_result_s *r)
{
assert(r != NULL);
sub_recurse_free(&(r->deftype_tree));
sub_recurse_free(&(r->var_tree));
}
|
