flow: don't fake an impossible default
[smatch.git] / smatch_slist.h
blob1b7f7f8a294e299071a5afc63e28a9750b9480bf
1 struct stree;
3 DECLARE_PTR_LIST(state_list, struct sm_state);
4 DECLARE_PTR_LIST(state_list_stack, struct state_list);
6 struct named_stree {
7 char *name;
8 struct symbol *sym;
9 struct stree *stree;
11 DECLARE_ALLOCATOR(named_stree);
12 DECLARE_PTR_LIST(named_stree_stack, struct named_stree);
15 extern struct state_list_stack *implied_pools;
16 extern int __stree_id;
18 char *show_sm(struct sm_state *sm);
19 void __print_stree(struct stree *stree);
20 void add_history(struct sm_state *sm);
21 int cmp_tracker(const struct sm_state *a, const struct sm_state *b);
22 char *alloc_sname(const char *str);
23 struct sm_state *alloc_sm_state(int owner, const char *name,
24 struct symbol *sym, struct smatch_state *state);
26 void free_every_single_sm_state(void);
27 struct sm_state *clone_sm(struct sm_state *s);
28 int is_merged(struct sm_state *sm);
29 int is_leaf(struct sm_state *sm);
30 struct state_list *clone_slist(struct state_list *from_slist);
32 int slist_has_state(struct state_list *slist, struct smatch_state *state);
34 int too_many_possible(struct sm_state *sm);
35 void add_possible_sm(struct sm_state *to, struct sm_state *new);
36 struct sm_state *merge_sm_states(struct sm_state *one, struct sm_state *two);
37 struct smatch_state *get_state_stree(struct stree *stree, int owner, const char *name,
38 struct symbol *sym);
40 struct sm_state *get_sm_state_stree(struct stree *stree, int owner, const char *name,
41 struct symbol *sym);
43 void overwrite_sm_state_stree(struct stree **stree, struct sm_state *sm);
44 void overwrite_sm_state_stree_stack(struct stree_stack **stack, struct sm_state *sm);
45 struct sm_state *set_state_stree(struct stree **stree, int owner, const char *name,
46 struct symbol *sym, struct smatch_state *state);
47 void set_state_stree_perm(struct stree **stree, int owner, const char *name,
48 struct symbol *sym, struct smatch_state *state);
49 void delete_state_stree(struct stree **stree, int owner, const char *name,
50 struct symbol *sym);
52 void delete_state_stree_stack(struct stree_stack **stack, int owner, const char *name,
53 struct symbol *sym);
55 void push_stree(struct stree_stack **list_stack, struct stree *stree);
56 struct stree *pop_stree(struct stree_stack **list_stack);
57 struct stree *top_stree(struct stree_stack *stack);
59 void free_slist(struct state_list **slist);
60 void free_stree_stack(struct stree_stack **stack);
61 void free_stack_and_strees(struct stree_stack **stree_stack);
63 struct sm_state *set_state_stree_stack(struct stree_stack **stack, int owner, const char *name,
64 struct symbol *sym, struct smatch_state *state);
66 struct sm_state *get_sm_state_stree_stack(struct stree_stack *stack,
67 int owner, const char *name,
68 struct symbol *sym);
69 struct smatch_state *get_state_stree_stack(struct stree_stack *stack, int owner,
70 const char *name, struct symbol *sym);
72 int out_of_memory(void);
73 int low_on_memory(void);
74 void merge_stree(struct stree **to, struct stree *stree);
75 void merge_stree_no_pools(struct stree **to, struct stree *stree);
76 void merge_stree(struct stree **to, struct stree *right);
77 void merge_fake_stree(struct stree **to, struct stree *stree);
78 void filter_stree(struct stree **stree, struct stree *filter);
79 void and_stree_stack(struct stree_stack **stree_stack);
81 void or_stree_stack(struct stree_stack **pre_conds,
82 struct stree *cur_stree,
83 struct stree_stack **stack);
85 struct stree **get_named_stree(struct named_stree_stack *stack,
86 const char *name,
87 struct symbol *sym);
89 void overwrite_stree(struct stree *from, struct stree **to);
91 /* add stuff smatch_returns.c here */
93 void all_return_states_hook(void (*callback)(void));