3 DECLARE_PTR_LIST(state_list
, struct sm_state
);
4 DECLARE_PTR_LIST(state_list_stack
, struct state_list
);
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
;
17 extern int sm_state_counter
;
19 const char *show_sm(struct sm_state
*sm
);
20 void __print_stree(struct stree
*stree
);
21 void add_history(struct sm_state
*sm
);
22 int cmp_tracker(const struct sm_state
*a
, const struct sm_state
*b
);
23 char *alloc_sname(const char *str
);
24 struct sm_state
*alloc_sm_state(int owner
, const char *name
,
25 struct symbol
*sym
, struct smatch_state
*state
);
27 void free_every_single_sm_state(void);
28 struct sm_state
*clone_sm(struct sm_state
*s
);
29 int is_merged(struct sm_state
*sm
);
30 int is_leaf(struct sm_state
*sm
);
31 struct state_list
*clone_slist(struct state_list
*from_slist
);
33 int slist_has_state(struct state_list
*slist
, struct smatch_state
*state
);
35 int too_many_possible(struct sm_state
*sm
);
36 void add_possible_sm(struct sm_state
*to
, struct sm_state
*new);
37 struct sm_state
*merge_sm_states(struct sm_state
*one
, struct sm_state
*two
);
38 struct smatch_state
*get_state_stree(struct stree
*stree
, int owner
, const char *name
,
41 struct sm_state
*get_sm_state_stree(struct stree
*stree
, int owner
, const char *name
,
44 void overwrite_sm_state_stree(struct stree
**stree
, struct sm_state
*sm
);
45 void overwrite_sm_state_stree_stack(struct stree_stack
**stack
, struct sm_state
*sm
);
46 struct sm_state
*set_state_stree(struct stree
**stree
, int owner
, const char *name
,
47 struct symbol
*sym
, struct smatch_state
*state
);
48 void set_state_stree_perm(struct stree
**stree
, int owner
, const char *name
,
49 struct symbol
*sym
, struct smatch_state
*state
);
50 void delete_state_stree(struct stree
**stree
, int owner
, const char *name
,
53 void delete_state_stree_stack(struct stree_stack
**stack
, int owner
, const char *name
,
56 void push_stree(struct stree_stack
**list_stack
, struct stree
*stree
);
57 struct stree
*pop_stree(struct stree_stack
**list_stack
);
58 struct stree
*top_stree(struct stree_stack
*stack
);
60 void free_slist(struct state_list
**slist
);
61 void free_stree_stack(struct stree_stack
**stack
);
62 void free_stack_and_strees(struct stree_stack
**stree_stack
);
64 struct sm_state
*set_state_stree_stack(struct stree_stack
**stack
, int owner
, const char *name
,
65 struct symbol
*sym
, struct smatch_state
*state
);
67 struct sm_state
*get_sm_state_stree_stack(struct stree_stack
*stack
,
68 int owner
, const char *name
,
70 struct smatch_state
*get_state_stree_stack(struct stree_stack
*stack
, int owner
,
71 const char *name
, struct symbol
*sym
);
73 int out_of_memory(void);
74 int low_on_memory(void);
75 void merge_stree(struct stree
**to
, struct stree
*stree
);
76 void merge_stree_no_pools(struct stree
**to
, struct stree
*stree
);
77 void merge_stree(struct stree
**to
, struct stree
*right
);
78 void merge_fake_stree(struct stree
**to
, struct stree
*stree
);
79 void filter_stree(struct stree
**stree
, struct stree
*filter
);
80 void and_stree_stack(struct stree_stack
**stree_stack
);
82 void or_stree_stack(struct stree_stack
**pre_conds
,
83 struct stree
*cur_stree
,
84 struct stree_stack
**stack
);
86 struct stree
**get_named_stree(struct named_stree_stack
*stack
,
90 void overwrite_stree(struct stree
*from
, struct stree
**to
);
92 /* add stuff smatch_returns.c here */
94 void all_return_states_hook(void (*callback
)(void));