[numerics] fix segfault
@@ -359,10 +359,10 @@ void lcp_pivot_covering_vector(LinearComplementarityProblem* problem, double* re
case SICONOS_LCP_PIVOT_LEMKE:
case SICONOS_LCP_PIVOT_PATHSEARCH:
*info = LCP_PIVOT_RAY_TERMINATION;
- DEBUG_PRINT("The pivot column is nonpositive ! We are on ray !\n"
+ printf("The pivot column is nonpositive ! We are on ray !\n"
"It either means that the algorithm failed or that the LCP is infeasible\n"
"Check the class of the M matrix to find out the meaning of this\n");
- goto exit_lcp_pivot;
+ goto _exit;
default:
bck_drive = drive < dim + 1 ? drive - 1 : drive - dim - 2;
}
@@ -550,6 +550,8 @@ exit_lcp_pivot:
}
}
+_exit:
+
if (*info > 0)
{
DEBUG_PRINT("No solution found !\n");
