#include "model.h"
#include "execution.h"
-
+#include "newfuzzer.h"
/** @brief Constructor */
ModelHistory::ModelHistory() :
func_map(),
func_map_rev(),
func_nodes(),
- write_history(),
- write_locations()
+ write_history(), // snapshot data structure
+ loc_func_nodes_map(), // shapshot data structure
+ thrd_last_entered_func() // snapshot data structure
{}
void ModelHistory::enter_function(const uint32_t func_id, thread_id_t tid)
if ( thrd_func_list->size() <= id ) {
uint oldsize = thrd_func_list->size();
thrd_func_list->resize( id + 1 );
+ thrd_func_act_lists->resize( id + 1 );
+
for (uint i = oldsize; i < id + 1; i++) {
new (&(*thrd_func_list)[i]) func_id_list_t();
// push 0 as a dummy function id to a void seg fault
(*thrd_func_list)[i].push_back(0);
- }
- thrd_func_act_lists->resize( id + 1 );
- for (uint i = oldsize; i < id + 1; i++) {
(*thrd_func_act_lists)[i] = new SnapList<action_list_t *>();
}
}
+ while ( thrd_last_entered_func.size() <= id ) {
+ thrd_last_entered_func.push_back(0); // 0 is a dummy function id
+ }
+
SnapList<action_list_t *> * func_act_lists = (*thrd_func_act_lists)[id];
+ func_act_lists->push_back( new action_list_t() );
+ uint32_t last_entered_func_id = thrd_last_entered_func[id];
+ thrd_last_entered_func[id] = func_id;
(*thrd_func_list)[id].push_back(func_id);
- func_act_lists->push_back( new action_list_t() );
if ( func_nodes.size() <= func_id )
resize_func_nodes( func_id + 1 );
+
+ FuncNode * func_node = func_nodes[func_id];
+ func_node->init_predicate_tree_position(tid);
+ func_node->init_inst_act_map(tid);
+
+ /* Add edges between FuncNodes */
+ if (last_entered_func_id != 0) {
+ FuncNode * last_func_node = func_nodes[last_entered_func_id];
+ add_edges_between(last_func_node, func_node);
+ }
}
/* @param func_id a non-zero value */
if (last_func_id == func_id) {
FuncNode * func_node = func_nodes[func_id];
- func_node->clear_read_map(tid);
+ func_node->set_predicate_tree_position(tid, NULL);
+ func_node->reset_inst_act_map(tid);
action_list_t * curr_act_list = func_act_lists->back();
- func_node->incr_exit_count();
-
/* 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.
+ * (currently twice) 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();
+
SnapList<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();
if ( old_size < new_size )
func_nodes.resize(new_size);
- for (uint32_t id = old_size;id < new_size;id++) {
+ for (uint32_t id = old_size; id < new_size; id++) {
const char * func_name = func_map_rev[id];
FuncNode * func_node = new FuncNode(this);
func_node->set_func_id(id);
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())
- add_to_write_history(act->get_location(), act->get_write_value());
+ if (act->is_write()) {
+ void * location = act->get_location();
+ uint64_t value = act->get_write_value();
+ update_write_history(location, value);
+
+ /* Update FuncNodes that may read from this location */
+ SnapList<FuncNode *> * func_nodes = loc_func_nodes_map.get(location);
+ if (func_nodes != NULL) {
+ sllnode<FuncNode *> * 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 )
- resize_func_nodes( func_id + 1 );
- FuncNode * func_node = func_nodes[func_id];
+ bool second_part_of_rmw = act->is_rmwc() || act->is_rmw();
+
+ action_list_t * curr_act_list = func_act_lists->back();
+ ASSERT(curr_act_list != NULL);
- /* do not care about actions without a position */
+ modelclock_t curr_seq_number = act->get_seq_number();
+ /* Skip actions that are second part of a read modify write or actions with the same sequence number */
+ if (curr_act_list->size() != 0) {
+ ModelAction * last_act = curr_act_list->back();
+ if (second_part_of_rmw || last_act->get_seq_number() == curr_seq_number)
+ return;
+ }
- if (act->get_position() == NULL)
+ /* skip actions that are paused by fuzzer (sequence number is 0) */
+ if (curr_seq_number == 0)
return;
- if (act->is_read())
- func_node->store_read(act, tid);
+ FuncNode * func_node = func_nodes[func_id];
/* add to curr_inst_list */
+ curr_act_list->push_back(act);
+ func_node->add_inst(act);
- 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->update_inst_act_map(tid, act);
- ModelAction * last_act;
- if (curr_act_list->size() != 0)
- last_act = curr_act_list->back();
-
- // 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);
+ // Update predicate tree position
+ Fuzzer * fuzzer = model->get_execution()->getFuzzer();
+ Predicate * selected_branch = fuzzer->get_selected_child_branch(tid);
+ func_node->set_predicate_tree_position(tid, selected_branch);
}
}
return func_nodes[func_id];
}
-uint64_t ModelHistory::query_last_read(void * location, thread_id_t tid)
+void ModelHistory::update_write_history(void * location, uint64_t write_val)
{
- SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
- uint32_t id = id_to_int(tid);
+ value_set_t * write_set = write_history.get(location);
- ASSERT( thrd_func_list->size() > id );
- uint32_t func_id = (*thrd_func_list)[id].back();
- FuncNode * func_node = func_nodes[func_id];
-
- uint64_t last_read_val = 0xdeadbeef;
- if (func_node != NULL) {
- last_read_val = func_node->query_last_read(location, tid);
+ if (write_set == NULL) {
+ write_set = new value_set_t();
+ write_history.put(location, write_set);
}
- return last_read_val;
+ write_set->add(write_val);
}
-void ModelHistory::add_to_write_history(void * location, uint64_t write_val)
+void ModelHistory::update_loc_func_nodes_map(void * location, FuncNode * node)
{
- write_set_t * write_set = write_history.get(location);
+ 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);
+ }
- if (write_set == NULL) {
- write_set = new write_set_t();
- write_history.put(location, write_set);
+ func_node_list->push_back(node);
+}
+
+void ModelHistory::update_loc_wr_func_nodes_map(void * location, FuncNode * node)
+{
+ SnapList<FuncNode *> * func_node_list = loc_wr_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);
}
- write_set->add(write_val);
- write_locations.add(location);
+ func_node_list->push_back(node);
}
+/* Reallocate some snapshotted memories when new executions start */
void ModelHistory::set_new_exec_flag()
{
for (uint i = 1; i < func_nodes.size(); i++) {
}
}
-void ModelHistory::print_write()
+/* Add edges between FuncNodes */
+void ModelHistory::add_edges_between(FuncNode * prev_node, FuncNode * next_node)
{
+ prev_node->add_out_edge(next_node);
+}
+
+void ModelHistory::dump_func_node_graph()
+{
+ model_print("digraph func_node_graph {\n");
+ for (uint i = 1; i < func_nodes.size(); i++) {
+ FuncNode * node = func_nodes[i];
+ ModelList<FuncNode *> * out_edges = node->get_out_edges();
+
+ model_print("\"%p\" [label=\"%s\"]\n", node, node->get_func_name());
+ mllnode<FuncNode *> * it;
+ for (it = out_edges->begin(); it != NULL; it = it->getNext()) {
+ FuncNode * other = it->getVal();
+ model_print("\"%p\" -> \"%p\"\n", node, other);
+ }
+ }
+ model_print("}\n");
}
void ModelHistory::print_func_node()
FuncInst *inst = it->getVal();
model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
}
-/*
- func_inst_list_mt * inst_list = funcNode->get_inst_list();
-
- model_print("function %s has following actions\n", funcNode->get_func_name());
- func_inst_list_mt::iterator it;
- for (it = inst_list->begin(); it != inst_list->end(); it++) {
- FuncInst *inst = *it;
- model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
- }
-*/
}
}
projects / c11tester.git / blobdiff