double date;
unsigned long seedx= 0;
-int myrand();
-inline int myrand() {
+int myrand(void);
+int myrand(void) {
seedx=seedx * 16807 % 2147483647;
return seedx%1000;
}
}
}
- printf("Starting to solve(%i,%i,%i)\n",myrand()%1000,myrand()%1000,myrand()%1000);
+ printf("Starting to solve(%i)\n",myrand()%1000);
date = xbt_os_time() * 1000000;
lmm_solve(Sys);
date = xbt_os_time() * 1000000 - date;
- if(mode==1){
+ if(mode==2){
printf("Max concurrency:\n");
l=0;
for (i = 0; i < nb_cnst; i++) {
lmm_constraint_concurrency_maximum_reset(cnst[i]);
xbt_assert(!lmm_constraint_concurrency_maximum_get(cnst[i]));
if(i%10==9)
- printf("\n");
+ printf("\n");
}
printf("\nTotal maximum concurrency is %i\n",l);
for(i=0;i<testcount;i++){
seedx=i+1;
- printf("Starting %i: (%i,%i,%i)\n",i,myrand()%1000,myrand()%1000,myrand()%1000);
+ printf("Starting %i: (%i)\n",i,myrand()%1000);
test(nb_cnst, nb_var, nb_elem, pw_base_limit, pw_max_limit, rate_no_limit,max_share,mode);
acc_date+=date;
acc_date2+=date*date;