3 extern int unfree_stree
;
5 DECLARE_PTR_LIST(state_list
, struct sm_state
);
6 DECLARE_PTR_LIST(state_list_stack
, struct state_list
);
13 DECLARE_ALLOCATOR(named_stree
);
14 DECLARE_PTR_LIST(named_stree_stack
, struct named_stree
);
17 extern struct state_list_stack
*implied_pools
;
18 extern int __stree_id
;
19 extern int sm_state_counter
;
21 const char *show_sm(struct sm_state
*sm
);
22 void __print_stree(struct stree
*stree
);
23 void __diff_stree(struct stree
*old
, struct stree
*new);
24 void add_history(struct sm_state
*sm
);
25 int cmp_tracker(const struct sm_state
*a
, const struct sm_state
*b
);
26 char *alloc_sname(const char *str
);
27 struct sm_state
*alloc_sm_state(int owner
, const char *name
,
28 struct symbol
*sym
, struct smatch_state
*state
);
30 void free_every_single_sm_state(void);
31 struct sm_state
*clone_sm(struct sm_state
*s
);
32 int is_merged(struct sm_state
*sm
);
33 int is_leaf(struct sm_state
*sm
);
34 struct state_list
*clone_slist(struct state_list
*from_slist
);
36 int slist_has_state(struct state_list
*slist
, struct smatch_state
*state
);
38 int too_many_possible(struct sm_state
*sm
);
39 void add_possible_sm(struct sm_state
*to
, struct sm_state
*new);
40 struct sm_state
*merge_sm_states(struct sm_state
*one
, struct sm_state
*two
);
41 struct smatch_state
*get_state_stree(struct stree
*stree
, int owner
, const char *name
,
44 struct sm_state
*get_sm_state_stree(struct stree
*stree
, int owner
, const char *name
,
47 void overwrite_sm_state_stree(struct stree
**stree
, struct sm_state
*sm
);
48 void overwrite_sm_state_stree_stack(struct stree_stack
**stack
, struct sm_state
*sm
);
49 struct sm_state
*set_state_stree(struct stree
**stree
, int owner
, const char *name
,
50 struct symbol
*sym
, struct smatch_state
*state
);
51 void set_state_stree_perm(struct stree
**stree
, int owner
, const char *name
,
52 struct symbol
*sym
, struct smatch_state
*state
);
53 void delete_state_stree(struct stree
**stree
, int owner
, const char *name
,
56 void delete_state_stree_stack(struct stree_stack
**stack
, int owner
, const char *name
,
59 void push_stree(struct stree_stack
**list_stack
, struct stree
*stree
);
60 struct stree
*pop_stree(struct stree_stack
**list_stack
);
61 struct stree
*top_stree(struct stree_stack
*stack
);
63 void free_slist(struct state_list
**slist
);
64 void free_stree_stack(struct stree_stack
**stack
);
65 void free_stack_and_strees(struct stree_stack
**stree_stack
);
66 unsigned long get_pool_count(void);
68 struct sm_state
*set_state_stree_stack(struct stree_stack
**stack
, int owner
, const char *name
,
69 struct symbol
*sym
, struct smatch_state
*state
);
71 struct sm_state
*get_sm_state_stree_stack(struct stree_stack
*stack
,
72 int owner
, const char *name
,
74 struct smatch_state
*get_state_stree_stack(struct stree_stack
*stack
, int owner
,
75 const char *name
, struct symbol
*sym
);
77 int out_of_memory(void);
78 int low_on_memory(void);
79 void merge_stree(struct stree
**to
, struct stree
*stree
);
80 void merge_stree_no_pools(struct stree
**to
, struct stree
*stree
);
81 void merge_stree(struct stree
**to
, struct stree
*right
);
82 void merge_fake_stree(struct stree
**to
, struct stree
*stree
);
83 void filter_stree(struct stree
**stree
, struct stree
*filter
);
84 void and_stree_stack(struct stree_stack
**stree_stack
);
86 void or_stree_stack(struct stree_stack
**pre_conds
,
87 struct stree
*cur_stree
,
88 struct stree_stack
**stack
);
90 struct stree
**get_named_stree(struct named_stree_stack
*stack
,
94 void overwrite_stree(struct stree
*from
, struct stree
**to
);
96 /* add stuff smatch_returns.c here */
98 void all_return_states_hook(void (*callback
)(void));
100 void allocate_dynamic_states_array(int num_checks
);