blob: c2db0cc6c88092521cbbb260c5eab03259ef2e7b (
plain) (
blame)
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 "include/doer.h"
#include "include/tree.h"
#include "include/util.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;
}
/*
:str:var = "Hello"
printl.var
*/
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).
// Assume there is only 1 target in the target list.
switch (doer->tree->type) {
case TREE_TYPE_CALL:
// Assume there is only 1 target in the target list.
doer->tree = doer->ltarget->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!");
}
}
void blin_die(doer_t* doer) {
DIE(":(\nYour PC ran into a\n");
}
void blin_print(doer_t* doer) {
doer->tree = doer->tree->data.call.arg->data.carg.val;
printf(
"%s",
doer_eval_str(doer)
);
}
void blin_printl(doer_t* doer) {
doer->tree = doer->tree->data.call.arg->data.carg.val;
printf(
"%s\n",
doer_eval_str(doer)
);
}
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) {
target_t* target = target_init(
doer->tree-> // HACK: Grab the 2nd tag's value (w/o checking if
// it's actually there…).
data.def.tag->
data.tag.nxt->
data.tag.val,
doer->tree
);
doer_add_target(doer, target);
}
void doer_do_call(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)) {
(blinfs[i].fp)(doer);
return;
}
}
// Search through targets next.
LOG_DBGF("got %s", doer->ltarget->tree->data.def.tag->data.tag.nxt->data.tag.val);
}
|
