void update_tree(action_list_t * act_list);
void update_inst_tree(func_inst_list_t * inst_list);
void update_predicate_tree(action_list_t * act_list);
- bool follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act, SnapVector<Predicate *> * unset_predicates);
+ bool follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act, Predicate ** unset_predicate);
void incr_exit_count() { exit_count++; }
uint32_t get_exit_count() { return exit_count; }
ModelList<FuncNode *> * get_out_edges() { return &out_edges; }
int compute_distance(FuncNode * target, int max_step = MAX_DIST);
+ void add_failed_predicate(Predicate * pred);
+
void print_predicate_tree();
MEMALLOC
/* Run-time position in the predicate tree for each thread */
ModelVector<Predicate *> predicate_tree_position;
+
PredSet predicate_leaves;
+ ModelVector<Predicate *> leaves_tmp_storage;
+ ModelVector<Predicate *> weight_debug_vec;
+ PredSet failed_predicates;
/* Store the relation between this FuncNode and other FuncNodes */
HashTable<FuncNode *, edge_type_t, uintptr_t, 0, model_malloc, model_calloc, model_free> edge_table;