10 typedef ModelList<FuncInst *> func_inst_list_mt;
11 typedef HashTable<void *, uint64_t, uintptr_t, 4, model_malloc, model_calloc, model_free> read_map_t;
18 uint32_t get_func_id() { return func_id; }
19 const char * get_func_name() { return func_name; }
20 void set_func_id(uint32_t id) { func_id = id; }
21 void set_func_name(const char * name) { func_name = name; }
23 FuncInst * get_or_add_inst(ModelAction *act);
25 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> * getFuncInstMap() { return &func_inst_map; }
26 func_inst_list_mt * get_inst_list() { return &inst_list; }
27 func_inst_list_mt * get_entry_insts() { return &entry_insts; }
28 void add_entry_inst(FuncInst * inst);
30 void update_tree(action_list_t * act_list);
31 void update_inst_tree(func_inst_list_t * inst_list);
33 void store_read(ModelAction * act, uint32_t tid);
34 uint64_t query_last_read(void * location, uint32_t tid);
35 void clear_read_map(uint32_t tid);
37 /* TODO: generate EQUALITY or NULLITY predicate based on write_history in history.cc */
38 void init_predicate_tree(func_inst_list_t * inst_list, HashTable<FuncInst *, uint64_t, uintptr_t, 4> * read_val_map);
39 void print_predicate_tree();
41 void print_last_read(uint32_t tid);
46 const char * func_name;
47 bool predicate_tree_initialized;
49 /* Use source line number as the key of hashtable, to check if
50 * atomic operation with this line number has been added or not
52 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> func_inst_map;
54 /* list of all atomic actions in this function */
55 func_inst_list_mt inst_list;
57 /* possible entry atomic actions in this function */
58 func_inst_list_mt entry_insts;
60 /* Store the values read by atomic read actions per memory location for each thread */
61 ModelVector<read_map_t *> thrd_read_map;
63 HashSet<Predicate *, uintptr_t, 0, model_malloc, model_calloc, model_free> predicate_tree_entry;
66 #endif /* __FUNCNODE_H__ */