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
|
/*
* Copyright © 2016 Keith Packard <keithp@keithp.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*/
#include "ao_lisp.h"
#include <stdarg.h>
static void
ao_lisp_error_poly(char *name, ao_poly poly)
{
int first = 1;
printf("\t\t%s(", name);
if (ao_lisp_poly_type(poly) == AO_LISP_CONS) {
struct ao_lisp_cons *cons = ao_lisp_poly_cons(poly);
if (cons) {
while (cons) {
if (!first)
printf("\t\t ");
else
first = 0;
ao_lisp_poly_print(cons->car);
printf("\n");
cons = ao_lisp_poly_cons(cons->cdr);
}
printf("\t\t )\n");
} else
printf(")\n");
} else {
ao_lisp_poly_print(poly);
printf("\n");
}
}
static void tabs(int indent)
{
while (indent--)
printf("\t");
}
static void
ao_lisp_error_frame(int indent, char *name, struct ao_lisp_frame *frame)
{
int f;
tabs(indent);
printf ("%s{", name);
if (frame) {
for (f = 0; f < ao_lisp_frame_num(frame); f++) {
if (f != 0) {
tabs(indent);
printf(" ");
}
ao_lisp_poly_print(frame->vals[f].atom);
printf(" = ");
ao_lisp_poly_print(frame->vals[f].val);
printf("\n");
}
if (frame->prev)
ao_lisp_error_frame(indent + 1, "prev: ", ao_lisp_poly_frame(frame->prev));
}
tabs(indent);
printf(" }\n");
}
static const char *state_names[] = {
"sexpr",
"val",
"formal",
"exec",
"cond",
"cond_test",
"progn",
};
void
ao_lisp_stack_print(void)
{
struct ao_lisp_stack *s;
printf("Value: "); ao_lisp_poly_print(ao_lisp_v); printf("\n");
printf("Stack:\n");
for (s = ao_lisp_stack; s; s = ao_lisp_poly_stack(s->prev)) {
printf("\t[\n");
printf("\t\texpr: "); ao_lisp_poly_print(s->list); printf("\n");
printf("\t\tstate: %s\n", state_names[s->state]);
// printf("\t\tmacro: %s\n", s->macro ? "true" : "false");
ao_lisp_error_poly ("sexprs: ", s->sexprs);
ao_lisp_error_poly ("values: ", s->values);
ao_lisp_error_frame(2, "frame: ", ao_lisp_poly_frame(s->frame));
// ao_lisp_error_frame(2, "mframe: ", ao_lisp_poly_frame(s->macro_frame));
printf("\t]\n");
}
}
ao_poly
ao_lisp_error(int error, char *format, ...)
{
va_list args;
ao_lisp_exception |= error;
va_start(args, format);
vprintf(format, args);
va_end(args);
printf("\n");
ao_lisp_stack_print();
printf("Globals:\n\t");
ao_lisp_frame_print(ao_lisp_frame_poly(ao_lisp_frame_global));
printf("\n");
return AO_LISP_NIL;
}
|
