Root/
Source at commit 23dc37014cfc9e163f20db112a42f8e8458a6e75 created 13 years 5 months ago. By Xiangfu Liu, update to svn rev 5982, enable dh_auto_test | |
---|---|
1 | /* |
2 | * delete.c - Object deletion |
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 <assert.h> |
16 | |
17 | #include "util.h" |
18 | #include "error.h" |
19 | #include "expr.h" |
20 | #include "obj.h" |
21 | #include "delete.h" |
22 | |
23 | |
24 | static struct deletion { |
25 | enum del_type { |
26 | dt_vec, |
27 | dt_obj, |
28 | dt_frame, |
29 | dt_table, |
30 | dt_row, |
31 | dt_column, |
32 | dt_loop, |
33 | } type; |
34 | union { |
35 | struct { |
36 | struct frame *ref; |
37 | struct frame *prev; |
38 | } frame; |
39 | struct { |
40 | struct vec *ref; |
41 | struct vec *prev; |
42 | } vec; |
43 | struct { |
44 | struct obj *ref; |
45 | struct obj *prev; |
46 | } obj; |
47 | struct { |
48 | struct table *ref; |
49 | struct table *prev; |
50 | } table; |
51 | struct { |
52 | struct row *ref; |
53 | struct row *prev; |
54 | } row; |
55 | struct column { |
56 | struct var *var; |
57 | struct value *values; |
58 | struct table *table; |
59 | int n; |
60 | } col; |
61 | struct { |
62 | struct loop *ref; |
63 | struct loop *prev; |
64 | } loop; |
65 | } u; |
66 | int group; |
67 | struct deletion *next; |
68 | } *deletions = NULL; |
69 | |
70 | static int groups = 0; |
71 | |
72 | |
73 | static void do_delete_vec(struct vec *vec); |
74 | static void do_delete_obj(struct obj *obj); |
75 | |
76 | |
77 | /* ----- helper functions -------------------------------------------------- */ |
78 | |
79 | |
80 | static struct deletion *new_deletion(enum del_type type) |
81 | { |
82 | struct deletion *del; |
83 | |
84 | del = alloc_type(struct deletion); |
85 | del->type = type; |
86 | del->group = groups; |
87 | del->next = deletions; |
88 | deletions = del; |
89 | return del; |
90 | } |
91 | |
92 | |
93 | static void reset_active_ref(struct frame *ref) |
94 | { |
95 | const struct frame *frame; |
96 | struct obj *obj = NULL; |
97 | |
98 | for (frame = frames; frame; frame = frame->next) |
99 | for (obj = frame->objs; obj; obj = obj->next) |
100 | if (obj->type == ot_frame && obj->u.frame.ref == ref) |
101 | break; |
102 | ref->active_ref = obj; |
103 | } |
104 | |
105 | |
106 | /* ----- vectors ----------------------------------------------------------- */ |
107 | |
108 | |
109 | static void destroy_vec(struct vec *vec) |
110 | { |
111 | free_expr(vec->x); |
112 | free_expr(vec->y); |
113 | free(vec); |
114 | } |
115 | |
116 | |
117 | static void delete_vecs_by_ref(struct vec *vecs, const struct vec *ref) |
118 | { |
119 | while (vecs) { |
120 | if (vecs->base == ref) |
121 | do_delete_vec(vecs); |
122 | vecs = vecs->next; |
123 | } |
124 | } |
125 | |
126 | |
127 | static int obj_has_ref(const struct obj *obj, const struct vec *ref) |
128 | { |
129 | if (obj->base == ref) |
130 | return 1; |
131 | switch (obj->type) { |
132 | case ot_frame: |
133 | return 0; |
134 | case ot_line: |
135 | return obj->u.line.other == ref; |
136 | case ot_rect: |
137 | return obj->u.rect.other == ref; |
138 | case ot_pad: |
139 | return obj->u.pad.other == ref; |
140 | case ot_hole: |
141 | return obj->u.hole.other == ref; |
142 | case ot_arc: |
143 | return obj->u.arc.start == ref || obj->u.arc.end == ref; |
144 | case ot_meas: |
145 | return obj->u.meas.high == ref; |
146 | default: |
147 | abort(); |
148 | } |
149 | } |
150 | |
151 | |
152 | static void delete_objs_by_ref(struct obj **objs, const struct vec *ref) |
153 | { |
154 | struct obj *obj; |
155 | |
156 | for (obj = *objs; obj; obj = obj->next) |
157 | if (obj_has_ref(obj, ref)) |
158 | do_delete_obj(obj); |
159 | } |
160 | |
161 | |
162 | static void do_delete_vec(struct vec *vec) |
163 | { |
164 | struct vec *walk, *prev; |
165 | struct deletion *del; |
166 | |
167 | prev = NULL; |
168 | for (walk = vec->frame->vecs; walk != vec; walk = walk->next) |
169 | prev = walk; |
170 | if (prev) |
171 | prev->next = vec->next; |
172 | else |
173 | vec->frame->vecs = vec->next; |
174 | del = new_deletion(dt_vec); |
175 | del->u.vec.ref = vec; |
176 | del->u.vec.prev = prev; |
177 | |
178 | delete_vecs_by_ref(vec->frame->vecs, vec); |
179 | delete_objs_by_ref(&vec->frame->objs, vec); |
180 | /* |
181 | * Catch measurements. During final cleanup, we may operate on an empty |
182 | * list of frames, hence the test. |
183 | */ |
184 | if (frames) |
185 | delete_objs_by_ref(&frames->objs, vec); |
186 | } |
187 | |
188 | |
189 | void delete_vec(struct vec *vec) |
190 | { |
191 | groups++; |
192 | do_delete_vec(vec); |
193 | } |
194 | |
195 | |
196 | static void undelete_vec(struct vec *vec, struct vec *prev) |
197 | { |
198 | if (prev) { |
199 | assert(vec->next == prev->next); |
200 | prev->next = vec; |
201 | } else { |
202 | assert(vec->next == vec->frame->vecs); |
203 | vec->frame->vecs = vec; |
204 | } |
205 | } |
206 | |
207 | |
208 | /* ----- objects ----------------------------------------------------------- */ |
209 | |
210 | |
211 | static void destroy_obj(struct obj *obj) |
212 | { |
213 | switch (obj->type) { |
214 | case ot_frame: |
215 | if (obj->u.frame.ref->active_ref == obj) |
216 | reset_active_ref(obj->u.frame.ref); |
217 | break; |
218 | case ot_pad: |
219 | free(obj->u.pad.name); |
220 | break; |
221 | case ot_hole: |
222 | break; |
223 | case ot_line: |
224 | if (obj->u.line.width) |
225 | free_expr(obj->u.line.width); |
226 | break; |
227 | case ot_rect: |
228 | if (obj->u.rect.width) |
229 | free_expr(obj->u.rect.width); |
230 | break; |
231 | case ot_arc: |
232 | if (obj->u.arc.width) |
233 | free_expr(obj->u.arc.width); |
234 | break; |
235 | case ot_meas: |
236 | if (obj->u.meas.label) |
237 | free(obj->u.meas.label); |
238 | if (obj->u.meas.offset) |
239 | free_expr(obj->u.meas.offset); |
240 | break; |
241 | default: |
242 | abort(); |
243 | } |
244 | free(obj); |
245 | } |
246 | |
247 | |
248 | static void do_delete_obj(struct obj *obj) |
249 | { |
250 | struct obj *walk, *prev; |
251 | struct deletion *del; |
252 | |
253 | prev = NULL; |
254 | for (walk = obj->frame->objs; walk != obj; walk = walk->next) |
255 | prev = walk; |
256 | if (prev) |
257 | prev->next = obj->next; |
258 | else |
259 | obj->frame->objs = obj->next; |
260 | del = new_deletion(dt_obj); |
261 | del->u.obj.ref = obj; |
262 | del->u.obj.prev = prev; |
263 | if (obj->type == ot_frame && obj->u.frame.ref->active_ref == obj) |
264 | reset_active_ref(obj->u.frame.ref); |
265 | } |
266 | |
267 | |
268 | void delete_obj(struct obj *obj) |
269 | { |
270 | groups++; |
271 | do_delete_obj(obj); |
272 | } |
273 | |
274 | |
275 | static void undelete_obj(struct obj *obj, struct obj *prev) |
276 | { |
277 | if (prev) { |
278 | assert(obj->next == prev->next); |
279 | prev->next = obj; |
280 | } else { |
281 | assert(obj->next == obj->frame->objs); |
282 | obj->frame->objs = obj; |
283 | } |
284 | } |
285 | |
286 | |
287 | |
288 | /* ----- rows -------------------------------------------------------------- */ |
289 | |
290 | |
291 | static void destroy_row(struct row *row) |
292 | { |
293 | struct value *next_value; |
294 | |
295 | while (row->values) { |
296 | next_value = row->values->next; |
297 | free_expr(row->values->expr); |
298 | free(row->values); |
299 | row->values = next_value; |
300 | } |
301 | free(row); |
302 | } |
303 | |
304 | |
305 | void delete_row(struct row *row) |
306 | { |
307 | struct deletion *del; |
308 | struct row *walk, *prev; |
309 | |
310 | groups++; |
311 | prev = NULL; |
312 | for (walk = row->table->rows; walk != row; walk = walk->next) |
313 | prev = walk; |
314 | if (prev) |
315 | prev->next = row->next; |
316 | else |
317 | row->table->rows = row->next; |
318 | del = new_deletion(dt_row); |
319 | del->u.row.ref = row; |
320 | del->u.row.prev = prev; |
321 | } |
322 | |
323 | |
324 | static void undelete_row(struct row *row, struct row *prev) |
325 | { |
326 | if (prev) { |
327 | assert(row->next == prev->next); |
328 | prev->next = row; |
329 | } else { |
330 | assert(row->next == row->table->rows); |
331 | row->table->rows = row; |
332 | } |
333 | } |
334 | |
335 | |
336 | /* ----- columns ----------------------------------------------------------- */ |
337 | |
338 | |
339 | void delete_column(struct table *table, int n) |
340 | { |
341 | struct deletion *del; |
342 | struct column *col; |
343 | struct var **var; |
344 | struct row *row; |
345 | struct value **next, **value; |
346 | int i; |
347 | |
348 | groups++; |
349 | |
350 | del = new_deletion(dt_column); |
351 | col = &del->u.col; |
352 | col->table = table; |
353 | col->n = n; |
354 | |
355 | var = &table->vars; |
356 | for (i = 0; i != n; i++) |
357 | var = &(*var)->next; |
358 | col->var = *var; |
359 | *var = (*var)->next; |
360 | |
361 | next = &col->values; |
362 | for (row = table->rows; row; row = row->next) { |
363 | value = &row->values; |
364 | for (i = 0; i != n; i++) |
365 | value = &(*value)->next; |
366 | *next = *value; |
367 | *value = (*value)->next; |
368 | next = &(*next)->next; |
369 | } |
370 | *next = NULL; |
371 | } |
372 | |
373 | |
374 | static void undelete_column(const struct column *col) |
375 | { |
376 | struct var **var; |
377 | struct row *row; |
378 | struct value **anchor, *value, *next; |
379 | int i; |
380 | |
381 | var = &col->table->vars; |
382 | for (i = 0; i != col->n; i++) |
383 | var = &(*var)->next; |
384 | col->var->next = *var; |
385 | *var = col->var; |
386 | |
387 | value = col->values; |
388 | for (row = col->table->rows; row; row = row->next) { |
389 | anchor = &row->values; |
390 | for (i = 0; i != col->n; i++) |
391 | anchor = &(*anchor)->next; |
392 | next = value->next; |
393 | value->next = *anchor; |
394 | *anchor = value; |
395 | value = next; |
396 | } |
397 | } |
398 | |
399 | |
400 | /* ----- tables ------------------------------------------------------------ */ |
401 | |
402 | |
403 | static void destroy_table(struct table *table) |
404 | { |
405 | struct var *next_var; |
406 | |
407 | while (table->vars) { |
408 | next_var = table->vars->next; |
409 | free(table->vars); |
410 | table->vars = next_var; |
411 | } |
412 | while (table->rows) { |
413 | delete_row(table->rows); |
414 | destroy(); |
415 | } |
416 | free(table); |
417 | } |
418 | |
419 | |
420 | void delete_table(struct table *table) |
421 | { |
422 | struct frame *frame = table->vars->frame; |
423 | struct deletion *del; |
424 | struct table *walk, *prev; |
425 | |
426 | groups++; |
427 | prev = NULL; |
428 | for (walk = frame->tables; walk != table; walk = walk->next) |
429 | prev = walk; |
430 | if (prev) |
431 | prev->next = table->next; |
432 | else |
433 | frame->tables = table->next; |
434 | del = new_deletion(dt_table); |
435 | del->u.table.ref = table; |
436 | del->u.table.prev = prev; |
437 | } |
438 | |
439 | |
440 | static void undelete_table(struct table *table, struct table *prev) |
441 | { |
442 | struct frame *frame = table->vars->frame; |
443 | |
444 | if (prev) { |
445 | assert(table->next == prev->next); |
446 | prev->next = table; |
447 | } else { |
448 | assert(table->next == frame->tables); |
449 | frame->tables = table; |
450 | } |
451 | } |
452 | |
453 | |
454 | /* ----- loops ------------------------------------------------------------- */ |
455 | |
456 | |
457 | static void destroy_loop(struct loop *loop) |
458 | { |
459 | free_expr(loop->from.expr); |
460 | free_expr(loop->to.expr); |
461 | free(loop); |
462 | } |
463 | |
464 | |
465 | void delete_loop(struct loop *loop) |
466 | { |
467 | struct frame *frame = loop->var.frame; |
468 | struct deletion *del; |
469 | struct loop *walk, *prev; |
470 | |
471 | groups++; |
472 | prev = NULL; |
473 | for (walk = frame->loops; walk != loop; walk = walk->next) |
474 | prev = walk; |
475 | if (prev) |
476 | prev->next = loop->next; |
477 | else |
478 | frame->loops = loop->next; |
479 | del = new_deletion(dt_loop); |
480 | del->u.loop.ref = loop; |
481 | del->u.loop.prev = prev; |
482 | } |
483 | |
484 | |
485 | static void undelete_loop(struct loop *loop, struct loop *prev) |
486 | { |
487 | struct frame *frame = loop->var.frame; |
488 | |
489 | if (prev) { |
490 | assert(loop->next == prev->next); |
491 | prev->next = loop; |
492 | } else { |
493 | assert(loop->next == frame->loops); |
494 | frame->loops = loop; |
495 | } |
496 | } |
497 | |
498 | |
499 | /* ----- frames ------------------------------------------------------------ */ |
500 | |
501 | |
502 | static void destroy_frame(struct frame *frame) |
503 | { |
504 | while (frame->tables) { |
505 | delete_table(frame->tables); |
506 | destroy(); |
507 | } |
508 | while (frame->loops) { |
509 | delete_loop(frame->loops); |
510 | destroy(); |
511 | } |
512 | while (frame->vecs) { |
513 | delete_vec(frame->vecs); |
514 | destroy(); |
515 | } |
516 | while (frame->objs) { |
517 | delete_obj(frame->objs); |
518 | destroy(); |
519 | } |
520 | free(frame); |
521 | } |
522 | |
523 | |
524 | static int qual_ref(const struct frame_qual *qual, const struct frame *ref) |
525 | { |
526 | while (qual) { |
527 | if (qual->frame == ref) |
528 | return 1; |
529 | qual = qual->next; |
530 | } |
531 | return 0; |
532 | } |
533 | |
534 | |
535 | static void delete_references(const struct frame *ref) |
536 | { |
537 | struct frame *frame; |
538 | struct obj *obj; |
539 | |
540 | for (frame = frames; frame; frame = frame->next) |
541 | for (obj = frame->objs; obj; obj = obj->next) |
542 | switch (obj->type) { |
543 | case ot_frame: |
544 | if (obj->u.frame.ref == ref) |
545 | do_delete_obj(obj); |
546 | break; |
547 | case ot_meas: |
548 | if (obj->base->frame == ref || |
549 | obj->u.meas.high->frame == ref || |
550 | qual_ref(obj->u.meas.low_qual, ref) || |
551 | qual_ref(obj->u.meas.high_qual, ref)) |
552 | do_delete_obj(obj); |
553 | break; |
554 | default: |
555 | break; |
556 | } |
557 | for (obj = ref->objs; obj; obj = obj->next) |
558 | if (obj->type == ot_frame) |
559 | if (obj->u.frame.ref->active_ref == obj) |
560 | reset_active_ref(obj->u.frame.ref); |
561 | } |
562 | |
563 | |
564 | void delete_frame(struct frame *frame) |
565 | { |
566 | struct deletion *del; |
567 | struct frame *walk; |
568 | groups++; |
569 | |
570 | del = new_deletion(dt_frame); |
571 | del->u.frame.ref = frame; |
572 | del->u.frame.prev = NULL; |
573 | for (walk = frames; walk != frame; walk = walk->next) |
574 | del->u.frame.prev = walk; |
575 | if (del->u.frame.prev) |
576 | del->u.frame.prev->next = frame->next; |
577 | else |
578 | frames = frame->next; /* hmm, deleting the root frame ? */ |
579 | |
580 | delete_references(frame); |
581 | } |
582 | |
583 | |
584 | static void undelete_frame(struct frame *frame, struct frame *prev) |
585 | { |
586 | if (prev) { |
587 | assert(frame->next == prev->next); |
588 | prev->next = frame; |
589 | } else { |
590 | assert(frame->next == frames); |
591 | frames = frame; |
592 | } |
593 | } |
594 | |
595 | |
596 | /* ----- destroy/undelete interface ---------------------------------------- */ |
597 | |
598 | |
599 | static void destroy_one(void) |
600 | { |
601 | struct deletion *del; |
602 | |
603 | del = deletions; |
604 | switch (del->type) { |
605 | case dt_vec: |
606 | destroy_vec(del->u.vec.ref); |
607 | break; |
608 | case dt_obj: |
609 | destroy_obj(del->u.obj.ref); |
610 | break; |
611 | case dt_frame: |
612 | destroy_frame(del->u.frame.ref); |
613 | break; |
614 | case dt_loop: |
615 | destroy_loop(del->u.loop.ref); |
616 | break; |
617 | case dt_table: |
618 | destroy_table(del->u.table.ref); |
619 | break; |
620 | case dt_row: |
621 | destroy_row(del->u.row.ref); |
622 | break; |
623 | case dt_column: |
624 | abort(); /* @@@ later */ |
625 | break; |
626 | default: |
627 | abort(); |
628 | } |
629 | deletions = del->next; |
630 | free(del); |
631 | } |
632 | |
633 | |
634 | void destroy(void) |
635 | { |
636 | int group; |
637 | |
638 | assert(deletions); |
639 | group = deletions->group; |
640 | while (deletions && deletions->group == group) |
641 | destroy_one(); |
642 | } |
643 | |
644 | |
645 | static int undelete_one(void) |
646 | { |
647 | struct deletion *del; |
648 | |
649 | if (!deletions) |
650 | return 0; |
651 | del = deletions; |
652 | switch (del->type) { |
653 | case dt_vec: |
654 | undelete_vec(del->u.vec.ref, del->u.vec.prev); |
655 | break; |
656 | case dt_obj: |
657 | undelete_obj(del->u.obj.ref, del->u.obj.prev); |
658 | break; |
659 | case dt_frame: |
660 | undelete_frame(del->u.frame.ref, del->u.frame.prev); |
661 | break; |
662 | case dt_loop: |
663 | undelete_loop(del->u.loop.ref, del->u.loop.prev); |
664 | break; |
665 | case dt_table: |
666 | undelete_table(del->u.table.ref, del->u.table.prev); |
667 | break; |
668 | case dt_row: |
669 | undelete_row(del->u.row.ref, del->u.row.prev); |
670 | break; |
671 | case dt_column: |
672 | undelete_column(&del->u.col); |
673 | break; |
674 | default: |
675 | abort(); |
676 | } |
677 | deletions = del->next; |
678 | free(del); |
679 | return 1; |
680 | } |
681 | |
682 | |
683 | int undelete(void) |
684 | { |
685 | int group; |
686 | |
687 | if (!deletions) |
688 | return 0; |
689 | group = deletions->group; |
690 | while (deletions && deletions->group == group) |
691 | undelete_one(); |
692 | return 1; |
693 | } |
694 | |
695 | |
696 | void purge(void) |
697 | { |
698 | while (deletions) |
699 | destroy(); |
700 | } |
701 |
Branches:
master