#include "predicate.h"
#include "concretepredicate.h"
+#include "model.h"
+
FuncNode::FuncNode(ModelHistory * history) :
history(history),
exit_count(0),
write_locations = new loc_set_t();
val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0>();
loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
- thrd_inst_act_map = new SnapVector<inst_act_map_t *>();
//values_may_read_from = new value_set_t();
}
/* Reallocate snapshotted memories when new executions start */
void FuncNode::set_new_exec_flag()
{
- for (mllnode<FuncInst *> * it = inst_list.begin(); it != NULL; it = it->getNext()) {
- FuncInst * inst = it->getVal();
- inst->unset_location();
- }
-
action_list_buffer = new SnapList<action_list_t *>();
read_locations = new loc_set_t();
write_locations = new loc_set_t();
val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0>();
loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
- thrd_inst_act_map = new SnapVector<inst_act_map_t *>();
//values_may_read_from = new value_set_t();
}
FuncInst * inst = func_inst_map.get(position);
ASSERT(inst->get_type() == act->get_type());
+ int curr_execution_number = model->get_execution_number();
- // locations are set to NULL when new executions start
- if (inst->get_location() == NULL)
+ /* Reset locations when new executions start */
+ if (inst->get_execution_number() != curr_execution_number) {
inst->set_location(act->get_location());
+ inst->set_execution_number(curr_execution_number);
+ }
if (inst->get_location() != act->get_location())
inst->not_single_location();
if (act_list == NULL || act_list->size() == 0)
return;
- HashTable<void *, value_set_t *, uintptr_t, 4> * write_history = history->getWriteHistory();
+ HashTable<void *, value_set_t *, uintptr_t, 0> * write_history = history->getWriteHistory();
/* build inst_list from act_list for later processing */
func_inst_list_t inst_list;
read_locations->add(loc);
value_set_t * write_values = write_history->get(loc);
add_to_val_loc_map(write_values, loc);
- history->update_loc_func_nodes_map(loc, this);
+ history->update_loc_rd_func_nodes_map(loc, this);
}
}
}
break;
}
}
+ delete concrete_pred;
if (predicate_correct) {
*curr_pred = branch;
void FuncNode::init_inst_act_map(thread_id_t tid)
{
int thread_id = id_to_int(tid);
+ SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
uint old_size = thrd_inst_act_map->size();
if (thrd_inst_act_map->size() <= (uint) thread_id) {
void FuncNode::reset_inst_act_map(thread_id_t tid)
{
int thread_id = id_to_int(tid);
+ SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
+
inst_act_map_t * map = (*thrd_inst_act_map)[thread_id];
map->reset();
}
void FuncNode::update_inst_act_map(thread_id_t tid, ModelAction * read_act)
{
int thread_id = id_to_int(tid);
+ SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
+
inst_act_map_t * map = (*thrd_inst_act_map)[thread_id];
FuncInst * read_inst = get_inst(read_act);
map->put(read_inst, read_act);
inst_act_map_t * FuncNode::get_inst_act_map(thread_id_t tid)
{
int thread_id = id_to_int(tid);
+ SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
+
return (*thrd_inst_act_map)[thread_id];
}
}
}
+/* Compute the distance between this FuncNode and the target node.
+ * Return -1 if the target node is unreachable or the actual distance
+ * is greater than max_step.
+ */
+int FuncNode::compute_distance(FuncNode * target, int max_step)
+{
+ if (target == NULL)
+ return -1;
+ else if (target == this)
+ return 0;
+
+ SnapList<FuncNode *> queue;
+ HashTable<FuncNode *, int, uintptr_t, 0> distances(128);
+
+ queue.push_back(this);
+ distances.put(this, 0);
+
+ while (!queue.empty()) {
+ FuncNode * curr = queue.front();
+ queue.pop_front();
+ int dist = distances.get(curr);
+
+ if (max_step <= dist)
+ return -1;
+
+ ModelList<FuncNode *> * outEdges = curr->get_out_edges();
+ mllnode<FuncNode *> * it;
+ for (it = outEdges->begin(); it != NULL; it = it->getNext()) {
+ FuncNode * out_node = it->getVal();
+
+ /* This node has not been visited before */
+ if ( !distances.contains(out_node) ) {
+ if (out_node == target)
+ return dist + 1;
+
+ queue.push_back(out_node);
+ distances.put(out_node, dist + 1);
+ }
+ }
+ }
+
+ /* Target node is unreachable */
+ return -1;
+}
+
void FuncNode::print_predicate_tree()
{
model_print("digraph function_%s {\n", func_name);