Root/
Source at commit d4c4031b9afeb0a1509767bcbfec8a5248cb9866 created 13 years 9 months ago. By werner, Added support for reordering frames in the GUI. | |
---|---|
1 | /* |
2 | * dump.c - Dump objects in the native FPD format |
3 | * |
4 | * Written 2009, 2010 by Werner Almesberger |
5 | * Copyright 2009, 2010 by Werner Almesberger |
6 | * |
7 | * This program is free software; you can redistribute it and/or modify |
8 | * it under the terms of the GNU General Public License as published by |
9 | * the Free Software Foundation; either version 2 of the License, or |
10 | * (at your option) any later version. |
11 | */ |
12 | |
13 | |
14 | #include <stdlib.h> |
15 | #include <stdio.h> |
16 | #include <string.h> |
17 | #include <sys/types.h> |
18 | |
19 | #include "util.h" |
20 | #include "unparse.h" |
21 | #include "obj.h" |
22 | #include "gui_status.h" |
23 | #include "dump.h" |
24 | |
25 | |
26 | /* ----- order items ------------------------------------------------------- */ |
27 | |
28 | |
29 | static void add_item(struct order **curr, struct vec *vec, struct obj *obj) |
30 | { |
31 | (*curr)->vec = vec; |
32 | (*curr)->obj = obj; |
33 | (*curr)++; |
34 | } |
35 | |
36 | |
37 | static int n_vec_refs(const struct vec *vec) |
38 | { |
39 | const struct vec *walk; |
40 | int n; |
41 | |
42 | n = 0; |
43 | for (walk = vec->frame->vecs; walk; walk = walk->next) |
44 | if (walk->base == vec) |
45 | n++; |
46 | return n; |
47 | } |
48 | |
49 | |
50 | /* |
51 | * If "prev" is non-NULL, we're looking for objects that need to be put after |
52 | * the current vector (in "prev"). Only those objects need to be put there |
53 | * that have at least one base that isn't the frame's origin. |
54 | * |
55 | * We could also make an exception for manually named vectors, but we get |
56 | * better clustering without. |
57 | */ |
58 | |
59 | static int need(const struct vec *base, const struct vec *prev) |
60 | { |
61 | if (!base) |
62 | return 0; |
63 | #if 0 |
64 | if (base->name && *base->name != '_') |
65 | return 0; |
66 | #endif |
67 | if (prev) |
68 | return base == prev; |
69 | return 1; |
70 | } |
71 | |
72 | |
73 | /* |
74 | * If we need a vector that's defined later, we have to defer dumping the |
75 | * object. |
76 | */ |
77 | |
78 | static int later(const struct vec *base, const struct vec *prev) |
79 | { |
80 | return base && !base->dumped; |
81 | #if 0 |
82 | while (1) { |
83 | prev = prev->next; |
84 | if (!prev) |
85 | break; |
86 | if (base == prev) |
87 | return 1; |
88 | } |
89 | return 0; |
90 | #endif |
91 | } |
92 | |
93 | |
94 | static int may_put_obj_now(const struct obj *obj, const struct vec *prev) |
95 | { |
96 | int n, l; |
97 | |
98 | n = need(obj->base, prev); |
99 | l = later(obj->base, prev); |
100 | |
101 | switch (obj->type) { |
102 | case ot_frame: |
103 | break; |
104 | case ot_line: |
105 | n |= need(obj->u.line.other, prev); |
106 | l |= later(obj->u.line.other, prev); |
107 | break; |
108 | case ot_rect: |
109 | n |= need(obj->u.rect.other, prev); |
110 | l |= later(obj->u.rect.other, prev); |
111 | break; |
112 | case ot_pad: |
113 | n |= need(obj->u.pad.other, prev); |
114 | l |= later(obj->u.pad.other, prev); |
115 | break; |
116 | case ot_hole: |
117 | n |= need(obj->u.hole.other, prev); |
118 | l |= later(obj->u.hole.other, prev); |
119 | break; |
120 | case ot_arc: |
121 | n |= need(obj->u.arc.start, prev); |
122 | n |= need(obj->u.arc.end, prev); |
123 | l |= later(obj->u.arc.start, prev); |
124 | l |= later(obj->u.arc.end, prev); |
125 | break; |
126 | case ot_meas: |
127 | return 0; |
128 | default: |
129 | abort(); |
130 | } |
131 | |
132 | return n && !l; |
133 | } |
134 | |
135 | |
136 | static void put_obj(struct order **curr, struct obj *obj, |
137 | struct vec *prev) |
138 | { |
139 | if (obj->dumped) |
140 | return; |
141 | obj->dumped = 1; |
142 | add_item(curr, prev, obj); |
143 | } |
144 | |
145 | /* |
146 | * Tricky logic ahead: when dumping a vector, we search for a vector that |
147 | * depends on that vector for ".". If we find one, we dump it immediately after |
148 | * this vector. |
149 | */ |
150 | |
151 | static void recurse_vec(struct order **curr, struct vec *vec) |
152 | { |
153 | struct vec *next; |
154 | struct obj *obj; |
155 | |
156 | vec->dumped = 1; |
157 | add_item(curr, vec, NULL); |
158 | for (obj = vec->frame->objs; obj; obj = obj->next) |
159 | if (may_put_obj_now(obj, vec)) |
160 | put_obj(curr, obj, vec); |
161 | if (n_vec_refs(vec) == 1) { |
162 | for (next = vec->next; next->base != vec; next = next->next); |
163 | recurse_vec(curr, next); |
164 | } |
165 | } |
166 | |
167 | |
168 | static void order_vecs(struct order **curr, struct vec *vecs) |
169 | { |
170 | struct vec *vec; |
171 | |
172 | for (vec = vecs; vec; vec = vec->next) |
173 | if (!vec->base || n_vec_refs(vec->base) != 1) |
174 | recurse_vec(curr, vec); |
175 | } |
176 | |
177 | |
178 | struct order *order_frame(const struct frame *frame) |
179 | { |
180 | struct order *order, *curr; |
181 | struct vec *vec; |
182 | struct obj *obj; |
183 | int n = 0; |
184 | |
185 | for (vec = frame->vecs; vec; vec = vec->next) |
186 | n++; |
187 | for (obj = frame->objs; obj; obj = obj->next) |
188 | if (obj->type != ot_meas) |
189 | n++; |
190 | |
191 | for (vec = frame->vecs; vec; vec = vec->next) |
192 | vec->dumped = 0; |
193 | for (obj = frame->objs; obj; obj = obj->next) |
194 | obj->dumped = 0; |
195 | |
196 | order = alloc_size(sizeof(*order)*(n+1)); |
197 | curr = order; |
198 | |
199 | order_vecs(&curr, frame->vecs); |
200 | |
201 | /* frames based on @ (anything else ?) */ |
202 | for (obj = frame->objs; obj; obj = obj->next) |
203 | if (obj->type != ot_meas) |
204 | put_obj(&curr, obj, NULL); |
205 | |
206 | assert(curr == order+n); |
207 | add_item(&curr, NULL, NULL); |
208 | |
209 | return order; |
210 | } |
211 | |
212 | |
213 | /* ----- variables --------------------------------------------------------- */ |
214 | |
215 | |
216 | static void dump_var(FILE *file, const struct table *table, |
217 | const char *indent) |
218 | { |
219 | char *s; |
220 | |
221 | s = unparse(table->rows->values->expr); |
222 | fprintf(file, "%sset %s = %s\n\n", indent, table->vars->name, s); |
223 | free(s); |
224 | } |
225 | |
226 | |
227 | static void dump_table(FILE *file, const struct table *table, |
228 | const char *indent) |
229 | { |
230 | const struct var *var; |
231 | const struct row *row; |
232 | const struct value *value; |
233 | char *s; |
234 | |
235 | if (table->vars && !table->vars->next && |
236 | table->rows && !table->rows->next) { |
237 | dump_var(file, table, indent); |
238 | return; |
239 | } |
240 | fprintf(file, "%stable\n%s {", indent, indent); |
241 | for (var = table->vars; var; var = var->next) |
242 | fprintf(file, "%s %s", var == table->vars ? "" : ",", |
243 | var->name); |
244 | fprintf(file, " }\n"); |
245 | for (row = table->rows; row; row = row->next) { |
246 | fprintf(file, "%s {", indent); |
247 | for (value = row->values; value; value = value->next) { |
248 | s = unparse(value->expr); |
249 | fprintf(file, "%s %s", |
250 | value == row->values? "" : ",", s); |
251 | free(s); |
252 | } |
253 | fprintf(file, " }\n"); |
254 | } |
255 | fprintf(file, "\n"); |
256 | } |
257 | |
258 | |
259 | static void dump_loop(FILE *file, const struct loop *loop, const char *indent) |
260 | { |
261 | char *from, *to; |
262 | |
263 | from = unparse(loop->from.expr); |
264 | to = unparse(loop->to.expr); |
265 | fprintf(file, "%sloop %s = %s, %s\n\n", |
266 | indent, loop->var.name, from, to); |
267 | free(from); |
268 | free(to); |
269 | } |
270 | |
271 | |
272 | /* ----- vectors and objects ----------------------------------------------- */ |
273 | |
274 | |
275 | static void generate_name(struct vec *base) |
276 | { |
277 | char tmp[10]; /* plenty */ |
278 | const char *s; |
279 | struct vec *walk; |
280 | int n = 0; |
281 | |
282 | while (1) { |
283 | sprintf(tmp, "__%d", n); |
284 | s = unique(tmp); |
285 | for (walk = base->frame->vecs; walk; walk = walk->next) |
286 | if (walk->name == s) |
287 | break; |
288 | if (!walk) |
289 | break; |
290 | n++; |
291 | } |
292 | base->name = s; |
293 | } |
294 | |
295 | |
296 | static const char *base_name(struct vec *base, const struct vec *next) |
297 | { |
298 | if (!base) |
299 | return "@"; |
300 | if (next && base->next == next) |
301 | return "."; |
302 | if (!base->name) |
303 | generate_name(base); |
304 | return base->name; |
305 | } |
306 | |
307 | |
308 | static const char *obj_base_name(struct vec *base, const struct vec *prev) |
309 | { |
310 | if (base && base == prev) |
311 | return "."; |
312 | return base_name(base, NULL); |
313 | } |
314 | |
315 | |
316 | char *print_obj(const struct obj *obj, const struct vec *prev) |
317 | { |
318 | const char *base, *s1, *s3; |
319 | char *s, *s2; |
320 | |
321 | base = obj_base_name(obj->base, prev); |
322 | switch (obj->type) { |
323 | case ot_frame: |
324 | s = stralloc_printf("frame %s %s", |
325 | obj->u.frame.ref->name, base); |
326 | break; |
327 | case ot_line: |
328 | s1 = obj_base_name(obj->u.line.other, prev); |
329 | s2 = unparse(obj->u.line.width); |
330 | s = stralloc_printf("line %s %s %s", base, s1, s2); |
331 | free(s2); |
332 | break; |
333 | case ot_rect: |
334 | s1 = obj_base_name(obj->u.rect.other, prev); |
335 | s2 = unparse(obj->u.rect.width); |
336 | s = stralloc_printf("rect %s %s %s", base, s1, s2); |
337 | free(s2); |
338 | break; |
339 | case ot_pad: |
340 | s1 = obj_base_name(obj->u.pad.other, prev); |
341 | switch (obj->u.pad.type) { |
342 | case pt_normal: |
343 | s2 = ""; |
344 | break; |
345 | case pt_bare: |
346 | s2 = " bare"; |
347 | break; |
348 | case pt_paste: |
349 | s2 = " paste"; |
350 | break; |
351 | case pt_mask: |
352 | s2 = " mask"; |
353 | break; |
354 | default: |
355 | abort(); |
356 | } |
357 | s = stralloc_printf("%spad \"%s\" %s %s%s", |
358 | obj->u.pad.rounded ? "r" : "", |
359 | obj->u.pad.name, base, s1, s2); |
360 | break; |
361 | case ot_hole: |
362 | s1 = obj_base_name(obj->u.hole.other, prev); |
363 | s = stralloc_printf("hole %s %s", base, s1); |
364 | break; |
365 | case ot_arc: |
366 | s1 = obj_base_name(obj->u.arc.start, prev); |
367 | s2 = unparse(obj->u.arc.width); |
368 | if (obj->u.arc.start == obj->u.arc.end) { |
369 | s = stralloc_printf("circ %s %s %s", base, s1, s2); |
370 | } else { |
371 | s3 = obj_base_name(obj->u.arc.end, prev); |
372 | s = stralloc_printf("arc %s %s %s %s", |
373 | base, s1, s3, s2); |
374 | } |
375 | free(s2); |
376 | break; |
377 | default: |
378 | abort(); |
379 | } |
380 | return s; |
381 | } |
382 | |
383 | |
384 | /* ----- print measurement ------------------------------------------------- */ |
385 | |
386 | |
387 | static const char *meas_type_name[mt_n] = { |
388 | "meas", "measx", "measy", |
389 | "meas", "measx", "measy", |
390 | }; |
391 | |
392 | |
393 | |
394 | static char *print_meas_base(struct vec *base, const struct frame_qual *qual) |
395 | { |
396 | const char *name; |
397 | size_t n; |
398 | const struct frame_qual *walk; |
399 | char *s, *p; |
400 | |
401 | name = base_name(base, NULL); |
402 | n = strlen(name)+1; /* vec\0 */ |
403 | for (walk = qual; walk; walk = walk->next) |
404 | n += strlen(walk->frame->name)+1; /* frame/ */ |
405 | if (base->frame != frames) |
406 | n += strlen(base->frame->name)+1; /* frame. */ |
407 | |
408 | s = p = alloc_size(n); |
409 | for (walk = qual; walk; walk = walk->next) { |
410 | n = strlen(walk->frame->name); |
411 | memcpy(p, walk->frame->name, n); |
412 | p[n] = '/'; |
413 | p += n+1; |
414 | } |
415 | if (base->frame != frames) { |
416 | n = strlen(base->frame->name); |
417 | memcpy(p, base->frame->name, n); |
418 | p[n] = '.'; |
419 | p += n+1; |
420 | } |
421 | strcpy(p, name); |
422 | return s; |
423 | } |
424 | |
425 | |
426 | char *print_meas(const struct obj *obj) |
427 | { |
428 | char *s, *t; |
429 | char *s1, *s2, *s3; |
430 | |
431 | assert(obj->type == ot_meas); |
432 | |
433 | s = stralloc_printf("%s ", meas_type_name[obj->u.meas.type]); |
434 | if (obj->u.meas.label) { |
435 | t = stralloc_printf("%s\"%s\" ", s, obj->u.meas.label); |
436 | free(s); |
437 | s = t; |
438 | } |
439 | s1 = print_meas_base(obj->base, obj->u.meas.low_qual); |
440 | s2 = stralloc_printf(" %s ", |
441 | obj->u.meas.type < 3 ? obj->u.meas.inverted ? "<-" : "->" : |
442 | obj->u.meas.inverted ? "<<" : ">>"); |
443 | s3 = print_meas_base(obj->u.meas.high, obj->u.meas.high_qual); |
444 | t = stralloc_printf("%s%s%s%s", s, s1, s2, s3); |
445 | free(s); |
446 | free(s1); |
447 | free(s2); |
448 | free(s3); |
449 | s = t; |
450 | |
451 | if (!obj->u.meas.offset) |
452 | return s; |
453 | |
454 | s1 = unparse(obj->u.meas.offset); |
455 | t = stralloc_printf("%s %s", s, s1); |
456 | free(s); |
457 | free(s1); |
458 | return t; |
459 | } |
460 | |
461 | |
462 | /* ----- print vector ------------------------------------------------------ */ |
463 | |
464 | |
465 | const char *print_label(struct vec *vec) |
466 | { |
467 | if (!vec->name) |
468 | generate_name(vec); |
469 | return vec->name; |
470 | } |
471 | |
472 | |
473 | char *print_vec(const struct vec *vec) |
474 | { |
475 | const char *base; |
476 | char *x, *y, *s; |
477 | |
478 | base = base_name(vec->base, vec); |
479 | x = unparse(vec->x); |
480 | y = unparse(vec->y); |
481 | if (vec->name) |
482 | s = stralloc_printf("vec %s(%s, %s)", base, x, y); |
483 | else { |
484 | s = stralloc_printf("vec %s(%s, %s)", base, x, y); |
485 | } |
486 | free(x); |
487 | free(y); |
488 | return s; |
489 | } |
490 | |
491 | |
492 | /* ----- frames ------------------------------------------------------------ */ |
493 | |
494 | |
495 | static void dump_frame(FILE *file, struct frame *frame, const char *indent) |
496 | { |
497 | const struct table *table; |
498 | const struct loop *loop; |
499 | struct obj *obj; |
500 | struct order *order; |
501 | const struct order *item; |
502 | char *s; |
503 | const char *s1; |
504 | |
505 | if (frame->dumped) |
506 | return; |
507 | frame->dumped = 1; |
508 | |
509 | for (obj = frame->objs; obj; obj = obj->next) |
510 | if (obj->type == ot_frame) |
511 | dump_frame(file, obj->u.frame.ref, "\t"); |
512 | |
513 | if (frame->name) |
514 | fprintf(file, "frame %s {\n", frame->name); |
515 | |
516 | for (table = frame->tables; table; table = table->next) |
517 | dump_table(file, table, indent); |
518 | for (loop = frame->loops; loop; loop = loop->next) |
519 | dump_loop(file, loop, indent); |
520 | |
521 | order = order_frame(frame); |
522 | for (item = order; item->vec || item->obj; item++) { |
523 | if (item->obj) { |
524 | fprintf(file, "%s", indent); |
525 | if (item->obj->name) |
526 | fprintf(file, "%s: ", item->obj->name); |
527 | s = print_obj(item->obj, item->vec); |
528 | fprintf(file, "%s\n", s); |
529 | } else { |
530 | s1 = print_label(item->vec); |
531 | s = print_vec(item->vec); |
532 | fprintf(file, "%s%s: %s\n", indent, s1, s); |
533 | } |
534 | free(s); |
535 | } |
536 | free(order); |
537 | |
538 | for (obj = frame->objs; obj; obj = obj->next) { |
539 | if (obj->dumped) |
540 | continue; |
541 | s = print_meas(obj); |
542 | fprintf(file, "%s%s\n", indent, s); |
543 | free(s); |
544 | } |
545 | |
546 | if (frame->name) |
547 | fprintf(file, "}\n\n"); |
548 | } |
549 | |
550 | |
551 | /* ----- file -------------------------------------------------------------- */ |
552 | |
553 | |
554 | static void dump_unit(FILE *file) |
555 | { |
556 | switch (curr_unit) { |
557 | case curr_unit_mm: |
558 | fprintf(file, "unit mm\n"); |
559 | break; |
560 | case curr_unit_mil: |
561 | fprintf(file, "unit mil\n"); |
562 | break; |
563 | case curr_unit_auto: |
564 | fprintf(file, "unit auto\n"); |
565 | break; |
566 | default: |
567 | abort(); |
568 | } |
569 | } |
570 | |
571 | |
572 | static void reverse_frames(FILE *file, struct frame *last) |
573 | { |
574 | if (last) { |
575 | reverse_frames(file, last->next); |
576 | dump_frame(file, last, "\t"); |
577 | } |
578 | } |
579 | |
580 | |
581 | int dump(FILE *file) |
582 | { |
583 | struct frame *frame; |
584 | |
585 | fprintf(file, "%s\n", MACHINE_GENERATED); |
586 | for (frame = frames; frame; frame = frame->next) |
587 | frame->dumped = 0; |
588 | |
589 | reverse_frames(file, frames->next); |
590 | fprintf(file, "package \"%s\"\n", pkg_name); |
591 | dump_unit(file); |
592 | dump_frame(file, frames, ""); |
593 | |
594 | fflush(file); |
595 | return !ferror(file); |
596 | } |
597 |
Branches:
master