inst_list(),
entry_insts(),
thrd_read_map(),
- read_locations()
+ write_history(),
+ write_locations()
{}
/* Check whether FuncInst with the same type, position, and location
read_map->put(location, read_from_val);
/* Store the memory locations where atomic reads happen */
- read_locations.add(location);
+ // read_locations.add(location);
}
uint64_t FuncNode::query_last_read(void * location, uint32_t tid)
thrd_read_map[tid]->reset();
}
+void FuncNode::add_to_write_history(void * location, uint64_t write_val)
+{
+ write_set_t * write_set = write_history.get(location);
+
+ if (write_set == NULL) {
+ write_set = new write_set_t();
+ write_history.put(location, write_set);
+ }
+
+ write_set->add(write_val);
+ write_locations.add(location);
+}
+
void FuncNode::generate_predicate(FuncInst *func_inst)
{
*/
void FuncNode::print_last_read(uint32_t tid)
{
-/*
ASSERT(thrd_read_map.size() > tid);
read_map_t * read_map = thrd_read_map[tid];
-
+/*
ModelList<void *>::iterator it;
for (it = read_locations.begin();it != read_locations.end();it++) {
if ( !read_map->contains(*it) )
}
*/
}
+
+void FuncNode::print_write()
+{
+ HSIterator<void *, uintptr_t, 4, model_malloc, model_calloc, model_free> * iter;
+ HSIterator<uint64_t, uint64_t, 0, model_malloc, model_calloc, model_free> * write_iter;
+ iter = write_locations.iterator();
+
+ if (write_locations.getSize() > 10) {
+ while (iter->hasNext()) {
+ void * location = iter->next();
+ write_set_t * write_set = write_history.get(location);
+
+// model_print("location: %p contains %d writes\n", location, write_set->getSize());
+ if (write_set->getSize() > 5) {
+ model_print("location %p has writes: ", location);
+ write_iter = write_set->iterator();
+
+ while (write_iter->hasNext()) {
+ uint64_t val = write_iter->next();
+ model_print("%lx ", val);
+ }
+ model_print("\n");
+ }
+ }
+ } else {
+ model_print("\n");
+ }
+ delete iter;
+}
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 HashSet<uint64_t, uint64_t, 0, model_malloc, model_calloc, model_free> write_set_t;
class FuncNode {
public:
uint64_t query_last_read(void * location, uint32_t tid);
void clear_read_map(uint32_t tid);
+ void add_to_write_history(void * location, uint64_t write_val);
+
/* TODO: generate EQUALITY or NULLITY predicate based on write_history in history.cc */
void generate_predicate(FuncInst * func_inst);
void print_last_read(uint32_t tid);
+ void print_write();
MEMALLOC
private:
/* Store the values read by atomic read actions per memory location for each thread */
ModelVector<read_map_t *> thrd_read_map;
- HashSet<void *, uintptr_t, 4, model_malloc, model_calloc, model_free> read_locations;
+
+ HashTable<void *, write_set_t *, uintptr_t, 4, model_malloc, model_calloc, model_free> write_history;
+ HashSet<void *, uintptr_t, 4, model_malloc, model_calloc, model_free> write_locations;
};
#endif /* __FUNCNODE_H__ */
func_counter(1), /* function id starts with 1 */
func_map(),
func_map_rev(),
- func_nodes(),
- write_history()
+ func_nodes()
{}
void ModelHistory::enter_function(const uint32_t func_id, thread_id_t tid)
func_node->store_read(act, tid);
if (inst->is_write())
- add_to_write_history(act->get_location(), act->get_write_value());
+ func_node->add_to_write_history(act->get_location(), act->get_write_value());
/* add to curr_inst_list */
func_inst_list_t * curr_inst_list = func_inst_lists->back();
return last_read_val;
}
-void ModelHistory::add_to_write_history(void * location, uint64_t write_val)
+void ModelHistory::print_write()
{
- write_set_t * write_set = write_history.get(location);
-
- if (write_set == NULL) {
- write_set = new write_set_t();
- write_history.put(location, write_set);
+ for (uint32_t i = 1; i < func_nodes.size(); i++) {
+ FuncNode * func_node = func_nodes[i];
+ model_print("function id: %d, name: %s --- ", i, func_node->get_func_name());
+ func_node->print_write();
}
-
- write_set->add(write_val);
}
-void ModelHistory::print()
+void ModelHistory::print_func_node()
{
/* function id starts with 1 */
- for (uint32_t i = 1;i < func_nodes.size();i++) {
+ for (uint32_t i = 1; i < func_nodes.size(); i++) {
FuncNode * func_node = func_nodes[i];
func_inst_list_mt * entry_insts = func_node->get_entry_insts();
FuncInst *inst = *it;
model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
}
-
/*
func_inst_list_mt * inst_list = funcNode->get_inst_list();
FuncInst *inst = *it;
model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
}
- */
+*/
}
}
void add_to_write_history(void * location, uint64_t write_val);
- void print();
+ void print_write();
+ void print_func_node();
MEMALLOC
private:
ModelVector<const char *> func_map_rev;
ModelVector<FuncNode *> func_nodes;
- HashTable<void *, write_set_t *, uintptr_t, 4, model_malloc, model_calloc, model_free> write_history;
};
#endif /* __HISTORY_H__ */