Perl generated test on structures (exaustivity)

[simgrid.git] / testsuite / xbt / dynar_string.c

diff --git a/testsuite/xbt/dynar_string.c b/testsuite/xbt/dynar_string.c
index 6b82126..6651a46 100644 (file)
--- a/testsuite/xbt/dynar_string.c
+++ b/testsuite/xbt/dynar_string.c
@@ -11,6 +11,9 @@
 #include <stdio.h>
 #include <gras.h>
 
+/* NB_ELEM HAS to be a multiple of 5 */
+#define NB_ELEM 5000
+
 void free_string(void *d);
 
 void free_string(void *d){
@@ -24,29 +27,40 @@ int main(int argc,char *argv[]) {
    char buf[1024];
    char *s1,*s2;
    
-   fprintf(stderr,"==== Push 5000 strings, set them again 3 times, shift them\n");
+   gras_init_defaultlog(&argc,argv,"dynar.thresh=debug");
+   
+   fprintf(stderr,"==== Traverse the empty dynar\n");
+   TRYFAIL(gras_dynar_new(&d,sizeof(char *),&free_string));
+   gras_dynar_foreach(d,cpt,s1){
+     fprintf(stderr,
+            "Damnit, there is something in the empty dynar\n");
+     abort();
+   }
+   gras_dynar_free(d);
+
+   fprintf(stderr,"==== Push %d strings, set them again 3 times, shift them\n",NB_ELEM);
    TRYFAIL(gras_dynar_new(&d,sizeof(char*),&free_string));
-   for (cpt=0; cpt< 5000; cpt++) {
+   for (cpt=0; cpt< NB_ELEM; cpt++) {
      sprintf(buf,"%d",cpt);
      s1=strdup(buf);
      TRYFAIL(gras_dynar_push(d,&s1));
    }
-   for (cpt=0; cpt< 5000; cpt++) {
+   for (cpt=0; cpt< NB_ELEM; cpt++) {
      sprintf(buf,"%d",cpt);
      s1=strdup(buf);
      TRYFAIL(gras_dynar_remplace(d,cpt,&s1));
    }
-   for (cpt=0; cpt< 5000; cpt++) {
+   for (cpt=0; cpt< NB_ELEM; cpt++) {
      sprintf(buf,"%d",cpt);
      s1=strdup(buf);
      TRYFAIL(gras_dynar_remplace(d,cpt,&s1));
    }
-   for (cpt=0; cpt< 5000; cpt++) {
+   for (cpt=0; cpt< NB_ELEM; cpt++) {
      sprintf(buf,"%d",cpt);
      s1=strdup(buf);
      TRYFAIL(gras_dynar_remplace(d,cpt,&s1));
    }
-   for (cpt=0; cpt< 5000; cpt++) {
+   for (cpt=0; cpt< NB_ELEM; cpt++) {
      sprintf(buf,"%d",cpt);
      gras_dynar_shift(d,&s2);
      if (strcmp(buf,s2)) {
@@ -60,14 +74,23 @@ int main(int argc,char *argv[]) {
    gras_dynar_free(d);
 
 
-   fprintf(stderr,"==== Unshift/pop 5000 strings\n");
+   fprintf(stderr,"==== Unshift, traverse and pop %d strings\n",NB_ELEM);
    TRYFAIL(gras_dynar_new(&d,sizeof(char**),&free_string));
-   for (cpt=0; cpt< 5000; cpt++) {
+   for (cpt=0; cpt< NB_ELEM; cpt++) {
      sprintf(buf,"%d",cpt);
      s1=strdup(buf);
      TRYFAIL(gras_dynar_unshift(d,&s1));
    }
-   for (cpt=0; cpt< 5000; cpt++) {
+   gras_dynar_foreach(d,cpt,s1) {
+     sprintf(buf,"%d",NB_ELEM - cpt -1);
+     if (strcmp(buf,s1)) {
+       fprintf(stderr,
+           "The retrieved value is not the same than the injected one (%s!=%s)\n",
+              buf,s1);
+       abort();
+     }
+   }
+   for (cpt=0; cpt< NB_ELEM; cpt++) {
      sprintf(buf,"%d",cpt);
      gras_dynar_pop(d,&s2);
      if (strcmp(buf,s2)) {
@@ -82,20 +105,20 @@ int main(int argc,char *argv[]) {
 
 
 
-   fprintf(stderr,"==== Push 5000 strings, insert 1000 strings in the middle, shift everything\n");
+   fprintf(stderr,"==== Push %d strings, insert %d strings in the middle, shift everything\n",NB_ELEM,NB_ELEM/5);
    TRYFAIL(gras_dynar_new(&d,sizeof(char*),&free_string));
-   for (cpt=0; cpt< 5000; cpt++) {
+   for (cpt=0; cpt< NB_ELEM; cpt++) {
      sprintf(buf,"%d",cpt);
      s1=strdup(buf);
      TRYFAIL(gras_dynar_push(d,&s1));
    }
-   for (cpt=0; cpt< 1000; cpt++) {
+   for (cpt=0; cpt< NB_ELEM/5; cpt++) {
      sprintf(buf,"%d",cpt);
      s1=strdup(buf);
-     TRYFAIL(gras_dynar_insert_at(d,2500,&s1));
+     TRYFAIL(gras_dynar_insert_at(d,NB_ELEM/2,&s1));
    }
 
-   for (cpt=0; cpt< 2500; cpt++) {
+   for (cpt=0; cpt< NB_ELEM/2; cpt++) {
      sprintf(buf,"%d",cpt);
      gras_dynar_shift(d,&s2);
      if (strcmp(buf,s2)) {
@@ -106,7 +129,7 @@ int main(int argc,char *argv[]) {
      }
      free(s2);
    }
-   for (cpt=999; cpt>=0; cpt--) {
+   for (cpt=(NB_ELEM/5)-1; cpt>=0; cpt--) {
      sprintf(buf,"%d",cpt);
      gras_dynar_shift(d,&s2);
      if (strcmp(buf,s2)) {
@@ -117,7 +140,7 @@ int main(int argc,char *argv[]) {
      }
      free(s2);
    }
-   for (cpt=2500; cpt< 5000; cpt++) {
+   for (cpt=NB_ELEM/2; cpt< NB_ELEM; cpt++) {
      sprintf(buf,"%d",cpt);
      gras_dynar_shift(d,&s2);
      if (strcmp(buf,s2)) {
@@ -131,16 +154,16 @@ int main(int argc,char *argv[]) {
    gras_dynar_free(d);
 
 
-   fprintf(stderr,"==== Push 5000 strings, remove 2000-4000. free the rest\n");
+   fprintf(stderr,"==== Push %d strings, remove %d-%d. free the rest\n",NB_ELEM,2*(NB_ELEM/5),4*(NB_ELEM/5));
    TRYFAIL(gras_dynar_new(&d,sizeof(char*),&free_string));
-   for (cpt=0; cpt< 5000; cpt++) {
+   for (cpt=0; cpt< NB_ELEM; cpt++) {
      sprintf(buf,"%d",cpt);
      s1=strdup(buf);
      TRYFAIL(gras_dynar_push(d,&s1));
    }
-   for (cpt=2000; cpt< 4000; cpt++) {
+   for (cpt=2*(NB_ELEM/5); cpt< 4*(NB_ELEM/5); cpt++) {
      sprintf(buf,"%d",cpt);
-     gras_dynar_remove_at(d,2000,&s2);
+     gras_dynar_remove_at(d,2*(NB_ELEM/5),&s2);
      if (strcmp(buf,s2)) {
        fprintf(stderr,
            "Remove a bad value. Got %s, expected %s\n",
@@ -151,5 +174,6 @@ int main(int argc,char *argv[]) {
    }
    gras_dynar_free(d);
 
+   gras_exit();
    return 0;
 }