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
)
123 void allocate_dynamic_states_array(int num_checks
)
125 dynamic_states
= calloc(num_checks
+ 1, sizeof(int));
128 void set_dynamic_states(unsigned short owner
)
130 dynamic_states
[owner
] = true;
133 bool has_dynamic_states(unsigned short owner
)
135 if (owner
>= num_checks
)
137 return dynamic_states
[owner
];
140 static int cmp_possible_sm(const struct sm_state
*a
, const struct sm_state
*b
, int preserve
)
147 if (!has_dynamic_states(a
->owner
)) {
148 if (a
->state
> b
->state
)
150 if (a
->state
< b
->state
)
155 if (a
->owner
== SMATCH_EXTRA
) {
157 * In Smatch extra you can have borrowed implications.
159 * FIXME: review how borrowed implications work and if they
160 * are the best way. See also smatch_implied.c.
163 ret
= cmp_tracker(a
, b
);
168 * We want to preserve leaf states. They're use to split
169 * returns in smatch_db.c.
173 if (a
->merged
&& !b
->merged
)
179 if (!a
->state
->name
|| !b
->state
->name
)
182 return strcmp(a
->state
->name
, b
->state
->name
);
185 struct sm_state
*alloc_sm_state(int owner
, const char *name
,
186 struct symbol
*sym
, struct smatch_state
*state
)
188 struct sm_state
*sm_state
= __alloc_sm_state(0);
192 sm_state
->name
= alloc_sname(name
);
193 sm_state
->owner
= owner
;
195 sm_state
->state
= state
;
196 sm_state
->line
= get_lineno();
197 sm_state
->merged
= 0;
198 sm_state
->pool
= NULL
;
199 sm_state
->left
= NULL
;
200 sm_state
->right
= NULL
;
201 sm_state
->possible
= NULL
;
202 add_ptr_list(&sm_state
->possible
, sm_state
);
206 static struct sm_state
*alloc_state_no_name(int owner
, const char *name
,
208 struct smatch_state
*state
)
210 struct sm_state
*tmp
;
212 tmp
= alloc_sm_state(owner
, NULL
, sym
, state
);
217 int too_many_possible(struct sm_state
*sm
)
219 if (ptr_list_size((struct ptr_list
*)sm
->possible
) >= 100)
224 void add_possible_sm(struct sm_state
*to
, struct sm_state
*new)
226 struct sm_state
*tmp
;
230 if (too_many_possible(to
))
233 FOR_EACH_PTR(to
->possible
, tmp
) {
234 cmp
= cmp_possible_sm(tmp
, new, preserve
);
240 INSERT_CURRENT(new, tmp
);
243 } END_FOR_EACH_PTR(tmp
);
244 add_ptr_list(&to
->possible
, new);
247 static void copy_possibles(struct sm_state
*to
, struct sm_state
*one
, struct sm_state
*two
)
249 struct sm_state
*large
= one
;
250 struct sm_state
*small
= two
;
251 struct sm_state
*tmp
;
254 * We spend a lot of time copying the possible lists. I've tried to
255 * optimize the process a bit.
259 if (ptr_list_size((struct ptr_list
*)two
->possible
) >
260 ptr_list_size((struct ptr_list
*)one
->possible
)) {
265 to
->possible
= clone_slist(large
->possible
);
266 add_possible_sm(to
, to
);
267 FOR_EACH_PTR(small
->possible
, tmp
) {
268 add_possible_sm(to
, tmp
);
269 } END_FOR_EACH_PTR(tmp
);
272 char *alloc_sname(const char *str
)
278 tmp
= __alloc_sname(strlen(str
) + 1);
283 static struct symbol
*oom_func
;
284 static int oom_limit
= 3000000; /* Start with a 3GB limit */
285 int out_of_memory(void)
291 * I decided to use 50M here based on trial and error.
292 * It works out OK for the kernel and so it should work
293 * for most other projects as well.
295 if (sm_state_counter
* sizeof(struct sm_state
) >= 100000000)
299 * We're reading from statm to figure out how much memory we
300 * are using. The problem is that at the end of the function
301 * we release the memory, so that it can be re-used but it
302 * stays in cache, it's not released to the OS. So then if
303 * we allocate memory for different purposes we can easily
304 * hit the 3GB limit on the next function, so that's why I give
305 * the next function an extra 100MB to work with.
308 if (get_mem_kb() > oom_limit
) {
309 oom_func
= cur_func_sym
;
311 sm_perror("OOM: %luKb sm_state_count = %d", get_mem_kb(), sm_state_counter
);
319 int low_on_memory(void)
321 if (sm_state_counter
* sizeof(struct sm_state
) >= 25000000)
326 static void free_sm_state(struct sm_state
*sm
)
328 free_slist(&sm
->possible
);
330 * fixme. Free the actual state.
331 * Right now we leave it until the end of the function
332 * because we don't want to double free it.
333 * Use the freelist to not double free things
337 static void free_all_sm_states(struct allocation_blob
*blob
)
339 unsigned int size
= sizeof(struct sm_state
);
340 unsigned int offset
= 0;
342 while (offset
< blob
->offset
) {
343 free_sm_state((struct sm_state
*)(blob
->data
+ offset
));
348 /* At the end of every function we free all the sm_states */
349 void free_every_single_sm_state(void)
351 struct allocator_struct
*desc
= &sm_state_allocator
;
352 struct allocation_blob
*blob
= desc
->blobs
;
355 desc
->allocations
= 0;
356 desc
->total_bytes
= 0;
357 desc
->useful_bytes
= 0;
358 desc
->freelist
= NULL
;
360 struct allocation_blob
*next
= blob
->next
;
361 free_all_sm_states(blob
);
362 blob_free(blob
, desc
->chunking
);
366 clear_smatch_state_alloc();
368 free_stack_and_strees(&all_pools
);
369 sm_state_counter
= 0;
376 unsigned long get_pool_count(void)
378 return ptr_list_size((struct ptr_list
*)all_pools
);
381 struct sm_state
*clone_sm(struct sm_state
*s
)
383 struct sm_state
*ret
;
385 ret
= alloc_state_no_name(s
->owner
, s
->name
, s
->sym
, s
->state
);
386 ret
->merged
= s
->merged
;
388 /* clone_sm() doesn't copy the pools. Each state needs to have
390 ret
->possible
= clone_slist(s
->possible
);
392 ret
->right
= s
->right
;
396 int is_merged(struct sm_state
*sm
)
401 int is_leaf(struct sm_state
*sm
)
406 int slist_has_state(struct state_list
*slist
, struct smatch_state
*state
)
408 struct sm_state
*tmp
;
410 FOR_EACH_PTR(slist
, tmp
) {
411 if (tmp
->state
== state
)
413 } END_FOR_EACH_PTR(tmp
);
417 struct state_list
*clone_slist(struct state_list
*from_slist
)
420 struct state_list
*to_slist
= NULL
;
422 FOR_EACH_PTR(from_slist
, sm
) {
423 add_ptr_list(&to_slist
, sm
);
424 } END_FOR_EACH_PTR(sm
);
428 static struct smatch_state
*merge_states(int owner
, const char *name
,
430 struct smatch_state
*state1
,
431 struct smatch_state
*state2
)
433 struct smatch_state
*ret
;
435 if (state1
== state2
)
437 else if (__has_merge_function(owner
))
438 ret
= __client_merge_function(owner
, state1
, state2
);
439 else if (state1
== &ghost
)
441 else if (state2
== &ghost
)
443 else if (!state1
|| !state2
)
450 struct sm_state
*merge_sm_states(struct sm_state
*one
, struct sm_state
*two
)
452 struct smatch_state
*s
;
453 struct sm_state
*result
;
458 if (out_of_memory()) {
460 sm_warning("Function too hairy. No more merges.");
465 s
= merge_states(one
->owner
, one
->name
, one
->sym
, one
->state
, two
->state
);
466 result
= alloc_state_no_name(one
->owner
, one
->name
, one
->sym
, s
);
471 copy_possibles(result
, one
, two
);
474 * The ->line information is used by deref_check where we complain about
475 * checking pointers that have already been dereferenced. Let's say we
476 * dereference a pointer on both the true and false paths and then merge
477 * the states here. The result state is &derefed, but the ->line number
478 * is on the line where the pointer is merged not where it was
481 * So in that case, let's just pick one dereference and set the ->line
486 if (result
->state
== one
->state
)
487 result
->line
= one
->line
;
488 if (result
->state
== two
->state
)
489 result
->line
= two
->line
;
492 strcmp(check_name(one
->owner
), option_debug_check
) == 0) {
493 struct sm_state
*tmp
;
496 printf("%s:%d %s() merge [%s] '%s' %s(L %d) + %s(L %d) => %s (",
497 get_filename(), get_lineno(), get_function(),
498 check_name(one
->owner
), one
->name
,
499 show_state(one
->state
), one
->line
,
500 show_state(two
->state
), two
->line
,
503 FOR_EACH_PTR(result
->possible
, tmp
) {
506 printf("%s", show_state(tmp
->state
));
507 } END_FOR_EACH_PTR(tmp
);
514 struct sm_state
*get_sm_state_stree(struct stree
*stree
, int owner
, const char *name
,
517 struct tracker tracker
= {
519 .name
= (char *)name
,
527 return avl_lookup(stree
, (struct sm_state
*)&tracker
);
530 struct smatch_state
*get_state_stree(struct stree
*stree
,
531 int owner
, const char *name
,
536 sm
= get_sm_state_stree(stree
, owner
, name
, sym
);
542 /* FIXME: this is almost exactly the same as set_sm_state_slist() */
543 void overwrite_sm_state_stree(struct stree
**stree
, struct sm_state
*new)
545 avl_insert(stree
, new);
548 void overwrite_sm_state_stree_stack(struct stree_stack
**stack
,
553 stree
= pop_stree(stack
);
554 overwrite_sm_state_stree(&stree
, sm
);
555 push_stree(stack
, stree
);
558 struct sm_state
*set_state_stree(struct stree
**stree
, int owner
, const char *name
,
559 struct symbol
*sym
, struct smatch_state
*state
)
561 struct sm_state
*new = alloc_sm_state(owner
, name
, sym
, state
);
563 avl_insert(stree
, new);
567 void set_state_stree_perm(struct stree
**stree
, int owner
, const char *name
,
568 struct symbol
*sym
, struct smatch_state
*state
)
572 sm
= malloc(sizeof(*sm
) + strlen(name
) + 1);
573 memset(sm
, 0, sizeof(*sm
));
575 sm
->name
= (char *)(sm
+ 1);
576 strcpy((char *)sm
->name
, name
);
580 overwrite_sm_state_stree(stree
, sm
);
583 void delete_state_stree(struct stree
**stree
, int owner
, const char *name
,
586 struct tracker tracker
= {
588 .name
= (char *)name
,
592 avl_remove(stree
, (struct sm_state
*)&tracker
);
595 void delete_state_stree_stack(struct stree_stack
**stack
, int owner
, const char *name
,
600 stree
= pop_stree(stack
);
601 delete_state_stree(&stree
, owner
, name
, sym
);
602 push_stree(stack
, stree
);
605 void push_stree(struct stree_stack
**stack
, struct stree
*stree
)
607 add_ptr_list(stack
, stree
);
610 struct stree
*pop_stree(struct stree_stack
**stack
)
614 stree
= last_ptr_list((struct ptr_list
*)*stack
);
615 delete_ptr_list_last((struct ptr_list
**)stack
);
619 struct stree
*top_stree(struct stree_stack
*stack
)
621 return last_ptr_list((struct ptr_list
*)stack
);
624 void free_slist(struct state_list
**slist
)
626 __free_ptr_list((struct ptr_list
**)slist
);
629 void free_stree_stack(struct stree_stack
**stack
)
631 __free_ptr_list((struct ptr_list
**)stack
);
634 void free_stack_and_strees(struct stree_stack
**stree_stack
)
638 FOR_EACH_PTR(*stree_stack
, stree
) {
640 } END_FOR_EACH_PTR(stree
);
641 free_stree_stack(stree_stack
);
644 struct sm_state
*set_state_stree_stack(struct stree_stack
**stack
, int owner
, const char *name
,
645 struct symbol
*sym
, struct smatch_state
*state
)
650 stree
= pop_stree(stack
);
651 sm
= set_state_stree(&stree
, owner
, name
, sym
, state
);
652 push_stree(stack
, stree
);
658 * get_sm_state_stack() gets the state for the top slist on the stack.
660 struct sm_state
*get_sm_state_stree_stack(struct stree_stack
*stack
,
661 int owner
, const char *name
,
665 struct sm_state
*ret
;
667 stree
= pop_stree(&stack
);
668 ret
= get_sm_state_stree(stree
, owner
, name
, sym
);
669 push_stree(&stack
, stree
);
673 struct smatch_state
*get_state_stree_stack(struct stree_stack
*stack
,
674 int owner
, const char *name
,
679 sm
= get_sm_state_stree_stack(stack
, owner
, name
, sym
);
685 static void match_states_stree(struct stree
**one
, struct stree
**two
)
687 struct smatch_state
*tmp_state
;
689 struct state_list
*add_to_one
= NULL
;
690 struct state_list
*add_to_two
= NULL
;
694 avl_iter_begin(&one_iter
, *one
, FORWARD
);
695 avl_iter_begin(&two_iter
, *two
, FORWARD
);
698 if (!one_iter
.sm
&& !two_iter
.sm
)
700 if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) < 0) {
701 __set_fake_cur_stree_fast(*two
);
702 tmp_state
= __client_unmatched_state_function(one_iter
.sm
);
703 __pop_fake_cur_stree_fast();
704 sm
= alloc_state_no_name(one_iter
.sm
->owner
, one_iter
.sm
->name
,
705 one_iter
.sm
->sym
, tmp_state
);
706 add_ptr_list(&add_to_two
, sm
);
707 avl_iter_next(&one_iter
);
708 } else if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) == 0) {
709 avl_iter_next(&one_iter
);
710 avl_iter_next(&two_iter
);
712 __set_fake_cur_stree_fast(*one
);
713 tmp_state
= __client_unmatched_state_function(two_iter
.sm
);
714 __pop_fake_cur_stree_fast();
715 sm
= alloc_state_no_name(two_iter
.sm
->owner
, two_iter
.sm
->name
,
716 two_iter
.sm
->sym
, tmp_state
);
717 add_ptr_list(&add_to_one
, sm
);
718 avl_iter_next(&two_iter
);
722 FOR_EACH_PTR(add_to_one
, sm
) {
724 } END_FOR_EACH_PTR(sm
);
726 FOR_EACH_PTR(add_to_two
, sm
) {
728 } END_FOR_EACH_PTR(sm
);
730 free_slist(&add_to_one
);
731 free_slist(&add_to_two
);
734 static void call_pre_merge_hooks(struct stree
**one
, struct stree
**two
)
736 struct sm_state
*sm
, *other
;
740 __swap_cur_stree(*one
);
741 FOR_EACH_SM(*two
, sm
) {
742 other
= get_sm_state(sm
->owner
, sm
->name
, sm
->sym
);
745 call_pre_merge_hook(sm
);
746 } END_FOR_EACH_SM(sm
);
747 *one
= clone_stree(__get_cur_stree());
749 __swap_cur_stree(*two
);
750 FOR_EACH_SM(*one
, sm
) {
751 other
= get_sm_state(sm
->owner
, sm
->name
, sm
->sym
);
754 call_pre_merge_hook(sm
);
755 } END_FOR_EACH_SM(sm
);
756 *two
= clone_stree(__get_cur_stree());
758 restore_all_states();
761 static void clone_pool_havers_stree(struct stree
**stree
)
763 struct sm_state
*sm
, *tmp
;
764 struct state_list
*slist
= NULL
;
766 FOR_EACH_SM(*stree
, sm
) {
769 add_ptr_list(&slist
, tmp
);
771 } END_FOR_EACH_SM(sm
);
773 FOR_EACH_PTR(slist
, sm
) {
774 avl_insert(stree
, sm
);
775 } END_FOR_EACH_PTR(sm
);
783 * merge_slist() is called whenever paths merge, such as after
784 * an if statement. It takes the two slists and creates one.
786 static void __merge_stree(struct stree
**to
, struct stree
*stree
, int add_pool
)
788 struct stree
*results
= NULL
;
789 struct stree
*implied_one
= NULL
;
790 struct stree
*implied_two
= NULL
;
793 struct sm_state
*one
, *two
, *res
;
798 /* merging a null and nonnull path gives you only the nonnull path */
805 *to
= clone_stree(stree
);
809 implied_one
= clone_stree(*to
);
810 implied_two
= clone_stree(stree
);
812 match_states_stree(&implied_one
, &implied_two
);
813 call_pre_merge_hooks(&implied_one
, &implied_two
);
816 clone_pool_havers_stree(&implied_one
);
817 clone_pool_havers_stree(&implied_two
);
819 set_stree_id(&implied_one
, ++__stree_id
);
820 set_stree_id(&implied_two
, ++__stree_id
);
821 if (implied_one
->base_stree
)
822 set_stree_id(&implied_one
->base_stree
, ++__stree_id
);
823 if (implied_two
->base_stree
)
824 set_stree_id(&implied_two
->base_stree
, ++__stree_id
);
827 push_stree(&all_pools
, implied_one
);
828 push_stree(&all_pools
, implied_two
);
830 avl_iter_begin(&one_iter
, implied_one
, FORWARD
);
831 avl_iter_begin(&two_iter
, implied_two
, FORWARD
);
834 if (!one_iter
.sm
|| !two_iter
.sm
)
841 avl_insert(&results
, one
);
846 one
->pool
= implied_one
;
847 if (implied_one
->base_stree
)
848 one
->pool
= implied_one
->base_stree
;
849 two
->pool
= implied_two
;
850 if (implied_two
->base_stree
)
851 two
->pool
= implied_two
->base_stree
;
853 res
= merge_sm_states(one
, two
);
854 add_possible_sm(res
, one
);
855 add_possible_sm(res
, two
);
856 avl_insert(&results
, res
);
858 avl_iter_next(&one_iter
);
859 avl_iter_next(&two_iter
);
866 void merge_stree(struct stree
**to
, struct stree
*stree
)
868 __merge_stree(to
, stree
, 1);
871 void merge_stree_no_pools(struct stree
**to
, struct stree
*stree
)
873 __merge_stree(to
, stree
, 0);
877 * This is unfortunately a bit subtle... The problem is that if a
878 * state is set on one fake stree but not the other then we should
879 * look up the the original state and use that as the unset state.
880 * Fortunately, after you pop your fake stree then the cur_slist should
881 * reflect the original state.
883 void merge_fake_stree(struct stree
**to
, struct stree
*stree
)
885 struct stree
*one
= *to
;
886 struct stree
*two
= stree
;
888 struct state_list
*add_to_one
= NULL
;
889 struct state_list
*add_to_two
= NULL
;
898 *to
= clone_stree(stree
);
902 avl_iter_begin(&one_iter
, one
, FORWARD
);
903 avl_iter_begin(&two_iter
, two
, FORWARD
);
906 if (!one_iter
.sm
&& !two_iter
.sm
)
908 if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) < 0) {
909 sm
= get_sm_state(one_iter
.sm
->owner
, one_iter
.sm
->name
,
912 add_ptr_list(&add_to_two
, sm
);
913 avl_iter_next(&one_iter
);
914 } else if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) == 0) {
915 avl_iter_next(&one_iter
);
916 avl_iter_next(&two_iter
);
918 sm
= get_sm_state(two_iter
.sm
->owner
, two_iter
.sm
->name
,
921 add_ptr_list(&add_to_one
, sm
);
922 avl_iter_next(&two_iter
);
926 FOR_EACH_PTR(add_to_one
, sm
) {
927 avl_insert(&one
, sm
);
928 } END_FOR_EACH_PTR(sm
);
930 FOR_EACH_PTR(add_to_two
, sm
) {
931 avl_insert(&two
, sm
);
932 } END_FOR_EACH_PTR(sm
);
934 one
->base_stree
= clone_stree(__get_cur_stree());
935 FOR_EACH_SM(one
, sm
) {
936 avl_insert(&one
->base_stree
, sm
);
937 } END_FOR_EACH_SM(sm
);
939 two
->base_stree
= clone_stree(__get_cur_stree());
940 FOR_EACH_SM(two
, sm
) {
941 avl_insert(&two
->base_stree
, sm
);
942 } END_FOR_EACH_SM(sm
);
944 free_slist(&add_to_one
);
945 free_slist(&add_to_two
);
947 __merge_stree(&one
, two
, 1);
953 * filter_slist() removes any sm states "slist" holds in common with "filter"
955 void filter_stree(struct stree
**stree
, struct stree
*filter
)
957 struct stree
*results
= NULL
;
961 avl_iter_begin(&one_iter
, *stree
, FORWARD
);
962 avl_iter_begin(&two_iter
, filter
, FORWARD
);
964 /* FIXME: This should probably be re-written with trees in mind */
967 if (!one_iter
.sm
&& !two_iter
.sm
)
969 if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) < 0) {
970 avl_insert(&results
, one_iter
.sm
);
971 avl_iter_next(&one_iter
);
972 } else if (cmp_tracker(one_iter
.sm
, two_iter
.sm
) == 0) {
973 if (one_iter
.sm
!= two_iter
.sm
)
974 avl_insert(&results
, one_iter
.sm
);
975 avl_iter_next(&one_iter
);
976 avl_iter_next(&two_iter
);
978 avl_iter_next(&two_iter
);
988 * and_slist_stack() pops the top two slists, overwriting the one with
989 * the other and pushing it back on the stack.
991 void and_stree_stack(struct stree_stack
**stack
)
993 struct sm_state
*tmp
;
994 struct stree
*right_stree
= pop_stree(stack
);
996 FOR_EACH_SM(right_stree
, tmp
) {
997 overwrite_sm_state_stree_stack(stack
, tmp
);
998 } END_FOR_EACH_SM(tmp
);
999 free_stree(&right_stree
);
1003 * or_slist_stack() is for if we have: if (foo || bar) { foo->baz;
1004 * It pops the two slists from the top of the stack and merges them
1005 * together in a way that preserves the things they have in common
1006 * but creates a merged state for most of the rest.
1007 * You could have code that had: if (foo || foo) { foo->baz;
1008 * It's this function which ensures smatch does the right thing.
1010 void or_stree_stack(struct stree_stack
**pre_conds
,
1011 struct stree
*cur_stree
,
1012 struct stree_stack
**stack
)
1016 struct stree
*pre_stree
;
1018 struct stree
*tmp_stree
;
1020 new = pop_stree(stack
);
1021 old
= pop_stree(stack
);
1023 pre_stree
= pop_stree(pre_conds
);
1024 push_stree(pre_conds
, clone_stree(pre_stree
));
1026 res
= clone_stree(pre_stree
);
1027 overwrite_stree(old
, &res
);
1029 tmp_stree
= clone_stree(cur_stree
);
1030 overwrite_stree(new, &tmp_stree
);
1032 merge_stree(&res
, tmp_stree
);
1033 filter_stree(&res
, pre_stree
);
1035 push_stree(stack
, res
);
1036 free_stree(&tmp_stree
);
1037 free_stree(&pre_stree
);
1043 * get_named_stree() is only used for gotos.
1045 struct stree
**get_named_stree(struct named_stree_stack
*stack
,
1049 struct named_stree
*tmp
;
1051 FOR_EACH_PTR(stack
, tmp
) {
1052 if (tmp
->sym
== sym
&&
1053 strcmp(tmp
->name
, name
) == 0)
1055 } END_FOR_EACH_PTR(tmp
);
1059 /* FIXME: These parameters are in a different order from expected */
1060 void overwrite_stree(struct stree
*from
, struct stree
**to
)
1062 struct sm_state
*tmp
;
1064 FOR_EACH_SM(from
, tmp
) {
1065 overwrite_sm_state_stree(to
, tmp
);
1066 } END_FOR_EACH_SM(tmp
);