2 * Copyright (C) 2008,2009 Dan Carpenter.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version 2
7 * of the License, or (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, see http://www.gnu.org/copyleft/gpl.txt
21 #include "smatch_slist.h"
25 ALLOCATOR(smatch_state
, "smatch state");
26 ALLOCATOR(sm_state
, "sm state");
27 ALLOCATOR(named_stree
, "named slist");
28 __DO_ALLOCATOR(char, 1, 4, "state names", sname
);
30 static int sm_state_counter
;
32 static struct stree_stack
*all_pools
;
34 const char *show_sm(struct sm_state
*sm
)
44 pos
= snprintf(buf
, sizeof(buf
), "[%s] '%s' = '%s'",
45 check_name(sm
->owner
), sm
->name
, show_state(sm
->state
));
46 if (pos
> sizeof(buf
))
49 if (ptr_list_size((struct ptr_list
*)sm
->possible
) == 1)
52 pos
+= snprintf(buf
+ pos
, sizeof(buf
) - pos
, " (");
53 if (pos
> sizeof(buf
))
56 FOR_EACH_PTR(sm
->possible
, tmp
) {
58 pos
+= snprintf(buf
+ pos
, sizeof(buf
) - pos
, ", ");
59 if (pos
> sizeof(buf
))
61 pos
+= snprintf(buf
+ pos
, sizeof(buf
) - pos
, "%s",
62 show_state(tmp
->state
));
63 if (pos
> sizeof(buf
))
65 } END_FOR_EACH_PTR(tmp
);
66 snprintf(buf
+ pos
, sizeof(buf
) - pos
, ")");
71 for (i
= 0; i
< 3; i
++)
72 buf
[sizeof(buf
) - 2 - i
] = '.';
76 void __print_stree(struct stree
*stree
)
80 printf("dumping stree at %d [%ld states]\n", get_lineno(), stree_count(stree
));
81 FOR_EACH_SM(stree
, sm
) {
82 printf("%s\n", show_sm(sm
));
83 } END_FOR_EACH_SM(sm
);
87 /* NULL states go at the end to simplify merge_slist */
88 int cmp_tracker(const struct sm_state
*a
, const struct sm_state
*b
)
99 if (a
->owner
> b
->owner
)
101 if (a
->owner
< b
->owner
)
104 ret
= strcmp(a
->name
, b
->name
);
110 if (!b
->sym
&& a
->sym
)
112 if (!a
->sym
&& b
->sym
)
122 static int cmp_sm_states(const struct sm_state
*a
, const struct sm_state
*b
, int preserve
)
126 ret
= cmp_tracker(a
, b
);
130 /* todo: add hook for smatch_extra.c */
131 if (a
->state
> b
->state
)
133 if (a
->state
< b
->state
)
135 /* This is obviously a massive disgusting hack but we need to preserve
136 * the unmerged states for smatch extra because we use them in
137 * smatch_db.c. Meanwhile if we preserve all the other unmerged states
138 * then it uses a lot of memory and we don't use it. Hence this hack.
140 * Also sometimes even just preserving every possible SMATCH_EXTRA state
141 * takes too much resources so we have to cap that. Capping is probably
142 * not often a problem in real life.
144 if (a
->owner
== SMATCH_EXTRA
&& preserve
) {
147 if (a
->merged
== 1 && b
->merged
== 0)
156 struct sm_state
*alloc_sm_state(int owner
, const char *name
,
157 struct symbol
*sym
, struct smatch_state
*state
)
159 struct sm_state
*sm_state
= __alloc_sm_state(0);
163 sm_state
->name
= alloc_sname(name
);
164 sm_state
->owner
= owner
;
166 sm_state
->state
= state
;
167 sm_state
->line
= get_lineno();
168 sm_state
->merged
= 0;
169 sm_state
->pool
= NULL
;
170 sm_state
->left
= NULL
;
171 sm_state
->right
= NULL
;
172 sm_state
->nr_children
= 1;
173 sm_state
->possible
= NULL
;
174 add_ptr_list(&sm_state
->possible
, sm_state
);
178 static struct sm_state
*alloc_state_no_name(int owner
, const char *name
,
180 struct smatch_state
*state
)
182 struct sm_state
*tmp
;
184 tmp
= alloc_sm_state(owner
, NULL
, sym
, state
);
189 int too_many_possible(struct sm_state
*sm
)
191 if (ptr_list_size((struct ptr_list
*)sm
->possible
) >= 100)
196 void add_possible_sm(struct sm_state
*to
, struct sm_state
*new)
198 struct sm_state
*tmp
;
201 if (too_many_possible(to
))
204 FOR_EACH_PTR(to
->possible
, tmp
) {
205 if (cmp_sm_states(tmp
, new, preserve
) < 0)
207 else if (cmp_sm_states(tmp
, new, preserve
) == 0) {
210 INSERT_CURRENT(new, tmp
);
213 } END_FOR_EACH_PTR(tmp
);
214 add_ptr_list(&to
->possible
, new);
217 static void copy_possibles(struct sm_state
*to
, struct sm_state
*from
)
219 struct sm_state
*tmp
;
221 FOR_EACH_PTR(from
->possible
, tmp
) {
222 add_possible_sm(to
, tmp
);
223 } END_FOR_EACH_PTR(tmp
);
226 char *alloc_sname(const char *str
)
232 tmp
= __alloc_sname(strlen(str
) + 1);
237 int out_of_memory(void)
240 * I decided to use 50M here based on trial and error.
241 * It works out OK for the kernel and so it should work
242 * for most other projects as well.
244 if (sm_state_counter
* sizeof(struct sm_state
) >= 100000000)
249 int low_on_memory(void)
251 if (sm_state_counter
* sizeof(struct sm_state
) >= 25000000)
256 static void free_sm_state(struct sm_state
*sm
)
258 free_slist(&sm
->possible
);
260 * fixme. Free the actual state.
261 * Right now we leave it until the end of the function
262 * because we don't want to double free it.
263 * Use the freelist to not double free things
267 static void free_all_sm_states(struct allocation_blob
*blob
)
269 unsigned int size
= sizeof(struct sm_state
);
270 unsigned int offset
= 0;
272 while (offset
< blob
->offset
) {
273 free_sm_state((struct sm_state
*)(blob
->data
+ offset
));
278 /* At the end of every function we free all the sm_states */
279 void free_every_single_sm_state(void)
281 struct allocator_struct
*desc
= &sm_state_allocator
;
282 struct allocation_blob
*blob
= desc
->blobs
;
285 desc
->allocations
= 0;
286 desc
->total_bytes
= 0;
287 desc
->useful_bytes
= 0;
288 desc
->freelist
= NULL
;
290 struct allocation_blob
*next
= blob
->next
;
291 free_all_sm_states(blob
);
292 blob_free(blob
, desc
->chunking
);
296 clear_smatch_state_alloc();
298 free_stack_and_strees(&all_pools
);
299 sm_state_counter
= 0;
302 struct sm_state
*clone_sm(struct sm_state
*s
)
304 struct sm_state
*ret
;
306 ret
= alloc_state_no_name(s
->owner
, s
->name
, s
->sym
, s
->state
);
307 ret
->merged
= s
->merged
;
309 /* clone_sm() doesn't copy the pools. Each state needs to have
311 ret
->possible
= clone_slist(s
->possible
);
313 ret
->right
= s
->right
;
314 ret
->nr_children
= s
->nr_children
;
318 int is_merged(struct sm_state
*sm
)
323 int is_leaf(struct sm_state
*sm
)
328 int slist_has_state(struct state_list
*slist
, struct smatch_state
*state
)
330 struct sm_state
*tmp
;
332 FOR_EACH_PTR(slist
, tmp
) {
333 if (tmp
->state
== state
)
335 } END_FOR_EACH_PTR(tmp
);
339 struct state_list
*clone_slist(struct state_list
*from_slist
)
342 struct state_list
*to_slist
= NULL
;
344 FOR_EACH_PTR(from_slist
, sm
) {
345 add_ptr_list(&to_slist
, sm
);
346 } END_FOR_EACH_PTR(sm
);
350 static struct smatch_state
*merge_states(int owner
, const char *name
,
352 struct smatch_state
*state1
,
353 struct smatch_state
*state2
)
355 struct smatch_state
*ret
;
357 if (state1
== state2
)
359 else if (__has_merge_function(owner
))
360 ret
= __client_merge_function(owner
, state1
, state2
);
361 else if (state1
== &ghost
)
363 else if (state2
== &ghost
)
365 else if (!state1
|| !state2
)
372 struct sm_state
*merge_sm_states(struct sm_state
*one
, struct sm_state
*two
)
374 struct smatch_state
*s
;
375 struct sm_state
*result
;
380 if (out_of_memory()) {
382 sm_msg("Function too hairy. No more merges.");
387 s
= merge_states(one
->owner
, one
->name
, one
->sym
, one
->state
, two
->state
);
388 result
= alloc_state_no_name(one
->owner
, one
->name
, one
->sym
, s
);
392 result
->nr_children
= one
->nr_children
+ two
->nr_children
;
393 copy_possibles(result
, one
);
394 copy_possibles(result
, two
);
397 * The ->line information is used by deref_check where we complain about
398 * checking pointers that have already been dereferenced. Let's say we
399 * dereference a pointer on both the true and false paths and then merge
400 * the states here. The result state is &derefed, but the ->line number
401 * is on the line where the pointer is merged not where it was
404 * So in that case, let's just pick one dereference and set the ->line
409 if (result
->state
== one
->state
)
410 result
->line
= one
->line
;
411 if (result
->state
== two
->state
)
412 result
->line
= two
->line
;
415 strcmp(check_name(one
->owner
), option_debug_check
) == 0) {
416 struct sm_state
*tmp
;
419 printf("%s:%d %s() merge [%s] '%s' %s(L %d) + %s(L %d) => %s (",
420 get_filename(), get_lineno(), get_function(),
421 check_name(one
->owner
), one
->name
,
422 show_state(one
->state
), one
->line
,
423 show_state(two
->state
), two
->line
,
426 FOR_EACH_PTR(result
->possible
, tmp
) {
429 printf("%s", show_state(tmp
->state
));
430 } END_FOR_EACH_PTR(tmp
);
437 struct sm_state
*get_sm_state_stree(struct stree
*stree
, int owner
, const char *name
,
440 struct tracker tracker
= {
442 .name
= (char *)name
,
450 return avl_lookup(stree
, (struct sm_state
*)&tracker
);
453 struct smatch_state
*get_state_stree(struct stree
*stree
,
454 int owner
, const char *name
,
459 sm
= get_sm_state_stree(stree
, owner
, name
, sym
);
465 /* FIXME: this is almost exactly the same as set_sm_state_slist() */
466 void overwrite_sm_state_stree(struct stree
**stree
, struct sm_state
*new)
468 avl_insert(stree
, new);
471 void overwrite_sm_state_stree_stack(struct stree_stack
**stack
,
476 stree
= pop_stree(stack
);
477 overwrite_sm_state_stree(&stree
, sm
);
478 push_stree(stack
, stree
);
481 struct sm_state
*set_state_stree(struct stree
**stree
, int owner
, const char *name
,
482 struct symbol
*sym
, struct smatch_state
*state
)
484 struct sm_state
*new = alloc_sm_state(owner
, name
, sym
, state
);
486 avl_insert(stree
, new);
490 void set_state_stree_perm(struct stree
**stree
, int owner
, const char *name
,
491 struct symbol
*sym
, struct smatch_state
*state
)
495 sm
= malloc(sizeof(*sm
) + strlen(name
) + 1);
496 memset(sm
, 0, sizeof(*sm
));
498 sm
->name
= (char *)(sm
+ 1);
499 strcpy((char *)sm
->name
, name
);
503 overwrite_sm_state_stree(stree
, sm
);
506 void delete_state_stree(struct stree
**stree
, int owner
, const char *name
,
509 struct tracker tracker
= {
511 .name
= (char *)name
,
515 avl_remove(stree
, (struct sm_state
*)&tracker
);
518 void delete_state_stree_stack(struct stree_stack
**stack
, int owner
, const char *name
,
523 stree
= pop_stree(stack
);
524 delete_state_stree(&stree
, owner
, name
, sym
);
525 push_stree(stack
, stree
);
528 void push_stree(struct stree_stack
**stack
, struct stree
*stree
)
530 add_ptr_list(stack
, stree
);
533 struct stree
*pop_stree(struct stree_stack
**stack
)
537 stree
= last_ptr_list((struct ptr_list
*)*stack
);
538 delete_ptr_list_last((struct ptr_list
**)stack
);
542 struct stree
*top_stree(struct stree_stack
*stack
)
544 return last_ptr_list((struct ptr_list
*)stack
);
547 void free_slist(struct state_list
**slist
)
549 __free_ptr_list((struct ptr_list
**)slist
);
552 void free_stree_stack(struct stree_stack
**stack
)
554 __free_ptr_list((struct ptr_list
**)stack
);
557 void free_stack_and_strees(struct stree_stack
**stree_stack
)
561 FOR_EACH_PTR(*stree_stack
, stree
) {
563 } END_FOR_EACH_PTR(stree
);
564 free_stree_stack(stree_stack
);
567 struct sm_state
*set_state_stree_stack(struct stree_stack
**stack
, int owner
, const char *name
,
568 struct symbol
*sym
, struct smatch_state
*state
)
573 stree
= pop_stree(stack
);
574 sm
= set_state_stree(&stree
, owner
, name
, sym
, state
);
575 push_stree(stack
, stree
);
581 * get_sm_state_stack() gets the state for the top slist on the stack.
583 struct sm_state
*get_sm_state_stree_stack(struct stree_stack
*stack
,
584 int owner
, const char *name
,
588 struct sm_state
*ret
;
590 stree
= pop_stree(&stack
);
591 ret
= get_sm_state_stree(stree
, owner
, name
, sym
);
592 push_stree(&stack
, stree
);
596 struct smatch_state
*get_state_stree_stack(struct stree_stack
*stack
,
597 int owner
, const char *name
,
602 sm
= get_sm_state_stree_stack(stack
, owner
, name
, sym
);
608 static void match_states_stree(struct stree
**one
, struct stree
**two
)
610 struct smatch_state
*tmp_state
;
612 struct state_list
*add_to_one
= NULL
;
613 struct state_list
*add_to_two
= NULL
;
617 avl_iter_begin(&one_iter
, *one
, FORWARD
);
618 avl_iter_begin(&two_iter
, *two
, FORWARD
);
621 if (!one_iter
.sm
&& !two_iter
.sm
)
623 if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) < 0) {
624 __set_fake_cur_stree_fast(*two
);
625 tmp_state
= __client_unmatched_state_function(one_iter
.sm
);
626 __pop_fake_cur_stree_fast();
627 sm
= alloc_state_no_name(one_iter
.sm
->owner
, one_iter
.sm
->name
,
628 one_iter
.sm
->sym
, tmp_state
);
629 add_ptr_list(&add_to_two
, sm
);
630 avl_iter_next(&one_iter
);
631 } else if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) == 0) {
632 avl_iter_next(&one_iter
);
633 avl_iter_next(&two_iter
);
635 __set_fake_cur_stree_fast(*one
);
636 tmp_state
= __client_unmatched_state_function(two_iter
.sm
);
637 __pop_fake_cur_stree_fast();
638 sm
= alloc_state_no_name(two_iter
.sm
->owner
, two_iter
.sm
->name
,
639 two_iter
.sm
->sym
, tmp_state
);
640 add_ptr_list(&add_to_one
, sm
);
641 avl_iter_next(&two_iter
);
645 FOR_EACH_PTR(add_to_one
, sm
) {
647 } END_FOR_EACH_PTR(sm
);
649 FOR_EACH_PTR(add_to_two
, sm
) {
651 } END_FOR_EACH_PTR(sm
);
653 free_slist(&add_to_one
);
654 free_slist(&add_to_two
);
657 static void call_pre_merge_hooks(struct stree
**one
, struct stree
**two
)
663 __swap_cur_stree(*one
);
664 FOR_EACH_SM(*two
, sm
) {
665 call_pre_merge_hook(sm
);
666 } END_FOR_EACH_SM(sm
);
667 *one
= clone_stree(__get_cur_stree());
669 __swap_cur_stree(*two
);
670 FOR_EACH_SM(*one
, sm
) {
671 call_pre_merge_hook(sm
);
672 } END_FOR_EACH_SM(sm
);
673 *two
= clone_stree(__get_cur_stree());
675 restore_all_states();
678 static void clone_pool_havers_stree(struct stree
**stree
)
680 struct sm_state
*sm
, *tmp
;
681 struct state_list
*slist
= NULL
;
683 FOR_EACH_SM(*stree
, sm
) {
686 add_ptr_list(&slist
, tmp
);
688 } END_FOR_EACH_SM(sm
);
690 FOR_EACH_PTR(slist
, sm
) {
691 avl_insert(stree
, sm
);
692 } END_FOR_EACH_PTR(sm
);
700 * merge_slist() is called whenever paths merge, such as after
701 * an if statement. It takes the two slists and creates one.
703 static void __merge_stree(struct stree
**to
, struct stree
*stree
, int add_pool
)
705 struct stree
*results
= NULL
;
706 struct stree
*implied_one
= NULL
;
707 struct stree
*implied_two
= NULL
;
710 struct sm_state
*tmp_sm
;
715 /* merging a null and nonnull path gives you only the nonnull path */
722 *to
= clone_stree(stree
);
726 implied_one
= clone_stree(*to
);
727 implied_two
= clone_stree(stree
);
729 match_states_stree(&implied_one
, &implied_two
);
730 call_pre_merge_hooks(&implied_one
, &implied_two
);
733 clone_pool_havers_stree(&implied_one
);
734 clone_pool_havers_stree(&implied_two
);
736 set_stree_id(&implied_one
, ++__stree_id
);
737 set_stree_id(&implied_two
, ++__stree_id
);
738 if (implied_one
->base_stree
)
739 set_stree_id(&implied_one
->base_stree
, ++__stree_id
);
740 if (implied_two
->base_stree
)
741 set_stree_id(&implied_two
->base_stree
, ++__stree_id
);
744 push_stree(&all_pools
, implied_one
);
745 push_stree(&all_pools
, implied_two
);
747 avl_iter_begin(&one_iter
, implied_one
, FORWARD
);
748 avl_iter_begin(&two_iter
, implied_two
, FORWARD
);
751 if (!one_iter
.sm
|| !two_iter
.sm
)
753 if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) < 0) {
754 sm_msg("error: Internal smatch error.");
755 avl_iter_next(&one_iter
);
756 } else if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) == 0) {
757 if (add_pool
&& one_iter
.sm
!= two_iter
.sm
) {
758 one_iter
.sm
->pool
= implied_one
;
759 if (implied_one
->base_stree
)
760 one_iter
.sm
->pool
= implied_one
->base_stree
;
761 two_iter
.sm
->pool
= implied_two
;
762 if (implied_two
->base_stree
)
763 two_iter
.sm
->pool
= implied_two
->base_stree
;
765 tmp_sm
= merge_sm_states(one_iter
.sm
, two_iter
.sm
);
766 add_possible_sm(tmp_sm
, one_iter
.sm
);
767 add_possible_sm(tmp_sm
, two_iter
.sm
);
768 avl_insert(&results
, tmp_sm
);
769 avl_iter_next(&one_iter
);
770 avl_iter_next(&two_iter
);
772 sm_msg("error: Internal smatch error.");
773 avl_iter_next(&two_iter
);
781 void merge_stree(struct stree
**to
, struct stree
*stree
)
783 __merge_stree(to
, stree
, 1);
786 void merge_stree_no_pools(struct stree
**to
, struct stree
*stree
)
788 __merge_stree(to
, stree
, 0);
792 * This is unfortunately a bit subtle... The problem is that if a
793 * state is set on one fake stree but not the other then we should
794 * look up the the original state and use that as the unset state.
795 * Fortunately, after you pop your fake stree then the cur_slist should
796 * reflect the original state.
798 void merge_fake_stree(struct stree
**to
, struct stree
*stree
)
800 struct stree
*one
= *to
;
801 struct stree
*two
= stree
;
803 struct state_list
*add_to_one
= NULL
;
804 struct state_list
*add_to_two
= NULL
;
813 *to
= clone_stree(stree
);
817 avl_iter_begin(&one_iter
, one
, FORWARD
);
818 avl_iter_begin(&two_iter
, two
, FORWARD
);
821 if (!one_iter
.sm
&& !two_iter
.sm
)
823 if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) < 0) {
824 sm
= get_sm_state(one_iter
.sm
->owner
, one_iter
.sm
->name
,
827 add_ptr_list(&add_to_two
, sm
);
828 avl_iter_next(&one_iter
);
829 } else if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) == 0) {
830 avl_iter_next(&one_iter
);
831 avl_iter_next(&two_iter
);
833 sm
= get_sm_state(two_iter
.sm
->owner
, two_iter
.sm
->name
,
836 add_ptr_list(&add_to_one
, sm
);
837 avl_iter_next(&two_iter
);
841 FOR_EACH_PTR(add_to_one
, sm
) {
842 avl_insert(&one
, sm
);
843 } END_FOR_EACH_PTR(sm
);
845 FOR_EACH_PTR(add_to_two
, sm
) {
846 avl_insert(&two
, sm
);
847 } END_FOR_EACH_PTR(sm
);
849 one
->base_stree
= clone_stree(__get_cur_stree());
850 FOR_EACH_SM(one
, sm
) {
851 avl_insert(&one
->base_stree
, sm
);
852 } END_FOR_EACH_SM(sm
);
854 two
->base_stree
= clone_stree(__get_cur_stree());
855 FOR_EACH_SM(two
, sm
) {
856 avl_insert(&two
->base_stree
, sm
);
857 } END_FOR_EACH_SM(sm
);
859 free_slist(&add_to_one
);
860 free_slist(&add_to_two
);
862 __merge_stree(&one
, two
, 1);
868 * filter_slist() removes any sm states "slist" holds in common with "filter"
870 void filter_stree(struct stree
**stree
, struct stree
*filter
)
872 struct stree
*results
= NULL
;
876 avl_iter_begin(&one_iter
, *stree
, FORWARD
);
877 avl_iter_begin(&two_iter
, filter
, FORWARD
);
879 /* FIXME: This should probably be re-written with trees in mind */
882 if (!one_iter
.sm
&& !two_iter
.sm
)
884 if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) < 0) {
885 avl_insert(&results
, one_iter
.sm
);
886 avl_iter_next(&one_iter
);
887 } else if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) == 0) {
888 if (one_iter
.sm
!= two_iter
.sm
)
889 avl_insert(&results
, one_iter
.sm
);
890 avl_iter_next(&one_iter
);
891 avl_iter_next(&two_iter
);
893 avl_iter_next(&two_iter
);
903 * and_slist_stack() pops the top two slists, overwriting the one with
904 * the other and pushing it back on the stack.
906 void and_stree_stack(struct stree_stack
**stack
)
908 struct sm_state
*tmp
;
909 struct stree
*right_stree
= pop_stree(stack
);
911 FOR_EACH_SM(right_stree
, tmp
) {
912 overwrite_sm_state_stree_stack(stack
, tmp
);
913 } END_FOR_EACH_SM(tmp
);
914 free_stree(&right_stree
);
918 * or_slist_stack() is for if we have: if (foo || bar) { foo->baz;
919 * It pops the two slists from the top of the stack and merges them
920 * together in a way that preserves the things they have in common
921 * but creates a merged state for most of the rest.
922 * You could have code that had: if (foo || foo) { foo->baz;
923 * It's this function which ensures smatch does the right thing.
925 void or_stree_stack(struct stree_stack
**pre_conds
,
926 struct stree
*cur_stree
,
927 struct stree_stack
**stack
)
931 struct stree
*pre_stree
;
933 struct stree
*tmp_stree
;
935 new = pop_stree(stack
);
936 old
= pop_stree(stack
);
938 pre_stree
= pop_stree(pre_conds
);
939 push_stree(pre_conds
, clone_stree(pre_stree
));
941 res
= clone_stree(pre_stree
);
942 overwrite_stree(old
, &res
);
944 tmp_stree
= clone_stree(cur_stree
);
945 overwrite_stree(new, &tmp_stree
);
947 merge_stree(&res
, tmp_stree
);
948 filter_stree(&res
, pre_stree
);
950 push_stree(stack
, res
);
951 free_stree(&tmp_stree
);
952 free_stree(&pre_stree
);
958 * get_named_stree() is only used for gotos.
960 struct stree
**get_named_stree(struct named_stree_stack
*stack
,
964 struct named_stree
*tmp
;
966 FOR_EACH_PTR(stack
, tmp
) {
967 if (tmp
->sym
== sym
&&
968 strcmp(tmp
->name
, name
) == 0)
970 } END_FOR_EACH_PTR(tmp
);
974 /* FIXME: These parameters are in a different order from expected */
975 void overwrite_stree(struct stree
*from
, struct stree
**to
)
977 struct sm_state
*tmp
;
979 FOR_EACH_SM(from
, tmp
) {
980 overwrite_sm_state_stree(to
, tmp
);
981 } END_FOR_EACH_SM(tmp
);