1 #ifndef __PREDICTAE_H__
2 #define __PREDICATE_H__
7 unsigned int pred_expr_hash (struct pred_expr *);
8 bool pred_expr_equal(struct pred_expr *, struct pred_expr *);
9 typedef HashSet<struct pred_expr *, uintptr_t, 0, model_malloc, model_calloc, model_free, pred_expr_hash, pred_expr_equal> PredExprSet;
10 typedef HSIterator<struct pred_expr *, uintptr_t, 0, model_malloc, model_calloc, model_free, pred_expr_hash, pred_expr_equal> PredExprSetIter;
12 typedef enum predicate_token {
16 /* If token is EQUALITY, then the predicate asserts whether
17 * this load should read the same value as the last value
18 * read at memory location specified in predicate_expr.
21 pred_expr(token_t token, void * location, bool value) :
37 Predicate(FuncInst * func_inst, bool is_entry = false);
40 FuncInst * get_func_inst() { return func_inst; }
41 PredExprSet * get_pred_expressions() { return &pred_expressions; }
42 void add_predicate(token_t token, void * location, bool value);
43 void add_child(Predicate * child);
44 void add_parent(Predicate * parent);
45 void set_backedge(Predicate * back_pred) { backedge = back_pred; }
47 ModelVector<Predicate *> * get_children() { return &children; }
48 ModelVector<Predicate *> * get_parents() { return &parents; }
49 Predicate * get_backedge() { return backedge; }
51 bool is_entry_predicate() { return entry_predicate; }
52 void set_entry_predicate() { entry_predicate = true; }
54 void print_predicate();
55 void print_pred_subtree();
61 /* may have multiple predicates */
62 PredExprSet pred_expressions;
63 ModelVector<Predicate *> children;
64 ModelVector<Predicate *> parents;
65 /* assume almost one back edge exists */
69 #endif /* __PREDICATE_H__ */