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
|
#include <lcq/pit/utils.h>
#include <lcq/pit/runtime/dump.h>
pit_dump_condition pit_dump_with_callback(
pit_runtime *rt, pit_value top, bool readable,
pit_dump_callback write, void *data
) {
char buf[1024];
i64 len = (i64) sizeof(buf);
i64 slen = 0;
i64 traversal_reset = rt->traversal->next;
pit_value_heavy *h = NULL;
pit_dump_condition ret = PIT_DUMP_CONDITION_NORMAL;
pit_traversal_push_value(rt, rt->traversal, top);
while (rt->traversal->next > traversal_reset) {
pit_traversal_entry ent;
if (pit_vec_pop(pit_traversal_entry)(rt->traversal, &ent) < 0) {
ret = PIT_DUMP_CONDITION_STACK_UNDERFLOW;
goto end;
}
switch (ent.sort) {
case PIT_TRAVERSAL_ENTRY_DUMP_STRING: {
if ((ret = write((u8 *) ent.in.dump_string, (i64) pit_libc_string_strlen(ent.in.dump_string), data)) < 0) goto end;
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
slen = pit_libc_string_snprintf(buf, (size_t) len, "%lf", pit_value_as_double(rt, v));
#else
slen = pit_libc_string_snprintf(buf, (size_t) len, "<unsupported double>");
#endif
if ((ret = write((u8 *) buf, slen, data)) < 0) goto end;
break;
case PIT_VALUE_SORT_INTEGER:
slen = pit_libc_string_snprintf(buf, (size_t) len, "%ld", pit_value_as_integer(rt, v));
if ((ret = write((u8 *) buf, slen, data)) < 0) goto end;
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)))
) {
if ((ret = write(h->in.bytes.data, h->in.bytes.len, data)) < 0) goto end;
} else {
slen = pit_libc_string_snprintf(buf, (size_t) len, "<broken symbol %ld>", pit_value_as_symbol(rt, v));
if ((ret = write((u8 *) buf, slen, data)) < 0) goto end;
}
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);
if ((ret = write((u8 *) buf, slen, data)) < 0) goto end;
} 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) {
ret = PIT_DUMP_CONDITION_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) {
ret = PIT_DUMP_CONDITION_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++] = '"';
if ((ret = write((u8 *) buf, i, data)) < 0) goto end;
break;
}
default:
slen = pit_libc_string_snprintf(buf, (size_t) len, "<ref %ld>", r);
if ((ret = write((u8 *) buf, slen, data)) < 0) goto end;
}
}
break;
}
}
break;
}
default:
ret = PIT_DUMP_CONDITION_MALFORMED_TRAVERSAL;
goto end;
}
}
end:
rt->traversal->next = traversal_reset;
return ret;
}
struct pit_dump_to_buf_closure {
char *buf;
i64 len;
i64 off;
};
static pit_dump_condition pit_dump_to_buf_callback(u8 *buf, i64 len, void *data) {
struct pit_dump_to_buf_closure *cl = (struct pit_dump_to_buf_closure *) data;
i64 i = 0;
for (; i < len && cl->off + i < cl->len; ++i) {
cl->buf[cl->off + i] = (char) buf[i];
}
cl->off += i;
if (cl->len - cl->off < len) return PIT_DUMP_CONDITION_FULL;
return PIT_DUMP_CONDITION_NORMAL;
}
i64 pit_dump(pit_runtime *rt, char *buf, i64 len, pit_value v, bool readable) {
struct pit_dump_to_buf_closure cl;
cl.buf = buf;
cl.len = len;
cl.off = 0;
pit_dump_with_callback(rt, v, readable, pit_dump_to_buf_callback, &cl);
return cl.off;
}
|
