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
|
/*
#include <stdarg.h>
#include <stdio.h>
#include <string.h>
*/
#include <stdlib.h>
#include "types.h"
// Env
Env *new_env(Env *outer, MalVal* binds, MalVal *exprs) {
Env *e = malloc(sizeof(Env));
e->table = g_hash_table_new(g_str_hash, g_str_equal);
e->outer = outer;
if (binds && exprs) {
assert_type(binds, MAL_LIST|MAL_VECTOR,
"new_env called with non-sequential bindings");
assert_type(exprs, MAL_LIST|MAL_VECTOR,
"new_env called with non-sequential expressions");
int binds_len = _count(binds),
exprs_len = _count(exprs),
varargs = 0, i;
for (i=0; i<binds_len; i++) {
if (i > exprs_len) { break; }
if (_nth(binds, i)->val.string[0] == '&') {
varargs = 1;
env_set(e, _nth(binds, i+1), _slice(exprs, i, _count(exprs)));
break;
} else {
env_set(e, _nth(binds, i), _nth(exprs, i));
}
}
assert(varargs || (binds_len == exprs_len),
"Arity mismatch: %d formal params vs %d actual params",
binds_len, exprs_len);
}
return e;
}
Env *env_find(Env *env, MalVal *key) {
void *val = g_hash_table_lookup(env->table, key->val.string);
if (val) {
return env;
} else if (env->outer) {
return env_find(env->outer, key);
} else {
return NULL;
}
}
MalVal *env_get(Env *env, MalVal *key) {
Env *e = env_find(env, key);
assert(e, "'%s' not found", key->val.string);
return g_hash_table_lookup(e->table, key->val.string);
}
Env *env_set(Env *env, MalVal *key, MalVal *val) {
g_hash_table_insert(env->table, key->val.string, val);
return env;
}
|
