new_state->heap_bytes_used = mmalloc_get_bytes_used(std_heap);
new_state->nb_processes = xbt_swag_size(simix_global->process_list);
new_state->system_state = MC_take_snapshot();
- new_state->num = mc_stats->expanded_states - 1;
+ new_state->num = mc_stats->expanded_states;
return new_state;
state_test = (mc_visited_state_t)xbt_dynar_get_as(visited_states, cursor, mc_visited_state_t);
bytes_used_test = state_test->heap_bytes_used;
nb_processes_test = state_test->nb_processes;
- if(nb_processes_test < current_nb_processes)
+ if(nb_processes_test < current_nb_processes){
start = cursor + 1;
- if(nb_processes_test > current_nb_processes)
- end = cursor - 1;
- if(nb_processes_test == current_nb_processes){
+ }else if(nb_processes_test > current_nb_processes){
+ end = cursor - 1;
+ }else if(nb_processes_test == current_nb_processes){
if(bytes_used_test < current_bytes_used)
start = cursor + 1;
if(bytes_used_test > current_bytes_used)
if(bytes_used_test == current_bytes_used){
same_processes_and_bytes_not_found = 0;
if(snapshot_compare(new_state->system_state, state_test->system_state) == 0){
- xbt_dynar_remove_at(visited_states, cursor, NULL);
- xbt_dynar_insert_at(visited_states, cursor, &new_state);
XBT_DEBUG("State %d already visited ! (equal to state %d)", new_state->num, state_test->num);
if(raw_mem_set)
MC_SET_RAW_MEM;
if(bytes_used_test != current_bytes_used)
break;
if(snapshot_compare(new_state->system_state, state_test->system_state) == 0){
- xbt_dynar_remove_at(visited_states, previous_cursor, NULL);
- xbt_dynar_insert_at(visited_states, previous_cursor, &new_state);
XBT_DEBUG("State %d already visited ! (equal to state %d)", new_state->num, state_test->num);
if(raw_mem_set)
MC_SET_RAW_MEM;
if(bytes_used_test != current_bytes_used)
break;
if(snapshot_compare(new_state->system_state, state_test->system_state) == 0){
- xbt_dynar_remove_at(visited_states, next_cursor, NULL);
- xbt_dynar_insert_at(visited_states, next_cursor, &new_state);
XBT_DEBUG("State %d already visited ! (equal to state %d)", new_state->num, state_test->num);
if(raw_mem_set)
MC_SET_RAW_MEM;
void MC_dpor(void)
{
- char *req_str;
+ char *req_str = NULL;
int value;
smx_simcall_t req = NULL, prev_req = NULL;
mc_state_t state = NULL, prev_state = NULL, next_state = NULL, restore_state=NULL;
xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_safety));
XBT_DEBUG("**************************************************");
- XBT_DEBUG("Exploration depth=%d (state=%p)(%u interleave)",
- xbt_fifo_size(mc_stack_safety), state,
+ XBT_DEBUG("Exploration depth=%d (state=%p, num %d)(%u interleave)",
+ xbt_fifo_size(mc_stack_safety), state, state->num,
MC_state_interleave_size(state));
/* Update statistics */
xbt_free(req_str);
}
+ MC_SET_RAW_MEM;
if(dot_output != NULL)
req_str = MC_request_get_dot_output(req, value);
+ MC_UNSET_RAW_MEM;
MC_state_set_executed_request(state, req, value);
mc_stats->executed_transitions++;
xbt_free(key);
}
}
-
- MC_UNSET_RAW_MEM;
-
+
if(dot_output != NULL)
xbt_free(req_str);
+ MC_UNSET_RAW_MEM;
+
/* Let's loop again */
/* The interleave set is empty or the maximum depth is reached, let's back-track */
XBT_DEBUG("Back-tracking to depth %d", xbt_fifo_size(mc_stack_safety));
break;
} else {
+ XBT_DEBUG("Delete state at depth %d",xbt_fifo_size(mc_stack_safety) + 1);
MC_state_delete(state);
}
}