7 #include "snapshot-interface.h"
9 #include "clockvector.h"
10 #include "cyclegraph.h"
12 #define INITIAL_THREAD_ID 0
16 /** @brief Constructor */
17 ModelChecker::ModelChecker()
19 /* Initialize default scheduler */
20 scheduler(new Scheduler()),
21 /* First thread created will have id INITIAL_THREAD_ID */
22 next_thread_id(INITIAL_THREAD_ID),
23 used_sequence_numbers(0),
28 nextThread(THREAD_ID_T_NONE),
29 action_trace(new action_list_t()),
30 thread_map(new std::map<int, Thread *>),
31 obj_map(new std::map<const void *, action_list_t>()),
32 obj_thrd_map(new std::map<void *, std::vector<action_list_t> >()),
33 thrd_last_action(new std::vector<ModelAction *>(1)),
34 node_stack(new NodeStack()),
36 cyclegraph(new CycleGraph())
40 /** @brief Destructor */
41 ModelChecker::~ModelChecker()
43 std::map<int, Thread *>::iterator it;
44 for (it = thread_map->begin(); it != thread_map->end(); it++)
51 delete thrd_last_action;
58 * Restores user program to initial state and resets all model-checker data
61 void ModelChecker::reset_to_initial_state()
63 DEBUG("+++ Resetting to initial state +++\n");
64 node_stack->reset_execution();
65 current_action = NULL;
66 next_thread_id = INITIAL_THREAD_ID;
67 used_sequence_numbers = 0;
69 next_backtrack = NULL;
70 snapshotObject->backTrackBeforeStep(0);
73 /** @returns a thread ID for a new Thread */
74 thread_id_t ModelChecker::get_next_id()
76 return next_thread_id++;
79 /** @returns the number of user threads created during this execution */
80 int ModelChecker::get_num_threads()
82 return next_thread_id;
85 /** @returns a sequence number for a new ModelAction */
86 modelclock_t ModelChecker::get_next_seq_num()
88 return ++used_sequence_numbers;
92 * Performs the "scheduling" for the model-checker. That is, it checks if the
93 * model-checker has selected a "next thread to run" and returns it, if
94 * available. This function should be called from the Scheduler routine, where
95 * the Scheduler falls back to a default scheduling routine if needed.
97 * @return The next thread chosen by the model-checker. If the model-checker
98 * makes no selection, retuns NULL.
100 Thread * ModelChecker::schedule_next_thread()
103 if (nextThread == THREAD_ID_T_NONE)
105 t = (*thread_map)[id_to_int(nextThread)];
113 * Choose the next thread in the replay sequence.
115 * If the replay sequence has reached the 'diverge' point, returns a thread
116 * from the backtracking set. Otherwise, simply returns the next thread in the
117 * sequence that is being replayed.
119 thread_id_t ModelChecker::get_next_replay_thread()
124 /* Have we completed exploring the preselected path? */
126 return THREAD_ID_T_NONE;
128 /* Else, we are trying to replay an execution */
129 next = node_stack->get_next()->get_action();
131 if (next == diverge) {
132 Node *nextnode = next->get_node();
133 /* Reached divergence point */
134 if (nextnode->increment_read_from()) {
135 /* The next node will read from a different value */
136 tid = next->get_tid();
137 node_stack->pop_restofstack(2);
139 /* Make a different thread execute for next step */
140 Node *node = nextnode->get_parent();
141 tid = node->get_next_backtrack();
142 node_stack->pop_restofstack(1);
144 DEBUG("*** Divergence point ***\n");
147 tid = next->get_tid();
149 DEBUG("*** ModelChecker chose next thread = %d ***\n", tid);
154 * Queries the model-checker for more executions to explore and, if one
155 * exists, resets the model-checker state to execute a new execution.
157 * @return If there are more executions to explore, return true. Otherwise,
160 bool ModelChecker::next_execution()
166 if (isfeasible() || DBG_ENABLED())
169 if ((diverge = model->get_next_backtrack()) == NULL)
173 printf("Next execution will diverge at:\n");
177 model->reset_to_initial_state();
181 ModelAction * ModelChecker::get_last_conflict(ModelAction *act)
183 action_type type = act->get_type();
193 /* linear search: from most recent to oldest */
194 action_list_t *list = &(*obj_map)[act->get_location()];
195 action_list_t::reverse_iterator rit;
196 for (rit = list->rbegin(); rit != list->rend(); rit++) {
197 ModelAction *prev = *rit;
198 if (act->is_synchronizing(prev))
204 void ModelChecker::set_backtracking(ModelAction *act)
208 Thread *t = get_thread(act->get_tid());
210 prev = get_last_conflict(act);
214 node = prev->get_node()->get_parent();
216 while (!node->is_enabled(t))
219 /* Check if this has been explored already */
220 if (node->has_been_explored(t->get_id()))
223 /* Cache the latest backtracking point */
224 if (!next_backtrack || *prev > *next_backtrack)
225 next_backtrack = prev;
227 /* If this is a new backtracking point, mark the tree */
228 if (!node->set_backtrack(t->get_id()))
230 DEBUG("Setting backtrack: conflict = %d, instead tid = %d\n",
231 prev->get_tid(), t->get_id());
239 * Returns last backtracking point. The model checker will explore a different
240 * path for this point in the next execution.
241 * @return The ModelAction at which the next execution should diverge.
243 ModelAction * ModelChecker::get_next_backtrack()
245 ModelAction *next = next_backtrack;
246 next_backtrack = NULL;
250 void ModelChecker::check_current_action(void)
252 ModelAction *curr = this->current_action;
253 bool already_added = false;
254 this->current_action = NULL;
256 DEBUG("trying to push NULL action...\n");
260 if (curr->is_rmwc()||curr->is_rmw()) {
261 ModelAction *tmp=process_rmw(curr);
262 already_added = true;
266 ModelAction * tmp = node_stack->explore_action(curr);
268 /* Discard duplicate ModelAction; use action from NodeStack */
269 /* First restore type and order in case of RMW operation */
271 tmp->copy_typeandorder(curr);
276 * Perform one-time actions when pushing new ModelAction onto
279 curr->create_cv(get_parent_action(curr->get_tid()));
280 /* Build may_read_from set */
282 build_reads_from_past(curr);
286 /* Assign 'creation' parent */
287 if (curr->get_type() == THREAD_CREATE) {
288 Thread *th = (Thread *)curr->get_location();
289 th->set_creation(curr);
292 /* Assign reads_from values */
293 Thread *th = get_thread(curr->get_tid());
294 uint64_t value = VALUE_NONE;
295 if (curr->is_read()) {
296 const ModelAction *reads_from = curr->get_node()->get_read_from();
297 value = reads_from->get_value();
298 /* Assign reads_from, perform release/acquire synchronization */
299 curr->read_from(reads_from);
300 r_modification_order(curr,reads_from);
301 } else if (curr->is_write()) {
302 w_modification_order(curr);
305 th->set_return_value(value);
307 /* Add action to list. */
309 add_action_to_lists(curr);
311 /* Do not split atomic actions. */
312 if (curr->is_rmwr()) {
313 nextThread = thread_current()->get_id();
317 /* Is there a better interface for setting the next thread rather
318 than this field/convoluted approach? Perhaps like just returning
321 nextThread = get_next_replay_thread();
323 Node *currnode = curr->get_node();
324 Node *parnode = currnode->get_parent();
326 if (!parnode->backtrack_empty()||!currnode->readsfrom_empty())
327 if (!next_backtrack || *curr > *next_backtrack)
328 next_backtrack = curr;
330 set_backtracking(curr);
333 /** @returns whether the current trace is feasible. */
334 bool ModelChecker::isfeasible() {
335 return !cyclegraph->checkForCycles();
338 /** Close out a RMWR by converting previous RMWR into a RMW or READ. */
339 ModelAction * ModelChecker::process_rmw(ModelAction * act) {
340 int tid = id_to_int(act->get_tid());
341 ModelAction *lastread=get_last_action(tid);
342 lastread->process_rmw(act);
344 cyclegraph->addRMWEdge(lastread, lastread->get_reads_from());
349 * Updates the cyclegraph with the constraints imposed from the current read.
350 * @param curr The current action. Must be a read.
351 * @param rf The action that curr reads from. Must be a write.
353 void ModelChecker::r_modification_order(ModelAction * curr, const ModelAction *rf) {
354 std::vector<action_list_t> *thrd_lists = &(*obj_thrd_map)[curr->get_location()];
356 ASSERT(curr->is_read());
358 /* Iterate over all threads */
359 for (i = 0; i < thrd_lists->size(); i++) {
360 /* Iterate over actions in thread, starting from most recent */
361 action_list_t *list = &(*thrd_lists)[i];
362 action_list_t::reverse_iterator rit;
363 for (rit = list->rbegin(); rit != list->rend(); rit++) {
364 ModelAction *act = *rit;
366 /* Include at most one act per-thread that "happens before" curr */
367 if (act->happens_before(curr)) {
368 if (act->is_read()) {
369 const ModelAction * prevreadfrom=act->get_reads_from();
370 if (rf!=prevreadfrom)
371 cyclegraph->addEdge(rf, prevreadfrom);
372 } else if (rf!=act) {
373 cyclegraph->addEdge(rf, act);
382 * Updates the cyclegraph with the constraints imposed from the current write.
383 * @param curr The current action. Must be a write.
385 void ModelChecker::w_modification_order(ModelAction * curr) {
386 std::vector<action_list_t> *thrd_lists = &(*obj_thrd_map)[curr->get_location()];
388 ASSERT(curr->is_write());
390 if (curr->is_seqcst()) {
391 /* We have to at least see the last sequentially consistent write,
392 so we are initialized. */
393 ModelAction * last_seq_cst=get_last_seq_cst(curr->get_location());
394 if (last_seq_cst!=NULL)
395 cyclegraph->addEdge(curr, last_seq_cst);
398 /* Iterate over all threads */
399 for (i = 0; i < thrd_lists->size(); i++) {
400 /* Iterate over actions in thread, starting from most recent */
401 action_list_t *list = &(*thrd_lists)[i];
402 action_list_t::reverse_iterator rit;
403 for (rit = list->rbegin(); rit != list->rend(); rit++) {
404 ModelAction *act = *rit;
406 /* Include at most one act per-thread that "happens before" curr */
407 if (act->happens_before(curr)) {
408 if (act->is_read()) {
409 cyclegraph->addEdge(curr, act->get_reads_from());
411 cyclegraph->addEdge(curr, act);
419 * Performs various bookkeeping operations for the current ModelAction. For
420 * instance, adds action to the per-object, per-thread action vector and to the
421 * action trace list of all thread actions.
423 * @param act is the ModelAction to add.
425 void ModelChecker::add_action_to_lists(ModelAction *act)
427 int tid = id_to_int(act->get_tid());
428 action_trace->push_back(act);
430 (*obj_map)[act->get_location()].push_back(act);
432 std::vector<action_list_t> *vec = &(*obj_thrd_map)[act->get_location()];
433 if (tid >= (int)vec->size())
434 vec->resize(next_thread_id);
435 (*vec)[tid].push_back(act);
437 if ((int)thrd_last_action->size() <= tid)
438 thrd_last_action->resize(get_num_threads());
439 (*thrd_last_action)[tid] = act;
442 ModelAction * ModelChecker::get_last_action(thread_id_t tid)
444 int nthreads = get_num_threads();
445 if ((int)thrd_last_action->size() < nthreads)
446 thrd_last_action->resize(nthreads);
447 return (*thrd_last_action)[id_to_int(tid)];
451 * Gets the last memory_order_seq_cst action (in the total global sequence)
452 * performed on a particular object (i.e., memory location).
453 * @param location The object location to check
454 * @return The last seq_cst action performed
456 ModelAction * ModelChecker::get_last_seq_cst(const void *location)
458 action_list_t *list = &(*obj_map)[location];
459 /* Find: max({i in dom(S) | seq_cst(t_i) && isWrite(t_i) && samevar(t_i, t)}) */
460 action_list_t::reverse_iterator rit;
461 for (rit = list->rbegin(); rit != list->rend(); rit++)
462 if ((*rit)->is_write() && (*rit)->is_seqcst())
467 ModelAction * ModelChecker::get_parent_action(thread_id_t tid)
469 ModelAction *parent = get_last_action(tid);
471 parent = get_thread(tid)->get_creation();
476 * Returns the clock vector for a given thread.
477 * @param tid The thread whose clock vector we want
478 * @return Desired clock vector
480 ClockVector * ModelChecker::get_cv(thread_id_t tid) {
481 return get_parent_action(tid)->get_cv();
485 * Build up an initial set of all past writes that this 'read' action may read
486 * from. This set is determined by the clock vector's "happens before"
488 * @param curr is the current ModelAction that we are exploring; it must be a
491 void ModelChecker::build_reads_from_past(ModelAction *curr)
493 std::vector<action_list_t> *thrd_lists = &(*obj_thrd_map)[curr->get_location()];
495 ASSERT(curr->is_read());
497 ModelAction *last_seq_cst = NULL;
499 /* Track whether this object has been initialized */
500 bool initialized = false;
502 if (curr->is_seqcst()) {
503 last_seq_cst = get_last_seq_cst(curr->get_location());
504 /* We have to at least see the last sequentially consistent write,
505 so we are initialized. */
506 if (last_seq_cst != NULL)
510 /* Iterate over all threads */
511 for (i = 0; i < thrd_lists->size(); i++) {
512 /* Iterate over actions in thread, starting from most recent */
513 action_list_t *list = &(*thrd_lists)[i];
514 action_list_t::reverse_iterator rit;
515 for (rit = list->rbegin(); rit != list->rend(); rit++) {
516 ModelAction *act = *rit;
518 /* Only consider 'write' actions */
519 if (!act->is_write())
522 /* Don't consider more than one seq_cst write if we are a seq_cst read. */
523 if (!act->is_seqcst() || !curr->is_seqcst() || act == last_seq_cst) {
524 DEBUG("Adding action to may_read_from:\n");
529 curr->get_node()->add_read_from(act);
532 /* Include at most one act per-thread that "happens before" curr */
533 if (act->happens_before(curr)) {
541 /* TODO: need a more informative way of reporting errors */
542 printf("ERROR: may read from uninitialized atomic\n");
545 if (DBG_ENABLED() || !initialized) {
546 printf("Reached read action:\n");
548 printf("Printing may_read_from\n");
549 curr->get_node()->print_may_read_from();
550 printf("End printing may_read_from\n");
556 static void print_list(action_list_t *list)
558 action_list_t::iterator it;
560 printf("---------------------------------------------------------------------\n");
563 for (it = list->begin(); it != list->end(); it++) {
566 printf("---------------------------------------------------------------------\n");
569 void ModelChecker::print_summary(void)
572 printf("Number of executions: %d\n", num_executions);
573 printf("Total nodes created: %d\n", node_stack->get_total_nodes());
578 printf("INFEASIBLE EXECUTION!\n");
579 print_list(action_trace);
583 int ModelChecker::add_thread(Thread *t)
585 (*thread_map)[id_to_int(t->get_id())] = t;
586 scheduler->add_thread(t);
590 void ModelChecker::remove_thread(Thread *t)
592 scheduler->remove_thread(t);
596 * Switch from a user-context to the "master thread" context (a.k.a. system
597 * context). This switch is made with the intention of exploring a particular
598 * model-checking action (described by a ModelAction object). Must be called
599 * from a user-thread context.
600 * @param act The current action that will be explored. May be NULL, although
601 * there is little reason to switch to the model-checker without an action to
602 * explore (note: act == NULL is sometimes used as a hack to allow a thread to
603 * yield control without performing any progress; see thrd_join()).
604 * @return Return status from the 'swap' call (i.e., success/fail, 0/-1)
606 int ModelChecker::switch_to_master(ModelAction *act)
609 Thread * old = thread_current();
610 set_current_action(act);
611 old->set_state(THREAD_READY);
612 return Thread::swap(old, get_system_context());