-
Notifications
You must be signed in to change notification settings - Fork 1
/
svg.c
279 lines (234 loc) · 7.12 KB
/
svg.c
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
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
#define _POSIX_C_SOURCE 200809L
#include "parse.h"
#include "svg.h"
#include "layout.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define CHAR_WIDTH 8.4
#define TEXT_PX 14.0
#define CHAR_HEIGHT 13.0
#define BOX_HEIGHT 17.0
static const char* svg_header =
"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>"
"<svg"
" xmlns:rdf=\"http://www.w3.org/1999/02/22-rdf-syntax-ns#\""
" xmlns:svg=\"http://www.w3.org/2000/svg\""
" xmlns=\"http://www.w3.org/2000/svg\""
" width=\"1000\""
" height=\"1000\""
" id=\"svg2\""
" version=\"1.1\">";
static const char* svg_rect =
" <rect"
" style=\"color:#000000;fill:none;stroke:#000000;stroke-width:1;\""
" width=\"%f\""
" height=\"%f\""
" x=\"%f\""
" y=\"%f\" />";
static const char* svg_text =
" <text"
" xml:space=\"preserve\""
" style=\"font-size:%fpx;color:#000000;fill:#000000;stroke:none;font-family:Courier;\""
" x=\"%f\""
" y=\"%f\">"
"<tspan"
" x=\"%f\""
" y=\"%f\">%s</tspan></text>";
static const char* svg_line =
" <line style=\"stroke:rgb(255,0,0);stroke-width:2\""
" x1=\"%f\""
" y1=\"%f\""
" x2=\"%f\""
" y2=\"%f\" />";
static const char* svg_footer = "</svg>";
static void add_child_node(struct label *parent, struct label *child) {
struct label* last_child = parent->first_child;
if (!last_child) {
parent->first_child = child;
return;
}
child->number = 1;
while (last_child->next_sibling) {
last_child = last_child->next_sibling;
child->number ++;
}
child->prev_sibling = last_child;
last_child->next_sibling = child;
}
static char* xml_escape(const char* str) {
int len = 0;
for (const char* cur = str; *cur; ++cur) {
if (*cur == '&') {
/* & */
len += 5;
} else if (*cur == '<' || *cur == '>') {
/* < */
len+=4;
} else {
len++;
}
}
char* result = malloc(len + 1);
char* end = result;
for (const char* cur = str; *cur; ++cur) {
if (*cur == '&') {
strcpy(end, "&");
end += 5;
} else if (*cur == '<') {
strcpy(end, "<");
end += 4;
} else if (*cur == '>') {
strcpy(end, ">");
end += 4;
} else {
*end++ = *cur;
}
}
*end = 0;
return result;
}
static struct label* make_label(struct parse_tree_node* node,
struct label *parent) {
struct label* label = malloc(sizeof(struct label));
label->parent = parent;
label->first_child = 0;
label->next_sibling = 0;
label->prev_sibling = 0;
label->thread = 0;
label->ancestor = label;
label->number = 0;
label->modifier = label->change = label->shift = 0;
switch (node->op) {
case LITERAL_OR_ID:
label->text = strdup(node->text);
break;
case TYPECAST:
label->text = malloc(strlen(node->text) + 3);
sprintf(label->text, "(%s)", node->text);
break;
case FUNCTION_CALL:
label->text = strdup("function call");
break;
default:
label->text = strdup(token_names[node->op]);
break;
}
label->width = (strlen(label->text) + 2) * CHAR_WIDTH;
char* old_text = label->text;
label->text = xml_escape(old_text);
free(old_text);
label->xcoord = 500;
label->ycoord = 0;
label->modifier = 0;
return label;
}
static struct label* get_label_tree(struct parse_tree_node* node,
struct label *parent) {
//to parse a node, we need to create a label for it,
struct label* label = make_label(node, parent);
if (node->first_child) {
add_child_node(label, get_label_tree(node->first_child, label));
struct parse_tree_node* cur = node->first_child->next_sibling;
while (cur) {
add_child_node(label, get_label_tree(cur, label));
cur = cur->next_sibling;
}
}
return label;
}
static void realloc_if_necessary(char** p, int* allocated, int new_size) {
if (*allocated > new_size) {
return;
}
while (*allocated < new_size) {
*allocated *= 2;
}
*p = realloc(*p, *allocated);
}
struct queue {
struct label* label;
struct queue* next;
};
static struct label* next(struct label* node) {
if (node->first_child) {
return node->first_child;
}
if (node->next_sibling) {
return node->next_sibling;
}
while (node->parent) {
if (node->parent->next_sibling)
return node->parent->next_sibling;
node = node->parent;
}
return 0;
}
static double max(double a, double b) {
return a > b ? a : b;
}
static char* tree_to_svg(struct label* tree) {
int allocated = 1024;
char* svg = malloc(allocated);
int used = strlen(svg_header);
realloc_if_necessary(&svg, &allocated, used);
strcpy(svg, svg_header);
int rect_len = strlen(svg_rect);
int text_len = strlen(svg_text);
int line_len = strlen(svg_line);
int buf_size = max(max(rect_len, text_len), line_len) + 5 * 15 + 1;
char svg_buf[buf_size];
struct label* label = tree;
do {
double width = label->width;
double x = label->xcoord - width / 2;
double y = label->ycoord;
if (label->parent) {
double parent_width = label->parent->width;
double parent_x = label->parent->xcoord - parent_width / 2;
double parent_y = label->parent->ycoord;
int needed = sprintf(svg_buf, svg_line, x + width / 2,
y, parent_x + parent_width / 2,
parent_y + BOX_HEIGHT);
realloc_if_necessary(&svg, &allocated, used + needed);
strcpy(svg + used, svg_buf);
used += needed;
}
int needed = sprintf(svg_buf, svg_rect, width, BOX_HEIGHT, x, y);
realloc_if_necessary(&svg, &allocated, used + needed);
strcpy(svg + used, svg_buf);
used += needed;
x += CHAR_WIDTH;
y += CHAR_HEIGHT;
needed = sprintf(svg_buf, svg_text, TEXT_PX, x, y, x, y, label->text);
realloc_if_necessary(&svg, &allocated, used + needed);
strcpy(svg + used, svg_buf);
used += needed;
label = next(label);
} while (label);
int needed = strlen(svg_footer);
realloc_if_necessary(&svg, &allocated, used + needed);
strcpy(svg + used, svg_footer);
used += needed;
return svg;
}
static void free_label_tree(struct label* label) {
struct label* child = label->first_child;
while (child) {
struct label* next_child = child->next_sibling;
free(child);
child = next_child;
}
free(label);
}
char* parse_tree_to_svg(struct parse_tree_node* node) {
struct label* label = get_label_tree(node, 0);
struct walker_layout_rules rules;
rules.sibling_separation = 10;
rules.subtree_separation = 20;
rules.level_separation = 30;
walker_layout(label, &rules);
char* svg = tree_to_svg(label);
free_label_tree(label);
return svg;
}