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
);
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_possible_sm(const struct sm_state
*a
, const struct sm_state
*b
, int preserve
)
129 ret
= cmp_tracker(a
, b
);
133 /* todo: add hook for smatch_extra.c */
134 if (a
->state
> b
->state
)
136 if (a
->state
< b
->state
)
138 /* This is obviously a massive disgusting hack but we need to preserve
139 * the unmerged states for smatch extra because we use them in
140 * smatch_db.c. Meanwhile if we preserve all the other unmerged states
141 * then it uses a lot of memory and we don't use it. Hence this hack.
143 * Also sometimes even just preserving every possible SMATCH_EXTRA state
144 * takes too much resources so we have to cap that. Capping is probably
145 * not often a problem in real life.
147 if (a
->owner
== SMATCH_EXTRA
&& preserve
) {
148 if (a
->merged
== 1 && b
->merged
== 0)
157 struct sm_state
*alloc_sm_state(int owner
, const char *name
,
158 struct symbol
*sym
, struct smatch_state
*state
)
160 struct sm_state
*sm_state
= __alloc_sm_state(0);
164 sm_state
->name
= alloc_sname(name
);
165 sm_state
->owner
= owner
;
167 sm_state
->state
= state
;
168 sm_state
->line
= get_lineno();
169 sm_state
->merged
= 0;
170 sm_state
->pool
= NULL
;
171 sm_state
->left
= NULL
;
172 sm_state
->right
= NULL
;
173 sm_state
->nr_children
= 1;
174 sm_state
->possible
= NULL
;
175 add_ptr_list(&sm_state
->possible
, sm_state
);
179 static struct sm_state
*alloc_state_no_name(int owner
, const char *name
,
181 struct smatch_state
*state
)
183 struct sm_state
*tmp
;
185 tmp
= alloc_sm_state(owner
, NULL
, sym
, state
);
190 int too_many_possible(struct sm_state
*sm
)
192 if (ptr_list_size((struct ptr_list
*)sm
->possible
) >= 100)
197 void add_possible_sm(struct sm_state
*to
, struct sm_state
*new)
199 struct sm_state
*tmp
;
203 if (too_many_possible(to
))
206 FOR_EACH_PTR(to
->possible
, tmp
) {
207 cmp
= cmp_possible_sm(tmp
, new, preserve
);
213 INSERT_CURRENT(new, tmp
);
216 } END_FOR_EACH_PTR(tmp
);
217 add_ptr_list(&to
->possible
, new);
220 static void copy_possibles(struct sm_state
*to
, struct sm_state
*one
, struct sm_state
*two
)
222 struct sm_state
*large
= one
;
223 struct sm_state
*small
= two
;
224 struct sm_state
*tmp
;
227 * We spend a lot of time copying the possible lists. I've tried to
228 * optimize the process a bit.
232 if (ptr_list_size((struct ptr_list
*)two
->possible
) >
233 ptr_list_size((struct ptr_list
*)one
->possible
)) {
238 to
->possible
= clone_slist(large
->possible
);
239 add_possible_sm(to
, to
);
240 FOR_EACH_PTR(small
->possible
, tmp
) {
241 add_possible_sm(to
, tmp
);
242 } END_FOR_EACH_PTR(tmp
);
245 char *alloc_sname(const char *str
)
251 tmp
= __alloc_sname(strlen(str
) + 1);
256 int out_of_memory(void)
259 * I decided to use 50M here based on trial and error.
260 * It works out OK for the kernel and so it should work
261 * for most other projects as well.
263 if (sm_state_counter
* sizeof(struct sm_state
) >= 100000000)
268 int low_on_memory(void)
270 if (sm_state_counter
* sizeof(struct sm_state
) >= 25000000)
275 static void free_sm_state(struct sm_state
*sm
)
277 free_slist(&sm
->possible
);
279 * fixme. Free the actual state.
280 * Right now we leave it until the end of the function
281 * because we don't want to double free it.
282 * Use the freelist to not double free things
286 static void free_all_sm_states(struct allocation_blob
*blob
)
288 unsigned int size
= sizeof(struct sm_state
);
289 unsigned int offset
= 0;
291 while (offset
< blob
->offset
) {
292 free_sm_state((struct sm_state
*)(blob
->data
+ offset
));
297 /* At the end of every function we free all the sm_states */
298 void free_every_single_sm_state(void)
300 struct allocator_struct
*desc
= &sm_state_allocator
;
301 struct allocation_blob
*blob
= desc
->blobs
;
304 desc
->allocations
= 0;
305 desc
->total_bytes
= 0;
306 desc
->useful_bytes
= 0;
307 desc
->freelist
= NULL
;
309 struct allocation_blob
*next
= blob
->next
;
310 free_all_sm_states(blob
);
311 blob_free(blob
, desc
->chunking
);
315 clear_smatch_state_alloc();
317 free_stack_and_strees(&all_pools
);
318 sm_state_counter
= 0;
321 unsigned long get_pool_count(void)
323 return ptr_list_size((struct ptr_list
*)all_pools
);
326 struct sm_state
*clone_sm(struct sm_state
*s
)
328 struct sm_state
*ret
;
330 ret
= alloc_state_no_name(s
->owner
, s
->name
, s
->sym
, s
->state
);
331 ret
->merged
= s
->merged
;
333 /* clone_sm() doesn't copy the pools. Each state needs to have
335 ret
->possible
= clone_slist(s
->possible
);
337 ret
->right
= s
->right
;
338 ret
->nr_children
= s
->nr_children
;
342 int is_merged(struct sm_state
*sm
)
347 int is_leaf(struct sm_state
*sm
)
352 int slist_has_state(struct state_list
*slist
, struct smatch_state
*state
)
354 struct sm_state
*tmp
;
356 FOR_EACH_PTR(slist
, tmp
) {
357 if (tmp
->state
== state
)
359 } END_FOR_EACH_PTR(tmp
);
363 struct state_list
*clone_slist(struct state_list
*from_slist
)
366 struct state_list
*to_slist
= NULL
;
368 FOR_EACH_PTR(from_slist
, sm
) {
369 add_ptr_list(&to_slist
, sm
);
370 } END_FOR_EACH_PTR(sm
);
374 static struct smatch_state
*merge_states(int owner
, const char *name
,
376 struct smatch_state
*state1
,
377 struct smatch_state
*state2
)
379 struct smatch_state
*ret
;
381 if (state1
== state2
)
383 else if (__has_merge_function(owner
))
384 ret
= __client_merge_function(owner
, state1
, state2
);
385 else if (state1
== &ghost
)
387 else if (state2
== &ghost
)
389 else if (!state1
|| !state2
)
396 struct sm_state
*merge_sm_states(struct sm_state
*one
, struct sm_state
*two
)
398 struct smatch_state
*s
;
399 struct sm_state
*result
;
404 if (out_of_memory()) {
406 sm_warning("Function too hairy. No more merges.");
411 s
= merge_states(one
->owner
, one
->name
, one
->sym
, one
->state
, two
->state
);
412 result
= alloc_state_no_name(one
->owner
, one
->name
, one
->sym
, s
);
416 if (one
->nr_children
+ two
->nr_children
<= MAX_CHILDREN
)
417 result
->nr_children
= one
->nr_children
+ two
->nr_children
;
419 result
->nr_children
= MAX_CHILDREN
;
421 copy_possibles(result
, one
, two
);
424 * The ->line information is used by deref_check where we complain about
425 * checking pointers that have already been dereferenced. Let's say we
426 * dereference a pointer on both the true and false paths and then merge
427 * the states here. The result state is &derefed, but the ->line number
428 * is on the line where the pointer is merged not where it was
431 * So in that case, let's just pick one dereference and set the ->line
436 if (result
->state
== one
->state
)
437 result
->line
= one
->line
;
438 if (result
->state
== two
->state
)
439 result
->line
= two
->line
;
442 strcmp(check_name(one
->owner
), option_debug_check
) == 0) {
443 struct sm_state
*tmp
;
446 printf("%s:%d %s() merge [%s] '%s' %s(L %d) + %s(L %d) => %s (",
447 get_filename(), get_lineno(), get_function(),
448 check_name(one
->owner
), one
->name
,
449 show_state(one
->state
), one
->line
,
450 show_state(two
->state
), two
->line
,
453 FOR_EACH_PTR(result
->possible
, tmp
) {
456 printf("%s", show_state(tmp
->state
));
457 } END_FOR_EACH_PTR(tmp
);
464 struct sm_state
*get_sm_state_stree(struct stree
*stree
, int owner
, const char *name
,
467 struct tracker tracker
= {
469 .name
= (char *)name
,
477 return avl_lookup(stree
, (struct sm_state
*)&tracker
);
480 struct smatch_state
*get_state_stree(struct stree
*stree
,
481 int owner
, const char *name
,
486 sm
= get_sm_state_stree(stree
, owner
, name
, sym
);
492 /* FIXME: this is almost exactly the same as set_sm_state_slist() */
493 void overwrite_sm_state_stree(struct stree
**stree
, struct sm_state
*new)
495 avl_insert(stree
, new);
498 void overwrite_sm_state_stree_stack(struct stree_stack
**stack
,
503 stree
= pop_stree(stack
);
504 overwrite_sm_state_stree(&stree
, sm
);
505 push_stree(stack
, stree
);
508 struct sm_state
*set_state_stree(struct stree
**stree
, int owner
, const char *name
,
509 struct symbol
*sym
, struct smatch_state
*state
)
511 struct sm_state
*new = alloc_sm_state(owner
, name
, sym
, state
);
513 avl_insert(stree
, new);
517 void set_state_stree_perm(struct stree
**stree
, int owner
, const char *name
,
518 struct symbol
*sym
, struct smatch_state
*state
)
522 sm
= malloc(sizeof(*sm
) + strlen(name
) + 1);
523 memset(sm
, 0, sizeof(*sm
));
525 sm
->name
= (char *)(sm
+ 1);
526 strcpy((char *)sm
->name
, name
);
530 overwrite_sm_state_stree(stree
, sm
);
533 void delete_state_stree(struct stree
**stree
, int owner
, const char *name
,
536 struct tracker tracker
= {
538 .name
= (char *)name
,
542 avl_remove(stree
, (struct sm_state
*)&tracker
);
545 void delete_state_stree_stack(struct stree_stack
**stack
, int owner
, const char *name
,
550 stree
= pop_stree(stack
);
551 delete_state_stree(&stree
, owner
, name
, sym
);
552 push_stree(stack
, stree
);
555 void push_stree(struct stree_stack
**stack
, struct stree
*stree
)
557 add_ptr_list(stack
, stree
);
560 struct stree
*pop_stree(struct stree_stack
**stack
)
564 stree
= last_ptr_list((struct ptr_list
*)*stack
);
565 delete_ptr_list_last((struct ptr_list
**)stack
);
569 struct stree
*top_stree(struct stree_stack
*stack
)
571 return last_ptr_list((struct ptr_list
*)stack
);
574 void free_slist(struct state_list
**slist
)
576 __free_ptr_list((struct ptr_list
**)slist
);
579 void free_stree_stack(struct stree_stack
**stack
)
581 __free_ptr_list((struct ptr_list
**)stack
);
584 void free_stack_and_strees(struct stree_stack
**stree_stack
)
588 FOR_EACH_PTR(*stree_stack
, stree
) {
590 } END_FOR_EACH_PTR(stree
);
591 free_stree_stack(stree_stack
);
594 struct sm_state
*set_state_stree_stack(struct stree_stack
**stack
, int owner
, const char *name
,
595 struct symbol
*sym
, struct smatch_state
*state
)
600 stree
= pop_stree(stack
);
601 sm
= set_state_stree(&stree
, owner
, name
, sym
, state
);
602 push_stree(stack
, stree
);
608 * get_sm_state_stack() gets the state for the top slist on the stack.
610 struct sm_state
*get_sm_state_stree_stack(struct stree_stack
*stack
,
611 int owner
, const char *name
,
615 struct sm_state
*ret
;
617 stree
= pop_stree(&stack
);
618 ret
= get_sm_state_stree(stree
, owner
, name
, sym
);
619 push_stree(&stack
, stree
);
623 struct smatch_state
*get_state_stree_stack(struct stree_stack
*stack
,
624 int owner
, const char *name
,
629 sm
= get_sm_state_stree_stack(stack
, owner
, name
, sym
);
635 static void match_states_stree(struct stree
**one
, struct stree
**two
)
637 struct smatch_state
*tmp_state
;
639 struct state_list
*add_to_one
= NULL
;
640 struct state_list
*add_to_two
= NULL
;
644 avl_iter_begin(&one_iter
, *one
, FORWARD
);
645 avl_iter_begin(&two_iter
, *two
, FORWARD
);
648 if (!one_iter
.sm
&& !two_iter
.sm
)
650 if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) < 0) {
651 __set_fake_cur_stree_fast(*two
);
652 tmp_state
= __client_unmatched_state_function(one_iter
.sm
);
653 __pop_fake_cur_stree_fast();
654 sm
= alloc_state_no_name(one_iter
.sm
->owner
, one_iter
.sm
->name
,
655 one_iter
.sm
->sym
, tmp_state
);
656 add_ptr_list(&add_to_two
, sm
);
657 avl_iter_next(&one_iter
);
658 } else if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) == 0) {
659 avl_iter_next(&one_iter
);
660 avl_iter_next(&two_iter
);
662 __set_fake_cur_stree_fast(*one
);
663 tmp_state
= __client_unmatched_state_function(two_iter
.sm
);
664 __pop_fake_cur_stree_fast();
665 sm
= alloc_state_no_name(two_iter
.sm
->owner
, two_iter
.sm
->name
,
666 two_iter
.sm
->sym
, tmp_state
);
667 add_ptr_list(&add_to_one
, sm
);
668 avl_iter_next(&two_iter
);
672 FOR_EACH_PTR(add_to_one
, sm
) {
674 } END_FOR_EACH_PTR(sm
);
676 FOR_EACH_PTR(add_to_two
, sm
) {
678 } END_FOR_EACH_PTR(sm
);
680 free_slist(&add_to_one
);
681 free_slist(&add_to_two
);
684 static void call_pre_merge_hooks(struct stree
**one
, struct stree
**two
)
686 struct sm_state
*sm
, *other
;
690 __swap_cur_stree(*one
);
691 FOR_EACH_SM(*two
, sm
) {
692 other
= get_sm_state(sm
->owner
, sm
->name
, sm
->sym
);
695 call_pre_merge_hook(sm
);
696 } END_FOR_EACH_SM(sm
);
697 *one
= clone_stree(__get_cur_stree());
699 __swap_cur_stree(*two
);
700 FOR_EACH_SM(*one
, sm
) {
701 other
= get_sm_state(sm
->owner
, sm
->name
, sm
->sym
);
704 call_pre_merge_hook(sm
);
705 } END_FOR_EACH_SM(sm
);
706 *two
= clone_stree(__get_cur_stree());
708 restore_all_states();
711 static void clone_pool_havers_stree(struct stree
**stree
)
713 struct sm_state
*sm
, *tmp
;
714 struct state_list
*slist
= NULL
;
716 FOR_EACH_SM(*stree
, sm
) {
719 add_ptr_list(&slist
, tmp
);
721 } END_FOR_EACH_SM(sm
);
723 FOR_EACH_PTR(slist
, sm
) {
724 avl_insert(stree
, sm
);
725 } END_FOR_EACH_PTR(sm
);
733 * merge_slist() is called whenever paths merge, such as after
734 * an if statement. It takes the two slists and creates one.
736 static void __merge_stree(struct stree
**to
, struct stree
*stree
, int add_pool
)
738 struct stree
*results
= NULL
;
739 struct stree
*implied_one
= NULL
;
740 struct stree
*implied_two
= NULL
;
743 struct sm_state
*one
, *two
, *res
;
748 /* merging a null and nonnull path gives you only the nonnull path */
755 *to
= clone_stree(stree
);
759 implied_one
= clone_stree(*to
);
760 implied_two
= clone_stree(stree
);
762 match_states_stree(&implied_one
, &implied_two
);
763 call_pre_merge_hooks(&implied_one
, &implied_two
);
766 clone_pool_havers_stree(&implied_one
);
767 clone_pool_havers_stree(&implied_two
);
769 set_stree_id(&implied_one
, ++__stree_id
);
770 set_stree_id(&implied_two
, ++__stree_id
);
771 if (implied_one
->base_stree
)
772 set_stree_id(&implied_one
->base_stree
, ++__stree_id
);
773 if (implied_two
->base_stree
)
774 set_stree_id(&implied_two
->base_stree
, ++__stree_id
);
777 push_stree(&all_pools
, implied_one
);
778 push_stree(&all_pools
, implied_two
);
780 avl_iter_begin(&one_iter
, implied_one
, FORWARD
);
781 avl_iter_begin(&two_iter
, implied_two
, FORWARD
);
784 if (!one_iter
.sm
|| !two_iter
.sm
)
791 avl_insert(&results
, one
);
796 one
->pool
= implied_one
;
797 if (implied_one
->base_stree
)
798 one
->pool
= implied_one
->base_stree
;
799 two
->pool
= implied_two
;
800 if (implied_two
->base_stree
)
801 two
->pool
= implied_two
->base_stree
;
803 res
= merge_sm_states(one
, two
);
804 add_possible_sm(res
, one
);
805 add_possible_sm(res
, two
);
806 avl_insert(&results
, res
);
808 avl_iter_next(&one_iter
);
809 avl_iter_next(&two_iter
);
816 void merge_stree(struct stree
**to
, struct stree
*stree
)
818 __merge_stree(to
, stree
, 1);
821 void merge_stree_no_pools(struct stree
**to
, struct stree
*stree
)
823 __merge_stree(to
, stree
, 0);
827 * This is unfortunately a bit subtle... The problem is that if a
828 * state is set on one fake stree but not the other then we should
829 * look up the the original state and use that as the unset state.
830 * Fortunately, after you pop your fake stree then the cur_slist should
831 * reflect the original state.
833 void merge_fake_stree(struct stree
**to
, struct stree
*stree
)
835 struct stree
*one
= *to
;
836 struct stree
*two
= stree
;
838 struct state_list
*add_to_one
= NULL
;
839 struct state_list
*add_to_two
= NULL
;
848 *to
= clone_stree(stree
);
852 avl_iter_begin(&one_iter
, one
, FORWARD
);
853 avl_iter_begin(&two_iter
, two
, FORWARD
);
856 if (!one_iter
.sm
&& !two_iter
.sm
)
858 if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) < 0) {
859 sm
= get_sm_state(one_iter
.sm
->owner
, one_iter
.sm
->name
,
862 add_ptr_list(&add_to_two
, sm
);
863 avl_iter_next(&one_iter
);
864 } else if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) == 0) {
865 avl_iter_next(&one_iter
);
866 avl_iter_next(&two_iter
);
868 sm
= get_sm_state(two_iter
.sm
->owner
, two_iter
.sm
->name
,
871 add_ptr_list(&add_to_one
, sm
);
872 avl_iter_next(&two_iter
);
876 FOR_EACH_PTR(add_to_one
, sm
) {
877 avl_insert(&one
, sm
);
878 } END_FOR_EACH_PTR(sm
);
880 FOR_EACH_PTR(add_to_two
, sm
) {
881 avl_insert(&two
, sm
);
882 } END_FOR_EACH_PTR(sm
);
884 one
->base_stree
= clone_stree(__get_cur_stree());
885 FOR_EACH_SM(one
, sm
) {
886 avl_insert(&one
->base_stree
, sm
);
887 } END_FOR_EACH_SM(sm
);
889 two
->base_stree
= clone_stree(__get_cur_stree());
890 FOR_EACH_SM(two
, sm
) {
891 avl_insert(&two
->base_stree
, sm
);
892 } END_FOR_EACH_SM(sm
);
894 free_slist(&add_to_one
);
895 free_slist(&add_to_two
);
897 __merge_stree(&one
, two
, 1);
903 * filter_slist() removes any sm states "slist" holds in common with "filter"
905 void filter_stree(struct stree
**stree
, struct stree
*filter
)
907 struct stree
*results
= NULL
;
911 avl_iter_begin(&one_iter
, *stree
, FORWARD
);
912 avl_iter_begin(&two_iter
, filter
, FORWARD
);
914 /* FIXME: This should probably be re-written with trees in mind */
917 if (!one_iter
.sm
&& !two_iter
.sm
)
919 if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) < 0) {
920 avl_insert(&results
, one_iter
.sm
);
921 avl_iter_next(&one_iter
);
922 } else if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) == 0) {
923 if (one_iter
.sm
!= two_iter
.sm
)
924 avl_insert(&results
, one_iter
.sm
);
925 avl_iter_next(&one_iter
);
926 avl_iter_next(&two_iter
);
928 avl_iter_next(&two_iter
);
938 * and_slist_stack() pops the top two slists, overwriting the one with
939 * the other and pushing it back on the stack.
941 void and_stree_stack(struct stree_stack
**stack
)
943 struct sm_state
*tmp
;
944 struct stree
*right_stree
= pop_stree(stack
);
946 FOR_EACH_SM(right_stree
, tmp
) {
947 overwrite_sm_state_stree_stack(stack
, tmp
);
948 } END_FOR_EACH_SM(tmp
);
949 free_stree(&right_stree
);
953 * or_slist_stack() is for if we have: if (foo || bar) { foo->baz;
954 * It pops the two slists from the top of the stack and merges them
955 * together in a way that preserves the things they have in common
956 * but creates a merged state for most of the rest.
957 * You could have code that had: if (foo || foo) { foo->baz;
958 * It's this function which ensures smatch does the right thing.
960 void or_stree_stack(struct stree_stack
**pre_conds
,
961 struct stree
*cur_stree
,
962 struct stree_stack
**stack
)
966 struct stree
*pre_stree
;
968 struct stree
*tmp_stree
;
970 new = pop_stree(stack
);
971 old
= pop_stree(stack
);
973 pre_stree
= pop_stree(pre_conds
);
974 push_stree(pre_conds
, clone_stree(pre_stree
));
976 res
= clone_stree(pre_stree
);
977 overwrite_stree(old
, &res
);
979 tmp_stree
= clone_stree(cur_stree
);
980 overwrite_stree(new, &tmp_stree
);
982 merge_stree(&res
, tmp_stree
);
983 filter_stree(&res
, pre_stree
);
985 push_stree(stack
, res
);
986 free_stree(&tmp_stree
);
987 free_stree(&pre_stree
);
993 * get_named_stree() is only used for gotos.
995 struct stree
**get_named_stree(struct named_stree_stack
*stack
,
999 struct named_stree
*tmp
;
1001 FOR_EACH_PTR(stack
, tmp
) {
1002 if (tmp
->sym
== sym
&&
1003 strcmp(tmp
->name
, name
) == 0)
1005 } END_FOR_EACH_PTR(tmp
);
1009 /* FIXME: These parameters are in a different order from expected */
1010 void overwrite_stree(struct stree
*from
, struct stree
**to
)
1012 struct sm_state
*tmp
;
1014 FOR_EACH_SM(from
, tmp
) {
1015 overwrite_sm_state_stree(to
, tmp
);
1016 } END_FOR_EACH_SM(tmp
);