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
|
#include "include/doer.h"
#include "include/tree.h"
#include "include/util.h"
#include <string.h>
target_t* target_init(char* name, tree_t* tree) {
target_t* target = emalloc(sizeof(target_t));
target->tree = tree;
target->nxt = NULL;
return target;
}
void target_destroy(target_t* target) {
if (target) {
target_destroy(target->nxt);
free(target);
}
}
void target_print(target_t* target) {
if (!target) return;
LOG_DBGF("target points to tree: %p", target->tree);
target_print(target->nxt);
}
/* Creates a new doer from a tree. */
doer_t* doer_init(tree_t* tree) {
doer_t* doer;
doer = emalloc(sizeof(doer_t));
doer->tree = tree;
doer->targets = NULL;
doer->ltarget = doer->targets;
return doer;
}
/*
Destroys a doer.
- Does not destroy the `tree`.
*/
void doer_destroy(doer_t* doer) {
target_destroy(doer->targets);
free(doer);
}
void doer_add_target(doer_t* doer, target_t* target) {
// First target being added.
if (!doer->targets) doer->targets = doer->ltarget = target;
else {
doer->ltarget->nxt = target;
doer->ltarget = target;
}
}
tree_t* doer_find_target_from_call(target_t* targetl, tree_t* call) {
if (!targetl) { DIE("Call to missing target."); }
char* targname = targetl->tree->data.def.tag->data.tag.nxt->data.tag.val;
char* call_name = call->data.call.target;
if (!strcmp(targname, call_name)) {
return targetl->tree;
} else {
return doer_find_target_from_call(targetl->nxt, call);
}
}
char* doer_eval_str(doer_t* doer) {
// Assume tree type is a simple call to variable.
// Search through target list for matching variable.
// Return its value as a string (assume it's a string).
switch (doer->tree->type) {
case TREE_TYPE_CALL:
doer_do_call(doer);
return doer_eval_str(doer);
case TREE_TYPE_DEF:
doer->tree = doer->tree->data.def.val;
return doer_eval_str(doer);
case TREE_TYPE_LSTR:
// Already done \o/.
return doer->tree->data.lstr.val;
default:
DIE("Wrong type, FOOL!");
}
}
tree_t* blin_die(doer_t* doer) {
exit(1);
return NULL; // Doesn't really matter what happens here.
}
tree_t* blin_print(doer_t* doer) {
doer->tree = doer->tree->data.call.arg->data.carg.val;
char* strval = doer_eval_str(doer);
printf(
"%s",
strval
);
tree_t* lstr = tree_init(TREE_TYPE_LSTR, doer->tree->parent);
lstr->data.lstr.val = strval;
lstr->data.lstr.len = strlen(strval);
return lstr;
}
tree_t* blin_printl(doer_t* doer) {
tree_t* oldt = doer->tree;
doer->tree = doer->tree->data.call.arg->data.carg.val;
char* strval = doer_eval_str(doer);
printf(
"%s\n",
strval
);
tree_t* lstr = tree_init(TREE_TYPE_LSTR, oldt->parent);
lstr->data.lstr.val = strval;
lstr->data.lstr.len = strlen(strval);
return doer->tree;
}
tree_t* blin_str_cat(doer_t* doer) {
tree_t* oldt = doer->tree;
doer->tree = doer->tree->data.call.arg->data.carg.val;
char* str1 = doer_eval_str(doer);
doer->tree = oldt->data.call.arg->data.carg.nxt->data.carg.val;
char* str2 = doer_eval_str(doer);
char* val = emalloc(
sizeof(str1) +
sizeof(str2) -
sizeof(char)
);
strcpy(val, str1);
strcat(val, str2);
doer->tree = tree_init(TREE_TYPE_LSTR, oldt->parent);
doer->tree->data.lstr.val = val;
doer->tree->data.lstr.len = strlen(val);
return doer->tree;
}
void doer_do_block(doer_t* doer) {
if (!doer->tree) return;
tree_t* tree_root = doer->tree;
doer->tree = doer->tree->data.block.val;
doer_do_expr(doer);
doer->tree = tree_root->data.block.nxt;
doer_do_block(doer);
}
void doer_do_expr(doer_t* doer) {
switch (doer->tree->type) {
case TREE_TYPE_CALL:
doer_do_call(doer);
break;
case TREE_TYPE_DEF:
doer_do_def(doer);
break;
default:
LOG_WARF("Unknown tree type: %d", doer->tree->type);
}
}
void doer_do_def(doer_t* doer) {
tree_t* tag2 = doer->tree->data.def.tag->data.tag.nxt;
target_t* target = target_init(
tag2->data.tag.val, // HACK: Grab the 2nd tag's value, without
// checking if it's actually there…
doer->tree
);
doer_add_target(doer, target);
}
void doer_do_call(doer_t* doer) {
tree_t* oldt = doer->tree;
tree_t* blinrval = doer_do_call_blin(doer); // Could modify the *current*
// tree, but only if it's a
// blin.
if (blinrval) {
doer->tree = blinrval;
} else {
tree_t* newt = doer_find_target_from_call(doer->targets, oldt);
doer->tree = newt->data.def.val;
}
tree_destroy(oldt);
}
tree_t* doer_do_call_blin(doer_t* doer) {
// Search through built-in functions first.
for (int i = 0; i < sizeof(blinfs) / sizeof(blinf_t); i++) {
if (!strcmp(blinfs[i].name, doer->tree->data.call.target)) {
return (blinfs[i].fp)(doer);
}
}
return NULL;
}
// TODO: doer_do_call will check first doer_do_call_blin and then
// doer_do_call_def for user-defined functions. Will return a tree, which will
// replace the call in the tree.
//
// Maybe the parent should be set by the looping function?
|
