#define __FUNCNODE_H__
#include "hashset.h"
+#include "hashfunction.h"
#include "classlist.h"
#include "threads-model.h"
#define MAX_DIST 10
-typedef ModelList<FuncInst *> func_inst_list_mt;
+typedef ModelList<FuncInst *> func_inst_list_mt;
typedef enum edge_type {
IN_EDGE, OUT_EDGE, BI_EDGE
} edge_type_t;
void set_new_exec_flag();
void add_inst(ModelAction *act);
+ FuncInst * create_new_inst(ModelAction *act);
FuncInst * get_inst(ModelAction *act);
HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> * getFuncInstMap() { return &func_inst_map; }
ModelList<FuncNode *> * get_out_edges() { return &out_edges; }
int compute_distance(FuncNode * target, int max_step = MAX_DIST);
+ void assign_base_score();
void print_predicate_tree();
- void print_val_loc_map();
- void print_last_read(thread_id_t tid);
MEMALLOC
private:
uint32_t func_id;
const char * func_name;
ModelHistory * history;
- Predicate * predicate_tree_entry; // a dummy node whose children are the real entries
+ Predicate * predicate_tree_entry; // A dummy node whose children are the real entries
+ Predicate * predicate_tree_exit; // A dummy node
uint32_t exit_count;
uint32_t marker;
loc_set_t * write_locations;
/* Keeps track of locations that have the same values written to */
- HashTable<uint64_t, loc_set_t *, uint64_t, 0> * val_loc_map;
+ HashTable<uint64_t, loc_set_t *, uint64_t, 0, snapshot_malloc, snapshot_calloc, snapshot_free, int64_hash> * val_loc_map;
/* Keeps track of locations that may share the same value as key, deduced from val_loc_map */
HashTable<void *, loc_set_t *, uintptr_t, 0> * loc_may_equal_map;
ModelList<FuncNode *> out_edges;
};
-#endif /* __FUNCNODE_H__ */
+#endif /* __FUNCNODE_H__ */