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
|
#include <lcq/pit/runtime/dump.h>
typedef bool (*pit_dump_callback)(char *buf, i64 len, void *data);
i64 pit_dump_with_callback(
pit_runtime *rt, char *start, i64 buf_len, pit_value top, bool readable,
pit_dump_callback cb, void *data
) {
i64 traversal_reset = rt->traversal->next;
char *buf = start;
char *end = start + buf_len;
pit_value_heavy *h = NULL;
pit_traversal_push_value(rt, rt->traversal, top);
while (rt->traversal->next > traversal_reset) {
pit_traversal_entry ent;
i64 len = (i64) (end - buf);
if (rt->error != PIT_NIL) goto end;
if (pit_vec_pop(pit_traversal_entry)(rt->traversal, &ent) < 0)
pit_error(rt, "dump stack underflow");
if (rt->error != PIT_NIL) goto end;
switch (ent.sort) {
case PIT_TRAVERSAL_ENTRY_DUMP_STRING: {
for (char *s = ent.in.dump_string; *s != 0 && buf < end; ++s) *(buf++) = *s;
break;
}
case PIT_TRAVERSAL_ENTRY_VALUE: {
pit_value v = ent.in.value;
switch (pit_value_sort(v)) {
case PIT_VALUE_SORT_DOUBLE:
#ifndef PIT_NO_DOUBLE
buf += pit_libc_string_snprintf(buf, (size_t) len, "%lf", pit_value_as_double(rt, v));
#else
buf += pit_string_snprintf(buf, (size_t) len, "<unsupported double>");
#endif
break;
case PIT_VALUE_SORT_INTEGER:
buf += pit_libc_string_snprintf(buf, (size_t) len, "%ld", pit_value_as_integer(rt, v));
break;
case PIT_VALUE_SORT_SYMBOL: {
pit_symtab_entry *se = pit_symtab_lookup(rt, v);
if (se
&& pit_value_sort(se->name) == PIT_VALUE_SORT_REF
&& (h = pit_value_ref_deref(rt, pit_value_as_ref(rt, se->name)))
) {
i64 i = 0;
for (; i < h->in.bytes.len && i < len - 1; ++i) {
buf[i] = (char) h->in.bytes.data[i];
}
buf += i;
} else {
buf += pit_libc_string_snprintf(buf, (size_t) len, "<broken symbol %ld>", pit_value_as_symbol(rt, v));
}
break;
}
case PIT_VALUE_SORT_REF: {
pit_ref r = pit_value_as_ref(rt, v);
h = pit_value_ref_deref(rt, r);
if (!h) pit_libc_string_snprintf(buf, (size_t) len, "<ref %ld>", r);
else {
switch (h->hsort) {
case PIT_VALUE_HEAVY_SORT_CELL: {
pit_traversal_push_dump_string(rt, rt->traversal, "}");
pit_traversal_push_value(rt, rt->traversal, h->in.cell);
pit_traversal_push_dump_string(rt, rt->traversal, "{");
break;
}
case PIT_VALUE_HEAVY_SORT_CONS: {
i64 expr_stack_reset = rt->expr_stack->next;
pit_value xs = v;
bool first = true;
while (xs != PIT_NIL && pit_value_is_cons(rt, xs)) {
if (pit_vec_push(pit_value)(rt->expr_stack, pit_value_cons_car(rt, xs)) < 0) {
pit_error(rt, "dump expr stack overflow");
goto end;
}
xs = pit_value_cons_cdr(rt, xs);
}
pit_traversal_push_dump_string(rt, rt->traversal, ")");
if (xs != PIT_NIL) {
pit_traversal_push_value(rt, rt->traversal, xs);
pit_traversal_push_dump_string(rt, rt->traversal, " . ");
}
while (rt->expr_stack->next > expr_stack_reset) {
if (first) first = false;
else pit_traversal_push_dump_string(rt, rt->traversal, " ");
pit_value x = PIT_NIL;
if (pit_vec_pop(pit_value)(rt->expr_stack, &x) < 0) {
pit_error(rt, "dump expr stack underflow");
goto end;
}
pit_traversal_push_value(rt, rt->traversal, x);
}
pit_traversal_push_dump_string(rt, rt->traversal, "(");
rt->expr_stack->next = expr_stack_reset;
break;
}
case PIT_VALUE_HEAVY_SORT_ARRAY: {
bool first = true;
pit_traversal_push_dump_string(rt, rt->traversal, "]");
for (i64 i = h->in.array.len - 1; i >= 0; --i) {
if (first) first = false;
else pit_traversal_push_dump_string(rt, rt->traversal, " ");
pit_traversal_push_value(rt, rt->traversal, h->in.array.data[i]);
}
pit_traversal_push_dump_string(rt, rt->traversal, "[");
break;
}
case PIT_VALUE_HEAVY_SORT_BYTES: {
i64 i = 0;
if (readable) { buf[i++] = '"'; }
i64 maxlen = len - i;
for (i64 j = 0; i < maxlen && j < h->in.bytes.len;) {
if (buf[i - 1] != '\\' && (h->in.bytes.data[j] == '\\' || h->in.bytes.data[j] == '"')) {
buf[i++] = '\\';
}
else {
buf[i++] = (char) h->in.bytes.data[j++];
}
}
if (readable && i < len - 1) buf[i++] = '"';
buf += i;
break;
}
default:
buf += pit_libc_string_snprintf(buf, (size_t) len, "<ref %ld>", r);
}
}
break;
}
}
break;
}
default:
pit_error(rt, "unexpected traversal entry"); goto end;
}
}
end:
rt->traversal->next = traversal_reset;
return (i64) (buf - start);
}
i64 pit_dump(pit_runtime *rt, char *buf, i64 len, pit_value v, bool readable) {
return pit_dump_with_callback(rt, buf, len, v, readable, NULL, NULL);
}
|
