src/mc/mc_state.c

   1 /* Copyright (c) 2008-2014. The SimGrid Team.
   2  * All rights reserved.                                                     */
   3
   4 /* This program is free software; you can redistribute it and/or modify it
   5  * under the terms of the license (GNU LGPL) which comes with this package. */
   6
   7 #include <assert.h>
   8
   9 #include "../simix/smx_private.h"
  10 #include "xbt/fifo.h"
  11 #include "mc_state.h"
  12 #include "mc_request.h"
  13 #include "mc_private.h"
  14 #include "mc_comm_pattern.h"
  15 #include "mc_smx.h"
  16
  17 static void copy_incomplete_communications_pattern(mc_state_t state) {
  18   int i;
  19   xbt_dynar_t incomplete_process_comms;
  20   mc_comm_pattern_t comm;
  21   unsigned int cursor;
  22   state->incomplete_comm_pattern = xbt_dynar_new(sizeof(xbt_dynar_t), xbt_dynar_free_voidp);
  23   for (i=0; i < MC_smx_get_maxpid(); i++) {
  24     incomplete_process_comms = xbt_dynar_get_as(incomplete_communications_pattern, i, xbt_dynar_t);
  25     xbt_dynar_t incomplete_process_comms_copy = xbt_dynar_new(sizeof(mc_comm_pattern_t), comm_pattern_free_voidp);
  26     xbt_dynar_foreach(incomplete_process_comms, cursor, comm) {
  27       mc_comm_pattern_t copy_comm = xbt_new0(s_mc_comm_pattern_t, 1);
  28       copy_comm->index = comm->index;
  29       copy_comm->type = comm->type;
  30       copy_comm->comm = comm->comm;
  31       copy_comm->rdv = strdup(comm->rdv);
  32       copy_comm->data_size = -1;
  33       copy_comm->data = NULL;
  34       if(comm->type == SIMIX_COMM_SEND){
  35         copy_comm->src_proc = comm->src_proc;
  36         copy_comm->src_host = comm->src_host;
  37         if (comm->data != NULL) {
  38           copy_comm->data_size = comm->data_size;
  39           copy_comm->data = xbt_malloc0(comm->data_size);
  40           memcpy(copy_comm->data, comm->data, comm->data_size);
  41         }
  42       }else{
  43         copy_comm->dst_proc = comm->dst_proc;
  44         copy_comm->dst_host = comm->dst_host;
  45       }
  46       xbt_dynar_push(incomplete_process_comms_copy, &copy_comm);
  47     }
  48     xbt_dynar_insert_at(state->incomplete_comm_pattern, i, &incomplete_process_comms_copy);
  49   }
  50 }
  51
  52 static void copy_index_communications_pattern(mc_state_t state) {
  53
  54   state->index_comm = xbt_dynar_new(sizeof(unsigned int), NULL);
  55   mc_list_comm_pattern_t list_process_comm;
  56   unsigned int cursor;
  57   xbt_dynar_foreach(initial_communications_pattern, cursor, list_process_comm){
  58     xbt_dynar_push_as(state->index_comm, unsigned int, list_process_comm->index_comm);
  59   }
  60 }
  61
  62 /**
  63  * \brief Creates a state data structure used by the exploration algorithm
  64  */
  65 mc_state_t MC_state_new()
  66 {
  67   mc_state_t state = xbt_new0(s_mc_state_t, 1);
  68   state->max_pid = MC_smx_get_maxpid();
  69   state->proc_status = xbt_new0(s_mc_procstate_t, state->max_pid);
  70   state->system_state = NULL;
  71   state->num = ++mc_stats->expanded_states;
  72   state->in_visited_states = 0;
  73   state->incomplete_comm_pattern = NULL;
  74   /* Stateful model checking */
  75   if((_sg_mc_checkpoint > 0 && (mc_stats->expanded_states % _sg_mc_checkpoint == 0)) ||  _sg_mc_termination){
  76     state->system_state = MC_take_snapshot(state->num);
  77     if(_sg_mc_comms_determinism || _sg_mc_send_determinism){
  78       copy_incomplete_communications_pattern(state);
  79       copy_index_communications_pattern(state);
  80     }
  81   }
  82   return state;
  83 }
  84
  85 /**
  86  * \brief Deletes a state data structure
  87  * \param trans The state to be deleted
  88  */
  89 void MC_state_delete(mc_state_t state, int free_snapshot){
  90   if (state->system_state && free_snapshot){
  91     MC_free_snapshot(state->system_state);
  92   }
  93   if(_sg_mc_comms_determinism || _sg_mc_send_determinism){
  94     xbt_free(state->index_comm);
  95     xbt_free(state->incomplete_comm_pattern);
  96   }
  97   xbt_free(state->proc_status);
  98   xbt_free(state);
  99 }
 100
 101 void MC_state_interleave_process(mc_state_t state, smx_process_t process)
 102 {
 103   assert(state);
 104   state->proc_status[process->pid].state = MC_INTERLEAVE;
 105   state->proc_status[process->pid].interleave_count = 0;
 106 }
 107
 108 void MC_state_remove_interleave_process(mc_state_t state, smx_process_t process)
 109 {
 110   if (state->proc_status[process->pid].state == MC_INTERLEAVE)
 111     state->proc_status[process->pid].state = MC_DONE;
 112 }
 113
 114 unsigned int MC_state_interleave_size(mc_state_t state)
 115 {
 116   unsigned int i, size = 0;
 117
 118   for (i = 0; i < state->max_pid; i++) {
 119     if ((state->proc_status[i].state == MC_INTERLEAVE)
 120         || (state->proc_status[i].state == MC_MORE_INTERLEAVE))
 121       size++;
 122   }
 123
 124   return size;
 125 }
 126
 127 int MC_state_process_is_done(mc_state_t state, smx_process_t process)
 128 {
 129   return state->proc_status[process->pid].state == MC_DONE ? TRUE : FALSE;
 130 }
 131
 132 void MC_state_set_executed_request(mc_state_t state, smx_simcall_t req,
 133                                    int value)
 134 {
 135   state->executed_req = *req;
 136   state->req_num = value;
 137   smx_process_t process = NULL;
 138   mc_procstate_t procstate = NULL;
 139
 140   /* The waitany and testany request are transformed into a wait or test request over the
 141    * corresponding communication action so it can be treated later by the dependence
 142    * function. */
 143   switch (req->call) {
 144   case SIMCALL_COMM_WAITANY:
 145     state->internal_req.call = SIMCALL_COMM_WAIT;
 146     state->internal_req.issuer = req->issuer;
 147     MC_process_read_dynar_element(&mc_model_checker->process,
 148       &state->internal_comm, simcall_comm_waitany__get__comms(req),
 149       sizeof(state->internal_comm));
 150     simcall_comm_wait__set__comm(&state->internal_req, &state->internal_comm);
 151     simcall_comm_wait__set__timeout(&state->internal_req, 0);
 152     break;
 153
 154   case SIMCALL_COMM_TESTANY:
 155     state->internal_req.call = SIMCALL_COMM_TEST;
 156     state->internal_req.issuer = req->issuer;
 157
 158     if (value > 0)
 159       // FIXME, read from remote process
 160         MC_process_read_dynar_element(&mc_model_checker->process,
 161           &state->internal_comm, simcall_comm_testany__get__comms(req),
 162           sizeof(state->internal_comm));
 163
 164     simcall_comm_test__set__comm(&state->internal_req, &state->internal_comm);
 165     simcall_comm_test__set__result(&state->internal_req, value);
 166     break;
 167
 168   case SIMCALL_COMM_WAIT:
 169     state->internal_req = *req;
 170     MC_process_read_simple(&mc_model_checker->process, &state->internal_comm ,
 171       simcall_comm_wait__get__comm(req), sizeof(state->internal_comm));
 172     simcall_comm_wait__set__comm(&state->executed_req, &state->internal_comm);
 173     simcall_comm_wait__set__comm(&state->internal_req, &state->internal_comm);
 174     break;
 175
 176   case SIMCALL_COMM_TEST:
 177     state->internal_req = *req;
 178     MC_process_read_simple(&mc_model_checker->process, &state->internal_comm,
 179       simcall_comm_test__get__comm(req), sizeof(state->internal_comm));
 180     simcall_comm_test__set__comm(&state->executed_req, &state->internal_comm);
 181     simcall_comm_test__set__comm(&state->internal_req, &state->internal_comm);
 182     break;
 183
 184   case SIMCALL_MC_RANDOM:
 185     state->internal_req = *req;
 186     int random_max = simcall_mc_random__get__max(req);
 187     if (value != random_max) {
 188       MC_EACH_SIMIX_PROCESS(process,
 189         procstate = &state->proc_status[process->pid];
 190         const smx_process_t issuer = MC_smx_simcall_get_issuer(req);
 191         if (process->pid == issuer->pid) {
 192           procstate->state = MC_MORE_INTERLEAVE;
 193           break;
 194         }
 195       );
 196     }
 197     break;
 198
 199   default:
 200     state->internal_req = *req;
 201     break;
 202   }
 203 }
 204
 205 smx_simcall_t MC_state_get_executed_request(mc_state_t state, int *value)
 206 {
 207   *value = state->req_num;
 208   return &state->executed_req;
 209 }
 210
 211 smx_simcall_t MC_state_get_internal_request(mc_state_t state)
 212 {
 213   return &state->internal_req;
 214 }
 215
 216 smx_simcall_t MC_state_get_request(mc_state_t state, int *value)
 217 {
 218   smx_process_t process = NULL;
 219   mc_procstate_t procstate = NULL;
 220   unsigned int start_count;
 221   smx_synchro_t act = NULL;
 222
 223   MC_EACH_SIMIX_PROCESS(process,
 224     procstate = &state->proc_status[process->pid];
 225
 226     if (procstate->state != MC_INTERLEAVE
 227         && procstate->state != MC_MORE_INTERLEAVE)
 228         continue;
 229     if (!MC_process_is_enabled(process))
 230       continue;
 231
 232     switch (process->simcall.call) {
 233         case SIMCALL_COMM_WAITANY:
 234           *value = -1;
 235           while (procstate->interleave_count <
 236                 MC_process_read_dynar_length(&mc_model_checker->process,
 237                   simcall_comm_waitany__get__comms(&process->simcall))) {
 238             if (MC_request_is_enabled_by_idx
 239                 (&process->simcall, procstate->interleave_count++)) {
 240               *value = procstate->interleave_count - 1;
 241               break;
 242             }
 243           }
 244
 245           if (procstate->interleave_count >=
 246               MC_process_read_dynar_length(&mc_model_checker->process,
 247                 simcall_comm_waitany__get__comms(&process->simcall)))
 248             procstate->state = MC_DONE;
 249
 250           if (*value != -1)
 251             return &process->simcall;
 252
 253           break;
 254
 255         case SIMCALL_COMM_TESTANY:
 256           start_count = procstate->interleave_count;
 257           *value = -1;
 258           while (procstate->interleave_count <
 259                   MC_process_read_dynar_length(&mc_model_checker->process,
 260                     simcall_comm_testany__get__comms(&process->simcall))) {
 261             if (MC_request_is_enabled_by_idx
 262                 (&process->simcall, procstate->interleave_count++)) {
 263               *value = procstate->interleave_count - 1;
 264               break;
 265             }
 266           }
 267
 268           if (procstate->interleave_count >=
 269               MC_process_read_dynar_length(&mc_model_checker->process,
 270                 simcall_comm_testany__get__comms(&process->simcall)))
 271             procstate->state = MC_DONE;
 272
 273           if (*value != -1 || start_count == 0)
 274             return &process->simcall;
 275
 276           break;
 277
 278         case SIMCALL_COMM_WAIT:
 279           act = simcall_comm_wait__get__comm(&process->simcall);
 280           if (act->comm.src_proc && act->comm.dst_proc) {
 281             *value = 0;
 282           } else {
 283             if (act->comm.src_proc == NULL && act->comm.type == SIMIX_COMM_READY
 284                 && act->comm.detached == 1)
 285               *value = 0;
 286             else
 287               *value = -1;
 288           }
 289           procstate->state = MC_DONE;
 290           return &process->simcall;
 291
 292           break;
 293
 294         case SIMCALL_MC_RANDOM:
 295           if (procstate->state == MC_INTERLEAVE)
 296             *value = 0;
 297           else {
 298             if (state->req_num < simcall_mc_random__get__max(&process->simcall))
 299               *value = state->req_num + 1;
 300           }
 301           procstate->state = MC_DONE;
 302           return &process->simcall;
 303           break;
 304
 305         default:
 306           procstate->state = MC_DONE;
 307           *value = 0;
 308           return &process->simcall;
 309           break;
 310
 311     }
 312   );
 313
 314   return NULL;
 315 }