func_map(),
func_map_rev(),
func_nodes(),
- write_history(),
- write_locations()
+ write_history(), // snapshot data structure
+ loc_func_nodes_map() // shapshot data structure
{}
void ModelHistory::enter_function(const uint32_t func_id, thread_id_t tid)
if (last_func_id == func_id) {
FuncNode * func_node = func_nodes[func_id];
- func_node->clear_read_map(tid);
+ //func_node->clear_read_map(tid);
- // model_print("hello function %s and thread %d\n", func_node->get_func_name(), tid);
action_list_t * curr_act_list = func_act_lists->back();
- func_node->update_tree(curr_act_list);
+
+ /* defer the processing of curr_act_list until the function has exits a few times
+ * (currently 2 times) so that more information can be gathered to infer nullity predicates.
+ */
+ func_node->incr_exit_count();
+ if (func_node->get_exit_count() >= 2) {
+ ModelList<action_list_t *> * action_list_buffer = func_node->get_action_list_buffer();
+ while (action_list_buffer->size() > 0) {
+ action_list_t * act_list = action_list_buffer->back();
+ action_list_buffer->pop_back();
+ func_node->update_tree(act_list);
+ }
+
+ func_node->update_tree(curr_act_list);
+ } else
+ func_node->get_action_list_buffer()->push_front(curr_act_list);
(*thrd_func_list)[id].pop_back();
func_act_lists->pop_back();
for (uint32_t id = old_size;id < new_size;id++) {
const char * func_name = func_map_rev[id];
- FuncNode * func_node = new FuncNode();
+ FuncNode * func_node = new FuncNode(this);
func_node->set_func_id(id);
func_node->set_func_name(func_name);
func_nodes[id] = func_node;
/* return if thread i has not entered any function or has exited
from all functions */
SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
+ SnapVector< SnapList<action_list_t *> *> *
+ thrd_func_act_lists = model->get_execution()->get_thrd_func_act_lists();
uint32_t id = id_to_int(tid);
if ( thrd_func_list->size() <= id )
/* get the function id that thread i is currently in */
uint32_t func_id = (*thrd_func_list)[id].back();
+ SnapList<action_list_t *> * func_act_lists = (*thrd_func_act_lists)[id];
+
+ if (act->is_write()) {
+ void * location = act->get_location();
+ uint64_t value = act->get_write_value();
+ add_to_write_history(location, value);
+
+ /* update FuncNodes */
+ SnapList<FuncNode *> * func_nodes = loc_func_nodes_map.get(location);
+ sllnode<FuncNode *> * it = NULL;
+ if (func_nodes != NULL)
+ it = func_nodes->begin();
+
+ for (; it != NULL; it = it->getNext()) {
+ FuncNode * func_node = it->getVal();
+ func_node->add_to_val_loc_map(value, location);
+ }
+ }
- if (func_id == 0)
+ /* the following does not care about actions without a position */
+ if (func_id == 0 || act->get_position() == NULL)
return;
- else if ( func_nodes.size() <= func_id )
+
+ if ( func_nodes.size() <= func_id )
resize_func_nodes( func_id + 1 );
FuncNode * func_node = func_nodes[func_id];
- /* do not care about actions without a position */
- if (act->get_position() == NULL)
- return;
+// if (act->is_read())
+// func_node->store_read(act, tid);
+
+ /* add to curr_inst_list */
+ bool second_part_of_rmw = act->is_rmwc() || act->is_rmw();
+ if (!second_part_of_rmw) {
+ action_list_t * curr_act_list = func_act_lists->back();
+ ASSERT(curr_act_list != NULL);
- if (act->is_read())
- func_node->store_read(act, tid);
+ ModelAction * last_act = NULL;
+ if (curr_act_list->size() != 0)
+ last_act = curr_act_list->back();
- if (act->is_write())
- add_to_write_history(act->get_location(), act->get_write_value());
+ // do not add actions with the same sequence number twice
+ if (last_act != NULL && last_act->get_seq_number() == act->get_seq_number())
+ return;
+
+ curr_act_list->push_back(act);
+ func_node->add_inst(act);
+ }
}
/* return the FuncNode given its func_id */
return func_nodes[func_id];
}
+/*
uint64_t ModelHistory::query_last_read(void * location, thread_id_t tid)
{
SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
return last_read_val;
}
+*/
void ModelHistory::add_to_write_history(void * location, uint64_t write_val)
{
- write_set_t * write_set = write_history.get(location);
+ value_set_t * write_set = write_history.get(location);
if (write_set == NULL) {
- write_set = new write_set_t();
+ write_set = new value_set_t();
write_history.put(location, write_set);
}
write_set->add(write_val);
- write_locations.add(location);
+}
+
+void ModelHistory::add_to_loc_func_nodes_map(void * location, FuncNode * node)
+{
+ SnapList<FuncNode *> * func_node_list = loc_func_nodes_map.get(location);
+ if (func_node_list == NULL) {
+ func_node_list = new SnapList<FuncNode *>();
+ loc_func_nodes_map.put(location, func_node_list);
+ }
+
+ func_node_list->push_back(node);
+}
+
+void ModelHistory::set_new_exec_flag()
+{
+ for (uint i = 1; i < func_nodes.size(); i++) {
+ FuncNode * func_node = func_nodes[i];
+ func_node->set_new_exec_flag();
+ }
}
void ModelHistory::print_write()