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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
|
/*
* Copyright (C) 2000, Imperial College
*
* This file is part of the Imperial College Exact Real Arithmetic Library.
* See the copyright notice included in the distribution for conditions
* of use.
*/
#include <stdio.h>
#include "real.h"
#include "real-impl.h"
/*
* The ``abstract machine'' uses a single stack to record what work needs
* to be done. Each frame is consists of a pointer to a force function
* and the arguments to the force function.
*/
unsigned *stack;
unsigned *stackBound;
unsigned *sp;
void
initStack()
{
if ((stack = (unsigned *) malloc(stackSize * sizeof(unsigned))) == NULL)
Error(FATAL, E_INT, "initStack", "malloc failed");
sp = stack - 1;
stackBound = stack + stackSize;
}
void
runStack()
{
void (*f)();
void dumpTopOfStack();
#ifdef DAVINCI
runStackViaDaVinci();
#else
while (sp >= stack) {
#ifdef TRACE
if (TRACE)
dumpTopOfStack();
#endif
f = (void (*)()) POP;
(*f)();
}
#endif
}
/*
* Retrieves the descriptor for the top of the stack.
*/
ForceFuncDesc *
getDescForTOS()
{
ForceFuncDesc *p;
p = getDescForForceFunc((void (*)()) *sp);
if (p == NULL) {
debugp("", "tos = %x\n", (unsigned) *sp);
Error(FATAL, E_INT, "getDescForTOS", "failed to find %x", (void *) *sp);
}
return p;
}
void
dumpStack()
{
unsigned *p;
ForceFuncDesc *d;
for (p = sp; p >= stack; p--) {
fprintf(stderr, "%x %d", *p, *p);
d = getDescForForceFunc((void (*)()) *p);
if (d != NULL)
fprintf(stderr, " %s", d->funcName);
fprintf(stderr, "\n");
}
}
void
dumpTopOfStack()
{
ForceFuncDesc *q;
unsigned *sp1;
if (sp >= stack) {
q = getDescForTOS();
/*
* If there are not the expected number of arguments on the stack
* then we dump what we can and then bail out.
*/
if (sp - stack < q->nArgs - 1) {
fprintf(stderr, "%s ", q->funcName);
for (sp1 = sp - 1; sp1 >= stack; sp1--)
fprintf(stderr, "%x ", *sp1);
fprintf(stderr, "\n");
Error(FATAL, E_INT, "dumpTopOfStack", "stack underflow");
}
switch (q->nArgs) {
case 2 :
debugp(q->funcName, "%x", (unsigned) *(sp - 1));
break;
case 3 :
debugp(q->funcName, "%x %d", (unsigned) *(sp - 1),
(unsigned) *(sp - 2));
break;
case 4 :
debugp(q->funcName, "%x %x %d", (unsigned) *(sp - 1),
(unsigned) *(sp - 2),
(unsigned) *(sp - 3));
break;
default :
break;
}
fprintf(stderr, "\n");
}
}
/*
* The following function will highlight the edge in the daVinci
* window associated with the frame at the top of the stack. This is
* called after a new frame is pushed.
*/
void
highlightTOS()
{
ForceFuncDesc *p;
Real x;
p = getDescForTOS();
x = (Real) (*(sp - 1));
switch (x->gen.tag.type) {
case ALT :
break;
case VECTOR :
break;
case MATX :
highlightEdge(&x->gen, &((MatX *) x)->x->gen, 0);
break;
case TENXY :
if (isLeftFunc(p))
highlightEdge(&x->gen, &((TenXY *) x)->x->gen, 0);
else {
if (isRightFunc(p))
highlightEdge(&x->gen, &((TenXY *) x)->y->gen, 1);
}
break;
case DIGSX :
highlightEdge(&x->gen, &((DigsX *) x)->x->gen, 0);
break;
case SIGNX :
highlightEdge(&x->gen, &((SignX *) x)->x->gen, 0);
break;
case CLOSURE :
break;
case BOOLX :
highlightEdge(&x->gen, (Generic *)&((BoolX *) x)->x->gen, 0);
break;
case BOOLXY :
if (isLeftFunc(p))
highlightEdge(&x->gen, (Generic *)&((BoolXY *) x)->x->gen, 0);
else {
if (isRightFunc(p))
highlightEdge(&x->gen, (Generic *)&((BoolXY *) x)->y->gen, 1);
}
break;
case PREDX :
highlightEdge(&x->gen, &((PredX *) x)->x->gen, 0);
break;
default :
Error(FATAL, E_INT, "highlightTOS", "object has unknown type");
}
}
void
unhighlightTOS()
{
ForceFuncDesc *p;
Real x;
p = getDescForTOS();
x = (Real) (*(sp - 1));
switch (x->gen.tag.type) {
case ALT :
break;
case VECTOR :
break;
case MATX :
unhighlightEdge(&x->gen, &((MatX *) x)->x->gen, 0);
break;
case TENXY :
if (isLeftFunc(p))
unhighlightEdge(&x->gen, &((TenXY *) x)->x->gen, 0);
else {
if (isRightFunc(p))
unhighlightEdge(&x->gen, &((TenXY *) x)->y->gen, 1);
}
break;
case DIGSX :
unhighlightEdge(&x->gen, &((DigsX *) x)->x->gen, 0);
break;
case SIGNX :
unhighlightEdge(&x->gen, &((SignX *) x)->x->gen, 0);
break;
case CLOSURE :
break;
case BOOLX :
unhighlightEdge(&x->gen, (Generic *)&((BoolX *) x)->x->gen, 0);
break;
case BOOLXY :
if (isLeftFunc(p))
unhighlightEdge(&x->gen, (Generic *)&((BoolXY *) x)->x->gen, 0);
else
if (isRightFunc(p))
unhighlightEdge(&x->gen, (Generic *)&((BoolXY *) x)->y->gen, 1);
break;
case PREDX :
unhighlightEdge(&x->gen, &((PredX *) x)->x->gen, 0);
break;
default :
Error(FATAL, E_INT, "unhighlightTOS", "object has unknown type");
}
}
int
isLeftFunc(ForceFuncDesc *p)
{
return (p->argXOrY == ARG_X);
}
int
isRightFunc(ForceFuncDesc *p)
{
return (p->argXOrY == ARG_Y);
}
|
