1 #include "../simix/private.h"
5 static void MC_state_add_transition(mc_state_t state, mc_transition_t trans);
8 * \brief Creates a state data structure used by the exploration algorithm
10 mc_state_t MC_state_new(void)
12 mc_state_t state = NULL;
14 state = xbt_new0(s_mc_state_t, 1);
15 state->max_pid = simix_process_maxpid;
16 state->interleave = xbt_new0(char, state->max_pid);
18 mc_stats->expanded_states++;
23 * \brief Deletes a state data structure
24 * \param trans The state to be deleted
26 void MC_state_delete(mc_state_t state)
28 xbt_free(state->interleave);
32 void MC_state_add_to_interleave(mc_state_t state, smx_process_t process)
34 state->interleave[process->pid] = 1;
37 unsigned int MC_state_interleave_size(mc_state_t state)
39 unsigned int i, size=0;
41 for(i=0; i < state->max_pid; i++){
42 if(state->interleave[i] != 0 && state->interleave[i] != -1)
49 int MC_state_process_is_done(mc_state_t state, smx_process_t process){
50 return state->interleave[process->pid] == -1 ? TRUE : FALSE;
53 void MC_state_set_executed_request(mc_state_t state, smx_req_t req)
55 state->executed = *req;
58 smx_req_t MC_state_get_executed_request(mc_state_t state)
60 return &state->executed;
63 smx_req_t MC_state_get_request(mc_state_t state, char *value)
66 smx_process_t process = NULL;
68 for(i=0; i < state->max_pid; i++){
69 if(state->interleave[i] > 0){
70 *value = state->interleave[i]--;
72 /* If 0 was reached means that the process is done, so we
73 * set it's value to -1 (the "done" value) */
74 if(state->interleave[i] == 0)
75 state->interleave[i]--;
77 /* FIXME: SIMIX should implement a process table indexed by pid */
78 /* So we should use that instead of traversing the swag */
79 xbt_swag_foreach(process, simix_global->process_list){
84 if(SIMIX_process_is_enabled(process))
85 return &process->request;