#include "hashtable.h"
#include "hashset.h"
#include "predicate.h"
+#include "history.h"
typedef ModelList<FuncInst *> func_inst_list_mt;
-typedef HashTable<void *, uint64_t, uintptr_t, 4, model_malloc, model_calloc, model_free> read_map_t;
+typedef HashTable<void *, uint64_t, uintptr_t, 4> read_map_t;
class FuncNode {
public:
- FuncNode();
+ FuncNode(ModelHistory * history);
~FuncNode();
uint32_t get_func_id() { return func_id; }
const char * get_func_name() { return func_name; }
void set_func_id(uint32_t id) { func_id = id; }
void set_func_name(const char * name) { func_name = name; }
+ void set_new_exec_flag();
void add_inst(ModelAction *act);
FuncInst * get_inst(ModelAction *act);
void update_predicate_tree(action_list_t * act_list);
void deep_update(Predicate * pred);
bool follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act, HashTable<FuncInst *, ModelAction *, uintptr_t, 0>* inst_act_map, SnapVector<Predicate *> * unset_predicates);
- void print_predicate_tree();
+ void incr_exit_count() { exit_count++; }
+ uint32_t get_exit_count() { return exit_count; }
+
+ ModelList<action_list_t *> * get_action_list_buffer() { return &action_list_buffer; }
+
+ void print_predicate_tree();
void print_last_read(uint32_t tid);
MEMALLOC
private:
uint32_t func_id;
const char * func_name;
+ ModelHistory * history;
bool predicate_tree_initialized;
Predicate * predicate_tree_entry; // a dummy node whose children are the real entries
+ uint32_t exit_count;
+
/* Use source line number as the key of hashtable, to check if
* atomic operation with this line number has been added or not
*/
/* Store the values read by atomic read actions per memory location for each thread */
ModelVector<read_map_t *> thrd_read_map;
+
+ ModelList<action_list_t *> action_list_buffer;
};
#endif /* __FUNCNODE_H__ */