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
|
/* tree.c -- functions for manipulating parse-trees. (create, copy, scan) ($Revision: 1.1.1.1 $) */
#include "es.h"
#include "gc.h"
DefineTag(Tree1, static);
DefineTag(Tree2, static);
/* mk -- make a new node; used to generate the parse tree */
extern Tree *mk VARARGS1(NodeKind, t) {
va_list ap;
Tree *n;
gcdisable();
VA_START(ap, t);
switch (t) {
default:
panic("mk: bad node kind %d", t);
case nWord: case nQword: case nPrim:
n = gcalloc(offsetof(Tree, u[1]), &Tree1Tag);
n->u[0].s = va_arg(ap, char *);
break;
case nCall: case nThunk: case nVar:
n = gcalloc(offsetof(Tree, u[1]), &Tree1Tag);
n->u[0].p = va_arg(ap, Tree *);
break;
case nAssign: case nConcat: case nClosure: case nFor:
case nLambda: case nLet: case nList: case nLocal:
case nVarsub: case nMatch: case nExtract:
n = gcalloc(offsetof(Tree, u[2]), &Tree2Tag);
n->u[0].p = va_arg(ap, Tree *);
n->u[1].p = va_arg(ap, Tree *);
break;
case nRedir:
n = gcalloc(offsetof(Tree, u[2]), NULL);
n->u[0].p = va_arg(ap, Tree *);
n->u[1].p = va_arg(ap, Tree *);
break;
case nPipe:
n = gcalloc(offsetof(Tree, u[2]), NULL);
n->u[0].i = va_arg(ap, int);
n->u[1].i = va_arg(ap, int);
break;
}
n->kind = t;
va_end(ap);
Ref(Tree *, tree, n);
gcenable();
RefReturn(tree);
}
/*
* garbage collection functions
* these are segregated by size so copy doesn't have to check
* the type to figure out size.
*/
static void *Tree1Copy(void *op) {
void *np = gcalloc(offsetof(Tree, u[1]), &Tree1Tag);
memcpy(np, op, offsetof(Tree, u[1]));
return np;
}
static void *Tree2Copy(void *op) {
void *np = gcalloc(offsetof(Tree, u[2]), &Tree2Tag);
memcpy(np, op, offsetof(Tree, u[2]));
return np;
}
static size_t Tree1Scan(void *p) {
Tree *n = p;
switch (n->kind) {
default:
panic("Tree1Scan: bad node kind %d", n->kind);
case nPrim: case nWord: case nQword:
n->u[0].s = forward(n->u[0].s);
break;
case nCall: case nThunk: case nVar:
n->u[0].p = forward(n->u[0].p);
break;
}
return offsetof(Tree, u[1]);
}
static size_t Tree2Scan(void *p) {
Tree *n = p;
switch (n->kind) {
case nAssign: case nConcat: case nClosure: case nFor:
case nLambda: case nLet: case nList: case nLocal:
case nVarsub: case nMatch: case nExtract:
n->u[0].p = forward(n->u[0].p);
n->u[1].p = forward(n->u[1].p);
break;
default:
panic("Tree2Scan: bad node kind %d", n->kind);
}
return offsetof(Tree, u[2]);
}
|
