#include "private.h"
XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_dfs, mc,
- "Logging specific to MC DFS exploration");
+ "Logging specific to MC DFS algorithm");
-void MC_dfs_init()
-{
- mc_transition_t trans = NULL;
- mc_state_t initial_state = NULL;
- xbt_setset_cursor_t cursor = NULL;
-
+extern xbt_fifo_t mc_snapshot_stack;
+mc_pairs_t mc_reached = NULL;
+xbt_dynar_t initial_pairs = NULL;
+int max_pair = 0;
+xbt_dynar_t list_pairs_reached = NULL;
+extern mc_snapshot_t initial_snapshot;
+
+mc_pairs_t new_pair(mc_snapshot_t sn, mc_state_t sg, xbt_state_t st){
+ mc_pairs_t p = NULL;
+ p = xbt_new0(s_mc_pairs_t, 1);
+ p->system_state = sn;
+ p->automaton_state = st;
+ p->graph_state = sg;
+ p->visited = 0;
+ p->num = max_pair;
+ max_pair++;
+ return p;
+
+}
+
+void set_pair_visited(mc_pairs_t p){
+ p->visited = 1;
+}
+
+int pair_reached(xbt_dynar_t p, int num_pair){
+ int n;
+ unsigned int cursor = 0;
+ xbt_dynar_foreach(p, cursor, n){
+ if(n == num_pair)
+ return 1;
+ }
+ return 0;
+}
+
+void MC_dfs_init(xbt_automaton_t a){
+
+ mc_pairs_t mc_initial_pair = NULL;
+ mc_state_t initial_graph_state = NULL;
+ smx_process_t process;
+
+ MC_wait_for_requests();
+
MC_SET_RAW_MEM;
- initial_state = MC_state_new();
- /* Add the state data structure for the initial state */
- xbt_fifo_unshift(mc_stack, initial_state);
+
+ initial_snapshot = xbt_new0(s_mc_snapshot_t, 1);
+ MC_take_snapshot(initial_snapshot);
+ initial_graph_state = MC_state_new();
+ xbt_swag_foreach(process, simix_global->process_list){
+ if(MC_process_is_enabled(process)){
+ MC_state_interleave_process(initial_graph_state, process);
+ }
+ }
+
+ list_pairs_reached = xbt_dynar_new(sizeof(int), NULL);
+
MC_UNSET_RAW_MEM;
+
+
+ //regarder dans l'automate toutes les transitions activables grâce à l'état initial du système -> donnera les états initiaux de la propriété consistants avec l'état initial du système
+
+ unsigned int cursor = 0;
+ xbt_state_t state = NULL;
+ unsigned int cursor2 = 0;
+ int res;
+ xbt_transition_t transition_succ = NULL;
+ xbt_dynar_t elses = xbt_dynar_new(sizeof(xbt_transition_t), NULL);
+ int enabled_transition = 0;
+
+ xbt_dynar_foreach(a->states, cursor, state){
+ if(state->type == -1){
+ xbt_dynar_foreach(state->out, cursor2, transition_succ){
+
+ res = MC_automaton_evaluate_label(a, transition_succ->label);
+
+ if(res == 1){
+
+ MC_SET_RAW_MEM;
+
+ mc_initial_pair = new_pair(initial_snapshot, initial_graph_state, transition_succ->dst);
+ xbt_fifo_unshift(mc_snapshot_stack, mc_initial_pair);
+ set_pair_visited(mc_initial_pair);
+
+ MC_UNSET_RAW_MEM;
+
+ enabled_transition = 1;
+
+ XBT_DEBUG(" ++++++++++++++++++ new initial pair +++++++++++++++++++");
+
+ MC_dfs(a, 0);
+ }else{
+ if(res == 2){
+ xbt_dynar_push(elses,&transition_succ);
+ }
+ }
+ }
+ }
+ }
+
+ if(enabled_transition == 0){
+ cursor2 = 0;
+ xbt_dynar_foreach(elses, cursor, transition_succ){
+
+ MC_SET_RAW_MEM;
+
+ mc_initial_pair = new_pair(initial_snapshot, initial_graph_state, transition_succ->dst);
+ xbt_fifo_unshift(mc_snapshot_stack, mc_initial_pair);
+ set_pair_visited(mc_initial_pair);
+
+ MC_UNSET_RAW_MEM;
+
+ MC_dfs(a, 0);
+ }
+ }
- DEBUG0("**************************************************");
- DEBUG0("Initial state");
+}
+
+int MC_automaton_evaluate_label(xbt_automaton_t a, xbt_exp_label_t l){
- /* Schedule all the processes to detect the transitions from the initial state */
- MC_schedule_enabled_processes();
+ switch(l->type){
+ case 0 : {
+ int left_res = MC_automaton_evaluate_label(a, l->u.or_and.left_exp);
+ int right_res = MC_automaton_evaluate_label(a, l->u.or_and.right_exp);
+ return (left_res || right_res);
+ break;
+ }
+ case 1 : {
+ int left_res = MC_automaton_evaluate_label(a, l->u.or_and.left_exp);
+ int right_res = MC_automaton_evaluate_label(a, l->u.or_and.right_exp);
+ return (left_res && right_res);
+ break;
+ }
+ case 2 : {
+ int res = MC_automaton_evaluate_label(a, l->u.exp_not);
+ return (!res);
+ break;
+ }
+ case 3 : {
+ unsigned int cursor = 0;
+ xbt_propositional_symbol_t p = NULL;
+ xbt_dynar_foreach(a->propositional_symbols, cursor, p){
+ if(strcmp(p->pred, l->u.predicat) == 0){
+ int (*f)() = p->function;
+ return (*f)();
+ }
+ }
+ return -1;
+ break;
+ }
+ case 4 : {
+ return 2;
+ break;
+ }
+ default :
+ return -1;
+ }
+}
- MC_SET_RAW_MEM;
- xbt_setset_add(initial_state->enabled_transitions, initial_state->transitions);
- xbt_setset_foreach(initial_state->enabled_transitions, cursor, trans){
- if(trans->type == mc_wait
- && (trans->comm->src_proc == NULL || trans->comm->dst_proc == NULL)){
- xbt_setset_set_remove(initial_state->enabled_transitions, trans);
+/*void MC_dfs(xbt_automaton_t a, int search_cycle){
+
+ xbt_state_t current_state = (xbt_state_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(stack_automaton_dfs));
+ xbt_transition_t transition_succ = NULL;
+ xbt_state_t successor = NULL;
+ unsigned int cursor = 0;
+ xbt_dynar_t elses = xbt_dynar_new(sizeof(xbt_transition_t), NULL);
+ int res;
+
+ //printf("++ current state : %s\n", current_state->id);
+
+ xbt_dynar_foreach(current_state->out, cursor, transition_succ){
+ successor = transition_succ->dst;
+ res = MC_automaton_evaluate_label(a, transition_succ->label);
+ //printf("-- state : %s, transition_label : %d, res = %d\n", successor->id, transition_succ->label->type, res);
+ if(res == 1){
+ if(search_cycle == 1 && reached_dfs != NULL){
+ if(strcmp(reached_dfs->id, successor->id) == 0){
+ xbt_dynar_push(state_automaton_visited_dfs, &successor);
+ printf("\n-*-*-*-*-*-*- ACCEPTANCE CYCLE -*-*-*-*-*-*-\n");
+ printf("Visited states : \n");
+ unsigned int cursor2 = 0;
+ xbt_state_t visited_state = NULL;
+ xbt_dynar_foreach(state_automaton_visited_dfs, cursor2, visited_state){
+ printf("State : %s\n", visited_state->id);
+ }
+ exit(1);
+ }
+ }
+ if(successor->visited == 0){
+ successor->visited = 1;
+ xbt_fifo_unshift(stack_automaton_dfs, successor);
+ xbt_dynar_push(state_automaton_visited_dfs, &successor);
+ MC_dfs(a, search_cycle);
+ if(search_cycle == 0 && successor->type == 1){
+ reached_dfs = successor;
+ MC_dfs(a, 1);
+ }
+ }
+ }else{
+ if(res == 2){
+ xbt_dynar_push(elses,&transition_succ);
+ }
}
}
+
+ cursor = 0;
+ xbt_dynar_foreach(elses, cursor, transition_succ){
+ successor = transition_succ->dst;
+ if(search_cycle == 1 && reached_dfs != NULL){
+ if(strcmp(reached_dfs->id, successor->id) == 0){
+ xbt_dynar_push(state_automaton_visited_dfs, &successor);
+ printf("\n-*-*-*-*-*-*- ACCEPTANCE CYCLE -*-*-*-*-*-*-\n");
+ printf("Visited states : \n");
+ unsigned int cursor2 = 0;
+ xbt_state_t visited_state = NULL;
+ xbt_dynar_foreach(state_automaton_visited_dfs, cursor2, visited_state){
+ printf("State : %s\n", visited_state->id);
+ }
+ exit(1);
+ }
+ }
+ if(successor->visited == 0){
+ successor->visited = 1;
+ xbt_fifo_unshift(stack_automaton_dfs, successor);
+ xbt_dynar_push(state_automaton_visited_dfs, &successor);
+ MC_dfs(a, search_cycle);
+ if(search_cycle == 0 && successor->type == 1){
+ reached_dfs = successor;
+ MC_dfs(a, 1);
+ }
+ }
+ }
+
+ xbt_fifo_shift(stack_automaton_dfs);
+ }*/
+
+
+void MC_dfs(xbt_automaton_t a, int search_cycle){
- /* Fill the interleave set of the initial state with all enabled transitions */
- xbt_setset_add(initial_state->interleave, initial_state->enabled_transitions);
+ smx_process_t process = NULL;
+ int value;
+ mc_state_t next_graph_state = NULL;
+ smx_req_t req = NULL;
+ char *req_str;
- /* Update Statistics */
- mc_stats->state_size += xbt_setset_set_size(initial_state->enabled_transitions);
+ xbt_transition_t transition_succ = NULL;
+ xbt_state_t successor = NULL;
+ unsigned int cursor = 0;
+ xbt_dynar_t elses = xbt_dynar_new(sizeof(xbt_transition_t), NULL);
+ int res;
+ int enabled_transition = 0;
+
+ mc_pairs_t next_pair = NULL;
+ mc_snapshot_t next_snapshot = NULL;
- MC_UNSET_RAW_MEM;
-}
-/**
- * \brief Perform the model-checking operation using a depth-first search exploration
- *
- * It performs the model-checking operation by executing all possible scheduling of the communication actions
- * \return The time spent to execute the simulation or -1 if the simulation ended
- */
-void MC_dfs(void)
-{
- mc_transition_t trans = NULL;
- mc_state_t current_state = NULL;
- mc_state_t next_state = NULL;
- xbt_setset_cursor_t cursor = NULL;
+ /* Get current state */
+ mc_pairs_t current_pair = (mc_pairs_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_snapshot_stack));
+
+ XBT_DEBUG("**************************************************");
+ XBT_DEBUG("State=%p, %u interleave",current_pair->graph_state,MC_state_interleave_size(current_pair->graph_state));
- while(xbt_fifo_size(mc_stack) > 0){
- DEBUG0("**************************************************");
-
- /* FIXME: Think about what happens if there are no transitions but there are
- some actions on the models. (ex. all the processes do a sleep(0) in a round). */
-
- /* Get current state */
- current_state = (mc_state_t)
- xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack));
-
- /* If there are transitions to execute and the maximun depth has not been reached
- then perform one step of the exploration algorithm */
- if(xbt_setset_set_size(current_state->interleave) > 0 && xbt_fifo_size(mc_stack) < MAX_DEPTH){
-
- DEBUG3("Exploration detph=%d (state=%p)(%d transitions)", xbt_fifo_size(mc_stack),
- current_state, xbt_setset_set_size(current_state->interleave));
-
- /* Update statistics */
- mc_stats->visited_states++;
- mc_stats->executed_transitions++;
-
- /* Choose a transition to execute from the interleave set of the current state,
- and create the data structures for the new expanded state in the exploration
- stack. */
- MC_SET_RAW_MEM;
- trans = xbt_setset_set_extract(current_state->interleave);
+ /* Update statistics */
+ mc_stats->visited_states++;
- /* Define it as the executed transition of this state */
- current_state->executed_transition = trans;
+ MC_restore_snapshot(current_pair->system_state);
+ MC_UNSET_RAW_MEM;
- next_state = MC_state_new();
- xbt_fifo_unshift(mc_stack, next_state);
- MC_UNSET_RAW_MEM;
+ //FIXME : vérifier condition permettant d'avoir tous les successeurs possibles dans le graph
+
+ while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){
+
+ /* Debug information */
+ if(XBT_LOG_ISENABLED(mc_dfs, xbt_log_priority_debug)){
+ req_str = MC_request_to_string(req, value);
+ XBT_DEBUG("Execute: %s", req_str);
+ xbt_free(req_str);
+ }
- DEBUG1("Executing transition %s", trans->name);
- SIMIX_process_schedule(trans->process);
+ MC_state_set_executed_request(current_pair->graph_state, req, value);
+ mc_stats->executed_transitions++;
- /* Do all surf's related black magic tricks to keep all working */
- MC_execute_surf_actions();
+ /* Answer the request */
+ SIMIX_request_pre(req, value);
- /* Schedule every process that got enabled due to the executed transition */
- MC_schedule_enabled_processes();
-
- /* Calculate the enabled transitions set of the next state:
- -add the transition sets of the current state and the next state
- -remove the executed transition from that set
- -remove all the transitions that are disabled (mc_wait only)
- -use the resulting set as the enabled transitions of the next state */
- MC_SET_RAW_MEM;
- xbt_setset_add(next_state->transitions, current_state->transitions);
- xbt_setset_set_remove(next_state->transitions, trans);
- xbt_setset_add(next_state->enabled_transitions, next_state->transitions);
- xbt_setset_foreach(next_state->enabled_transitions, cursor, trans){
- if(trans->type == mc_wait
- && (trans->comm->src_proc == NULL || trans->comm->dst_proc == NULL)){
- xbt_setset_set_remove(next_state->enabled_transitions, trans);
- }
+ /* Wait for requests (schedules processes) */
+ MC_wait_for_requests();
+
+
+ /* Create the new expanded graph_state */
+ MC_SET_RAW_MEM;
+
+ next_graph_state = MC_state_new();
+
+ /* Get an enabled process and insert it in the interleave set of the next graph_state */
+ xbt_swag_foreach(process, simix_global->process_list){
+ if(MC_process_is_enabled(process)){
+ MC_state_interleave_process(next_graph_state, process);
}
-
- /* Fill the interleave set of the new state with all enabled transitions */
- xbt_setset_add(next_state->interleave, next_state->enabled_transitions);
- MC_UNSET_RAW_MEM;
+ }
- /* Update Statistics */
- mc_stats->state_size += xbt_setset_set_size(next_state->enabled_transitions);
+ next_snapshot = xbt_new0(s_mc_snapshot_t, 1);
+ MC_take_snapshot(next_snapshot);
- /* Let's loop again */
-
- /* The interleave set is empty or the maximum depth is reached, let's back-track */
- }else{
- DEBUG0("There are no more actions to run");
-
- MC_SET_RAW_MEM;
- xbt_fifo_shift(mc_stack);
- MC_state_delete(current_state);
-
- /* Go backwards in the stack until we find a state with transitions in the interleave set */
- while(xbt_fifo_size(mc_stack) > 0 && (current_state = (mc_state_t)xbt_fifo_shift(mc_stack))){
- if(xbt_setset_set_size(current_state->interleave) == 0){
- MC_state_delete(current_state);
- }else{
- xbt_fifo_unshift(mc_stack, current_state);
- DEBUG1("Back-tracking to depth %d", xbt_fifo_size(mc_stack));
- MC_replay(mc_stack);
- MC_UNSET_RAW_MEM;
- /* Let's loop again */
- break;
- }
+ MC_UNSET_RAW_MEM;
+
+ xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
+ successor = transition_succ->dst;
+ res = MC_automaton_evaluate_label(a, transition_succ->label);
+ if(res == 1){ // enabled transition
+
+ MC_SET_RAW_MEM;
+ next_pair = new_pair(next_snapshot, next_graph_state, successor);
+
+ if((search_cycle == 1) && (pair_reached(list_pairs_reached, next_pair->num) == 1)){
+ printf("\n-*-*-*-*-*-*- ACCEPTANCE CYCLE -*-*-*-*-*-*-\n");
+ // afficher chemin menant au cycle d'acceptation
+ exit(1);
+ }
+ if(next_pair->visited == 0){ // FIXME : tester avec search_cycle ?
+ xbt_fifo_unshift(mc_snapshot_stack, next_pair);
+ set_pair_visited(next_pair);
+ MC_dfs(a, search_cycle);
+ if((search_cycle == 0) && (next_pair->automaton_state->type == 1)){
+ xbt_dynar_push(list_pairs_reached, &next_pair->num);
+ MC_dfs(a, 1);
+ }
+ }
+
+ MC_UNSET_RAW_MEM;
+ enabled_transition = 1;
+ }else{
+ if(res == 2){
+ xbt_dynar_push(elses,&transition_succ);
+ }
+ }
+ }
+
+ if(enabled_transition == 0){
+ cursor = 0;
+ xbt_dynar_foreach(elses, cursor, transition_succ){
+ successor = transition_succ->dst;
+ MC_SET_RAW_MEM;
+ next_pair = new_pair(next_snapshot, next_graph_state, successor);
+
+ if((search_cycle == 1) && (pair_reached(list_pairs_reached, next_pair->num) == 1)){
+ printf("\n-*-*-*-*-*-*- ACCEPTANCE CYCLE -*-*-*-*-*-*-\n");
+ // afficher chemin menant au cycle d'acceptation
+ exit(1);
+ }
+ if(next_pair->visited == 0){ // FIXME : tester avec search_cycle ?
+ xbt_fifo_unshift(mc_snapshot_stack, next_pair);
+ set_pair_visited(next_pair);
+ MC_dfs(a, search_cycle);
+ if((search_cycle == 0) && (next_pair->automaton_state->type == 1)){
+ xbt_dynar_push(list_pairs_reached, &next_pair->num);
+ MC_dfs(a, 1);
+ }
+ }
+
+ MC_UNSET_RAW_MEM;
}
}
+
}
- MC_UNSET_RAW_MEM;
- /* We are done, show the statistics and return */
- MC_print_statistics(mc_stats);
-}
\ No newline at end of file
+
+ xbt_fifo_shift(mc_snapshot_stack);
+
+}
