1 /* Copyright (c) 2008-2012 Da SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #include "../simix/smx_private.h"
8 #include "mc_private.h"
11 * \brief Creates a state data structure used by the exploration algorithm
13 mc_state_t MC_state_new()
15 mc_state_t state = NULL;
17 state = xbt_new0(s_mc_state_t, 1);
18 state->max_pid = simix_process_maxpid;
19 state->proc_status = xbt_new0(s_mc_procstate_t, state->max_pid);
20 state->system_state = NULL;
22 mc_stats->expanded_states++;
26 mc_state_t MC_state_pair_new(void)
28 mc_state_t state = NULL;
30 state = xbt_new0(s_mc_state_t, 1);
31 state->max_pid = simix_process_maxpid;
32 state->proc_status = xbt_new0(s_mc_procstate_t, state->max_pid);
34 //mc_stats->expanded_states++;
39 * \brief Deletes a state data structure
40 * \param trans The state to be deleted
42 void MC_state_delete(mc_state_t state)
44 if(state->system_state)
45 MC_free_snapshot(state->system_state);
46 xbt_free(state->proc_status);
50 void MC_state_interleave_process(mc_state_t state, smx_process_t process)
52 state->proc_status[process->pid].state = MC_INTERLEAVE;
53 state->proc_status[process->pid].interleave_count = 0;
56 void MC_state_remove_interleave_process(mc_state_t state, smx_process_t process)
58 if(state->proc_status[process->pid].state == MC_INTERLEAVE)
59 state->proc_status[process->pid].state = MC_DONE;
62 unsigned int MC_state_interleave_size(mc_state_t state)
64 unsigned int i, size=0;
66 for(i=0; i < state->max_pid; i++){
67 if(state->proc_status[i].state == MC_INTERLEAVE)
74 int MC_state_process_is_done(mc_state_t state, smx_process_t process){
75 return state->proc_status[process->pid].state == MC_DONE ? TRUE : FALSE;
78 void MC_state_set_executed_request(mc_state_t state, smx_simcall_t req, int value)
80 state->executed_req = *req;
81 state->req_num = value;
83 /* The waitany and testany request are transformed into a wait or test request over the
84 * corresponding communication action so it can be treated later by the dependence
87 case SIMCALL_COMM_WAITANY:
88 state->internal_req.call = SIMCALL_COMM_WAIT;
89 state->internal_req.issuer = req->issuer;
90 state->internal_comm = *xbt_dynar_get_as(simcall_comm_waitany__get__comms(req), value, smx_action_t);
91 simcall_comm_wait__set__comm(&state->internal_req, &state->internal_comm);
92 simcall_comm_wait__set__timeout(&state->internal_req, 0);
95 case SIMCALL_COMM_TESTANY:
96 state->internal_req.call = SIMCALL_COMM_TEST;
97 state->internal_req.issuer = req->issuer;
100 state->internal_comm = *xbt_dynar_get_as(simcall_comm_testany__get__comms(req), value, smx_action_t);
102 simcall_comm_test__set__comm(&state->internal_req, &state->internal_comm);
103 simcall_comm_test__set__result(&state->internal_req, value);
106 case SIMCALL_COMM_WAIT:
107 state->internal_req = *req;
108 state->internal_comm = *(simcall_comm_wait__get__comm(req));
109 simcall_comm_wait__set__comm(&state->executed_req, &state->internal_comm);
110 simcall_comm_wait__set__comm(&state->internal_req, &state->internal_comm);
113 case SIMCALL_COMM_TEST:
114 state->internal_req = *req;
115 state->internal_comm = *simcall_comm_test__get__comm(req);
116 simcall_comm_test__set__comm(&state->executed_req, &state->internal_comm);
117 simcall_comm_test__set__comm(&state->internal_req, &state->internal_comm);
120 case SIMCALL_MC_RANDOM:
121 state->internal_req = *req;
122 simcall_mc_random__set__result(&state->internal_req, value);
126 state->internal_req = *req;
131 smx_simcall_t MC_state_get_executed_request(mc_state_t state, int *value)
133 *value = state->req_num;
134 return &state->executed_req;
137 smx_simcall_t MC_state_get_internal_request(mc_state_t state)
139 return &state->internal_req;
142 smx_simcall_t MC_state_get_request(mc_state_t state, int *value)
144 smx_process_t process = NULL;
145 mc_procstate_t procstate = NULL;
146 unsigned int start_count;
149 static int first = 0;
155 xbt_swag_foreach(process, simix_global->process_list){
156 procstate = &state->proc_status[process->pid];
158 if(procstate->state == MC_INTERLEAVE){
159 if(MC_process_is_enabled(process)){
160 switch(process->simcall.call){
161 case SIMCALL_COMM_WAITANY:
163 while(procstate->interleave_count < xbt_dynar_length(simcall_comm_waitany__get__comms(&process->simcall))){
164 if(MC_request_is_enabled_by_idx(&process->simcall, procstate->interleave_count++)){
165 *value = procstate->interleave_count-1;
170 if(procstate->interleave_count >= xbt_dynar_length(simcall_comm_waitany__get__comms(&process->simcall)))
171 procstate->state = MC_DONE;
174 return &process->simcall;
178 case SIMCALL_COMM_TESTANY:
179 start_count = procstate->interleave_count;
181 while(procstate->interleave_count < xbt_dynar_length(simcall_comm_testany__get__comms(&process->simcall))){
182 if(MC_request_is_enabled_by_idx(&process->simcall, procstate->interleave_count++)){
183 *value = procstate->interleave_count - 1;
188 if(procstate->interleave_count >= xbt_dynar_length(simcall_comm_testany__get__comms(&process->simcall)))
189 procstate->state = MC_DONE;
191 if(*value != -1 || start_count == 0)
192 return &process->simcall;
196 case SIMCALL_COMM_WAIT:
197 if(simcall_comm_wait__get__comm(&process->simcall)->comm.src_proc
198 && simcall_comm_wait__get__comm(&process->simcall)->comm.dst_proc){
203 procstate->state = MC_DONE;
204 return &process->simcall;
208 case SIMCALL_MC_RANDOM:
209 min = simcall_mc_random__get__min(&process->simcall);
210 max = simcall_mc_random__get__max(&process->simcall);
211 *value = (int)((rand() % ((max-min)+1)) + min);
212 procstate->state = MC_DONE;
213 return &process->simcall;
217 procstate->state = MC_DONE;
219 return &process->simcall;